wanyu/IteraTeR_v2 huggingface dataset:
Original:  This relationship has been linked to the number of signals a decision-maker receives in a social network , but it is unclear if these same principles hold when the "pattern " by it receives these signals vary and when potential decisions have different utilities .
Revised:  This relationship has been linked to the number of signals a decision-maker receives in a social network , but it is unclear if these same principles hold when the pattern by which it receives these signals vary and when potential decisions have different utilities .
Edit intent: clarity
Original:  This relationship has been linked to the number of signals a decision-maker receives in a social network , but it is unclear if these same principles hold when the "pattern " by it receives these signals vary and when potential decisions have different utilities .
Revised:  This relationship has been linked to the number of signals a decision-maker receives in a social network , but it is unclear if these same principles hold when the "pattern " by it receives these signals vary and when peer influence is directed towards choices which are not optimal .
Edit intent: clarity
Original:  To better understand how social influence affects an individual's uncertainty which cannot always be observed in experiments of decision making , we use our behavioral findings to simulate  dynamics in real world case studies through multi-agent models .
Revised:  To better understand how social influence affects an individual's uncertainty which cannot always be observed in experiments of decision making , we use our behavioral findings to simulate dynamics in real world case studies .
Edit intent: clarity
Original:  Our simulation results indicate that while sequential peer effects from the influence decision overcome individual uncertainty to guide faster  diffusion over time , the control that peer influence has over decision making can itself be affected when influence is delayed and user uncertainty comes into play .
Revised:  Our simulation results indicate that sequential peer effects from the influence decision overcome individual uncertainty to guide faster diffusion over time , the control that peer influence has over decision making can itself be affected when influence is delayed and user uncertainty comes into play .
Edit intent: clarity
Original:  Our simulation results indicate that while sequential peer effects from the influence decision overcome individual uncertainty to guide faster  diffusion over time , the control that peer influence has over decision making can itself be affected when influence is delayed and user uncertainty comes into play .
Revised:  Our simulation results indicate that while sequential peer effects from the influence decision overcomes individual uncertainty to guide faster diffusion over time , the control that peer influence has over decision making can itself be affected when influence is delayed and user uncertainty comes into play .
Edit intent: fluency
Original:  Our simulation results indicate that while sequential peer effects from the influence decision overcome individual uncertainty to guide faster  diffusion over time , the control that peer influence has over decision making can itself be affected when influence is delayed and user uncertainty comes into play .
Revised:  Our simulation results indicate that while sequential peer effects from the influence decision overcome individual uncertainty to guide faster rumor diffusion over time , the control that peer influence has over decision making can itself be affected when influence is delayed and user uncertainty comes into play .
Edit intent: fluency
Original:  Our simulation results indicate that while sequential peer effects from the influence decision overcome individual uncertainty to guide faster  diffusion over time , the control that peer influence has over decision making can itself be affected when influence is delayed and user uncertainty comes into play .
Revised:  Our simulation results indicate that while sequential peer effects from the influence decision overcome individual uncertainty to guide faster diffusion over time . However, when the rate of diffusion is slow in the beginning, user uncertainty can have a substantial role compared to peer influence in deciding the adoption trajectory of a piece of questionable information .
Edit intent: clarity
Original:  In particular, our model can easily be applied to groups of images, arbitrary text embeddings, and integrate well with deep neural networks.
Revised:  In particular, our model can easily be applied to groups of images, arbitrary text embeddings, and integrates well with deep neural networks.
Edit intent: fluency
Original:  For this model, a dynamic programming characterization of the value  (if it exists) is presented.
Revised:  In this model, a dynamic programming characterization of the value (if it exists) is presented.
Edit intent: fluency
Original:  For this model, a dynamic programming characterization of the value  (if it exists) is presented.
Revised:  For this model, a dynamic programming characterization of the value of the game (if it exists) is presented.
Edit intent: clarity
Original:  If the value of the zero-sum game does not exist, then the dynamic program provides bounds on the upper and lower values of the zero-sum game.
Revised:  If the value of the zero-sum game does not exist, then the dynamic program provides bounds on the upper and lower values of the game.
Edit intent: fluency
Original:  For such games,  the value exists and can be characterized using the dynamic program.
Revised:  For such games, it is shown that the value exists and can be characterized using the dynamic program.
Edit intent: clarity
Original:  It is further shown that for this class of games, there exists a Nash equilibrium where the more informed player plays a common information belief based strategy and , this strategy can be computed using the dynamic program .
Revised:  It is further shown that for this class of games, the dynamic program can be used to compute an equilibrium strategy for the more informed player plays a common information belief based strategy and , this strategy can be computed using the dynamic program .
Edit intent: clarity
Original:  This class includes site percolation on\pm  the square lattice and on the hypercubic lattice in any dimension  .
Revised:  This class includes site percolation on\pm the square lattice and the hypercubic lattice in any dimension .
Edit intent: fluency
Original:  By taking advantage of the Logarithmic Image Processing (LIP) context, we study two novel functional metrics: i) the LIP-multiplicative Asplund 's metric which is robust to object absorption variations and ii) the LIP-additive Asplund 's metric which is robust to variations of source intensity and exposure-time.
Revised:  By taking advantage of the Logarithmic Image Processing (LIP) context, we study two novel functional metrics: i) the LIP-multiplicative Asplund metric which is robust to object absorption variations and ii) the LIP-additive Asplund 's metric which is robust to variations of source intensity and exposure-time.
Edit intent: fluency
Original:  By taking advantage of the Logarithmic Image Processing (LIP) context, we study two novel functional metrics: i) the LIP-multiplicative Asplund 's metric which is robust to object absorption variations and ii) the LIP-additive Asplund 's metric which is robust to variations of source intensity and exposure-time.
Revised:  By taking advantage of the Logarithmic Image Processing (LIP) context, we study two novel functional metrics: i) the LIP-multiplicative Asplund 's metric which is robust to object absorption variations and ii) the LIP-additive Asplund metric which is robust to variations of source intensity and exposure-time.
Edit intent: fluency
Original:  By taking advantage of the Logarithmic Image Processing (LIP) context, we study two novel functional metrics: i) the LIP-multiplicative Asplund 's metric which is robust to object absorption variations and ii) the LIP-additive Asplund 's metric which is robust to variations of source intensity and exposure-time.
Revised:  By taking advantage of the Logarithmic Image Processing (LIP) context, we study two novel functional metrics: i) the LIP-multiplicative Asplund 's metric which is robust to object absorption variations and ii) the LIP-additive Asplund 's metric which is robust to variations of source intensity or camera exposure-time.
Edit intent: clarity
Original:  We assess them in various situations with different lightings and movements . Results show that those maps of distances are robust to lighting variations.
Revised:  We assess them in various situations with different lightings and movement . Results show that those maps of distances are robust to lighting variations.
Edit intent: fluency
Original:  In this paper we discuss a generic approach for deobfuscation and recompilation of obfuscated code based on the compiler framework LLVM . We show how binary code can be lifted back into the compiler intermediate language LLVM-IR and explain how we recover the control flow graph of an obfuscated binary function with an iterative control flow graph construction algorithm \mbox{ biondi:hal-01241356 based on compiler optimizations and SMT solving.
Revised:  In this paper we discuss a generic approach for deobfuscation and recompilation of obfuscated code based on the compiler framework LLVM . We show how binary code can be lifted back into the compiler intermediate language LLVM-IR and explain how we recover the control flow graph of an obfuscated binary function with an iterative control flow graph construction algorithm \mbox{ biondi:hal-01241356 based on compiler optimizations and SMT solving.
Edit intent: fluency
Original:  Our approach does not make any assumptions about the obfuscated code, but instead uses strong compiler optimizations available in LLVM andSouper Optimizer to simplify away the obfuscation.
Revised:  Our approach does not make any assumptions about the obfuscated code, but instead uses strong compiler optimizations available in andSouper Optimizer to simplify away the obfuscation.
Edit intent: clarity
Original:  Our approach does not make any assumptions about the obfuscated code, but instead uses strong compiler optimizations available in LLVM andSouper Optimizer to simplify away the obfuscation.
Revised:  Our approach does not make any assumptions about the obfuscated code, but instead uses strong compiler optimizations available in LLVM Souper Optimizer to simplify away the obfuscation.
Edit intent: fluency
Original:  The recovered LLVM-IR can be further processed by custom deobfuscation passes that are now applied at the same level as the injected obfuscation techniques or recompiled with one of the available LLVM backends.
Revised:  The recovered LLVM-IR can be further processed by custom deobfuscation passes that are now applied at the same level as the injected obfuscation techniques or recompiled with one of the available LLVM backends.
Edit intent: fluency
Original:  The presented work is implemented in a deobfuscation tool called SATURN
Revised:  The presented work is implemented in a deobfuscation tool called SATURN.
Edit intent: fluency
Original:  This setup was proposed in 1 where an achievable rate and an information-theoretic lower bound were derived.
Revised:  This setup was 1 where an achievable rate and an information-theoretic lower bound were derived.
Edit intent: clarity
Original:  This is  significant improvement over the gap result in 1 , albeit under the restriction of uncoded placement policies.
Revised:  This is a significant improvement over the gap result in 1 , albeit under the restriction of uncoded placement policies.
Edit intent: fluency
Original:  This is  significant improvement over the gap result in 1 , albeit under the restriction of uncoded placement policies.
Revised:  This is significant improvement over the 1 , albeit under the restriction of uncoded placement policies.
Edit intent: clarity
Original: Fractals2019 started as a new experimental entry in the RoboCup Soccer 2D Simulation League, based on Gliders2d code base, and advanced to a team winning RoboCup-2019 championship.
Revised: Fractals2019 started as a new experimental entry in the RoboCup Soccer 2D Simulation League, based on Gliders2d code base, and advanced to become a RoboCup-2019 championship.
Edit intent: clarity
Original:  Our approach is centred on combinatorial optimisation methods, within the framework of Guided Self-Organisation (GSO) , with the search guided by local constraints.
Revised:  Our approach is centred on combinatorial optimisation methods, within the framework of Guided Self-Organisation , with the search guided by local constraints.
Edit intent: clarity
Original:  We present examples of several tactical tasks based on the fully released Gliders2d code (version v2), including the search for an optimal assignment of heterogeneous player types, as well as blocking behaviours, offside trap, and attacking formations.
Revised:  We present examples of several tactical tasks based on the Gliders2d code (version v2), including the search for an optimal assignment of heterogeneous player types, as well as blocking behaviours, offside trap, and attacking formations.
Edit intent: clarity
Original:  The only way to know the realized state of an item is to probe the item.
Revised:  The only way to know the realized state of an item is to probe that item.
Edit intent: clarity
Original:  We show that our solution is also applied to an online setting.
Revised:  We show that our solution can be extended to an online setting.
Edit intent: clarity
Original:  Without this non-negativity assumption, we show that estimating the bias vector within an error \epsilon requires the number of samples at least exponential in 1/\epsilon^2 . Our algorithm is based on the key observation that vector norms and pairwise angles can be estimated separately.
Revised:  Without this non-negativity assumption, we show that estimating the bias vector within any error requires the number of samples at least exponential in 1/\epsilon^2 . Our algorithm is based on the key observation that vector norms and pairwise angles can be estimated separately.
Edit intent: clarity
Original:  We lack an explanation of how such phenomena can emerge from simple rules of interraction between individuals.
Revised:  We lack an explanation of how such phenomena can emerge from simple rules of interaction between individuals.
Edit intent: fluency
Original:  We apply our model to explain transitions in leadership structures through the Neolithic era, where increasingly unequal alliances were due to technological developments such as food storage and/or weapons .
Revised:  We argue the model can explain transitions in leadership structures through the Neolithic era, where increasingly unequal alliances were due to technological developments such as food storage and/or weapons .
Edit intent: clarity
Original:  In this survey, we cover and discuss the recent datasets released in the VQA domain dealing with various types of question-formats and enabling robustness of the machine-learning models.
Revised:  In this survey, we cover and discuss the recent datasets released in the VQA domain dealing with various types of question-formats and robustness of the machine-learning models.
Edit intent: clarity
Original:  At the end, we present and discuss some of the results computed by us over the vanilla VQA models , Stacked Attention Network and the VQA Challenge 2017 winner model.
Revised:  At the end, we present and discuss some of the results computed by us over the vanilla VQA model , Stacked Attention Network and the VQA Challenge 2017 winner model.
Edit intent: fluency
Original: The fidelity of a deformation simulation is highly dependent upon the underlying constitutive material model.
Edit intent: coherence
Original:  In this work we propose a framework for learning customized models of deformable materials from sparse example surface trajectories.
Revised:  In this work we propose a framework for learning customized models of deformable materials from example surface trajectories.
Edit intent: clarity
Original:  Sparse reduced space-time optimization identifies gentle control forces with which we extract necessary annotated data for model inference and to finally encapsulate the material correction into a compact parametric form.
Revised:  Sparse reduced space-time optimization identifies gentle control forces with which we extract necessary data for model inference and to finally encapsulate the material correction into a compact parametric form.
Edit intent: clarity
Original:  We demonstrate our method with a set of synthetic examples, as well as with data captured from real world homogeneous elastic objects.
Revised:  We demonstrate our method with a set of synthetic examples, as well with data captured from real world homogeneous elastic objects.
Edit intent: fluency
Original:  Evaluation using a corpus of recordings of VoIP conversations, over the Tor network , confirms that recording locations can be fingerprinted and detected remotely with  low false-positive rate  .
Revised:  Evaluation using a corpus of recordings of VoIP conversations, over the Tor network . We show that recording locations can be fingerprinted and detected remotely with low false-positive rate .
Edit intent: clarity
Original:  Evaluation using a corpus of recordings of VoIP conversations, over the Tor network , confirms that recording locations can be fingerprinted and detected remotely with  low false-positive rate  .
Revised:  Evaluation using a corpus of recordings of VoIP conversations, over the Tor network , confirms that recording locations can be fingerprinted and detected remotely with a low false-positive rate .
Edit intent: fluency
Original: A complex interplay of single-neuron properties and the recurrent network structure shapes the activity of individual cortical neurons, which differs in general from the respective population activity .
Revised: A complex interplay of single-neuron properties and the recurrent network structure shapes the activity of cortical neurons. The single-neuron activity statistics differ in general from the respective population activity .
Edit intent: clarity
Original:  We develop a theory that makes it possible to investigate the influence of both network structure and single-neuron properties on the single-neuron statistics in block-structured sparse random networks of spiking neurons.
Revised:  We develop a theory that makes it possible to investigate the influence of both network structure and single-neuron statistics in block-structured sparse random networks of spiking neurons.
Edit intent: clarity
Original:  The theory is based on a postulated extension of dynamic mean-field theory from rate networks to spiking networks, which is validated via simulations.
Revised:  The theory is based on an extension of dynamic mean-field theory from rate networks to spiking networks, which is validated via simulations.
Edit intent: clarity
Original:  It accounts for both static variability, e.g. due to a distributed number of incoming synapses per neuron, and dynamical fluctuations of the input.
Revised:  It accounts for both static variability, e.g. due to a distributed number of incoming synapses per neuron, and temporal fluctuations of the input.
Edit intent: clarity
Original:  To illustrate the theory , we apply it to a balanced random network of leaky integrate-and-fire neurons, a balanced random network of generalized linear model neurons, and a biologically constrained network of leaky integrate-and-fire neurons.
Revised:  We apply the theory to balanced random networks of generalized linear model neurons, balanced random networks of leaky integrate-and-fire neurons, a balanced random network of generalized linear model neurons, and a biologically constrained network of leaky integrate-and-fire neurons.
Edit intent: coherence
Original:  To illustrate the theory , we apply it to a balanced random network of leaky integrate-and-fire neurons, a balanced random network of generalized linear model neurons, and a biologically constrained network of leaky integrate-and-fire neurons.
Revised:  To illustrate the theory , we apply it to a balanced random network of leaky integrate-and-fire neurons, and a biologically constrained network of leaky integrate-and-fire neurons.
Edit intent: clarity
Original:  For the leaky integrate-and-fire networks, we obtain the same quantities by means of a novel analytical approximation of the colored noise problem that is valid in the fluctuation-driven regime .
Revised:  For the leaky integrate-and-fire networks, we derive an approximate analytical solution of the colored noise problem that is valid in the fluctuation-driven regime .
Edit intent: clarity
Original: INTRODUCTION: Assessment of cognitively complex instrumental activities of daily living (IADL) is important in (incipient) dementia, but little is known about the influence of cultural differences.
Revised: INTRODUCTION: To understand the potential influence of diversity on the measurement of functional impairment in dementia, we aimed to investigate possible bias caused by age, gender, education, and cultural differences.
Edit intent: clarity
Original:  We show that any pair of column subspaces corresponding to two different clusters are nearly orthogonal: the minimal principal angle between them is at most \pi{2}-c_1{N \theta}-c_2 N h, for some constants c_1,c_2 depending only on the multiplicities of the clusters .
Revised:  We show that any pair of column subspaces corresponding to two different clusters are nearly orthogonal: the minimal principal angle between them is at most \pi{2}-c_1{N \theta}-c_2 N h, for some constants c_1,c_2 depending only on the multiplicities of theclusters .
Edit intent: fluency
Original: Consider a finite set E equipped with a "weight function " w : E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right)  assigned to it, and any two distinct e, f \in E have a } "distance function " d : E \times E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right) \left(\right)  ultrametric triangle inequality \leqslant \left\{\right\} .
Revised: Consider a finite set E . Assume that each e \in E has a "weight function " w : E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right) assigned to it, and any two distinct e, f \in E have a } "distance function " d : E \times E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right) \left(\right) ultrametric triangle inequality \leqslant \left\{\right\} .
Edit intent: clarity
Original: Consider a finite set E equipped with a "weight function " w : E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right)  assigned to it, and any two distinct e, f \in E have a } "distance function " d : E \times E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right) \left(\right)  ultrametric triangle inequality \leqslant \left\{\right\} .
Revised: Consider a finite set E equipped with a "weight " w : E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right) assigned to it, and any two distinct e, f \in E have a } "distance function " d : E \times E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right) \left(\right) ultrametric triangle inequality \leqslant \left\{\right\} .
Edit intent: fluency
Original: Consider a finite set E equipped with a "weight function " w : E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right)  assigned to it, and any two distinct e, f \in E have a } "distance function " d : E \times E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right) \left(\right)  ultrametric triangle inequality \leqslant \left\{\right\} .
Revised: Consider a finite set E equipped with a "weight function " w %DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right) assigned to it, and any two distinct e, f \in E have a } "distance function " d : E \times E%DIFDELCMD < \to %DIFDELCMD < %%% \mathbb{R \left(\right) \left(\right) ultrametric triangle inequality \leqslant \left\{\right\} .
Edit intent: fluency