wanyu/IteraTeR_v2 huggingface dataset:
Original:  Prior work obtained weaker lower bounds by reasoning about the number of phases needed to perform C:=AB, where each phase is a series of operations involving S reads and writes to and from fast memory, and S is the size of fast memory.
Revised:  Prior work obtained weaker lower bounds by reasoning about the number of segments needed to perform C:=AB, where each phase is a series of operations involving S reads and writes to and from fast memory, and S is the size of fast memory.
Edit intent: clarity
Original:  A lower bound on the number of phases was then determined by obtaining an upper bound on the number of scalar multiplications performed per phase .
Revised:  A lower bound on the number of segments was then determined by obtaining an upper bound on the number of scalar multiplications performed per phase .
Edit intent: clarity
Original:  A lower bound on the number of phases was then determined by obtaining an upper bound on the number of scalar multiplications performed per phase .
Revised:  A lower bound on the number of phases was then determined by obtaining an upper bound on the number of scalar multiplications performed per segment .
Edit intent: clarity
Original:  This paper follows the same high level approach, but improves the lower bound by considering C:=AB+C instead of C:=AB, and obtains the maximum number of scalar fused multiply-adds (  FMAs) per phase instead of scalar additions.
Revised:  This paper follows the same high level approach, but improves the lower bound by ( FMAs) per phase instead of scalar additions.
Edit intent: coherence
Original:  Key to obtaining the new result is the decoupling of the per-phase I/O  from the size of fast memory.
Revised:  Key to obtaining the new result is the decoupling of the per-phase I/O cost from the size of fast memory.
Edit intent: clarity
Original:  }  A theoretical algorithm that attains the lower bound is given, and how the state-of-the-art Goto's algorithm also in some sense meets the lower bound is discussed.
Revised:  } A theoretical algorithm that attains the lower bound is given, and how the state-of-the-art Goto's Algorithm attains the lower bound is discussed.
Edit intent: clarity
Original: We introduce a statistical method to investigate the impact of dyadic relations on complex networks generated from  repeated interactions.
Revised: We introduce a statistical regression model to investigate the impact of dyadic relations on complex networks generated from repeated interactions.
Edit intent: clarity
Original: We introduce a statistical method to investigate the impact of dyadic relations on complex networks generated from  repeated interactions.
Revised: We introduce a statistical method to investigate the impact of dyadic relations on complex networks generated from observed repeated interactions.
Edit intent: clarity
Original:  With our method  we can regress the influence of each relational layer, the independent variables, on the interaction counts, the dependent variables.
Revised:  With our method , we can regress the influence of each relational layer, the independent variables, on the interaction counts, the dependent variables.
Edit intent: fluency
Original:  Moreover, we can test the statistical significance of the relations as explanatory variables for the observed interactions.
Revised:  Moreover, we can quantify the statistical significance of the relations as explanatory variables for the observed interactions.
Edit intent: clarity
Original:  To demonstrate the power of our approach and its broad applicability, we will present examples based on synthetic and empirical data.
Revised:  To demonstrate the power of our approach , we investigate an example based on empirical data.
Edit intent: clarity
Original: As the most widely used antimalarial agent, chloroquine (CQ) has been used  for more than half century.
Revised: As the most widely used antimalarial agent, chloroquine (CQ) has been used in the battle against malaria for more than half century.
Edit intent: clarity
Original:  Our ultimate goal is to use utility theory to price non-replicable contingent claims in the case when the investor 's portfolio already contains a non-replicable component.
Revised:  Our ultimate goal is to use utility theory to price non-replicable contingent claims in the case where the investor has a non-replicable component.
Edit intent: clarity
Original:  To the best of our knowledge, the new automaton model is the first automaton which can portray the operation semantics for a mimic computing system, and it can directly describe the behaviors of a mimic computer.
Revised:  To the best of our knowledge, the new automaton model is the first automaton which can portray the operation semantics for a mimic computing system, and it can directly describe some behaviors of a mimic computer.
Edit intent: clarity
Original: We propose a method to generate multiple hypotheses for human 3D pose all of them consistent with the 2D detection of joints in a monocular RGB image.
Revised: We propose a method to generate multiple diverse and valid human pose hypotheses in 3D all consistent with the 2D detection of joints in a monocular RGB image.
Edit intent: clarity
Original:  To generate these pose hypotheses we use a novel generative model defined in the space of anatomically plausible 3D poses satisfying the joint angle limits and limb length ratios.
Revised:  We use a novel generative model defined in the space of anatomically plausible 3D poses satisfying the joint angle limits and limb length ratios.
Edit intent: clarity
Original:  We discuss sampling from this model and use these samples to generate multiple diverse human 3D pose hypotheses given the 2D detection of joints .
Revised:  We discuss sampling from this model and use these samples to generate multiple diverse human 3D pose hypotheses .
Edit intent: coherence
Original:  We argue that generating multiple pose hypotheses from a monocular RGB image is more reasonable than generating only a single 3D pose  given the depth ambiguity and the uncertainty caused by occlusion and imperfect 2D joint detection.
Revised:  We argue that generating multiple pose hypotheses is more reasonable than generating only a single 3D pose given the depth ambiguity and the uncertainty caused by occlusion and imperfect 2D joint detection.
Edit intent: clarity
Original:  We argue that generating multiple pose hypotheses from a monocular RGB image is more reasonable than generating only a single 3D pose  given the depth ambiguity and the uncertainty caused by occlusion and imperfect 2D joint detection.
Revised:  We argue that generating multiple pose hypotheses from a monocular RGB image is more reasonable than generating only a single 3D pose given the depth ambiguity and the uncertainty due to occlusion and imperfect 2D joint detection.
Edit intent: clarity
Original:  The idea of generating multiple consistent and valid pose hypotheses can give rise to a new line of future work that has not previously been addressed in the literature  .
Revised:  The idea of generating multiple consistent pose hypotheses can give rise to a new line of future work that has not previously been addressed in the literature .
Edit intent: clarity
Original:  The idea of generating multiple consistent and valid pose hypotheses can give rise to a new line of future work that has not previously been addressed in the literature  .
Revised:  The idea of generating multiple consistent and valid pose hypotheses can give rise to a new line of future work that has not received much attention in the literature .
Edit intent: clarity
Original: We present a database for research on affect, personality traits and mood by means of neuro-physiological signals . Different to other databases, we elicited affect using both short and long videos in two settings , one with individual viewers and one with groups of viewers.
Revised: We present a database for research on affect, personality traits and mood by means of neuro-physiological signals . Different to other databases, we elicited affect using both short and long videos in two social contexts , one with individual viewers and one with groups of viewers.
Edit intent: clarity
Original:  The database allows the multimodal study of the affective responses of individuals in relation to their personality and mood, and the analysis of how these responses are affected by (i) the individual/group setting, and (ii) the duration of the videos(short vs long) .
Revised:  The database allows the multimodal study of the affective responses of individuals in relation to their personality and mood, and with respect to the social context, and videos' duration .
Edit intent: clarity
Original:  The data is collected in two experiments .
Revised:  The data is collected in two experimental settings .
Edit intent: clarity
Original:  In the first one, 40 participants watched 16 short emotional videos while they were alone .
Revised:  In the first one, 40 participants watched 16 short emotional videos .
Edit intent: clarity
Original:  In the second one, the same participants watched 4 long videos, some of them alone and the rest in groups.
Revised:  In the second one, the participants watched 4 long videos, some of them alone and the rest in groups.
Edit intent: clarity
Original:  Participants ' signals, namely, Electroencephalogram (EEG), Electrocardiogram (ECG), and Galvanic Skin Response (GSR) , were recorded using wearable sensors.
Revised:  The participants ' signals, namely, Electroencephalogram (EEG), Electrocardiogram (ECG), and Galvanic Skin Response (GSR) , were recorded using wearable sensors.
Edit intent: clarity
Original:  Participants ' signals, namely, Electroencephalogram (EEG), Electrocardiogram (ECG), and Galvanic Skin Response (GSR) , were recorded using wearable sensors.
Revised:  Participants ' signals, namely, Electroencephalogram (EEG), Electrocardiogram (ECG), and Galvanic Skin Response (GSR) were recorded using wearable sensors.
Edit intent: fluency
Original:  Participants emotions have been annotated with both , self-assessment of affective levels (valence, arousal, control, familiarity, like/dislike, and selection of basic emotion) felt by the participants during the first experiment , and external-assessment of participants' levels of valence and arousal for both experiments .
Revised:  Participants emotions have been annotated with both self-assessment of affective levels (valence, arousal, control, familiarity, like/dislike, and selection of basic emotion) felt by the participants during the first experiment , and external-assessment of participants' levels of valence and arousal for both experiments .
Edit intent: fluency
Original:  Participants emotions have been annotated with both , self-assessment of affective levels (valence, arousal, control, familiarity, like/dislike, and selection of basic emotion) felt by the participants during the first experiment , and external-assessment of participants' levels of valence and arousal for both experiments .
Revised:  Participants emotions have been annotated with both , self-assessment of affective levels (valence, arousal, control, familiarity, liking, and basic emotions) felt during the videos , and external-assessment of participants' levels of valence and arousal for both experiments .
Edit intent: clarity
Original:  Participants emotions have been annotated with both , self-assessment of affective levels (valence, arousal, control, familiarity, like/dislike, and selection of basic emotion) felt by the participants during the first experiment , and external-assessment of participants' levels of valence and arousal for both experiments .
Revised:  Participants emotions have been annotated with both , self-assessment of affective levels (valence, arousal, control, familiarity, like/dislike, and selection of basic emotion) felt by the participants during the first experiment , and external-assessment of levels of valence and arousal for both experiments .
Edit intent: clarity
Original:  Participants emotions have been annotated with both , self-assessment of affective levels (valence, arousal, control, familiarity, like/dislike, and selection of basic emotion) felt by the participants during the first experiment , and external-assessment of participants' levels of valence and arousal for both experiments .
Revised:  Participants emotions have been annotated with both , self-assessment of affective levels (valence, arousal, control, familiarity, like/dislike, and selection of basic emotion) felt by the participants during the first experiment , and external-assessment of participants' levels of valence and arousal .
Edit intent: clarity
Original:  We also present baseline methods and results for single-trial classification of valence and arousal , and for single-trial classification of personality traits, mood and social context (alone vs group), using EEG, GSR and ECG and fusion of modalities for both experiments .
Revised:  We also present baseline methods and results for single-trial classification of valence and arousal .
Edit intent: coherence
Original:  The database has been made publicly available.
Revised:  The database is made publicly available.
Edit intent: clarity
Original:  The database allows the multimodal study of the affective responses, by means of neuro-physiological signals of individuals in relation to their personality and mood, and with respect to the social context , and videos' duration.
Revised:  The database allows the multimodal study of the affective responses, by means of neuro-physiological signals of individuals in relation to their personality and mood, and with respect to the social context and videos' duration.
Edit intent: fluency
Original:  The participants' signals, namely, Electroencephalogram (EEG), Electrocardiogram (ECG) , and Galvanic Skin Response (GSR)  were recorded using wearable sensors.
Revised:  The participants' signals, namely, Electroencephalogram (EEG), Electrocardiogram (ECG) and Galvanic Skin Response (GSR) were recorded using wearable sensors.
Edit intent: fluency
Original:  The participants' signals, namely, Electroencephalogram (EEG), Electrocardiogram (ECG) , and Galvanic Skin Response (GSR)  were recorded using wearable sensors.
Revised:  The participants' signals, namely, Electroencephalogram (EEG), Electrocardiogram (ECG) , and Galvanic Skin Response (GSR) , were recorded using wearable sensors.
Edit intent: fluency
Original:  Participants  emotions have been annotated with both self-assessment of affective levels (valence, arousal, control, familiarity, liking , and basic emotions) felt during the videos , and external-assessment of levels of valence and arousal.
Revised:  Participants emotions have been annotated with both self-assessment of affective levels (valence, arousal, control, familiarity, liking and basic emotions) felt during the videos , and external-assessment of levels of valence and arousal.
Edit intent: fluency
Original:  Participants  emotions have been annotated with both self-assessment of affective levels (valence, arousal, control, familiarity, liking , and basic emotions) felt during the videos , and external-assessment of levels of valence and arousal.
Revised:  Participants emotions have been annotated with both self-assessment of affective levels (valence, arousal, control, familiarity, liking , and basic emotions) felt during the videos as well as external-assessment of levels of valence and arousal.
Edit intent: clarity
Original:  We present a detailed correlation analysis of the different dimensions , and baseline methods and results for single-trial classification of valence and arousal  .
Revised:  We present a detailed correlation analysis of the different dimensions as well as baseline methods and results for single-trial classification of valence and arousal .
Edit intent: coherence
Original: Neural networks provide a powerful framework for learning the association between input and response variables and making accurate predictions and offer promise in using the rapidly growing volume of health care data to surface causal relationships that cannot necessarily be tested in randomized clinical trials .
Revised: In application domains such as healthcare, we want accurate predictive models that are also causally interpretable .
Edit intent: clarity
Original:  In pursuit of models whose predictive power comes maximally from causal variables , we propose a novel causal regularizer based on the assumption about independence of different steps of data generation process.
Revised:  In pursuit of such models , we propose a novel causal regularizer based on the assumption about independence of different steps of data generation process.
Edit intent: clarity
Original:  Our causally-regularized algorithm outperforms its L1-regularized counterpart both in predictive performance as well as causal relevance.
Revised:  Our causally-regularized model outperforms its L1-regularized counterpart both in predictive performance as well as causal relevance.
Edit intent: clarity
Original: Locally recoverable codes (LRC)  have recently been a subject of intense research due to the theoretical appeal and their applications in distributed storage systems.
Revised: Locally recoverable (LRC) have recently been a subject of intense research due to the theoretical appeal and their applications in distributed storage systems.
Edit intent: clarity
Original: Locally recoverable codes (LRC)  have recently been a subject of intense research due to the theoretical appeal and their applications in distributed storage systems.
Revised: Locally recoverable codes (LRC) codes have recently been a subject of intense research due to the theoretical appeal and their applications in distributed storage systems.
Edit intent: fluency
Original: Locally recoverable codes (LRC)  have recently been a subject of intense research due to the theoretical appeal and their applications in distributed storage systems.
Revised: Locally recoverable codes (LRC) have recently been a subject of intense research due to the theoretical appeal and applications in distributed storage systems.
Edit intent: clarity
Original:  In an LRC  , any erased symbol of a codeword can be recovered by accessing only few other symbols.
Revised:  In an LRC code , any erased symbol of a codeword can be recovered by accessing only few other symbols.
Edit intent: clarity
Original:  In an LRC  , any erased symbol of a codeword can be recovered by accessing only few other symbols.
Revised:  In an LRC , any erased symbol of a codeword can be recovered by accessing only a small number of other symbols.
Edit intent: fluency
Original:  For LRC codes over  small alphabet (such as binary), the optimal rate-distance trade-off is unknown.
Revised:  For LRC codes over a small alphabet (such as binary), the optimal rate-distance trade-off is unknown.
Edit intent: fluency
Original: Networks of interdependent nodes support phenomena such as epidemics , product adoption, cascading failure, ecosystem collapse, congestion, and bandwagon effects.
Revised: Fads , product adoption, cascading failure, ecosystem collapse, congestion, and bandwagon effects.
Edit intent: clarity
Original:  We develop a condition for determining which node thresholds are correctly measured and demonstrate that modeling activation thresholds as a function of node-level factors reduces the error compared to existing approaches .
Revised:  We develop a condition for determining which node thresholds are correctly measured and demonstrate that modeling activation thresholds as a function of node-level information .
Edit intent: clarity
Original: Optimal location queries identify the best locations to set up new facilities for providing service to the users.
Revised: Facility location queries identify the best locations to set up new facilities for providing service to the users.
Edit intent: clarity
Original:  For several businesses such as gas stations, cellphone base-stations, etc. , placement queries require taking into account the mobility patterns (or trajectories ) of the users  .
Revised:  For several businesses such as gas stations, cellphone base-stations, etc. that are widely accessed by mobile users. The placement of such services should, therefore, factor in the mobility patterns (or trajectories ) of the users .
Edit intent: clarity
Original:  For several businesses such as gas stations, cellphone base-stations, etc. , placement queries require taking into account the mobility patterns (or trajectories ) of the users  .
Revised:  For several businesses such as gas stations, cellphone base-stations, etc. , placement queries require taking into account the mobility patterns or trajectories of the users .
Edit intent: fluency
Original:  In this work, we formulate the TOPS (Trajectory-Aware Optimal Placement of Services) query , which locates the best k sites on a road network for the prevailing user trajectories.
Revised:  In this work, we introduce the TOPS (Trajectory-Aware Optimal Placement of Services) query , which locates the best k sites on a road network for the prevailing user trajectories.
Edit intent: clarity
Original:  In this work, we formulate the TOPS (Trajectory-Aware Optimal Placement of Services) query , which locates the best k sites on a road network for the prevailing user trajectories.
Revised:  In this work, we formulate the TOPS (Trajectory-Aware Optimal Placement of Services) query that locates the best k sites on a road network for the prevailing user trajectories.
Edit intent: coherence
Original:  The greedy approach, which is the state-of-the-art technique for this problem , is not scalable and practical for real urban-scale scenarios, primarily due to its high memory footprint beyond the capabilities of commodity machines .
Revised:  The greedy approach, which is the state-of-the-art technique for this problem , is not scalable and practical for real urban-scale datasets .
Edit intent: clarity
Original:  To overcome these challenges , we develop an indexing framework called NetClus that derives its power through an unique combination of FM sketches with network clustering.
Revised:  To overcome this challenge , we develop an indexing framework called NetClus that derives its power through an unique combination of FM sketches with network clustering.
Edit intent: fluency
Original:  In addition, NetClus is the only technique that can absorb dynamic updates such as change in trajectories or candidate locations, and handle constraints such as site cost and capacity .
Revised:  In addition, NetClus is the only technique that can absorb dynamic updates in mobility patterns, handle constraints such as site cost and capacity .
Edit intent: clarity
Original:  This problem is still NP-complete for K%DIFDELCMD < \ge %%% 3. Although the worst case complexity of NP-complete problems is conjectured to be exponential, there might be subsets of the realizations where solutions can typically be found in polynomial time  .
Revised:  This problem is still NP-complete for K%DIFDELCMD < \ge %%% . Although the worst-case complexity of NP-complete problems is conjectured to be exponential, there might be subsets of the realizations where solutions can typically be found in polynomial time .
Edit intent: coherence
Original:  Also we tried out a mapping to another NP-complete optimization problemusing a specific algorithm for that problem .
Revised:  Also we tried out a mapping to the NP-complete optimization problemusing a specific algorithm for that problem .
Edit intent: clarity
Original:  They are able to ease the computational challenges arising in the area of big data .
Revised:  They are able to ease the computational challenges arising in the area of `big data' .
Edit intent: fluency
Original:  The idea is to derive  from the high-dimensional input matrix a smaller matrix , which is then used to efficiently compute the dynamic modes and eigenvalues.
Revised:  The idea is to derive a small matrix from the high-dimensional input matrix a smaller matrix , which is then used to efficiently compute the dynamic modes and eigenvalues.
Edit intent: fluency