wanyu/IteraTeR_v2 huggingface dataset:
Original:  here we propose a strategy to evaluate alternative relatedness measures and identify the superior ones by comparing the structure properties of resulting technology networks . Using United States patent data , we execute the strategy through a comparative analysis of twelve relatedness measures, which quantify inter-field knowledge input similarity , field-crossing diversification likelihood or frequency of innovation agents, and co-occurrences of technology classes in the same patents.
Revised:  here we propose a strategy to evaluate alternative relatedness measures and identify the superior ones by comparing the structure properties of resulting patent network maps . Using United States patent data , we execute the strategy through a comparative analysis of twelve relatedness measures, which quantify inter-field knowledge input similarity , field-crossing diversification likelihood or frequency of innovation agents, and co-occurrences of technology classes in the same patents.
Edit intent: clarity
Original:  here we propose a strategy to evaluate alternative relatedness measures and identify the superior ones by comparing the structure properties of resulting technology networks . Using United States patent data , we execute the strategy through a comparative analysis of twelve relatedness measures, which quantify inter-field knowledge input similarity , field-crossing diversification likelihood or frequency of innovation agents, and co-occurrences of technology classes in the same patents.
Revised:  here we propose a strategy to evaluate alternative relatedness measures and identify the superior ones by comparing the structure properties of resulting technology networks . Using United States patent data , we execute the strategy through a comparative analysis of twelve relatedness measures, which quantify inter-field knowledge base proximity , field-crossing diversification likelihood or frequency of innovation agents, and co-occurrences of technology classes in the same patents.
Edit intent: clarity
Original:  here we propose a strategy to evaluate alternative relatedness measures and identify the superior ones by comparing the structure properties of resulting technology networks . Using United States patent data , we execute the strategy through a comparative analysis of twelve relatedness measures, which quantify inter-field knowledge input similarity , field-crossing diversification likelihood or frequency of innovation agents, and co-occurrences of technology classes in the same patents.
Revised:  here we propose a strategy to evaluate alternative relatedness measures and identify the superior ones by comparing the structure properties of resulting technology networks . Using United States patent data , we execute the strategy through a comparative analysis of twelve relatedness measures, which quantify inter-field knowledge input similarity , field-crossing diversification likelihood or frequency of innovation agents, and co-occurrences of patent classes in the same patents.
Edit intent: fluency
Original:  Our comparative analyses suggest two superior relatedness measures, normalized co-reference and inventor diversification likelihood , for constructing technology network maps .
Revised:  Our comparative analyses suggest the patent technology network maps based on normalized co-reference and inventor diversification likelihood , for constructing technology network maps .
Edit intent: clarity
Original:  Our comparative analyses suggest two superior relatedness measures, normalized co-reference and inventor diversification likelihood , for constructing technology network maps .
Revised:  Our comparative analyses suggest two superior relatedness measures, normalized co-reference and inventor diversification likelihood measures are the best representatives .
Edit intent: clarity
Original: The reproduction and replication of novel results has become a major issue for a number of scientific disciplines.
Revised: The reproduction and replication of research results has become a major issue for a number of scientific disciplines.
Edit intent: clarity
Original:  In computer science and related computational disciplines such as systems biology, the issues closely revolve around the ability to implement  novel algorithms and models.
Revised:  In computer science and related computational disciplines such as systems biology, the challenges closely revolve around the ability to implement novel algorithms and models.
Edit intent: clarity
Original:  Taking an approach from the literature and applying it to a new codebase frequently requires local knowledge missing from the published manuscripts and  project websites.
Revised:  Taking a new approach from the literature and applying it to a new codebase frequently requires local knowledge missing from the published manuscripts and project websites.
Edit intent: clarity
Original:  Alongside this issue, benchmarking, and the development of fair -- and publicly available -- benchmark sets present another barrier  .
Revised:  Alongside this issue, benchmarking, and the lack of open, transparent and fair -- and publicly available -- benchmark sets present another barrier .
Edit intent: clarity
Original:  Alongside this issue, benchmarking, and the development of fair -- and publicly available -- benchmark sets present another barrier  .
Revised:  Alongside this issue, benchmarking, and the development of fair benchmark sets present another barrier .
Edit intent: clarity
Original:  Alongside this issue, benchmarking, and the development of fair -- and publicly available -- benchmark sets present another barrier  .
Revised:  Alongside this issue, benchmarking, and the development of fair -- and publicly available -- benchmark sets present another barrier to the verification and validation of claimed results .
Edit intent: clarity
Original:  In this paper, we outline several suggestions to address these issues, driven by specific examples from a range of scientific domains.
Revised:  In this paper, we outline several recommendations to address these issues, driven by specific examples from a range of scientific domains.
Edit intent: fluency
Original:  Finally, based on these suggestions , we propose a new open automated platform for scientific software development which effectively abstracts specific dependencies from the individual researcher and their workstation, allowing easy sharing and reproduction of results.
Revised:  Based on these recommendations , we propose a new open automated platform for scientific software development which effectively abstracts specific dependencies from the individual researcher and their workstation, allowing easy sharing and reproduction of results.
Edit intent: coherence
Original:  This new cyberinfrastructure for computational science offers the potential to incentivise a culture change and drive the adoption of new techniques to improve the efficiency of scientific exploration.
Revised:  This new e-infrastructure for reproducible computational science offers the potential to incentivise a culture change and drive the adoption of new techniques to improve the efficiency of scientific exploration.
Edit intent: clarity
Original:  We propose a new approach to the problem, called Deep Match Tree ( DeepMatch _{tree}), under a general setting.
Revised:  We propose a new approach to the problem, called Deep Match Tree ( DeepMatch _{tree}), under a general setting.
Edit intent: fluency
Original:  We test our algorithm on the problem of matching a tweet and a response in social media, a hard matching problem proposed in \mbox{ emnlpmatch  and show that DeepMatch _{tree} can outperform a number of competitor models including one without using dependency trees and one based on word-embedding, all with large margins
Revised:  We test our algorithm on the problem of matching a tweet and a response in social media, a hard matching problem proposed in \mbox{ emnlpmatch , and show that DeepMatch _{tree} can outperform a number of competitor models including one without using dependency trees and one based on word-embedding, all with large margins
Edit intent: fluency
Original:  We test our algorithm on the problem of matching a tweet and a response in social media, a hard matching problem proposed in \mbox{ emnlpmatch  and show that DeepMatch _{tree} can outperform a number of competitor models including one without using dependency trees and one based on word-embedding, all with large margins
Revised:  We test our algorithm on the problem of matching a tweet and a response in social media, a hard matching problem proposed in \mbox{ emnlpmatch and show that DeepMatch _{tree} can outperform a number of competitor models including one without using dependency trees and one based on word-embedding, all with large margins
Edit intent: fluency
Original: Seamless computing and data access is enabled by the emerging technology of mobile micro-clouds (MMCs).
Revised: Mobile micro-clouds (MMCs).
Edit intent: clarity
Original:  Our goal is to find the optimal service placement sequence which minimizes the average cost over a given time.
Revised:  Our goal is to find the optimal placement (configuration) of instances to minimize the average cost over a given time.
Edit intent: clarity
Original:  To solve this problem, we first propose a method which solves for the optimal placement sequence for a specific look-ahead time-window , based on the predicted costs in this time-window.
Revised:  To solve this problem, we first propose a method which solves for the optimal configuration in a specific look-ahead time-window , based on the predicted costs in this time-window.
Edit intent: clarity
Original:  Then, we propose a method to find the optimal look-ahead window size  , which minimizes an upper bound of the average cost.
Revised:  Then, we propose a method to find the optimal look-ahead window size is proposed , which minimizes an upper bound of the average cost.
Edit intent: clarity
Original:  Finally, we evaluate the effectiveness of the proposed approach  by simulations with  real-world  user-mobility traces  .
Revised:  Finally, we evaluate the effectiveness of the proposed approach is evaluated by simulations with real-world user-mobility traces .
Edit intent: clarity
Original:  Through the transition, the system undergoes a series of symmetry breaking transitions whereby the information content of replicators becomes increasingly distinct from that of their environment.
Revised:  Through the transition, the system undergoes a series of symmetry breaking transitions whereby the information content of replicators becomes increasingly distinct from their environment.
Edit intent: clarity
Original:  Thus , the replicators that nucleate the transition in the non-life phase are often not those which are ultimately selected in the life phase.
Revised:  Often , the replicators that nucleate the transition in the non-life phase are often not those which are ultimately selected in the life phase.
Edit intent: fluency
Original:  Thus , the replicators that nucleate the transition in the non-life phase are often not those which are ultimately selected in the life phase.
Revised:  Thus , the replicators that nucleate the transition in the non-life phase are not those that are ultimately selected in the life phase.
Edit intent: clarity
Original:   We discuss the implications of these results for understanding the emergence of life, and natural selection more broadly.
Revised:  We discuss the implications of these results for understanding life's emergence and evolutionary transitions more broadly.
Edit intent: clarity
Original:  The phase transition corresponds to a redistribution of matter in replicators %DIFDELCMD < {\it %%% and their environment , driven by selection on replicators .
Revised:  The transition corresponds to a redistribution of matter in replicators %DIFDELCMD < {\it %%% and their environment , driven by selection on replicators .
Edit intent: clarity
Original:  Often, the replicators that nucleate the transition in the non-life phase are not those that are ultimately selected in the life phase.
Revised:  Often, the replicators that initiate the transition are not those that are ultimately selected in the life phase.
Edit intent: clarity
Original:  In particular, our results include the martingale optimal transport duality of Dolinsky and Soner (2013) and extend it to multiple dimensions and multiple assets .
Revised:  In particular, our results include the martingale optimal transport duality of Dolinsky and Soner (2013) and extend it to multiple dimensions and multiple maturities .
Edit intent: clarity
Original:  It can  analyze qualitative system dynamics such as regime shifts despite incomplete knowledge of the model's constituent processes , but has been used primarily in theoretical contexts .
Revised:  It can analyze qualitative system dynamics such as regime shifts despite incomplete knowledge of the model's constituent processes .
Edit intent: coherence
Original:  Here, we review generalized modeling and use a recent study on the Baltic  cod fishery's boom and collapse to demonstrate its application to modeling the dynamics of empirical social-ecological systems.
Revised:  Here, we review generalized modeling and use a recent study on the Baltic Sea cod fishery's boom and collapse to demonstrate its application to modeling the dynamics of empirical social-ecological systems.
Edit intent: clarity
Original:  These empirical applications demand new methods of analysis suited to larger, more complicated generalized models than is common in theoretical contexts . Generalized modeling is a promising tool , in both participatory and research settings, for rapidly developing mathematically rigorous, process-based understanding of a social-ecological system's dynamics despite limited knowledge of the system.
Revised:  These empirical applications demand new methods of analysis suited to larger, more complicated generalized models . Generalized modeling is a promising tool , in both participatory and research settings, for rapidly developing mathematically rigorous, process-based understanding of a social-ecological system's dynamics despite limited knowledge of the system.
Edit intent: clarity
Original:  These empirical applications demand new methods of analysis suited to larger, more complicated generalized models than is common in theoretical contexts . Generalized modeling is a promising tool , in both participatory and research settings, for rapidly developing mathematically rigorous, process-based understanding of a social-ecological system's dynamics despite limited knowledge of the system.
Revised:  These empirical applications demand new methods of analysis suited to larger, more complicated generalized models than is common in theoretical contexts . Generalized modeling is a promising tool for rapidly developing mathematically rigorous, process-based understanding of a social-ecological system's dynamics despite limited knowledge of the system.
Edit intent: clarity
Original: We report that Muller cells contain bundles of long specialized intermediate filaments about 10 nm in diameter;
Revised: We report that M\"uller cells contain bundles of long specialized intermediate filaments about 10 nm in diameter;
Edit intent: fluency
Original: We present an efficient and scalable high-throughput FPGA-based architecture for the Min-Sum Algorithm (MSA) based decoder for Quasi-Cyclic Low-Density Parity-Check ( QC-LDPC ) codes .
Revised: We propose without loss of generality strategies to achieve a high-throughput FPGA-based architecture for the Min-Sum Algorithm (MSA) based decoder for Quasi-Cyclic Low-Density Parity-Check ( QC-LDPC ) codes .
Edit intent: clarity
Original: We present an efficient and scalable high-throughput FPGA-based architecture for the Min-Sum Algorithm (MSA) based decoder for Quasi-Cyclic Low-Density Parity-Check ( QC-LDPC ) codes .
Revised: We present an efficient and scalable high-throughput FPGA-based architecture for a QC-LDPC ) codes .
Edit intent: coherence
Original:  We present a compact representation of the parity-check matrix (PCM) which allows for a significant improvement in throughput (3x in our case study) compared to conventional methods.
Revised:  We present a novel representation of the parity-check matrix (PCM) which allows for a significant improvement in throughput (3x in our case study) compared to conventional methods.
Edit intent: clarity
Original:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler  available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm  in approximately 3 minutes .
Revised:  As a case study, a MSA based decoder for the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm in approximately 3 minutes .
Edit intent: clarity
Original:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler  available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm  in approximately 3 minutes .
Revised:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) QC-LDPC is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm in approximately 3 minutes .
Edit intent: clarity
Original:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler  available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm  in approximately 3 minutes .
Revised:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler available in the NI LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm in approximately 3 minutes .
Edit intent: clarity
Original:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler  available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm  in approximately 3 minutes .
Revised:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler available in the National Instruments LabVIEW Communication System Design Suite (CSDS) which offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm in approximately 3 minutes .
Edit intent: clarity
Original:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler  available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm  in approximately 3 minutes .
Revised:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow where an optimized hardware implementation from the LDPC algorithm in approximately 3 minutes .
Edit intent: coherence
Original:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler  available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm  in approximately 3 minutes .
Revised:  As a case study, a MSA based decoder for the rate-1/2, 1944-bit, irregular QC-LDPC code specified in the IEEE 802.11n (2012) standard is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler available in the National Instruments LabVIEW Communication System Design Suite (CSDS) . This compiler offers an automated and systematic compilation flow which generates an optimized hardware implementation from the LDPC algorithm was generated in approximately 3 minutes .
Edit intent: clarity
Original:  The decoder achieves an overall throughput of 608Mb/s at an operating frequency of 200MHz . As per our knowledge this is the fastest implementation of an IEEE 802.
Revised:  The decoder achieves an overall throughput of 608Mb/s at an operating frequency of 200MHz . As per our knowledge this is the fastest implementation of the IEEE 802.
Edit intent: fluency
Original: 11n compliant QC-LDPC decoder using an algorithmic compiler.
Revised: 11n QC-LDPC decoder using an algorithmic compiler.
Edit intent: clarity
Original:  Here we explore the role of noise, as an effective description of external perturbations, and discuss how its presence accounts for the ability of the system to escape intermittently  such attractors and explore complex dynamic repertoires of locally coherent states, in analogy with experimentally recorded patterns of cerebral activity.
Revised:  Here we explore the role of noise, as an effective description of external perturbations, and discuss how its presence accounts for the ability of the system to escape intermittently from such attractors and explore complex dynamic repertoires of locally coherent states, in analogy with experimentally recorded patterns of cerebral activity.
Edit intent: fluency
Original:  The first property allows  calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. mages that show the average state of each cell during the  stochastic cellular automaton evolution .
Revised:  The first property allows for calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. mages that show the average state of each cell during the stochastic cellular automaton evolution .
Edit intent: fluency