wanyu/IteraTeR_v2 huggingface dataset:
Original:  For several major advertising publishers of JD DSP , CTR, GMV and ROI have increased 6.58\%, 61.72\% and 65.57\% respectively by the first launch, and further increased 2.95\%, 41.75\% and 41.37\% respectively by the second launch.
Revised:  For several major advertising publishers of JD DSP , CTR, GMV and return on investment have increased 6.58\%, 61.72\% and 65.57\% respectively by the first launch, and further increased 2.95\%, 41.75\% and 41.37\% respectively by the second launch.
Edit intent: clarity
Original: We address the reduction to compact band forms, via unitary similarity transformations, for the solution of symmetric eigenvalue problems and singular value problems . Concretely, in the first case we revisit the reduction to symmetric band form while, for the second case, we propose a similar alternative, which transforms the original matrix to (unsymmetric) band form, replacing the conventional reduction method that produces a triangular-band output.
Revised: We address the reduction to compact band forms, via unitary similarity transformations, for the solution of symmetric eigenvalue problems and singular value problems . Concretely, in the first case we revisit the reduction to symmetric band form while, for the second case, we propose a similar alternative, which transforms the original matrix to (unsymmetric) band form, replacing the conventional reduction method that produces a triangular--band output.
Edit intent: fluency
Original:  Furthermore, our solutions detach the algorithmic block size  from the target bandwidth, illustrating the important performance benefits of this decision.
Revised:  Furthermore, our solutions employ an algorithmic block size from the target bandwidth, illustrating the important performance benefits of this decision.
Edit intent: clarity
Original:  Furthermore, our solutions detach the algorithmic block size  from the target bandwidth, illustrating the important performance benefits of this decision.
Revised:  Furthermore, our solutions detach the algorithmic block size that differs from the target bandwidth, illustrating the important performance benefits of this decision.
Edit intent: clarity
Original:  Finally, we show that our alternative compact band form for singular value problems is key to introduce  look-ahead  into the corresponding reduction procedure.
Revised:  Finally, we show that our alternative compact band form for singular value problems is key to introduce an effective look-ahead into the corresponding reduction procedure.
Edit intent: clarity
Original:  Finally, we show that our alternative compact band form for singular value problems is key to introduce  look-ahead  into the corresponding reduction procedure.
Revised:  Finally, we show that our alternative compact band form for singular value problems is key to introduce look-ahead strategy into the corresponding reduction procedure.
Edit intent: clarity
Original: We propose a generalized local framework , addressing locking in degenerated Reissner-Mindlin plate and shell formulations in the context of isogeometric analysis.
Revised: We propose a framework , addressing locking in degenerated Reissner-Mindlin plate and shell formulations in the context of isogeometric analysis.
Edit intent: clarity
Original:  The formulation is general and allows the flexible utilization of basis functions of different order as the projection bases.
Revised:  The formulation allows the flexible utilization of basis functions of different order as the projection bases.
Edit intent: coherence
Original:  Through numerical examples, we show the consistency of the scheme , although the method is not Hu-Washizu variationally consistent.
Revised:  We show the numerical consistency of the scheme , although the method is not Hu-Washizu variationally consistent.
Edit intent: clarity
Original:  The numerical examples show that the proposed formulation alleviates locking and yields good accuracy for various thicknesses, even for slenderness ratios of 1 \times 10^5, and has the ability to capture deformations of thin shells using relatively coarse meshes.
Revised:  The numerical examples show that the proposed formulation alleviates locking and yields good accuracy even for slenderness ratios of 1 \times 10^5, and has the ability to capture deformations of thin shells using relatively coarse meshes.
Edit intent: clarity
Original:  From the detailed numerical study, it can be opined that the proposed method is less sensitive to locking and mesh distortion.
Revised:  In addition it can be opined that the proposed method is less sensitive to locking and mesh distortion.
Edit intent: clarity
Original:  While provably consistent algorithms exists, they either make assumptions about the population that are hard to check \mbox{ zhang2014detecting or are too computationally expensive \mbox{ MMSBAnandkumar2014 under the popular Mixed Membership Stochastic Blockmodel (MMSB)
Revised:  While provably consistent algorithms exists, they either make assumptions about the population (Zhang et al., 2014; Jin et al., 2017), or are too computationally expensive \mbox{ MMSBAnandkumar2014 under the popular Mixed Membership Stochastic Blockmodel (MMSB)
Edit intent: clarity
Original:  As a byproduct of our analysis, we derive sharp row-wise eigenvector deviation bounds, and provide a cleaning step that improves the performance drastically for sparse networks.
Revised:  As a byproduct of our analysis, we derive sharp row-wise eigenvector deviation bounds, and provide a cleaning step that improves the performance significantly for sparse networks.
Edit intent: clarity
Original:  We also propose both necessary and sufficient conditions for identifiability of the model, while existing methods typically present sufficient conditions for identifiability of the model involved .
Revised:  We also propose both necessary and sufficient conditions for identifiability of the model, while existing methods typically present sufficient conditions .
Edit intent: clarity
Original: Sand-bubbler crabs of the genera Dotilla and Scopimera  are known to produce remarkable patterns and structures at tropical beaches.
Revised: Sand-bubbler crabs of the genera Dotilla and Scopimera which are known to produce remarkable patterns and structures at tropical beaches.
Edit intent: coherence
Original:  A simple mathematical model of sand--bubbler patterns is proposed and an algorithm is designed that may create such  patterns artificially.
Revised:  A simple mathematical model of sand--bubbler patterns is proposed and an algorithm is designed that may create such sand-bubbler patterns artificially.
Edit intent: fluency
Original:   In this article, Feynman path integral formalism and quantum superposition of propagating particles are combined in a multi-plane and multi-slit based interference set-up to present a novel quantum computing (QC) architecture denoted by quantum path computing (QPC) without utilizing qubits and gate operations but exploiting superposition interference on the intensity distribution on the sensor planes.
Revised:  In this article, Feynman path integral formalism and quantum superposition of propagating particles are combined in a multi-plane and multi-slit based interference set-up to present a novel computing architecture denoted by quantum path computing (QPC) without utilizing qubits and gate operations but exploiting superposition interference on the intensity distribution on the sensor planes.
Edit intent: clarity
Original:  Hidden subgroup problem (HSP) is solved with a period finding solution in complete analogy with the existing period finding algorithms utilizing qubits and quantum gate structures.
Revised:  Hidden subgroup problem (HSP) is solved with a period finding solution in complete analogy with period finding algorithms utilizing qubits and quantum gate structures.
Edit intent: clarity
Original: Double slit interference experiment is at the heart of quantum mechanics by clearly presenting wave-particle duality and quantum nature for particles as emphasized by Richard Feynman.
Revised: Double slit interference experiment is fundamental for quantum mechanics (QM) presenting wave-particle duality and quantum nature for particles as emphasized by Richard Feynman.
Edit intent: clarity
Original: Double slit interference experiment is at the heart of quantum mechanics by clearly presenting wave-particle duality and quantum nature for particles as emphasized by Richard Feynman.
Revised: Double slit interference experiment is at the heart of quantum mechanics by clearly presenting wave-particle duality as emphasized by Richard Feynman.
Edit intent: coherence
Original:  Previous quantum computing (QC) architectures utilizing wave nature with simple set-ups in combination with quantum superposition interference result in QC speed-up with the cost of exponential increase in resources such as time, space or energy.
Revised:  Previous quantum computing (QC) architectures with simple interference set-ups in combination with quantum superposition interference result in QC speed-up with the cost of exponential increase in resources such as time, space or energy.
Edit intent: clarity
Original:  Previous quantum computing (QC) architectures utilizing wave nature with simple set-ups in combination with quantum superposition interference result in QC speed-up with the cost of exponential increase in resources such as time, space or energy.
Revised:  Previous quantum computing (QC) architectures utilizing wave nature with simple set-ups utilizing generally the wave nature and superposition have cost of exponential increase in resources such as time, space or energy.
Edit intent: clarity
Original:  Previous quantum computing (QC) architectures utilizing wave nature with simple set-ups in combination with quantum superposition interference result in QC speed-up with the cost of exponential increase in resources such as time, space or energy.
Revised:  Previous quantum computing (QC) architectures utilizing wave nature with simple set-ups in combination with quantum superposition interference result in QC speed-up with the cost of exponential increase in resources of time, space or energy.
Edit intent: clarity
Original:  In this article, wave-particle duality of propagating electrons is exploited in a simple  interference set-up to present a novel computing architecture denoted by quantum path computing (QPC) targeting a low complexity QC architecture .
Revised:  In this article, wave-particle duality of propagating electrons is exploited in a simple interference set-up with a novel QC architecture denoted by quantum path computing (QPC) targeting a low complexity QC architecture .
Edit intent: clarity
Original:  In this article, wave-particle duality of propagating electrons is exploited in a simple  interference set-up to present a novel computing architecture denoted by quantum path computing (QPC) targeting a low complexity QC architecture .
Revised:  In this article, wave-particle duality of propagating electrons is exploited in a simple interference set-up to present a novel computing architecture denoted by quantum path computing (QPC) .
Edit intent: coherence
Original:  It is composed of multiple planes and Gaussian slits combining trajectories of the particle nature with constructive and destructive interference measurements of the wave nature.
Revised:  It is composed of multiple planes and Gaussian slits combining trajectories of the particle nature while performing interference measurements exploiting the wave nature.
Edit intent: clarity
Original:  QPC does not explicitly require exponential complexity of resources by utilizing entangled path history inherently existing in  set-up with a unique formulation of Feynman's path integral which naturally includes path histories.
Revised:  QPC does not explicitly require exponential complexity of resources by utilizing entangled path history inherently existing in set-up and path integrals naturally including histories.
Edit intent: clarity
Original:  Hidden subgroup problem (HSP) is solved with QPC in complete analogy with period finding algorithms utilizing quantum gate circuits and entanglement resources as a fundamental QC tool.
Revised:  Hidden subgroup problem is solved as a fundamental QC tool in analogy with period finding algorithms utilizing quantum gate circuits and entanglement resources as a fundamental QC tool.
Edit intent: clarity
Original:  QPC promises solutions of particular instances of simultaneous Diophantine approximation problem as a practical application while determining the computational complexity of the problem solving capability is an open issue.
Revised:  QPC promises solutions of particular instances of simultaneous Diophantine approximation problem as a practical application while determining the computational complexity of solving capability is an open issue.
Edit intent: fluency
Original:  Previous models of interference set-ups analyzing exotic paths in single plane systems are extended to multi-plane set-up while simulations consider non-negligible effects of multiple exotic paths.
Revised:  In addition, single plane interference systems analyzing exotic paths in single plane systems are extended to multi-plane set-up while simulations consider non-negligible effects of multiple exotic paths.
Edit intent: clarity
Original:  Previous models of interference set-ups analyzing exotic paths in single plane systems are extended to multi-plane set-up while simulations consider non-negligible effects of multiple exotic paths.
Revised:  Previous models of interference set-ups analyzing exotic paths are extended to multi-plane set-up while simulations consider non-negligible effects of multiple exotic paths.
Edit intent: clarity
Original:  The challenges are discussed for modeling computational complexity of efficiently solvable problems, designing optimum set-up and experimental aspects including source energy and detection sensitivity depending on problem complexity .
Revised:  Challenges are discussed for modeling computational complexity of efficiently solvable problems, designing optimum set-up and experimental aspects including source energy and detection sensitivity depending on problem complexity .
Edit intent: clarity
Original:  The challenges are discussed for modeling computational complexity of efficiently solvable problems, designing optimum set-up and experimental aspects including source energy and detection sensitivity depending on problem complexity .
Revised:  The challenges are discussed for modeling complexity and experimental aspects including source energy and detection sensitivity depending on problem complexity .
Edit intent: clarity
Original:  The challenges are discussed for modeling computational complexity of efficiently solvable problems, designing optimum set-up and experimental aspects including source energy and detection sensitivity depending on problem complexity .
Revised:  The challenges are discussed for modeling computational complexity of efficiently solvable problems, designing optimum set-up and experimental aspects including source energy and detection sensitivity .
Edit intent: clarity
Original:  Previous quantum computing (QC) architectures with simple interference set-ups utilizing generally the wave nature and superposition have cost of exponential increase in resources of time, space or energy.
Revised:  Previous quantum computing (QC) architectures with simple interference set-ups utilizing generally the wave nature and superposition have cost of exponential complexity of resources in time, space or energy.
Edit intent: clarity
Original: We consider the problem of implementing a given conditional distribution relating the states of a physical system at two separate times using a physical process with (potentially time-inhomogeneous) master equation dynamics .
Revised: We consider the problem of how to construct a physical process over a state space X that applies some desired conditional distribution P to initial states to produce final states .
Edit intent: clarity
Original:  This problem arises implicitly in many nonequilibrium statistical physics scenarios, e.g., when designing processes to implement some desired computations , feedback-control protocols, and Maxwellian demons.
Revised:  This problem arises implicitly in many nonequilibrium statistical physics ( e.g., when designing processes to implement some desired computations , feedback-control protocols, and Maxwellian demons.
Edit intent: clarity
Original:  This problem arises implicitly in many nonequilibrium statistical physics scenarios, e.g., when designing processes to implement some desired computations , feedback-control protocols, and Maxwellian demons.
Revised:  This problem arises implicitly in many nonequilibrium statistical physics scenarios, e.g., when designing processes to implement some desired computation , feedback-control protocols, and Maxwellian demons.
Edit intent: fluency
Original:  However it is known that many such conditional distributions P over a state space X cannot be implemented using  master equation dynamics over just the states in X.
Revised:  However it is known that there are classes of conditional distributions that cannot be implemented using master equation dynamics over just the states in X.
Edit intent: clarity
Original:  However it is known that many such conditional distributions P over a state space X cannot be implemented using  master equation dynamics over just the states in X.
Revised:  However it is known that many such conditional distributions P over a state space X cannot be implemented using master equation dynamics involving just the states in X.
Edit intent: clarity
Original:  In particular, we show that any conditional distribution can be implemented in a thermodynamically reversible manner (achieving zero entropy production) if there are enough hidden states available.
Edit intent: coherence
Original:  We investigate how the minimal number of such  states needed to implement any P in a thermodynamically reversible manner depends on P.
Revised:  We investigate how the minimal number of such states needed to implement some P in a thermodynamically reversible manner depends on P.
Edit intent: fluency
Original:  We provide exact results in the special case of conditional distributions that reduce to single-valued functions.
Revised:  We provide exact results in the special case of conditional distributions that represent single-valued functions.
Edit intent: clarity
Original:  For the fully general case, we provide an upper bound  in terms of the nonnegative rank of P.
Revised:  In the general case, we provide an upper bound in terms of the nonnegative rank of P.
Edit intent: clarity
Original:  It is known that there are classes of conditional distributions that cannot be implemented using any time-inhomogeneous master equation dynamics involving just the states in X.
Revised:  It was previously known that some conditional distributions cannot be implemented using any time-inhomogeneous master equation dynamics involving just the states in X.
Edit intent: clarity
Original:  It is known that there are classes of conditional distributions that cannot be implemented using any time-inhomogeneous master equation dynamics involving just the states in X.
Revised:  It is known that there are classes of conditional distributions that cannot be implemented using any master equation that involves just the states in X.
Edit intent: clarity
Original:  In the general case, we provide an upper bound on the needed number of hidden states in terms of the nonnegative rank of P.
Revised:  In the general case, we provide an upper bound for the general case, in terms of the nonnegative rank of P.
Edit intent: clarity
Original:  In particular, we show that if there are no constraints on what master equation we can construct, then having access to one extra binary degree of freedom ( doubling the total number of states ) is sufficient to carry out any P with zero entropy production.
Revised:  These results show that having access to one extra binary degree of freedom ( doubling the total number of states ) is sufficient to carry out any P with zero entropy production.
Edit intent: clarity
Original:  Our results also imply that for certain P that can be implemented without hidden states, having additional states available permits an implementation that generates less heat .
Revised:  Our results also imply that for certain P that can be implemented without hidden states, having hidden states permits an implementation that generates less heat .
Edit intent: clarity
Original:   is the relaxation time of the lazy random walk on G and d is the minimum degree in G. Alternatively, m can be estimated in O}\left( _{ %DIFDELCMD < \rm %%% unif } ^G) ^{ 3 / 4 } ) steps, where t}\right) _{ %DIFDELCMD < \rm %%% unif } ^G is the uniform mixing time on G. The algorithm is based on\left(}\frac{m}{n}}\right)  the number of intersections of random walk paths X,Y, i.e. the number of times (t,s) such that X_t=Y_s.
Revised:  steps, where t_{rel is the relaxation time of the lazy random walk on G and d is the minimum degree in G. Alternatively, m can be estimated in O}\left( _{ %DIFDELCMD < \rm %%% unif } ^G) ^{ 3 / 4 } ) steps, where t}\right) _{ %DIFDELCMD < \rm %%% unif } ^G is the uniform mixing time on G. The algorithm is based on\left(}\frac{m}{n}}\right) the number of intersections of random walk paths X,Y, i.e. the number of times (t,s) such that X_t=Y_s.
Edit intent: clarity
Original:   is the relaxation time of the lazy random walk on G and d is the minimum degree in G. Alternatively, m can be estimated in O}\left( _{ %DIFDELCMD < \rm %%% unif } ^G) ^{ 3 / 4 } ) steps, where t}\right) _{ %DIFDELCMD < \rm %%% unif } ^G is the uniform mixing time on G. The algorithm is based on\left(}\frac{m}{n}}\right)  the number of intersections of random walk paths X,Y, i.e. the number of times (t,s) such that X_t=Y_s.
Revised:  is the relaxation time of the lazy random walk on G and d is the minimum degree in G. Alternatively, m can be estimated in O}\left(t _{ %DIFDELCMD < \rm %%% unif } ^G) ^{ 3 / 4 } ) steps, where t}\right) _{ %DIFDELCMD < \rm %%% unif } ^G is the uniform mixing time on G. The algorithm is based on\left(}\frac{m}{n}}\right) the number of intersections of random walk paths X,Y, i.e. the number of times (t,s) such that X_t=Y_s.
Edit intent: fluency
Original:   is the relaxation time of the lazy random walk on G and d is the minimum degree in G. Alternatively, m can be estimated in O}\left( _{ %DIFDELCMD < \rm %%% unif } ^G) ^{ 3 / 4 } ) steps, where t}\right) _{ %DIFDELCMD < \rm %%% unif } ^G is the uniform mixing time on G. The algorithm is based on\left(}\frac{m}{n}}\right)  the number of intersections of random walk paths X,Y, i.e. the number of times (t,s) such that X_t=Y_s.
Revised:  is the relaxation time of the lazy random walk on G and d is the minimum degree in G. Alternatively, m can be estimated in O}\left( _{ %DIFDELCMD < \rm %%% unif } ^G) ^{ 3 / 4 } ) steps, where t}\right), where n is the number of vertices and t _{ %DIFDELCMD < \rm %%% unif } ^G is the uniform mixing time on G. The algorithm is based on\left(}\frac{m}{n}}\right) the number of intersections of random walk paths X,Y, i.e. the number of times (t,s) such that X_t=Y_s.
Edit intent: clarity
Original:   is the relaxation time of the lazy random walk on G and d is the minimum degree in G. Alternatively, m can be estimated in O}\left( _{ %DIFDELCMD < \rm %%% unif } ^G) ^{ 3 / 4 } ) steps, where t}\right) _{ %DIFDELCMD < \rm %%% unif } ^G is the uniform mixing time on G. The algorithm is based on\left(}\frac{m}{n}}\right)  the number of intersections of random walk paths X,Y, i.e. the number of times (t,s) such that X_t=Y_s.
Revised:  is the relaxation time of the lazy random walk on G and d is the minimum degree in G. Alternatively, m can be estimated in O}\left( _{ %DIFDELCMD < \rm %%% unif } ^G) ^{ 3 / 4 } ) steps, where t}\right) _{ %DIFDELCMD < \rm %%% unif } is the uniform mixing time on G. The algorithm is based on\left(}\frac{m}{n}}\right) the number of intersections of random walk paths X,Y, i.e. the number of times (t,s) such that X_t=Y_s.
Edit intent: fluency