wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We also propose the non-accelerated VR based EXTRA and DIGing, and provide explicit complexities, for example, the O(( \kappa_s +n)\log\frac{1}{\epsilon}) stochastic gradient computation complexity and the O((\kappa_b+\kappa_c) \log\frac{1}{\epsilon}) communication complexity for the VR based EXTRA. The two complexities are also the same as the ones of single-machine  VR methods, such as SAG, SAGA, and SVRG, and the non-accelerated full batch decentralized methods, such as EXTRA, respectively .
Revised:  We also propose the non-accelerated VR based EXTRA and DIGing, and provide explicit complexities, for example, the O(( \kappa_s +n)\log\frac{1}{\epsilon}) stochastic gradient computation complexity and the O((\kappa_b+\kappa_c) \log\frac{1}{\epsilon}) communication complexity . Our stochastic gradient computation complexity is also the same as the ones of single-machine VR methods, such as SAG, SAGA, and SVRG, and the non-accelerated full batch decentralized methods, such as EXTRA, respectively .
Edit intent: clarity
Original:  The two complexities are also the same as the ones of single-machine  VR methods, such as SAG, SAGA, and SVRG, and the non-accelerated full batch decentralized methods, such as EXTRA, respectively .
Revised:  The two complexities are also the same as the ones of single-machine accelerated VR methods, such as SAG, SAGA, and SVRG, and the non-accelerated full batch decentralized methods, such as EXTRA, respectively .
Edit intent: meaning-changed
Original:  The two complexities are also the same as the ones of single-machine  VR methods, such as SAG, SAGA, and SVRG, and the non-accelerated full batch decentralized methods, such as EXTRA, respectively .
Revised:  The two complexities are also the same as the ones of single-machine VR methods, such as Katyusha, and our communication complexity keeps the same as those of accelerated full batch decentralized methods, such as EXTRA, respectively .
Edit intent: meaning-changed
Original:  The two complexities are also the same as the ones of single-machine  VR methods, such as SAG, SAGA, and SVRG, and the non-accelerated full batch decentralized methods, such as EXTRA, respectively .
Revised:  The two complexities are also the same as the ones of single-machine VR methods, such as SAG, SAGA, and SVRG, and the non-accelerated full batch decentralized methods, such as MSDA .
Edit intent: clarity
Original:  A perspective based on side-chain networks can provide valuable insights into the differences in global connectivity features between various dynamical states of a protein. This is especially important to capture subtle conformational changes.
Revised:  A perspective based on side-chain networks can provide valuable insights into the differences in global connectivity features between various dynamical states of proteins. Our objective is to review network-based analyses to elucidate such variations, especially in the context of subtle conformational changes.
Edit intent: meaning-changed
Original:  In light of the COVID-19 pandemic, we focus on characterizing the global features of SARS-Cov2 (COVID-19) spike glycoprotein. Our objective is to review and apply our network approaches to gain insights into a key viral protein at the structural level. We employ dynamical side-chain network concepts on COVID-19 spike glycoprotein, which is crucial for viral entry into human cells.
Revised:  We present technical details of the construction and analyses of protein structure networks, encompassing both the non-covalent connectivity and dynamics. We examine the selection of optimal criteria for connectivity based on the physical concept of percolation. We highlight the advantages of using side-chain network concepts on COVID-19 spike glycoprotein, which is crucial for viral entry into human cells.
Edit intent: meaning-changed
Original:  We employ dynamical side-chain network concepts on COVID-19 spike glycoprotein, which is crucial for viral entry into human cells.
Revised:  We employ dynamical side-chain based network metrics in contrast to backbone measurements. As an illustrative example, we apply the described network approach to investigate the global conformational change between the closed and partially open states of the SARS-CoV-2 spike protein. This conformational change in the spike protein is crucial for viral entry into human cells.
Edit intent: meaning-changed
Original:  As expected, there are considerable similarities of network metrics between the partially open and the closed states of the trimeric SARS-CoV2 spike protein . However, there are also significant differences seen at the domain-domain interfaces within a chain and across the trimeric interface. We discuss these differences in terms of the structural-functional aspects of the spike protein. Our comprehensive presentation and application of the side chain network approach demonstrates its worth in the case of the spike protein. The analyses of the network parameters show that the residues at the receptor binding domain and at the cell fusion level do not act locally but are supported by extensive global side-chain networks.
Revised:  As expected, there are considerable similarities of network metrics between the partially open and the closed states of the spike protein despite small changes between the two states at the backbone level. We also observe some differences at strategic locations in the network parameters show that the residues at the receptor binding domain and at the cell fusion level do not act locally but are supported by extensive global side-chain networks.
Edit intent: clarity
Original:  The analyses of the network parameters show that the residues at the receptor binding domain and at the cell fusion level do not act locally but are supported by extensive global side-chain networks. Sequence comparison with SARS-Cov1 shows that the residue level network metrics such as hubs, cliques/communities are mostly conserved in the two proteins. Our analysis reflects the paramount importance of network features, implying that computational drug design strategies stand to greatly benefit by exploiting them .
Revised:  The analyses of the structures, correlating with their functions, asserting the advantages of the side-chain network analysis. Finally we present a view of allostery as a subtle synergistic-global change between the ligand and the receptor, the incorporation of which would enhance the drug design strategies stand to greatly benefit by exploiting them .
Edit intent: clarity
Original:  Large amounts of data , which are necessary to rank CVs with confidence, are cheaply generated by a deep neural network (DNN) surrogatemodel of the underlying process. The DNN predictions are made explainable by the GSA so that the DNN can be deployed to close design loops.
Revised:  Large amounts of data , which are necessary to rank CVs with confidence, are cheaply generated by a deep neural network surrogate. Subsequently, the GSA is used to explain the network predictions, and the surrogate is deployed to close design loops.
Edit intent: coherence
Original:  Its application to multiscale supercapacitor design demonstrates that the CV rankings facilitated by a domain-aware Graph-Informed Neural Network are better resolved than their counterparts obtained with a physics-based model for a fixed computational budget . Consequently, our information-theoretic GSA provides an "outer loop"
Revised:  We demonstrate that the surrogate-driven mutual information GSA provides useful and distinguishable rankings on two applications of interest in energy storage . Consequently, our information-theoretic GSA provides an "outer loop"
Edit intent: clarity
Original:  This approach is an extension of the Roofline model widely used in traditional high-performance computing applications, and it incorporates both compute/bandwidth complexity and runtime in its formulae to provide insights into deep learning-specific characteristics.
Revised:  This approach is an extension of the Roofline model widely used in traditional high-performance computing applications, and it incorporates both compute/bandwidth complexity and run time in its formulae to provide insights into deep learning-specific characteristics.
Edit intent: clarity
Original: Unmanned Aircraft Systems (UAS) are being increasingly used in delivery, infrastructure surveillance, fire-fighting, and agriculture. According to the Federal Aviation Administration (FAA), the number of active small commercial unmanned aircraft is going to grow from 385K in 2019 to 828K by 2024. UAS traffic management (UTM) system for low-altitude airspace is therefore immediately necessary for its safe and high-density use.
Revised: Unmanned Aircraft Systems (UAS) traffic management system (UTM) system for low-altitude airspace is therefore immediately necessary for its safe and high-density use.
Edit intent: coherence
Original:  UAS traffic management (UTM) system for low-altitude airspace is therefore immediately necessary for its safe and high-density use. In this paper, we propose the first formalization of FAA's Concept of Operations for UTM for building and analyzing traffic management protocols and systems.
Revised:  UAS traffic management (UTM) system for low-altitude airspace operations. FAA has conceptualized the requirements on UTM protocols and components in the FAA's Concept of Operations for UTM for building and analyzing traffic management protocols and systems.
Edit intent: meaning-changed
Original:  In this paper, we propose the first formalization of FAA's Concept of Operations for UTM for building and analyzing traffic management protocols and systems. We formalize FAA's notion of operation volumes (OVs) that express aircraft intent in terms of 4D blocks of airspace and associated real-time deadlines.
Revised:  In this paper, we propose the first formalization of FAA's Concept of Operations for UTM for building and analyzing UTM protocols to (1) help provide high assurance on UTM protocols and (2) discover the strength and weaknesses of existing formal techniques. We propose the first mathematical formalization of FAA's notion of operation volumes (OVs) that express aircraft intent in terms of 4D blocks of airspace and associated real-time deadlines.
Edit intent: meaning-changed
Original:  We formally analyze the safe separation and liveness properties of  the protocol. Our analyses showcase how the de-conflicting and liveness of the system can be proven assuming each aircraft conforms to the deadlines specified by OVs. Through extensive simulations, we evaluate the performance of the protocol in terms of workload and response delays .
Revised:  We formally analyze the safe separation and liveness properties of the performance of the protocol in terms of workload and response delays .
Edit intent: clarity
Original:  Through extensive simulations, we evaluate the performance of the protocol in terms of workload and response delays . Our experiments show that the workload on the airspace manager and the response time of each aircraft grow linearly with respect to the number of aircraft. The experiments also delineate the trade-off between performance , workload, and violation rate across different strategies for generating OVs.
Revised:  Through extensive simulations, we evaluate the performance of the protocol in terms of workload and response delays with extensive simulations in ROS and Gazebo. We show that our analysis can be applied on heterogeneous aircraft models. Our experiments also delineate the trade-off between performance , workload, and violation rate across different strategies for generating OVs.
Edit intent: meaning-changed
Original:  The experiments also delineate the trade-off between performance , workload, and violation rate across different strategies for generating OVs. Lastly, we implement a UTM violation detection and resolution mechanism on top of our protocol. We include a simple fault injection technique that introduces failures with different probabilities. We demonstrate how to use it to empirically evaluate the impact of aircraft failure on the safety of surrounding aircraft, and how the performance of the airspace manager changes under different failure probabilities .
Revised:  The experiments also delineate the trade-off between performance , workload, and violation rate across different strategies for generating operation volumes .
Edit intent: clarity
Original:  Unmanned Aircraft Systems (UAS) traffic management system (UTM)is necessary for automated safe and efficient low-altitude airspace operations. FAA has conceptualized the requirements on UTM protocols and components in the FAA's Concept of Operations for UTM report .
Revised:  Unmanned Aircraft Systems (UAS) is the notion of operation volume (OV). An OV is a 4-dimensional block of airspace and time, which can express an aircraft's intent, and can be used for planning, de-confliction, and traffic management. While there are several high-level simulators for UAS Traffic Management (UTM), we are lacking a framework for creating, manipulating, and reasoning about OVs for heterogeneous air vehicles .
Edit intent: meaning-changed
Original:  In this paper, we explore applying rigorous formal reasoning on building and analyzing UTM protocols to (1) help provide high assurance on UTM protocols and (2) discover the strength and weaknesses of existing formal techniques. We propose the first mathematical formalization of FAA's notion of operation volumes that express aircraft intent in terms of 4D blocks of airspace and associated real-time deadlines. We present an executable prototype coordination protocolusing operation volumes, involving participating aircraft and an airspace manager . Next, we show how to use an ensemble of existing simulation and formal verification tools to analyze the protocol including (1)
Revised:  In this paper, we address this and present SkyTrakx -- a software toolkit for simulation and verification of UTM scenarios based on OVs. First, we illustrate a use case of SkyTrakx by presenting a specific air traffic coordination protocol. This protocol communicates OVs between participating aircraft and an airspace manager . Next, we show how to use an ensemble of existing simulation and formal verification tools to analyze the protocol including (1)
Edit intent: coherence
Original:  We present an executable prototype coordination protocolusing operation volumes, involving participating aircraft and an airspace manager . Next, we show how to use an ensemble of existing simulation and formal verification tools to analyze the protocol including (1) formally proving the safe separation and liveness properties of distributed coordination with the help of proof assistants Dione and Dafny, (2) using data-driven reachability analysiswith DryVR to ensure aircraft to follow operation volumes, and (3) evaluating the performance of the protocol in terms of workload and response delays with extensive simulations in ROS and Gazebo.
Revised:  We present an executable prototype coordination protocolusing operation volumes, involving participating aircraft and an airspace manager . Next, we show how to use an ensemble of existing simulation and formal verification tools , Dafny and Dione, can assist in automatically checking key properties of the protocol. Second, we show how the OVs can be computed for heterogeneous air vehicles like quadcopters and fixed-wing aircraft using another verification technique, namely reachability analysis. Finally, we show that SkyTrakx can be used to simulate complex scenarios involving heterogeneous vehicles, for testing and performance evaluation in terms of workload and response delays with extensive simulations in ROS and Gazebo.
Edit intent: meaning-changed
Original:  formally proving the safe separation and liveness properties of distributed coordination with the help of proof assistants Dione and Dafny, (2) using data-driven reachability analysiswith DryVR to ensure aircraft to follow operation volumes, and (3) evaluating the performance of the protocol in terms of workload and response delays with extensive simulations in ROS and Gazebo. We show that our analysiscan be applied on heterogeneous aircraft models .
Revised:  formally proving the safe separation and liveness properties of distributed coordination with the help of proof assistants Dione and Dafny, (2) using data-driven reachability analysiswith DryVR to ensure aircraft to follow operation volumes, and (3) evaluating the performance of the protocol in terms of workload and response delays analysis .
Edit intent: coherence
Original:   We describe three state-of-the-art basis-adaptive approaches from the recent sparse PCE literature and extensively benchmark them in terms of global approximation accuracy on a large set of computational models representative of a wide range of engineering problems .
Revised:  The goal of this paper is to help practitioners identify the most suitable methods for constructing a surrogate PCE for their model. We describe three state-of-the-art basis-adaptive approaches from the recent sparse PCE literature and extensively benchmark them in terms of global approximation accuracy on a large set of computational models representative of a wide range of engineering problems .
Edit intent: meaning-changed
Original:   We describe three state-of-the-art basis-adaptive approaches from the recent sparse PCE literature and extensively benchmark them in terms of global approximation accuracy on a large set of computational models representative of a wide range of engineering problems .
Revised:  We describe three state-of-the-art basis-adaptive approaches from the recent sparse PCE literature and conduct an extensive benchmark in terms of global approximation accuracy on a large set of computational models representative of a wide range of engineering problems .
Edit intent: clarity
Original:   We describe three state-of-the-art basis-adaptive approaches from the recent sparse PCE literature and extensively benchmark them in terms of global approximation accuracy on a large set of computational models representative of a wide range of engineering problems .
Revised:  We describe three state-of-the-art basis-adaptive approaches from the recent sparse PCE literature and extensively benchmark them in terms of global approximation accuracy on a large set of computational models .
Edit intent: clarity
Original:  Investigating the synergies between sparse regression solvers and basis adaptivity schemes, we find that virtually all basis-adaptive schemes outperform a static choice of basis. Three sparse solvers, namely Bayesian compressive sensing and two variants of subspace pursuit, perform especially well. Aggregating our results by model dimensionality and experimental design size  , we identify combinations of methods that are most promising for the specific problem class .
Revised:  Investigating the synergies between sparse regression solvers and basis adaptivity schemes, we find that virtually all basis-adaptive scheme is very important, as it can result in more than one order of magnitude difference in performance. No single method significantly outperforms the others, but dividing the analysis into classes (regarding input dimension and experimental design size , we identify combinations of methods that are most promising for the specific problem class .
Edit intent: coherence
Original:  Aggregating our results by model dimensionality and experimental design size  , we identify combinations of methods that are most promising for the specific problem class .
Revised:  Aggregating our results by model dimensionality and experimental design size ), we are able to identify specific sparse solver and basis adaptivity combinations for each class that show comparatively good performance. To further improve on these findings , we identify combinations of methods that are most promising for the specific problem class .
Edit intent: meaning-changed
Original:  Airborne aerosol and droplet transmission through the human respiratory processes is modeled as an instance of a multiuser molecular communication scenario employing respiratory-event-driven molecular (variable) concentration shift keying.
Revised:  Airborne aerosol and droplet transmission through human respiratory processes is modeled as an instance of a multiuser molecular communication scenario employing respiratory-event-driven molecular (variable) concentration shift keying.
Edit intent: fluency
Original:  Airborne aerosol and droplet transmission through the human respiratory processes is modeled as an instance of a multiuser molecular communication scenario employing respiratory-event-driven molecular (variable) concentration shift keying.
Revised:  Airborne aerosol and droplet transmission through the human respiratory processes is modeled as an instance of a multiuser molecular communication scenario employing respiratory-event-driven molecular variable-concentration shift keying.
Edit intent: fluency
Original:  Modeling is aided by an experimental molecular communication testbed based on fluorescent dyes and optical detection of aerosol and droplet clouds. A macroscopic molecular communication simulator is extended and used for estimating the transmission of infectious aerosols in different environments  .
Revised:  Modeling is aided by an experimental molecular communication testbed . In artificially induced coughs, a saturated aqueous solution containing a fluorescent dye mixed with saliva is released by an adult test person. The emitted particles are made visible by means of optical detection exploiting the fluorescent dye. The number of particles recorded is significantly higher in test series without mouth and nose protection than in those with a wellfitting medical mask. A simulation tool for macroscopic molecular communication simulator is extended and used for estimating the transmission of infectious aerosols in different environments .
Edit intent: meaning-changed
Original:  these algorithms are the first deterministic algorithmsfor submodular maximization that require a linear number of arithmetic operations. Specifically, for any c%DIFDELCMD < \ge %%% 1, \epsilon > 0, we propose a single-pass , deterministic streaming algorithm with ratio 1/(4c)-\epsilon, query complexity \lceil n / c \rceil + c , memory complexity O(k \log k), and O(n) total running time.
Revised:  these algorithms are %DIFDELCMD < \ge %%% 1, \epsilon > 0, we propose a single-pass , deterministic streaming algorithm with ratio 1/(4c)-\epsilon, query complexity \lceil n / c \rceil + c , memory complexity O(k \log k), and O(n) total running time.
Edit intent: clarity
Original:  Specifically, for any c%DIFDELCMD < \ge %%% 1, \epsilon > 0, we propose a single-pass , deterministic streaming algorithm with ratio 1/(4c)-\epsilon, query complexity \lceil n / c \rceil + c , memory complexity O(k \log k), and O(n) total running time.
Revised:  Specifically, for any c%DIFDELCMD < \ge %%% streaming algorithms. Our single-pass , deterministic streaming algorithm with ratio 1/(4c)-\epsilon, query complexity \lceil n / c \rceil + c , memory complexity O(k \log k), and O(n) total running time.
Edit intent: clarity
Original:  Specifically, for any c%DIFDELCMD < \ge %%% 1, \epsilon > 0, we propose a single-pass , deterministic streaming algorithm with ratio 1/(4c)-\epsilon, query complexity \lceil n / c \rceil + c , memory complexity O(k \log k), and O(n) total running time.
Revised:  Specifically, for any c%DIFDELCMD < \ge %%% 1, \epsilon > 0, we propose a single-pass algorithm obtains a constant ratio in \lceil n / c \rceil + c , memory complexity O(k \log k), and O(n) total running time.
Edit intent: clarity