{"doc_id": "0803.0635", "revision_depth": "1", "before_revision": "Interaction graphs are a useful tool to investigate graphically the influence of feebacks in dynamical systems modelling complex systems with many interacting components in a non-spatial context. In [ 14 ] and [ 15 ] the authors showed with the help of a multi-scale anal- ysis that stochastic systems with infinite and finite degrees of freedom can be approximated by dynamical systems whose leading order time evolution is given by a combination of ordi- nary differential equations and Markov chains. The leading order term in these dynamical systems is called average dynamics and turns out to be an adequate concept to analyse such systemswith discrete and continuous state spaces. There are many complex systems that can be conveniently described inside such a state space setting, for example bio-molecular interactions. Both ODEs and Markov chains and their mutual interaction can be better understood and analysed through the introduction of the so called Interaction Graph, a con- cept originally invented for time-continuous dynamical systems [ 4 ]. In this paper the average dynamics is introduced as an heuristic tool to construct models of reaction networks with their qualitative properties explored in terms of connectivity properties of the Interaction Graphs for the ODEs, the Markov chain and the resulting average dynamics. In a second paper the question of stability, robustness and a possible modular structure of the complex system defined by the average dynamics is addressed .", "after_revision": "Time-continuous dynamical systems defined on graphs are often used to model complex systems with many interacting components in a non-spatial context. In the reverse sense attaching meaningful dynamics to given 'interaction diagrams' is a central bottleneck problem in many application areas, especially in cell biology where various such diagrams with different conventions describing molecular regulation are presently in use. In most situations these diagrams can only be interpreted by the use of both discrete and continuous variables during the modelling process, corresponding to both deterministic and stochastic hybrid dynamics. The conventions in genetics are well-known, and therefore we use this field for illustration purposes. In [ 25 ] and [ 26 ] the authors showed that with the help of a multi-scale analysis stochastic systems with both continuous variables and finite state spaces can be approximated by dynamical systems whose leading order time evolution is given by a combination of ordinary differential equations (ODEs) and Markov chains. The leading order term in these dynamical systems is called average dynamics and turns out to be an adequate concept to analyse a class of simplified hybrid systems. Once the dynamics is defifined the mutual interaction of both ODEs and Markov chains can be analysed through the (reverse) introduction of the so called Interaction Graph, a concept originally invented for time-continuous dynamical systems , see [ 5 ]. Here we transfer this graph concept to the average dynamics , which itself is introduced as an heuristic tool to construct models of reaction or contact networks. The graphical concepts introduced form the basis for any subsequent study of the qualitative properties of hybrid models in terms of connectivity and (feedback) loop formation .", "edit_actions": [{"type": "R", "before": "Interaction graphs are a useful tool to investigate graphically the influence of feebacks in dynamical systems modelling", "after": "Time-continuous dynamical systems defined on graphs are often used to model", "start_char_pos": 0, "end_char_pos": 120}, {"type": "A", "before": null, "after": "the reverse sense attaching meaningful dynamics to given 'interaction diagrams' is a central bottleneck problem in many application areas, especially in cell biology where various such diagrams with different conventions describing molecular regulation are presently in use. In most situations these diagrams can only be interpreted by the use of both discrete and continuous variables during the modelling process, corresponding to both deterministic and stochastic hybrid dynamics. The conventions in genetics are well-known, and therefore we use this field for illustration purposes. In", "start_char_pos": 199, "end_char_pos": 199}, {"type": "R", "before": "14", "after": "25", "start_char_pos": 202, "end_char_pos": 204}, {"type": "R", "before": "15", "after": "26", "start_char_pos": 213, "end_char_pos": 215}, {"type": "A", "before": null, "after": "that", "start_char_pos": 237, "end_char_pos": 237}, {"type": "R", "before": "anal- ysis that", "after": "analysis", "start_char_pos": 269, "end_char_pos": 284}, {"type": "R", "before": "infinite and finite degrees of freedom", "after": "both continuous variables and finite state spaces", "start_char_pos": 309, "end_char_pos": 347}, {"type": "R", "before": "ordi- nary differential equations", "after": "ordinary differential equations (ODEs)", "start_char_pos": 453, "end_char_pos": 486}, {"type": "R", "before": "such systemswith discrete and continuous state spaces. There are many complex systems that can be conveniently described inside such a state space setting, for example bio-molecular interactions. Both", "after": "a class of simplified hybrid systems. Once the dynamics is defifined the mutual interaction of both", "start_char_pos": 634, "end_char_pos": 834}, {"type": "R", "before": "and their mutual interaction can be better understood and", "after": "can be", "start_char_pos": 858, "end_char_pos": 915}, {"type": "A", "before": null, "after": "(reverse)", "start_char_pos": 937, "end_char_pos": 937}, {"type": "R", "before": "con- cept", "after": "concept", "start_char_pos": 989, "end_char_pos": 998}, {"type": "A", "before": null, "after": ", see", "start_char_pos": 1057, "end_char_pos": 1057}, {"type": "R", "before": "4", "after": "5", "start_char_pos": 1060, "end_char_pos": 1061}, {"type": "R", "before": "In this paper", "after": "Here we transfer this graph concept to", "start_char_pos": 1065, "end_char_pos": 1078}, {"type": "A", "before": null, "after": ", which itself", "start_char_pos": 1100, "end_char_pos": 1100}, {"type": "R", "before": "networks with their qualitative properties explored", "after": "or contact networks. The graphical concepts introduced form the basis for any subsequent study of the qualitative properties of hybrid models", "start_char_pos": 1168, "end_char_pos": 1219}, {"type": "R", "before": "properties of the Interaction Graphs for the ODEs, the Markov chain and the resulting average dynamics. In a second paper the question of stability, robustness and a possible modular structure of the complex system defined by the average dynamics is addressed", "after": "and (feedback) loop formation", "start_char_pos": 1245, "end_char_pos": 1504}], "sents_char_pos": [0, 195, 505, 688, 829, 1064, 1348]} {"doc_id": "0806.2989", "revision_depth": "1", "before_revision": "We present a simple agent-based model to study how the proximate triggering factor of a crash or a rally might relate to its fundamental mechanism, and vice versa. Our agents form opinions and invest , based on three sources of information, (i) public information, i.e. news, (ii) information from their \"friendship\" network , promoting imitation and (iii) private information. Agents use Bayesian learning to adapt their strategy according to the past relevance of the three sources of information . We find that rallies and crashes occur as amplifications of random lucky or unlucky streak of news, due to the feedback of these news on the agents' strategies into collective transient herding regimes. These ingredients provide a simple mechanism for the excess volatility documented in financial markets. Paradoxically, it is the attempt for investors to learn the level of relevance of the news on the price formation which leads to a dramatic amplification of the price volatility due to their collective search for the \"truth\" . A positive feedback loop is created by the two dominating mechanisms ( Bayesian learning and imitation) which, by reinforcing each other, result in rallies and crashes. The model offers a simple reconciliation of the two opposite (herding versus fundamental) proposals for the origin of crashes within a single framework and justifies the existence of two populations in the distribution of returns, exemplifying the concept that rallies and crashes are qualitatively different from the rest of the price moves.", "after_revision": "We present a simple agent-based model to study the development of a bubble and the consequential crash and investigate how their proximate triggering factor might relate to their fundamental mechanism, and vice versa. Our agents invest according to their opinion on future price movements, which is based on three sources of information, (i) public information, i.e. news, (ii) information from their \"friendship\" network and (iii) private information. Our bounded rational agents continuously adapt their trading strategy to the current market regime by weighting each of these sources of information in their trading decision according to its recent predicting performance . We find that bubbles originate from a random lucky streak of positive news, which, due to a feedback mechanism of these news on the agents' strategies develop into a transient collective herding regime. After this self-amplified exuberance, the price has reached an unsustainable high value, being corrected by a crash, which brings the price even below its fundamental value. These ingredients provide a simple mechanism for the excess volatility documented in financial markets. Paradoxically, it is the attempt for investors to adapt to the current market regime which leads to a dramatic amplification of the price volatility . A positive feedback loop is created by the two dominating mechanisms ( adaptation and imitation) which, by reinforcing each other, result in bubbles and crashes. The model offers a simple reconciliation of the two opposite (herding versus fundamental) proposals for the origin of crashes within a single framework and justifies the existence of two populations in the distribution of returns, exemplifying the concept that crashes are qualitatively different from the rest of the price moves.", "edit_actions": [{"type": "R", "before": "how the proximate triggering factor of a crash or a rally", "after": "the development of a bubble and the consequential crash and investigate how their proximate triggering factor", "start_char_pos": 47, "end_char_pos": 104}, {"type": "R", "before": "its", "after": "their", "start_char_pos": 121, "end_char_pos": 124}, {"type": "R", "before": "form opinions and invest ,", "after": "invest according to their opinion on future price movements, which is", "start_char_pos": 175, "end_char_pos": 201}, {"type": "D", "before": ", promoting imitation", "after": null, "start_char_pos": 325, "end_char_pos": 346}, {"type": "R", "before": "Agents use Bayesian learning to adapt their strategy according to the past relevance of the three", "after": "Our bounded rational agents continuously adapt their trading strategy to the current market regime by weighting each of these", "start_char_pos": 378, "end_char_pos": 475}, {"type": "A", "before": null, "after": "in their trading decision according to its recent predicting performance", "start_char_pos": 499, "end_char_pos": 499}, {"type": "R", "before": "rallies and crashes occur as amplifications of random lucky or unlucky streak of news, due to the feedback", "after": "bubbles originate from a random lucky streak", "start_char_pos": 515, "end_char_pos": 621}, {"type": "A", "before": null, "after": "positive news, which, due to a feedback mechanism of", "start_char_pos": 625, "end_char_pos": 625}, {"type": "R", "before": "into collective transient herding regimes.", "after": "develop into a transient collective herding regime. After this self-amplified exuberance, the price has reached an unsustainable high value, being corrected by a crash, which brings the price even below its fundamental value.", "start_char_pos": 663, "end_char_pos": 705}, {"type": "R", "before": "learn the level of relevance of the news on the price formation", "after": "adapt to the current market regime", "start_char_pos": 860, "end_char_pos": 923}, {"type": "D", "before": "due to their collective search for the \"truth\"", "after": null, "start_char_pos": 988, "end_char_pos": 1034}, {"type": "R", "before": "Bayesian learning", "after": "adaptation", "start_char_pos": 1108, "end_char_pos": 1125}, {"type": "R", "before": "rallies", "after": "bubbles", "start_char_pos": 1185, "end_char_pos": 1192}, {"type": "D", "before": "rallies and", "after": null, "start_char_pos": 1467, "end_char_pos": 1478}], "sents_char_pos": [0, 163, 377, 501, 705, 809, 1205]} {"doc_id": "0904.0631", "revision_depth": "1", "before_revision": "Glycosylation is a highly complex process to produce a diverse repertoire of cellular glycans that are frequently attached to proteins and lipids. Glycans participate in fundamental biological processes including protein folding and clearance, cell proliferation and apoptosis, development, immune response , and pathogenesis. As one of the major types of glycans, N-linked glycans are formed by sequential attachments of monosaccharides into proteins with the help of a limited number of enzymes. Many of these enzymes can accept multiple N-linked glycans as substrates, thus generating a large number of glycan intermediates and their intermingled pathways. Motivated by the quantitative methods developed in complex network research, we investigated the URLanization of such N-linked glycosylation pathways in mammalian cells. The N-linked glycosylation pathways were found to be extremely modular, while composed of cohesive topological modules all directly branched from the common upstream pathway of glycan synthesis. This unique structural property allows the glycan production between modules to be controlled in that upstream region. Although the enzymes involved in multiple glycan substrates indicate cross-talk between modules, the impact of the cross-talk on the module-specific enhancement of glycan synthesis could be confined within a moderate range by transcriptional-level control. Our findings give the experimentally-testable predictions for glycosylation processes, and can be potentially applied to the engineering of therapeutic glycoproteins .", "after_revision": "Glycosylation is a highly complex process to produce a diverse repertoire of cellular glycans that are attached to proteins and lipids. Glycans are involved in fundamental biological processes , including protein folding and clearance, cell proliferation and apoptosis, development, immune responses , and pathogenesis. One of the major types of glycans, N-linked glycans , is formed by sequential attachments of monosaccharides to proteins by a limited number of enzymes. Many of these enzymes can accept multiple N-linked glycans as substrates, thereby generating a large number of glycan intermediates and their intermingled pathways. Motivated by the quantitative methods developed in complex network research, we investigated the URLanization of such N-linked glycosylation pathways in mammalian cells. The N-linked glycosylation pathways are extremely modular, and are composed of cohesive topological modules that directly branch from a common upstream pathway of glycan synthesis. This unique structural property allows the glycan production between modules to be controlled by the upstream region. Although the enzymes act on multiple glycan substrates , indicating cross-talk between modules, the impact of the cross-talk on the module-specific enhancement of glycan synthesis may be confined within a moderate range by transcription-level control. The findings of the present study provide experimentally-testable predictions for glycosylation processes, and may be applicable to therapeutic glycoprotein engineering .", "edit_actions": [{"type": "D", "before": "frequently", "after": null, "start_char_pos": 103, "end_char_pos": 113}, {"type": "R", "before": "participate", "after": "are involved", "start_char_pos": 155, "end_char_pos": 166}, {"type": "A", "before": null, "after": ",", "start_char_pos": 203, "end_char_pos": 203}, {"type": "R", "before": "response", "after": "responses", "start_char_pos": 299, "end_char_pos": 307}, {"type": "R", "before": "As one", "after": "One", "start_char_pos": 328, "end_char_pos": 334}, {"type": "R", "before": "are", "after": ", is", "start_char_pos": 383, "end_char_pos": 386}, {"type": "R", "before": "into proteins with the help of", "after": "to proteins by", "start_char_pos": 439, "end_char_pos": 469}, {"type": "R", "before": "thus", "after": "thereby", "start_char_pos": 573, "end_char_pos": 577}, {"type": "R", "before": "were found to be", "after": "are", "start_char_pos": 867, "end_char_pos": 883}, {"type": "R", "before": "while", "after": "and are", "start_char_pos": 903, "end_char_pos": 908}, {"type": "R", "before": "all directly branched from the", "after": "that directly branch from a", "start_char_pos": 950, "end_char_pos": 980}, {"type": "R", "before": "in that", "after": "by the", "start_char_pos": 1120, "end_char_pos": 1127}, {"type": "R", "before": "involved in", "after": "act on", "start_char_pos": 1166, "end_char_pos": 1177}, {"type": "R", "before": "indicate", "after": ", indicating", "start_char_pos": 1205, "end_char_pos": 1213}, {"type": "R", "before": "could", "after": "may", "start_char_pos": 1326, "end_char_pos": 1331}, {"type": "R", "before": "transcriptional-level control. Our findings give the", "after": "transcription-level control. The findings of the present study provide", "start_char_pos": 1371, "end_char_pos": 1423}, {"type": "R", "before": "can be potentially applied to the engineering of therapeutic glycoproteins", "after": "may be applicable to therapeutic glycoprotein engineering", "start_char_pos": 1493, "end_char_pos": 1567}], "sents_char_pos": [0, 146, 327, 498, 660, 830, 1025, 1144, 1401]} {"doc_id": "0904.1426", "revision_depth": "1", "before_revision": " Asset backed securities have been extensively criticised for creating a moral hazard in loan issuance by removing any incentive on the lender to ensure that the recipient of such loans could repay them. However the inter-relationship between money and loans within the commercial banking system, also suggests that deeper systemic issues can accompany any form of unlimited commercial bank lending . This paper examines the question of why speculative demand for credit during credit bubbles is not naturally constrained by regulated limits within the banking system on the supply of loans. In particular, we propose an explanation for the current credit crisis, as a fundamental, systemic failure in the system of rules governing the behaviour of the reserve based banking system, which have resulted in the effective removal of central bank control over money and loan supply expansion. This situation has arisen from the presence of two 'bugs' in the underlying regulations controlling the banking system: securitized loans, which allow the sale of loans issued against fractional reserve controlled deposits to entities outside of the commercial banking system; and allowing debt instruments , in particular securitized loans to be part of bank equity capital reserves which are used for the purpose of regulating the total quantity of credit created by the banking system. We argue that the interaction of these two problems has led to unregulated growth in both the money and loan supplies, and to a dangerously destabilising imbalance between total money and loan supply growth, in that total lending from the commercial bank sector has increased at a faster rate than the accompanying money supply growth supporting it .", "after_revision": "Analysis of the 2007-8 credit crisis has concentrated on issues of relaxed lending standards, and the perception of irrational behaviour by speculative investors in real estate and other assets. Asset backed securities have been extensively criticised for creating a moral hazard in loan issuance and an associated increase in default risk, by removing the immediate lender's incentive to ensure that the underlying loans could be repaid. However significant monetary issues can accompany any form of increased commercial bank lending , and these appear to have been overlooked by this analysis. In this paper we propose a general explanation for credit crises based on an examination of the mechanics of the banking system, and in particular its internal controls on the supply of credit. We suggest that the current credit crisis is the result of multiple failures in the Basel regulatory framework, including the removal of central bank reserve requirements from some classes of deposit accounts within the banking system, allowing financial instruments representing debt to be used as regulatory capital, and in particular the introduction of securitized lending which effectively removed a previously implicit control over the total quantity of lending originating from the banking system. We further argue that the interaction of these problems has led to a destabilising imbalance between total money and loan supply growth, in that total lending sourced from the commercial bank sector increased at a faster rate than accompanying growth in the money supply. This not only created a multi-decade macro-economic debt spiral, but by increasing the ratio of debt to money within the monetary system acted to increase the risk of loan defaults, and consequentially reduce the overall stability of the banking system .", "edit_actions": [{"type": "A", "before": null, "after": "Analysis of the 2007-8 credit crisis has concentrated on issues of relaxed lending standards, and the perception of irrational behaviour by speculative investors in real estate and other assets.", "start_char_pos": 0, "end_char_pos": 0}, {"type": "R", "before": "by removing any incentive on the lender", "after": "and an associated increase in default risk, by removing the immediate lender's incentive", "start_char_pos": 103, "end_char_pos": 142}, {"type": "R", "before": "recipient of such loans could repay them. However the inter-relationship between money and loans within the commercial banking system, also suggests that deeper systemic", "after": "underlying loans could be repaid. However significant monetary", "start_char_pos": 162, "end_char_pos": 331}, {"type": "R", "before": "unlimited", "after": "increased", "start_char_pos": 365, "end_char_pos": 374}, {"type": "R", "before": ". This paper examines the question of why speculative demand for credit during credit bubbles is not naturally constrained by regulated limits within the banking system on the supply of loans. In particular, we propose an explanation for the current credit crisis, as a fundamental, systemic failure in the system of rules governing the behaviour of the reserve based", "after": ", and these appear to have been overlooked by this analysis. In this paper we propose a general explanation for credit crises based on an examination of the mechanics of the", "start_char_pos": 399, "end_char_pos": 766}, {"type": "R", "before": "which have resulted in the effective removal of central bank control over money and loan supply expansion. This situation has arisen from the presence of two 'bugs' in the underlying regulations controlling the banking system: securitized loans, which allow the sale of loans issued against fractional reserve controlled deposits to entities outside of the commercial banking system; and allowing debt instruments , in particular securitized loans to be part of bank equity capital reserves which are used for the purpose of regulating the", "after": "and in particular its internal controls on the supply of credit. We suggest that the current credit crisis is the result of multiple failures in the Basel regulatory framework, including the removal of central bank reserve requirements from some classes of deposit accounts within the banking system, allowing financial instruments representing debt to be used as regulatory capital, and in particular the introduction of securitized lending which effectively removed a previously implicit control over the", "start_char_pos": 783, "end_char_pos": 1322}, {"type": "R", "before": "credit created by", "after": "lending originating from", "start_char_pos": 1341, "end_char_pos": 1358}, {"type": "A", "before": null, "after": "further", "start_char_pos": 1382, "end_char_pos": 1382}, {"type": "D", "before": "two", "after": null, "start_char_pos": 1419, "end_char_pos": 1422}, {"type": "R", "before": "unregulated growth in both the money and loan supplies, and to a dangerously", "after": "a", "start_char_pos": 1443, "end_char_pos": 1519}, {"type": "A", "before": null, "after": "sourced", "start_char_pos": 1610, "end_char_pos": 1610}, {"type": "D", "before": "has", "after": null, "start_char_pos": 1643, "end_char_pos": 1646}, {"type": "R", "before": "the accompanying money supply growth supporting it", "after": "accompanying growth in the money supply. This not only created a multi-decade macro-economic debt spiral, but by increasing the ratio of debt to money within the monetary system acted to increase the risk of loan defaults, and consequentially reduce the overall stability of the banking system", "start_char_pos": 1679, "end_char_pos": 1729}], "sents_char_pos": [0, 203, 400, 591, 889, 1166, 1378]} {"doc_id": "0904.4155", "revision_depth": "2", "before_revision": "This paper discovers fundamental principles of the backoff process that governs the performance of IEEE 802.11. We first %DIFDELCMD < {\\it %%% establish that the so-called mean field technique, which spins off a fixed point equation, is mathematically valid for use in performance analysis of 802.11. On the basis of this , succinct equations describing the backoff distribution as a function of the collision probability \\gamma are derived . In addition, the observation that the %DIFDELCMD < {\\it %%% entropy of the backoff process in 802.11 increases with the number of nodes leads us to see through a Poissonian character inherent in 802.11. However, it is also found that the %DIFDELCMD < {\\it %%% collision effect between nodes prevails over the %DIFDELCMD < {\\it %%% Poissonian aggregation effect in spite of its tendency to increase with the number of nodes. Based on these findings, we formulate the principle about the inter-transmission probability that lays a foundation for the short-term fairness analysis. Another principle discovered upon regular variation theory is that the per-packet backoff has a truncated%DIFDELCMD < {\\it %%% Pareto-type tail distribution with an exponent of (\\log \\gamma)/\\log m (m is the multiplicative factor). This reveals that the backoff process is heavy-tailed in the strict sense for m^2 \\gamma > 1, essentially due to collision. Moreover, we identify the%DIFDELCMD < {\\it %%% long-range dependence in 802.11 and show that the inter-transmission probability undergoes a dramatic change at \\gamma_0=1/m^2 and falls into two qualitatively distinct categories: either approximately Gaussian or %DIFDELCMD < {\\it %%% L\\'evy \\alpha-stable distribution with \\alpha \\in (1,2) entailing infinite variances,%DIFDELCMD < {\\it %%% leaning tendency, and%DIFDELCMD < {\\it %%% directional unfairness .", "after_revision": "This paper discovers fundamental principles of the backoff process that governs the performance of IEEE 802.11. We first %DIFDELCMD < {\\it %%% make a simplistic Palm interpretation of the Bianchi's formula and on the basis of which , succinct equations describing the backoff distribution as a function of the collision probability \\gamma are derived , which also correct a possible misunderstanding in the field. The observation that the %DIFDELCMD < {\\it %%% entropy of the backoff process in 802.11 increases with the number of nodes leads us to see through a Poissonian character inherent in 802.11. However, it is also found that the %DIFDELCMD < {\\it %%% collision effect between nodes prevails over the %DIFDELCMD < {\\it %%% Poissonian aggregation effect in spite of its tendency to increase with the number of nodes. Based on these findings, we formulate the principle about the inter-transmission probability that lays a foundation for the short-term fairness analysis. Another principle discovered upon regular variation theory is that the %DIFDELCMD < {\\it %%% backoff times have a truncated Pareto-type tail distribution with an exponent of (\\log \\gamma)/\\log m (m is the multiplicative factor). This reveals that the backoff process is heavy-tailed in the strict sense for m^2 \\gamma > 1, essentially due to collision. Moreover, we identify %DIFDELCMD < {\\it %%% long-range dependence in 802.11 through both of mathematical and empirical wavelet-based analyses and answer a riddle: the absence of long range dependence in aggregate total load. We also show that the inter-transmission probability undergoes a dramatic change at \\gamma_0=1/m^2 and falls into two qualitatively distinct categories: either approximately Gaussian or %DIFDELCMD < {\\it %%% L\\'evy \\alpha-stable distribution with \\alpha \\in (1,2) %DIFDELCMD < {\\it %%% %DIFDELCMD < {\\it %%% .", "edit_actions": [{"type": "D", "before": "establish", "after": null, "start_char_pos": 143, "end_char_pos": 152}, {"type": "R", "before": "that the so-called mean field technique, which spins off a fixed point equation, is mathematically valid for use in performance analysis of 802.11. On the basis of this", "after": "make a simplistic Palm interpretation of the Bianchi's formula and on the basis of which", "start_char_pos": 153, "end_char_pos": 321}, {"type": "R", "before": ". In addition, the", "after": ", which also correct a possible misunderstanding in the field. The", "start_char_pos": 441, "end_char_pos": 459}, {"type": "R", "before": "entropy", "after": "entropy", "start_char_pos": 503, "end_char_pos": 510}, {"type": "R", "before": "collision", "after": "collision", "start_char_pos": 703, "end_char_pos": 712}, {"type": "R", "before": "Poissonian aggregation", "after": "Poissonian aggregation", "start_char_pos": 774, "end_char_pos": 796}, {"type": "D", "before": "per-packet backoff has a truncated", "after": null, "start_char_pos": 1092, "end_char_pos": 1126}, {"type": "A", "before": null, "after": "backoff times have a truncated", "start_char_pos": 1148, "end_char_pos": 1148}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1400, "end_char_pos": 1403}, {"type": "R", "before": "and", "after": "through both of mathematical and empirical wavelet-based analyses and answer a riddle: the absence of long range dependence in aggregate total load. We also", "start_char_pos": 1457, "end_char_pos": 1460}, {"type": "D", "before": "entailing infinite variances,", "after": null, "start_char_pos": 1717, "end_char_pos": 1746}, {"type": "D", "before": "leaning", "after": null, "start_char_pos": 1768, "end_char_pos": 1775}, {"type": "D", "before": "tendency, and", "after": null, "start_char_pos": 1776, "end_char_pos": 1789}, {"type": "D", "before": "directional", "after": null, "start_char_pos": 1811, "end_char_pos": 1822}, {"type": "D", "before": "unfairness", "after": null, "start_char_pos": 1823, "end_char_pos": 1833}], "sents_char_pos": [0, 111, 300, 442, 645, 866, 1020, 1253, 1377]} {"doc_id": "0910.0165", "revision_depth": "1", "before_revision": "Although widely used in practice, the behavior and accuracy of the popular module identification technique called modularity maximization is not well understood . Here, we present a broad and systematic characterization of its performance in practical situations. First, we generalize and clarify the recently identified resolution limit phenomenon . Second, we show that the modularity function Q exhibits extreme degeneracies: that is, the modularity landscape admits an exponential number of distinct high-scoring solutions and does not typically exhibit a clear global maximum. Third, we derive the limiting behavior of the maximum modularity Q_max for infinitely modular networks, showing that it depends strongly on the size of the network and the number of module-like subgraphs it contains. Finally, using three real-world examples of metabolic networks , we show that the degenerate solutions can fundamentally disagree on the composition of even the largest modules. Together, these results significantly extend and clarify our understanding of this popular method. In particular, they explain why so manyheuristics perform well in practice at finding high-scoring partitions, why these heuristics can disagree on the composition of the identified modules , and how the estimated value of Q_max should be interpreted. Further, they imply that the output of any modularity maximization procedure should be interpreted cautiously in scientific contexts. We conclude by discussing avenues for mitigating these behaviors, such as combining information from many degenerate solutions or using generative models.", "after_revision": "Although widely used in practice, the behavior and accuracy of the popular module identification technique called modularity maximization is not well understood in practical contexts . Here, we present a broad characterization of its performance in such situations. First, we revisit and clarify the resolution limit phenomenon for modularity maximization . Second, we show that the modularity function Q exhibits extreme degeneracies: it typically admits an exponential number of distinct high-scoring solutions and typically lacks a clear global maximum. Third, we derive the limiting behavior of the maximum modularity Q_max for one model of infinitely modular networks, showing that it depends strongly both on the size of the network and on the number of modules it contains. Finally, using three real-world metabolic networks as examples , we show that the degenerate solutions can fundamentally disagree on many, but not all, partition properties such as the composition of the largest modules and the distribution of module sizes. These results imply that the output of any modularity maximization procedure should be interpreted cautiously in scientific contexts. They also explain why many heuristics are often successful at finding high-scoring partitions in practice and why different heuristics can disagree on the modular structure of the same network. We conclude by discussing avenues for mitigating some of these behaviors, such as combining information from many degenerate solutions or using generative models.", "edit_actions": [{"type": "A", "before": null, "after": "in practical contexts", "start_char_pos": 161, "end_char_pos": 161}, {"type": "D", "before": "and systematic", "after": null, "start_char_pos": 189, "end_char_pos": 203}, {"type": "R", "before": "practical", "after": "such", "start_char_pos": 243, "end_char_pos": 252}, {"type": "R", "before": "generalize", "after": "revisit", "start_char_pos": 275, "end_char_pos": 285}, {"type": "D", "before": "recently identified", "after": null, "start_char_pos": 302, "end_char_pos": 321}, {"type": "A", "before": null, "after": "for modularity maximization", "start_char_pos": 350, "end_char_pos": 350}, {"type": "R", "before": "that is, the modularity landscape", "after": "it typically", "start_char_pos": 431, "end_char_pos": 464}, {"type": "R", "before": "does not typically exhibit", "after": "typically lacks", "start_char_pos": 533, "end_char_pos": 559}, {"type": "A", "before": null, "after": "one model of", "start_char_pos": 659, "end_char_pos": 659}, {"type": "A", "before": null, "after": "both", "start_char_pos": 722, "end_char_pos": 722}, {"type": "A", "before": null, "after": "on", "start_char_pos": 754, "end_char_pos": 754}, {"type": "R", "before": "module-like subgraphs", "after": "modules", "start_char_pos": 769, "end_char_pos": 790}, {"type": "R", "before": "examples of metabolic networks", "after": "metabolic networks as examples", "start_char_pos": 836, "end_char_pos": 866}, {"type": "R", "before": "the composition of even the largest modules. Together, these results significantly extend and clarify our understanding of this popular method. In particular, they explain why so manyheuristics perform well in practice at finding high-scoring partitions, why these heuristics can disagree on", "after": "many, but not all, partition properties such as", "start_char_pos": 937, "end_char_pos": 1228}, {"type": "R", "before": "identified modules , and how the estimated value of Q_max should be interpreted. Further, they", "after": "largest modules and the distribution of module sizes. These results", "start_char_pos": 1252, "end_char_pos": 1346}, {"type": "A", "before": null, "after": "They also explain why many heuristics are often successful at finding high-scoring partitions in practice and why different heuristics can disagree on the modular structure of the same network.", "start_char_pos": 1467, "end_char_pos": 1467}, {"type": "A", "before": null, "after": "some of", "start_char_pos": 1517, "end_char_pos": 1517}], "sents_char_pos": [0, 163, 264, 352, 583, 803, 981, 1080, 1332, 1466]} {"doc_id": "1001.0656", "revision_depth": "1", "before_revision": "We develop a theoretical trading conditioning model subject to price volatility and return in terms of market psychological behavior, based on a volume-price probability wave distribution in which we use transaction volume probability to describe price volatility uncertainty and intensity. Applying the model to high frequent data test in China stock market, we have main findings as follows: 1) there are , in general, significant positive correlations between the rate of mean return and that of change in both trading conditioning intensity and the amount of transaction ; 2) they lack significance in spite of positive correlations in two time intervals right before and just after bubble crashes; and 3) there exists , particularly, significant negative correlation between the rate of mean return and that of change in trading conditioning intensity when SEE Composite Index is rising during bull market. The model and findings can help to well explain disposition effect and excessive trading, to time bubble crash, and to understand other anomalies in stock market.", "after_revision": "We develop a theoretical trading conditioning model subject to price volatility and return information in terms of market psychological behavior, based on analytical transaction volume-price probability wave distributions in which we use transaction volume probability to describe price volatility uncertainty and intensity. Applying the model to high frequent data test in China stock market, we have main findings as follows: 1) there is , in general, significant positive correlation between the rate of mean return and that of change in trading conditioning intensity ; 2) it lacks significance in spite of positive correlation in two time intervals right before and just after bubble crashes; and 3) it shows , particularly, significant negative correlation in a time interval when SSE Composite Index is rising during bull market. Our model and findings can test both disposition effect and herd behavior simultaneously, and explain excessive trading (volume) and other anomalies in stock market.", "edit_actions": [{"type": "A", "before": null, "after": "information", "start_char_pos": 91, "end_char_pos": 91}, {"type": "R", "before": "a", "after": "analytical transaction", "start_char_pos": 144, "end_char_pos": 145}, {"type": "R", "before": "distribution", "after": "distributions", "start_char_pos": 176, "end_char_pos": 188}, {"type": "R", "before": "are", "after": "is", "start_char_pos": 404, "end_char_pos": 407}, {"type": "R", "before": "correlations", "after": "correlation", "start_char_pos": 443, "end_char_pos": 455}, {"type": "D", "before": "both", "after": null, "start_char_pos": 510, "end_char_pos": 514}, {"type": "D", "before": "and the amount of transaction", "after": null, "start_char_pos": 546, "end_char_pos": 575}, {"type": "R", "before": "they lack", "after": "it lacks", "start_char_pos": 581, "end_char_pos": 590}, {"type": "R", "before": "correlations", "after": "correlation", "start_char_pos": 625, "end_char_pos": 637}, {"type": "R", "before": "there exists", "after": "it shows", "start_char_pos": 711, "end_char_pos": 723}, {"type": "R", "before": "between the rate of mean return and that of change in trading conditioning intensity when SEE", "after": "in a time interval when SSE", "start_char_pos": 773, "end_char_pos": 866}, {"type": "R", "before": "The", "after": "Our", "start_char_pos": 913, "end_char_pos": 916}, {"type": "R", "before": "help to well explain", "after": "test both", "start_char_pos": 940, "end_char_pos": 960}, {"type": "R", "before": "excessive trading, to time bubble crash, and to understand", "after": "herd behavior simultaneously, and explain excessive trading (volume) and", "start_char_pos": 984, "end_char_pos": 1042}], "sents_char_pos": [0, 291, 577, 703, 912]} {"doc_id": "1001.3003", "revision_depth": "1", "before_revision": "It is known that Heston's stochastic volatility model exhibits moment explosion, and that the critical moment s ^{* can be obtained by solving (numerically) a simple equation. This yields a leading order expansion for the implied volatility at large strikes: BS( k,T)^{2}T\\sim \\Psi (s ^* -1) \\times k (Roger Lee's moment formula). Motivated by recent \"tail-wing\" refinements of this moment formula, we first derive a novel tail expansion for the Heston density, sharpening previous work of Dr \\u{a}%DIFDELCMD < }%%% gulescu and Yakovenko [Quant. Finance 2, 6 (2002), 443--453], and then show the validity of a refined expansion of the type \\% BS( k,T) ^{2}T=( 1k^{1/2}+2+...)^{2}, where all constants are explicitly known as functions of s ^* , the Heston model parameters, spot vol and maturity T. In the case of the \"zero-correlation\" Heston model such an expansion was derived by Gulisashvili and Stein [Appl. Math. Opt. , DOI: 10.1007/s002450099085 ]. Our methods and results may prove useful beyond the Heston model: the entire quantitative analysis is based on affine principles ; at no point do we need knowledge of the (explicit, but cumbersome) closed form expression of the Fourier transform of \\log S_{T} (equivalently: Mellin transform of S_{T} \\% ) . Secondly, our analysis reveals a new parameter (\" \\textit{critical slope \" \\% ), defined in a model free manner, which drives the second and higher order terms in tail- and implied volatility expansions.", "after_revision": "It is known that Heston's stochastic volatility model exhibits moment explosion, and that the critical moment s _+ can be obtained by solving (numerically) a simple equation. This yields a leading order expansion for the implied volatility at large strikes: BS( k,T)^{2}T\\sim \\Psi (s _+ -1) \\times k (Roger Lee's moment formula). Motivated by recent \"tail-wing\" refinements of this moment formula, we first derive a novel tail expansion for the Heston density, sharpening previous work of }%DIFDELCMD < }%%% Dragulescu and Yakovenko [Quant. Finance 2, 6 (2002), 443--453], and then show the validity of a refined expansion of the type BS( k,T) ^{2}T=( 1k^{1/2}+2+...)^{2}, where all constants are explicitly known as functions of s _+ , the Heston model parameters, spot vol and maturity T. In the case of the \"zero-correlation\" Heston model such an expansion was derived by Gulisashvili and Stein [Appl. Math. Optim. 61, 3 (2010), 287--315 ]. Our methods and results may prove useful beyond the Heston model: the entire quantitative analysis is based on affine principles : at no point do we need knowledge of the (explicit, but cumbersome) closed form expression of the Fourier transform of \\log S_{T} \\ (equivalently: Mellin transform of S_{T} ); what matters is that these transforms satisfy ordinary differential equations of Riccati type . Secondly, our analysis reveals a new parameter (\" \\textit{critical slope \" ), defined in a model free manner, which drives the second and higher order terms in tail- and implied volatility expansions.", "edit_actions": [{"type": "R", "before": "^{*", "after": "_+", "start_char_pos": 112, "end_char_pos": 115}, {"type": "R", "before": "^*", "after": "_+", "start_char_pos": 285, "end_char_pos": 287}, {"type": "D", "before": "Dr", "after": null, "start_char_pos": 490, "end_char_pos": 492}, {"type": "D", "before": "\\u{a", "after": null, "start_char_pos": 493, "end_char_pos": 497}, {"type": "R", "before": "gulescu", "after": "Dragulescu", "start_char_pos": 516, "end_char_pos": 523}, {"type": "D", "before": "\\%", "after": null, "start_char_pos": 640, "end_char_pos": 642}, {"type": "R", "before": "^*", "after": "_+", "start_char_pos": 740, "end_char_pos": 742}, {"type": "R", "before": "Opt. , DOI: 10.1007/s002450099085", "after": "Optim. 61, 3 (2010), 287--315", "start_char_pos": 919, "end_char_pos": 952}, {"type": "R", "before": ";", "after": ":", "start_char_pos": 1085, "end_char_pos": 1086}, {"type": "A", "before": null, "after": "\\", "start_char_pos": 1216, "end_char_pos": 1216}, {"type": "R", "before": "\\% )", "after": "); what matters is that these transforms satisfy ordinary differential equations of Riccati type", "start_char_pos": 1258, "end_char_pos": 1262}, {"type": "R", "before": "critical slope", "after": "critical slope", "start_char_pos": 1323, "end_char_pos": 1337}, {"type": "D", "before": "\\%", "after": null, "start_char_pos": 1340, "end_char_pos": 1342}], "sents_char_pos": [0, 175, 330, 545, 674, 798, 912, 955, 1086]} {"doc_id": "1004.0965", "revision_depth": "1", "before_revision": "The Wako-Sait\\^o-Mu\\~noz-Eaton } (WSME) model initially introduced in the theory of protein folding can also model some epitaxial phenomena. The advantage of the model is that it admits exact solution in the general inhomogeneous case (Bruscolini and Pelizzola, 2002) which facilitates the modeling of realistic systems. A shortcoming of the model is that it accounts only for interactions within contiguous stretches of native bonds or atomic chains while neglecting interstretch (interchain) interactions. But due to the protein (or atomic chain) flexibility, the residues (atoms) separated by several non-native bonds along the sequence can become very close in the real space which usually causes their strong interaction. Thus, inclusion of non-WSME interactions into the model should make it more realistic and improve its performance. In this paper we augment the WSME model by arbitrary interactions of finite range along the sequence and solve it with the use of a transfer matrix technique. Our method makes it possible to exactly account for the interaction radii along the polypeptide chain which in the proteomics are classified as the medium-range interactions.", "after_revision": "The Wako-Sait \\^o}-Mu\\~noz-Eaton (WSME) model , initially introduced in the theory of protein folding , has also been used in modeling the RNA folding and some epitaxial phenomena. The advantage of this model is that it admits exact solution in the general inhomogeneous case (Bruscolini and Pelizzola, 2002) which facilitates the study of realistic systems. However, a shortcoming of this model is that it accounts only for interactions within contiguous stretches of native bonds or atomic chains while neglecting interstretch (interchain) interactions. But due to the biopolymer ( atomic chain) flexibility, the monomers (atoms) separated by several non-native bonds along the sequence can become closely spaced. This produces their strong interaction. The inclusion of non-WSME interactions into the model makes the model more realistic and improves its performance. In this study we add arbitrary interactions of finite range and solve the new model by means of the transfer matrix technique. We can therefore exactly account for the interactions with the radii along the chain which in the proteomics are classified as medium- and moderately long-range interactions.", "edit_actions": [{"type": "R", "before": "Wako-Sait\\^o-Mu\\~noz-Eaton", "after": "Wako-Sait", "start_char_pos": 4, "end_char_pos": 30}, {"type": "A", "before": null, "after": "\\^o", "start_char_pos": 31, "end_char_pos": 31}, {"type": "A", "before": null, "after": "-Mu\\~noz-Eaton", "start_char_pos": 32, "end_char_pos": 32}, {"type": "A", "before": null, "after": ",", "start_char_pos": 46, "end_char_pos": 46}, {"type": "R", "before": "can also model", "after": ", has also been used in modeling the RNA folding and", "start_char_pos": 101, "end_char_pos": 115}, {"type": "R", "before": "the", "after": "this", "start_char_pos": 159, "end_char_pos": 162}, {"type": "R", "before": "modeling", "after": "study", "start_char_pos": 291, "end_char_pos": 299}, {"type": "R", "before": "A shortcoming of the", "after": "However, a shortcoming of this", "start_char_pos": 322, "end_char_pos": 342}, {"type": "R", "before": "protein (or", "after": "biopolymer (", "start_char_pos": 524, "end_char_pos": 535}, {"type": "R", "before": "residues", "after": "monomers", "start_char_pos": 567, "end_char_pos": 575}, {"type": "R", "before": "very close in the real space which usually causes", "after": "closely spaced. This produces", "start_char_pos": 652, "end_char_pos": 701}, {"type": "R", "before": "Thus,", "after": "The", "start_char_pos": 728, "end_char_pos": 733}, {"type": "R", "before": "should make it", "after": "makes the model", "start_char_pos": 784, "end_char_pos": 798}, {"type": "R", "before": "improve", "after": "improves", "start_char_pos": 818, "end_char_pos": 825}, {"type": "R", "before": "paper we augment the WSME model by", "after": "study we add", "start_char_pos": 851, "end_char_pos": 885}, {"type": "R", "before": "along the sequence and solve it with the use of a", "after": "and solve the new model by means of the", "start_char_pos": 925, "end_char_pos": 974}, {"type": "R", "before": "Our method makes it possible to", "after": "We can therefore", "start_char_pos": 1002, "end_char_pos": 1033}, {"type": "R", "before": "interaction", "after": "interactions with the", "start_char_pos": 1058, "end_char_pos": 1069}, {"type": "D", "before": "polypeptide", "after": null, "start_char_pos": 1086, "end_char_pos": 1097}, {"type": "R", "before": "the medium-range", "after": "medium- and moderately long-range", "start_char_pos": 1146, "end_char_pos": 1162}], "sents_char_pos": [0, 141, 321, 508, 727, 842, 1001]} {"doc_id": "1009.4211", "revision_depth": "1", "before_revision": "We consider a stochastic volatility model with L\\'evy jumps for a log-return process Z=(Z _t) _{t %DIFDELCMD < \\ge %%% 0} of the form Z=U+X, where U=(U _t) _{t %DIFDELCMD < \\ge %%% 0} is a classical stochastic volatility process and X=(X _t) _{t %DIFDELCMD < \\ge %%% 0} is an independent L\\'evy process with absolutely continuous L\\'evy measure \\nu. Small-time expansions, of arbitrary polynomial order in time t , are obtained for the tails \\bbp(Z _t%DIFDELCMD < \\ge %%% \\geq } z), z>0, and for the call-option prices \\bbe(e^{z+Z _t } - 1)_+ , z\\neq 0, assuming smoothness conditions on the L\\'evy density away from the origin and a small-time large deviation principle on U. Our approach allows for a unified treatment of general payoff functions of the form \\phi (x){\\bf 1}_{x %DIFDELCMD < \\ge %%% z} for smooth functions \\phi and z>0. As a consequence of our tail expansions, the polynomial expansions in t of the transition densities f _t are obtained under rather mild conditions.", "after_revision": "We consider a stochastic volatility model with L\\'evy jumps for a log-return process Z=(Z _{t _{t %DIFDELCMD < \\ge %%% \\geq 0} of the form Z=U+X, where U=(U _{t _{t %DIFDELCMD < \\ge %%% \\geq 0} is a classical stochastic volatility process and X=(X _{t _{t %DIFDELCMD < \\ge %%% \\geq 0} is an independent L\\'evy process with absolutely continuous L\\'evy measure \\nu. Small-time expansions, of arbitrary polynomial order , in time-t , are obtained for the tails \\bbp(Z %DIFDELCMD < \\ge %%% _{t\\geq } z), z>0, and for the call-option prices \\bbe(e^{z+Z _{t } -1)_{+ , z\\neq 0, assuming smoothness conditions on the L\\'evy density away from the origin and a small-time large deviation principle on U. Our approach allows for a unified treatment of general payoff functions of the form \\varphi (x){\\bf 1}_{x %DIFDELCMD < \\ge %%% \\geq{ z} for smooth functions \\varphi and z>0. As a consequence of our tail expansions, the polynomial expansions in t of the transition densities f _{t mild conditions.", "edit_actions": [{"type": "R", "before": "_t)", "after": "_{t", "start_char_pos": 90, "end_char_pos": 93}, {"type": "A", "before": null, "after": "\\geq", "start_char_pos": 119, "end_char_pos": 119}, {"type": "R", "before": "_t)", "after": "_{t", "start_char_pos": 153, "end_char_pos": 156}, {"type": "A", "before": null, "after": "\\geq", "start_char_pos": 182, "end_char_pos": 182}, {"type": "R", "before": "_t)", "after": "_{t", "start_char_pos": 240, "end_char_pos": 243}, {"type": "A", "before": null, "after": "\\geq", "start_char_pos": 269, "end_char_pos": 269}, {"type": "R", "before": "in time t", "after": ", in time-t", "start_char_pos": 406, "end_char_pos": 415}, {"type": "D", "before": "_t", "after": null, "start_char_pos": 452, "end_char_pos": 454}, {"type": "A", "before": null, "after": "_{t", "start_char_pos": 475, "end_char_pos": 475}, {"type": "R", "before": "_t", "after": "_{t", "start_char_pos": 534, "end_char_pos": 536}, {"type": "R", "before": "- 1)_+", "after": "-1)_{+", "start_char_pos": 539, "end_char_pos": 545}, {"type": "R", "before": "\\phi", "after": "\\varphi", "start_char_pos": 764, "end_char_pos": 768}, {"type": "A", "before": null, "after": "\\geq{", "start_char_pos": 804, "end_char_pos": 804}, {"type": "R", "before": "\\phi", "after": "\\varphi", "start_char_pos": 829, "end_char_pos": 833}, {"type": "R", "before": "_t are obtained under rather", "after": "_{t", "start_char_pos": 945, "end_char_pos": 973}], "sents_char_pos": [0, 352, 842]} {"doc_id": "1011.5674", "revision_depth": "1", "before_revision": "Scheduling is a critical and challenging resource allocation mechanism for multi-hop wireless networks. It is well known that scheduling schemes that give a higher priority to the link with larger queue length can achieve high throughput performance. However, this queue-length-based approach could potentially suffer from large (even infinite) packet delays due to the well-known last packet problem, whereby packets may get excessively delayed due to lack of subsequent packet arrivals. Delay-based schemes have the potential to resolve this last packet problem by scheduling the link based on the delay for the packet has encountered. However, the throughput performance of delay-based schemes has largely been an open problem except in limited cases of single-hop networks. In this paper, we investigate delay-based scheduling schemes for multi-hop traffic scenarios . We view packet delays from a different perspective, and develop a scheduling scheme based on a new delay metric . Through rigorous analysis, we show that the proposed scheme achieves the optimal throughput performance. Finally , we conduct extensive simulations to support our analytical results, and show that the delay-based scheduler successfully removes excessive packet delays, while it achieves the same throughput region as the queuelength-based scheme.", "after_revision": "Scheduling is a critical and challenging resource allocation mechanism for multihop wireless networks. It is well known that scheduling schemes that favor links with larger queue length can achieve high throughput performance. However, these queue-length-based schemes could potentially suffer from large (even infinite) packet delays due to the well-known last packet problem, whereby packets belonging to some flows may be excessively delayed due to lack of subsequent packet arrivals. Delay-based schemes have the potential to resolve this last packet problem by scheduling the link based on the delay the packet has encountered. However, characterizing throughput-optimality of these delay-based schemes has largely been an open problem in multihop wireless networks ( except in limited cases where the traffic is single-hop .) In this paper, we investigate delay-based scheduling schemes for multihop traffic scenarios with fixed routes. We develop a scheduling scheme based on a new delay metric , and show that the proposed scheme achieves optimal throughput performance. Further , we conduct simulations to support our analytical results, and show that the delay-based scheduler successfully removes excessive packet delays, while it achieves the same throughput region as the queue-length-based scheme.", "edit_actions": [{"type": "R", "before": "multi-hop", "after": "multihop", "start_char_pos": 75, "end_char_pos": 84}, {"type": "R", "before": "give a higher priority to the link", "after": "favor links", "start_char_pos": 150, "end_char_pos": 184}, {"type": "R", "before": "this", "after": "these", "start_char_pos": 260, "end_char_pos": 264}, {"type": "R", "before": "approach", "after": "schemes", "start_char_pos": 284, "end_char_pos": 292}, {"type": "R", "before": "may get", "after": "belonging to some flows may be", "start_char_pos": 418, "end_char_pos": 425}, {"type": "D", "before": "for", "after": null, "start_char_pos": 606, "end_char_pos": 609}, {"type": "R", "before": "the throughput performance of", "after": "characterizing throughput-optimality of these", "start_char_pos": 647, "end_char_pos": 676}, {"type": "A", "before": null, "after": "in multihop wireless networks (", "start_char_pos": 730, "end_char_pos": 730}, {"type": "R", "before": "of", "after": "where the traffic is", "start_char_pos": 755, "end_char_pos": 757}, {"type": "R", "before": "networks.", "after": ".)", "start_char_pos": 769, "end_char_pos": 778}, {"type": "R", "before": "multi-hop traffic scenarios . We view packet delays from a different perspective, and", "after": "multihop traffic scenarios with fixed routes. We", "start_char_pos": 844, "end_char_pos": 929}, {"type": "R", "before": ". Through rigorous analysis, we", "after": ", and", "start_char_pos": 986, "end_char_pos": 1017}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1057, "end_char_pos": 1060}, {"type": "R", "before": "Finally", "after": "Further", "start_char_pos": 1093, "end_char_pos": 1100}, {"type": "D", "before": "extensive", "after": null, "start_char_pos": 1114, "end_char_pos": 1123}, {"type": "R", "before": "queuelength-based", "after": "queue-length-based", "start_char_pos": 1309, "end_char_pos": 1326}], "sents_char_pos": [0, 103, 250, 488, 637, 778, 873, 987, 1092]} {"doc_id": "1102.4293", "revision_depth": "1", "before_revision": "The process of comparison of computer generated protein structural models is an important element of protein structure prediction. It has many uses including model quality evaluation, selection of the final models from a large set of candidates or optimisation of parameters of energy functions used in template free modelling and refinement. Although many protein comparison methods are available online on numerous web servers, their ability to handle a large scale model comparison is often very limited. Most of the servers offer only a single pairwise structural comparison , and they usually do not provide a model-specific comparison with a fixed alignment between the models . To bridge the gap between the protein and model structure comparison we have developed the Protein Models Comparator (pm-cmp). To be able to deliver the scalability on demand and handle large comparison experiments the pm-cmp was implemented \"in the cloud\". Protein Models Comparator is a scalable web application for a fast distributed comparison of protein models with RMSD, GDT TS, TM-score and Q-score measures. It runs on the Google App Engine (GAE) cloud platform and is a showcase of how the emerging PaaS (Platform as a Service) technology could be used to simplify the development of scalable bioinformatics services through outsourcing of the setup and maintenance of the hardware infrastructure . The functionality of the web application has been made available over a programmable API , so that the experiment submission and results retrieval could be automated . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available at: URL This article presents a large scale model-specific protein comparison web application and provides an insight into the GAE platform and its potential value for scientific computations .", "after_revision": "The comparison of computer generated protein structural models is an important element of protein structure prediction. It has many uses including model quality evaluation, selection of the final models from a large set of candidates or optimisation of parameters of energy functions used in template-free modelling and refinement. Although many protein comparison methods are available online on numerous web servers, they are not well suited for large scale model comparison : (1) they operate with methods designed to compare actual proteins, not the models of the same protein, (2) majority of them offer only a single pairwise structural comparison and are unable to scale up to a required order of thousands of comparisons . To bridge the gap between the protein and model structure comparison we have developed the Protein Models Comparator (pm-cmp). To be able to deliver the scalability on demand and handle large comparison experiments the pm-cmp was implemented \"in the cloud\". Protein Models Comparator is a scalable web application for a fast distributed comparison of protein models with RMSD, GDT TS, TM-score and Q-score measures. It runs on the Google App Engine (GAE) cloud platform and is a showcase of how the emerging PaaS (Platform as a Service) technology could be used to simplify the development of scalable bioinformatics services . The functionality of pm-cmp is accessible through API which allows a full automation of the experiment submission and results retrieval . Protein Models Comparator is free software released on the Affero GNU Public Licence and is available with its source code at: URL This article presents a new web application addressing the need for a large-scale model-specific protein structure comparison and provides an insight into the GAE (Google App Engine) platform and its usefulness in scientific computing .", "edit_actions": [{"type": "D", "before": "process of", "after": null, "start_char_pos": 4, "end_char_pos": 14}, {"type": "R", "before": "template free", "after": "template-free", "start_char_pos": 303, "end_char_pos": 316}, {"type": "R", "before": "their ability to handle a", "after": "they are not well suited for", "start_char_pos": 430, "end_char_pos": 455}, {"type": "R", "before": "is often very limited. Most of the servers", "after": ": (1) they operate with methods designed to compare actual proteins, not the models of the same protein, (2) majority of them", "start_char_pos": 485, "end_char_pos": 527}, {"type": "R", "before": ", and they usually do not provide a model-specific comparison with a fixed alignment between the models", "after": "and are unable to scale up to a required order of thousands of comparisons", "start_char_pos": 579, "end_char_pos": 682}, {"type": "D", "before": "through outsourcing of the setup and maintenance of the hardware infrastructure", "after": null, "start_char_pos": 1311, "end_char_pos": 1390}, {"type": "R", "before": "the web application has been made available over a programmable API , so that", "after": "pm-cmp is accessible through API which allows a full automation of", "start_char_pos": 1414, "end_char_pos": 1491}, {"type": "D", "before": "could be automated", "after": null, "start_char_pos": 1540, "end_char_pos": 1558}, {"type": "A", "before": null, "after": "with its source code", "start_char_pos": 1663, "end_char_pos": 1663}, {"type": "R", "before": "large scale", "after": "new web application addressing the need for a large-scale", "start_char_pos": 1696, "end_char_pos": 1707}, {"type": "R", "before": "comparison web application", "after": "structure comparison", "start_char_pos": 1731, "end_char_pos": 1757}, {"type": "A", "before": null, "after": "(Google App Engine)", "start_char_pos": 1795, "end_char_pos": 1795}, {"type": "R", "before": "potential value for scientific computations", "after": "usefulness in scientific computing", "start_char_pos": 1813, "end_char_pos": 1856}], "sents_char_pos": [0, 130, 342, 507, 684, 811, 942, 1100, 1392]} {"doc_id": "1103.1460", "revision_depth": "1", "before_revision": "The drawdown process Y= - X {\\em of a completely asymmetric L\\'{e}vy process X is given by X reflected at its running supremum X . In this paper we explicitly express the law of the sextuple (\\tau_a, _{\\tau_a,}X _{\\tau_a,}%DIFDELCMD < \\bar{X}%%% _{\\tau_a,Y_{\\tau_a-},Y_{\\tau_a}-a) } in terms of the scale function and the L\\'evy measure of X , where \\tau_a denotes the first-passage time of Y over the level a>0, \\bar{G}_{\\tau_a} is the time of the last supremum of X prior to \\tau_a and\\underline{X is the running infimum of\\unl X . We also explicitly identify the distribution of the drawup%DIFDELCMD < \\hat{Y}%%% _{\\tau_aat the moment \\tau_a, where }%DIFDELCMD < \\hat{Y} %%% = X-\\underline{X , and derive the probability of a large drawdown preceding a small rally. These results are applied to the Carr%DIFDELCMD < & %%% Wu \\mbox{%DIFAUXCMD \\cite{CarrWu }\\hspace{0pt}%DIFAUXCMD modelfor S}%DIFDELCMD < &%%% P 500. and supremum }\\ovl of X at \\tau_a and the undershoot a - Y_{\\tau_a-} and overshoot Y_{\\tau_a}-a of Y at \\tau_a. As application we obtain explicit expressions for the laws of a number of functionals of drawdowns and rallies in a completely asymmetric exponential L\\'{e}vy model.}", "after_revision": "The {\\em drawdown process Y of a completely asymmetric L\\'{e}vy process X is equal to X reflected at its running supremum X : Y = - X . In this paper we explicitly express ,} ,}%DIFDELCMD < \\bar{X}%%% ,Y_{\\tau_a-},Y_{\\tau_a}-a) } in terms of the scale function and the L\\'{e measure of X the law of the sextuple of the first-passage time of Y over the level a>0, the time \\bar{G}_{\\tau_a} of the last supremum of X prior to \\tau_a \\underline{ , the infimum\\unl X %DIFDELCMD < \\hat{Y}%%% at the moment \\tau_a, where }%DIFDELCMD < \\hat{Y} %%% \\underline{ %DIFDELCMD < & %%% }\\hspace{0pt}%DIFAUXCMD modelfor S}%DIFDELCMD < &%%% _{\\tau_a and supremum }\\ovl X_{\\tau_a of X at \\tau_a and the undershoot a - Y_{\\tau_a-} and overshoot Y_{\\tau_a}-a of Y at \\tau_a. As application we obtain explicit expressions for the laws of a number of functionals of drawdowns and rallies in a completely asymmetric exponential L\\'{e}vy model.}", "edit_actions": [{"type": "D", "before": "drawdown process Y=", "after": null, "start_char_pos": 4, "end_char_pos": 23}, {"type": "D", "before": "- X", "after": null, "start_char_pos": 24, "end_char_pos": 27}, {"type": "A", "before": null, "after": "drawdown", "start_char_pos": 33, "end_char_pos": 33}, {"type": "A", "before": null, "after": "process Y", "start_char_pos": 34, "end_char_pos": 34}, {"type": "R", "before": "given by", "after": "equal to", "start_char_pos": 84, "end_char_pos": 92}, {"type": "A", "before": null, "after": ": Y =", "start_char_pos": 131, "end_char_pos": 131}, {"type": "A", "before": null, "after": "- X", "start_char_pos": 132, "end_char_pos": 132}, {"type": "D", "before": "the law of the sextuple (\\tau_a,", "after": null, "start_char_pos": 171, "end_char_pos": 203}, {"type": "D", "before": "_{\\tau_a", "after": null, "start_char_pos": 204, "end_char_pos": 212}, {"type": "D", "before": "X", "after": null, "start_char_pos": 214, "end_char_pos": 215}, {"type": "D", "before": "_{\\tau_a", "after": null, "start_char_pos": 216, "end_char_pos": 224}, {"type": "D", "before": "_{\\tau_a", "after": null, "start_char_pos": 250, "end_char_pos": 258}, {"type": "R", "before": "L\\'evy", "after": "L\\'{e", "start_char_pos": 326, "end_char_pos": 332}, {"type": "R", "before": ", where \\tau_a denotes the", "after": "the law of the sextuple of the", "start_char_pos": 346, "end_char_pos": 372}, {"type": "A", "before": null, "after": "the time", "start_char_pos": 417, "end_char_pos": 417}, {"type": "D", "before": "is the time", "after": null, "start_char_pos": 435, "end_char_pos": 446}, {"type": "D", "before": "and", "after": null, "start_char_pos": 489, "end_char_pos": 492}, {"type": "D", "before": "X", "after": null, "start_char_pos": 503, "end_char_pos": 504}, {"type": "R", "before": "is the running infimum of", "after": ", the infimum", "start_char_pos": 505, "end_char_pos": 530}, {"type": "D", "before": ". We also explicitly identify the distribution of the drawup", "after": null, "start_char_pos": 537, "end_char_pos": 597}, {"type": "D", "before": "_{\\tau_a", "after": null, "start_char_pos": 621, "end_char_pos": 629}, {"type": "D", "before": "= X-", "after": null, "start_char_pos": 683, "end_char_pos": 687}, {"type": "D", "before": "X", "after": null, "start_char_pos": 698, "end_char_pos": 699}, {"type": "D", "before": ", and derive the probability of a large drawdown preceding a small rally. These results are applied to the Carr", "after": null, "start_char_pos": 700, "end_char_pos": 811}, {"type": "D", "before": "Wu \\mbox{%DIFAUXCMD \\cite{CarrWu", "after": null, "start_char_pos": 830, "end_char_pos": 862}, {"type": "R", "before": "P 500.", "after": "_{\\tau_a", "start_char_pos": 916, "end_char_pos": 922}, {"type": "A", "before": null, "after": "X_{\\tau_a", "start_char_pos": 942, "end_char_pos": 942}], "sents_char_pos": [0, 25, 284, 773, 1035]} {"doc_id": "1103.5458", "revision_depth": "2", "before_revision": "Single-nucleotide-resolution chemical mapping for structured RNA is being rapidly advanced by new chemistries, faster readouts, and coupling to computational algorithms. Recent tests have suggested that 2' -OH acylation data (SHAPE) can give near-zero error rates ( 0-4 \\%) in modeling RNA secondary structure. Here, we benchmark the method on six RNAs for which crystallographic data are available: tRNAphe and 5S rRNA from E. coli; the P4-P6 domain of the Tetrahymena group I ribozyme ; and ligand-bound domains from riboswitches for adenine, cyclic di-GMP, and glycine. SHAPE-directed modeling of these RNAs gave significant errors ( overall false negative rate of 17\\% ; false discovery rate of 21\\% ) , with at least one error in five of the six cases. Variations of data processing or modeling do not mitigate these errors. Instead, as evaluated by bootstrapping, the information content of SHAPE data appears insufficient to define these RNAs' structures. Thus, SHAPE-directed RNA modeling is not always accurate , and helix-by-helix confidence estimates, as described herein, may be critical for interpreting results from this powerful methodology.", "after_revision": "Single-nucleotide-resolution chemical mapping for structured RNA is being rapidly advanced by new chemistries, faster readouts, and coupling to computational algorithms. Recent tests have shown that selective 2' -hydroxyl acylation by primer extension (SHAPE) can give near-zero error rates ( 0-2 \\%) in modeling the helices of RNA secondary structure. Here, we benchmark the method using six molecules for which crystallographic data are available: tRNA(phe) and 5S rRNA from Escherichia coli, the P4-P6 domain of the Tetrahymena group I ribozyme , and ligand-bound domains from riboswitches for adenine, cyclic di-GMP, and glycine. SHAPE-directed modeling of these highly structured RNAs gave an overall false negative rate (FNR) of 17\\% and a false discovery rate (FDR) of 21\\% , with at least one helix prediction error in five of the six cases. Extensive variations of data processing , normalization, and modeling parameters did not significantly mitigate modeling errors. Only one varation, filtering out data collected with deoxyinosine triphosphate during primer extension, gave a modest improvement (FNR = 12\\%, and FDR = 14\\%). The residual structure modeling errors are explained by the insufficient information content of these RNAs' SHAPE data, as evaluated by a nonparametric bootstrapping analysis. Beyond these benchmark cases, bootstrapping suggests a low level of confidence (<50\\%) in the majority of helices in a previously proposed SHAPE-directed model for the HIV-1 RNA genome. Thus, SHAPE-directed RNA modeling is not always unambiguous , and helix-by-helix confidence estimates, as described herein, may be critical for interpreting results from this powerful methodology.", "edit_actions": [{"type": "R", "before": "suggested that", "after": "shown that selective", "start_char_pos": 188, "end_char_pos": 202}, {"type": "R", "before": "-OH acylation data", "after": "-hydroxyl acylation by primer extension", "start_char_pos": 206, "end_char_pos": 224}, {"type": "R", "before": "0-4", "after": "0-2", "start_char_pos": 266, "end_char_pos": 269}, {"type": "A", "before": null, "after": "the helices of", "start_char_pos": 286, "end_char_pos": 286}, {"type": "R", "before": "on six RNAs", "after": "using six molecules", "start_char_pos": 342, "end_char_pos": 353}, {"type": "R", "before": "tRNAphe", "after": "tRNA(phe)", "start_char_pos": 401, "end_char_pos": 408}, {"type": "R", "before": "E. coli;", "after": "Escherichia coli,", "start_char_pos": 426, "end_char_pos": 434}, {"type": "R", "before": ";", "after": ",", "start_char_pos": 488, "end_char_pos": 489}, {"type": "R", "before": "RNAs gave significant errors (", "after": "highly structured RNAs gave an", "start_char_pos": 607, "end_char_pos": 637}, {"type": "A", "before": null, "after": "(FNR)", "start_char_pos": 666, "end_char_pos": 666}, {"type": "R", "before": ";", "after": "and a", "start_char_pos": 675, "end_char_pos": 676}, {"type": "A", "before": null, "after": "(FDR)", "start_char_pos": 698, "end_char_pos": 698}, {"type": "D", "before": ")", "after": null, "start_char_pos": 707, "end_char_pos": 708}, {"type": "A", "before": null, "after": "helix prediction", "start_char_pos": 729, "end_char_pos": 729}, {"type": "R", "before": "Variations", "after": "Extensive variations", "start_char_pos": 762, "end_char_pos": 772}, {"type": "R", "before": "or modeling do not mitigate these errors. Instead, as evaluated by bootstrapping, the", "after": ", normalization, and modeling parameters did not significantly mitigate modeling errors. Only one varation, filtering out data collected with deoxyinosine triphosphate during primer extension, gave a modest improvement (FNR = 12\\%, and FDR = 14\\%). The residual structure modeling errors are explained by the insufficient", "start_char_pos": 792, "end_char_pos": 877}, {"type": "D", "before": "SHAPE data appears insufficient to define", "after": null, "start_char_pos": 901, "end_char_pos": 942}, {"type": "R", "before": "structures.", "after": "SHAPE data, as evaluated by a nonparametric bootstrapping analysis. Beyond these benchmark cases, bootstrapping suggests a low level of confidence (<50\\%) in the majority of helices in a previously proposed SHAPE-directed model for the HIV-1 RNA genome.", "start_char_pos": 955, "end_char_pos": 966}, {"type": "R", "before": "accurate", "after": "unambiguous", "start_char_pos": 1015, "end_char_pos": 1023}], "sents_char_pos": [0, 169, 311, 434, 489, 573, 676, 761, 833, 966]} {"doc_id": "1104.2156", "revision_depth": "1", "before_revision": "The network traffic matrix is a kind of flow-level Internet traffic data and is widely applied to network operation and management. It is a crucial problem to analyze the composition and structure of traffic matrix; some mathematical approaches such as Principal Component Analysis (PCA) were used to handle that problem . In this paper, we first argue that PCA performs poorly for analyzing traffic matrixes polluted by large volume anomalies, then propose a new composition model of the network traffic matrix. According to our model, structure analysis can be formally defined as decomposing a traffic matrix into low-rank, sparse, and noise sub-matrixes , which is equal to the Robust Principal Component Analysis (RPCA) problem defined in [13]. Based on the Relaxed Principal Component Pursuit (Relaxed PCP) method and the Accelerated Proximal Gradient (APG) algorithm, an iterative algorithm for decomposing a traffic matrix is presented, and our experiment results demonstrate its efficiency and flexibility . At last, further discussions on the deterministic traffic and the noise trafficare carried out. Our study gives a proper method for traffic matrix structure analysis, which has a defense against the pollution of large volume anomalies.", "after_revision": "The network traffic matrix is widely used in network operation and management. It is therefore of crucial importance to analyze the components and the structure of the network traffic matrix, for which several mathematical approaches such as Principal Component Analysis (PCA) were proposed . In this paper, we first argue that PCA performs poorly for analyzing traffic matrix that is polluted by large volume anomalies, and then propose a new decomposition model for the network traffic matrix. According to this model, we carry out the structural analysis by decomposing the network traffic matrix into three sub-matrices, namely, the deterministic traffic, the anomaly traffic and the noise traffic matrix , which is similar to the Robust Principal Component Analysis (RPCA) problem previously studied in [13]. Based on the Relaxed Principal Component Pursuit (Relaxed PCP) method and the Accelerated Proximal Gradient (APG) algorithm, we present an iterative approach for decomposing a traffic matrix , and demonstrate its efficiency and flexibility by experimental results. Finally, we further discuss several features of the deterministic and noise traffic . Our study develops a novel method for the problem of structural analysis of the traffic matrix, which is robust against pollution of large volume anomalies.", "edit_actions": [{"type": "R", "before": "a kind of flow-level Internet traffic data and is widely applied to", "after": "widely used in", "start_char_pos": 30, "end_char_pos": 97}, {"type": "R", "before": "a crucial problem", "after": "therefore of crucial importance", "start_char_pos": 138, "end_char_pos": 155}, {"type": "R", "before": "composition and structure of traffic matrix; some", "after": "components and the structure of the network traffic matrix, for which several", "start_char_pos": 171, "end_char_pos": 220}, {"type": "R", "before": "used to handle that problem", "after": "proposed", "start_char_pos": 293, "end_char_pos": 320}, {"type": "R", "before": "matrixes", "after": "matrix that is", "start_char_pos": 400, "end_char_pos": 408}, {"type": "A", "before": null, "after": "and", "start_char_pos": 445, "end_char_pos": 445}, {"type": "R", "before": "composition model of", "after": "decomposition model for", "start_char_pos": 465, "end_char_pos": 485}, {"type": "R", "before": "our model, structure analysis can be formally defined as decomposing a", "after": "this model, we carry out the structural analysis by decomposing the network", "start_char_pos": 527, "end_char_pos": 597}, {"type": "R", "before": "low-rank, sparse, and noise sub-matrixes", "after": "three sub-matrices, namely, the deterministic traffic, the anomaly traffic and the noise traffic matrix", "start_char_pos": 618, "end_char_pos": 658}, {"type": "R", "before": "equal", "after": "similar", "start_char_pos": 670, "end_char_pos": 675}, {"type": "R", "before": "defined", "after": "previously studied", "start_char_pos": 734, "end_char_pos": 741}, {"type": "R", "before": "an iterative algorithm", "after": "we present an iterative approach", "start_char_pos": 876, "end_char_pos": 898}, {"type": "R", "before": "is presented, and our experiment results", "after": ", and", "start_char_pos": 932, "end_char_pos": 972}, {"type": "A", "before": null, "after": "by experimental results. Finally, we further discuss several features of the deterministic and noise traffic", "start_char_pos": 1016, "end_char_pos": 1016}, {"type": "D", "before": "At last, further discussions on the deterministic traffic and the noise trafficare carried out.", "after": null, "start_char_pos": 1019, "end_char_pos": 1114}, {"type": "R", "before": "gives a proper method for traffic matrix structure analysis, which has a defense against the", "after": "develops a novel method for the problem of structural analysis of the traffic matrix, which is robust against", "start_char_pos": 1125, "end_char_pos": 1217}], "sents_char_pos": [0, 131, 215, 322, 513, 750, 1018, 1114]} {"doc_id": "1105.1004", "revision_depth": "1", "before_revision": "In this study, a two-state mechanochemical model is presented to describe the dynamic properties of microtubule (MT) growth in cells. The MT switches between two states, assembly state and disassembly state. In assembly state, the growth of microtubule includes two processes: GTP-tubulin binding to the tip of protofilament (PF) and conformational change of PF, during which the penultimate GTP is hydrolyzed and the first tubulin unit that curls out the MT surface is rearranged into MT surface using the energy released from GTP hydrolysis . In disassembly state, the shortening of microtubule is also described by two processes, the release of GDP-tibulin from the tip of PF and one new tubulin unit curls out from the MT surface. Switches between these two states, which are usually called rescue and catastrophe, happen stochastically with external force dependent rates. Using this two-state model with parameters obtained by fitting the recent experimental data, detailed properties of MT growth are obtained, we find that MT is mainly in assembly state, its mean growth velocity increases with external force and GTP-tubulin concentration, MT will shorten in average without external force. To know more about the external force and GTP concentration dependent MT growth properties , and for the sake of experimental verification of this two-state model, eight {\\it critical forces} are defined and numerically discussed.", "after_revision": "In this study, a two-state mechanochemical model is presented to describe the dynamic instability of microtubules (MTs) in cells. The MTs switches between two states, assembly state and disassembly state. In assembly state, the growth of MTs includes two processes: free GTP-tubulin binding to the tip of protofilament (PF) and conformation change of PF, during which the first tubulin unit which curls outwards is rearranged into MT surface using the energy released from the hydrolysis of GTP in the penultimate tubulin unit . In disassembly state, the shortening of MTs includes also two processes, the release of GDP-tibulin from the tip of PF and one new tubulin unit curls out of the MT surface. Switches between these two states, which are usually called rescue and catastrophe, happen stochastically with external force dependent rates. Using this two-state model with parameters obtained by fitting the recent experimental data, detailed properties of MT growth are obtained, we find that MT is mainly in assembly state, its mean growth velocity increases with external force and GTP-tubulin concentration, MT will shorten in average without external force. To know more about the external force and GTP-tubulin concentration dependent properties of MT growth , and for the sake of the future experimental verification of this two-state model, eleven {\\it critical forces} are defined and numerically discussed.", "edit_actions": [{"type": "R", "before": "properties of microtubule (MT) growth", "after": "instability of microtubules (MTs)", "start_char_pos": 86, "end_char_pos": 123}, {"type": "R", "before": "MT", "after": "MTs", "start_char_pos": 138, "end_char_pos": 140}, {"type": "R", "before": "microtubule", "after": "MTs", "start_char_pos": 241, "end_char_pos": 252}, {"type": "A", "before": null, "after": "free", "start_char_pos": 277, "end_char_pos": 277}, {"type": "R", "before": "conformational", "after": "conformation", "start_char_pos": 335, "end_char_pos": 349}, {"type": "D", "before": "penultimate GTP is hydrolyzed and the", "after": null, "start_char_pos": 381, "end_char_pos": 418}, {"type": "R", "before": "that curls out the MT surface", "after": "which curls outwards", "start_char_pos": 438, "end_char_pos": 467}, {"type": "R", "before": "GTP hydrolysis", "after": "the hydrolysis of GTP in the penultimate tubulin unit", "start_char_pos": 529, "end_char_pos": 543}, {"type": "R", "before": "microtubule is also described by", "after": "MTs includes also", "start_char_pos": 586, "end_char_pos": 618}, {"type": "R", "before": "from", "after": "of", "start_char_pos": 715, "end_char_pos": 719}, {"type": "R", "before": "GTP concentration dependent MT growth properties", "after": "GTP-tubulin concentration dependent properties of MT growth", "start_char_pos": 1243, "end_char_pos": 1291}, {"type": "A", "before": null, "after": "the future", "start_char_pos": 1314, "end_char_pos": 1314}, {"type": "R", "before": "eight", "after": "eleven", "start_char_pos": 1366, "end_char_pos": 1371}], "sents_char_pos": [0, 133, 207, 545, 735, 878, 1200]} {"doc_id": "1108.4886", "revision_depth": "1", "before_revision": "We study a stochastic, continuous-time model on a finite horizon for a firm that produces one goodutilizing production capacity (capital) . We model the capital as an Ito diffusion controlled by a nondecreasing process representing the cumulative investment. The firm 's optimal problem is to choose capital investment in order to maximize its expected total net profit . We derive some necessary and sufficient first order conditions for optimality and we characterize the optimal solution of the investment problem in terms of the \"base capacity \" process, i.e. the unique solution of a Representation Problem \\`a la Bank-El Karoui . Under Markovian assumption, we show that the base capacity is in fact deterministic and coincides with the free boundary of the optimal stopping problem naturally associated to the singular control one. For a Cobb-Douglas production function, if the diffusion's coefficients are constant, we are able to show that the free boundary is a continuous function of the time so to remove Assumption- Cfb%DIFDELCMD < ] %%% in Chiarolla and Haussmann (2009) .", "after_revision": "We study a stochastic, continuous time model on a finite horizon for a firm that produces a single good . We model the production capacity as an Ito diffusion controlled by a nondecreasing process representing the cumulative investment. The firm aims to maximize its expected total net profit by choosing the optimal investment process. That is a singular stochastic control problem. We derive some first order conditions for optimality and we characterize the optimal solution in terms of the base capacity process, i.e. the unique solution of a representation problem in the spirit of Bank and El Karoui (2004). We show that the base capacity is deterministic and it is identified with the free boundary of the associated optimal stopping problem , when the coefficients of the controlled diffusion are deterministic functions of time. This is a novelty in the literature on finite horizon singular stochastic control problems. As a subproduct this result allows us to obtain an integral equation for the free boundary %DIFDELCMD < ] %%% , which we explicitly solve in the infinite horizon case for a Cobb-Douglas production function and constant coefficients in the controlled capacity process .", "edit_actions": [{"type": "R", "before": "continuous-time", "after": "continuous time", "start_char_pos": 23, "end_char_pos": 38}, {"type": "R", "before": "one goodutilizing production capacity (capital)", "after": "a single good", "start_char_pos": 90, "end_char_pos": 137}, {"type": "R", "before": "capital", "after": "production capacity", "start_char_pos": 153, "end_char_pos": 160}, {"type": "R", "before": "'s optimal problem is to choose capital investment in order to", "after": "aims to", "start_char_pos": 268, "end_char_pos": 330}, {"type": "R", "before": ".", "after": "by choosing the optimal investment process. That is a singular stochastic control problem.", "start_char_pos": 370, "end_char_pos": 371}, {"type": "D", "before": "necessary and sufficient", "after": null, "start_char_pos": 387, "end_char_pos": 411}, {"type": "D", "before": "of the investment problem", "after": null, "start_char_pos": 491, "end_char_pos": 516}, {"type": "R", "before": "\"base capacity \"", "after": "base capacity", "start_char_pos": 533, "end_char_pos": 549}, {"type": "R", "before": "Representation Problem \\`a la Bank-El Karoui . Under Markovian assumption, we", "after": "representation problem in the spirit of Bank and El Karoui (2004). We", "start_char_pos": 589, "end_char_pos": 666}, {"type": "R", "before": "in fact deterministic and coincides", "after": "deterministic and it is identified", "start_char_pos": 698, "end_char_pos": 733}, {"type": "A", "before": null, "after": "associated", "start_char_pos": 764, "end_char_pos": 764}, {"type": "R", "before": "naturally associated to the singular control one. For a Cobb-Douglas production function, if the diffusion's coefficients are constant, we are able to show that", "after": ", when the coefficients of the controlled diffusion are deterministic functions of time. This is a novelty in the literature on finite horizon singular stochastic control problems. As a subproduct this result allows us to obtain an integral equation for", "start_char_pos": 790, "end_char_pos": 950}, {"type": "D", "before": "is a continuous function of the time so to remove Assumption-", "after": null, "start_char_pos": 969, "end_char_pos": 1030}, {"type": "D", "before": "Cfb", "after": null, "start_char_pos": 1031, "end_char_pos": 1034}, {"type": "R", "before": "in Chiarolla and Haussmann (2009)", "after": ", which we explicitly solve in the infinite horizon case for a Cobb-Douglas production function and constant coefficients in the controlled capacity process", "start_char_pos": 1053, "end_char_pos": 1086}], "sents_char_pos": [0, 139, 258, 371, 635, 839]} {"doc_id": "1110.4965", "revision_depth": "2", "before_revision": "In this paper we consider an optimal dividend problem for an insurance company which risk process evolves as a spectrally negative Levy process (in the absence of dividend payments). We assume that the management of the company controls timing and size of dividend payments. The objective is to maximize the sum of the expected cumulative discounted dividends received until the moment of ruin and a penalty payment at the moment of ruin which is an increasing function of the size of the shortfall at ruin; in addition, there may be a fixed cost for taking out dividends. We explicitly solve the corresponding optimal control problem. The solution rests on the characterization of the value-function as (i) the unique stochastic solution of the associated HJB equation and as (ii) the pointwise smallest stochastic supersolution . We show that the optimal value process admits a dividend-penalty decomposition as sum of a martingale (associated to the penalty payment at ruin) and a potential (associated to the dividend payments). We find also an explicit necessary and sufficient condition for optimality of a single dividend-band strategy, in terms of a particular Gerber-Shiu function. We analyze a number of concrete examples .", "after_revision": "This paper concerns an optimal dividend distribution problem for an insurance company which risk process evolves as a spectrally negative L\\'{e process (in the absence of dividend payments). The management of the company is assumed to control timing and size of dividend payments. The objective is to maximize the sum of the expected cumulative discounted dividend payments received until the moment of ruin and a penalty payment at the moment of ruin which is an increasing function of the size of the shortfall at ruin; in addition, there may be a fixed cost for taking out dividends. A complete solution is presented to the corresponding stochastic control problem. It is established that the value-function is the unique stochastic solution and the pointwise smallest stochastic supersolution of the associated HJB equation. Furthermore, a necessary and sufficient condition is identified for optimality of a single dividend-band strategy, in terms of a particular Gerber-Shiu function. A number of concrete examples are analyzed .", "edit_actions": [{"type": "R", "before": "In this paper we consider", "after": "This paper concerns", "start_char_pos": 0, "end_char_pos": 25}, {"type": "A", "before": null, "after": "distribution", "start_char_pos": 46, "end_char_pos": 46}, {"type": "R", "before": "Levy", "after": "L\\'{e", "start_char_pos": 132, "end_char_pos": 136}, {"type": "R", "before": "We assume that the", "after": "The", "start_char_pos": 184, "end_char_pos": 202}, {"type": "R", "before": "controls", "after": "is assumed to control", "start_char_pos": 229, "end_char_pos": 237}, {"type": "R", "before": "dividends", "after": "dividend payments", "start_char_pos": 351, "end_char_pos": 360}, {"type": "R", "before": "We explicitly solve the corresponding optimal", "after": "A complete solution is presented to the corresponding stochastic", "start_char_pos": 574, "end_char_pos": 619}, {"type": "R", "before": "The solution rests on the characterization of the", "after": "It is established that the", "start_char_pos": 637, "end_char_pos": 686}, {"type": "R", "before": "as (i)", "after": "is", "start_char_pos": 702, "end_char_pos": 708}, {"type": "R", "before": "of the associated HJB equation and as (ii)", "after": "and", "start_char_pos": 740, "end_char_pos": 782}, {"type": "R", "before": ". We show that the optimal value process admits a dividend-penalty decomposition as sum of a martingale (associated to the penalty payment at ruin) and a potential (associated to the dividend payments). We find also an explicit", "after": "of the associated HJB equation. Furthermore, a", "start_char_pos": 831, "end_char_pos": 1058}, {"type": "A", "before": null, "after": "is identified", "start_char_pos": 1094, "end_char_pos": 1094}, {"type": "R", "before": "We analyze a", "after": "A", "start_char_pos": 1193, "end_char_pos": 1205}, {"type": "A", "before": null, "after": "are analyzed", "start_char_pos": 1234, "end_char_pos": 1234}], "sents_char_pos": [0, 183, 275, 508, 573, 636, 832, 1033, 1192]} {"doc_id": "1110.6265", "revision_depth": "1", "before_revision": "In this paper the results of the BitTorrent measurement study are presented. Two sources of BitTorrent data were utilized: meta-data files that describe the content of resources shared by BitTorrent users and logs of the currently one of the most popular BitTorrent clients - %DIFDELCMD < \\muTorrent%%% .%DIFDELCMD < \\muTorrent %%% is based on { rather newly released UDP-based %DIFDELCMD < \\muTP %%% protocol that is claimed to be more efficient than TCP-based clients. Experimental data have been collected for fifteen days from the popular torrent-discovery site - URL (more than 30 000 torrent were captured and analysed ). During this period the activity and logs of unmodified version of %DIFDELCMD < \\muTorrent %%% client downloading sessions have been also captured. The obtained experimental results are swarm-oriented (not tracker-oriented as it has been usually researched)and allow to look at BitTorrent and its users from the exchanged resources perspective. Moreover, comparative analysis of the clients' connections with and without %DIFDELCMD < \\muTP %%% protocol is carried out to verify to what extent %DIFDELCMD < \\muTP %%% improves BitTorrent transmissions. To authors' best knowledge, none of the previous studies have addressed these issues.", "after_revision": "In this paper the results of the BitTorrent measurement study are presented. Two sources of BitTorrent data were utilized: meta-data files that describe the content of resources shared by BitTorrent users and the logs of one of the currently most popular BitTorrent clients - %DIFDELCMD < \\muTorrent%%% %DIFDELCMD < \\muTorrent %%% \\mu Torrent.{\\mu Torrent is founded upon a rather newly released UDP-based %DIFDELCMD < \\muTP %%% \\mu TP protocol that is claimed to be more efficient than TCP-based clients. Experimental data have been collected for fifteen days from the popular torrent-discovery site URL (more than 30 , 000 torrents were captured and analyzed ). During this period the activity and logs of an unmodified version of %DIFDELCMD < \\muTorrent %%% \\mu Torrent client downloading sessions have also been captured. The obtained experimental results are swarm-oriented (not tracker-oriented as has been previously researched), which has allowed us to look at BitTorrent and its users from an exchanged resources perspective. Moreover, comparative analysis of the clients' connections with and without %DIFDELCMD < \\muTP %%% \\mu TP protocol is carried out to verify to what extent %DIFDELCMD < \\muTP %%% \\mu TP improves BitTorrent transmissions. To the authors' best knowledge, none of the previous studies have addressed these issues.", "edit_actions": [{"type": "R", "before": "logs of the currently", "after": "the logs of", "start_char_pos": 209, "end_char_pos": 230}, {"type": "A", "before": null, "after": "currently", "start_char_pos": 242, "end_char_pos": 242}, {"type": "D", "before": ".", "after": null, "start_char_pos": 304, "end_char_pos": 305}, {"type": "R", "before": "is based on", "after": "\\mu", "start_char_pos": 333, "end_char_pos": 344}, {"type": "A", "before": null, "after": "Torrent.", "start_char_pos": 345, "end_char_pos": 345}, {"type": "A", "before": null, "after": "\\mu", "start_char_pos": 346, "end_char_pos": 346}, {"type": "A", "before": null, "after": "Torrent is founded upon a", "start_char_pos": 347, "end_char_pos": 347}, {"type": "A", "before": null, "after": "\\mu", "start_char_pos": 403, "end_char_pos": 403}, {"type": "A", "before": null, "after": "TP", "start_char_pos": 404, "end_char_pos": 404}, {"type": "D", "before": "-", "after": null, "start_char_pos": 570, "end_char_pos": 571}, {"type": "A", "before": null, "after": ",", "start_char_pos": 590, "end_char_pos": 590}, {"type": "R", "before": "torrent", "after": "torrents", "start_char_pos": 595, "end_char_pos": 602}, {"type": "R", "before": "analysed", "after": "analyzed", "start_char_pos": 621, "end_char_pos": 629}, {"type": "A", "before": null, "after": "an", "start_char_pos": 677, "end_char_pos": 677}, {"type": "A", "before": null, "after": "\\mu", "start_char_pos": 728, "end_char_pos": 728}, {"type": "A", "before": null, "after": "Torrent", "start_char_pos": 729, "end_char_pos": 729}, {"type": "R", "before": "been also", "after": "also been", "start_char_pos": 763, "end_char_pos": 772}, {"type": "R", "before": "it has been usually researched)and allow", "after": "has been previously researched), which has allowed us", "start_char_pos": 861, "end_char_pos": 901}, {"type": "R", "before": "the", "after": "an", "start_char_pos": 943, "end_char_pos": 946}, {"type": "A", "before": null, "after": "\\mu", "start_char_pos": 1079, "end_char_pos": 1079}, {"type": "A", "before": null, "after": "TP", "start_char_pos": 1080, "end_char_pos": 1080}, {"type": "A", "before": null, "after": "\\mu", "start_char_pos": 1153, "end_char_pos": 1153}, {"type": "A", "before": null, "after": "TP", "start_char_pos": 1154, "end_char_pos": 1154}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1193, "end_char_pos": 1193}], "sents_char_pos": [0, 76, 474, 632, 782, 979, 1189]} {"doc_id": "1112.6085", "revision_depth": "1", "before_revision": "We have studied the empirical distribution of cancellation positions through rebuilding the limit-order book using the order flow data of 23 liquid stocks traded on the Shenzhen Stock Exchange in the year 2003. We find that the probability density function (PDF) of relative price levels where cancellations allocate obeys the log-normal distribution. We then analyze the PDF of normalized relative price levels by removing the factor of order numbers stored at the price level, and find that the PDF has a power-law behavior in the tails for both buy and sell orders. When we focus on the probability distribution of cancellation positions at a certain price level, we find that the PDF increases rapidly in the front of the queue, and then fluctuates around a constat value until the end of the queue. In addtion, the PDF of cancellation positions can be fitted by the exponent function for both buy and sell orders .", "after_revision": "Order submission and cancellation are two constituent actions of stock trading behaviors in order-driven markets. Order submission dynamics has been extensively studied for different markets, while order cancellation dynamics is less understood. There are two positions associated with a cancellation, that is, the price level in the limit-order book (LOB) and the position in the queue at each price level. We study the profiles of these two order cancellation positions through rebuilding the limit-order book using the order flow data of 23 liquid stocks traded on the Shenzhen Stock Exchange in the year 2003. We find that the profiles of relative price levels where cancellations occur obey a log-normal distribution. After normalizing the relative price level by removing the factor of order numbers stored at the price level, we find that the profiles exhibit a power-law scaling behavior on the right tails for both buy and sell orders. When focusing on the order cancellation positions in the queue at each price level, we find that the profiles increase rapidly in the front of the queue, and then fluctuate around a constant value till the end of the queue. These profiles are similar for different stocks. In addition, the profiles of cancellation positions can be fitted by an exponent function for both buy and sell orders . These two kinds of cancellation profiles seem universal for different stocks investigated and exhibit minor asymmetry between buy and sell orders. Our empirical findings shed new light on the order cancellation dynamics and pose constraints on the construction of order-driven stock market models .", "edit_actions": [{"type": "R", "before": "We have studied the empirical distribution of", "after": "Order submission and cancellation are two constituent actions of stock trading behaviors in order-driven markets. Order submission dynamics has been extensively studied for different markets, while order cancellation dynamics is less understood. There are two positions associated with a cancellation, that is, the price level in the limit-order book (LOB) and the position in the queue at each price level. We study the profiles of these two order", "start_char_pos": 0, "end_char_pos": 45}, {"type": "R", "before": "probability density function (PDF)", "after": "profiles", "start_char_pos": 228, "end_char_pos": 262}, {"type": "R", "before": "allocate obeys the", "after": "occur obey a", "start_char_pos": 308, "end_char_pos": 326}, {"type": "R", "before": "We then analyze the PDF of normalized relative price levels", "after": "After normalizing the relative price level", "start_char_pos": 352, "end_char_pos": 411}, {"type": "R", "before": "and", "after": "we", "start_char_pos": 479, "end_char_pos": 482}, {"type": "R", "before": "PDF has", "after": "profiles exhibit", "start_char_pos": 497, "end_char_pos": 504}, {"type": "R", "before": "behavior in the", "after": "scaling behavior on the right", "start_char_pos": 517, "end_char_pos": 532}, {"type": "R", "before": "we focus on the probability distribution of cancellation positions at a certain", "after": "focusing on the order cancellation positions in the queue at each", "start_char_pos": 574, "end_char_pos": 653}, {"type": "R", "before": "PDF increases", "after": "profiles increase", "start_char_pos": 684, "end_char_pos": 697}, {"type": "R", "before": "fluctuates around a constat value until", "after": "fluctuate around a constant value till", "start_char_pos": 742, "end_char_pos": 781}, {"type": "R", "before": "In addtion, the PDF", "after": "These profiles are similar for different stocks. In addition, the profiles", "start_char_pos": 804, "end_char_pos": 823}, {"type": "R", "before": "the", "after": "an", "start_char_pos": 867, "end_char_pos": 870}, {"type": "A", "before": null, "after": ". These two kinds of cancellation profiles seem universal for different stocks investigated and exhibit minor asymmetry between buy and sell orders. Our empirical findings shed new light on the order cancellation dynamics and pose constraints on the construction of order-driven stock market models", "start_char_pos": 918, "end_char_pos": 918}], "sents_char_pos": [0, 210, 351, 568, 803]} {"doc_id": "1202.1358", "revision_depth": "1", "before_revision": "The fundamental law for protein folding is the %DIFDELCMD < {\\bf %%% Thermodynamic Principle : the amino acid sequence of a protein determines its native structure and the native structure has the minimum Gibbs free energy among all possible conformations of the protein. The very essential of the thermodynamic principle, a Gibbs free energy formula G( %DIFDELCMD < \\bX%%% ) for every possible conformation %DIFDELCMD < \\bX %%% of the protein , has never been theoretically formulated from the fundamental physical laws. We will apply quantum statistics to derive such a formula. The formula has two versions, the chemical balance version is: equation*%DIFDELCMD < } %%% G(%DIFDELCMD < \\bX%%% ) = \\mu_eN_e(%DIFDELCMD < \\bX%%% ) + \\sum_{i=1^H \\mu_i N_i(}%DIFDELCMD < \\bX%%% ), equation*%DIFDELCMD < } %%% where N_e(%DIFDELCMD < \\bX%%% ) is the mean number of electrons in the space included by the first hydration shell of%DIFDELCMD < \\bX%%% , \\mu_e is its chemical potential; the index i, 1%DIFDELCMD < \\le %%% i%DIFDELCMD < \\le %%% H, is the hydrophobicity classification of atoms. N_i(%DIFDELCMD < \\bX%%% ) is the mean number of water molecules in the first hydration layer that directly contact to the atoms with the hydrophobicity degree i; \\mu_i is the chemical potential. Label all atoms of hydrophobicity degree i by H_i and let M_\\bX be the molecular surface for the conformation%DIFDELCMD < \\bX%%% , defining M_{\\bX_i as the set of points in M_\\bX that are closer to atoms in H_i than any atoms in H_j, j }%DIFDELCMD < \\ne %%% i. Then the geometric version of G(%DIFDELCMD < \\bX%%% ) resembles to well-known surface area models , plus a volume term: equation*%DIFDELCMD < } %%% G(%DIFDELCMD < \\bX%%% ) = a\\mu_e V(\\Omega_\\bX)+ ad_w\\mu_eA(M_\\bX) + \\sum_{i=1^H\\nu_i \\mu_i A(M_{\\bX_i}), }%DIFDELCMD < \\quad %%% a , \\nu_i > 0, equation*%DIFDELCMD < } %%% where V(\\Omega_\\bX) is the volume of the domain \\Omega_\\bX enclosed by M_\\bX, d_w is the diameter of a water molecule, and A(M_\\bX) and A(M_{\\bX_i) are the areas of M_\\bX and M_{\\bX_i}} \\nablaxi .", "after_revision": "The fundamental law for protein folding is the %DIFDELCMD < {\\bf %%% Thermodynamic Principle : the amino acid sequence of a protein determines its native structure and the native structure has the minimum Gibbs free energy . If all chemical problems can be answered by quantum mechanics, there should be a quantum mechanics derivation of Gibbs free energy formula G( %DIFDELCMD < \\bX%%% X ) for every possible conformation %DIFDELCMD < \\bX %%% X of the protein . We apply quantum statistics to derive such a formula. %DIFDELCMD < } %%% %DIFDELCMD < \\bX%%% %DIFDELCMD < \\bX%%% ^H \\mu_i N_i(}%DIFDELCMD < \\bX%%% %DIFDELCMD < } %%% %DIFDELCMD < \\bX%%% %DIFDELCMD < \\bX%%% %DIFDELCMD < \\le %%% %DIFDELCMD < \\le %%% %DIFDELCMD < \\bX%%% %DIFDELCMD < \\bX%%% as the set of points in M_\\bX that are closer to atoms in H_i than any atoms in H_j, j }%DIFDELCMD < \\ne %%% %DIFDELCMD < \\bX%%% For simplicity, only monomeric self folding globular proteins are covered. We point out some immediate applications of the formula. We show that the formula explains the observed phenomena very well. It gives a unified explanation to both folding and denaturation; it explains why hydrophobic effect is the driving force of protein folding and clarifies the role played by hydrogen bonding; it explains the successes and deficients of various surface area models %DIFDELCMD < } %%% %DIFDELCMD < \\bX%%% . The formula also gives a clear kinetic force of the folding: Fi(X ) = ^H\\nu_i \\mu_i A(M_{\\bX_i}), }%DIFDELCMD < \\quad %%% %DIFDELCMD < } %%% ) are the areas of M_\\bX and M_{\\bX_i}} -\\nablaxi G(X). This also gives a natural way to perform the ab initio prediction of protein structure, minimizing G(X) by Newton's fastest desciending method .", "edit_actions": [{"type": "R", "before": "Thermodynamic Principle", "after": "Thermodynamic Principle", "start_char_pos": 69, "end_char_pos": 92}, {"type": "R", "before": "among all possible conformations of the protein. The very essential of the thermodynamic principle, a", "after": ". If all chemical problems can be answered by quantum mechanics, there should be a quantum mechanics derivation of", "start_char_pos": 223, "end_char_pos": 324}, {"type": "A", "before": null, "after": "X", "start_char_pos": 374, "end_char_pos": 374}, {"type": "A", "before": null, "after": "X", "start_char_pos": 430, "end_char_pos": 430}, {"type": "R", "before": ", has never been theoretically formulated from the fundamental physical laws. We will", "after": ". We", "start_char_pos": 446, "end_char_pos": 531}, {"type": "D", "before": "The formula has two versions, the chemical balance version is:", "after": null, "start_char_pos": 583, "end_char_pos": 645}, {"type": "D", "before": "equation*", "after": null, "start_char_pos": 646, "end_char_pos": 655}, {"type": "D", "before": "G(", "after": null, "start_char_pos": 674, "end_char_pos": 676}, {"type": "D", "before": ") = \\mu_eN_e(", "after": null, "start_char_pos": 696, "end_char_pos": 709}, {"type": "D", "before": ") + \\sum_{i=1", "after": null, "start_char_pos": 729, "end_char_pos": 742}, {"type": "D", "before": "),", "after": null, "start_char_pos": 776, "end_char_pos": 778}, {"type": "D", "before": "equation*", "after": null, "start_char_pos": 779, "end_char_pos": 788}, {"type": "D", "before": "where N_e(", "after": null, "start_char_pos": 807, "end_char_pos": 817}, {"type": "D", "before": ") is the mean number of electrons in the space included by the first hydration shell of", "after": null, "start_char_pos": 837, "end_char_pos": 924}, {"type": "D", "before": ", \\mu_e is its chemical potential; the index i, 1", "after": null, "start_char_pos": 944, "end_char_pos": 993}, {"type": "D", "before": "i", "after": null, "start_char_pos": 1014, "end_char_pos": 1015}, {"type": "D", "before": "H, is the hydrophobicity classification of atoms. N_i(", "after": null, "start_char_pos": 1036, "end_char_pos": 1090}, {"type": "D", "before": ") is the mean number of water molecules in the first hydration layer that directly contact to the atoms with the hydrophobicity degree i; \\mu_i is the chemical potential. Label all atoms of hydrophobicity degree i by H_i and let M_\\bX be the molecular surface for the conformation", "after": null, "start_char_pos": 1110, "end_char_pos": 1390}, {"type": "D", "before": ", defining M_{\\bX_i", "after": null, "start_char_pos": 1410, "end_char_pos": 1429}, {"type": "D", "before": "i. Then the geometric version of G(", "after": null, "start_char_pos": 1539, "end_char_pos": 1574}, {"type": "R", "before": ") resembles to well-known", "after": "For simplicity, only monomeric self folding globular proteins are covered. We point out some immediate applications of the formula. We show that the formula explains the observed phenomena very well. It gives a unified explanation to both folding and denaturation; it explains why hydrophobic effect is the driving force of protein folding and clarifies the role played by hydrogen bonding; it explains the successes and deficients of various", "start_char_pos": 1594, "end_char_pos": 1619}, {"type": "D", "before": ", plus a volume term:", "after": null, "start_char_pos": 1640, "end_char_pos": 1661}, {"type": "D", "before": "equation*", "after": null, "start_char_pos": 1662, "end_char_pos": 1671}, {"type": "D", "before": "G(", "after": null, "start_char_pos": 1690, "end_char_pos": 1692}, {"type": "A", "before": null, "after": ". The formula also gives a clear kinetic force of the folding: Fi(X", "start_char_pos": 1712, "end_char_pos": 1712}, {"type": "D", "before": "a\\mu_e V(\\Omega_\\bX)+ ad_w\\mu_eA(M_\\bX) + \\sum_{i=1", "after": null, "start_char_pos": 1717, "end_char_pos": 1768}, {"type": "D", "before": "a , \\nu_i > 0,", "after": null, "start_char_pos": 1820, "end_char_pos": 1834}, {"type": "D", "before": "equation*", "after": null, "start_char_pos": 1835, "end_char_pos": 1844}, {"type": "D", "before": "where V(\\Omega_\\bX) is the volume of the domain \\Omega_\\bX enclosed by M_\\bX, d_w is the diameter of a water molecule, and A(M_\\bX) and A(M_{\\bX_i", "after": null, "start_char_pos": 1863, "end_char_pos": 2009}, {"type": "A", "before": null, "after": "-", "start_char_pos": 2049, "end_char_pos": 2049}, {"type": "A", "before": null, "after": "G(X). This also gives a natural way to perform the ab initio prediction of protein structure, minimizing G(X) by Newton's fastest desciending method", "start_char_pos": 2058, "end_char_pos": 2058}], "sents_char_pos": [0, 271, 523, 582, 978, 1085, 1247, 1280, 1661]} {"doc_id": "1203.6631", "revision_depth": "1", "before_revision": "We explore the inversion of derivatives prices to obtain an implied probability measure on volatility's hidden state. Stochastic volatility is a hidden Markov model (HMM) , and HMMs ordinarily warrant filtering. However, derivative data is a set of conditional expectations that are already observed in the market, so rather than use filtering techniques we compute animplied distribution by inverting the market's option prices. Robustness is an issue when model parameters are probably unknown, but isn't crippling in practical settings because the data is sufficiently imprecise and prevents us from reducing the fitting error down to levels where parameter uncertainty will show . When applied to SPX data, the estimated model and implied distributions produce variance swap rates that are consistent with the VIX , and also pick up some of the monthly effects that occur from option expiration. We find that parsimony of the Heston model is beneficial because we are able to decipher behavior in estimated parameters and implied measures, whereas the richer Heston model with jumps produces a better fit but also has implied behavior that is less revealing .", "after_revision": "We formulate and analyze an inverse problem using derivatives prices to obtain an implied filtering density on volatility's hidden state. Stochastic volatility is the unobserved state in a hidden Markov model (HMM) and can be tracked using Bayesian filtering. However, derivative data can be considered as conditional expectations that are already observed in the market, and which can be used as input to an inverse problem whose solution is an implied conditional density on volatility. Our analysis relies on a specification of the martingale change of measure, which we refer to asseparability. This specification has a multiplicative component that behaves like a risk premium on volatility uncertainty in the market . When applied to SPX options data, the estimated model and implied densities produce variance-swap rates that are consistent with the VIX volatility index. The implied densities are relatively stable over time and pick up some of the monthly effects that occur due to the options' expiration, indicating that the volatility-uncertainty premium could experience cyclic effects due to the maturity date of the options .", "edit_actions": [{"type": "R", "before": "explore the inversion of", "after": "formulate and analyze an inverse problem using", "start_char_pos": 3, "end_char_pos": 27}, {"type": "R", "before": "probability measure", "after": "filtering density", "start_char_pos": 68, "end_char_pos": 87}, {"type": "A", "before": null, "after": "the unobserved state in", "start_char_pos": 143, "end_char_pos": 143}, {"type": "R", "before": ", and HMMs ordinarily warrant", "after": "and can be tracked using Bayesian", "start_char_pos": 172, "end_char_pos": 201}, {"type": "R", "before": "is a set of", "after": "can be considered as", "start_char_pos": 238, "end_char_pos": 249}, {"type": "D", "before": "so rather than use filtering techniques we compute an", "after": null, "start_char_pos": 316, "end_char_pos": 369}, {"type": "D", "before": "implied distribution", "after": null, "start_char_pos": 369, "end_char_pos": 389}, {"type": "R", "before": "by inverting the market's option prices. Robustness is an issue when model parameters are probably unknown, but isn't crippling in practical settings because the data is sufficiently imprecise and prevents us from reducing the fitting error down to levels where parameter uncertainty will show", "after": "and which can be used as input to an inverse problem whose solution is an implied conditional density on volatility. Our analysis relies on a specification of the martingale change of measure, which we refer to as", "start_char_pos": 390, "end_char_pos": 683}, {"type": "A", "before": null, "after": "separability", "start_char_pos": 683, "end_char_pos": 683}, {"type": "A", "before": null, "after": ". This specification has a multiplicative component that behaves like a risk premium on volatility uncertainty in the market", "start_char_pos": 683, "end_char_pos": 683}, {"type": "A", "before": null, "after": "options", "start_char_pos": 706, "end_char_pos": 706}, {"type": "R", "before": "distributions produce variance swap", "after": "densities produce variance-swap", "start_char_pos": 745, "end_char_pos": 780}, {"type": "R", "before": ", and also", "after": "volatility index. The implied densities are relatively stable over time and", "start_char_pos": 820, "end_char_pos": 830}, {"type": "R", "before": "from option expiration. We find that parsimony of the Heston model is beneficial because we are able to decipher behavior in estimated parameters and implied measures, whereas the richer Heston model with jumps produces a better fit but also has implied behavior that is less revealing", "after": "due to the options' expiration, indicating that the volatility-uncertainty premium could experience cyclic effects due to the maturity date of the options", "start_char_pos": 878, "end_char_pos": 1163}], "sents_char_pos": [0, 117, 212, 430, 685, 901]} {"doc_id": "1204.5055", "revision_depth": "1", "before_revision": "The aim of this paper is twofold: to provide a theoretical framework and to give further empirical support to Shiller's test of the appropriateness of prices in the stock market based on the Cyclically Adjusted Price Earnings (CAPE) ratio. We devote the first part of the paper to the empirical analysis and we show that the CAPE is a powerful predictor of future long run performances of the market not only for the U. S. but also for countries such as Belgium, France, Germany, Japan, the Netherlands, Norway, Sweden and Switzerland. We show four relevant empirical facts: i) the striking ability of the logarithmic averaged earning over price ratio to predict returns of the index, ii) how this evidence increases switching from returns to gross returns, iii) moving over different time horizons, the regression coefficients are constant in a statistically robust way, and iv) the poorness of the prediction when the precursor is adjusted with long term interest rate. In the second part we provide a theoretical justification of the empirical observations. Indeed we propose a simple model of the price dynamics in which the return growth depends on three components: a ) a momentum component, naturally justified in terms of agents' belief that expected returns are higher in bullish markets than in bearish ones ; b ) a fundamental component proportional to the log earnings over price ratio at time zero , from which the actual stock price may deviate as an effect of random external disturbances, and c ) a driving component ensuring the diffusive behaviour of stock prices. Under these assumptions, we are able to prove that , if we consider a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with rate of convergence equal to minus one .", "after_revision": "We present a simple dynamical model of stock index returns which is grounded on the ability of the Cyclically Adjusted Price Earning (CAPE) valuation ratio devised by Robert Shiller to predict long-horizon performances of the market . More precisely, we discuss a discrete time dynamics in which the return growth depends on three components: i ) a momentum component, naturally justified in terms of agents' belief that expected returns are higher in bullish markets than in bearish ones , ii ) a fundamental component proportional to the logarithmic CAPE at time zero . The initial value of the ratio determines the reference growth level , from which the actual stock price may deviate as an effect of random external disturbances, and iii ) a driving component which ensures the diffusive behaviour of stock prices. Under these assumptions, we prove that for a sufficiently large horizon the expected rate of return and the expected gross return are linear in the initial logarithmic CAPE , and their variance goes to zero with a rate of convergence consistent with the diffusive behaviour. Eventually this means that the momentum component may generate bubbles and crashes in the short and medium run, nevertheless the valuation ratio remains a good reference point of future long-run returns .", "edit_actions": [{"type": "R", "before": "The aim of this paper is twofold: to provide a theoretical framework and to give further empirical support to Shiller's test of the appropriateness of prices in the stock market based on the", "after": "We present a simple dynamical model of stock index returns which is grounded on the ability of the", "start_char_pos": 0, "end_char_pos": 190}, {"type": "R", "before": "Earnings", "after": "Earning", "start_char_pos": 217, "end_char_pos": 225}, {"type": "R", "before": "ratio. We devote the first part of the paper to the empirical analysis and we show that the CAPE is a powerful predictor of future long run", "after": "valuation ratio devised by Robert Shiller to predict long-horizon", "start_char_pos": 233, "end_char_pos": 372}, {"type": "R", "before": "not only for the U. S. but also for countries such as Belgium, France, Germany, Japan, the Netherlands, Norway, Sweden and Switzerland. We show four relevant empirical facts: i) the striking ability of the logarithmic averaged earning over price ratio to predict returns of the index, ii) how this evidence increases switching from returns to gross returns, iii) moving over different time horizons, the regression coefficients are constant in a statistically robust way, and iv) the poorness of the prediction when the precursor is adjusted with long term interest rate. In the second part we provide a theoretical justification of the empirical observations. Indeed we propose a simple model of the price", "after": ". More precisely, we discuss a discrete time", "start_char_pos": 400, "end_char_pos": 1106}, {"type": "R", "before": "a", "after": "i", "start_char_pos": 1172, "end_char_pos": 1173}, {"type": "R", "before": "; b", "after": ", ii", "start_char_pos": 1318, "end_char_pos": 1321}, {"type": "R", "before": "log earnings over price ratio", "after": "logarithmic CAPE", "start_char_pos": 1368, "end_char_pos": 1397}, {"type": "A", "before": null, "after": ". The initial value of the ratio determines the reference growth level", "start_char_pos": 1411, "end_char_pos": 1411}, {"type": "R", "before": "c", "after": "iii", "start_char_pos": 1510, "end_char_pos": 1511}, {"type": "R", "before": "ensuring", "after": "which ensures", "start_char_pos": 1534, "end_char_pos": 1542}, {"type": "R", "before": "are able to prove that , if we consider", "after": "prove that for", "start_char_pos": 1612, "end_char_pos": 1651}, {"type": "R", "before": "number of periods,", "after": "horizon", "start_char_pos": 1673, "end_char_pos": 1691}, {"type": "R", "before": "time value of the log earnings over price ratio", "after": "logarithmic CAPE", "start_char_pos": 1776, "end_char_pos": 1823}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1863, "end_char_pos": 1863}, {"type": "R", "before": "equal to minus one", "after": "consistent with the diffusive behaviour. Eventually this means that the momentum component may generate bubbles and crashes in the short and medium run, nevertheless the valuation ratio remains a good reference point of future long-run returns", "start_char_pos": 1884, "end_char_pos": 1902}], "sents_char_pos": [0, 239, 535, 971, 1060, 1319, 1583]} {"doc_id": "1206.3768", "revision_depth": "1", "before_revision": "In some Density Functional Theory based simulations each self-consistent cycle comprises dozens of large dense generalized eigenproblems. In a recent study , it was proposed to consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\\bf k}-vectors and an increasing outer-iteration cycle index i. It was then demonstrated that successive eigenproblems in a sequence are strongly correlated to one another. In particular, by tracking the evolution of subspace angles between eigenvectors of successive eigenproblems, it was shown that these angles decrease noticeably after the first few iterations and become close to collinear . This last result suggests that we could manipulate the eigenvectors, solving for a specific eigenproblem in a sequence, as an approximate solution for the following eigenproblem. In the present work we present a set of preliminary results confirming this initial intuition. We provide numerical examples where opportunely selected block iterative solvers benefit from the reuse of eigenvectors by achieving a substantial speed-up. All the numerical tests are run employing sequences of eigenproblems extracted from simulations of real-world materials . The results presented here could eventually open the way to a widespread use of block iterative solvers in ab initio electronic structure codes even when dealing with dense eigenproblems .", "after_revision": "In Density Functional Theory simulations based on the LAPW method, each self-consistent cycle comprises dozens of large dense generalized eigenproblems. In contrast to real-space methods, eigenpairs solving for problems at distinct cycles have either been believed to be independent or at most very loosely connected. In a recent study \\mbox{%DIFAUXCMD DBB , it was proposed to revert this point of view and consider simulations as made of dozens of sequences of eigenvalue problems ; each sequence groups together eigenproblems with equal {\\bf k}-vectors and an increasing outer-iteration cycle index \\ell. From this different standpoint it was possible to demonstrate that, contrary to belief, successive eigenproblems in a sequence are strongly correlated with one another. In particular, by tracking the evolution of subspace angles between eigenvectors of successive eigenproblems, it was shown that these angles decrease noticeably after the first few iterations and become close to collinear : the closer to convergence the stronger the correlation becomes . This last result suggests that we can manipulate the eigenvectors, solving for a specific eigenproblem in a sequence, as an approximate solution for the following eigenproblem. In this work we present results that are in line with this intuition. First, we provide numerical examples where opportunely selected block iterative solvers benefit from the reuse of eigenvectors by achieving a substantial speed-up. We then develop a C language version of one of these algorithms and run a series of tests specifically focused on performance and scalability. All the numerical tests are carried out employing sequences of eigenproblems extracted from simulations of solid-state physics crystals . The results presented here could eventually open the way to a widespread use of block iterative solvers in ab initio electronic structure codes based on the LAPW approach .", "edit_actions": [{"type": "D", "before": "some", "after": null, "start_char_pos": 3, "end_char_pos": 7}, {"type": "R", "before": "based simulations", "after": "simulations based on the LAPW method,", "start_char_pos": 34, "end_char_pos": 51}, {"type": "A", "before": null, "after": "contrast to real-space methods, eigenpairs solving for problems at distinct cycles have either been believed to be independent or at most very loosely connected. In", "start_char_pos": 141, "end_char_pos": 141}, {"type": "A", "before": null, "after": "\\mbox{%DIFAUXCMD DBB", "start_char_pos": 157, "end_char_pos": 157}, {"type": "A", "before": null, "after": "revert this point of view and", "start_char_pos": 179, "end_char_pos": 179}, {"type": "R", "before": ", where", "after": ";", "start_char_pos": 255, "end_char_pos": 262}, {"type": "R", "before": "i. It was then demonstrated that", "after": "\\ell. From this different standpoint it was possible to demonstrate that, contrary to belief,", "start_char_pos": 380, "end_char_pos": 412}, {"type": "R", "before": "to", "after": "with", "start_char_pos": 476, "end_char_pos": 478}, {"type": "A", "before": null, "after": ": the closer to convergence the stronger the correlation becomes", "start_char_pos": 714, "end_char_pos": 714}, {"type": "R", "before": "could", "after": "can", "start_char_pos": 751, "end_char_pos": 756}, {"type": "R", "before": "the present", "after": "this", "start_char_pos": 899, "end_char_pos": 910}, {"type": "R", "before": "a set of preliminary results confirming this initial intuition. We", "after": "results that are in line with this intuition. First, we", "start_char_pos": 927, "end_char_pos": 993}, {"type": "A", "before": null, "after": "We then develop a C language version of one of these algorithms and run a series of tests specifically focused on performance and scalability.", "start_char_pos": 1148, "end_char_pos": 1148}, {"type": "R", "before": "run", "after": "carried out", "start_char_pos": 1177, "end_char_pos": 1180}, {"type": "R", "before": "real-world materials", "after": "solid-state physics crystals", "start_char_pos": 1248, "end_char_pos": 1268}, {"type": "R", "before": "even when dealing with dense eigenproblems", "after": "based on the LAPW approach", "start_char_pos": 1415, "end_char_pos": 1457}], "sents_char_pos": [0, 137, 382, 491, 716, 895, 990, 1147, 1270]} {"doc_id": "1211.0349", "revision_depth": "1", "before_revision": "MicroRNAs (miRNAs) play critical roles in modulating stem cell pluripotency and their differentiation, but the general fundamental mechanism remains largely unknown. This study systematically reveals the general roles of miRNAs in mouse pluripotent stem cells by analyzing a physical interaction network constructed from miRNA and protein binding data generated by next-generation sequencing . Generally, miRNAs vary their suppressor roles in different cellular developmental stages, a pluripotent stateor a differential state . During pluripotency , miRNAs primarily repress developmental processes while they inhibit metabolism in the differential state. Interestingly, in the pluripotent state, miRNAs do not directly regulate the pluripotent core activities but mediate extrinsic signal pathways associated with the pluripotency; however in the differential state, miRNAs directly repress the pluripotency. Mechanically , DNA methylation in enhancer regions mediates these miRNA activations. Together, under mediation by DNA methylation, miRNAs directly repress development but only modulate the pluripotent signal pathways in the pluripotent state; while in the developmental state miRNAs directly suppress both metabolism and pluripotency .", "after_revision": "MicroRNAs (miRNAs) critically modulate stem cell pluripotency and their differentiation, but the precise mechanistic mechanism remains largely unknown. This study systematically reveals the functional and mechanistic roles of miRNAs in mouse pluripotent stem cells by analyzing the genome-wide physical interactions between all activated miRNAs and their targets . Generally, miRNAs vary their physical targets and functions with the switch of pluripotency to differentiation state . During pluripotency miRNAs primarily and mechanistically target and repress developmental processes , but surprisingly miRNAs do not directly target the pluripotent core factors but only mediate extrinsic signal pathways associated with pluripotency. During differentiation miRNAs mechanistically inhibit metabolism and directly repress the pluripotency. Interestingly , DNA methylation in enhancer regions mediates these miRNA activations. Together, under mediation by DNA methylation, miRNAs directly repress development and mechanistically modulate the pluripotent signal pathways to help stem cells maintain pluripotency; yet miRNAs directly repress both pluripotency and metabolism to facilitate cell differentiation .", "edit_actions": [{"type": "R", "before": "play critical roles in modulating", "after": "critically modulate", "start_char_pos": 19, "end_char_pos": 52}, {"type": "R", "before": "general fundamental", "after": "precise mechanistic", "start_char_pos": 111, "end_char_pos": 130}, {"type": "R", "before": "general", "after": "functional and mechanistic", "start_char_pos": 204, "end_char_pos": 211}, {"type": "R", "before": "a physical interaction network constructed from miRNA and protein binding data generated by next-generation sequencing", "after": "the genome-wide physical interactions between all activated miRNAs and their targets", "start_char_pos": 273, "end_char_pos": 391}, {"type": "R", "before": "suppressor roles in different cellular developmental stages, a pluripotent stateor a differential state", "after": "physical targets and functions with the switch of pluripotency to differentiation state", "start_char_pos": 423, "end_char_pos": 526}, {"type": "R", "before": ", miRNAs primarily", "after": "miRNAs primarily and mechanistically target and", "start_char_pos": 549, "end_char_pos": 567}, {"type": "R", "before": "while they inhibit metabolism in the differential state. Interestingly, in the pluripotent state,", "after": ", but surprisingly", "start_char_pos": 600, "end_char_pos": 697}, {"type": "R", "before": "regulate", "after": "target", "start_char_pos": 721, "end_char_pos": 729}, {"type": "R", "before": "activities but", "after": "factors but only", "start_char_pos": 751, "end_char_pos": 765}, {"type": "R", "before": "the pluripotency; however in the differential state, miRNAs", "after": "pluripotency. During differentiation miRNAs mechanistically inhibit metabolism and", "start_char_pos": 816, "end_char_pos": 875}, {"type": "R", "before": "Mechanically", "after": "Interestingly", "start_char_pos": 911, "end_char_pos": 923}, {"type": "R", "before": "but only", "after": "and mechanistically", "start_char_pos": 1078, "end_char_pos": 1086}, {"type": "R", "before": "in the pluripotent state; while in the developmental state miRNAs directly suppress both metabolism and pluripotency", "after": "to help stem cells maintain pluripotency; yet miRNAs directly repress both pluripotency and metabolism to facilitate cell differentiation", "start_char_pos": 1128, "end_char_pos": 1244}], "sents_char_pos": [0, 165, 393, 528, 656, 833, 910, 995, 1153]} {"doc_id": "1212.1638", "revision_depth": "1", "before_revision": "In this paper, we focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in fourth generation (4G) OFDM-based cellular networks. Our goal is to design efficient scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity. While a recently developed scheduling policy, called Delay Weighted Matching (DWM) , has been shown to be \\log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay-optimal (in the many-channel many-user asymptotic regime) and throughput-optimal (in general non-asymptotic setting), it has a high complexity O(n^5), which makes it impractical for modern OFDM systems . To address this issue, we first develop a simple greedy policy called Delay-based Queue-Side-Greedy (D-QSG ) with a lower complexity O(n ^3 ), and rigorously prove that D-QSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance. Specifically, the rate-function attained by D-QSG for any fixed integer threshold b>0, is no smaller than the maximum achievable rate-function by any scheduling policy for threshold b-1. Further, we develop another simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with an even lower complexity O(n^2), and show that D-SSG achieves the same performance as D-QSG. Thus, we are able to achieve a dramatic reduction in complexity (from O(n ^5) of DWM \\log n) of the hybrid policies } to O(n^2)) with a minimal drop in the delay performance. Finally, we conduct numerical simulations to validate our theoretical results in various scenarios. The simulation results show that our proposed greedy policies not only guarantee a near-optimal rate-function, but also empirically are virtually indistinguishable from the delay-optimal policy DWM .", "after_revision": "In this paper, we focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in fourth generation (4G) OFDM-based cellular networks. Our goal is to design practical scheduling policies that can achieve provably good performance in terms of both throughput and delay, at a low complexity. While a class of O(n^{2.5 \\log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay optimality (in the many-channel many-user asymptotic regime) and throughput optimality (in general non-asymptotic setting), their practical complexity is typically high . To address this issue, we develop a simple greedy policy called Delay-based Server-Side-Greedy (D-SSG ) with a lower complexity O(n ^2 ), and rigorously prove that D-SSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance. Specifically, the rate-function attained by D-SSG for any fixed integer threshold b>0, is no smaller than the maximum achievable rate-function by any scheduling policy for threshold b-1. Thus, we are able to achieve a reduction in complexity (from O(n ^{2.5 \\log n) of the hybrid policies } to O(n^2)) with a minimal drop in the delay performance. More importantly, in practice, D-SSG generally has a substantially lower complexity than the hybrid policies that typically have a large constant factor hidden in the O(\\cdot) notation. Finally, we conduct numerical simulations to validate our theoretical results in various scenarios. The simulation results show that D-SSG not only guarantees a near-optimal rate-function, but also empirically is virtually indistinguishable from delay-optimal policies .", "edit_actions": [{"type": "R", "before": "efficient", "after": "practical", "start_char_pos": 200, "end_char_pos": 209}, {"type": "R", "before": "recently developed scheduling policy, called Delay Weighted Matching (DWM) , has been shown to be", "after": "class of O(n^{2.5", "start_char_pos": 341, "end_char_pos": 438}, {"type": "R", "before": "delay-optimal", "after": "delay optimality", "start_char_pos": 542, "end_char_pos": 555}, {"type": "R", "before": "throughput-optimal", "after": "throughput optimality", "start_char_pos": 610, "end_char_pos": 628}, {"type": "R", "before": "it has a high complexity O(n^5), which makes it impractical for modern OFDM systems", "after": "their practical complexity is typically high", "start_char_pos": 666, "end_char_pos": 749}, {"type": "D", "before": "first", "after": null, "start_char_pos": 778, "end_char_pos": 783}, {"type": "R", "before": "Queue-Side-Greedy (D-QSG", "after": "Server-Side-Greedy (D-SSG", "start_char_pos": 834, "end_char_pos": 858}, {"type": "R", "before": "^3", "after": "^2", "start_char_pos": 889, "end_char_pos": 891}, {"type": "R", "before": "D-QSG", "after": "D-SSG", "start_char_pos": 921, "end_char_pos": 926}, {"type": "R", "before": "D-QSG", "after": "D-SSG", "start_char_pos": 1084, "end_char_pos": 1089}, {"type": "D", "before": "Further, we develop another simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with an even lower complexity O(n^2), and show that D-SSG achieves the same performance as D-QSG.", "after": null, "start_char_pos": 1227, "end_char_pos": 1419}, {"type": "D", "before": "dramatic", "after": null, "start_char_pos": 1451, "end_char_pos": 1459}, {"type": "R", "before": "^5) of DWM", "after": "^{2.5", "start_char_pos": 1494, "end_char_pos": 1504}, {"type": "A", "before": null, "after": "More importantly, in practice, D-SSG generally has a substantially lower complexity than the hybrid policies that typically have a large constant factor hidden in the O(\\cdot) notation.", "start_char_pos": 1595, "end_char_pos": 1595}, {"type": "R", "before": "our proposed greedy policies not only guarantee", "after": "D-SSG not only guarantees", "start_char_pos": 1729, "end_char_pos": 1776}, {"type": "R", "before": "are", "after": "is", "start_char_pos": 1828, "end_char_pos": 1831}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1865, "end_char_pos": 1868}, {"type": "R", "before": "policy DWM", "after": "policies", "start_char_pos": 1883, "end_char_pos": 1893}], "sents_char_pos": [0, 177, 332, 751, 1039, 1226, 1594, 1695]} {"doc_id": "1302.2063", "revision_depth": "1", "before_revision": "The financial crisis marked a paradigm shift, from traditional studies of individual risk to recent research on the \"systemicrisk\" generated by whole networks of institutions. However, the reverse effects of realized defaults on network topology are poorly understood. Here we analyze the Dutch interbank network over the period 1998-2008, ending with the global crisis. We find that many topological properties, after controlling for overall densityeffects, display an abrupt change in 2008, thus providing a clear but unpredictable signature of the crisis. By contrast, if the intrinsic heterogeneity of banks is controlled for, the same properties undergo a slow and continuous transition , gradually connecting the crisisperiod to a much earlier stationary phase. This early-warning signal begins in 2005 , and is preceded by an even earlier period of \"risk autocatalysis\" characterized by anomalous debt loops . These remarkable precursors are undetectable if the network is reconstructed from partial bank-specific information .", "after_revision": "The financial crisis clearly illustrated the importance of characterizing the level of `systemic' risk associated with an entire credit network, rather than with single institutions. However, the interplay between financial distress and topological changes is still poorly understood. Here we analyze the quarterly interbank exposures among Dutch banks over the period 1998-2008, ending with the crisis. After controlling for the link density, many topological properties display an abrupt change in 2008, providing a clear - but unpredictable - signature of the crisis. By contrast, if the heterogeneity of banks ' connectivity is controlled for, the same properties show a gradual transition to the crisis, starting in 2005 and preceded by an even earlier period during which anomalous debt loops presumably favored the underestimation of counter-party risk. These early-warning signals are undetectable if the network is reconstructed from partial bank-specific data, as routinely done. We discuss important implications for bank regulatory policies .", "edit_actions": [{"type": "R", "before": "marked a paradigm shift, from traditional studies of individual risk to recent research on the \"systemicrisk\" generated by whole networks of", "after": "clearly illustrated the importance of characterizing the level of `systemic' risk associated with an entire credit network, rather than with single", "start_char_pos": 21, "end_char_pos": 161}, {"type": "R", "before": "reverse effects of realized defaults on network topology are", "after": "interplay between financial distress and topological changes is still", "start_char_pos": 189, "end_char_pos": 249}, {"type": "R", "before": "Dutch interbank network", "after": "quarterly interbank exposures among Dutch banks", "start_char_pos": 289, "end_char_pos": 312}, {"type": "R", "before": "global crisis. We find that many topological properties, after controlling for overall densityeffects,", "after": "crisis. After controlling for the link density, many topological properties", "start_char_pos": 356, "end_char_pos": 458}, {"type": "D", "before": "thus", "after": null, "start_char_pos": 493, "end_char_pos": 497}, {"type": "R", "before": "but unpredictable", "after": "- but unpredictable -", "start_char_pos": 516, "end_char_pos": 533}, {"type": "D", "before": "intrinsic", "after": null, "start_char_pos": 579, "end_char_pos": 588}, {"type": "A", "before": null, "after": "' connectivity", "start_char_pos": 612, "end_char_pos": 612}, {"type": "R", "before": "undergo a slow and continuous transition , gradually connecting the crisisperiod to a much earlier stationary phase. This early-warning signal begins", "after": "show a gradual transition to the crisis, starting", "start_char_pos": 652, "end_char_pos": 801}, {"type": "R", "before": ", and is", "after": "and", "start_char_pos": 810, "end_char_pos": 818}, {"type": "R", "before": "of \"risk autocatalysis\" characterized by", "after": "during which", "start_char_pos": 854, "end_char_pos": 894}, {"type": "R", "before": ". These remarkable precursors", "after": "presumably favored the underestimation of counter-party risk. These early-warning signals", "start_char_pos": 916, "end_char_pos": 945}, {"type": "R", "before": "information", "after": "data, as routinely done. We discuss important implications for bank regulatory policies", "start_char_pos": 1022, "end_char_pos": 1033}], "sents_char_pos": [0, 175, 268, 370, 558, 768, 917]} {"doc_id": "1304.0368", "revision_depth": "1", "before_revision": "We propose an iterated Azema-Yor type embedding in the spirit of Azema and Yor, 1979%DIFDELCMD < ] %%% and Brown et al., 2001%DIFDELCMD < ] %%% for any given finite number n of probability measures which are in convex order and satisfy an additional technical assumption. In particular, our construction reproduces the stopping boundaries obtained in Madan and Yor , 2002 and Brown et al. , 2001a%DIFDELCMD < ]%%% . We demonstrate with a counterexample that our technical assumption is necessary and propose an extended embedding for n=3. As a by-product of our analysis we compute the law of the maximum at all the stopping times. This is used in our parallel work Henry-Labordere et al. , 2013 to establish extremal properties of our embedding and develop robust pricing and hedging of Lookback options given prices of call options with multiple intermediate maturities .", "after_revision": "We %DIFDELCMD < ] %%% %DIFDELCMD < ] %%% solve the n-marginal Skorokhod embedding problem for a continuous local martingale and a sequence of probability measures \\mu_1,...,\\mu_n which are in convex order and satisfy an additional technical assumption. Our construction is explicit and is a multiple marginal generalisation of the Azema and Yor (1979) solution. In particular, we recover the stopping boundaries obtained by Brown et al. (2001) and Madan and Yor ( 2002 %DIFDELCMD < ]%%% ). Our technical assumption is necessary for the explicit embedding, as demonstrated with a counterexample. We discuss extensions to the general case giving details when n=3. In our analysis we compute the law of the maximum at each of the n stopping times. This is used in Henry-Labordere et al. ( 2013 ) to show that the construction maximises the distribution of the maximum among all solutions to the n-marginal Skorokhod embedding problem. The result has direct implications for robust pricing and hedging of Lookback options .", "edit_actions": [{"type": "D", "before": "propose an iterated Azema-Yor type embedding in the spirit of", "after": null, "start_char_pos": 3, "end_char_pos": 64}, {"type": "D", "before": "Azema and Yor, 1979", "after": null, "start_char_pos": 65, "end_char_pos": 84}, {"type": "D", "before": "and", "after": null, "start_char_pos": 103, "end_char_pos": 106}, {"type": "D", "before": "Brown et al., 2001", "after": null, "start_char_pos": 107, "end_char_pos": 125}, {"type": "R", "before": "for any given finite number n", "after": "solve the n-marginal Skorokhod embedding problem for a continuous local martingale and a sequence", "start_char_pos": 144, "end_char_pos": 173}, {"type": "A", "before": null, "after": "\\mu_1,...,\\mu_n", "start_char_pos": 198, "end_char_pos": 198}, {"type": "A", "before": null, "after": "Our construction is explicit and is a multiple marginal generalisation of the Azema and Yor (1979) solution.", "start_char_pos": 273, "end_char_pos": 273}, {"type": "R", "before": "our construction reproduces", "after": "we recover", "start_char_pos": 289, "end_char_pos": 316}, {"type": "R", "before": "in", "after": "by Brown et al. (2001) and", "start_char_pos": 350, "end_char_pos": 352}, {"type": "R", "before": ",", "after": "(", "start_char_pos": 367, "end_char_pos": 368}, {"type": "D", "before": "and", "after": null, "start_char_pos": 374, "end_char_pos": 377}, {"type": "D", "before": "Brown et al. , 2001a", "after": null, "start_char_pos": 378, "end_char_pos": 398}, {"type": "R", "before": ". We demonstrate with a counterexample that our", "after": "). Our", "start_char_pos": 416, "end_char_pos": 463}, {"type": "R", "before": "and propose an extended embedding for", "after": "for the explicit embedding, as demonstrated with a counterexample. We discuss extensions to the general case giving details when", "start_char_pos": 498, "end_char_pos": 535}, {"type": "R", "before": "As a by-product of", "after": "In", "start_char_pos": 541, "end_char_pos": 559}, {"type": "R", "before": "all the", "after": "each of the n", "start_char_pos": 610, "end_char_pos": 617}, {"type": "D", "before": "our parallel work", "after": null, "start_char_pos": 650, "end_char_pos": 667}, {"type": "R", "before": ",", "after": "(", "start_char_pos": 691, "end_char_pos": 692}, {"type": "R", "before": "to establish extremal properties of our embedding and develop", "after": ") to show that the construction maximises the distribution of the maximum among all solutions to the n-marginal Skorokhod embedding problem. The result has direct implications for", "start_char_pos": 698, "end_char_pos": 759}, {"type": "D", "before": "given prices of call options with multiple intermediate maturities", "after": null, "start_char_pos": 807, "end_char_pos": 873}], "sents_char_pos": [0, 272, 540, 633]} {"doc_id": "1304.3962", "revision_depth": "1", "before_revision": "Stochastic modeling and simulation provide powerful predictive methods for the intrinsic understanding of fundamental mechanisms in complex biochemical networks. Typically such mathematical models involve networks of coupled jump stochastic processes with a large number of parameters that need to be suitably calibrated against experimental data. In this direction, the sensitivity analysis of the reaction network's parameters is a crucial mathematical and computational tool since it allows to infer information about the robustness and the identifiability of the model 's parameters. We develop a sensitivity analysis methodology suitable for complex stochastic reaction networks with a high number of parameters. The proposed approach is based on Information Theory and relies on the quantification of information loss due to parameter perturbations between time-series distributions , hence referred to as \"pathwise\". This is achieved by employing the rigorously-derived Relative Entropy Rate (RER), which is directly computable from the propensity functions. A key aspect of the method is that an associated pathwise Fisher Information Matrix (FIM) is defined, which in turn constitutes a gradient-free approach to quantify the parameter sensitivities. The study of the structure of the FIM which turns out to be block-diagonal reveals hidden parameter dependencies and sensitivities in reaction networks . The proposed method is tested and validated on two biochemical systems, namely: (a) the p53 reaction network where quasi-steady stochastic oscillations of the concentrations are observed and (b) an Epidermal Growth Factor Receptor (EGFR) model which is an example of a high-dimensional stochastic reaction network with more than 200 reactions and a corresponding number of parameters .", "after_revision": "Stochastic modeling and simulation provide powerful predictive methods for the intrinsic understanding of fundamental mechanisms in complex biochemical networks. Typically , such mathematical models involve networks of coupled jump stochastic processes with a large number of parameters that need to be suitably calibrated against experimental data. In this direction, the parameter sensitivity analysis of reaction networks is an essential mathematical and computational tool , yielding information regarding the robustness and the identifiability of model parameters. However, existing sensitivity analysis approaches such as variants of the finite difference method can have an overwhelming computational cost in models with a high-dimensional parameter space. We develop a sensitivity analysis methodology suitable for complex stochastic reaction networks with a large number of parameters. The proposed approach is based on Information Theory methods and relies on the quantification of information loss due to parameter perturbations between time-series distributions . For this reason, we need to work on path-space, i.e., the set consisting of all stochastic trajectories, hence the proposed approach is referred to as \"pathwise\". The pathwise sensitivity analysis method is realized by employing the rigorously-derived Relative Entropy Rate (RER), which is directly computable from the propensity functions. A key aspect of the method is that an associated pathwise Fisher Information Matrix (FIM) is defined, which in turn constitutes a gradient-free approach to quantifying parameter sensitivities. The structure of the FIM turns out to be block-diagonal , revealing hidden parameter dependencies and sensitivities in reaction networks .", "edit_actions": [{"type": "A", "before": null, "after": ",", "start_char_pos": 172, "end_char_pos": 172}, {"type": "A", "before": null, "after": "parameter", "start_char_pos": 372, "end_char_pos": 372}, {"type": "R", "before": "the reaction network's parameters is a crucial", "after": "reaction networks is an essential", "start_char_pos": 397, "end_char_pos": 443}, {"type": "R", "before": "since it allows to infer information about", "after": ", yielding information regarding", "start_char_pos": 480, "end_char_pos": 522}, {"type": "R", "before": "the model 's parameters.", "after": "model parameters. However, existing sensitivity analysis approaches such as variants of the finite difference method can have an overwhelming computational cost in models with a high-dimensional parameter space.", "start_char_pos": 565, "end_char_pos": 589}, {"type": "R", "before": "high", "after": "large", "start_char_pos": 693, "end_char_pos": 697}, {"type": "A", "before": null, "after": "methods", "start_char_pos": 773, "end_char_pos": 773}, {"type": "R", "before": ", hence", "after": ". For this reason, we need to work on path-space, i.e., the set consisting of all stochastic trajectories, hence the proposed approach is", "start_char_pos": 892, "end_char_pos": 899}, {"type": "R", "before": "This is achieved", "after": "The pathwise sensitivity analysis method is realized", "start_char_pos": 927, "end_char_pos": 943}, {"type": "R", "before": "quantify the", "after": "quantifying", "start_char_pos": 1225, "end_char_pos": 1237}, {"type": "D", "before": "study of the", "after": null, "start_char_pos": 1267, "end_char_pos": 1279}, {"type": "D", "before": "which", "after": null, "start_char_pos": 1301, "end_char_pos": 1306}, {"type": "R", "before": "reveals", "after": ", revealing", "start_char_pos": 1338, "end_char_pos": 1345}, {"type": "D", "before": ". The proposed method is tested and validated on two biochemical systems, namely: (a) the p53 reaction network where quasi-steady stochastic oscillations of the concentrations are observed and (b) an Epidermal Growth Factor Receptor (EGFR) model which is an example of a high-dimensional stochastic reaction network with more than 200 reactions and a corresponding number of parameters", "after": null, "start_char_pos": 1415, "end_char_pos": 1800}], "sents_char_pos": [0, 161, 348, 589, 719, 926, 1068, 1262, 1416]} {"doc_id": "1304.4929", "revision_depth": "1", "before_revision": "The embedding of the stock price return modeling problem in Le Cam's statistical experiments framework suggests strategies-probabilities, obtained from the traded stock prices in the time interval t0,T%DIFDELCMD < ]%%% , for the agent selling the stock 's European call option at t_0 and for the buyer who may exercise it at T . The nature of these probabilities is justified by the slight dependence of stock returns and the weak Efficient Market Hypothesis (Fama,1965) . When the transaction times are dense in [ t0 ,T] it is shown, with mild conditions, that under each of these probabilities log S_T/S_{t_0 divisible distribution and in particular normal distribution for \"calm\" stock ; S_t is the stock 's price at time t. The price of the stock's European option is the expected cost of the agent at t_0 obtained using the distribution of log S_T/S _{t_0 }. For calm stock, the price coincides with the Black-Scholes-Merton (B-S-M)price after translation. The strike price determined by the agent does not give arbitrage opportunity to the buyer. Additional results clarify volatility's role in the buyer's behavior and establish a connection between European option pricing and Bayes risk. The results justify the extensive use of the B-S-M price and provide traders with a new tool .", "after_revision": "A new method is proposed to obtain the risk neutral probability of share prices without stochastic calculus and price modeling, via an embedding of the price return modeling problem in Le Cam's statistical experiments framework %DIFDELCMD < ]%%% . Strategies-probabilities P_{t_0,n 's European call option at time t_0 and for the buyer who may exercise it in the future, at T; \\ n increases with the number of share's transactions in t_0, T . When the transaction times are dense in [ t_0 ,T] it is shown, with mild conditions, that under each of these probabilities \\log \\frac{S_T divisible distribution and in particular normal distribution for \"calm\" share ; S_t is the share 's price at time t. The price of the share's call is the limit of the expected values of the call's payoff under the translated P _{t_0 ,n }. It coincides for \"calm\" share prices with the Black-Scholes-Merton formula with variance not necessarily proportional to (T-t_0), thus confirming formula's universal validity without model assumptions. Additional results clarify volatility's role in the transaction and the behaviors of the trader and the buyer. Traders may use the pricing formulae after estimation of the unknown parameters .", "edit_actions": [{"type": "R", "before": "The", "after": "A new method is proposed to obtain the risk neutral probability of share prices without stochastic calculus and price modeling, via an", "start_char_pos": 0, "end_char_pos": 3}, {"type": "D", "before": "stock", "after": null, "start_char_pos": 21, "end_char_pos": 26}, {"type": "D", "before": "suggests strategies-probabilities, obtained from the traded stock prices in the time interval", "after": null, "start_char_pos": 103, "end_char_pos": 196}, {"type": "D", "before": "t0,T", "after": null, "start_char_pos": 197, "end_char_pos": 201}, {"type": "R", "before": ", for the agent selling the stock", "after": ". Strategies-probabilities P_{t_0,n", "start_char_pos": 219, "end_char_pos": 252}, {"type": "A", "before": null, "after": "time", "start_char_pos": 280, "end_char_pos": 280}, {"type": "R", "before": "at", "after": "in the future, at T; \\ n increases with the number of share's transactions in", "start_char_pos": 323, "end_char_pos": 325}, {"type": "A", "before": null, "after": "t_0,", "start_char_pos": 326, "end_char_pos": 326}, {"type": "D", "before": ". The nature of these probabilities is justified by the slight dependence of stock returns and the weak Efficient Market Hypothesis (Fama,1965)", "after": null, "start_char_pos": 329, "end_char_pos": 472}, {"type": "R", "before": "t0", "after": "t_0", "start_char_pos": 517, "end_char_pos": 519}, {"type": "R", "before": "log S_T/S_{t_0", "after": "\\log \\frac{S_T", "start_char_pos": 598, "end_char_pos": 612}, {"type": "R", "before": "stock", "after": "share", "start_char_pos": 685, "end_char_pos": 690}, {"type": "R", "before": "stock", "after": "share", "start_char_pos": 704, "end_char_pos": 709}, {"type": "R", "before": "stock's European option is the expected cost of the agent at t_0 obtained using the distribution of log S_T/S", "after": "share's call is the limit of the expected values of the call's payoff under the translated P", "start_char_pos": 747, "end_char_pos": 856}, {"type": "A", "before": null, "after": ",n", "start_char_pos": 863, "end_char_pos": 863}, {"type": "R", "before": "For calm stock, the price coincides", "after": "It coincides for \"calm\" share prices", "start_char_pos": 867, "end_char_pos": 902}, {"type": "R", "before": "(B-S-M)price after translation. The strike price determined by the agent does not give arbitrage opportunity to the buyer.", "after": "formula with variance not necessarily proportional to (T-t_0), thus confirming formula's universal validity without model assumptions.", "start_char_pos": 933, "end_char_pos": 1055}, {"type": "R", "before": "buyer's behavior and establish a connection between European option pricing and Bayes risk. The results justify the extensive use of", "after": "transaction and the behaviors of the trader and", "start_char_pos": 1108, "end_char_pos": 1240}, {"type": "R", "before": "B-S-M price and provide traders with a new tool", "after": "buyer. Traders may use the pricing formulae after estimation of the unknown parameters", "start_char_pos": 1245, "end_char_pos": 1292}], "sents_char_pos": [0, 330, 474, 692, 729, 964, 1055, 1199]} {"doc_id": "1307.2035", "revision_depth": "2", "before_revision": "We introduce a new solution concept for selecting optimal strategies in strategic form games which we call periodic strategies and the solution concept periodicity. As we will explicitly demonstrate, the periodicity solution concept has implications for non-trivial realistic games, which renders this solution concept very valuable. The most striking application of periodicity is that in mixed strategy strategic form games, we were able to find solutions that result to values for the utility function of each player , that are equal to the Nash equilibrium ones , with the difference that in the Nash strategiesplaying, the payoffs strongly depend on what the opponent plays, while in the periodic strategies case, the payoffs of each player are completely robust against what the opponent plays. We formally define and study periodic strategies in two player perfect information strategic form games , with pure strategies and generalize the results to include multiplayer games with perfect information. We prove that every non-trivial finite game has at least one periodic strategy, with non-trivial meaning a game with non-degenerate payoffs. In principle the algorithm we provide, holds true for every non-trivial game, because in degenerate games, inconsistencies can occur. In addition, we also address the incomplete information games in the context of Bayesian games, in which case generalizations of Bernheim's rationalizability offers us the possibility to embed the periodicity concept in the Bayesian games framework. Applying the algorithm of periodic strategies in the case where mixed strategies are used, we find some very interesting outcomes with useful quantitative features for some classes of games .", "after_revision": "We introduce a new solution concept , called periodicity, for selecting optimal strategies in strategic form games . This periodicity solution concept yields new insight into non-trivial games. In mixed strategy strategic form games, periodic solutions yield values for the utility function of each player that are equal to the Nash equilibrium ones . In contrast to the Nash strategies, here the payoffs of each player are robust against what the opponent plays. Sometimes, periodicity strategies yield higher utilities, and sometimes the Nash strategies do, but often the utilities of these two strategies coincide. We formally define and study periodic strategies in two player perfect information strategic form games with pure strategies and we prove that every non-trivial finite game has at least one periodic strategy, with non-trivial meaning non-degenerate payoffs. In some classes of games where mixed strategies are used, we identify quantitative features. Particularly interesting are the implications for collective action games, since there the collective action strategy can be incorporated in a purely non-cooperative context. Moreover, we address the periodicity issue when the players have a continuum set of strategies available .", "edit_actions": [{"type": "A", "before": null, "after": ", called periodicity,", "start_char_pos": 36, "end_char_pos": 36}, {"type": "R", "before": "which we call periodic strategies and the solution concept periodicity. As we will explicitly demonstrate, the", "after": ". This", "start_char_pos": 94, "end_char_pos": 204}, {"type": "R", "before": "has implications for", "after": "yields new insight into", "start_char_pos": 234, "end_char_pos": 254}, {"type": "R", "before": "realistic games, which renders this solution concept very valuable. The most striking application of periodicity is that in", "after": "games. In", "start_char_pos": 267, "end_char_pos": 390}, {"type": "R", "before": "we were able to find solutions that result to", "after": "periodic solutions yield", "start_char_pos": 428, "end_char_pos": 473}, {"type": "D", "before": ",", "after": null, "start_char_pos": 521, "end_char_pos": 522}, {"type": "R", "before": ", with the difference that in the Nash strategiesplaying, the payoffs strongly depend on what the opponent plays, while in the periodic strategies case, the payoffs", "after": ". In contrast to the Nash strategies, here the payoffs", "start_char_pos": 567, "end_char_pos": 731}, {"type": "D", "before": "completely", "after": null, "start_char_pos": 751, "end_char_pos": 761}, {"type": "A", "before": null, "after": "Sometimes, periodicity strategies yield higher utilities, and sometimes the Nash strategies do, but often the utilities of these two strategies coincide.", "start_char_pos": 802, "end_char_pos": 802}, {"type": "D", "before": ",", "after": null, "start_char_pos": 907, "end_char_pos": 908}, {"type": "R", "before": "generalize the results to include multiplayer games with perfect information. We", "after": "we", "start_char_pos": 934, "end_char_pos": 1014}, {"type": "D", "before": "a game with", "after": null, "start_char_pos": 1117, "end_char_pos": 1128}, {"type": "R", "before": "principle the algorithm we provide, holds true for every non-trivial game, because in degenerate games, inconsistencies can occur. In addition, we also address the incomplete information games in the context of Bayesian games, in which case generalizations of Bernheim's rationalizability offers us the possibility to embed the periodicity concept in the Bayesian games framework. Applying the algorithm of periodic strategies in the case where mixed strategies are used, we find some very interesting outcomes with useful quantitative features for some classes of games", "after": "some classes of games where mixed strategies are used, we identify quantitative features. Particularly interesting are the implications for collective action games, since there the collective action strategy can be incorporated in a purely non-cooperative context. Moreover, we address the periodicity issue when the players have a continuum set of strategies available", "start_char_pos": 1156, "end_char_pos": 1726}], "sents_char_pos": [0, 165, 334, 801, 1011, 1152, 1286, 1536]} {"doc_id": "1307.5319", "revision_depth": "1", "before_revision": "The aim of this work is to explore the possible types of phenomena that simple macroeconomic Agent-Based models (ABM) can reproduce. Our motivation is to understand the large macro-economic fluctuations observed in the \"Mark I\" ABM devised by D. Delli Gatti and collaborators. Our major finding is the existence of a first order (discontinuous) phase transition between a \"good economy\" where unemployment is low, and a \"bad economy\" where unemployment is high. We show that this transition is robust against many modifications of the model, and is induced by an asymmetry between the rate of hiring and the rate of firing of the firms. This asymmetry is induced , in Mark I, by the interest rate. As the interest rate increases, the firms become more and more reluctant to take further loans . The unemployment level remains small until a tipping point beyond which the economy suddenly collapses. If the parameters are such that the system is close to this transition, any small fluctuation is amplified as the system jumps between the two equilibria. We have also explored several natural extensions . One is to allow this hiring/firing propensity to depend on the financial fragility of firms . Quite interestingly, we find that in this case, the above transition survives but becomes second order. We also studied simple wage policies and confidence feedback effects, whereby higher unemployment increases the saving propensity of households. We observe several interesting effects, such as the appearance of acute endogenous crises, during which the unemployment rate shoots up before the economy recovers . We end the paper with general comments on the usefulness of ABMs to model macroeconomic phenomena, in particular in view of the time needed to reach a steady state .", "after_revision": "The aim of this work is to explore the possible types of phenomena that simple macroeconomic Agent-Based models (ABM) can reproduce. Our motivation is to understand the large macro-economic fluctuations observed in the \"Mark I\" ABM . Our central finding is the generic existence of a phase transition between a \"good economy\" where unemployment is low, and a \"bad economy\" where unemployment is high. We show that this transition is induced by an asymmetry between the rate of hiring and the rate of firing of the firms. This asymmetry is , in Mark I, due to the fact that as the interest rate increases, firms become more and more reluctant to take further loans and have to reduce their workforce . The unemployment level remains small until a tipping point , beyond which the economy suddenly collapses. If the parameters are such that the system is close to this transition, any small fluctuation is amplified as the system jumps between the two equilibria. We have explored several natural extensions of the model . One is to introduce a bankruptcy threshold, limiting the leverage of firms. This leads to a rich phase diagram with, in particular, a region where acute endogenous crises occur, during which the unemployment rate shoots up before the economy can recover. We allow the hiring/firing propensity to depend on the financial fragility of firms , and introduce simple wage update policies. This leads to inflation (in the \"good\" phase) or deflation (in the \"bad\" phase), but leaves the overall phase diagram of the model essentially unchanged. We have finally explored the effect of simple monetary policies that attempt to contain rising unemployment and defang crises . We end the paper with general comments on the usefulness of ABMs to model macroeconomic phenomena, in particular in view of the time needed to reach a steady state that raises the issue of ergodicity in these models .", "edit_actions": [{"type": "R", "before": "devised by D. Delli Gatti and collaborators. Our major", "after": ". Our central", "start_char_pos": 232, "end_char_pos": 286}, {"type": "A", "before": null, "after": "generic", "start_char_pos": 302, "end_char_pos": 302}, {"type": "D", "before": "first order (discontinuous)", "after": null, "start_char_pos": 318, "end_char_pos": 345}, {"type": "D", "before": "robust against many modifications of the model, and is", "after": null, "start_char_pos": 495, "end_char_pos": 549}, {"type": "D", "before": "induced", "after": null, "start_char_pos": 656, "end_char_pos": 663}, {"type": "R", "before": "by the interest rate. As", "after": "due to the fact that as", "start_char_pos": 677, "end_char_pos": 701}, {"type": "D", "before": "the", "after": null, "start_char_pos": 731, "end_char_pos": 734}, {"type": "A", "before": null, "after": "and have to reduce their workforce", "start_char_pos": 794, "end_char_pos": 794}, {"type": "A", "before": null, "after": ",", "start_char_pos": 856, "end_char_pos": 856}, {"type": "D", "before": "also", "after": null, "start_char_pos": 1065, "end_char_pos": 1069}, {"type": "A", "before": null, "after": "of the model", "start_char_pos": 1106, "end_char_pos": 1106}, {"type": "R", "before": "allow this", "after": "introduce a bankruptcy threshold, limiting the leverage of firms. This leads to a rich phase diagram with, in particular, a region where acute endogenous crises occur, during which the unemployment rate shoots up before the economy can recover. We allow the", "start_char_pos": 1119, "end_char_pos": 1129}, {"type": "R", "before": ". Quite interestingly, we find that in this case, the above transition survives but becomes second order. We also studied simple wage policies and confidence feedback effects, whereby higher unemployment increases the saving propensity of households. We observe several interesting effects, such as the appearance of acute endogenous crises, during which the unemployment rate shoots up before the economy recovers", "after": ", and introduce simple wage update policies. This leads to inflation (in the \"good\" phase) or deflation (in the \"bad\" phase), but leaves the overall phase diagram of the model essentially unchanged. We have finally explored the effect of simple monetary policies that attempt to contain rising unemployment and defang crises", "start_char_pos": 1201, "end_char_pos": 1615}, {"type": "A", "before": null, "after": "that raises the issue of ergodicity in these models", "start_char_pos": 1782, "end_char_pos": 1782}], "sents_char_pos": [0, 132, 276, 462, 637, 698, 796, 901, 1056, 1108, 1202, 1306, 1451, 1617]} {"doc_id": "1308.1449", "revision_depth": "1", "before_revision": "Living cells can sense their environment with high precision. Yet, the resources required for sensing with high precision is an open question. Here we address this question for both equilibrium and non-equilibrium systems. We find that in equilibrium systems the precision of sensing is fundamentally limited by the number of receptors; the signaling network that transmits the information from the receptors to the interior of the cell can never increase the precisionof sensing. We show that this limit arises from a fundamental trade-off between the removal of the extrinsic noise in the receptor state and the suppression of the intrinsic noise in the signaling network. We next prove that only non-equilibrium systems can lift this trade-off : They can integrate the receptor state over time while suppressing the intrinsic noise by using energy to store the receptor state into stable modification states of the readout molecules. We explicitly calculate the resources required for a canonical signaling motif, a push-pull network . We arrive at an analytical expression that shows that storing the state of the bound receptor over time requires at least one readout molecule to store the state and at least 4 kT of energy to store it reliably. Thus, each of the resources -- time, protein copy numbers, and energy -- limits sensing, and it is the limiting resource which places the fundamental limit on sensing .", "after_revision": "Living cells deploy many resources to sense their environments, including receptors, downstream signaling molecules, time and fuel. However, it is not known which resources fundamentally limit the precision of sensing, like weak links in a chain, and which can compensate each other, leading to trade-offs between them. We show by modeling that in equilibrium systems the precision is limited by the number of receptors; the downstream network can never increase precision. This limit arises from a trade-off between the removal of extrinsic noise in the receptor and intrinsic noise in the downstream network. Non-equilibrium systems can lift this trade-off by storing the receptor state over time in chemical modification states of downstream molecules. As we quantify for a push-pull network , this requires i) time and receptors; ii) downstream molecules; iii) energy (fuel turnover) to drive modification. These three resource classes cannot compensate each other, and it is the limiting class which sets the fundamental sensing limit. Within each class, trade-offs are possible. Energy allows a power-speed trade-off, while time can be traded against receptors .", "edit_actions": [{"type": "R", "before": "can sense their environment with high precision. Yet, the resources required for sensing with high precision is an open question. Here we address this question for both equilibrium and non-equilibrium systems. We find", "after": "deploy many resources to sense their environments, including receptors, downstream signaling molecules, time and fuel. However, it is not known which resources fundamentally limit the precision of sensing, like weak links in a chain, and which can compensate each other, leading to trade-offs between them. We show by modeling", "start_char_pos": 13, "end_char_pos": 230}, {"type": "R", "before": "of sensing is fundamentally", "after": "is", "start_char_pos": 273, "end_char_pos": 300}, {"type": "R", "before": "signaling network that transmits the information from the receptors to the interior of the cell", "after": "downstream network", "start_char_pos": 341, "end_char_pos": 436}, {"type": "R", "before": "the precisionof sensing. We show that this", "after": "precision. This", "start_char_pos": 456, "end_char_pos": 498}, {"type": "D", "before": "fundamental", "after": null, "start_char_pos": 519, "end_char_pos": 530}, {"type": "D", "before": "the", "after": null, "start_char_pos": 564, "end_char_pos": 567}, {"type": "R", "before": "state and the suppression of the", "after": "and", "start_char_pos": 600, "end_char_pos": 632}, {"type": "R", "before": "signaling network. We next prove that only non-equilibrium", "after": "downstream network. Non-equilibrium", "start_char_pos": 656, "end_char_pos": 714}, {"type": "R", "before": ": They can integrate", "after": "by storing", "start_char_pos": 747, "end_char_pos": 767}, {"type": "R", "before": "while suppressing the intrinsic noise by using energy to store the receptor state into stable", "after": "in chemical", "start_char_pos": 797, "end_char_pos": 890}, {"type": "R", "before": "the readout molecules. We explicitly calculate the resources required for a canonical signaling motif, a", "after": "downstream molecules. As we quantify for a", "start_char_pos": 914, "end_char_pos": 1018}, {"type": "R", "before": ". We arrive at an analytical expression that shows that storing the state of the bound receptor over time requires at least one readout molecule to store the state and at least 4 kT of energy to store it reliably. Thus, each of the resources -- time, protein copy numbers, and energy -- limits sensing, and", "after": ", this requires i) time and receptors; ii) downstream molecules; iii) energy (fuel turnover) to drive modification. These three resource classes cannot compensate each other, and", "start_char_pos": 1037, "end_char_pos": 1343}, {"type": "R", "before": "resource which places the fundamental limit on sensing", "after": "class which sets the fundamental sensing limit. Within each class, trade-offs are possible. Energy allows a power-speed trade-off, while time can be traded against receptors", "start_char_pos": 1363, "end_char_pos": 1417}], "sents_char_pos": [0, 61, 142, 222, 336, 480, 674, 936, 1038, 1250]} {"doc_id": "1308.6148", "revision_depth": "1", "before_revision": "We propose a modified algorithm - Multifractal Cross-Correlation Analysis (MFCCA) - that is able to consistently identify and quantify multifractal cross-correlations between two time series. Our motivation for introducing this algorithm is that the already existing methods like MF-DXA have serious limitations for most of the signals describing complex natural processes . The principal component of the related improvement is proper incorporation of the sign of fluctuations . We present a broad analysis of the model fractal stochastic processes as well as of the real-world signals and show that MFCCA is a robust tool and allows a reliable quantification of the cross-correlative structure of analyzed processes. We, in particular, analyze a relation between the generalized Hurst exponent and the MFCCA parameter \\lambda_q. This relation provides information about the character of potential multifractality in cross-correlations of the processes under study and thus enables selective insight into their dynamics . Using also an example of financial time series from the stock market we show that waiting times and price increments of the companies are multifractally cross-correlated but only for relatively large fluctuations, whereas the small ones could be considered mutually independent .", "after_revision": "We propose a novel algorithm - Multifractal Cross-Correlation Analysis (MFCCA) - that constitutes a consistent extension of the Detrended Cross-Correlation Analysis (DCCA) and is able to properly identify and quantify subtle characteristics of multifractal cross-correlations between two time series. Our motivation for introducing this algorithm is that the already existing methods like MF-DXA have at best serious limitations for most of the signals describing complex natural processes and often indicate multifractal cross-correlations when there are none . The principal component of the present extension is proper incorporation of the sign of fluctuations to their generalized moments. Furthermore, we present a broad analysis of the model fractal stochastic processes as well as of the real-world signals and show that MFCCA is a robust and selective tool at the same time, and therefore allows for a reliable quantification of the cross-correlative structure of analyzed processes. In particular, it allows one to identify the boundaries of the multifractal scaling and to analyze a relation between the generalized Hurst exponent and the multifractal scaling parameter \\lambda_q. This relation provides information about character of potential multifractality in cross-correlations and thus enables a deeper insight into dynamics of the analyzed processes than allowed by any other related method available so far. By using examples of time series from stock market, we show that financial fluctuations typically cross-correlate multifractally only for relatively large fluctuations, whereas small fluctuations remain mutually independent even at maximum of such cross-correlations. Finally, we indicate possible utility of MFCCA to study effects of the time-lagged cross-correlations .", "edit_actions": [{"type": "R", "before": "modified", "after": "novel", "start_char_pos": 13, "end_char_pos": 21}, {"type": "A", "before": null, "after": "constitutes a consistent extension of the Detrended Cross-Correlation Analysis (DCCA) and", "start_char_pos": 89, "end_char_pos": 89}, {"type": "R", "before": "consistently", "after": "properly", "start_char_pos": 101, "end_char_pos": 113}, {"type": "A", "before": null, "after": "subtle characteristics of", "start_char_pos": 136, "end_char_pos": 136}, {"type": "A", "before": null, "after": "at best", "start_char_pos": 294, "end_char_pos": 294}, {"type": "A", "before": null, "after": "and often indicate multifractal cross-correlations when there are none", "start_char_pos": 376, "end_char_pos": 376}, {"type": "R", "before": "related improvement", "after": "present extension", "start_char_pos": 410, "end_char_pos": 429}, {"type": "R", "before": ". We", "after": "to their generalized moments. Furthermore, we", "start_char_pos": 482, "end_char_pos": 486}, {"type": "R", "before": "tool and allows", "after": "and selective tool at the same time, and therefore allows for", "start_char_pos": 623, "end_char_pos": 638}, {"type": "R", "before": "We, in particular,", "after": "In particular, it allows one to identify the boundaries of the multifractal scaling and to", "start_char_pos": 723, "end_char_pos": 741}, {"type": "R", "before": "MFCCA", "after": "multifractal scaling", "start_char_pos": 808, "end_char_pos": 813}, {"type": "D", "before": "the", "after": null, "start_char_pos": 876, "end_char_pos": 879}, {"type": "D", "before": "of the processes under study", "after": null, "start_char_pos": 941, "end_char_pos": 969}, {"type": "R", "before": "selective insight into their dynamics . Using also an example of financial", "after": "a deeper insight into dynamics of the analyzed processes than allowed by any other related method available so far. By using examples of", "start_char_pos": 987, "end_char_pos": 1061}, {"type": "R", "before": "the stock market", "after": "stock market,", "start_char_pos": 1079, "end_char_pos": 1095}, {"type": "R", "before": "waiting times and price increments of the companies are multifractally cross-correlated but", "after": "financial fluctuations typically cross-correlate multifractally", "start_char_pos": 1109, "end_char_pos": 1200}, {"type": "R", "before": "the small ones could be considered mutually independent", "after": "small fluctuations remain mutually independent even at maximum of such cross-correlations. Finally, we indicate possible utility of MFCCA to study effects of the time-lagged cross-correlations", "start_char_pos": 1249, "end_char_pos": 1304}], "sents_char_pos": [0, 193, 378, 483, 722, 834]} {"doc_id": "1308.6256", "revision_depth": "1", "before_revision": "The target of this paper is consider to model the risky asset price in the Knightian uncertain financial market , and pricing the upper (bid) and lower (ask ) prices of the uncertain risk. The ] basic risky asset price model we construct here is drift uncertain and volatility uncertain , we describe such model by using general G-Brownian motion and call it as G-asset price system. We present the uncertain risk premium which is distributed with Max distributionN(%DIFDELCMD < [%%% \\underline{\\mu ,%DIFDELCMD < \\bar{\\mu}]%%% ,\\{0\\ closed form of bid and ask prices of the European contingent claim against risky asset with G-asset price system , and give the bid and ask prices are the viscosity solution to nonlinear HJB .Furthermore, we consider the main part of this paper, i.e., consider the risky asset on uncertain financial market with the price fluctuation as continuous path . We propose the G-conditional full support condition by using uncertain capacity, and the price path satisfying the G-conditional full support condition could be approximated by its G-consistent asset price system, and we derived that the bid and ask prices of the European contingent claim against such risky asset can be expressed by discounted of some conditional G-expectation of the claim. We give examples, such as G-Markovian processes and fractional G-Brownian , satisfying the G-conditional full support condition.", "after_revision": "The target of this paper is to consider model the risky asset price on the financial market under the Knightian uncertainty , and pricing the ask and bid prices of the uncertain risk. We use the nonlinear analysis tool, i.e., G-frame work 26], to construct the model of the risky asset price and bid-ask pricing for the European contingent claims under Knightian uncertain financial market. Firstly, we consider the basic risky asset price model on the uncertain financial market, which we construct here is the model with drift uncertain and volatility uncertain . We describe such model by using generalized G-Brownian motion and call it as G-asset price system. We present the uncertain risk premium which is %DIFDELCMD < [%%% \\underline{ %DIFDELCMD < \\bar{\\mu}]%%% uncertain and distributed with maximum distribution. We derive the closed form of bid-ask price of the European contingent claim against the underlying risky asset with G-asset price system as the discounted conditional G-expecation of the claim, and the bid and ask prices are the viscosity solutions to the nonlinear HJB equations .Furthermore, we consider the main part of this paper, i.e., consider the risky asset on the Knightian uncertain financial market with the price fluctuation shows as continuous trajectories . We propose the G-conditional full support condition by using uncertain capacity, and the risky asset price path satisfying the G-conditional full support condition could be approximated by its G-consistent asset price systems. We derive that the bid and ask prices of the European contingent claim against such risky asset under uncertain can be expressed by discounted of some conditional G-expectation of the claim. We give examples, such as G-Markovian processes and the geometric fractional G-Brownian motion 9 , satisfying the G-conditional full support condition.", "edit_actions": [{"type": "R", "before": "consider to", "after": "to consider", "start_char_pos": 28, "end_char_pos": 39}, {"type": "R", "before": "in the Knightian uncertain financial market", "after": "on the financial market under the Knightian uncertainty", "start_char_pos": 68, "end_char_pos": 111}, {"type": "R", "before": "upper (bid) and lower (ask )", "after": "ask and bid", "start_char_pos": 130, "end_char_pos": 158}, {"type": "R", "before": "The", "after": "We use the nonlinear analysis tool, i.e., G-frame work", "start_char_pos": 189, "end_char_pos": 192}, {"type": "A", "before": null, "after": "26", "start_char_pos": 193, "end_char_pos": 193}, {"type": "A", "before": null, "after": ", to construct the model of the risky asset price and bid-ask pricing for the European contingent claims under Knightian uncertain financial market. Firstly, we consider the", "start_char_pos": 194, "end_char_pos": 194}, {"type": "A", "before": null, "after": "on the uncertain financial market, which", "start_char_pos": 225, "end_char_pos": 225}, {"type": "A", "before": null, "after": "the model with", "start_char_pos": 247, "end_char_pos": 247}, {"type": "R", "before": ", we", "after": ". We", "start_char_pos": 289, "end_char_pos": 293}, {"type": "R", "before": "general", "after": "generalized", "start_char_pos": 323, "end_char_pos": 330}, {"type": "D", "before": "distributed with Max distributionN(", "after": null, "start_char_pos": 433, "end_char_pos": 468}, {"type": "D", "before": "\\mu", "after": null, "start_char_pos": 497, "end_char_pos": 500}, {"type": "D", "before": ",", "after": null, "start_char_pos": 501, "end_char_pos": 502}, {"type": "R", "before": ",\\{0\\", "after": "uncertain and distributed with maximum distribution. We derive the", "start_char_pos": 529, "end_char_pos": 534}, {"type": "R", "before": "bid and ask prices", "after": "bid-ask price", "start_char_pos": 550, "end_char_pos": 568}, {"type": "A", "before": null, "after": "the underlying", "start_char_pos": 610, "end_char_pos": 610}, {"type": "R", "before": ", and give", "after": "as the discounted conditional G-expecation of the claim, and", "start_char_pos": 649, "end_char_pos": 659}, {"type": "R", "before": "solution to nonlinear HJB", "after": "solutions to the nonlinear HJB equations", "start_char_pos": 701, "end_char_pos": 726}, {"type": "A", "before": null, "after": "the Knightian", "start_char_pos": 816, "end_char_pos": 816}, {"type": "R", "before": "as continuous path", "after": "shows as continuous trajectories", "start_char_pos": 871, "end_char_pos": 889}, {"type": "A", "before": null, "after": "risky asset", "start_char_pos": 981, "end_char_pos": 981}, {"type": "R", "before": "system, and we derived", "after": "systems. We derive", "start_char_pos": 1099, "end_char_pos": 1121}, {"type": "A", "before": null, "after": "under uncertain", "start_char_pos": 1208, "end_char_pos": 1208}, {"type": "A", "before": null, "after": "the geometric", "start_char_pos": 1340, "end_char_pos": 1340}, {"type": "A", "before": null, "after": "motion", "start_char_pos": 1363, "end_char_pos": 1363}, {"type": "A", "before": null, "after": "9", "start_char_pos": 1364, "end_char_pos": 1364}], "sents_char_pos": [0, 188, 385, 728, 891, 1287]} {"doc_id": "1310.4880", "revision_depth": "1", "before_revision": "Gait velocity has been consistently shown to be an important indicator and predictor of health status, especially in elderly populations. Gait velocity is often assessed clinically, but clinical assessments occur infrequently and thus do not allow optimal detection of key health changes when they occur. In this paper, we propose using the time it takes a person to move between rooms in their home - referred to as 'transition times' - estimated from passive infrared motion sensors installed in a patients own home to predict gait velocity. By using a support vector regression approach to model the relationship between transition times and observed gait velocities , we show that we can predict unobserved velocities accurately. In particular, we demonstrate that the proposed approach has an average error of 4 cm/sec using data collected over a 5 year period from 76 study participants monitored both in their own homes and within a clinical setting. The proposed method is simple and cost effective , and has advantages over competing approaches such as not requiring patients to wear a device or needing dedicated sensors to measure gait . Furthermore, this method provides substantially more frequent estimates of gait velocity than are provided by other approaches .", "after_revision": "Gait velocity has been consistently shown to be an important indicator and predictor of health status, especially in older adults. It is often assessed clinically, but the assessments occur infrequently and do not allow optimal detection of key health changes when they occur. In this paper, we show that the time gap between activations of a pair of Passive Infrared (PIR) motion sensors installed in the consecutively visited room pair carry rich latent information about a person's gait velocity. We name this time gap transition time and show that despite a six second refractory period of the PIR sensors, transition time can be used to obtain an accurate representation of gait velocity. Using a Support Vector Regression (SVR) approach to model the relationship between transition time and gait velocity , we show that gait velocity can be estimated with an average error less than 2.5 cm/sec . This is demonstrated with data collected over a 5 year period from 74 older adults monitored in their own homes . This method is simple and cost effective and has advantages over competing approaches such as : obtaining 20 to 100x more gait velocity measurements per day and offering the fusion of location-specific information with time stamped gait estimates. These advantages allow stable estimates of gait parameters (maximum or average speed, variability) at shorter time scales than current approaches. This also provides a pervasive in-home method for context-aware gait velocity sensing that allows for monitoring of gait trajectories in space and time .", "edit_actions": [{"type": "R", "before": "elderly populations. Gait velocity", "after": "older adults. It", "start_char_pos": 117, "end_char_pos": 151}, {"type": "R", "before": "clinical", "after": "the", "start_char_pos": 186, "end_char_pos": 194}, {"type": "D", "before": "thus", "after": null, "start_char_pos": 230, "end_char_pos": 234}, {"type": "R", "before": "propose using the time it takes a person to move between rooms in their home - referred to as 'transition times' - estimated from passive infrared", "after": "show that the time gap between activations of a pair of Passive Infrared (PIR)", "start_char_pos": 323, "end_char_pos": 469}, {"type": "R", "before": "a patients own home to predict", "after": "the consecutively visited room pair carry rich latent information about a person's gait velocity. We name this time gap transition time and show that despite a six second refractory period of the PIR sensors, transition time can be used to obtain an accurate representation of", "start_char_pos": 498, "end_char_pos": 528}, {"type": "R", "before": "By using a support vector regression", "after": "Using a Support Vector Regression (SVR)", "start_char_pos": 544, "end_char_pos": 580}, {"type": "R", "before": "times and observed gait velocities", "after": "time and gait velocity", "start_char_pos": 635, "end_char_pos": 669}, {"type": "R", "before": "we can predict unobserved velocities accurately. In particular, we demonstrate that the proposed approach has", "after": "gait velocity can be estimated with", "start_char_pos": 685, "end_char_pos": 794}, {"type": "R", "before": "of 4", "after": "less than 2.5", "start_char_pos": 812, "end_char_pos": 816}, {"type": "R", "before": "using", "after": ". This is demonstrated with", "start_char_pos": 824, "end_char_pos": 829}, {"type": "R", "before": "76 study participants monitored both", "after": "74 older adults monitored", "start_char_pos": 871, "end_char_pos": 907}, {"type": "R", "before": "and within a clinical setting. The proposed", "after": ". This", "start_char_pos": 927, "end_char_pos": 970}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1007, "end_char_pos": 1008}, {"type": "R", "before": "not requiring patients to wear a device or needing dedicated sensors to measure gait . Furthermore, this method provides substantially more frequent", "after": ": obtaining 20 to 100x more gait velocity measurements per day and offering the fusion of location-specific information with time stamped gait estimates. These advantages allow stable", "start_char_pos": 1062, "end_char_pos": 1210}, {"type": "R", "before": "velocity than are provided by other approaches", "after": "parameters (maximum or average speed, variability) at shorter time scales than current approaches. This also provides a pervasive in-home method for context-aware gait velocity sensing that allows for monitoring of gait trajectories in space and time", "start_char_pos": 1229, "end_char_pos": 1275}], "sents_char_pos": [0, 137, 304, 543, 733, 957, 1148]} {"doc_id": "1310.6873", "revision_depth": "2", "before_revision": "In the aftermath of the interbank market collapse of 2007-08, the scope of systemic risk research has broadened to encompass a wide range of channels , notably asset correlations, default contagion, illiquidity contagion, and asset firesales. In current models of systemic risk, two facets of contagion, namely funding illiquidity and insolvency , are treated as two distinct and separate phenomena. The main goal of the double cascade model we introduce is to integrate these two facets. In a default cascade, insolvency of a given bank will create a shock to the asset side of the balance sheet of each of its creditor banks . Under some circumstances, such \"downstream\" shocks can cause further insolvencies that may build up to create a global insolvency cascade. On the other hand, in a stress cascade, illiquidity that hits a given bank will create a shock to the liability side of the balance sheet of each of its debtor banks. Such \"upstream\" shocks can cause further illiquidity stresses that may build up to create a global illiquidity cascade. Our paper introduces a deliberately simplified network model of insolvency and illiquidity that can quantify how illiquidity or default of one bank influences the overall level of liquidity stress and default in the network. Under an assumption we call \"locally tree-like independence\", we derive large-network asymptotic cascade formulas. Results of numerical experiments then demonstrate that these asymptotic formulas agree qualitatively with Monte Carlo results for large finite networks, and quantitatively except when the system is placed in an exceptional \"knife-edge\" configuration. These experiments illustrate clearly our main conclusion that in financial networks , the average default probability is inversely related to strength of banks' stress response and therefore to the overall level of stress in the network.", "after_revision": "The scope of financial systemic risk research encompasses a wide range of channels and effects, including asset correlation shocks , default contagion, illiquidity contagion, and asset firesales. For example, insolvency of a given bank will create a shock to the asset side of the balance sheet of each of its creditor banks and under some circumstances, such \"downstream\" shocks can cause further insolvencies that may build up to create what is called an insolvency or default cascade. On the other hand, funding illiquidity that hits a given bank will create a shock to the liability side of the balance sheet of each of its debtor banks. Under some circumstances, such \"upstream\" shocks can cause illiquidity in further banks that may build up to create an illiquidity cascade. This paper introduces a deliberately simplified financial network model that combines the default and liquidity stress mechanisms into a \"double cascade mapping\". The progress and eventual result of the crisis is obtained by iterating this mapping to its fixed point. Unlike simpler models, this model can therefore quantify how illiquidity or default of one bank influences the eventual overall level of liquidity stress and default in the system. Large-network asymptotic cascade mapping formulas are derived that can be used for efficient network computations of the double cascade. Numerical experiments then demonstrate that these asymptotic formulas agree qualitatively with Monte Carlo results for large finite networks, and quantitatively except when the initial system is placed in an exceptional \"knife-edge\" configuration. The experiments clearly support the main conclusion that in the absence of fire sales , the average eventual level of defaults in a financial network is negatively related to the strength of banks' liquidity stress response and the eventual level of stress in the network.", "edit_actions": [{"type": "R", "before": "In the aftermath of the interbank market collapse of 2007-08, the scope of", "after": "The scope of financial", "start_char_pos": 0, "end_char_pos": 74}, {"type": "R", "before": "has broadened to encompass", "after": "encompasses", "start_char_pos": 98, "end_char_pos": 124}, {"type": "A", "before": null, "after": "and effects, including asset correlation shocks", "start_char_pos": 150, "end_char_pos": 150}, {"type": "D", "before": "notably asset correlations,", "after": null, "start_char_pos": 153, "end_char_pos": 180}, {"type": "R", "before": "In current models of systemic risk, two facets of contagion, namely funding illiquidity and insolvency , are treated as two distinct and separate phenomena. The main goal of the double cascade model we introduce is to integrate these two facets. In a default cascade, insolvency of a", "after": "For example, insolvency of a", "start_char_pos": 244, "end_char_pos": 527}, {"type": "R", "before": ". Under", "after": "and under", "start_char_pos": 628, "end_char_pos": 635}, {"type": "R", "before": "a global insolvency", "after": "what is called an insolvency or default", "start_char_pos": 740, "end_char_pos": 759}, {"type": "R", "before": "in a stress cascade,", "after": "funding", "start_char_pos": 788, "end_char_pos": 808}, {"type": "R", "before": "Such", "after": "Under some circumstances, such", "start_char_pos": 936, "end_char_pos": 940}, {"type": "R", "before": "further illiquidity stresses", "after": "illiquidity in further banks", "start_char_pos": 969, "end_char_pos": 997}, {"type": "R", "before": "a global", "after": "an", "start_char_pos": 1026, "end_char_pos": 1034}, {"type": "R", "before": "Our", "after": "This", "start_char_pos": 1056, "end_char_pos": 1059}, {"type": "R", "before": "network model of insolvency and illiquidity that can", "after": "financial network model that combines the default and liquidity stress mechanisms into a \"double cascade mapping\". The progress and eventual result of the crisis is obtained by iterating this mapping to its fixed point. Unlike simpler models, this model can therefore", "start_char_pos": 1103, "end_char_pos": 1155}, {"type": "A", "before": null, "after": "eventual", "start_char_pos": 1219, "end_char_pos": 1219}, {"type": "R", "before": "network. Under an assumption we call \"locally tree-like independence\", we derive large-network asymptotic cascade formulas. Results of numerical", "after": "system. Large-network asymptotic cascade mapping formulas are derived that can be used for efficient network computations of the double cascade. Numerical", "start_char_pos": 1273, "end_char_pos": 1417}, {"type": "A", "before": null, "after": "initial", "start_char_pos": 1585, "end_char_pos": 1585}, {"type": "R", "before": "These experiments illustrate clearly our", "after": "The experiments clearly support the", "start_char_pos": 1649, "end_char_pos": 1689}, {"type": "R", "before": "financial networks", "after": "the absence of fire sales", "start_char_pos": 1714, "end_char_pos": 1732}, {"type": "R", "before": "default probability is inversely related to", "after": "eventual level of defaults in a financial network is negatively related to the", "start_char_pos": 1747, "end_char_pos": 1790}, {"type": "A", "before": null, "after": "liquidity", "start_char_pos": 1810, "end_char_pos": 1810}, {"type": "R", "before": "therefore to the overall", "after": "the eventual", "start_char_pos": 1831, "end_char_pos": 1855}], "sents_char_pos": [0, 243, 400, 489, 629, 768, 935, 1055, 1281, 1396, 1648]} {"doc_id": "1310.8341", "revision_depth": "1", "before_revision": "Gene regulatory networks are commonly used for modeling biological processes and revealing underlying molecular mechanisms. The reconstruction of gene regulatory networks from observational data is a challenging task, especially , considering the large number of involved players (e.g. genes) and much fewer biological replicates available for analysis. Herein, we proposed a new statistical method of estimating the number of erroneous edges that strongly enhances the commonly used inference approaches. This method is based on special relationship between correlation and causality, and allows to identify and to remove approximately half of erroneous edges. Using the mathematical model of Bayesian networks and positive correlation inequalities we established a mathematical foundation for our method. Analyzing real biological datasets, we found a strong correlation between the results of our method and the commonly used false discovery rate (FDR) technique. Furthermore, the simulation analysis demonstrates that in large networks , our new method provides a more precise estimation of the proportion of erroneous links than FDR.", "after_revision": "Gene regulatory networks are commonly used for modeling biological processes and revealing underlying molecular mechanisms. The reconstruction of gene regulatory networks from observational data is a challenging task, especially considering the large number of players (e.g. genes) involved and the small number of biological replicates available for analysis. Herein, we propose a new statistical method for estimating the number of erroneous edges in reconstructed networks that strongly enhances commonly used inference approaches. This method is based on a special relationship between correlation and causality, and allows for the identification and to removal of approximately half of all erroneous edges. Using the mathematical model of Bayesian networks and positive correlation inequalities we establish a mathematical foundation for our method. Analyzing existing biological datasets, we find a strong correlation between the results of our method and the commonly used false discovery rate (FDR) technique. Furthermore, simulation analysis demonstrates that with large networks our new method provides a more accurate estimate of network error than FDR.", "edit_actions": [{"type": "D", "before": ",", "after": null, "start_char_pos": 229, "end_char_pos": 230}, {"type": "D", "before": "involved", "after": null, "start_char_pos": 263, "end_char_pos": 271}, {"type": "R", "before": "and much fewer", "after": "involved and the small number of", "start_char_pos": 293, "end_char_pos": 307}, {"type": "R", "before": "proposed", "after": "propose", "start_char_pos": 365, "end_char_pos": 373}, {"type": "R", "before": "of", "after": "for", "start_char_pos": 399, "end_char_pos": 401}, {"type": "A", "before": null, "after": "in reconstructed networks", "start_char_pos": 443, "end_char_pos": 443}, {"type": "D", "before": "the", "after": null, "start_char_pos": 467, "end_char_pos": 470}, {"type": "A", "before": null, "after": "a", "start_char_pos": 531, "end_char_pos": 531}, {"type": "R", "before": "to identify and to remove", "after": "for the identification and to removal of", "start_char_pos": 599, "end_char_pos": 624}, {"type": "A", "before": null, "after": "all", "start_char_pos": 647, "end_char_pos": 647}, {"type": "R", "before": "established", "after": "establish", "start_char_pos": 756, "end_char_pos": 767}, {"type": "R", "before": "real", "after": "existing", "start_char_pos": 820, "end_char_pos": 824}, {"type": "R", "before": "found", "after": "find", "start_char_pos": 849, "end_char_pos": 854}, {"type": "D", "before": "the", "after": null, "start_char_pos": 983, "end_char_pos": 986}, {"type": "R", "before": "in large networks ,", "after": "with large networks", "start_char_pos": 1025, "end_char_pos": 1044}, {"type": "R", "before": "precise estimation of the proportion of erroneous links", "after": "accurate estimate of network error", "start_char_pos": 1076, "end_char_pos": 1131}], "sents_char_pos": [0, 123, 353, 506, 664, 809, 969]} {"doc_id": "1311.0050", "revision_depth": "1", "before_revision": "Transcription of genes by RNA polymerase molecules is the focus of most forms of regulation of gene expression. Even though careful biochemical experimentation has revealed the molecular mechanisms of transcriptional regulation for a number of different promoters in vitro, the question of how transcription is regulated in live cells is still poorly understood. Recently experimental methods have been developed for counting the number of nascent RNA molecules in a single cell for a gene of interest. Here we show theoretically that measurements of the cell-to-cell variability in the number of nascent RNAs can be used to test different mechanisms of transcription initiation. In particular, we derive exact expressions for the first two moments of the distribution of nascent RNA molecules for an arbitrary mechanism of transcription initiation. These theoretical results are applied to published data on the nascent RNA distributions obtained for a collection of constitutively expressed yeast genes. We find that the data is not consistent with a one-step mechanism of initiation , which has been generally assumed . Instead, a two-step mechanism of initiation with both steps of equal duration is consistent with the available data. These findings for the yeast promoters highlight the utility of our theory for deciphering transcriptional dynamics in vivo .", "after_revision": "Transcription of genes is the focus of most forms of regulation of gene expression. Even though careful biochemical experimentation has revealed the molecular mechanisms of transcription initiation for a number of different promoters in vitro, the dynamics of this process in cells is still poorly understood. One approach has been to measure the transcriptional output (fluorescently labeled messenger RNAs or proteins) from single cells in a genetically identical population, which could then be compared to predictions from models that incorporate different molecular mechanisms of transcription initiation. However, this approach suffers from the problem, that processes downstream from transcription can affect the measured output and therefore mask the signature of stochastic transcription initiation on the cell-to-cell variability of the transcriptional outputs. Here we show theoretically that measurements of the cell-to-cell variability in the number of nascent RNAs provide a more direct test of the mechanism of transcription initiation. We derive exact expressions for the first two moments of the distribution of nascent RNA molecules and apply our theory to published data for a collection of constitutively expressed yeast genes. We find that the measured nascent RNA distributions are inconsistent with transcription initiation proceeding via one rate-limiting step , which has been generally inferred from measurements of cytoplasmic messenger RNA . Instead, we propose a two-step mechanism of initiation , which is consistent with the available data. These findings for the yeast promoters highlight the utility of our theory for deciphering transcriptional dynamics in vivo from experiments that count nascent RNA molecules in single cells .", "edit_actions": [{"type": "D", "before": "by RNA polymerase molecules", "after": null, "start_char_pos": 23, "end_char_pos": 50}, {"type": "R", "before": "transcriptional regulation", "after": "transcription initiation", "start_char_pos": 201, "end_char_pos": 227}, {"type": "R", "before": "question of how transcription is regulated in live", "after": "dynamics of this process in", "start_char_pos": 278, "end_char_pos": 328}, {"type": "R", "before": "Recently experimental methods have been developed for counting the number of nascent RNA molecules in a single cell for a gene of interest.", "after": "One approach has been to measure the transcriptional output (fluorescently labeled messenger RNAs or proteins) from single cells in a genetically identical population, which could then be compared to predictions from models that incorporate different molecular mechanisms of transcription initiation. However, this approach suffers from the problem, that processes downstream from transcription can affect the measured output and therefore mask the signature of stochastic transcription initiation on the cell-to-cell variability of the transcriptional outputs.", "start_char_pos": 363, "end_char_pos": 502}, {"type": "R", "before": "can be used to test different mechanisms of", "after": "provide a more direct test of the mechanism of", "start_char_pos": 610, "end_char_pos": 653}, {"type": "R", "before": "In particular, we", "after": "We", "start_char_pos": 680, "end_char_pos": 697}, {"type": "R", "before": "for an arbitrary mechanism of transcription initiation. These theoretical results are applied", "after": "and apply our theory", "start_char_pos": 794, "end_char_pos": 887}, {"type": "D", "before": "on the nascent RNA distributions obtained", "after": null, "start_char_pos": 906, "end_char_pos": 947}, {"type": "R", "before": "data is not consistent with a one-step mechanism of initiation", "after": "measured nascent RNA distributions are inconsistent with transcription initiation proceeding via one rate-limiting step", "start_char_pos": 1023, "end_char_pos": 1085}, {"type": "R", "before": "assumed", "after": "inferred from measurements of cytoplasmic messenger RNA", "start_char_pos": 1113, "end_char_pos": 1120}, {"type": "A", "before": null, "after": "we propose", "start_char_pos": 1132, "end_char_pos": 1132}, {"type": "R", "before": "with both steps of equal duration", "after": ", which", "start_char_pos": 1168, "end_char_pos": 1201}, {"type": "A", "before": null, "after": "from experiments that count nascent RNA molecules in single cells", "start_char_pos": 1365, "end_char_pos": 1365}], "sents_char_pos": [0, 111, 362, 502, 679, 849, 1005, 1122, 1240]} {"doc_id": "1312.2988", "revision_depth": "3", "before_revision": "Protein contacts contain important information for protein structure and functional study, but contact prediction is very challengingespecially for protein families without many sequence homologs. Recently evolutionary coupling (EC) analysis , which predicts contactsby analyzing residue co-evolution in a single target family, has made good progress due to better statistical and optimization techniques . Different from these single-family EC methods that focus on only a single protein family, this paper presents a joint multi-family EC analysis method that predicts contacts of one target family by jointly modeling residue co-evolution in itself and also (distantly) related familieswith divergent sequences but similar folds , and enforcing their co-evolution pattern consistency based upon their evolutionary distance . To implement this multi-family EC analysisstrategy, this paper presents a novel joint graphical lasso method to model a set of related protein families . In particular, we model a set of related families using a set of correlated multivariate Gaussian distributions, the inverse covariance matrix (or precision matrix) of each distribution encoding the contact pattern of one family. Then we co-estimate the precision matrices by maximizing the occurring probability of all the involved sequences , subject to the constraint that the matrices shall share similar patterns . Finally we solve this optimization problem using Alternating Direction Method of Multipliers (ADMM). Experiments show that joint multi-family EC analysis can reveal many more native contacts than single-family analysis even for a target family with 4000-5000 non-redundant sequence homologs, which makes many more protein families amenable to co-evolution-based structure and function prediction .", "after_revision": "Protein contacts contain important information for protein structure and functional study, but contact prediction from sequence remains very challenging. Both evolutionary coupling (EC) analysis and supervised machine learning methods are developed to predict contacts, making use of different types of information, respectively. This paper presents a group graphical lasso (GGL) method for contact prediction that integrates joint multi-family EC analysis and supervised learning . Different from existing single-family EC analysis that uses residue co-evolution information in only the target protein family, our joint EC analysis uses residue co-evolution in both the target family and its related families, which may have divergent sequences but similar folds . To implement joint EC analysis, we model a set of related protein families using Gaussian graphical models (GGM) and then co-estimate their precision matrices by maximum-likelihood , subject to the constraint that the precision matrices shall share similar residue co-evolution patterns. To further improve the accuracy of the estimated precision matrices, we employ a supervised learning method to predict contact probability from a variety of evolutionary and non-evolutionary information and then incorporate the predicted probability as prior into our GGL framework . Experiments show that our method can predict contacts much more accurately than existing methods, and that our method performs better on both conserved and family-specific contacts .", "edit_actions": [{"type": "R", "before": "is very challengingespecially for protein families without many sequence homologs. Recently", "after": "from sequence remains very challenging. Both", "start_char_pos": 114, "end_char_pos": 205}, {"type": "R", "before": ", which predicts contactsby analyzing residue co-evolution in a single target family, has made good progress due to better statistical and optimization techniques", "after": "and supervised machine learning methods are developed to predict contacts, making use of different types of information, respectively. This paper presents a group graphical lasso (GGL) method for contact prediction that integrates joint multi-family EC analysis and supervised learning", "start_char_pos": 242, "end_char_pos": 404}, {"type": "R", "before": "these", "after": "existing", "start_char_pos": 422, "end_char_pos": 427}, {"type": "R", "before": "methods that focus on only a single", "after": "analysis that uses residue co-evolution information in only the target", "start_char_pos": 445, "end_char_pos": 480}, {"type": "R", "before": "this paper presents a joint multi-family EC analysis method that predicts contacts of one target family by jointly modeling", "after": "our joint EC analysis uses", "start_char_pos": 497, "end_char_pos": 620}, {"type": "R", "before": "itself and also (distantly) related familieswith", "after": "both the target family and its related families, which may have", "start_char_pos": 645, "end_char_pos": 693}, {"type": "D", "before": ", and enforcing their co-evolution pattern consistency based upon their evolutionary distance", "after": null, "start_char_pos": 732, "end_char_pos": 825}, {"type": "R", "before": "this multi-family EC analysisstrategy, this paper presents a novel joint graphical lasso method to", "after": "joint EC analysis, we", "start_char_pos": 841, "end_char_pos": 939}, {"type": "R", "before": ". In particular, we model a set of related families using a set of correlated multivariate Gaussian distributions, the inverse covariance matrix (or precision matrix) of each distribution encoding the contact pattern of one family. Then we", "after": "using Gaussian graphical models (GGM) and then", "start_char_pos": 980, "end_char_pos": 1219}, {"type": "R", "before": "the", "after": "their", "start_char_pos": 1232, "end_char_pos": 1235}, {"type": "R", "before": "maximizing the occurring probability of all the involved sequences", "after": "maximum-likelihood", "start_char_pos": 1258, "end_char_pos": 1324}, {"type": "A", "before": null, "after": "precision", "start_char_pos": 1362, "end_char_pos": 1362}, {"type": "R", "before": "patterns", "after": "residue co-evolution patterns. To further improve the accuracy of the estimated precision matrices, we employ a supervised learning method to predict contact probability from a variety of evolutionary and non-evolutionary information and then incorporate the predicted probability as prior into our GGL framework", "start_char_pos": 1392, "end_char_pos": 1400}, {"type": "D", "before": "Finally we solve this optimization problem using Alternating Direction Method of Multipliers (ADMM).", "after": null, "start_char_pos": 1403, "end_char_pos": 1503}, {"type": "R", "before": "joint multi-family EC analysis can reveal many more native contacts than single-family analysis even for a target family with 4000-5000 non-redundant sequence homologs, which makes many more protein families amenable to co-evolution-based structure and function prediction", "after": "our method can predict contacts much more accurately than existing methods, and that our method performs better on both conserved and family-specific contacts", "start_char_pos": 1526, "end_char_pos": 1798}], "sents_char_pos": [0, 196, 232, 672, 827, 981, 1211, 1402]} {"doc_id": "1312.7012", "revision_depth": "1", "before_revision": "X-ray crystallography is the predominant method for obtaining atomic-scale information about biological macromolecules. Despite the success of the technique, obtaining well diffracting crystals still critically limits going from protein to structure. Practically , the crystallization process mainly proceeds through knowledge-informed empiricism. Better physico-chemical assistance remains elusive because of the large number of variables involved ; little microscopic guidance is available to identify solution conditions that promote crystallization. To help determine relationships between macromolecular properties and their crystallization propensity, we train statistical models on samples for 182 proteins supplied by the Northeast Structural Genomics Consortium. Gaussian Processes , which capture trends beyond the reach of linear statistical models, help us distinguish between two main physico-chemical mechanisms driving crystallization. One is characterized by low levels of side chain entropy and is extensively reported in the literature. The other identifies specific electrostatic interactions , not previously described in the crystallization context. Because evidence for two distinct mechanisms can be gleaned both from crystal contacts and from precursor macromolecular solution conditions , the model offers avenues for optimizing crystallization screens based on partial structural information or even from primary sequence analyses . The availability of crystallization data coupled with structural outcomes analyzed through complex statistical models will guide macromolecular crystallization toward a more rational basis.", "after_revision": "X-ray crystallography is the predominant method for obtaining atomic-scale information about biological macromolecules. Despite the success of the technique, obtaining well diffracting crystals still critically limits going from protein to structure. In practice , the crystallization process proceeds through knowledge-informed empiricism. Better physico-chemical understanding remains elusive because of the large number of variables involved , hence little guidance is available to systematically identify solution conditions that promote crystallization. To help determine relationships between macromolecular properties and their crystallization propensity, we have trained statistical models on samples for 182 proteins supplied by the Northeast Structural Genomics consortium. Gaussian processes , which capture trends beyond the reach of linear statistical models, distinguish between two main physico-chemical mechanisms driving crystallization. One is characterized by low levels of side chain entropy and has been extensively reported in the literature. The other identifies specific electrostatic interactions not previously described in the crystallization context. Because evidence for two distinct mechanisms can be gleaned both from crystal contacts and from solution conditions leading to successful crystallization , the model offers future avenues for optimizing crystallization screens based on partial structural information . The availability of crystallization data coupled with structural outcomes analyzed through state-of-the-art statistical models may thus guide macromolecular crystallization toward a more rational basis.", "edit_actions": [{"type": "R", "before": "Practically", "after": "In practice", "start_char_pos": 251, "end_char_pos": 262}, {"type": "D", "before": "mainly", "after": null, "start_char_pos": 293, "end_char_pos": 299}, {"type": "R", "before": "assistance", "after": "understanding", "start_char_pos": 372, "end_char_pos": 382}, {"type": "R", "before": "; little microscopic", "after": ", hence little", "start_char_pos": 449, "end_char_pos": 469}, {"type": "A", "before": null, "after": "systematically", "start_char_pos": 495, "end_char_pos": 495}, {"type": "R", "before": "train", "after": "have trained", "start_char_pos": 662, "end_char_pos": 667}, {"type": "R", "before": "Consortium. Gaussian Processes", "after": "consortium. Gaussian processes", "start_char_pos": 761, "end_char_pos": 791}, {"type": "D", "before": "help us", "after": null, "start_char_pos": 862, "end_char_pos": 869}, {"type": "R", "before": "is", "after": "has been", "start_char_pos": 1013, "end_char_pos": 1015}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1113, "end_char_pos": 1114}, {"type": "R", "before": "precursor macromolecular solution conditions", "after": "solution conditions leading to successful crystallization", "start_char_pos": 1268, "end_char_pos": 1312}, {"type": "A", "before": null, "after": "future", "start_char_pos": 1332, "end_char_pos": 1332}, {"type": "D", "before": "or even from primary sequence analyses", "after": null, "start_char_pos": 1420, "end_char_pos": 1458}, {"type": "R", "before": "complex statistical models will", "after": "state-of-the-art statistical models may thus", "start_char_pos": 1552, "end_char_pos": 1583}], "sents_char_pos": [0, 119, 250, 347, 450, 554, 772, 951, 1055, 1171, 1460]} {"doc_id": "1402.6533", "revision_depth": "1", "before_revision": "This research is a review and assay of literature data on the properties of DNA open states . The states result from large fluctuations of a duplex and have a great influence on a wide range of biochemical processes , including electric charge transfer in DNA . A comparative analysis of kinetic and thermodynamic experimental data on DNA open states has been performed for a wide temperature range . Apparent contradictions between the data of different experiments have been explained. Based on differences in thermodynamic properties and other characteristics three different types of DNA open states have been identified; a modern definition of the term \"open state\" has been given. A brief review of simple mathematical models of DNA has been presented; in most of the models the state of every base pair is defined by one or two variables. The central problems of investigation of heterogeneous DNA within the approaches of the level considered are examined. The roles of every model group in experimental data interpretation are discussed. Special emphasis is placed on the study of transfer and localization of base pair vibration energy in mechanical models. These processes have been shown to play a key role in heterogeneous duplex dynamics, and their theoretical treatment is critically important for the development of modern molecular biology and biophysics. The key features of theoretical approaches, that enabled description of various experimental data , have been considered. The future development of the models has been described, some particular details of their optimization have been suggested; probable ways of improving some experimental techniques have been proposed .", "after_revision": "Literature data on the properties of DNA open states are reviewed and analyzed. These states are formed as a result of strong DNA fluctuations and have a great impact on a number of biochemical processes ; among them is charge transfer in DNA , for example . A comparative analysis of experimental data on the kinetics and thermodynamics of DNA open states for a wide temperature range was carried out. Discrepancies between the results of various experiments have been explained. Three types of DNA open states are recognized based on their differences in thermodynamic properties and other characteristics . Besides, an up-to-date definition of the term \"open state\" is given. A review is carried out for simple mathematical models of DNA in most of which the state of one pair is described by one or two variables. The main problems arising in theoretical investigations of heterogeneous DNA in the framework of models of this level are considered. The role of each group of models in interpretation of experimental data is discussed. Special consideration is given to the studies of the transfer and localization of the nucleotide pairs oscillations' energy by mechanical models. These processes are shown to play a key role in the dynamics of a heterogeneous duplex. Their theoretical interpretation is proven to be very important for the development of modern molecular biology and biophysics. The main features of the theoretical approaches are considered which enabled describing various experimental data . Prospects of the models ' development are described, particular details of their optimization are suggested, and possible ways of modernization of some experimental techniques are discussed .", "edit_actions": [{"type": "R", "before": "This research is a review and assay of literature", "after": "Literature", "start_char_pos": 0, "end_char_pos": 49}, {"type": "R", "before": ". The states result from large fluctuations of a duplex", "after": "are reviewed and analyzed. These states are formed as a result of strong DNA fluctuations", "start_char_pos": 92, "end_char_pos": 147}, {"type": "R", "before": "influence on a wide range", "after": "impact on a number", "start_char_pos": 165, "end_char_pos": 190}, {"type": "R", "before": ", including electric", "after": "; among them is", "start_char_pos": 216, "end_char_pos": 236}, {"type": "A", "before": null, "after": ", for example", "start_char_pos": 260, "end_char_pos": 260}, {"type": "D", "before": "kinetic and thermodynamic", "after": null, "start_char_pos": 289, "end_char_pos": 314}, {"type": "A", "before": null, "after": "the kinetics and thermodynamics of", "start_char_pos": 336, "end_char_pos": 336}, {"type": "D", "before": "has been performed", "after": null, "start_char_pos": 353, "end_char_pos": 371}, {"type": "R", "before": ". Apparent contradictions between the data of different", "after": "was carried out. Discrepancies between the results of various", "start_char_pos": 401, "end_char_pos": 456}, {"type": "R", "before": "Based on", "after": "Three types of DNA open states are recognized based on their", "start_char_pos": 490, "end_char_pos": 498}, {"type": "R", "before": "three different types of DNA open states have been identified; a modern", "after": ". Besides, an up-to-date", "start_char_pos": 565, "end_char_pos": 636}, {"type": "R", "before": "has been", "after": "is", "start_char_pos": 673, "end_char_pos": 681}, {"type": "R", "before": "brief review of", "after": "review is carried out for", "start_char_pos": 691, "end_char_pos": 706}, {"type": "D", "before": "has been presented;", "after": null, "start_char_pos": 741, "end_char_pos": 760}, {"type": "R", "before": "the models the state of every base pair is defined", "after": "which the state of one pair is described", "start_char_pos": 772, "end_char_pos": 822}, {"type": "R", "before": "central problems of investigation of heterogeneous DNA within the approaches of the level considered are examined. The roles of every model group in experimental data interpretation are", "after": "main problems arising in theoretical investigations of heterogeneous DNA in the framework of models of this level are considered. The role of each group of models in interpretation of experimental data is", "start_char_pos": 852, "end_char_pos": 1037}, {"type": "R", "before": "emphasis is placed on the study of", "after": "consideration is given to the studies of the", "start_char_pos": 1057, "end_char_pos": 1091}, {"type": "R", "before": "base pair vibration energy in", "after": "the nucleotide pairs oscillations' energy by", "start_char_pos": 1121, "end_char_pos": 1150}, {"type": "R", "before": "have been", "after": "are", "start_char_pos": 1186, "end_char_pos": 1195}, {"type": "R", "before": "heterogeneous duplex dynamics, and their theoretical treatment is critically", "after": "the dynamics of a heterogeneous duplex. Their theoretical interpretation is proven to be very", "start_char_pos": 1224, "end_char_pos": 1300}, {"type": "R", "before": "key features of theoretical approaches, that enabled description of", "after": "main features of the theoretical approaches are considered which enabled describing", "start_char_pos": 1379, "end_char_pos": 1446}, {"type": "R", "before": ", have been considered. The future development", "after": ". Prospects", "start_char_pos": 1473, "end_char_pos": 1519}, {"type": "R", "before": "has been described, some", "after": "' development are described,", "start_char_pos": 1534, "end_char_pos": 1558}, {"type": "R", "before": "have been suggested; probable ways of improving", "after": "are suggested, and possible ways of modernization of", "start_char_pos": 1600, "end_char_pos": 1647}, {"type": "R", "before": "have been proposed", "after": "are discussed", "start_char_pos": 1677, "end_char_pos": 1695}], "sents_char_pos": [0, 93, 402, 489, 627, 688, 760, 847, 966, 1048, 1169, 1374, 1496, 1620]} {"doc_id": "1404.0410", "revision_depth": "1", "before_revision": "This paper addresses the question of non-arbitrage (precisely No-Unbounded-Profit-with-Bounded-Risk , NUPBR hereafter) after a specific random time. This study completes the one of Aksamit et al. \\mbox{%DIFAUXCMD aksamit/choulli/deng/jeanblanc ] the part after the random time under consideration. We restrict our attention to honest times, and we characterize the pairs of market and honest time for which the resulting model preserves the NUPBR property . Furthermore, we characterize the honest times that preserve the NUPBR property . These findings are essentially based on new stochastic results that are interesting in themselves. Furthermore, we construct explicitly local martingale deflators for a large class of processes .", "after_revision": "This paper quantifies the interplay between the non-arbitrage notion of No-Unbounded-Profit-with-Bounded-Risk ( NUPBR hereafter) and additional information generated by a random time. This study complements the one of Aksamit /Choulli/Deng/Jeanblanc 1] in which the authors studied similar topics for the case of stopping at the random time instead, while herein we are concerned with the part after the occurrence of the random time. Given that all the literature -up to our knowledge- proves that the NUPBR notion is always violated after honest times that avoid stopping times in a continuous filtration, herein we propose a new class of honest times for which the NUPBR notion can be preserved for some models. For this family of honest times, we elaborate two principal results. The first main result characterizes the pairs of initial market and honest time for which the resulting model preserves the NUPBR property , while the second main result characterizes the honest times that preserve the NUPBR property for any quasi-left continuous model. Furthermore, we construct explicitly \"the-after-tau\" local martingale deflators for a large class of initial models (i.e. models in the small filtration) that are already risk-neutralized .", "edit_actions": [{"type": "R", "before": "addresses the question of", "after": "quantifies the interplay between the", "start_char_pos": 11, "end_char_pos": 36}, {"type": "R", "before": "(precisely", "after": "notion of", "start_char_pos": 51, "end_char_pos": 61}, {"type": "R", "before": ",", "after": "(", "start_char_pos": 100, "end_char_pos": 101}, {"type": "R", "before": "after a specific", "after": "and additional information generated by a", "start_char_pos": 119, "end_char_pos": 135}, {"type": "R", "before": "completes", "after": "complements", "start_char_pos": 160, "end_char_pos": 169}, {"type": "R", "before": "et al. \\mbox{%DIFAUXCMD aksamit/choulli/deng/jeanblanc", "after": "/Choulli/Deng/Jeanblanc", "start_char_pos": 189, "end_char_pos": 243}, {"type": "A", "before": null, "after": "1", "start_char_pos": 244, "end_char_pos": 244}, {"type": "A", "before": null, "after": "in which the authors studied similar topics for the case of stopping at the random time instead, while herein we are concerned with", "start_char_pos": 246, "end_char_pos": 246}, {"type": "R", "before": "random time under consideration. We restrict our attention to honest times, and we characterize the pairs of", "after": "occurrence of the random time. Given that all the literature -up to our knowledge- proves that the NUPBR notion is always violated after honest times that avoid stopping times in a continuous filtration, herein we propose a new class of honest times for which the NUPBR notion can be preserved for some models. For this family of honest times, we elaborate two principal results. The first main result characterizes the pairs of initial", "start_char_pos": 266, "end_char_pos": 374}, {"type": "R", "before": ". Furthermore, we characterize the", "after": ", while the second main result characterizes the", "start_char_pos": 457, "end_char_pos": 491}, {"type": "R", "before": ". These findings are essentially based on new stochastic results that are interesting in themselves.", "after": "for any quasi-left continuous model.", "start_char_pos": 538, "end_char_pos": 638}, {"type": "A", "before": null, "after": "\"the-after-tau\"", "start_char_pos": 676, "end_char_pos": 676}, {"type": "R", "before": "processes", "after": "initial models (i.e. models in the small filtration) that are already risk-neutralized", "start_char_pos": 725, "end_char_pos": 734}], "sents_char_pos": [0, 148, 195, 298, 458, 539, 638]} {"doc_id": "1405.2512", "revision_depth": "2", "before_revision": "Consider a high-dimensional data set, such that for every data-point there is incomplete information. Each object in the data set represents a real entity, which models as a point in high-dimensional space. We assume that all real entities are embedded in the same space, which means they have the same dimension. We model the lack of information for a given object as affine subspace in R^d with dimension k . Our goal in this paper is to find clusters of objects . The main problem is to cope with the partial information . We studied a simple algorithm we callData clustering using flats minimum distances , using the following assumptions: 1) There are m clusters. 2) Each cluster is modeled as a ball in \\mathbb{R}^d . 3) Each cluster contains a \\frac{n{m}, k-dimensional affine subspaces . 4) All k-dimensional affine subspaces, which belong in the same cluster, are intersected with the ball of the cluster. 5) Each k-dimensional affine subspace, that belong to a cluster, is selected uniformly among all k-dimensional affine subspaces that intersect the ball's cluster. A data set that satisfy these assumptions will be called }\\textit{separable data . Our suggested algorithm calculates pair-wise projection of the data . We use probabilistic considerations to prove the algorithm correctness. These probabilistic results are of independent interest, as can serve to better understand the geometry of high dimensional objects.", "after_revision": "Consider a high-dimensional data set, in which for every data-point there is incomplete information. Each object in the data set represents a real entity, which is described by a point in high-dimensional space. We model the lack of information for a given object as an affine subspace in R^d whose dimension k is the number of missing features . Our goal in this study is to find clusters of objects where the main problem is to cope with partial information and high dimension. Assuming the data set is separable, namely, its emergence from clusters that can be modeled as a set of disjoint ball in \\mathbb{R}^d , we suggest a simple data clustering algorithm . {m}, k-dimensional affine subspaces . 4) All k-dimensional affine subspaces, which belong in the same cluster, are intersected with the ball of the cluster. 5) Each k-dimensional affine subspace, that belong to a cluster, is selected uniformly among all k-dimensional affine subspaces that intersect the ball's cluster. A data set that satisfy these assumptions will be called }\\textit{ Our suggested algorithm use the affine subspaces minimum distance and calculates pair-wise projection of the data achieving poly-logarithmic time complexity . We use probabilistic considerations to prove the algorithm 's correctness. These probabilistic results are of independent interest, and can serve to better understand the geometry of high dimensional objects.", "edit_actions": [{"type": "R", "before": "such that", "after": "in which", "start_char_pos": 38, "end_char_pos": 47}, {"type": "R", "before": "models as", "after": "is described by", "start_char_pos": 162, "end_char_pos": 171}, {"type": "D", "before": "assume that all real entities are embedded in the same space, which means they have the same dimension. We", "after": null, "start_char_pos": 210, "end_char_pos": 316}, {"type": "A", "before": null, "after": "an", "start_char_pos": 369, "end_char_pos": 369}, {"type": "R", "before": "with dimension k", "after": "whose dimension k is the number of missing features", "start_char_pos": 393, "end_char_pos": 409}, {"type": "R", "before": "paper", "after": "study", "start_char_pos": 429, "end_char_pos": 434}, {"type": "R", "before": ". The", "after": "where the", "start_char_pos": 466, "end_char_pos": 471}, {"type": "D", "before": "the partial information . We studied a simple algorithm we call", "after": null, "start_char_pos": 501, "end_char_pos": 564}, {"type": "D", "before": "Data clustering using flats minimum distances", "after": null, "start_char_pos": 564, "end_char_pos": 609}, {"type": "R", "before": ", using the following assumptions: 1) There are m clusters. 2) Each cluster is", "after": "partial information and high dimension. Assuming the data set is separable, namely, its emergence from clusters that can be", "start_char_pos": 610, "end_char_pos": 688}, {"type": "A", "before": null, "after": "set of disjoint", "start_char_pos": 702, "end_char_pos": 702}, {"type": "A", "before": null, "after": ", we suggest a simple data clustering algorithm", "start_char_pos": 724, "end_char_pos": 724}, {"type": "D", "before": "3) Each cluster contains a \\frac{n", "after": null, "start_char_pos": 727, "end_char_pos": 761}, {"type": "D", "before": "separable data", "after": null, "start_char_pos": 1147, "end_char_pos": 1161}, {"type": "D", "before": ".", "after": null, "start_char_pos": 1162, "end_char_pos": 1163}, {"type": "A", "before": null, "after": "use the affine subspaces minimum distance and", "start_char_pos": 1188, "end_char_pos": 1188}, {"type": "A", "before": null, "after": "achieving poly-logarithmic time complexity", "start_char_pos": 1233, "end_char_pos": 1233}, {"type": "A", "before": null, "after": "'s", "start_char_pos": 1295, "end_char_pos": 1295}, {"type": "R", "before": "as", "after": "and", "start_char_pos": 1366, "end_char_pos": 1368}], "sents_char_pos": [0, 101, 206, 313, 467, 526, 669, 917, 1080, 1163, 1235, 1308]} {"doc_id": "1407.1135", "revision_depth": "2", "before_revision": "Quantitative modeling in biology can be difficult due to parameter value scarcity . An alternative is qualitative modeling since it requires few to no parameters. This article presents a qualitative modeling derived from boolean networks where fuzzy logic is used and where edges can be tuned. Fuzzy logic being continuous, its variables can be finely valued while remaining qualitative. To consider that some interactions are slower or weaker than other ones, edge states are computed to modulate in speed and strength the signal they convey. The proposed formalism is illustrated through its implementation on an example network. Simulations show that continuous results are produced, thus allowing fine analysis, and that modulating the signal conveyed by the edges allows their tuning according to knowledge about the interaction they model. The present work is expected to bring enhancements in the ability of qualitative models to simulate biological networks .", "after_revision": "Quantitative modeling in systems biology can be difficult due to the scarcity of quantitative details about biological phenomenons, especially at the subcellular scale . An alternative to escape this difficulty is qualitative modeling since it requires few to no quantitative information. Among the qualitative modeling approaches, the Boolean network formalism is one of the most popular. However, Boolean models allow variables to be valued at only true or false, which can appear too simplistic when modeling biological processes. Consequently, this work proposes a modeling approach derived from Boolean networks where fuzzy operators are used and where edges are tuned. Fuzzy operators allow variables to be continuous and then to be more finely valued than with discrete modeling approaches, such as Boolean networks, while remaining qualitative. Moreover, to consider that in a given biological network some interactions are slower and/or weaker relative to other ones, edge states are computed in order to modulate in speed and strength the signal they convey. The proposed formalism is illustrated through its implementation on a tiny sample of the epidermal growth factor receptor signaling pathway. The obtained simulations show that continuous results are produced, thus allowing finer analysis, and that modulating the signal conveyed by the edges allows their tuning according to knowledge about the modeled interactions, thus incorporating more knowledge. The proposed modeling approach is expected to bring enhancements in the ability of qualitative models to simulate the dynamics of biological networks while not requiring quantitative information .", "edit_actions": [{"type": "A", "before": null, "after": "systems", "start_char_pos": 25, "end_char_pos": 25}, {"type": "R", "before": "parameter value scarcity", "after": "the scarcity of quantitative details about biological phenomenons, especially at the subcellular scale", "start_char_pos": 58, "end_char_pos": 82}, {"type": "A", "before": null, "after": "to escape this difficulty", "start_char_pos": 100, "end_char_pos": 100}, {"type": "R", "before": "parameters. This article presents a qualitative modeling derived from boolean", "after": "quantitative information. Among the qualitative modeling approaches, the Boolean network formalism is one of the most popular. However, Boolean models allow variables to be valued at only true or false, which can appear too simplistic when modeling biological processes. Consequently, this work proposes a modeling approach derived from Boolean", "start_char_pos": 153, "end_char_pos": 230}, {"type": "R", "before": "logic is", "after": "operators are", "start_char_pos": 252, "end_char_pos": 260}, {"type": "R", "before": "can be", "after": "are", "start_char_pos": 282, "end_char_pos": 288}, {"type": "R", "before": "logic being continuous, its variables can be finely valued", "after": "operators allow variables to be continuous and then to be more finely valued than with discrete modeling approaches, such as Boolean networks,", "start_char_pos": 302, "end_char_pos": 360}, {"type": "R", "before": "To consider that", "after": "Moreover, to consider that in a given biological network", "start_char_pos": 390, "end_char_pos": 406}, {"type": "R", "before": "or weaker than", "after": "and/or weaker relative to", "start_char_pos": 436, "end_char_pos": 450}, {"type": "A", "before": null, "after": "in order", "start_char_pos": 488, "end_char_pos": 488}, {"type": "R", "before": "an example network. Simulations", "after": "a tiny sample of the epidermal growth factor receptor signaling pathway. The obtained simulations", "start_char_pos": 615, "end_char_pos": 646}, {"type": "R", "before": "fine", "after": "finer", "start_char_pos": 704, "end_char_pos": 708}, {"type": "R", "before": "interaction they model. The present work", "after": "modeled interactions, thus incorporating more knowledge. The proposed modeling approach", "start_char_pos": 825, "end_char_pos": 865}, {"type": "R", "before": "biological networks", "after": "the dynamics of biological networks while not requiring quantitative information", "start_char_pos": 949, "end_char_pos": 968}], "sents_char_pos": [0, 84, 164, 295, 389, 546, 634, 848]} {"doc_id": "1407.4992", "revision_depth": "1", "before_revision": "Background: With the ever increasing use of computational models in the biosciences, the need to efficiently and easily share models and reproduce the results of published studies is becoming more important. As part of this effort , various standards have been proposed that can be used to describe models, simulations, data or other essential information . These constitute various separate components that are required to reproduce a published scientific result. Results: In this work we describe the Open Modeling EXchange format (OMEX) that allows all the necessary information to be bundled together into one file . Together with the use of other COMBINE standard formats , OMEX is the basis of the COMBINE archive , a single file that supports the exchange of all the information necessary for a modeling and simulation experiment in biology. An OMEX file is a ZIP container that includes a manifest file, listing the content of the archive, an optional metadata file adding information about the archive and its content, and the files describing the model. The content of a COMBINE archive consists of files encoded in COMBINE standards whenever possible, but may include additional files defined by an Internet Media Type. Several tools supporting the COMBINE archive are available, either as independent libraries or embedded in modeling software. Conclusions: The COMBINE archive facilitates the reproduction of modeling and simulation experiments in biology by embedding all the relevant information in one file. Having all the information stored and exchanged at once also helps support building logs and audit trails. We anticipate that the COMBINE archive will become a significant help , as the domain moves to larger, more complex experiments such as multi-scale models URLans, URLanisms, and bioengineering.", "after_revision": "Background: With the ever increasing use of computational models in the biosciences, the need to share models and reproduce the results of published studies efficiently and easily is becoming more important. To this end , various standards have been proposed that can be used to describe models, simulations, data or other essential information in a consistent fashion . These constitute various separate components required to reproduce a given published scientific result. Results: We describe the Open Modeling EXchange format (OMEX) . Together with the use of other standard formats from the Computational Modeling in Biology Network (COMBINE) , OMEX is the basis of the COMBINE Archive , a single file that supports the exchange of all the information necessary for a modeling and simulation experiment in biology. An OMEX file is a ZIP container that includes a manifest file, listing the content of the archive, an optional metadata file adding information about the archive and its content, and the files describing the model. The content of a COMBINE Archive consists of files encoded in COMBINE standards whenever possible, but may include additional files defined by an Internet Media Type. Several tools that support the COMBINE Archive are available, either as independent libraries or embedded in modeling software. Conclusions: The COMBINE Archive facilitates the reproduction of modeling and simulation experiments in biology by embedding all the relevant information in one file. Having all the information stored and exchanged at once also helps in building activity logs and audit trails. We anticipate that the COMBINE Archive will become a significant help for modellers , as the domain moves to larger, more complex experiments such as multi-scale models URLans, URLanisms, and bioengineering.", "edit_actions": [{"type": "D", "before": "efficiently and easily", "after": null, "start_char_pos": 97, "end_char_pos": 119}, {"type": "A", "before": null, "after": "efficiently and easily", "start_char_pos": 180, "end_char_pos": 180}, {"type": "R", "before": "As part of this effort", "after": "To this end", "start_char_pos": 209, "end_char_pos": 231}, {"type": "A", "before": null, "after": "in a consistent fashion", "start_char_pos": 357, "end_char_pos": 357}, {"type": "D", "before": "that are", "after": null, "start_char_pos": 405, "end_char_pos": 413}, {"type": "A", "before": null, "after": "given", "start_char_pos": 438, "end_char_pos": 438}, {"type": "R", "before": "In this work we", "after": "We", "start_char_pos": 477, "end_char_pos": 492}, {"type": "D", "before": "that allows all the necessary information to be bundled together into one file", "after": null, "start_char_pos": 543, "end_char_pos": 621}, {"type": "R", "before": "COMBINE standard formats", "after": "standard formats from the Computational Modeling in Biology Network (COMBINE)", "start_char_pos": 655, "end_char_pos": 679}, {"type": "R", "before": "archive", "after": "Archive", "start_char_pos": 715, "end_char_pos": 722}, {"type": "R", "before": "archive", "after": "Archive", "start_char_pos": 1092, "end_char_pos": 1099}, {"type": "R", "before": "supporting the COMBINE archive", "after": "that support the COMBINE Archive", "start_char_pos": 1248, "end_char_pos": 1278}, {"type": "R", "before": "archive", "after": "Archive", "start_char_pos": 1385, "end_char_pos": 1392}, {"type": "R", "before": "support building", "after": "in building activity", "start_char_pos": 1594, "end_char_pos": 1610}, {"type": "R", "before": "archive", "after": "Archive", "start_char_pos": 1665, "end_char_pos": 1672}, {"type": "A", "before": null, "after": "for modellers", "start_char_pos": 1704, "end_char_pos": 1704}], "sents_char_pos": [0, 208, 359, 467, 623, 851, 1066, 1233, 1359, 1526, 1633]} {"doc_id": "1409.6773", "revision_depth": "1", "before_revision": "On a filtered probability space (\\Omega,\\mathcal{F,P,F=(F_t)_{0\\leq t\\leq T}), we consider stopper-stopper games }%DIFDELCMD < \\bar %%% C:=\\inf_{\\Rho\\tau\\in\\T}%DIFDELCMD < \\E[U(\\Rho(\\tau),\\tau)] %%% and%DIFDELCMD < \\underline %%% C:=\\sup_{\\Tau\\rho\\in\\T}%DIFDELCMD < \\E[U(\\Rho(\\tau),\\tau)] %%% in continuous time , where U(s,t) is \\mathcal{F_{s\\vee t}-measurable (this is the new feature of our stopping game ), }%DIFDELCMD < \\T %%% is the set of stopping times, and%DIFDELCMD < \\Rho%%% ,%DIFDELCMD < \\Tau%%% :%DIFDELCMD < \\T%%% \\mapsto%DIFDELCMD < \\T %%% satisfy certain non-anticipativity conditions. We show that%DIFDELCMD < \\bar %%% C=%DIFDELCMD < \\underline %%% C, by converting these problems into a corresponding Dynkin game .", "after_revision": ",P,F=(F_t)_{0\\leq t\\leq T}), we consider stopper-stopper games }%DIFDELCMD < \\bar %%% \\tau\\in\\T}%DIFDELCMD < \\E[U(\\Rho(\\tau),\\tau)] %%% %DIFDELCMD < \\underline %%% \\rho\\in\\T}%DIFDELCMD < \\E[U(\\Rho(\\tau),\\tau)] %%% _{s\\vee t}-measurable (this is the new feature of our stopping game ), }%DIFDELCMD < \\T %%% We consider a zero-sum continuous time stopping %DIFDELCMD < \\Rho%%% %DIFDELCMD < \\Tau%%% %DIFDELCMD < \\T%%% %DIFDELCMD < \\T %%% %DIFDELCMD < \\bar %%% %DIFDELCMD < \\underline %%% game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games .", "edit_actions": [{"type": "D", "before": "On a filtered probability space (\\Omega,\\mathcal{F", "after": null, "start_char_pos": 0, "end_char_pos": 50}, {"type": "D", "before": "C:=\\inf_{\\Rho", "after": null, "start_char_pos": 136, "end_char_pos": 149}, {"type": "D", "before": "and", "after": null, "start_char_pos": 199, "end_char_pos": 202}, {"type": "D", "before": "C:=\\sup_{\\Tau", "after": null, "start_char_pos": 230, "end_char_pos": 243}, {"type": "D", "before": "in continuous time , where U(s,t) is \\mathcal{F", "after": null, "start_char_pos": 293, "end_char_pos": 340}, {"type": "R", "before": "is the set of", "after": "We consider a zero-sum continuous time", "start_char_pos": 432, "end_char_pos": 445}, {"type": "D", "before": "times, and", "after": null, "start_char_pos": 455, "end_char_pos": 465}, {"type": "D", "before": ",", "after": null, "start_char_pos": 486, "end_char_pos": 487}, {"type": "D", "before": ":", "after": null, "start_char_pos": 508, "end_char_pos": 509}, {"type": "D", "before": "\\mapsto", "after": null, "start_char_pos": 528, "end_char_pos": 535}, {"type": "D", "before": "satisfy certain non-anticipativity conditions. We show that", "after": null, "start_char_pos": 555, "end_char_pos": 614}, {"type": "D", "before": "C=", "after": null, "start_char_pos": 636, "end_char_pos": 638}, {"type": "D", "before": "C, by converting these problems into a corresponding Dynkin", "after": null, "start_char_pos": 666, "end_char_pos": 725}, {"type": "A", "before": null, "after": "in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games", "start_char_pos": 731, "end_char_pos": 731}], "sents_char_pos": [0, 138, 601]} {"doc_id": "1409.6789", "revision_depth": "2", "before_revision": "Direct detector device (DDD) cameras have revolutionized single particle electron cryomicroscopy (cryo-EM) of protein complexes . In addition to increasing the detective quantum efficiency with which images can be recorded , acquisition of DDD movies during exposures allows for correction of movement of the specimen, due both to instabilities in the specimen stage of the microscope and electron beam-induced movement. Unlike specimen stage drift, beam-induced movement is not always homogeneous within an image. Local correlation in the trajectories of nearby particles suggests that beam-induced motion is due to deformation of the ice layer. Algorithms have already been described that can correct movement of entire frames or large regions of frames at exposures of 2-3 e^{- rolling averages to be calculated from frames and fit linear trajectories for particles. Here we describe an algorithm that allows for individual < 1 MDa particle images to be aligned without frame averaging when imaged with 2.5 e^{- . The algorithm maximizes the overall correlation of the shifted frames with the sum of the shifted frames. The optimum in this single objective function is found efficiently by making use of analytically calculated derivatives of the function. Two additional measures are implemented to smooth estimates of particle trajectories . First , rapid changes in particle positions between frames are penalized . Second, weighted averaging of nearby trajectories ensures local correlation in trajectories. DDD movies of the\\textit{Saccharomyces cerevisiae V-ATPase are used to demonstrate that the algorithm is able to produce physically reasonable trajectories for a 900 kDa membrane protein complex .", "after_revision": "Direct detector device (DDD) cameras have revolutionized single particle electron cryomicroscopy (cryo-EM) . In addition to an improved camera detective quantum efficiency , acquisition of DDD movies allows for correction of movement of the specimen, due both to instabilities in the microscope specimen stage and electron beam-induced movement. Unlike specimen stage drift, beam-induced movement is not always homogeneous within an image. Local correlation in the trajectories of nearby particles suggests that beam-induced motion is due to deformation of the ice layer. Algorithms have already been described that can correct movement for large regions of frames and for > 1 MDa protein particles. Another algorithm allows individual < 1 MDa protein particle trajectories to be estimated, but requires rolling averages to be calculated from frames and fits linear trajectories for particles. Here we describe an algorithm that allows for individual < 1 MDa particle images to be aligned without frame averaging or linear trajectories . The algorithm maximizes the overall correlation of the shifted frames with the sum of the shifted frames. The optimum in this single objective function is found efficiently by making use of analytically calculated derivatives of the function. To smooth estimates of particle trajectories , rapid changes in particle positions between frames are penalized in the objective function and weighted averaging of nearby trajectories ensures local correlation in trajectories. \\textit{ This individual particle motion correction, in combination with weighting of Fourier components to account for increasing radiation damage in later frames, can be used to improve 3-D maps from single particle cryo-EM .", "edit_actions": [{"type": "D", "before": "of protein complexes", "after": null, "start_char_pos": 107, "end_char_pos": 127}, {"type": "R", "before": "increasing the", "after": "an improved camera", "start_char_pos": 145, "end_char_pos": 159}, {"type": "D", "before": "with which images can be recorded", "after": null, "start_char_pos": 189, "end_char_pos": 222}, {"type": "D", "before": "during exposures", "after": null, "start_char_pos": 251, "end_char_pos": 267}, {"type": "R", "before": "specimen stage of the microscope", "after": "microscope specimen stage", "start_char_pos": 352, "end_char_pos": 384}, {"type": "R", "before": "of entire frames or", "after": "for", "start_char_pos": 712, "end_char_pos": 731}, {"type": "R", "before": "at exposures of 2-3 e^{-", "after": "and for > 1 MDa protein particles. Another algorithm allows individual < 1 MDa protein particle trajectories to be estimated, but requires", "start_char_pos": 756, "end_char_pos": 780}, {"type": "R", "before": "fit", "after": "fits", "start_char_pos": 831, "end_char_pos": 834}, {"type": "R", "before": "when imaged with 2.5 e^{-", "after": "or linear trajectories", "start_char_pos": 989, "end_char_pos": 1014}, {"type": "R", "before": "Two additional measures are implemented to", "after": "To", "start_char_pos": 1260, "end_char_pos": 1302}, {"type": "D", "before": ". First", "after": null, "start_char_pos": 1345, "end_char_pos": 1352}, {"type": "R", "before": ". Second,", "after": "in the objective function and", "start_char_pos": 1420, "end_char_pos": 1429}, {"type": "D", "before": "DDD movies of the", "after": null, "start_char_pos": 1515, "end_char_pos": 1532}, {"type": "D", "before": "Saccharomyces cerevisiae", "after": null, "start_char_pos": 1540, "end_char_pos": 1564}, {"type": "R", "before": "V-ATPase are used to demonstrate that the algorithm is able to produce physically reasonable trajectories for a 900 kDa membrane protein complex", "after": "This individual particle motion correction, in combination with weighting of Fourier components to account for increasing radiation damage in later frames, can be used to improve 3-D maps from single particle cryo-EM", "start_char_pos": 1565, "end_char_pos": 1709}], "sents_char_pos": [0, 129, 420, 514, 646, 869, 1122, 1259, 1346, 1421, 1514]} {"doc_id": "1409.8268", "revision_depth": "1", "before_revision": "There have been many studies on malicious targeting of network nodes using degree, betweenness etc. We propose a new network metric, edge proximity, {\\cal P}_e, which demonstrates the importance of specific edges in a network, hitherto not captured by existing network metrics. Effects of removing edges with high {\\cal P}_e might initially seem inconspicuous but is eventually shown to be very harmful for the network. When compared to existing strategies, removal of edges by {\\cal P}_e , leads to remarkable increase of diameter and average path length in real and random networks till the first disconnection and beyond. {\\cal P}_e can be consistently used to rupture the network into two nearly equal parts, thus presenting a very potent strategy to greatly harm a network. Targeting by {\\cal P}_e causes notable efficiency loss in US and European power grid . {\\cal P}_e identifies proteins with essential cellular functions in protein-protein interaction networks. It pinpoints regulatory neural connections and important portions of the neural and brain networks respectively. Energy flow interactions identified by {\\cal P}_e form the backbone of long food web chains. Finally, we scrutinize the potential of {\\cal P}_e in edge controllability dynamics of directed networks.", "after_revision": " We propose a network metric, edge proximity, {\\cal P}_e, which demonstrates the importance of specific edges in a network, hitherto not captured by existing network metrics. The effects of removing edges with high {\\cal P}_e might initially seem inconspicuous but are eventually shown to be very harmful for networks. Compared to existing strategies, the removal of edges by {\\cal P}_e leads to a remarkable increase in the diameter and average shortest path length in undirected real and random networks till the first disconnection and well beyond. {\\cal P}_e can be consistently used to rupture the network into two nearly equal parts, thus presenting a very potent strategy to greatly harm a network. Targeting by {\\cal P}_e causes notable efficiency loss in U.S. and European power grid networks . {\\cal P}_e identifies proteins with essential cellular functions in protein-protein interaction networks. It pinpoints regulatory neural connections and important portions of the neural and brain networks , respectively. Energy flow interactions identified by {\\cal P}_e form the backbone of long food web chains. Finally, we scrutinize the potential of {\\cal P}_e in edge controllability dynamics of directed networks.", "edit_actions": [{"type": "D", "before": "There have been many studies on malicious targeting of network nodes using degree, betweenness etc.", "after": null, "start_char_pos": 0, "end_char_pos": 99}, {"type": "D", "before": "new", "after": null, "start_char_pos": 113, "end_char_pos": 116}, {"type": "R", "before": "Effects", "after": "The effects", "start_char_pos": 278, "end_char_pos": 285}, {"type": "R", "before": "is", "after": "are", "start_char_pos": 364, "end_char_pos": 366}, {"type": "R", "before": "the network. When compared", "after": "networks. Compared", "start_char_pos": 407, "end_char_pos": 433}, {"type": "A", "before": null, "after": "the", "start_char_pos": 458, "end_char_pos": 458}, {"type": "R", "before": ", leads to remarkable increase of", "after": "leads to a remarkable increase in the", "start_char_pos": 490, "end_char_pos": 523}, {"type": "A", "before": null, "after": "shortest", "start_char_pos": 545, "end_char_pos": 545}, {"type": "A", "before": null, "after": "undirected", "start_char_pos": 561, "end_char_pos": 561}, {"type": "A", "before": null, "after": "well", "start_char_pos": 620, "end_char_pos": 620}, {"type": "R", "before": "US", "after": "U.S.", "start_char_pos": 841, "end_char_pos": 843}, {"type": "A", "before": null, "after": "networks", "start_char_pos": 868, "end_char_pos": 868}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1076, "end_char_pos": 1076}], "sents_char_pos": [0, 99, 277, 419, 628, 782, 976, 1090, 1183]} {"doc_id": "1411.3075", "revision_depth": "1", "before_revision": "This paper studies Markovian asset pricing models where the underlying economic uncertainty follows a continuous-time Markov process X with a general state space ( namely, a Borel right process (BRP)) and the pricing kernel ( stochastic discount factor , state-price density ) is a positive semimartingale multiplicative functional of X. We establish uniqueness of a positive eigenfunction of the pricing operator such that X is recurrent under a new probability measure associated with this eigenfunction (recurrent eigenfunction). As an application , we prove uniqueness of the Hansen and Scheinkman (2009) factorization of the Markovian pricing kernel under the assumption of recurrence, and, as a special case, we extend the Recovery Theorem of Ross (2013) from discrete time, finite state irreducible Markov chains to recurrent Borel right processes. When a model is specified by given risk-neutral probabilities together with a given short rate function of the Markovian driver , we give three sufficient conditions for existence of a recurrent eigenfunction (and , hence, of a recurrent Hansen-Scheinkman factorization and Ross recovery) for specific classes of Markovian models and provide explicit examples of recurrent eigenfunctions, recurrent Hansen-Scheikman factorizations, and Ross recoveries in a number of models, including affine and quadratic diffusion models , some non-affine diffusion models, and an affine model with jumps. These examples show that the recurrence assumption, in addition to fixing uniqueness, rules out unstable economic dynamics, such as the risk-free rate asymptotically going to infinity or to a zero lower bound trap .", "after_revision": "This paper develops a spectral theory of Markovian asset pricing models where the underlying economic uncertainty follows a continuous-time Markov process X with a general state space ( Borel right process (BRP)) and the stochastic discount factor (SDF ) is a positive semimartingale multiplicative functional of X. A key result is the uniqueness theorem for a positive eigenfunction of the pricing operator such that X is recurrent under a new probability measure associated with this eigenfunction (recurrent eigenfunction). As economic applications , we prove uniqueness of the Hansen and Scheinkman (2009) factorization of the Markovian SDF corresponding to the recurrent eigenfunction, extend the Recovery Theorem of Ross (2013) from discrete time, finite state irreducible Markov chains to recurrent BRPs, and obtain the long maturity asymptotics of the pricing operator. When an asset pricing model is specified by given risk-neutral probabilities together with a short rate function of the Markovian state , we give sufficient conditions for existence of a recurrent eigenfunction and provide explicit examples in a number of important financial models, including affine and quadratic diffusion models and an affine model with jumps. These examples show that the recurrence assumption, in addition to fixing uniqueness, rules out unstable economic dynamics, such as the short rate asymptotically going to infinity or to a zero lower bound trap without possibility of escaping .", "edit_actions": [{"type": "R", "before": "studies", "after": "develops a spectral theory of", "start_char_pos": 11, "end_char_pos": 18}, {"type": "D", "before": "namely, a", "after": null, "start_char_pos": 164, "end_char_pos": 173}, {"type": "D", "before": "pricing kernel (", "after": null, "start_char_pos": 209, "end_char_pos": 225}, {"type": "R", "before": ", state-price density", "after": "(SDF", "start_char_pos": 253, "end_char_pos": 274}, {"type": "R", "before": "We establish uniqueness of", "after": "A key result is the uniqueness theorem for", "start_char_pos": 338, "end_char_pos": 364}, {"type": "R", "before": "an application", "after": "economic applications", "start_char_pos": 536, "end_char_pos": 550}, {"type": "R", "before": "pricing kernel under the assumption of recurrence, and, as a special case, we", "after": "SDF corresponding to the recurrent eigenfunction,", "start_char_pos": 640, "end_char_pos": 717}, {"type": "R", "before": "Borel right processes. When a", "after": "BRPs, and obtain the long maturity asymptotics of the pricing operator. When an asset pricing", "start_char_pos": 833, "end_char_pos": 862}, {"type": "D", "before": "given", "after": null, "start_char_pos": 934, "end_char_pos": 939}, {"type": "R", "before": "driver", "after": "state", "start_char_pos": 977, "end_char_pos": 983}, {"type": "D", "before": "three", "after": null, "start_char_pos": 994, "end_char_pos": 999}, {"type": "R", "before": "(and , hence, of a recurrent Hansen-Scheinkman factorization and Ross recovery) for specific classes of Markovian models and", "after": "and", "start_char_pos": 1065, "end_char_pos": 1189}, {"type": "D", "before": "of recurrent eigenfunctions, recurrent Hansen-Scheikman factorizations, and Ross recoveries", "after": null, "start_char_pos": 1216, "end_char_pos": 1307}, {"type": "A", "before": null, "after": "important financial", "start_char_pos": 1323, "end_char_pos": 1323}, {"type": "D", "before": ", some non-affine diffusion models,", "after": null, "start_char_pos": 1380, "end_char_pos": 1415}, {"type": "R", "before": "risk-free", "after": "short", "start_char_pos": 1584, "end_char_pos": 1593}, {"type": "A", "before": null, "after": "without possibility of escaping", "start_char_pos": 1662, "end_char_pos": 1662}], "sents_char_pos": [0, 337, 532, 855, 1144, 1447]} {"doc_id": "1411.4265", "revision_depth": "1", "before_revision": "After the release of the final accounting standards for impairment in July 2014 by the IASB, banks will face another significant methodological challenge after Basel 2. The presented work shares some first methodological thoughts and proposes ways how to approach underlying questions. It starts with a detailed discussion of the structural conservatism in the final standard. The exposure value outlined in the first exposure draft 2009 will be interpreted as a fair under amortized cost accounting and consequently provides a valid benchmark. Therefore the ED 2009 is used to quantify conservatism or hidden reserves in the actual implementation of the final standard and to separate operational side-effects from real risk impacts. The second part continues with a quantification of expected credit losses based on Impact of Risk instead of traditional cost of risk . An objective framework is suggested which allows for improved testing of forward looking credit risk estimates during credit cycles. This framework will prove useful to mitigate overly pro-cyclical provisioning and earnings volatility. Finally, an LGD monitoring and backtesting approach applicable for regulatory requirements and accounting standards is proposed. On basis of the NPL Backtest, which is part of the Impact of Risk concept , specific key risk indicators are introduced that allow for a detailed assessment of collections performance versus LGD in bucket 3.", "after_revision": "After the release of the final accounting standards for impairment in July 2014 by the IASB, banks will face the next significant methodological challenge after Basel 2. The presented work shares some first methodological thoughts and proposes ways how to approach underlying questions. It starts with a detailed discussion of the structural conservatism in the final standard. The exposure value as outlined in the IFRS 9 exposure draft (ED 2009 ) will be interpreted as an economically justified value under amortized cost accounting and provides the main methodological benchmark. Consequently, the ED 2009 can be used to quantify conservatism (ie hidden reserves) in the actual implementation of the final standard and to separate operational side-effects caused by the local implementation from actual credit risk impacts. The second part continues with a quantification of expected credit losses based on Impact of Risk instead of traditional cost of risk measures . An objective framework is suggested which allows for improved testing of forward looking credit risk estimates during credit cycles. This framework will prove useful to mitigate overly pro-cyclical provisioning and to reduce earnings volatility. Finally, an LGD monitoring and backtesting approach , applicable under regulatory requirements and accounting standards as well, is proposed. On basis of the NPL Backtest, part of the Impact of Risk framework , specific key risk indicators are introduced that allow for a detailed assessment of collections performance versus LGD in in NPL portfolio (bucket 3).", "edit_actions": [{"type": "R", "before": "another", "after": "the next", "start_char_pos": 109, "end_char_pos": 116}, {"type": "A", "before": null, "after": "as", "start_char_pos": 396, "end_char_pos": 396}, {"type": "R", "before": "first exposure draft", "after": "IFRS 9 exposure draft (ED", "start_char_pos": 413, "end_char_pos": 433}, {"type": "A", "before": null, "after": ")", "start_char_pos": 439, "end_char_pos": 439}, {"type": "R", "before": "a fair", "after": "an economically justified value", "start_char_pos": 463, "end_char_pos": 469}, {"type": "R", "before": "consequently provides a valid benchmark. Therefore", "after": "provides the main methodological benchmark. Consequently,", "start_char_pos": 506, "end_char_pos": 556}, {"type": "R", "before": "is", "after": "can be", "start_char_pos": 569, "end_char_pos": 571}, {"type": "R", "before": "or hidden reserves", "after": "(ie hidden reserves)", "start_char_pos": 602, "end_char_pos": 620}, {"type": "R", "before": "from real", "after": "caused by the local implementation from actual credit", "start_char_pos": 713, "end_char_pos": 722}, {"type": "A", "before": null, "after": "measures", "start_char_pos": 871, "end_char_pos": 871}, {"type": "A", "before": null, "after": "to reduce", "start_char_pos": 1089, "end_char_pos": 1089}, {"type": "R", "before": "applicable for", "after": ", applicable under", "start_char_pos": 1163, "end_char_pos": 1177}, {"type": "A", "before": null, "after": "as well,", "start_char_pos": 1227, "end_char_pos": 1227}, {"type": "D", "before": "which is", "after": null, "start_char_pos": 1271, "end_char_pos": 1279}, {"type": "R", "before": "concept", "after": "framework", "start_char_pos": 1307, "end_char_pos": 1314}, {"type": "R", "before": "bucket 3.", "after": "in NPL portfolio (bucket 3).", "start_char_pos": 1439, "end_char_pos": 1448}], "sents_char_pos": [0, 168, 285, 376, 546, 736, 873, 1006, 1110, 1240]} {"doc_id": "1411.4606", "revision_depth": "1", "before_revision": "Risk premium is one of main concepts in mathematical finance. It is a measure of the trade-offs investors make between return and risk and is defined by the excess return over the risk-free interest rate earned per one unit of risk of an asset . The purpose of this article is to find the upper and lower bounds of the risk premium of an asset based on the prices of options in the market . One of key assumptions to achieve this is that the market is Markovian. Under this assumption, we can transform the problem into a problem of a second-order differential equation and then obtain the upper and lower bounds by analyzing the differential equation.", "after_revision": "The risk premium is one of main concepts in mathematical finance. It is a measure of the trade-offs investors make between return and risk and is defined by the excess return relative to the risk-free interest rate that is earned from an asset per one unit of risk . The purpose of this article is to determine upper and lower bounds on the risk premium of an asset based on the market prices of options . One of the key assumptions to achieve this goal is that the market is Markovian. Under this assumption, we can transform the problem of finding the bounds into a second-order differential equation . We then obtain upper and lower bounds on the risk premium by analyzing the differential equation.", "edit_actions": [{"type": "R", "before": "Risk", "after": "The risk", "start_char_pos": 0, "end_char_pos": 4}, {"type": "R", "before": "over", "after": "relative to", "start_char_pos": 171, "end_char_pos": 175}, {"type": "R", "before": "earned", "after": "that is earned from an asset", "start_char_pos": 204, "end_char_pos": 210}, {"type": "D", "before": "of an asset", "after": null, "start_char_pos": 232, "end_char_pos": 243}, {"type": "R", "before": "find the", "after": "determine", "start_char_pos": 280, "end_char_pos": 288}, {"type": "R", "before": "of", "after": "on", "start_char_pos": 312, "end_char_pos": 314}, {"type": "A", "before": null, "after": "market", "start_char_pos": 357, "end_char_pos": 357}, {"type": "D", "before": "in the market", "after": null, "start_char_pos": 376, "end_char_pos": 389}, {"type": "A", "before": null, "after": "the", "start_char_pos": 399, "end_char_pos": 399}, {"type": "A", "before": null, "after": "goal", "start_char_pos": 432, "end_char_pos": 432}, {"type": "R", "before": "into a problem of a", "after": "of finding the bounds into a", "start_char_pos": 518, "end_char_pos": 537}, {"type": "R", "before": "and then obtain the", "after": ". We then obtain", "start_char_pos": 573, "end_char_pos": 592}, {"type": "A", "before": null, "after": "on the risk premium", "start_char_pos": 616, "end_char_pos": 616}], "sents_char_pos": [0, 61, 245, 391, 465]} {"doc_id": "1501.07473", "revision_depth": "1", "before_revision": "Stock prices will rarely follow the assumed model but, when stock's transaction times are dense in the interval t_0,T), they determine risk neutral probability (-ies) {\\cal P}^* for the stock price at time T . The remaining available risk neutral probabilities at T correspond to stock prices with different jumps-variability . The findings indicate that {\\cal P}^* may be a mixture. The necessary and suficient condition used to obtain {\\cal P}^* is related with the flow of information and concepts in Market Manipulation; it contributes in understanding the relation between market informational efficiency and the arbitrage-free option pricing methodology. {\\cal P}^*-price C for the stock's European call option expiring at T is also obtained. For \"calm\" stock prices, C coincides with the Black-Scholes-Merton price and confirms its universal validity without stock price modeling assumptions. Additional results for calm stock : a) show that volatility's role is fundamental in the call's transaction, b) clarify the behaviors of the trader and the call's buyerand c) confirm quantitatively that the buyer 's price carries an exponentially increasing volatility premium.", "after_revision": "The price of a stock will rarely follow the assumed model and a curious investor or a Regulatory Authority may wish to obtain a probability model the prices support. A risk neutral probability {\\cal P}^* for the stock 's price at time T is determined in closed form from the prices before T without assuming a price model . The findings indicate that {\\cal P}^* may be a mixture. Under mild conditions on the prices the necessary and sufficient condition to obtain {\\cal P}^* is the coincidence at T of the stock price ranges assumed by the stock's trader and buyer. This result clarifies the relation between market 's informational efficiency and the arbitrage-free option pricing methodology. It also shows that in an incomplete market there are risk neutral probabilities not supported by each stock and their use can be limited. {\\cal P}^*-price C for the stock's European call option expiring at T is obtained. Among other results it is shown for \"calm\" prices, like the log-normal, that i) C is the Black-Scholes-Merton price thus confirming its validity for various stock prices, ii) the buyer 's price carries an exponentially increasing volatility premium and its difference with C provides a measure of the market risk premium.", "edit_actions": [{"type": "R", "before": "Stock prices", "after": "The price of a stock", "start_char_pos": 0, "end_char_pos": 12}, {"type": "D", "before": "but, when stock's transaction times are dense in the interval", "after": null, "start_char_pos": 50, "end_char_pos": 111}, {"type": "R", "before": "t_0,T), they determine", "after": "and a curious investor or a Regulatory Authority may wish to obtain a probability model the prices support. A", "start_char_pos": 112, "end_char_pos": 134}, {"type": "D", "before": "(-ies)", "after": null, "start_char_pos": 160, "end_char_pos": 166}, {"type": "A", "before": null, "after": "'s", "start_char_pos": 192, "end_char_pos": 192}, {"type": "R", "before": ". The remaining available risk neutral probabilities at T correspond to stock prices with different jumps-variability", "after": "is determined in closed form from the prices before T without assuming a price model", "start_char_pos": 209, "end_char_pos": 326}, {"type": "R", "before": "The necessary and suficient condition used", "after": "Under mild conditions on the prices the necessary and sufficient condition", "start_char_pos": 385, "end_char_pos": 427}, {"type": "D", "before": "related with the flow of information and concepts in Market Manipulation; it contributes in understanding", "after": null, "start_char_pos": 452, "end_char_pos": 557}, {"type": "A", "before": null, "after": "coincidence at T of the stock price ranges assumed by the stock's trader and buyer. This result clarifies the", "start_char_pos": 562, "end_char_pos": 562}, {"type": "A", "before": null, "after": "'s", "start_char_pos": 587, "end_char_pos": 587}, {"type": "A", "before": null, "after": "It also shows that in an incomplete market there are risk neutral probabilities not supported by each stock and their use can be limited.", "start_char_pos": 664, "end_char_pos": 664}, {"type": "R", "before": "also obtained. For", "after": "obtained. Among other results it is shown for", "start_char_pos": 738, "end_char_pos": 756}, {"type": "R", "before": "stock prices, C coincides with", "after": "prices, like the log-normal, that i) C is", "start_char_pos": 764, "end_char_pos": 794}, {"type": "R", "before": "and confirms its universal validity without stock price modeling assumptions. Additional results for calm stock : a) show that volatility's role is fundamental in the call's transaction, b) clarify the behaviors of the trader and the call's buyerand c) confirm quantitatively that the buyer", "after": "thus confirming its validity for various stock prices, ii) the buyer", "start_char_pos": 826, "end_char_pos": 1116}, {"type": "A", "before": null, "after": "premium and its difference with C provides a measure of the market risk", "start_char_pos": 1173, "end_char_pos": 1173}], "sents_char_pos": [0, 328, 384, 525, 663, 752, 903]} {"doc_id": "1502.03455", "revision_depth": "1", "before_revision": "Software-defined networking (SDN) enables network and data center (DC) providers with a flexible management of networking resources . SDN is also an appropriate solution for network virtualization since in this way each network component can be placed in a software container . In this paper, we address some of the existing issues with the classic DC network topologies to be used in virtualized environment, and then investigate a group of DC network topologies with the capability of providing dynamic structures according to the service-level required depending on the active traffic in a virtual DC network. In particular, we propose three main approaches to modify the structure of a classic BCube topology used as a benchmark. The associated structural features and maximum achievable interconnected bandwidth of these modifications is studied for various routing scenarios. Finally, we run an extensive simulation program to check the performance of the proposed modified topologies in a simulation environment which considers failure of components and also traffic congestion. Our simulation experiments show the efficiency of the proposed modified topologies compared to the classic BCube in terms of the available bandwidth and failure resiliency , as expected .", "after_revision": "Network virtualization enables computing networks and data center (DC) providers to manage their networking resources in a flexible manner using software running on physical computers . In this paper, we address the existing issues with the classic DC network topologies in virtualized environment, and investigate a set of DC network topologies with the capability of providing dynamic structures according to the service-level required by the active traffic in a virtual DC network. In particular, we propose three main approaches to modify the structure of a classic BCube topology as a topology benchmark, and investigate their associated structural features and maximum achievable interconnected bandwidth for different routing scenarios. Finally, we run an extensive simulation program to check the performance of the proposed modified topologies in a simulation environment which considers failure analysis and also traffic congestion. Our simulation experiments , which are consistent to our design goals, show the efficiency of the proposed modified topologies comparing to the classic BCube in terms of bandwidth availability and failure resiliency .", "edit_actions": [{"type": "R", "before": "Software-defined networking (SDN) enables network", "after": "Network virtualization enables computing networks", "start_char_pos": 0, "end_char_pos": 49}, {"type": "R", "before": "with a flexible management of networking resources . SDN is also an appropriate solution for network virtualization since in this way each network component can be placed in a software container", "after": "to manage their networking resources in a flexible manner using software running on physical computers", "start_char_pos": 81, "end_char_pos": 275}, {"type": "D", "before": "some of", "after": null, "start_char_pos": 304, "end_char_pos": 311}, {"type": "D", "before": "to be used", "after": null, "start_char_pos": 371, "end_char_pos": 381}, {"type": "R", "before": "then investigate a group", "after": "investigate a set", "start_char_pos": 414, "end_char_pos": 438}, {"type": "R", "before": "depending on", "after": "by", "start_char_pos": 556, "end_char_pos": 568}, {"type": "R", "before": "used as a benchmark. The", "after": "as a topology benchmark, and investigate their", "start_char_pos": 713, "end_char_pos": 737}, {"type": "R", "before": "of these modifications is studied for various", "after": "for different", "start_char_pos": 817, "end_char_pos": 862}, {"type": "R", "before": "of components", "after": "analysis", "start_char_pos": 1043, "end_char_pos": 1056}, {"type": "A", "before": null, "after": ", which are consistent to our design goals,", "start_char_pos": 1113, "end_char_pos": 1113}, {"type": "R", "before": "compared", "after": "comparing", "start_char_pos": 1170, "end_char_pos": 1178}, {"type": "R", "before": "the available bandwidth", "after": "bandwidth availability", "start_char_pos": 1212, "end_char_pos": 1235}, {"type": "D", "before": ", as expected", "after": null, "start_char_pos": 1259, "end_char_pos": 1272}], "sents_char_pos": [0, 277, 612, 733, 881, 1085]} {"doc_id": "1503.00529", "revision_depth": "1", "before_revision": "Populations of species in ecosystems are constrained by the availability of resources within their environment. In effect this means that a growth of one population, needs to be balanced by the reduction in size of others. In neutral models of biodiversity all populations are assumed to change incrementally due to stochastic births and deaths of individuals. Here we propose and model another redistribution mechanism driven by abrupt collapses of the entire population of a single species freeing up resources for the remaining ones. This mechanism may be relevant for communities of bacteria, with strain-specific collapses caused e.g. by invading bacteriophages, or for other ecosystems where infectious diseases play an important role. The emergent property of the population dynamics in our system are cyclic \"diversity waves\" triggered by collapses of globally dominating populations. The population diversity in the environment peaks at the beginning of each wave and exponentially decreases afterwards. Population sizes in our system follow a bimodal distribution with the lower peak composed of the recently collapsed or the newly arrived species. In contrast to this, the upper peak of the distribution consists of the surviving species in the current diversity wave. The populations of the most abundant species in the upper peak exhibit a scale-free distribution with a nearly universal exponent of about 1.7. We show that our model is robust with respect to variations in dynamical rules including gradual redistribution of populations between subsequent collapses and variation in species' growth or collapse rates .", "after_revision": "Populations of species in ecosystems are often constrained by availability of resources within their environment. In effect this means that a growth of one population, needs to be balanced by comparable reduction in populations of others. In neutral models of biodiversity all populations are assumed to change incrementally due to stochastic births and deaths of individuals. Here we propose and model another redistribution mechanism driven by abrupt and severe collapses of the entire population of a single species freeing up resources for the remaining ones. This mechanism may be relevant e.g. for communities of bacteria, with strain-specific collapses caused e.g. by invading bacteriophages, or for other ecosystems where infectious diseases play an important role. The emergent dynamics of our system is cyclic \"diversity waves\" triggered by collapses of globally dominating populations. The population diversity peaks at the beginning of each wave and exponentially decreases afterwards. Species abundances are characterized by a bimodal time-aggregated distribution with the lower peak formed by populations of recently collapsed or newly introduced species, while the upper peak - species that has not yet collapsed in the current wave. In most waves both upper and lower peaks are composed of several smaller peaks. This URLanized hierarchical peak structure has a long-term memory transmitted across several waves. It gives rise to a scale-free tail of the time-aggregated population distribution with a universal exponent of 1.7. We show that diversity wave dynamics is robust with respect to variations in the rules of our model such as diffusion between multiple environments, species-specific growth and extinction rates, and bet-hedging strategies .", "edit_actions": [{"type": "R", "before": "constrained by the", "after": "often constrained by", "start_char_pos": 41, "end_char_pos": 59}, {"type": "R", "before": "the reduction in size", "after": "comparable reduction in populations", "start_char_pos": 190, "end_char_pos": 211}, {"type": "A", "before": null, "after": "and severe", "start_char_pos": 437, "end_char_pos": 437}, {"type": "A", "before": null, "after": "e.g.", "start_char_pos": 569, "end_char_pos": 569}, {"type": "R", "before": "property of the population dynamics in our system are", "after": "dynamics of our system is", "start_char_pos": 757, "end_char_pos": 810}, {"type": "D", "before": "in the environment", "after": null, "start_char_pos": 920, "end_char_pos": 938}, {"type": "R", "before": "Population sizes in our system follow a bimodal", "after": "Species abundances are characterized by a bimodal time-aggregated", "start_char_pos": 1015, "end_char_pos": 1062}, {"type": "R", "before": "composed of the", "after": "formed by populations of", "start_char_pos": 1096, "end_char_pos": 1111}, {"type": "R", "before": "the newly arrived species. In contrast to this,", "after": "newly introduced species, while", "start_char_pos": 1134, "end_char_pos": 1181}, {"type": "R", "before": "of the distribution consists of the surviving species", "after": "- species that has not yet collapsed", "start_char_pos": 1197, "end_char_pos": 1250}, {"type": "R", "before": "diversity wave. The populations of the most abundant species in the upper peak exhibit a", "after": "wave. In most waves both upper and lower peaks are composed of several smaller peaks. This URLanized hierarchical peak structure has a long-term memory transmitted across several waves. It gives rise to a", "start_char_pos": 1266, "end_char_pos": 1354}, {"type": "A", "before": null, "after": "tail of the time-aggregated population", "start_char_pos": 1366, "end_char_pos": 1366}, {"type": "D", "before": "nearly", "after": null, "start_char_pos": 1387, "end_char_pos": 1393}, {"type": "D", "before": "about", "after": null, "start_char_pos": 1416, "end_char_pos": 1421}, {"type": "R", "before": "our model", "after": "diversity wave dynamics", "start_char_pos": 1440, "end_char_pos": 1449}, {"type": "R", "before": "dynamical rules including gradual redistribution of populations between subsequent collapses and variation in species' growth or collapse rates", "after": "the rules of our model such as diffusion between multiple environments, species-specific growth and extinction rates, and bet-hedging strategies", "start_char_pos": 1490, "end_char_pos": 1633}], "sents_char_pos": [0, 111, 222, 360, 537, 743, 894, 1014, 1160, 1281, 1426]} {"doc_id": "1503.08809", "revision_depth": "1", "before_revision": "We study the optimisation and porting of the \"Modal\" code on Intel(R) Xeon(R) processors and /or Intel(R) Xeon Phi(TM) coprocessors using methods which should be applicable to more general compute bound codes. \"Modal\" is used by the Planck satellite experiment for constraining general non-Gaussian models of the early universe via the bispectrum of the cosmic microwave background . We focus on the hot-spot of the code which is the projection of bispectra from the end of inflation to spherical shell at decoupling which defines the CMB we observe . This code involves a three-dimensional inner product between two functions, one of which requires an integral, on a non-rectangular sparse domain . We show that by employing separable methods this calculation can be reduced to a one dimensional summation plus two integrations reducing the dimensionality from four to three. The introduction of separable functions also solves the issue of the domain allowing efficient vectorisation and load balancing. This method becomes unstable in certain cases and so we present a discussion of the optimisation of both approaches. By making bispectrum calculations competitive with those for the power spectrum we are now able to consider joint analysis for cosmological science exploitation of new data. We demonstrate speed-ups of over 100x, arising from a combination of algorithmic improvements and architecture-aware optimizations targeted at improving thread and vectorization behaviour. The resulting MPI/OpenMP code is capable of executing on clusters containing Intel(R) Xeon(R) processors and/or Intel(R) Xeon Phi(TM) coprocessors, with strong-scaling efficiency of 98.6\\% on up to 16 nodes. We find that a single coprocessor outperforms two processor sockets by a factor of 1.3x and that running the same code across a combination of processors and coprocessors improves performance-per-node by a factor of 3.38x .", "after_revision": "We present a case study describing efforts to optimise and modernise \"Modal\" , the simulation and analysis pipeline used by the Planck satellite experiment for constraining general non-Gaussian models of the early universe via the bispectrum (or three-point correlator) of the cosmic microwave background radiation . We focus on one particular element of the code : the projection of bispectra from the end of inflation to the spherical shell at decoupling , which defines the CMB we observe today . This code involves a three-dimensional inner product between two functions, one of which requires an integral, on a non-rectangular domain containing a sparse grid . We show that by employing separable methods this calculation can be reduced to a one-dimensional summation plus two integrations , reducing the overall dimensionality from four to three. The introduction of separable functions also solves the issue of the non-rectangular sparse grid. This separable method can become unstable in certain cases and so the slower non-separable integral must be calculated instead. We present a discussion of the optimisation of both approaches. We show significant speed-ups of ~ 100x, arising from a combination of algorithmic improvements and architecture-aware optimisations targeted at improving thread and vectorisation behaviour. The resulting MPI/OpenMP hybrid code is capable of executing on clusters containing processors and/or coprocessors, with strong-scaling efficiency of 98.6\\% on up to 16 nodes. We find that a single coprocessor outperforms two processor sockets by a factor of 1.3x and that running the same code across a combination of both microarchitectures improves performance-per-node by a factor of 3.38x . By making bispectrum calculations competitive with those for the power spectrum (or two-point correlator) we are now able to consider joint analysis for cosmological science exploitation of new data .", "edit_actions": [{"type": "R", "before": "study the optimisation and porting of the", "after": "present a case study describing efforts to optimise and modernise", "start_char_pos": 3, "end_char_pos": 44}, {"type": "R", "before": "code on Intel(R) Xeon(R) processors and /or Intel(R) Xeon Phi(TM) coprocessors using methods which should be applicable to more general compute bound codes. \"Modal\" is", "after": ", the simulation and analysis pipeline", "start_char_pos": 53, "end_char_pos": 220}, {"type": "A", "before": null, "after": "(or three-point correlator)", "start_char_pos": 347, "end_char_pos": 347}, {"type": "A", "before": null, "after": "radiation", "start_char_pos": 383, "end_char_pos": 383}, {"type": "R", "before": "the hot-spot", "after": "one particular element", "start_char_pos": 398, "end_char_pos": 410}, {"type": "R", "before": "which is", "after": ":", "start_char_pos": 423, "end_char_pos": 431}, {"type": "A", "before": null, "after": "the", "start_char_pos": 489, "end_char_pos": 489}, {"type": "A", "before": null, "after": ",", "start_char_pos": 520, "end_char_pos": 520}, {"type": "A", "before": null, "after": "today", "start_char_pos": 554, "end_char_pos": 554}, {"type": "R", "before": "sparse domain", "after": "domain containing a sparse grid", "start_char_pos": 689, "end_char_pos": 702}, {"type": "R", "before": "one dimensional", "after": "one-dimensional", "start_char_pos": 786, "end_char_pos": 801}, {"type": "R", "before": "reducing the", "after": ", reducing the overall", "start_char_pos": 834, "end_char_pos": 846}, {"type": "R", "before": "domain allowing efficient vectorisation and load balancing. This method becomes", "after": "non-rectangular sparse grid. This separable method can become", "start_char_pos": 951, "end_char_pos": 1030}, {"type": "R", "before": "we", "after": "the slower non-separable integral must be calculated instead. We", "start_char_pos": 1064, "end_char_pos": 1066}, {"type": "R", "before": "By making bispectrum calculations competitive with those for the power spectrum we are now able to consider joint analysis for cosmological science exploitation of new data. We demonstrate", "after": "We show significant", "start_char_pos": 1128, "end_char_pos": 1316}, {"type": "R", "before": "over", "after": "~", "start_char_pos": 1330, "end_char_pos": 1334}, {"type": "R", "before": "optimizations", "after": "optimisations", "start_char_pos": 1419, "end_char_pos": 1432}, {"type": "R", "before": "vectorization", "after": "vectorisation", "start_char_pos": 1466, "end_char_pos": 1479}, {"type": "A", "before": null, "after": "hybrid", "start_char_pos": 1516, "end_char_pos": 1516}, {"type": "D", "before": "Intel(R) Xeon(R)", "after": null, "start_char_pos": 1569, "end_char_pos": 1585}, {"type": "D", "before": "Intel(R) Xeon Phi(TM)", "after": null, "start_char_pos": 1604, "end_char_pos": 1625}, {"type": "R", "before": "processors and coprocessors", "after": "both microarchitectures", "start_char_pos": 1843, "end_char_pos": 1870}, {"type": "A", "before": null, "after": ". By making bispectrum calculations competitive with those for the power spectrum (or two-point correlator) we are now able to consider joint analysis for cosmological science exploitation of new data", "start_char_pos": 1922, "end_char_pos": 1922}], "sents_char_pos": [0, 209, 385, 556, 704, 881, 1010, 1127, 1301, 1490, 1699]} {"doc_id": "1504.04433", "revision_depth": "1", "before_revision": "As an important information for traffic condition evaluation, trip planning, transportation management, etc., average travel speed for a road means the average speed of vehicles travelling through this road in a given time duration. Traditional ways for collecting travel-speed oriented traffic data are always infrastructure-based and therefore financial costly (for example, cameras and loop detectors) . Differently, vehicular crowdsensing as an infrastructure-free way, can be used to collect data including real-time locations and velocities of vehicles for road travel speed estimation, which is a quite low-cost way. However, vehicular crowdsensing data is always coarse-grained. This coarseness can lead to the incompleteness of travel speed estimation . Aiming to handle the incompleteness problem as well as estimate travel speed accurately, in this paper, we propose an approach named STC in which spatial-temporal correlation among travel speeds of roads is leveraged. More specifically, in STC, we use cross correlation function to quantize the correlation among roads. Noticing the directional patterns of traffic feature diffusion , we novelly make the determination of the time lagging factor in cross correlation calculation self-adaptive by using vehicle tracking . Then, utilizing the local stationarity of cross correlation, we further reduce the problem of single-road travel speed vacancy completion to a minimization problem. Finally, we fill all the vacancies of travel speed for roads in a recursive way using the geomet-rical structure of road net. Elaborate experiments based on real taxi trace data show that STC can commendably settle the incompleteness problem of vehicle crowdsensing data based travel speed estimation and ensure the accuracy of estimated travel speed , in comparison with representative existing methods .", "after_revision": "As an important information for traffic condition evaluation, trip planning, transportation management, etc., average travel speed for a road means the average speed of vehicles travelling through this road in a given time duration. Traditional ways for collecting travel-speed oriented traffic data always depend on dedicated sensors and supporting infrastructures, and are therefore financial costly . Differently, vehicular crowdsensing as an infrastructure-free way, can be used to collect data including real-time locations and velocities of vehicles for road travel speed estimation, which is a quite low-cost way. However, vehicular crowdsensing data is always coarse-grained. This coarseness can lead to the incompleteness of travel speeds . Aiming to handle this problem as well as estimate travel speed accurately, in this paper, we propose an approach named STC that exploits the spatial-temporal correlation among travel speeds for roads by introducing the time-lagged cross correlation function . The time lagging factor describes the time consumption of traffic feature diffusion along roads. To properly calculate cross correlation , we novelly make the determination of the time lagging factor self-adaptive by recording the locations of vehicles at different roads . Then, utilizing the local stationarity of cross correlation, we further reduce the problem of single-road travel speed vacancy completion to a minimization problem. Finally, we fill all the vacancies of travel speed for roads in a recursive way using the geometric structure of road net. Elaborate experiments based on real taxi trace data show that STC can settle the incompleteness problem of vehicle crowdsensing data based travel speed estimation and ensure the accuracy of estimated travel speed better , in comparison with representative existing methods such as KNN, Kriging and ARIMA .", "edit_actions": [{"type": "R", "before": "are always infrastructure-based and", "after": "always depend on dedicated sensors and supporting infrastructures, and are", "start_char_pos": 300, "end_char_pos": 335}, {"type": "D", "before": "(for example, cameras and loop detectors)", "after": null, "start_char_pos": 363, "end_char_pos": 404}, {"type": "R", "before": "speed estimation", "after": "speeds", "start_char_pos": 744, "end_char_pos": 760}, {"type": "R", "before": "the incompleteness", "after": "this", "start_char_pos": 780, "end_char_pos": 798}, {"type": "R", "before": "in which", "after": "that exploits the", "start_char_pos": 900, "end_char_pos": 908}, {"type": "R", "before": "of roads is leveraged. More specifically, in STC, we use", "after": "for roads by introducing the time-lagged", "start_char_pos": 958, "end_char_pos": 1014}, {"type": "R", "before": "to quantize the correlation among roads. Noticing the directional patterns", "after": ". The time lagging factor describes the time consumption", "start_char_pos": 1042, "end_char_pos": 1116}, {"type": "A", "before": null, "after": "along roads. To properly calculate cross correlation", "start_char_pos": 1146, "end_char_pos": 1146}, {"type": "D", "before": "in cross correlation calculation", "after": null, "start_char_pos": 1210, "end_char_pos": 1242}, {"type": "R", "before": "using vehicle tracking", "after": "recording the locations of vehicles at different roads", "start_char_pos": 1260, "end_char_pos": 1282}, {"type": "R", "before": "geomet-rical", "after": "geometric", "start_char_pos": 1540, "end_char_pos": 1552}, {"type": "D", "before": "commendably", "after": null, "start_char_pos": 1646, "end_char_pos": 1657}, {"type": "A", "before": null, "after": "better", "start_char_pos": 1801, "end_char_pos": 1801}, {"type": "A", "before": null, "after": "such as KNN, Kriging and ARIMA", "start_char_pos": 1855, "end_char_pos": 1855}], "sents_char_pos": [0, 232, 406, 623, 686, 762, 980, 1082, 1284, 1449, 1575]} {"doc_id": "1504.06249", "revision_depth": "1", "before_revision": "Network biology approaches have over the last decade proven to be very useful for the integration and generation of functional hypothesis by providing a context for specific molecular components and processes. Recent experimental and computational techniques yield networksof increased size and sophistication. The study of these complex cellular networks is emerging as a new challenge in biology. A number of dimensionality reduction techniques for graphs have been developed to cope with complexity of networks . However, it is yet not clear to what extent information is lost or preserved when these techniques are applied to reduce the complexity of large networks . Here we therefore develop a rigorous framework, based on algorithmic information theory, to quantify the capability to preserve information when network motif analysis, graph spectra and sparsification methods respectively, are applied to over twenty different well-established networks. We find that the sparsification method is highly sensitive to deletion of edges leading to significant inconsistencies with respect to the loss of information and that graph spectral methods were the most irregular measure only capturing algebraic information in a condensed fashion but in that process largely lost the information content of the original networks. Our algorithmic information methodology therefore provides a rigorous framework enabling fundamental assessment and comparison between different methods for reducing the complexity of networks while preserving key structures in the networks thereby facilitating the identification of such core processes .", "after_revision": "To cope with the complexity of large networks, a number of dimensionality reduction techniques for graphs have been developed . However, the extent to which information is lost or preserved when these techniques are employed has not yet been clear . Here we develop a framework, based on algorithmic information theory, to quantify the extent to which information is preserved when network motif analysis, graph spectra and spectral sparsification methods are applied to over twenty different biological and artificial networks. We find that the spectral sparsification is highly sensitive to high number of edge deletion, leading to significant inconsistencies , and that graph spectral methods are the most irregular , capturing algebraic information in a condensed fashion but largely losing most of the information content of the original networks. However, the approach shows that network motif analysis excels at preserving the relative algorithmic information content of a network, hence validating and generalizing the remarkable fact that despite their inherent combinatorial possibilities, local regularities preserve information to such an extent that essential properties are fully recoverable across different networks to determine their family group to which they belong to (eg genetic vs social network). Our algorithmic information methodology thus provides a rigorous framework enabling a fundamental assessment and comparison between different data dimensionality reduction methods thereby facilitating the identification and evaluation of the capabilities of old and new methods .", "edit_actions": [{"type": "R", "before": "Network biology approaches have over the last decade proven to be very useful for the integration and generation of functional hypothesis by providing a context for specific molecular components and processes. Recent experimental and computational techniques yield networksof increased size and sophistication. The study of these complex cellular networks is emerging as a new challenge in biology. A", "after": "To cope with the complexity of large networks, a", "start_char_pos": 0, "end_char_pos": 400}, {"type": "D", "before": "to cope with complexity of networks", "after": null, "start_char_pos": 478, "end_char_pos": 513}, {"type": "R", "before": "it is yet not clear to what extent", "after": "the extent to which", "start_char_pos": 525, "end_char_pos": 559}, {"type": "R", "before": "applied to reduce the complexity of large networks", "after": "employed has not yet been clear", "start_char_pos": 619, "end_char_pos": 669}, {"type": "R", "before": "therefore develop a rigorous", "after": "develop a", "start_char_pos": 680, "end_char_pos": 708}, {"type": "R", "before": "capability to preserve information", "after": "extent to which information is preserved", "start_char_pos": 777, "end_char_pos": 811}, {"type": "R", "before": "sparsification methods respectively,", "after": "spectral sparsification methods", "start_char_pos": 859, "end_char_pos": 895}, {"type": "R", "before": "well-established", "after": "biological and artificial", "start_char_pos": 933, "end_char_pos": 949}, {"type": "R", "before": "sparsification method", "after": "spectral sparsification", "start_char_pos": 977, "end_char_pos": 998}, {"type": "R", "before": "deletion of edges", "after": "high number of edge deletion,", "start_char_pos": 1022, "end_char_pos": 1039}, {"type": "R", "before": "with respect to the loss of information", "after": ",", "start_char_pos": 1079, "end_char_pos": 1118}, {"type": "R", "before": "were", "after": "are", "start_char_pos": 1151, "end_char_pos": 1155}, {"type": "R", "before": "measure only", "after": ",", "start_char_pos": 1175, "end_char_pos": 1187}, {"type": "R", "before": "in that process largely lost", "after": "largely losing most of", "start_char_pos": 1247, "end_char_pos": 1275}, {"type": "A", "before": null, "after": "However, the approach shows that network motif analysis excels at preserving the relative algorithmic information content of a network, hence validating and generalizing the remarkable fact that despite their inherent combinatorial possibilities, local regularities preserve information to such an extent that essential properties are fully recoverable across different networks to determine their family group to which they belong to (eg genetic vs social network).", "start_char_pos": 1326, "end_char_pos": 1326}, {"type": "R", "before": "therefore", "after": "thus", "start_char_pos": 1367, "end_char_pos": 1376}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1416, "end_char_pos": 1416}, {"type": "R", "before": "methods for reducing the complexity of networks while preserving key structures in the networks", "after": "data dimensionality reduction methods", "start_char_pos": 1473, "end_char_pos": 1568}, {"type": "R", "before": "of such core processes", "after": "and evaluation of the capabilities of old and new methods", "start_char_pos": 1609, "end_char_pos": 1631}], "sents_char_pos": [0, 209, 310, 398, 515, 671, 959, 1325]} {"doc_id": "1507.00150", "revision_depth": "1", "before_revision": "Ligand diffusion through a protein interior is a fundamental process governing biological signaling and enzymatic catalysis. A complex topology of channels in proteins leads often to difficulties in modeling ligand escape pathways by classical molecular dynamics simulations. In this paper two novel memetic methods for searching the exit paths and cavity space exploration are proposed: Memory Enhanced Random Acceleration (MERA)Molecular Dynamics and Immune Algorithm (IA ). In MERA, a pheromone concept is introduced to optimize an expulsion force. In IA , hybrid learning protocols are exploited to predict ligand exit paths. They are tested on three protein channels with increasing complexity : M2 muscarinic GPCR receptor, enzyme nitrile hydrataseand heme-protein cytochrome P450cam. In these cases, the memetic methods outperform Simulated Annealing and Random Acceleration Molecular Dynamics . The proposed algorithms are general and appropriate in all problems where an accelerated transport of an object through a network of channels is studied .", "after_revision": "Ligand diffusion through proteins is a fundamental process governing biological signaling and enzymatic catalysis. The complex topology of protein tunnels results in difficulties with computing ligand escape pathways by standard molecular dynamics (MD) simulations. Here, two novel methods for searching of ligand exit pathways and cavity exploration are proposed: memory random acceleration MD (mRAMD), and memetic algorithms (MA ). In mRAMD, finding exit pathways is based on a non-Markovian biasing that is introduced to optimize the unbinding force. In MA , hybrid learning protocols are exploited to predict optimal ligand exit paths. The methods are tested on three proteins with increasing complexity of tunnels : M2 muscarinic receptor, nitrile hydratase, and cytochrome P450cam. In these cases, the proposed methods outperform standard techniques that are used currently to find ligand egress pathways . The proposed approach is general and appropriate for accelerated transport of an object through a network of protein tunnels .", "edit_actions": [{"type": "R", "before": "a protein interior", "after": "proteins", "start_char_pos": 25, "end_char_pos": 43}, {"type": "R", "before": "A", "after": "The", "start_char_pos": 125, "end_char_pos": 126}, {"type": "R", "before": "channels in proteins leads often to difficulties in modeling", "after": "protein tunnels results in difficulties with computing", "start_char_pos": 147, "end_char_pos": 207}, {"type": "R", "before": "classical molecular dynamics simulations. In this paper two novel memetic", "after": "standard molecular dynamics (MD) simulations. Here, two novel", "start_char_pos": 234, "end_char_pos": 307}, {"type": "R", "before": "the exit paths and cavity space", "after": "of ligand exit pathways and cavity", "start_char_pos": 330, "end_char_pos": 361}, {"type": "R", "before": "Memory Enhanced Random Acceleration (MERA)Molecular Dynamics and Immune Algorithm (IA", "after": "memory random acceleration MD (mRAMD), and memetic algorithms (MA", "start_char_pos": 388, "end_char_pos": 473}, {"type": "R", "before": "MERA, a pheromone concept", "after": "mRAMD, finding exit pathways is based on a non-Markovian biasing that", "start_char_pos": 480, "end_char_pos": 505}, {"type": "R", "before": "an expulsion", "after": "the unbinding", "start_char_pos": 532, "end_char_pos": 544}, {"type": "R", "before": "IA", "after": "MA", "start_char_pos": 555, "end_char_pos": 557}, {"type": "A", "before": null, "after": "optimal", "start_char_pos": 611, "end_char_pos": 611}, {"type": "R", "before": "They", "after": "The methods", "start_char_pos": 631, "end_char_pos": 635}, {"type": "R", "before": "protein channels", "after": "proteins", "start_char_pos": 656, "end_char_pos": 672}, {"type": "A", "before": null, "after": "of tunnels", "start_char_pos": 700, "end_char_pos": 700}, {"type": "R", "before": "GPCR receptor, enzyme nitrile hydrataseand heme-protein", "after": "receptor, nitrile hydratase, and", "start_char_pos": 717, "end_char_pos": 772}, {"type": "R", "before": "memetic methods outperform Simulated Annealing and Random Acceleration Molecular Dynamics", "after": "proposed methods outperform standard techniques that are used currently to find ligand egress pathways", "start_char_pos": 813, "end_char_pos": 902}, {"type": "R", "before": "algorithms are", "after": "approach is", "start_char_pos": 918, "end_char_pos": 932}, {"type": "R", "before": "in all problems where an", "after": "for", "start_char_pos": 957, "end_char_pos": 981}, {"type": "R", "before": "channels is studied", "after": "protein tunnels", "start_char_pos": 1038, "end_char_pos": 1057}], "sents_char_pos": [0, 124, 275, 476, 551, 630, 792, 904]} {"doc_id": "1507.08415", "revision_depth": "1", "before_revision": "We propose a new multiplex-based strategy to integrate different layers of genomic information and use them in a coordinate way to identify driving cancer genes. The multiplex networks that we consider combine transcription factor co-targeting, microRNA co-targeting, protein-protein interaction and gene co-expression networks. The rationale behind this choice is that gene coexpression and protein-protein interactions require a tight coregulation of the partners and that such a fine tuned regulation can be obtained only combining both the transcriptional and post-transcriptional layers of regulation. . To extract the relevant biological information from the multiplex we studied its partition into communities. To this end we applied a consensus clustering algorithm to the single-layer partitions obtained using state of art community detection methods , combined with a filtering preprocessing of the individual networks . Even if our procedure is valid in principle for any pathology in this work we concentrate in particular on the gastric, lung, pancreas and colorectal cancer and identified from the enrichment analysis of the multiplex communities a set of candidate driver cancer genes. Some of them were already known oncogenes while a few are new and represent the major result of our analysis . The combination of the different layers of information allowed us to extract from the multiplex indications on the regulatory pattern and the functional role of both the already known oncogenes and the new candidate driver genes.", "after_revision": "We propose a new multi-network-based strategy to integrate different layers of genomic information and use them in a coordinate way to identify driving cancer genes. The multi-networks that we consider combine transcription factor co-targeting, microRNA co-targeting, protein-protein interaction and gene co-expression networks. The rationale behind this choice is that gene co-expression and protein-protein interactions require a tight coregulation of the partners and that such a fine tuned regulation can be obtained only combining both the transcriptional and post-transcriptional layers of regulation. To extract the relevant biological information from the multi-network we studied its partition into communities. To this end we applied a consensus clustering algorithm based on state of art community detection methods . Even if our procedure is valid in principle for any pathology in this work we concentrate on gastric, lung, pancreas and colorectal cancer and identified from the enrichment analysis of the multi-network communities a set of candidate driver cancer genes. Some of them were already known oncogenes while a few are new . The combination of the different layers of information allowed us to extract from the multi-network indications on the regulatory pattern and functional role of both the already known and the new candidate driver genes.", "edit_actions": [{"type": "R", "before": "multiplex-based", "after": "multi-network-based", "start_char_pos": 17, "end_char_pos": 32}, {"type": "R", "before": "multiplex networks", "after": "multi-networks", "start_char_pos": 166, "end_char_pos": 184}, {"type": "R", "before": "coexpression", "after": "co-expression", "start_char_pos": 375, "end_char_pos": 387}, {"type": "D", "before": ".", "after": null, "start_char_pos": 607, "end_char_pos": 608}, {"type": "R", "before": "multiplex", "after": "multi-network", "start_char_pos": 665, "end_char_pos": 674}, {"type": "R", "before": "to the single-layer partitions obtained using", "after": "based on", "start_char_pos": 774, "end_char_pos": 819}, {"type": "D", "before": ", combined with a filtering preprocessing of the individual networks", "after": null, "start_char_pos": 861, "end_char_pos": 929}, {"type": "R", "before": "in particular on the", "after": "on", "start_char_pos": 1022, "end_char_pos": 1042}, {"type": "R", "before": "multiplex", "after": "multi-network", "start_char_pos": 1140, "end_char_pos": 1149}, {"type": "D", "before": "and represent the major result of our analysis", "after": null, "start_char_pos": 1264, "end_char_pos": 1310}, {"type": "R", "before": "multiplex", "after": "multi-network", "start_char_pos": 1399, "end_char_pos": 1408}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1451, "end_char_pos": 1454}, {"type": "D", "before": "oncogenes", "after": null, "start_char_pos": 1497, "end_char_pos": 1506}], "sents_char_pos": [0, 161, 328, 717, 931, 1201, 1312]} {"doc_id": "1510.03272", "revision_depth": "1", "before_revision": "In a great many of the contexts in which groups of cilia or flagella are found they exhibit synchronized behavior . This includes phase-locking , as seen in Chlamydomonas flagella {\\it , and metachronal wave formation in the ciliary arrays of Paramecium or in the respiratory cilia of URLanisms. Since the observations by Gray and Rothschild of phase synchrony of nearby swimming spermatozoa, it has been a working hypothesis that synchrony arises from hydrodynamic interactions between beating filaments. Recent work on the dynamics of physically separated pairs of flagella isolated from the multicellular alga Volvox {\\it has shown that hydrodynamic coupling alone is sufficient to produce synchrony. Moreover, when the flagellar power strokes are oriented in the same direction they synchronize in-phase, but when opposed they synchronize in antiphase. The situation is more complex when considering multiple flagellaon a single cell. Specifically, the unicellular biflagellate Chlamydomonasswims with opposing power strokes, yet synchronizes in phase in the familiar breaststroke. This indicates{\\it that a mechanism, internal to the cell, provides an additional flagellar coupling. Here we show that in comparison to the wildtype, markedly different synchronization states are found in Chlamydomonas mutants deficient in filamentary connections between basal bodies. Quantitative studies of complex flagellar coordination strategies found in quadri-, octo- and hexadecaflagellates reveal further evidence that intracellular couplings between flagellar basal bodies compete with hydrodynamic interactions to determine the precise form of flagellar synchronization in unicellular algae.", "after_revision": "Cilia and flagella often exhibit synchronized behavior ; this includes phase locking , as seen in {\\it Chlamydomonas , and metachronal wave formation in the respiratory cilia of URLanisms. Since the observations by Gray and Rothschild of phase synchrony of nearby swimming spermatozoa, it has been a working hypothesis that synchrony arises from hydrodynamic interactions between beating filaments. Recent work on the dynamics of physically separated pairs of flagella isolated from the multicellular alga {\\it Volvox has shown that hydrodynamic coupling alone is sufficient to produce synchrony. However, the situation is more complex in URLanisms bearing few flagella. We show that flagella of{\\it Chlamydomonas mutants deficient in filamentary connections between basal bodies display markedly different synchronization from the wild type. We perform micromanipulation on configurations of flagella and conclude that a mechanism, internal to the cell, must provide an additional flagellar coupling. In naturally occurring species with 4, 8, or even 16 flagella, we find diverse symmetries of basal body positioning and of the flagellar apparatus that are coincident with specific gaits of flagellar actuation, suggesting that it is a competition between intracellular coupling and hydrodynamic interactions that ultimately determines the precise form of flagellar coordination in unicellular algae.", "edit_actions": [{"type": "R", "before": "In a great many of the contexts in which groups of cilia or flagella are found they", "after": "Cilia and flagella often", "start_char_pos": 0, "end_char_pos": 83}, {"type": "R", "before": ". This includes phase-locking", "after": "; this includes phase locking", "start_char_pos": 114, "end_char_pos": 143}, {"type": "D", "before": "Chlamydomonas flagella", "after": null, "start_char_pos": 157, "end_char_pos": 179}, {"type": "A", "before": null, "after": "Chlamydomonas", "start_char_pos": 185, "end_char_pos": 185}, {"type": "D", "before": "ciliary arrays of Paramecium or in the", "after": null, "start_char_pos": 226, "end_char_pos": 264}, {"type": "D", "before": "Volvox", "after": null, "start_char_pos": 614, "end_char_pos": 620}, {"type": "A", "before": null, "after": "Volvox", "start_char_pos": 626, "end_char_pos": 626}, {"type": "R", "before": "Moreover, when the flagellar power strokes are oriented in the same direction they synchronize in-phase, but when opposed they synchronize in antiphase. The", "after": "However, the", "start_char_pos": 706, "end_char_pos": 862}, {"type": "R", "before": "when considering multiple flagellaon a single cell. Specifically, the unicellular biflagellate Chlamydomonasswims with opposing power strokes, yet synchronizes in phase in the familiar breaststroke. This indicates", "after": "in URLanisms bearing few flagella. We show that flagella of", "start_char_pos": 889, "end_char_pos": 1102}, {"type": "A", "before": null, "after": "Chlamydomonas", "start_char_pos": 1107, "end_char_pos": 1107}, {"type": "A", "before": null, "after": "mutants deficient in filamentary connections between basal bodies display markedly different synchronization from the wild type. We perform micromanipulation on configurations of flagella and conclude", "start_char_pos": 1108, "end_char_pos": 1108}, {"type": "R", "before": "provides", "after": "must provide", "start_char_pos": 1149, "end_char_pos": 1157}, {"type": "R", "before": "Here we show that in comparison to the wildtype, markedly different synchronization states are found in Chlamydomonas mutants deficient in filamentary connections between basal bodies. Quantitative studies of complex flagellar coordination strategies found in quadri-, octo- and hexadecaflagellates reveal further evidence that intracellular couplings between flagellar basal bodies compete with hydrodynamic interactions to determine", "after": "In naturally occurring species with 4, 8, or even 16 flagella, we find diverse symmetries of basal body positioning and of the flagellar apparatus that are coincident with specific gaits of flagellar actuation, suggesting that it is a competition between intracellular coupling and hydrodynamic interactions that ultimately determines", "start_char_pos": 1192, "end_char_pos": 1626}, {"type": "R", "before": "synchronization", "after": "coordination", "start_char_pos": 1657, "end_char_pos": 1672}], "sents_char_pos": [0, 115, 296, 506, 705, 858, 940, 1087, 1191, 1376]} {"doc_id": "1510.05858", "revision_depth": "1", "before_revision": "In this paper we consider a market model where there are two levels of information , the public information generated by the financial assets and a larger flow of information that contains additional knowledge about a death time of an insured. By using the expansion of filtration, the death uncertainty and its entailed risk are fully considered without any mathematical restriction. In this context, which catches real features such as correlation between market model and time of death, we address the risk-minimisation problem for a large class of equity-linked mortality and/or mortality contracts. The stochastic innovation, that we propose herein, consists of singling out three classes of martingales in the large filtration. One of these classes is generated by a new process, up to our knowledge, that has nice features. The three orthogonal martingale classes are vital pillars for establishing our optional martingale representation theorem, when (local ) martingales of the large filtration are stopped at the death time . This constitutes our first main original contribution, while the second main contribution lies in describing, as explicit as possible, the optimal strategy when hedging mortalityrisks using the optional martingale representation .", "after_revision": "This paper considers a market model with two levels of information . The public information generated by the financial assets , and a larger flow of information containing additional knowledge about a death time (random time/horizon) of an insured. By expanding the filtration, the death uncertainty and its entailed risk are fully considered without any mathematical restriction. In this context, which catches real features such as correlation between the market model and the time of death, we address the risk-minimization problem \\`a la F\\\"ollmer-Sondermann for a large class of equity-linked mortality contracts. The challenge in this setting, when no model specification for these securities nor for the death time is given, lies in finding the dynamics and the structures for the mortality/longevity securities used in the securitization. To overcome this obstacle, we elaborate our optional martingale representation results, which state that any local martingale in the large filtration stopped at the death time can be decomposed into several and precise orthogonal local martingales . This constitutes our first principal novel contribution. Thanks to this optional representation, we succeed to decompose the risk in some popular mortality and/or longevity securities into the sum of orthogonal risks using a risk basis. One of the components of this basis is a new martingale, in the large filtration, that possesses nice features. Hence, the dynamics of mortality and longevity securities used in the securitization is described without mortality specification, and this constitutes our second novel contribution. Our third main contribution resides in finding explicitly the risk-minimization strategy as well as the corresponding undiversified risk for a largest class of mortality/longevity linked liabilities with or without the mortality securitization .", "edit_actions": [{"type": "R", "before": "In this paper we consider", "after": "This paper considers", "start_char_pos": 0, "end_char_pos": 25}, {"type": "R", "before": "where there are", "after": "with", "start_char_pos": 41, "end_char_pos": 56}, {"type": "R", "before": ", the", "after": ". The", "start_char_pos": 83, "end_char_pos": 88}, {"type": "A", "before": null, "after": ",", "start_char_pos": 142, "end_char_pos": 142}, {"type": "R", "before": "that contains", "after": "containing", "start_char_pos": 176, "end_char_pos": 189}, {"type": "A", "before": null, "after": "(random time/horizon)", "start_char_pos": 230, "end_char_pos": 230}, {"type": "R", "before": "using the expansion of", "after": "expanding the", "start_char_pos": 249, "end_char_pos": 271}, {"type": "A", "before": null, "after": "the", "start_char_pos": 460, "end_char_pos": 460}, {"type": "A", "before": null, "after": "the", "start_char_pos": 478, "end_char_pos": 478}, {"type": "R", "before": "risk-minimisation problem", "after": "risk-minimization problem \\`a la F\\\"ollmer-Sondermann", "start_char_pos": 509, "end_char_pos": 534}, {"type": "D", "before": "and/or mortality", "after": null, "start_char_pos": 580, "end_char_pos": 596}, {"type": "R", "before": "stochastic innovation, that we propose herein, consists of singling out three classes of martingales in the large filtration. One of these classes is generated by a new process, up to our knowledge, that has nice features. The three orthogonal martingale classes are vital pillars for establishing our", "after": "challenge in this setting, when no model specification for these securities nor for the death time is given, lies in finding the dynamics and the structures for the mortality/longevity securities used in the securitization. To overcome this obstacle, we elaborate our", "start_char_pos": 612, "end_char_pos": 913}, {"type": "R", "before": "theorem, when (local ) martingales of", "after": "results, which state that any local martingale in", "start_char_pos": 949, "end_char_pos": 986}, {"type": "D", "before": "are", "after": null, "start_char_pos": 1008, "end_char_pos": 1011}, {"type": "A", "before": null, "after": "can be decomposed into several and precise orthogonal local martingales", "start_char_pos": 1038, "end_char_pos": 1038}, {"type": "R", "before": "main original contribution, while the second main contribution lies in describing, as explicit as possible, the optimal strategy when hedging mortalityrisks using the optional martingale representation", "after": "principal novel contribution. Thanks to this optional representation, we succeed to decompose the risk in some popular mortality and/or longevity securities into the sum of orthogonal risks using a risk basis. One of the components of this basis is a new martingale, in the large filtration, that possesses nice features. Hence, the dynamics of mortality and longevity securities used in the securitization is described without mortality specification, and this constitutes our second novel contribution. Our third main contribution resides in finding explicitly the risk-minimization strategy as well as the corresponding undiversified risk for a largest class of mortality/longevity linked liabilities with or without the mortality securitization", "start_char_pos": 1068, "end_char_pos": 1269}], "sents_char_pos": [0, 245, 386, 607, 737, 834, 1040]} {"doc_id": "1512.00267", "revision_depth": "1", "before_revision": "A fundamental result in metabolic pathway analysis states that every element of the flux cone can be written as a sum of elementary modes. The result is an immediate consequence of a theorem by Rockafellar which states that every element of a linear subspace can be written as a conformal sum (a sum without cancelations) of elementary vectors (support-minimal vectors). In this work, we extend the theorem to general polyhedral cones and polyhedra , thereby refining Minkowski's and Caratheodory 's theorems in polyhedral geometry. In general, elementary vectors need not be support-minimal ; in fact, they are conformally non-decomposable and form a unique minimal set of conformal generators. As an application, every flux mode can be decomposed into elementary modes without cancelations. Only such a decomposition is biochemically meaningful, in the sense that a reversible reaction cannot have different directions in the contributing elementary modes. We give elementary proofs for our mathematical results , in particular, we do not assume previous knowledge of polyhedral geometry. We define special cones arising from linear subspaces and nonnegativity conditions and use them to analyze general polyhedral cones and polyhedra .", "after_revision": "A fundamental result in metabolic pathway analysis states that every flux mode can be decomposed into a sum of elementary modes. However, only a decomposition without cancelations is biochemically meaningful, since a reversible reaction cannot have different directions in the contributing elementary modes. This essential requirement has been largely overlooked by the metabolic pathway community. Indeed, every flux mode can be decomposed into elementary modes without cancelations. The result is an immediate consequence of a theorem by Rockafellar which states that every element of a linear subspace is a conformal sum (a sum without cancelations) of elementary vectors (support-minimal vectors). In this work, we extend the theorem , first to \"subspace cones\" and then to general polyhedral cones and polyhedra . Thereby, we refine Minkowski's and Carath\\'eodory 's theorems , two fundamental results in polyhedral geometry. We note that, in general, elementary vectors need not be support-minimal , in fact, they are conformally non-decomposable and form a unique minimal set of conformal generators. Our treatment is mathematically rigorous, but suitable for systems biologists, since we give self-contained proofs for our results and use concepts motivated by metabolic pathway analysis. In particular, we study cones defined by linear subspaces and nonnegativity conditions - like the flux cone - and use them to analyze general polyhedral cones and polyhedra . Finally, we review applications of elementary vectors and conformal sums in metabolic pathway analysis .", "edit_actions": [{"type": "R", "before": "element of the flux cone can be written as", "after": "flux mode can be decomposed into", "start_char_pos": 69, "end_char_pos": 111}, {"type": "A", "before": null, "after": "However, only a decomposition without cancelations is biochemically meaningful, since a reversible reaction cannot have different directions in the contributing elementary modes. This essential requirement has been largely overlooked by the metabolic pathway community. Indeed, every flux mode can be decomposed into elementary modes without cancelations.", "start_char_pos": 139, "end_char_pos": 139}, {"type": "R", "before": "can be written as", "after": "is", "start_char_pos": 260, "end_char_pos": 277}, {"type": "R", "before": "to", "after": ", first to \"subspace cones\" and then to", "start_char_pos": 408, "end_char_pos": 410}, {"type": "R", "before": ", thereby refining", "after": ". Thereby, we refine", "start_char_pos": 450, "end_char_pos": 468}, {"type": "R", "before": "Caratheodory", "after": "Carath\\'eodory", "start_char_pos": 485, "end_char_pos": 497}, {"type": "A", "before": null, "after": ", two fundamental results", "start_char_pos": 510, "end_char_pos": 510}, {"type": "R", "before": "In", "after": "We note that, in", "start_char_pos": 535, "end_char_pos": 537}, {"type": "R", "before": ";", "after": ",", "start_char_pos": 594, "end_char_pos": 595}, {"type": "R", "before": "As an application, every flux mode can be decomposed into elementary modes without cancelations. Only such a decomposition is biochemically meaningful, in the sense that a reversible reaction cannot have different directions in the contributing elementary modes. We give elementary", "after": "Our treatment is mathematically rigorous, but suitable for systems biologists, since we give self-contained", "start_char_pos": 698, "end_char_pos": 979}, {"type": "R", "before": "mathematical results , in", "after": "results and use concepts motivated by metabolic pathway analysis. In", "start_char_pos": 995, "end_char_pos": 1020}, {"type": "R", "before": "do not assume previous knowledge of polyhedral geometry. We define special cones arising from", "after": "study cones defined by", "start_char_pos": 1036, "end_char_pos": 1129}, {"type": "A", "before": null, "after": "- like the flux cone -", "start_char_pos": 1176, "end_char_pos": 1176}, {"type": "A", "before": null, "after": ". Finally, we review applications of elementary vectors and conformal sums in metabolic pathway analysis", "start_char_pos": 1240, "end_char_pos": 1240}], "sents_char_pos": [0, 138, 371, 534, 595, 697, 794, 960, 1092]} {"doc_id": "1512.00268", "revision_depth": "2", "before_revision": "Background: The field of 3D chromatin interaction mapping is changing our point of view on the genome, paving the way for new insights into URLanization. Network analysis is a natural and powerful way of modelling chromatin interactions. Assortativity is a network property that has been widely used in the social sciences to measure the probability of nodes with similar values of a specific feature to interact preferentially . We propose a new approach, using Chromatin feature Assortativity (ChAs), to integrate the epigenomic landscape of a specific cell type with its chromatin interaction network . Results: We use high-resolution Promoter Capture Hi-C and Hi-Cap data as well as ChIA-PET data from embryonic stem cells to generate promoter-centered interaction networks. We calculate the presence of a collection of 78 chromatin features in the chromatin fragments constituting the nodes of the network. Based on the ChAs of these epigenomic features calculated in 4 different interaction networks , we find Polycomb Group proteins and associated histone marks to play a prominent role. Remarkably, in promoter-centered networks, we observe higher ChAs of the actively elongating form of RNA Polymerase 2 compared to inactive forms in interactions between promoters and other elements. Conclusions: Contacts amongst promoters and between promoters and other elements have different characteristic epigenomic features. Using ChAs we identify a possible role of the elongating form of RNAPII in enhancer activity . Our approach facilitates the study of multiple genome-wide epigenomic profiles, considering network topology and allowing for the comparison of any number of chromatin interaction networks.", "after_revision": " Network analysis is a powerful way of modeling chromatin interactions. Assortativity is a network property used in social sciences to identify factors affecting how people establish social ties . We propose a new approach, using chromatin assortativity to integrate the epigenomic landscape of a specific cell type with its chromatin interaction network and thus investigate which proteins or chromatin marks mediate genomic contacts. We use high-resolution Promoter Capture Hi-C and Hi-Cap data as well as ChIA-PET data from mouse embryonic stem cells to investigate promoter-centered chromatin interaction networks and calculate the presence of specific epigenomic features in the chromatin fragments constituting the nodes of the network. We estimate the association of these features to the topology of four chromatin interaction networks and identify features localized in connected areas of the network. Polycomb Group proteins and associated histone marks are the features with the highest chromatin assortativity in promoter-centred networks. We then ask which features distinguish contacts amongst promoters from contacts between promoters and other genomic elements. We observe higher chromatin assortativity of the actively elongating form of RNA Polymerase 2 (RNAPII) compared to inactive forms only in interactions between promoters and other elements. Contacts among promoters, and between promoters and other elements have different characteristic epigenomic features. We identify a possible role for the elongating form of RNAPII in mediating interactions among promoters, enhancers and transcribed gene bodies . Our approach facilitates the study of multiple genome-wide epigenomic profiles, considering network topology and allowing the comparison of chromatin interaction networks.", "edit_actions": [{"type": "D", "before": "Background: The field of 3D chromatin interaction mapping is changing our point of view on the genome, paving the way for new insights into URLanization.", "after": null, "start_char_pos": 0, "end_char_pos": 153}, {"type": "D", "before": "natural and", "after": null, "start_char_pos": 176, "end_char_pos": 187}, {"type": "R", "before": "modelling", "after": "modeling", "start_char_pos": 204, "end_char_pos": 213}, {"type": "R", "before": "that has been widely used in the", "after": "used in", "start_char_pos": 274, "end_char_pos": 306}, {"type": "R", "before": "measure the probability of nodes with similar values of a specific feature to interact preferentially", "after": "identify factors affecting how people establish social ties", "start_char_pos": 326, "end_char_pos": 427}, {"type": "R", "before": "Chromatin feature Assortativity (ChAs),", "after": "chromatin assortativity", "start_char_pos": 463, "end_char_pos": 502}, {"type": "R", "before": ". Results:", "after": "and thus investigate which proteins or chromatin marks mediate genomic contacts.", "start_char_pos": 604, "end_char_pos": 614}, {"type": "A", "before": null, "after": "mouse", "start_char_pos": 706, "end_char_pos": 706}, {"type": "R", "before": "generate", "after": "investigate", "start_char_pos": 731, "end_char_pos": 739}, {"type": "R", "before": "interaction networks. We", "after": "chromatin interaction networks and", "start_char_pos": 758, "end_char_pos": 782}, {"type": "R", "before": "a collection of 78 chromatin", "after": "specific epigenomic", "start_char_pos": 809, "end_char_pos": 837}, {"type": "R", "before": "Based on the ChAs of these epigenomic features calculated in 4 different interaction networks , we find", "after": "We estimate the association of these features to the topology of four chromatin interaction networks and identify features localized in connected areas of the network.", "start_char_pos": 913, "end_char_pos": 1016}, {"type": "R", "before": "to play a prominent role. Remarkably, in promoter-centered networks, we observe higher ChAs", "after": "are the features with the highest chromatin assortativity in promoter-centred networks. We then ask which features distinguish contacts amongst promoters from contacts between promoters and other genomic elements. We observe higher chromatin assortativity", "start_char_pos": 1070, "end_char_pos": 1161}, {"type": "A", "before": null, "after": "(RNAPII)", "start_char_pos": 1214, "end_char_pos": 1214}, {"type": "A", "before": null, "after": "only", "start_char_pos": 1242, "end_char_pos": 1242}, {"type": "R", "before": "Conclusions: Contacts amongst promoters", "after": "Contacts among promoters,", "start_char_pos": 1297, "end_char_pos": 1336}, {"type": "R", "before": "Using ChAs we", "after": "We", "start_char_pos": 1429, "end_char_pos": 1442}, {"type": "R", "before": "of", "after": "for", "start_char_pos": 1468, "end_char_pos": 1470}, {"type": "R", "before": "enhancer activity", "after": "mediating interactions among promoters, enhancers and transcribed gene bodies", "start_char_pos": 1504, "end_char_pos": 1521}, {"type": "R", "before": "for the comparison of any number", "after": "the comparison", "start_char_pos": 1646, "end_char_pos": 1678}], "sents_char_pos": [0, 153, 237, 429, 779, 912, 1095, 1296, 1428, 1523]} {"doc_id": "1512.02673", "revision_depth": "1", "before_revision": "Codes are widely used in many engineering applications to offer some form of reliability and fault tolerance. The high-level idea of coding is to exploit resource redundancy to deliver higher robustness against system noise. In large-scale systems there are several types of \"noise \" that can affect the performance of distributed machine learning algorithms : straggler nodes, system failures, or communication bottlenecks . Moreover, redundancy is abundant: a plethora of nodes, a lot of spare storage, etc . In this work, scratching the surface of \"codes for distributed computation,\" we provide theoretical insights on how coded solutions can achieve significant gains compared to uncoded ones. We focus on two of the most basic building blocks of distributed learning algorithms: matrix multiplication and data shuffling. For matrix multiplication, we use codes to leverage the plethora of nodes and alleviate the effects of stragglers. We show that if the number of workers is n, and the runtime of each subtask has an exponential tail, the optimal coded matrix multiplication is \\Theta(\\log n) times faster than the uncoded matrix multiplication. In data shuffling, we use codes to exploit the excess in storage and reduce communication bottlenecks . We show that when \\alpha is the fraction of the data matrix that can be cached at each worker, and n is the number of workers, coded shuffling \\emph{ reduces the communication cost by a factor \\Theta(\\alpha \\gamma(n) ) compared to uncoded shuffling, where \\gamma(n) is the ratio of the cost of unicasting n messages to n users to broadcasting a common message (of the same size) to n users. Our synthetic and Open MPI experiments on Amazon EC2 show that coded distributed algorithms can achieve significant speedups of up to 40\\% compared to uncoded distributed algorithms.", "after_revision": "Codes are widely used in many engineering applications to offer robustness against noise. In large-scale systems there are several types of noise that can affect the performance of distributed machine learning algorithms -- straggler nodes, system failures, or communication bottlenecks -- but there has been little interaction cutting across codes, machine learning, and distributed systems . In this work, we provide theoretical insights on how coded solutions can achieve significant gains compared to uncoded ones. We focus on two of the most basic building blocks of distributed learning algorithms: matrix multiplication and data shuffling. For matrix multiplication, we use codes to alleviate the effect of stragglers, and show that if the number of homogeneous workers is n, and the runtime of each subtask has an exponential tail, coded computation can speed up distributed matrix multiplication by a factor of \\log n. For data shuffling, we use codes to reduce communication bottlenecks, exploiting the excess in storage . We show that when a constant fraction \\alpha of the data matrix can be cached at each worker, and n is the number of workers, \\emph{coded shuffling reduces the communication cost by a factor of (\\alpha + \\frac{1 \\gamma(n) compared to uncoded shuffling, where \\gamma(n) is the ratio of the cost of unicasting n messages to n users to multicasting a common message (of the same size) to n users. For instance, \\gamma(n) \\simeq n if multicasting a message to n users is as cheap as unicasting a message to one user. We also provide experiment results, corroborating our theoretical gains of the coded algorithms.", "edit_actions": [{"type": "R", "before": "some form of reliability and fault tolerance. The high-level idea of coding is to exploit resource redundancy to deliver higher robustness against system", "after": "robustness against", "start_char_pos": 64, "end_char_pos": 217}, {"type": "R", "before": "\"noise \"", "after": "noise", "start_char_pos": 275, "end_char_pos": 283}, {"type": "R", "before": ":", "after": "--", "start_char_pos": 359, "end_char_pos": 360}, {"type": "R", "before": ". Moreover, redundancy is abundant: a plethora of nodes, a lot of spare storage, etc", "after": "-- but there has been little interaction cutting across codes, machine learning, and distributed systems", "start_char_pos": 424, "end_char_pos": 508}, {"type": "D", "before": "scratching the surface of \"codes for distributed computation,\"", "after": null, "start_char_pos": 525, "end_char_pos": 587}, {"type": "R", "before": "leverage the plethora of nodes and alleviate the effects of stragglers. We", "after": "alleviate the effect of stragglers, and", "start_char_pos": 870, "end_char_pos": 944}, {"type": "A", "before": null, "after": "homogeneous", "start_char_pos": 972, "end_char_pos": 972}, {"type": "R", "before": "the optimal coded matrix multiplication is \\Theta(\\log n) times faster than the uncoded matrix multiplication. In", "after": "coded computation can speed up distributed matrix multiplication by a factor of \\log n. For", "start_char_pos": 1044, "end_char_pos": 1157}, {"type": "R", "before": "exploit", "after": "reduce communication bottlenecks, exploiting", "start_char_pos": 1190, "end_char_pos": 1197}, {"type": "D", "before": "and reduce communication bottlenecks", "after": null, "start_char_pos": 1220, "end_char_pos": 1256}, {"type": "R", "before": "\\alpha is the fraction", "after": "a constant fraction \\alpha", "start_char_pos": 1277, "end_char_pos": 1299}, {"type": "D", "before": "that", "after": null, "start_char_pos": 1319, "end_char_pos": 1323}, {"type": "D", "before": "coded shuffling", "after": null, "start_char_pos": 1386, "end_char_pos": 1401}, {"type": "A", "before": null, "after": "coded shuffling", "start_char_pos": 1408, "end_char_pos": 1408}, {"type": "R", "before": "\\Theta(\\alpha", "after": "of (\\alpha + \\frac{1", "start_char_pos": 1452, "end_char_pos": 1465}, {"type": "D", "before": ")", "after": null, "start_char_pos": 1476, "end_char_pos": 1477}, {"type": "R", "before": "broadcasting", "after": "multicasting", "start_char_pos": 1589, "end_char_pos": 1601}, {"type": "R", "before": "Our synthetic and Open MPI experiments on Amazon EC2 show that coded distributed algorithms can achieve significant speedups of up to 40\\% compared to uncoded distributed", "after": "For instance, \\gamma(n) \\simeq n if multicasting a message to n users is as cheap as unicasting a message to one user. We also provide experiment results, corroborating our theoretical gains of the coded", "start_char_pos": 1650, "end_char_pos": 1820}], "sents_char_pos": [0, 109, 224, 425, 510, 698, 826, 941, 1154, 1258, 1649]} {"doc_id": "1603.02453", "revision_depth": "1", "before_revision": "The fidelity of DNA replication by DNA polymerase (DNAP) has long been an important issue in basic researches and application studies in biology. While numerous experiments have revealed details of the molecular structure and working mechanism of DNAP , theoretical studies of the fidelity issue are still lacking. Kinetic models which considered explicitly both the polymerase pathway and the exonuclease (proofreading ) pathway were proposed since 1970s', but so far there was no rigorous treatment of such models . In this paper, we propose a new kinetic model of the exonuclease proofreading mechanism, based on some recent experimental observations . We present a rigorous analytical treatment of the steady-state kinetic equations including higher-order terminal effects , and then apply the results to the fidelity problem of some real DNAPs . Our results show good agreements with previous intuitive estimate of some DNAPs' fidelity under bio-relevant conditions .", "after_revision": "The fidelity of DNA replication by DNA polymerase (DNAP) has long been an important issue in biology. While numerous experiments have revealed details of the molecular structure and working mechanism of DNAP which consists of both a polymerase site and an exonuclease (proofreading) site, there were quite few theoretical studies on the fidelity issue . The first model which explicitly considered both sites was proposed in 1970s' and the basic idea was widely accepted by later models. However, all these models did not systematically and rigorously investigate the dominant factor on DNAP fidelity, i.e, the higher-order terminal effects through which the polymerization pathway and the proofreading pathway coordinate to achieve high fidelity . In this paper, we propose a new and comprehensive kinetic model of DNAP based on some recent experimental observations , which includes previous models as special cases . We present a rigorous and unified treatment of the corresponding steady-state kinetic equations of any-order terminal effects, and derive analytical expressions for fidelity in terms of kinetic parameters under bio-relevant conditions. These expressions offer new insights on how the the higher-order terminal effects contribute substantially to the fidelity in an order-by-order way, and also show that the polymerization-and-proofreading mechanism is dominated only by very few key parameters. We then apply these results to calculate the fidelity of some real DNAPs , which are in good agreements with previous intuitive estimates given by experimentalists .", "edit_actions": [{"type": "D", "before": "basic researches and application studies in", "after": null, "start_char_pos": 93, "end_char_pos": 136}, {"type": "R", "before": ", theoretical studies of", "after": "which consists of both a polymerase site and an exonuclease (proofreading) site, there were quite few theoretical studies on", "start_char_pos": 252, "end_char_pos": 276}, {"type": "R", "before": "are still lacking. Kinetic models which considered explicitly both the polymerase", "after": ". The first model which explicitly considered both sites was proposed in 1970s' and the basic idea was widely accepted by later models. However, all these models did not systematically and rigorously investigate the dominant factor on DNAP fidelity, i.e, the higher-order terminal effects through which the polymerization", "start_char_pos": 296, "end_char_pos": 377}, {"type": "R", "before": "exonuclease (proofreading ) pathway were proposed since 1970s', but so far there was no rigorous treatment of such models", "after": "proofreading pathway coordinate to achieve high fidelity", "start_char_pos": 394, "end_char_pos": 515}, {"type": "A", "before": null, "after": "and comprehensive", "start_char_pos": 550, "end_char_pos": 550}, {"type": "R", "before": "the exonuclease proofreading mechanism,", "after": "DNAP", "start_char_pos": 568, "end_char_pos": 607}, {"type": "A", "before": null, "after": ", which includes previous models as special cases", "start_char_pos": 655, "end_char_pos": 655}, {"type": "R", "before": "analytical", "after": "and unified", "start_char_pos": 680, "end_char_pos": 690}, {"type": "A", "before": null, "after": "corresponding", "start_char_pos": 708, "end_char_pos": 708}, {"type": "R", "before": "including", "after": "of any-order terminal effects, and derive analytical expressions for fidelity in terms of kinetic parameters under bio-relevant conditions. These expressions offer new insights on how the the", "start_char_pos": 740, "end_char_pos": 749}, {"type": "R", "before": ", and then apply the results to the fidelity problem", "after": "contribute substantially to the fidelity in an order-by-order way, and also show that the polymerization-and-proofreading mechanism is dominated only by very few key parameters. We then apply these results to calculate the fidelity", "start_char_pos": 780, "end_char_pos": 832}, {"type": "R", "before": ". Our results show", "after": ", which are in", "start_char_pos": 852, "end_char_pos": 870}, {"type": "R", "before": "estimate of some DNAPs' fidelity under bio-relevant conditions", "after": "estimates given by experimentalists", "start_char_pos": 911, "end_char_pos": 973}], "sents_char_pos": [0, 145, 314, 517, 657, 853]} {"doc_id": "1603.06050", "revision_depth": "1", "before_revision": "Recently, the authors of (\\mbox{%DIFAUXCMD Ernst0pt%DIFAUXCMD ) empirically showed that over the 1958-2014 horizon, the returns of the MaxMedian S\\&P 500 portfolio (see \\mbox{%DIFAUXCMD thomp2}0pt%DIFAUXCMD ) substantially exceed both those of the market capitalization } weighted S\\&P 500 portfolio as well as those of the equally weighted S\\&P 500 portfolio .0pt%DIFAUXCMD , \\mbox{%DIFAUXCMD Uppal}0pt%DIFAUXCMD , \\mbox{%DIFAUXCMD Jacobs}0pt%DIFAUXCMD , \\mbox{%DIFAUXCMD Treynor}0pt%DIFAUXCMD ). However, rather surprisingly, portfolio allocation based on the seven simple transformations of John Tukey's ladder are nowhere to be found in the literature. } In this work, we find superior S\\&P 500 portfolio weighting strategies to that of the MaxMedian rule, calculated over an updated 1958-2015 time horizon . The portfolio weighting strategies we consider are the seven transformations of Tukey's transformational ladder (\\cite{Tukey2}): 1/x^2, 1/x, 1/\\sqrt{x}, \\log (x), \\sqrt{x,\\,\\, x,\\,\\, x^2} , x , x^2 (in our setting, x is the market capitalization weighted portfolio ) . We find that the 1/x^2 weighting strategy produces cumulative returns which significantly dominate all other portfolios, posting an annual geometric mean return of 20.889 \\\\%DIF < . In addition, we show that the 1/x^2 weighting strategy is superior to a 1/x weighting strategy, which is in turn superior to a 1/\\sqrt{x} weighted portfolio, and so forth, culminating with the x^2 transformation, whose cumulative returns are the lowest of the seven transformations of Tukey's transformational ladder. It is astonishing that the ranking of portfolio performance (from best to worst) precisely follows that of the late John Tukey's transformational ladder.\\end{abstract} %DIF > . Further, the 1/x^2 weighting strategy is superior to a 1/x weighting strategy, which is in turn superior to a 1/\\sqrt{x} weighted portfolio, and so forth, culminating with the x^2 transformation, whose cumulative returns are the lowest of the seven transformations of John Tukey's transformational ladder. Rather shockingly, the order of cumulative returns precisely follows that of John Tukey's transformational ladder. To the best of our knowledge, we are the first to discover this phenomenon.", "after_revision": "0pt%DIFAUXCMD ) empirically showed that over the 1958-2014 horizon, the returns of the MaxMedian S\\&P 500 portfolio (see \\mbox{%DIFAUXCMD thomp2}0pt%DIFAUXCMD ) substantially exceed both those of the market capitalization } Over the past half century, portfolio managers have carefully documented the advantages of the equally weighted S\\&P 500 portfolio as well as the often overlooked disadvantages of the market capitalization weighted S\\&P 500 portfolio (see \\mbox{%DIFAUXCMD Bloom0pt%DIFAUXCMD , \\mbox{%DIFAUXCMD Uppal}0pt%DIFAUXCMD , \\mbox{%DIFAUXCMD Jacobs}0pt%DIFAUXCMD , \\mbox{%DIFAUXCMD Treynor}0pt%DIFAUXCMD ). However, rather surprisingly, portfolio allocation based on the seven simple transformations of John Tukey's ladder are nowhere to be found in the literature. } In this work, we consider the S\\&P 500 portfolio over the 1958-2015 time horizon weighted using John Tukey's transformational ladder (\\cite{Tukey2}): 1/x^2, \\,\\, 1/x, \\,\\, 1/\\sqrt{x}, \\,\\, \\text{log (x), \\,\\, \\sqrt{x,\\,\\, x,\\,\\, x^2} , where x is the market capitalization weighted portfolio . We find that the 1/x^2 weighting strategy produces cumulative returns which significantly dominates all other portfolios, achieving an annual geometric mean return of 20.889 \\\\%DIF < . In addition, we show that the 1/x^2 weighting strategy is superior to a 1/x weighting strategy, which is in turn superior to a 1/\\sqrt{x} weighted portfolio, and so forth, culminating with the x^2 transformation, whose cumulative returns are the lowest of the seven transformations of Tukey's transformational ladder. It is astonishing that the ranking of portfolio performance (from best to worst) precisely follows that of the late John Tukey's transformational ladder.\\end{abstract} %DIF > . Further, the 1/x^2 weighting strategy is superior to a 1/x weighting strategy, which is in turn superior to a 1/\\sqrt{x} weighted portfolio, and so forth, culminating with the x^2 transformation, whose cumulative returns are the lowest of the seven transformations of John Tukey's transformational ladder. Rather shockingly, the order of cumulative returns precisely follows that of John Tukey's transformational ladder. To the best of our knowledge, we are the first to discover this phenomenon.", "edit_actions": [{"type": "D", "before": "Recently, the authors of (\\mbox{%DIFAUXCMD Ernst", "after": null, "start_char_pos": 0, "end_char_pos": 48}, {"type": "A", "before": null, "after": "Over the past half century, portfolio managers have carefully documented the advantages of the equally", "start_char_pos": 272, "end_char_pos": 272}, {"type": "R", "before": "those of the equally", "after": "the often overlooked disadvantages of the market capitalization", "start_char_pos": 312, "end_char_pos": 332}, {"type": "R", "before": ".", "after": "(see \\mbox{%DIFAUXCMD Bloom", "start_char_pos": 361, "end_char_pos": 362}, {"type": "R", "before": "find superior", "after": "consider the", "start_char_pos": 677, "end_char_pos": 690}, {"type": "R", "before": "weighting strategies to that of the MaxMedian rule, calculated over an updated", "after": "over the", "start_char_pos": 710, "end_char_pos": 788}, {"type": "R", "before": ". The portfolio weighting strategies we consider are the seven transformations of", "after": "weighted using John", "start_char_pos": 812, "end_char_pos": 893}, {"type": "A", "before": null, "after": "\\,\\,", "start_char_pos": 950, "end_char_pos": 950}, {"type": "A", "before": null, "after": "\\,\\,", "start_char_pos": 956, "end_char_pos": 956}, {"type": "R", "before": "\\log", "after": "\\,\\, \\text{log", "start_char_pos": 969, "end_char_pos": 973}, {"type": "R", "before": "\\sqrt{x", "after": "\\,\\, \\sqrt{x", "start_char_pos": 979, "end_char_pos": 986}, {"type": "A", "before": null, "after": "where", "start_char_pos": 1006, "end_char_pos": 1006}, {"type": "D", "before": ", x^2 (in our setting, x", "after": null, "start_char_pos": 1009, "end_char_pos": 1033}, {"type": "D", "before": ")", "after": null, "start_char_pos": 1082, "end_char_pos": 1083}, {"type": "R", "before": "dominate", "after": "dominates", "start_char_pos": 1176, "end_char_pos": 1184}, {"type": "R", "before": "posting", "after": "achieving", "start_char_pos": 1207, "end_char_pos": 1214}], "sents_char_pos": [0, 498, 657, 813, 1085, 1585, 1739, 2068, 2183]} {"doc_id": "1604.08278", "revision_depth": "1", "before_revision": "One of the key factors in -1 programmed ribosomal frameshifting (PRF) is a pseudoknot (PK) RNA . A number of single molecule experiments have been performed on PKs to decipher the mechanism of PRF. Motivated by the experiments, we performed simulations to describe the response of a PK over a range of mechanical forces (fs) and monovalent salt concentrations (Cs). The coarse-grained simulations quantitatively reproduces the multistep thermal melting . The free energy changes obtained in simulations are in excellent agreement with experiments , thus validating our model. The predicted phase diagram shows that a sequence of structural transitions, populating distinct intermediates, occur as f and C are changed . The stem-loop tertiary interactions rupture first followed by unfolding of the 3^{\\prime}-end hairpin (\\textrm{ U-I } \\textrm{ ). Finally, the 5^{\\prime}-end hairpin unravels producing a stretched state ( \\textrm{ I-F } \\textrm{ ). A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \\left(\\log C_{\\textrm{m}}\\right)^{\\alpha} with \\alpha=1\\,(0.5) for \\textrm{ U-I ( \\textrm{ \\textrm{ I-F } \\textrm{ ) transition. This relation is used to obtain the ion-preferential coefficients, which shows that ion-RNA interactions can be quantitatively measured in single molecule experiments . Our simulations predict a plausible link between the stability of the 5^{\\prime} hairpin and efficiency of PRF .", "after_revision": "Because of the potential link between -1 programmed ribosomal frameshifting (PRF) and response of a pseudoknot (PK) RNA to force, a number of single molecule pulling experiments have been performed on PKs to decipher the mechanism of PRF. Motivated in part by these experiments, we performed simulations using a coarse-grained model of RNA to describe the response of a PK over a range of mechanical forces (fs) and monovalent salt concentrations (Cs). The coarse-grained simulations quantitatively reproduce the multistep thermal melting observed in experiments, thus validating our model . The free energy changes obtained in simulations are in excellent agreement with experiments . By varying f and C, we calculated the phase diagram that shows a sequence of structural transitions, populating distinct intermediate states. As f and C are changed , the stem-loop tertiary interactions rupture first followed by unfolding of the 3^{\\prime}-end hairpin (\\textrm{ I } \\rightleftharpoons\\textrm{F ). Finally, the 5^{\\prime}-end hairpin unravels producing a extended state ( \\textrm{ E } \\rightleftharpoons\\textrm{I ). A theoretical analysis of the phase boundaries shows that the critical force for rupture scales as \\left(\\log C_{\\textrm{m}}\\right)^{\\alpha} with \\alpha=1\\,(0.5) for \\textrm{ E \\rightleftharpoons\\textrm{I ( \\textrm{ I } \\rightleftharpoons\\textrm{F ) transition. This relation is used to obtain the preferential ion-RNA interaction coefficient, which can be quantitatively measured in single molecule experiments , as done previously for DNA hairpins. A by product of our work is the suggestion that the frameshift efficiency is likely determined by the stability of the 5^{\\prime} -end hairpin that the ribosome first encounters during translation .", "edit_actions": [{"type": "R", "before": "One of the key factors in", "after": "Because of the potential link between", "start_char_pos": 0, "end_char_pos": 25}, {"type": "R", "before": "is", "after": "and response of", "start_char_pos": 70, "end_char_pos": 72}, {"type": "R", "before": ". A", "after": "to force, a", "start_char_pos": 95, "end_char_pos": 98}, {"type": "A", "before": null, "after": "pulling", "start_char_pos": 125, "end_char_pos": 125}, {"type": "R", "before": "by the", "after": "in part by these", "start_char_pos": 209, "end_char_pos": 215}, {"type": "A", "before": null, "after": "using a coarse-grained model of RNA", "start_char_pos": 254, "end_char_pos": 254}, {"type": "R", "before": "reproduces", "after": "reproduce", "start_char_pos": 414, "end_char_pos": 424}, {"type": "A", "before": null, "after": "observed in experiments, thus validating our model", "start_char_pos": 455, "end_char_pos": 455}, {"type": "R", "before": ", thus validating our model. The predicted phase diagram shows that", "after": ". By varying f and C, we calculated the phase diagram that shows", "start_char_pos": 550, "end_char_pos": 617}, {"type": "R", "before": "intermediates, occur as", "after": "intermediate states. As", "start_char_pos": 676, "end_char_pos": 699}, {"type": "R", "before": ". The", "after": ", the", "start_char_pos": 720, "end_char_pos": 725}, {"type": "R", "before": "U-I", "after": "I", "start_char_pos": 834, "end_char_pos": 837}, {"type": "A", "before": null, "after": "\\rightleftharpoons", "start_char_pos": 840, "end_char_pos": 840}, {"type": "A", "before": null, "after": "F", "start_char_pos": 848, "end_char_pos": 848}, {"type": "R", "before": "stretched state (", "after": "extended state (", "start_char_pos": 909, "end_char_pos": 926}, {"type": "R", "before": "I-F", "after": "E", "start_char_pos": 936, "end_char_pos": 939}, {"type": "A", "before": null, "after": "\\rightleftharpoons", "start_char_pos": 942, "end_char_pos": 942}, {"type": "A", "before": null, "after": "I", "start_char_pos": 950, "end_char_pos": 950}, {"type": "D", "before": "U-I", "after": null, "start_char_pos": 1129, "end_char_pos": 1132}, {"type": "R", "before": "(", "after": "E", "start_char_pos": 1133, "end_char_pos": 1134}, {"type": "A", "before": null, "after": "\\rightleftharpoons", "start_char_pos": 1135, "end_char_pos": 1135}, {"type": "A", "before": null, "after": "I", "start_char_pos": 1143, "end_char_pos": 1143}, {"type": "A", "before": null, "after": "(", "start_char_pos": 1144, "end_char_pos": 1144}, {"type": "R", "before": "I-F", "after": "I", "start_char_pos": 1154, "end_char_pos": 1157}, {"type": "A", "before": null, "after": "\\rightleftharpoons", "start_char_pos": 1160, "end_char_pos": 1160}, {"type": "A", "before": null, "after": "F", "start_char_pos": 1168, "end_char_pos": 1168}, {"type": "R", "before": "ion-preferential coefficients, which shows that", "after": "preferential", "start_char_pos": 1219, "end_char_pos": 1266}, {"type": "R", "before": "interactions", "after": "interaction coefficient, which", "start_char_pos": 1275, "end_char_pos": 1287}, {"type": "R", "before": ". Our simulations predict a plausible link between the", "after": ", as done previously for DNA hairpins. A by product of our work is the suggestion that the frameshift efficiency is likely determined by the", "start_char_pos": 1350, "end_char_pos": 1404}, {"type": "R", "before": "hairpin and efficiency of PRF", "after": "-end hairpin that the ribosome first encounters during translation", "start_char_pos": 1433, "end_char_pos": 1462}], "sents_char_pos": [0, 198, 367, 457, 578, 721, 851, 953, 1182, 1351]} {"doc_id": "1606.00101", "revision_depth": "2", "before_revision": "The capacity of cells URLanisms to respond in a repeatable manner to challenging conditions is limited by a finite number of pre-evolved adaptive responses. Beyond this capacity, exploratory dynamics can provide alternative means to cope with a much broader array of conditions. At the population level, exploration is implemented by mutations and selection over multiple generations. However, it is not known how exploration can lead to new phenotypes within the lifetime of a single cell . Here, we address this question by developing a network model of exploration in gene regulation. This model demonstrates the feasibility of adapting by temporal exploration. Exploration is initiated by failure to comply with a global constraint and is implemented by random sampling of available network configurations. It ceases if and when the system converges to a stable compliance with the constraint. Successful convergence depends crucially on network topology and is most efficient for scale-free connectivity. Convergence to an adapted phenotype in this class of networks is achieved without fine tuning of initial conditions or other model parameters, thus making it plausible for biological implementation . Experimental results have indeed shown that gene regulatory networks are characterized by this type of topology, suggesting a structural basis for exploratory adaptation .", "after_revision": "The capacity of cells URLanisms to respond to challenging conditions in a repeatable manner is limited by a finite repertoire of pre-evolved adaptive responses. Beyond this capacity, cells can use exploratory dynamics to cope with a much broader array of conditions. However, the process of adaptation by exploratory dynamics within the lifetime of a cell is not well understood. Here we demonstrate the feasibility of exploratory adaptation in a high-dimensional network model of gene regulation. Exploration is initiated by failure to comply with a constraint and is implemented by random sampling of network configurations. It ceases if and when the network reaches a stable state satisfying the constraint. We find that successful convergence (adaptation) in high dimensions requires outgoing network hubs and is enhanced by their auto-regulation. The ability of these empirically-validated features of gene regulatory networks to support exploratory adaptation without fine-tuning, makes it plausible for biological implementation .", "edit_actions": [{"type": "A", "before": null, "after": "to challenging conditions", "start_char_pos": 43, "end_char_pos": 43}, {"type": "D", "before": "to challenging conditions", "after": null, "start_char_pos": 67, "end_char_pos": 92}, {"type": "R", "before": "number", "after": "repertoire", "start_char_pos": 116, "end_char_pos": 122}, {"type": "R", "before": "exploratory dynamics can provide alternative means", "after": "cells can use exploratory dynamics", "start_char_pos": 180, "end_char_pos": 230}, {"type": "R", "before": "At the population level, exploration is implemented by mutations and selection over multiple generations. However, it is not known how exploration can lead to new phenotypes", "after": "However, the process of adaptation by exploratory dynamics", "start_char_pos": 280, "end_char_pos": 453}, {"type": "R", "before": "single cell . Here, we address this question by developing a", "after": "cell is not well understood. Here we demonstrate the feasibility of exploratory adaptation in a high-dimensional", "start_char_pos": 479, "end_char_pos": 539}, {"type": "D", "before": "exploration in", "after": null, "start_char_pos": 557, "end_char_pos": 571}, {"type": "D", "before": "This model demonstrates the feasibility of adapting by temporal exploration.", "after": null, "start_char_pos": 589, "end_char_pos": 665}, {"type": "D", "before": "global", "after": null, "start_char_pos": 719, "end_char_pos": 725}, {"type": "D", "before": "available", "after": null, "start_char_pos": 778, "end_char_pos": 787}, {"type": "R", "before": "system converges to a stable compliance with", "after": "network reaches a stable state satisfying", "start_char_pos": 838, "end_char_pos": 882}, {"type": "R", "before": "Successful convergence depends crucially on network topology and is most efficient for scale-free connectivity. Convergence to an adapted phenotype in this class of networks is achieved without fine tuning of initial conditions or other model parameters, thus making", "after": "We find that successful convergence (adaptation) in high dimensions requires outgoing network hubs and is enhanced by their auto-regulation. The ability of these empirically-validated features of gene regulatory networks to support exploratory adaptation without fine-tuning, makes", "start_char_pos": 899, "end_char_pos": 1165}, {"type": "D", "before": ". Experimental results have indeed shown that gene regulatory networks are characterized by this type of topology, suggesting a structural basis for exploratory adaptation", "after": null, "start_char_pos": 1209, "end_char_pos": 1380}], "sents_char_pos": [0, 157, 279, 385, 492, 588, 665, 811, 898, 1010]} {"doc_id": "1607.02481", "revision_depth": "3", "before_revision": "Bipartite networks are currently regarded as providing a major insight into URLanization of many real-world systems, unveiling the mechanisms driving the interactions which occur between distinct groups of nodes. One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves the information encoded into the original bipartite structure as much as possible . In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, which implements a simple rule: in order for any two nodes to be linked, the number of shared neighbors must be statistically significant. Naturally, assessing the statistical significance of nodes similarity requires the definition of a proper statistical benchmark : here we consider a set of four null models, defined within the Exponential Random Graph framework. Our algorithm outputs a matrix of link-specific p-values, from which a validated projection can be straightforwardly obtained , upon running a multiple hypothesis test and retaining only the statistically-significant links . Finally, in order to test our method , we analyze an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. the MovieLensdataset , collecting the users' ratings of a list of movies). In both cases non-trivial communities are detected . In the first case, while projecting the World Trade Web on the countries layer reveals modules of similarly-industrialized nations, projecting it on the products layer allows communities characterized by an increasing level of complexity to be detected; in the second case, projecting MovieLens on the films layer allows clusters of movies whose affinity cannot be fully accounted for by genre similarity to be individuated.", "after_revision": "Bipartite networks are currently regarded as providing a major insight into URLanization of many real-world systems, unveiling the mechanisms driving the interactions occurring between distinct groups of nodes. One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves as much as possible the information encoded into the original bipartite structure . In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, according to which any two nodes sharing a statistically-significant number of neighbors are linked. Since assessing the statistical significance of nodes similarity requires a proper statistical benchmark , here we consider a set of four null models, defined within the exponential random graph framework. Our algorithm outputs a matrix of link-specific p-values, from which a validated projection is straightforwardly obtainable , upon running a multiple hypothesis testing procedure . Finally, we test our method on an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. MovieLens , collecting the users' ratings of a list of movies). In both cases non-trivial communities are detected : while projecting the World Trade Web on the countries layer reveals modules of similarly-industrialized nations, projecting it on the products layer allows communities characterized by an increasing level of complexity to be detected; in the second case, projecting MovieLens on the films layer allows clusters of movies whose affinity cannot be fully accounted for by genre similarity to be individuated.", "edit_actions": [{"type": "R", "before": "which occur", "after": "occurring", "start_char_pos": 167, "end_char_pos": 178}, {"type": "A", "before": null, "after": "as much as possible", "start_char_pos": 388, "end_char_pos": 388}, {"type": "D", "before": "as much as possible", "after": null, "start_char_pos": 451, "end_char_pos": 470}, {"type": "R", "before": "which implements a simple rule: in order for", "after": "according to which", "start_char_pos": 587, "end_char_pos": 631}, {"type": "R", "before": "to be linked, the number of shared neighbors must be statistically significant. Naturally,", "after": "sharing a statistically-significant number of neighbors are linked. Since", "start_char_pos": 646, "end_char_pos": 736}, {"type": "D", "before": "the definition of", "after": null, "start_char_pos": 805, "end_char_pos": 822}, {"type": "R", "before": ":", "after": ",", "start_char_pos": 854, "end_char_pos": 855}, {"type": "R", "before": "Exponential Random Graph", "after": "exponential random graph", "start_char_pos": 919, "end_char_pos": 943}, {"type": "R", "before": "can be straightforwardly obtained", "after": "is straightforwardly obtainable", "start_char_pos": 1047, "end_char_pos": 1080}, {"type": "R", "before": "test and retaining only the statistically-significant links", "after": "testing procedure", "start_char_pos": 1118, "end_char_pos": 1177}, {"type": "R", "before": "in order to", "after": "we", "start_char_pos": 1189, "end_char_pos": 1200}, {"type": "R", "before": ", we analyze", "after": "on", "start_char_pos": 1217, "end_char_pos": 1229}, {"type": "R", "before": "the MovieLensdataset", "after": "MovieLens", "start_char_pos": 1338, "end_char_pos": 1358}, {"type": "R", "before": ". In the first case,", "after": ":", "start_char_pos": 1464, "end_char_pos": 1484}], "sents_char_pos": [0, 212, 472, 725, 954, 1179, 1412, 1465, 1719]} {"doc_id": "1607.02561", "revision_depth": "1", "before_revision": "Most modern database-backed applications are built using Object Relational Mapping (ORM) frameworks. While ORM frameworks ease application development by abstracting persistent data as objects, such convenience often comes with a performance cost. In this paper, we present OMAS , a tool that examines the application logic and its interaction with databases via the Ruby on Rails ORM framework. OMAS comes with a static program analyzer and a synthetic data and workload generator that profiles applications to understand their performance characteristics. With OMAS, we performed the first comprehensive study of real-world ORM framework-based applications, where we analyzed the performance and programming patterns across 26 open-source applications, covering domains such as forum , e-commerce, project management, blogging , etc. Based on our study, we make a number of observations and analyze their implications on the designof ORM frameworks and databases. Furthermore, we discuss new research topics in data management and software engineering that our study raises, and how OMAS can help in implementing them.", "after_revision": "Most modern database-backed web applications are built upon Object Relational Mapping (ORM) frameworks. While ORM frameworks ease application development by abstracting persistent data as objects, such convenience often comes with a performance cost. In this paper, we present CADO , a tool that analyzes the application logic and its interaction with databases using the Ruby on Rails ORM framework. CADO includes a static program analyzer , a profiler and a synthetic data generator to extract and understand application's performance characteristics. We used CADO to analyze the performance problems of 27 real-world open-source Rails applications, covering domains such as online forums , e-commerce, project management, blogs , etc. Based on the results, we uncovered a number of issues that lead to sub-optimal application performance, ranging from issuing queries, how result sets are used, and physical design. We suggest possible remedies for each issue, and highlight new research opportunities that arise from them.", "edit_actions": [{"type": "A", "before": null, "after": "web", "start_char_pos": 28, "end_char_pos": 28}, {"type": "R", "before": "using", "after": "upon", "start_char_pos": 52, "end_char_pos": 57}, {"type": "R", "before": "OMAS", "after": "CADO", "start_char_pos": 275, "end_char_pos": 279}, {"type": "R", "before": "examines", "after": "analyzes", "start_char_pos": 294, "end_char_pos": 302}, {"type": "R", "before": "via", "after": "using", "start_char_pos": 360, "end_char_pos": 363}, {"type": "R", "before": "OMAS comes with", "after": "CADO includes", "start_char_pos": 397, "end_char_pos": 412}, {"type": "A", "before": null, "after": ", a profiler", "start_char_pos": 439, "end_char_pos": 439}, {"type": "R", "before": "and workload generator that profiles applications to understand their", "after": "generator to extract and understand application's", "start_char_pos": 461, "end_char_pos": 530}, {"type": "R", "before": "With OMAS, we performed the first comprehensive study of", "after": "We used CADO to analyze the performance problems of 27", "start_char_pos": 560, "end_char_pos": 616}, {"type": "D", "before": "ORM framework-based applications, where we analyzed the performance and programming patterns across 26", "after": null, "start_char_pos": 628, "end_char_pos": 730}, {"type": "A", "before": null, "after": "Rails", "start_char_pos": 743, "end_char_pos": 743}, {"type": "R", "before": "forum", "after": "online forums", "start_char_pos": 783, "end_char_pos": 788}, {"type": "R", "before": "blogging", "after": "blogs", "start_char_pos": 823, "end_char_pos": 831}, {"type": "R", "before": "our study, we make", "after": "the results, we uncovered", "start_char_pos": 848, "end_char_pos": 866}, {"type": "R", "before": "observations and analyze their implications on the designof ORM frameworks and databases. Furthermore, we discuss new research topics in data management and software engineering that our study raises, and how OMAS can help in implementing", "after": "issues that lead to sub-optimal application performance, ranging from issuing queries, how result sets are used, and physical design. We suggest possible remedies for each issue, and highlight new research opportunities that arise from", "start_char_pos": 879, "end_char_pos": 1117}], "sents_char_pos": [0, 101, 248, 396, 559, 838, 968]} {"doc_id": "1610.01267", "revision_depth": "1", "before_revision": "Despite computation becomes much complex on data with unprecedented large-scale , we argue computers or smart devices should and will consistently provide information and knowledge to human being in the order of a few tens milliseconds. We coin a new term 10-millisecond computing to call attention to this class of workloads. Public reports indicate that internet service users are sensitive to the service or job-level response time outliers, so we propose a very simple but powerful metric-outlier proportion to characterize the system behaviors.The outlier proportion is defined as follows: for N completed requests or jobs, if M jobs or requests' latencies exceed the outlier limit t, e.g. 10 milliseconds, the outlier proportion is M/N. 10-millisecond computing raises many challenges for both software and hardware stacks. In this paper, as a case study we investigate the challenges raised for conventional operating systems. For typical latency-critical services running with Linux on a 40-core server - a main-stream server hardware system in near future , we found, when the outlier limit decreases, the outlier proportion of a single server will significantly deteriorate. Meanwhile, the outlier proportion is further amplified by the system scale, including the system core number . For a 1K-scale system , we surprisingly find that to reduce the service or job-level outlier proportion to 10\\%, running Linux (version 2.6.32) or LXC (version 0.7.5) or XEN (version 4.0.0), respectively, the outlier proportion of a single server needs to be reduced by 871X, 2372X, 2372X accordingly. We also conducted a list of experiments to reveal the current Linux systems still suffer from poor outlier performance, including Linux kernel version 3.17.4, Linux kernel version 2.6.35M, a modified version of 2.6.35 integrated with sloppy counters and two representative real time schedulers .", "after_revision": "Despite computation becomes much complex on data with an unprecedented scale , we argue computers or smart devices should and will consistently provide information and knowledge to human being in the order of a few tens milliseconds. We coin a new term 10-millisecond computing to call attention to this class of workloads. 10-millisecond computing raises many challenges for both software and hardware stacks. In this paper, using a typical workload-memcached on a 40-core server ( a main-stream server in near future ), we quantitatively measure 10-ms computing's challenges to conventional operating systems. For better communication, we propose a simple metric-outlier proportion to measure quality of service: for N completed requests or jobs, if M jobs or requests' latencies exceed the outlier threshold t , the outlier proportion is M/N . For a 1K-scale system running Linux (version 2.6.32) , LXC (version 0.7.5) or XEN (version 4.0.0), respectively, we surprisingly find that so as to reduce the service outlier proportion to 10\\% (10\\% users will feel QoS degradation), the outlier proportion of a single server has to be reduced by 871X, 2372X, 2372X accordingly. Also, we discuss the possible design spaces of 10-ms computing systems from perspectives of datacenter architectures, networking, OS and scheduling, and benchmarking .", "edit_actions": [{"type": "R", "before": "unprecedented large-scale", "after": "an unprecedented scale", "start_char_pos": 54, "end_char_pos": 79}, {"type": "D", "before": "Public reports indicate that internet service users are sensitive to the service or job-level response time outliers, so we propose a very simple but powerful metric-outlier proportion to characterize the system behaviors.The outlier proportion is defined as follows: for N completed requests or jobs, if M jobs or requests' latencies exceed the outlier limit t, e.g. 10 milliseconds, the outlier proportion is M/N.", "after": null, "start_char_pos": 327, "end_char_pos": 742}, {"type": "R", "before": "as a case study we investigate the challenges raised for conventional operating systems. For typical latency-critical services running with Linux", "after": "using a typical workload-memcached", "start_char_pos": 845, "end_char_pos": 990}, {"type": "R", "before": "-", "after": "(", "start_char_pos": 1011, "end_char_pos": 1012}, {"type": "D", "before": "hardware system", "after": null, "start_char_pos": 1034, "end_char_pos": 1049}, {"type": "A", "before": null, "after": "), we quantitatively measure 10-ms computing's challenges to conventional operating systems. For better communication, we propose a simple metric-outlier proportion to measure quality of service: for N completed requests or jobs, if M jobs or requests' latencies exceed the outlier threshold t", "start_char_pos": 1065, "end_char_pos": 1065}, {"type": "D", "before": "we found, when the outlier limit decreases,", "after": null, "start_char_pos": 1068, "end_char_pos": 1111}, {"type": "D", "before": "proportion of a single server will significantly deteriorate. Meanwhile, the outlier", "after": null, "start_char_pos": 1124, "end_char_pos": 1208}, {"type": "R", "before": "further amplified by the system scale, including the system core number", "after": "M/N", "start_char_pos": 1223, "end_char_pos": 1294}, {"type": "D", "before": ", we surprisingly find that to reduce the service or job-level outlier proportion to 10\\%,", "after": null, "start_char_pos": 1319, "end_char_pos": 1409}, {"type": "R", "before": "or", "after": ",", "start_char_pos": 1441, "end_char_pos": 1443}, {"type": "R", "before": "the outlier proportion", "after": "we surprisingly find that so as to reduce the service outlier proportion to 10\\% (10\\% users will feel QoS degradation), the outlier proportion", "start_char_pos": 1502, "end_char_pos": 1524}, {"type": "R", "before": "needs", "after": "has", "start_char_pos": 1544, "end_char_pos": 1549}, {"type": "R", "before": "We also conducted a list of experiments to reveal the current Linux systems still suffer from poor outlier performance, including Linux kernel version 3.17.4, Linux kernel version 2.6.35M, a modified version of 2.6.35 integrated with sloppy counters and two representative real time schedulers", "after": "Also, we discuss the possible design spaces of 10-ms computing systems from perspectives of datacenter architectures, networking, OS and scheduling, and benchmarking", "start_char_pos": 1599, "end_char_pos": 1892}], "sents_char_pos": [0, 236, 326, 549, 829, 933, 1185, 1296, 1598]} {"doc_id": "1610.08732", "revision_depth": "1", "before_revision": "In this paper we study the exponential functionals of the processes X with independent increments , namelyI\\_t = \\int \\_0 ^t\\exp(-X \\_s )ds, \\_, \\,\\, t\\geq 0, and alsoI\\_ \\infty = \\int \\_0 ^{\\infty}\\exp(-X \\_s )ds. When X is a semi-martingale with absolutely continuous characteristics, we derive necessary and sufficient conditions for the existence of the Laplace exponent of I\\_t, and also the sufficient conditions of finiteness of the Mellin transform {\\bf E}( I \\_t^{\\alpha \\alpha\\in\\mathbb{R} . We give a recurrent integral equations for this Mellin transform . Then we apply these recurrent formulas to calculate the moments. We present also the corresponding results for the exponentials of Levy processes, which hold under less restrictive conditions then in \\mbox{%DIFAUXCMD \\cite{BY}\\hspace{0pt}%DIFAUXCMD } . In particular, we obtain an explicit formula for the moments of I \\_t and I\\_ \\infty , and we precise the exact number of finite moments of I \\_ \\infty .", "after_revision": "In this paper we study the exponential functionals of the processes X with independent increments , namely I_t = \\int _0 ^t\\exp(-X _s )ds, _, \\,\\, t\\geq 0, and also I_{\\infty = \\int _0 ^{\\infty}\\exp(-X _s )ds. When X is a semi-martingale with absolutely continuous characteristics, we derive recurrent integral equations for Mellin transform {\\bf E}( I _t^{\\alpha \\alpha\\in\\mathbb{R} , of the integral functional I_t . Then we apply these recurrent formulas to calculate the moments. We present also the corresponding results for the exponential functionals of Levy processes, which hold under less restrictive conditions then in }\\hspace{0pt}%DIFAUXCMD } the paper of Bertoin, Yor (2005) . In particular, we obtain an explicit formula for the moments of I _t and I_{\\infty , and we precise the exact number of finite moments of I _{\\infty .", "edit_actions": [{"type": "R", "before": "namelyI\\_t", "after": "namely I_t", "start_char_pos": 100, "end_char_pos": 110}, {"type": "R", "before": "\\_0", "after": "_0", "start_char_pos": 118, "end_char_pos": 121}, {"type": "R", "before": "\\_s", "after": "_s", "start_char_pos": 132, "end_char_pos": 135}, {"type": "R", "before": "\\_,", "after": "_,", "start_char_pos": 141, "end_char_pos": 144}, {"type": "D", "before": "alsoI\\_", "after": null, "start_char_pos": 163, "end_char_pos": 170}, {"type": "R", "before": "\\infty", "after": "also I_{\\infty", "start_char_pos": 171, "end_char_pos": 177}, {"type": "R", "before": "\\_0", "after": "_0", "start_char_pos": 185, "end_char_pos": 188}, {"type": "R", "before": "\\_s", "after": "_s", "start_char_pos": 206, "end_char_pos": 209}, {"type": "R", "before": "necessary and sufficient conditions for the existence of the Laplace exponent of I\\_t, and also the sufficient conditions of finiteness of the", "after": "recurrent integral equations for", "start_char_pos": 297, "end_char_pos": 439}, {"type": "R", "before": "\\_t^{\\alpha", "after": "_t^{\\alpha", "start_char_pos": 468, "end_char_pos": 479}, {"type": "R", "before": ". We give a recurrent integral equations for this Mellin transform", "after": ", of the integral functional I_t", "start_char_pos": 500, "end_char_pos": 566}, {"type": "R", "before": "exponentials", "after": "exponential functionals", "start_char_pos": 684, "end_char_pos": 696}, {"type": "D", "before": "\\mbox{%DIFAUXCMD \\cite{BY", "after": null, "start_char_pos": 769, "end_char_pos": 794}, {"type": "A", "before": null, "after": "the paper of Bertoin, Yor (2005)", "start_char_pos": 820, "end_char_pos": 820}, {"type": "D", "before": "\\_t and I\\_", "after": null, "start_char_pos": 889, "end_char_pos": 900}, {"type": "R", "before": "\\infty", "after": "_t and I_{\\infty", "start_char_pos": 901, "end_char_pos": 907}, {"type": "D", "before": "\\_", "after": null, "start_char_pos": 965, "end_char_pos": 967}, {"type": "R", "before": "\\infty", "after": "_{\\infty", "start_char_pos": 968, "end_char_pos": 974}], "sents_char_pos": [0, 214, 568, 633]} {"doc_id": "1612.03812", "revision_depth": "1", "before_revision": "In this work we introduce a stochastic model to describe directional changes in the movement of swimming bacteria. We use the probability density function (PDF) of turn angles, measured on tumbling E. coli wild-type {\\it , to build a Langevin equation for the deflection of the bacterial body swimming in isotropic media. We solved analytically this equation by means of the Green function method and show that three parameters are sufficient to describe the movement: a characteristic time, the steady-state solution and a control parameter. We conclude that the tumble motion, which is manifested as abrupt turns, is primarily caused by the rotational boost generated by the flagellar motor and complementarily by the rotational diffusion introduced by noise. We show that , in the tumble motion , the deflection is a non-stationary stochastic processes during times where the tumble occurs. By tuning the control parameter our model is able to explain small turns of the bacteria around their centres of mass along the run. We show that the deflection during the run is an Ornstein-Uhlenbeck process, which for typical run times is stationary. We conclude that, along the run, the rotational boosts do not exist or are neglectable and that only the rotational diffusion remains. Thus we have a single model to explain the turns of the bacterium during the run or tumble movements, through a control parameter that can be tuned through a critical value that can explain the transition between the two turn behaviours. This model is also able to explain very satisfactory all available statistical experimental data, such as PDFs and average values of turning angles and times, of both run and tumble motions.", "after_revision": "In this work we introduce a stochastic model to describe directional changes in the movement of swimming bacteria. We use the probability density function (PDF) of turn angles, measured on tumbling wild-type {\\it E. coli , to build a Langevin equation for the deflection of the bacterial body swimming in isotropic media. We have solved this equation analytically by means of the Green function method and shown that three parameters are sufficient to describe the movement: the characteristic time, the steady-state solution and the control parameter. We conclude that the tumble motion, which is manifested as abrupt turns, is primarily caused by the rotational boost generated by the flagellar motor and complementarily by the rotational diffusion introduced by noise. We show that in the tumble motion the deflection is a non-stationary stochastic process during times at which the tumbling occurs. By tuning the control parameter our model is able to explain small turns of the bacteria around their centres of mass along the run. We show that the deflection during the run is an OrnsteinUhlenbeck process, which for typical run times is stationary. We conclude that, along the run, the rotational boosts do not exist and that only the rotational diffusion remains. Thus we have a single model to explain the turns of through a critical value that can explain the transition between the two turn behaviours. This model is the bacterium during the run or tumble movements, through a control parameter that can be tuned also able to explain in a very satisfactory way all available statistical experimental data, such as PDFs and average values of turning angles times, of both run and tumble motions.", "edit_actions": [{"type": "D", "before": "E. coli", "after": null, "start_char_pos": 198, "end_char_pos": 205}, {"type": "A", "before": null, "after": "E. coli", "start_char_pos": 221, "end_char_pos": 221}, {"type": "R", "before": "solved analytically this equation", "after": "have solved this equation analytically", "start_char_pos": 326, "end_char_pos": 359}, {"type": "R", "before": "show", "after": "shown", "start_char_pos": 402, "end_char_pos": 406}, {"type": "R", "before": "a", "after": "the", "start_char_pos": 470, "end_char_pos": 471}, {"type": "R", "before": "a", "after": "the", "start_char_pos": 523, "end_char_pos": 524}, {"type": "D", "before": ",", "after": null, "start_char_pos": 776, "end_char_pos": 777}, {"type": "D", "before": ",", "after": null, "start_char_pos": 799, "end_char_pos": 800}, {"type": "R", "before": "processes during times where the tumble", "after": "process during times at which the tumbling", "start_char_pos": 847, "end_char_pos": 886}, {"type": "R", "before": "Ornstein-Uhlenbeck", "after": "OrnsteinUhlenbeck", "start_char_pos": 1077, "end_char_pos": 1095}, {"type": "D", "before": "or are neglectable", "after": null, "start_char_pos": 1216, "end_char_pos": 1234}, {"type": "R", "before": "the bacterium during the run or tumble movements, through a control parameter that can be tuned through a", "after": "through a", "start_char_pos": 1335, "end_char_pos": 1440}, {"type": "A", "before": null, "after": "the bacterium during the run or tumble movements, through a control parameter that can be tuned", "start_char_pos": 1535, "end_char_pos": 1535}, {"type": "R", "before": "very satisfactory", "after": "in a very satisfactory way", "start_char_pos": 1557, "end_char_pos": 1574}, {"type": "D", "before": "and", "after": null, "start_char_pos": 1670, "end_char_pos": 1673}], "sents_char_pos": [0, 114, 322, 543, 762, 894, 1027, 1147, 1282, 1520]} {"doc_id": "1612.09183", "revision_depth": "1", "before_revision": "To this date, all methodologies for detecting plagiarism have focused on investigating the final digital \"outcome\", eg. a document or source code. Our novel approach takes the creation process into account using logged events . We look at interaction logs of an author with the software used for creation of the work. Detection relies on comparing histograms of command usages of multiple logs . A work is classified as plagiarism , if its log deviates too much from logs of \"honestly created\" works or if its log is too similar to another log. The technique supports detecting plagiarism for digital outcomes stemming from unique taskssuch as thesis as well as equal\\emph{ \\emph{ tasks such as assignments where the same problem sets are solved by many students. Evaluation focuses on the latter case using collected logs by an interactive development environment (IDE) from more than 60 students for three programming assignments.", "after_revision": "All methodologies for detecting plagiarism to date have focused on the final digital \"outcome\", such as a document or source code. Our novel approach takes the creation process into account using logged events collected by special software or by the macro recorders found in most office applications . We look at an author's interaction logs with the software used to create the work. Detection relies on comparing the histograms of multiple logs' command use . A work is classified as plagiarism if its log deviates too much from logs of \"honestly created\" works or if its log is too similar to another log. The technique supports the detection of plagiarism for digital outcomes that stem from\\emph{unique tasks, such as theses and\\emph{equal tasks such as assignments for which the same problem sets are solved by multiple students. Focusing on the latter case , we evaluate this approach using logs collected by an interactive development environment (IDE) from more than sixty students who completed three programming assignments.", "edit_actions": [{"type": "R", "before": "To this date, all", "after": "All", "start_char_pos": 0, "end_char_pos": 17}, {"type": "A", "before": null, "after": "to date", "start_char_pos": 57, "end_char_pos": 57}, {"type": "D", "before": "investigating", "after": null, "start_char_pos": 74, "end_char_pos": 87}, {"type": "R", "before": "eg.", "after": "such as", "start_char_pos": 117, "end_char_pos": 120}, {"type": "A", "before": null, "after": "collected by special software or by the macro recorders found in most office applications", "start_char_pos": 227, "end_char_pos": 227}, {"type": "R", "before": "interaction logs of an author", "after": "an author's interaction logs", "start_char_pos": 241, "end_char_pos": 270}, {"type": "R", "before": "for creation of", "after": "to create", "start_char_pos": 294, "end_char_pos": 309}, {"type": "R", "before": "histograms of command usages of multiple logs", "after": "the histograms of multiple logs' command use", "start_char_pos": 350, "end_char_pos": 395}, {"type": "D", "before": ",", "after": null, "start_char_pos": 433, "end_char_pos": 434}, {"type": "R", "before": "detecting", "after": "the detection of", "start_char_pos": 570, "end_char_pos": 579}, {"type": "R", "before": "stemming from unique taskssuch as thesis as well as equal", "after": "that stem from", "start_char_pos": 612, "end_char_pos": 669}, {"type": "A", "before": null, "after": "unique", "start_char_pos": 675, "end_char_pos": 675}, {"type": "A", "before": null, "after": "tasks, such as theses and", "start_char_pos": 676, "end_char_pos": 676}, {"type": "A", "before": null, "after": "equal", "start_char_pos": 682, "end_char_pos": 682}, {"type": "R", "before": "where", "after": "for which", "start_char_pos": 709, "end_char_pos": 714}, {"type": "R", "before": "many students. Evaluation focuses", "after": "multiple students. Focusing", "start_char_pos": 751, "end_char_pos": 784}, {"type": "R", "before": "using collected logs", "after": ", we evaluate this approach using logs collected", "start_char_pos": 804, "end_char_pos": 824}, {"type": "R", "before": "60 students for", "after": "sixty students who completed", "start_char_pos": 888, "end_char_pos": 903}], "sents_char_pos": [0, 147, 229, 319, 397, 546, 765]} {"doc_id": "1612.09379", "revision_depth": "1", "before_revision": "Assuming that mutation and fixation processes are reversible Markov processes, we prove that the equilibrium ensemble of sequences obeys a Boltzmann distribution with \\exp(4N_e m(1 - 1/(2N))), where m is a Malthusian fitness and N_e and N are the effective and actual population sizes. Combining this finding with the knowledge of protein folding, we derive a correspondence between protein fitness and folding free energy, i.e., 4N_e m (1 - 1/(2N)) and -\\Delta G_{ND}/k_B T_s , where \\Delta G_{ND} \\equiv G_N - G_D, G_N and G_D are the native and denatured free energies, and T_s is the effective temperatureof natural selection. In the preceding manuscript, we analyzed dimensionless free energy changes, \\Delta \\psi_N (= \\Delta G_N / k_B T_s ), due to single nucleotide mutations, for which the total interaction \\psi_N of a sequence was estimated from a multiple sequence alignment . Based on this analyis, we study the equilibrium state of protein stability in a monoclonal approximation, in which protein evolution proceeds with single amino acid substitutions fixed at a time in a population. The ensemble of proteins attains the equilibrium, \\psi_N= \\psi_N ^{eq, where the average of \\Delta \\psi} _{ N } over fixed mutants is equal to zero. Approximating the probability density function (PDF) of \\Delta \\psi_N by a log-normal distribution, the PDF of \\Delta \\psi _{N (\\simeq \\Delta\\Delta \\psi_{ND}) in fixed mutants is estimated. \\psi_N ^{eq} for 14 protein domains agree well with \\psi_N averaged over homologous sequences. The PDFs of } K_a/K_s, which is the ratio of nonsynonymous to synonymous substitution rate per site, at equilibrium confirm that T_s negatively correlates with the amino acid substitution rate. Contrary to the neutral theory, neutral selection is not significant even in fixed mutants .", "after_revision": "Assuming that mutation and fixation processes are reversible Markov processes, we prove that the equilibrium ensemble of sequences obeys a Boltzmann distribution with \\exp(4N_e m(1 - 1/(2N))), where m is a Malthusian fitness and N_e and N are the effective and actual population sizes. On the other hand, the probability distribution of sequences with maximum entropy that satisfies a given amino acid composition at each site and a given pairwise amino acid frequency at each site pair is a Boltzmann distribution with \\exp( - \\psi_N), where \\psi_N is represented as the sum of one body and pairwise potentials. A protein folding theory indicates that homologous sequences obey a canonical ensemble characterized by \\exp( -\\Delta G_{ND}/k_B T_s ) or by \\exp(- G_{N , where \\Delta G_{ND} \\equiv G_N - G_D, G_N and G_D are the native and denatured free energies, and T_s is selective temperature. Thus, 4N_e m (1 - 1 / (2N)), -\\Delta G_{ND k_B T_s , and -\\Delta \\psi_{ND . Based on , where the average of \\Delta \\psi} the analysis of the changes (\\Delta \\psi_N) of \\psi_N due to single nucleotide nonsynonymous substitutions, T_s, and then glass transition temperature T_g, and \\Delta G _{ ND } are estimated with reasonable values for 14 protein domains. In addition, approximating the probability density function (PDF) of \\Delta \\psi_N by a log-normal distribution, PDFs of \\Delta \\psi (\\simeq \\Delta\\Delta \\psi_{ND}) in fixed mutants is estimated. \\psi_N ^{eq} for 14 protein domains agree well with \\psi_N averaged over homologous sequences. The PDFs of } _N and K_a/K_s, which is the ratio of nonsynonymous to synonymous substitution rate per site, in all and in fixed mutants are estimated. It is confirmed that T_s negatively correlates with the average of K_a/K_s. Stabilizing mutations are significantly fixed by positive selection, and balance with destabilizing mutations fixed by random drift. Contrary to the neutral theory, the proportion of neutral selection is not large .", "edit_actions": [{"type": "R", "before": "Combining this finding with the knowledge of protein folding, we derive a correspondence between protein fitness and folding free energy, i.e., 4N_e m (1", "after": "On the other hand, the probability distribution of sequences with maximum entropy that satisfies a given amino acid composition at each site and a given pairwise amino acid frequency at each site pair is a Boltzmann distribution with \\exp(", "start_char_pos": 286, "end_char_pos": 439}, {"type": "R", "before": "1/(2N)) and", "after": "\\psi_N), where \\psi_N is represented as the sum of one body and pairwise potentials. A protein folding theory indicates that homologous sequences obey a canonical ensemble characterized by \\exp(", "start_char_pos": 442, "end_char_pos": 453}, {"type": "A", "before": null, "after": ") or by \\exp(- G_{N", "start_char_pos": 477, "end_char_pos": 477}, {"type": "R", "before": "the effective temperatureof natural selection. In the preceding manuscript, we analyzed dimensionless free energy changes, \\Delta \\psi_N (= \\Delta G_N", "after": "selective temperature. Thus, 4N_e m (1 - 1", "start_char_pos": 585, "end_char_pos": 735}, {"type": "A", "before": null, "after": "(2N)), -\\Delta G_{ND", "start_char_pos": 738, "end_char_pos": 738}, {"type": "R", "before": "), due to single nucleotide mutations, for which the total interaction \\psi_N of a sequence was estimated from a multiple sequence alignment", "after": ", and -\\Delta \\psi_{ND", "start_char_pos": 747, "end_char_pos": 887}, {"type": "D", "before": "this analyis, we study the equilibrium state of protein stability in a monoclonal approximation, in which protein evolution proceeds with single amino acid substitutions fixed at a time in a population. The ensemble of proteins attains the equilibrium, \\psi_N= \\psi_N ^{eq", "after": null, "start_char_pos": 899, "end_char_pos": 1171}, {"type": "A", "before": null, "after": "the analysis of the changes (\\Delta \\psi_N) of \\psi_N due to single nucleotide nonsynonymous substitutions, T_s, and then glass transition temperature T_g, and \\Delta G", "start_char_pos": 1207, "end_char_pos": 1207}, {"type": "R", "before": "N", "after": "ND", "start_char_pos": 1211, "end_char_pos": 1212}, {"type": "R", "before": "over fixed mutants is equal to zero. Approximating", "after": "are estimated with reasonable values for 14 protein domains. In addition, approximating", "start_char_pos": 1215, "end_char_pos": 1265}, {"type": "R", "before": "the PDF", "after": "PDFs", "start_char_pos": 1352, "end_char_pos": 1359}, {"type": "D", "before": "_{N", "after": null, "start_char_pos": 1375, "end_char_pos": 1378}, {"type": "A", "before": null, "after": "_N and", "start_char_pos": 1551, "end_char_pos": 1551}, {"type": "R", "before": "at equilibrium confirm", "after": "in all and in fixed mutants are estimated. It is confirmed", "start_char_pos": 1639, "end_char_pos": 1661}, {"type": "R", "before": "amino acid substitution rate.", "after": "average of K_a/K_s. Stabilizing mutations are significantly fixed by positive selection, and balance with destabilizing mutations fixed by random drift.", "start_char_pos": 1702, "end_char_pos": 1731}, {"type": "A", "before": null, "after": "the proportion of", "start_char_pos": 1764, "end_char_pos": 1764}, {"type": "R", "before": "significant even in fixed mutants", "after": "large", "start_char_pos": 1790, "end_char_pos": 1823}], "sents_char_pos": [0, 285, 631, 1101, 1251, 1441, 1536, 1731]} {"doc_id": "1701.01891", "revision_depth": "1", "before_revision": "In this paper we consider some insurance policies related with drawdown and drawup events of log-returns for an underlying asset modeled by a spectrally negative geometric L\\'evy process. We consider four contracts among which three were introduced in Zhang et al. (2013) for a geometric Brownian motion. The first one is an insurance contract where protection buyer pays a constant premium until the drawdown of fixed size of log-returns occurs. In return he/she receives certain insured amount at the drawdown epoch. Next insurance contract provides protection from any specified drawdown with a drawup contingency. This contract expires early if certain fixed drawup event occurs prior to fixed drawdown. The last two contracts are extensions of the previous ones by additional cancellable feature which allows an investor to terminate the contract earlier. We focus on two problems: calculating the fair premium p for the basic contracts and identifying the optimal stopping rule for the polices with cancellable feature. To do this we solve some two-sided exit problems related with the drawdown and the drawup of spectrally negative L\\'evy processes which is of own scientific interest. We also heavily rely on a theory of optimal stopping.", "after_revision": "In this paper we consider some insurance policies related to drawdown and drawup events of log-returns for an underlying asset modeled by a spectrally negative geometric L\\'evy process. We consider four contracts , three of which were introduced in Zhang et al. (2013) for a geometric Brownian motion. The first one is an insurance contract where the protection buyer pays a constant premium until the drawdown of fixed size of log-returns occurs. In return he/she receives a certain insured amount at the drawdown epoch. The next insurance contract provides protection from any specified drawdown with a drawup contingency. This contract expires early if a certain fixed drawup event occurs prior to the fixed drawdown. The last two contracts are extensions of the previous ones by an additional cancellation feature which allows the investor to terminate the contract earlier. We focus on two problems: calculating the fair premium p for the basic contracts and identifying the optimal stopping rule for the policies with the cancellation feature. To do this we solve some two-sided exit problems related to drawdown and drawup of spectrally negative L\\'evy processes , which is of independent mathematical interest. We also heavily rely on the theory of optimal stopping.", "edit_actions": [{"type": "R", "before": "with", "after": "to", "start_char_pos": 58, "end_char_pos": 62}, {"type": "R", "before": "among which three", "after": ", three of which", "start_char_pos": 215, "end_char_pos": 232}, {"type": "A", "before": null, "after": "the", "start_char_pos": 350, "end_char_pos": 350}, {"type": "A", "before": null, "after": "a", "start_char_pos": 474, "end_char_pos": 474}, {"type": "R", "before": "Next", "after": "The next", "start_char_pos": 521, "end_char_pos": 525}, {"type": "A", "before": null, "after": "a", "start_char_pos": 651, "end_char_pos": 651}, {"type": "A", "before": null, "after": "the", "start_char_pos": 695, "end_char_pos": 695}, {"type": "R", "before": "additional cancellable", "after": "an additional cancellation", "start_char_pos": 774, "end_char_pos": 796}, {"type": "R", "before": "an", "after": "the", "start_char_pos": 818, "end_char_pos": 820}, {"type": "R", "before": "polices with cancellable", "after": "policies with the cancellation", "start_char_pos": 996, "end_char_pos": 1020}, {"type": "R", "before": "with the drawdown and the", "after": "to drawdown and", "start_char_pos": 1087, "end_char_pos": 1112}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1160, "end_char_pos": 1160}, {"type": "R", "before": "own scientific", "after": "independent mathematical", "start_char_pos": 1173, "end_char_pos": 1187}, {"type": "R", "before": "a", "after": "the", "start_char_pos": 1222, "end_char_pos": 1223}], "sents_char_pos": [0, 187, 304, 447, 520, 619, 711, 864, 1029, 1197]} {"doc_id": "1703.00259", "revision_depth": "3", "before_revision": "We discuss a binary nature of funding impacts . Under some conditions, funding is either cost or benefit, i.e., one of the lending/borrowing rates does not play any role in pricing derivatives. When we price derivatives , considering different lending/borrowing rates leads to semi-linear BSDEs and PDEs, so we need to solve the equations numerically. However, once we can guarantee that only one of the rates affects pricing, we can recover linear equations and derive analytic formulae . Moreover, as a byproduct, our results explain how debt value adjustment (DVA) and funding benefits are different . It is often believed that DVA and funding benefits are overlapped but it will be shown that the two components are affected by different mathematical structures of derivative transactions. We will see later that FBA occurs where the payoff is non-increasing , but this relationship becomes weaken as the funding choices of underlying assets are transferred to repo markets.", "after_revision": "We discuss the binary nature of funding impact in derivative valuation . Under some conditions, funding is either a cost or a benefit, i.e., one of the lending/borrowing rates does not play a role in pricing derivatives. When derivatives are priced , considering different lending/borrowing rates leads to semi-linear BSDEs and PDEs, and thus it is necessary to solve the equations numerically. However, once it can be guaranteed that only one of the rates affects pricing, linear equations can be recovered and analytical formulae can be derived . Moreover, as a byproduct, our results explain how debt value adjustment (DVA) and funding benefits are dissimilar . It is often believed that considering both DVA and funding benefits results in a double-counting issue but it will be shown that the two components are affected by different mathematical structures of derivative transactions. We find that funding benefit is related to the decreasing property of the payoff function , but this relationship decreases as the funding choices of underlying assets are transferred to repo markets.", "edit_actions": [{"type": "R", "before": "a", "after": "the", "start_char_pos": 11, "end_char_pos": 12}, {"type": "R", "before": "impacts", "after": "impact in derivative valuation", "start_char_pos": 38, "end_char_pos": 45}, {"type": "R", "before": "cost or", "after": "a cost or a", "start_char_pos": 89, "end_char_pos": 96}, {"type": "R", "before": "any", "after": "a", "start_char_pos": 161, "end_char_pos": 164}, {"type": "R", "before": "we price derivatives", "after": "derivatives are priced", "start_char_pos": 199, "end_char_pos": 219}, {"type": "R", "before": "so we need", "after": "and thus it is necessary", "start_char_pos": 305, "end_char_pos": 315}, {"type": "R", "before": "we can guarantee", "after": "it can be guaranteed", "start_char_pos": 366, "end_char_pos": 382}, {"type": "R", "before": "we can recover linear equations and derive analytic formulae", "after": "linear equations can be recovered and analytical formulae can be derived", "start_char_pos": 427, "end_char_pos": 487}, {"type": "R", "before": "different", "after": "dissimilar", "start_char_pos": 593, "end_char_pos": 602}, {"type": "A", "before": null, "after": "considering both", "start_char_pos": 631, "end_char_pos": 631}, {"type": "R", "before": "are overlapped", "after": "results in a double-counting issue", "start_char_pos": 657, "end_char_pos": 671}, {"type": "R", "before": "will see later that FBA occurs where the payoff is non-increasing", "after": "find that funding benefit is related to the decreasing property of the payoff function", "start_char_pos": 798, "end_char_pos": 863}, {"type": "R", "before": "becomes weaken", "after": "decreases", "start_char_pos": 888, "end_char_pos": 902}], "sents_char_pos": [0, 47, 193, 351, 489, 604, 794]} {"doc_id": "1703.05475", "revision_depth": "1", "before_revision": "Graphs and network data are ubiquitous across a wide spectrum of scientific and application domains. Often in practice, an input graph can be considered as an observed snapshot of a (potentially continuous) hidden domain or process. Subsequent analysis, processing, and inferences are then performed on this observed graph. In this paper we advocate the perspective that an observed graph is often a noisy version of some discretized 1-skeleton of a hidden domain, and specifically we will consider the following natural network model: We assume that there is a true graph {G^*} which is a certain proximity graph for points sampled from a hidden domain X; while the observed graph G is an Erd\\\"{o}s-R\\'{e}nyi %DIFDELCMD < \\xspace %%% type perturbed version of {G^*}. Our network model is related to, and slightly generalizes, the much-celebrated small-world network model originally proposed by Watts and Strogatz. However, the main question we aim to answer is orthogonal to the usual studies of network models (which often focuses on characterizing / predicting behaviors and properties of real-world networks). Specifically, we aim to recover the metric structure of {G^*} (which reflects that of the hidden space X as we will show) from the observed graph G. Our main result is that a simple filtering process based on the Jaccard index can recover this metric within a multiplicative factor of 2 under our network model. Our work makes one step towards the general question of inferring structure of a hidden space from its observed noisy graph representation. In addition, our results also provide a theoretical understanding for Jaccard-Index-based denoising approaches.", "after_revision": "Graphs and network data are ubiquitous across a wide spectrum of scientific and application domains. Often in practice, an input graph can be considered as an observed snapshot of a (potentially continuous) hidden domain or process. Subsequent analysis, processing, and inferences are then performed on this observed graph. In this paper we advocate the perspective that an observed graph is often a noisy version of some discretized 1-skeleton of a hidden domain, and specifically we will consider the following natural network model: We assume that there is a true graph {G^*} which is a certain proximity graph for points sampled from a hidden domain X; while the observed graph G is an Erd\\\"{o}s-R\\'{e}nyi %DIFDELCMD < \\xspace %%% type perturbed version of {G^*}. Our network model is related to, and slightly generalizes, the much-celebrated small-world network model originally proposed by Watts and Strogatz. However, the main question we aim to answer is orthogonal to the usual studies of network models (which often focuses on characterizing / predicting behaviors and properties of real-world networks). Specifically, we aim to recover the metric structure of {G^*} (which reflects that of the hidden space X as we will show) from the observed graph G. Our main result is that a simple filtering process based on the Jaccard index can recover this metric within a multiplicative factor of 2 under our network model. Our work makes one step towards the general question of inferring structure of a hidden space from its observed noisy graph representation. In addition, our results also provide a theoretical understanding for Jaccard-Index-based denoising approaches.", "edit_actions": [], "sents_char_pos": [0, 100, 232, 323, 656, 767, 915, 1114, 1426, 1566]} {"doc_id": "1704.01221", "revision_depth": "2", "before_revision": "Network alignment (NA) aims to find a node mapping between compared networks in order to uncover highly similar ( i.e., conserved) network regions. Existing NA methods are homogeneous, i.e., they can deal only with networks containing nodes and edges of one type. However, due to increasing amounts of heterogeneous real-world network data with nodes and edges of different types, we extend three recent state-of-the-art homogeneous NA methods, WAVE, MAGNA++, and SANA, to allow for heterogeneous NA for the first time. We introduce several algorithmic novelties to achieve this . Namely, these existing NA methods compute homogeneous graphlet-based node similarities and then find high-scoring alignments with respect to these similarities, while simultaneously maximizing the number of conserved edges. Instead, we generalize homogeneous graphlets to their heterogeneous counterparts, which we then use to develop a new measure of heterogeneous node similarity. Also, we generalize S^3, a state-of-the-art measure of edge conservation for homogeneous NA, to its heterogeneous counterpart. Then, we find high-scoring alignments with respect to our heterogeneous node similarity and edge conservation measures. In evaluations on synthetic networks and real-world biological network data , our proposed heterogeneous NA methods lead to higher-quality alignments and better robustness to noise in the data than their homogeneous counterparts .", "after_revision": "Network alignment (NA) compares networks with the goal of finding a node mapping that uncovers highly similar ( conserved) network regions. Existing NA methods are homogeneous, i.e., they can deal only with networks containing nodes and edges of one type. Due to increasing amounts of heterogeneous network data with nodes or edges of different types, we extend three recent state-of-the-art homogeneous NA methods, WAVE, MAGNA++, and SANA, to allow for heterogeneous NA for the first time. We introduce several algorithmic novelties . Namely, these existing methods compute homogeneous graphlet-based node similarities and then find high-scoring alignments with respect to these similarities, while simultaneously maximizing the amount of conserved edges. Instead, we extend homogeneous graphlets to their heterogeneous counterparts, which we then use to develop a new measure of heterogeneous node similarity. Also, we extend S^3, a state-of-the-art measure of edge conservation for homogeneous NA, to its heterogeneous counterpart. Then, we find high-scoring alignments with respect to our heterogeneous node similarity and edge conservation measures. In evaluations on synthetic and real-world biological networks , our proposed heterogeneous NA methods lead to higher-quality alignments and better robustness to noise in the data than their homogeneous counterparts . The software and data from this work is available upon request .", "edit_actions": [{"type": "R", "before": "aims to find", "after": "compares networks with the goal of finding", "start_char_pos": 23, "end_char_pos": 35}, {"type": "R", "before": "between compared networks in order to uncover", "after": "that uncovers", "start_char_pos": 51, "end_char_pos": 96}, {"type": "D", "before": "i.e.,", "after": null, "start_char_pos": 114, "end_char_pos": 119}, {"type": "R", "before": "However, due", "after": "Due", "start_char_pos": 264, "end_char_pos": 276}, {"type": "D", "before": "real-world", "after": null, "start_char_pos": 316, "end_char_pos": 326}, {"type": "R", "before": "and", "after": "or", "start_char_pos": 351, "end_char_pos": 354}, {"type": "D", "before": "to achieve this", "after": null, "start_char_pos": 563, "end_char_pos": 578}, {"type": "D", "before": "NA", "after": null, "start_char_pos": 604, "end_char_pos": 606}, {"type": "R", "before": "number", "after": "amount", "start_char_pos": 778, "end_char_pos": 784}, {"type": "R", "before": "generalize", "after": "extend", "start_char_pos": 817, "end_char_pos": 827}, {"type": "R", "before": "generalize", "after": "extend", "start_char_pos": 973, "end_char_pos": 983}, {"type": "D", "before": "networks", "after": null, "start_char_pos": 1239, "end_char_pos": 1247}, {"type": "R", "before": "network data", "after": "networks", "start_char_pos": 1274, "end_char_pos": 1286}, {"type": "A", "before": null, "after": ". The software and data from this work is available upon request", "start_char_pos": 1440, "end_char_pos": 1440}], "sents_char_pos": [0, 147, 263, 519, 804, 963, 1090, 1210]} {"doc_id": "1705.05882", "revision_depth": "1", "before_revision": "We propose a continuous-time model of trading among risk-neutral agents with heterogeneous beliefs. Agents face quadratic costs-of-carry on their positions and as a consequence, their marginal valuation of the asset decreases when the magnitude of their position increases , as it would be the case for risk-averse agents. In the equilibrium models of investors with heterogeneous beliefs that followed the original work by Harrison and Kreps , investors are risk-neutral, short-selling is prohibited and agents face a constant marginal cost of carrying positions. The resulting resale option guarantees that the equilibrium price exceeds the price of the asset in a static buy-and-hold model where speculation is ruled out . Our model features three main novelties. First, increasing marginal costs entail that the price depends on the exogenous supply. Second, in addition to the resale option, agents may also value an option to delay, and this may cause the market to equilibrate \\emph{below the static buy-and-hold price. Third, we introduce the possibility of short-selling ; then the resale option for agents with short positions partly compensates the resale option for long agents. We characterize the unique equilibrium of our model through a Hamilton-Jacobi-Bellman equation of a novel form and use it to derive several comparative statics results .", "after_revision": "We propose a continuous-time model of trading with heterogeneous beliefs. Risk-neutral agents face quadratic costs-of-carry on positions and thus their marginal valuations decrease with the size of their position , as it would be the case for risk-averse agents. In the equilibrium models of heterogeneous beliefs that followed Harrison-Kreps , investors are risk-neutral, short-selling is prohibited and agents face constant marginal costs of carrying positions. The resulting resale option guarantees that the price exceeds the price of the asset when speculation is ruled out ; the difference is identified as a bubble. In our model increasing marginal costs entail that the price depends on asset supply. Second, agents also value an option to delay, and this may cause the market to equilibrate \\emph{ below the buy-and-hold price. Third, we introduce the possibility of short-selling . A Hamilton-Jacobi-Bellman equation of a novel form quantifies precisely the influence of the costs-of-carry on the price. An unexpected decrease in shorting costs may lead to the collapse of a bubble; this links the financial innovations that facilitated shorting of MBSs to the subsequent collapse of prices .", "edit_actions": [{"type": "D", "before": "among risk-neutral agents", "after": null, "start_char_pos": 46, "end_char_pos": 71}, {"type": "R", "before": "Agents", "after": "Risk-neutral agents", "start_char_pos": 100, "end_char_pos": 106}, {"type": "R", "before": "their positions and as a consequence, their marginal valuation of the asset decreases when the magnitude", "after": "positions and thus their marginal valuations decrease with the size", "start_char_pos": 140, "end_char_pos": 244}, {"type": "D", "before": "increases", "after": null, "start_char_pos": 263, "end_char_pos": 272}, {"type": "D", "before": "investors with", "after": null, "start_char_pos": 352, "end_char_pos": 366}, {"type": "R", "before": "the original work by Harrison and Kreps", "after": "Harrison-Kreps", "start_char_pos": 403, "end_char_pos": 442}, {"type": "R", "before": "a constant marginal cost", "after": "constant marginal costs", "start_char_pos": 517, "end_char_pos": 541}, {"type": "D", "before": "equilibrium", "after": null, "start_char_pos": 613, "end_char_pos": 624}, {"type": "R", "before": "in a static buy-and-hold model where", "after": "when", "start_char_pos": 662, "end_char_pos": 698}, {"type": "R", "before": ". Our model features three main novelties. First,", "after": "; the difference is identified as a bubble. In our model", "start_char_pos": 724, "end_char_pos": 773}, {"type": "R", "before": "the exogenous", "after": "asset", "start_char_pos": 833, "end_char_pos": 846}, {"type": "R", "before": "in addition to the resale option, agents may", "after": "agents", "start_char_pos": 863, "end_char_pos": 907}, {"type": "D", "before": "below", "after": null, "start_char_pos": 990, "end_char_pos": 995}, {"type": "R", "before": "the static", "after": "below the", "start_char_pos": 996, "end_char_pos": 1006}, {"type": "R", "before": "; then the resale option for agents with short positions partly compensates the resale option for long agents. We characterize the unique equilibrium of our model through a", "after": ". A", "start_char_pos": 1080, "end_char_pos": 1252}, {"type": "R", "before": "and use it to derive several comparative statics results", "after": "quantifies precisely the influence of the costs-of-carry on the price. An unexpected decrease in shorting costs may lead to the collapse of a bubble; this links the financial innovations that facilitated shorting of MBSs to the subsequent collapse of prices", "start_char_pos": 1302, "end_char_pos": 1358}], "sents_char_pos": [0, 99, 322, 564, 725, 766, 854, 1026, 1081, 1190]} {"doc_id": "1705.06479", "revision_depth": "3", "before_revision": "We investigate the dynamical effects of non-Gaussian asymmetric stable L\\'evy fluctuations on the evolution of the transcription factor activator in a genetic regulation system . The noisy fluctuations arise from the synthesis reaction rate . We compute two deterministic quantities, the mean first exit time (MFET) and the first escape probability (FEP), in order to examine the likelihood for transcriptions: The mean time scale for the system exits the low concentration state (the longer the exit time, the less likely for transcription) and the switch probability from low concentration states to high concentration states (corresponding to likelihood for transcription) . By focusing on the impact of skewness (i.e., non-symmetry) in the probability distributions of noise, we find that the fluctuations in the synthesis reaction rate lead to peculiar transitions to high concentrations and thus to possible transcriptions, such as realizing higher likelihood of transcription for larger positive skewness (i.e., asymmetry) index \\beta, causing a bifurcation for the likelihood of transcription at the critical non-Gaussianity index value \\alpha=1 (i.e., beyond which the likelihood for transcription suddenly increases ), and achieving a turning point at the threshold value \\beta \\approx 0.55 (i.e., beyond which the likelihood for transcription reversed for \\alpha values). The bifurcation and turning point phenomena do not occur in the symmetric noise case (\\beta =0). We conduct a series of numerical experiments about `regulating' the likelihood of gene transcription by tuning asymmetric stable L\\'evy noise indexes. These offer insights for possible ways of achieving gene regulation in experimental research.", "after_revision": "This work is devoted to investigating the evolution of concentration in a genetic regulation system , when the synthesis reaction rate is under additive and multiplicative asymmetric stable L\\'evy fluctuations . By focusing on the impact of skewness (i.e., non-symmetry) in the probability distributions of noise, we find that via examining the mean first exit time (MFET) and the first escape probability (FEP), the asymmetric fluctuations, interacting with nonlinearity in the system, lead to peculiar likelihood for transcription. This includes, in the additive noise case, realizing higher likelihood of transcription for larger positive skewness (i.e., asymmetry) index \\beta, causing a stochastic bifurcation at the non-Gaussianity index value \\alpha=1 (i.e., it is a separating point or line for the likelihood for transcription ), and achieving a turning point at the threshold value \\beta \\approx -0.5 (i.e., beyond which the likelihood for transcription suddenly reversed for \\alpha values). The stochastic bifurcation and turning point phenomena do not occur in the symmetric noise case (\\beta =0). While in the multiplicative noise case, non-Gaussianity index value \\alpha=1 is a separating point or line for both the mean first exit time (MFET) and the first escape probability (FEP). We also investigate the noise enhanced stability phenomenon. Additionally, we are able to specify the regions in the whole parameter space for the asymmetric noise, in which we attain desired likelihood for transcription. We have conducted a series of numerical experiments in `regulating' the likelihood of gene transcription by tuning asymmetric stable L\\'evy noise indexes. This work offers insights for possible ways of achieving gene regulation in experimental research.", "edit_actions": [{"type": "R", "before": "We investigate the dynamical effects of non-Gaussian asymmetric stable L\\'evy fluctuations on the evolution of the transcription factor activator", "after": "This work is devoted to investigating the evolution of concentration", "start_char_pos": 0, "end_char_pos": 145}, {"type": "R", "before": ". The noisy fluctuations arise from", "after": ", when", "start_char_pos": 177, "end_char_pos": 212}, {"type": "R", "before": ". We compute two deterministic quantities, the mean first exit time (MFET) and the first escape probability (FEP), in order to examine the likelihood for transcriptions: The mean time scale for the system exits the low concentration state (the longer the exit time, the less likely for transcription) and the switch probability from low concentration states to high concentration states (corresponding to likelihood for transcription)", "after": "is under additive and multiplicative asymmetric stable L\\'evy fluctuations", "start_char_pos": 241, "end_char_pos": 675}, {"type": "R", "before": "the fluctuations in the synthesis reaction rate", "after": "via examining the mean first exit time (MFET) and the first escape probability (FEP), the asymmetric fluctuations, interacting with nonlinearity in the system,", "start_char_pos": 793, "end_char_pos": 840}, {"type": "R", "before": "transitions to high concentrations and thus to possible transcriptions, such as", "after": "likelihood for transcription. This includes, in the additive noise case,", "start_char_pos": 858, "end_char_pos": 937}, {"type": "R", "before": "bifurcation for the likelihood of transcription at the critical", "after": "stochastic bifurcation at the", "start_char_pos": 1053, "end_char_pos": 1116}, {"type": "R", "before": "beyond which", "after": "it is a separating point or line for", "start_char_pos": 1161, "end_char_pos": 1173}, {"type": "D", "before": "suddenly increases", "after": null, "start_char_pos": 1207, "end_char_pos": 1225}, {"type": "R", "before": "0.55", "after": "-0.5", "start_char_pos": 1296, "end_char_pos": 1300}, {"type": "A", "before": null, "after": "suddenly", "start_char_pos": 1354, "end_char_pos": 1354}, {"type": "A", "before": null, "after": "stochastic", "start_char_pos": 1388, "end_char_pos": 1388}, {"type": "R", "before": "We conduct", "after": "While in the multiplicative noise case, non-Gaussianity index value \\alpha=1 is a separating point or line for both the mean first exit time (MFET) and the first escape probability (FEP). We also investigate the noise enhanced stability phenomenon. Additionally, we are able to specify the regions in the whole parameter space for the asymmetric noise, in which we attain desired likelihood for transcription. We have conducted", "start_char_pos": 1482, "end_char_pos": 1492}, {"type": "R", "before": "about", "after": "in", "start_char_pos": 1527, "end_char_pos": 1532}, {"type": "R", "before": "These offer", "after": "This work offers", "start_char_pos": 1633, "end_char_pos": 1644}], "sents_char_pos": [0, 178, 242, 677, 736, 1029, 1383, 1481, 1632]} {"doc_id": "1705.06595", "revision_depth": "1", "before_revision": "Telomeres, the nucleoprotein complexes at the termini of linear chromosomes, are essential roles for end-replication, end protection, and chromatin segregation. Each process represents an obstacle for genome stability. How these problems were overcome in evolution is unknown. We have found that the highly conserved Mre11 complex is involved in telomere structure and size homeostasis. We have characterized yeast telomere chromatin structure, phenotypic heritability, and telosome segregation in both wild-type [MRE11] and a specific class of mre11 mutants. Wild-type strains confer a telomere size of 300 bp of G+T simple sequence DNA . This DNA is embedded in a telosome: a micrococcal nuclease-resistant non-nucleosomal particle. The mre11A470Tmutation confers shorter 150 bp telomeric embedded within a telosome and is more resistant to micrococcal nuclease digestion than wild-type cells Interestingly, real-time qPCR suggests a lower or more transient binding of the mutant relative to the wild-type . Yet the introduction of wild-type Mre11 does not change the telomere size of the mutant cells and maintains the telosome structure of mutant cells. Similarly, the introduction of mre11A470T gene into a wild type genomic locus leads to a diffuse/wild-type chromatin phenotype. Our data show that telosomes predominantly restrict both MRE11 and mre11A470T telosomes exclusively to sister chromatids, suggesting conservative segregation. To show this, we used ectopic integration to characterize cells that carry either the MRE11 or mre11A470T alleles at the genomic g%DIFDELCMD < ] %%% site, and a second opposing mre11A470T or MRE11 allele, respectively, at an ectopic site. We find that segregation of MRE11 or mre11A470T telosomes is dependent primarily on its initial genotype, but not on any subsequent genotypic change supporting the conservative segregation of a replicating chromatid", "after_revision": "Telomeres, the nucleoprotein complexes at the termini of linear chromosomes, are essential for the processes of end replication, end-protection, and chromatin segregation. The Mre11 complex is involved in multiple cellular roles in DNA repair and structure in the regulation and function of telomere size homeostasis. In this study, we characterize yeast telomere chromatin structure, phenotypic heritability, and chromatin segregation in both wild-type [MRE11] and A470 motif alleles. MRE11 strains confer a telomere size of 300 base pairs of G+T irregular simple sequence repeats . This DNA and a portion of subtelomeric DNA is embedded in a telosome: an MNase-resistant non-nucleosomal particle. Chromatin immunoprecipitation shows a three to four-fold lower occupancy of Mre11A470T proteins than wild-type proteins in telosomes. Telosomes containing the Mre11A470T protein confer a greater resistance to MNase digestion than wild-type telosomes. The integration of a wild-type MRE11 allele into an ectopic locus in the genome of a mre11A470T mutant and the introduction of a mre11A470T %DIFDELCMD < ] %%% allele at an ectopic site in a wild-type strain lead to unexpectedly differing results. In each case, the replicated sister chromatids inherit telosomes containing only the protein encoded by the genomic mre11 locus, even in the presence of protein encoded by the opposing ectopic allele. We hypothesize that the telosome segregates by a conservative mechanism. These data support a mechanism for the linkage between sister chromatid replication and maintenance of either identical mutant or identical wild-type telosomes after replication of sister chromatids. These data suggest the presence of an active mechanism for chromatin segregation in yeast.", "edit_actions": [{"type": "R", "before": "roles for end-replication, end protection,", "after": "for the processes of end replication, end-protection,", "start_char_pos": 91, "end_char_pos": 133}, {"type": "R", "before": "Each process represents an obstacle for genome stability. How these problems were overcome in evolution is unknown. We have found that the highly conserved", "after": "The", "start_char_pos": 161, "end_char_pos": 316}, {"type": "R", "before": "telomere structure and", "after": "multiple cellular roles in DNA repair and structure in the regulation and function of telomere", "start_char_pos": 346, "end_char_pos": 368}, {"type": "R", "before": "We have characterized", "after": "In this study, we characterize", "start_char_pos": 387, "end_char_pos": 408}, {"type": "R", "before": "telosome", "after": "chromatin", "start_char_pos": 474, "end_char_pos": 482}, {"type": "R", "before": "a specific class of mre11 mutants. Wild-type", "after": "A470 motif alleles. MRE11", "start_char_pos": 525, "end_char_pos": 569}, {"type": "R", "before": "bp", "after": "base pairs", "start_char_pos": 608, "end_char_pos": 610}, {"type": "R", "before": "simple sequence DNA", "after": "irregular simple sequence repeats", "start_char_pos": 618, "end_char_pos": 637}, {"type": "A", "before": null, "after": "and a portion of subtelomeric DNA", "start_char_pos": 649, "end_char_pos": 649}, {"type": "R", "before": "a micrococcal nuclease-resistant", "after": "an MNase-resistant", "start_char_pos": 677, "end_char_pos": 709}, {"type": "R", "before": "The mre11A470Tmutation confers shorter 150 bp telomeric embedded within a telosome and is more resistant to micrococcal nuclease digestion than", "after": "Chromatin immunoprecipitation shows a three to four-fold lower occupancy of Mre11A470T proteins than", "start_char_pos": 736, "end_char_pos": 879}, {"type": "R", "before": "cells Interestingly, real-time qPCR suggests a lower or more transient binding of the mutant relative to the", "after": "proteins in telosomes. Telosomes containing the Mre11A470T protein confer a greater resistance to MNase digestion than", "start_char_pos": 890, "end_char_pos": 998}, {"type": "R", "before": ". Yet the introduction of", "after": "telosomes. The integration of a", "start_char_pos": 1009, "end_char_pos": 1034}, {"type": "D", "before": "Mre11 does not change the telomere size of the mutant cells and maintains the telosome structure of mutant cells. Similarly, the introduction of mre11A470T gene into a wild type genomic locus leads to a diffuse/wild-type chromatin phenotype. Our data show that telosomes predominantly restrict both", "after": null, "start_char_pos": 1045, "end_char_pos": 1343}, {"type": "A", "before": null, "after": "allele into an ectopic locus in the genome of a mre11A470T mutant", "start_char_pos": 1350, "end_char_pos": 1350}, {"type": "A", "before": null, "after": "the introduction of a", "start_char_pos": 1355, "end_char_pos": 1355}, {"type": "D", "before": "telosomes exclusively to sister chromatids, suggesting conservative segregation. To show this, we used ectopic integration to characterize cells that carry either the MRE11 or mre11A470T alleles at the genomic", "after": null, "start_char_pos": 1367, "end_char_pos": 1576}, {"type": "D", "before": "g", "after": null, "start_char_pos": 1577, "end_char_pos": 1578}, {"type": "R", "before": "site, and a second opposing mre11A470T or MRE11 allele, respectively, at an ectopic site. We find that segregation of MRE11 or mre11A470T telosomes is dependent primarily on its initial genotype, but not on any subsequent genotypic change supporting the conservative segregation of a replicating chromatid", "after": "allele at an ectopic site in a wild-type strain lead to unexpectedly differing results. In each case, the replicated sister chromatids inherit telosomes containing only the protein encoded by the genomic mre11 locus, even in the presence of protein encoded by the opposing ectopic allele. We hypothesize that the telosome segregates by a conservative mechanism. These data support a mechanism for the linkage between sister chromatid replication and maintenance of either identical mutant or identical wild-type telosomes after replication of sister chromatids. These data suggest the presence of an active mechanism for chromatin segregation in yeast.", "start_char_pos": 1597, "end_char_pos": 1902}], "sents_char_pos": [0, 160, 218, 276, 386, 559, 735, 1010, 1158, 1286, 1447, 1686]} {"doc_id": "1706.04867", "revision_depth": "1", "before_revision": "During the lifecycle of many enveloped viruses , a nucleocapsid core buds through the cell membrane to acquire an outer envelope of lipid membrane and viral glycoproteins. However, the nucleocapsid core is not required for assembly of infectious particles. To determine the role of the nucleocapsid , we perform coarse-grained computational modeling of budding in the presence and absence of a nucleocapsid. The simulations demonstrate that glycoprotein-directed budding leads to larger and more polydisperse particles than nucleocapsid-directed budding . This polydispersity is explained by a theoretical model for the competition between bending energy of the membrane and the glycoprotein shell. The simulations also show that the geometry of a budding particle impedes glycoprotein diffusion, which can result in a stalled, partially budded state. We present a phase diagram for morphologies of budded particles , which can be compared against experiments to establish bounds on whether budding is directed by glycoprotein or nucleocapsid interactions .", "after_revision": "During the alphavirus lifecycle , a nucleocapsid core buds through the cell membrane to acquire an outer envelope of lipid membrane and viral glycoproteins. However, the presence of a nucleocapsid core is not required for assembly of infectious particles. To determine the role of the nucleocapsid core, we develop a coarse-grained computational model with which we investigate budding dynamics as a function of glycoprotein and nucleocapsid interactions, as well as budding in the absence of a nucleocapsid. We find that there is a transition between glycoprotein-directed budding and nucleocapsid-directed budding which occurs above a threshold strength of nucleocapsid interactions. The simulations predict that glycoprotein-directed budding leads to significantly increased size polydispersity and particle polymorphism . This polydispersity can be qualitatively explained by a theoretical model accounting for the competition between bending energy of the membrane and the glycoprotein shell. The simulations also show that the geometry of a budding particle leads to a barrier to subunit diffusion, which can result in a stalled, partially budded state. We present a phase diagram for this and other morphologies of budded particles . Comparison of these structures against experiments could establish bounds on whether budding is directed by glycoprotein or nucleocapsid interactions . Although our model is motivated by alphaviruses, we discuss implications of our results for other enveloped viruses .", "edit_actions": [{"type": "R", "before": "lifecycle of many enveloped viruses", "after": "alphavirus lifecycle", "start_char_pos": 11, "end_char_pos": 46}, {"type": "A", "before": null, "after": "presence of a", "start_char_pos": 185, "end_char_pos": 185}, {"type": "R", "before": ", we perform", "after": "core, we develop a", "start_char_pos": 300, "end_char_pos": 312}, {"type": "R", "before": "modeling of", "after": "model with which we investigate budding dynamics as a function of glycoprotein and nucleocapsid interactions, as well as", "start_char_pos": 342, "end_char_pos": 353}, {"type": "D", "before": "presence and", "after": null, "start_char_pos": 369, "end_char_pos": 381}, {"type": "R", "before": "The simulations demonstrate", "after": "We find that there is a transition between glycoprotein-directed budding and nucleocapsid-directed budding which occurs above a threshold strength of nucleocapsid interactions. The simulations predict", "start_char_pos": 409, "end_char_pos": 436}, {"type": "R", "before": "larger and more polydisperse particles than nucleocapsid-directed budding", "after": "significantly increased size polydispersity and particle polymorphism", "start_char_pos": 481, "end_char_pos": 554}, {"type": "R", "before": "is", "after": "can be qualitatively", "start_char_pos": 577, "end_char_pos": 579}, {"type": "A", "before": null, "after": "accounting", "start_char_pos": 613, "end_char_pos": 613}, {"type": "R", "before": "impedes glycoprotein", "after": "leads to a barrier to subunit", "start_char_pos": 767, "end_char_pos": 787}, {"type": "A", "before": null, "after": "this and other", "start_char_pos": 885, "end_char_pos": 885}, {"type": "R", "before": ", which can be compared against experiments to", "after": ". Comparison of these structures against experiments could", "start_char_pos": 919, "end_char_pos": 965}, {"type": "A", "before": null, "after": ". Although our model is motivated by alphaviruses, we discuss implications of our results for other enveloped viruses", "start_char_pos": 1059, "end_char_pos": 1059}], "sents_char_pos": [0, 171, 257, 408, 556, 700, 853]} {"doc_id": "1707.08078", "revision_depth": "4", "before_revision": "I propose creation of a venture bank, able to multiply the capital of a venture capital firm by at least 47 times, without requiring access to the Federal Reserve or other central bank apart from settlement. This concept rests on insuring loans in order to create the capital required, and expand Tier 1 and 2 base capital. Profitability depends on overall portfolio performance, availability of default insurance notes , cost of default insurance , and the multiple of original capital (MOC) adopted by the venture bank. I propose a new derivative financial instrument, the Default Insurance Note (DIN ), to insure loans to venture investments. A DIN is similar to a credit default swap (CDS) but with a host of unique features. The features and operation of these new derivative instruments are outlined along with audit requirements. This instrument would be traded on open-outcry exchanges with special rules to ensure orderly operation of the market. It is the creation of public markets for DINs that makes possible the use of public market pricing to indirectly establish a market capitalization for the underlying venture-bank investment , which is the key to achieving regulatory acceptance of the fully-insured version of this proposal. That fully-insured version insulates the venture-bank from losses in most situations, and multiplies profitability quite dramatically in all scenarios. Ten year returns above 10X are attainable. I further propose a new feature for insurance type derivativeswhich is a clawback lien, here 77\\%, to be paid back to the underwriter to prevent perverse incentive . This proposal solves an old problem in banking, because it matches the term of the loan with the term of the investment. I show that both the venture investment and the DIN underwriting business are profitable.", "after_revision": "I propose creation of a venture bank, able to multiply the capital of a venture capital firm by at least 47 times, without requiring access to the Federal Reserve or other central bank apart from settlement. This concept rests on obtaining default swap instruments on loans in order to create the capital required, and expand Tier 1 and 2 base capital. Profitability depends on overall portfolio performance, availability of equity default swaps , cost of default swap , and the multiple of original capital (MOC) adopted by the venture bank. A new derivative financial instrument, the equity default swap (EDS ), to cover loans made as venture investments. An EDS is similar to a credit default swap (CDS) but with some unique features. The features and operation of these new derivative instruments are outlined along with audit requirements. This instrument would be traded on open-outcry exchanges with special features to ensure orderly operation of the market. It is the creation of public markets for EDSs that makes possible the use of public market pricing to indirectly provide a potential market capitalization for the underlying venture-bank investment . Full coverage insulates the venture-bank from losses in most situations, and multiplies profitability quite dramatically in all scenarios. Ten year returns above 20X are attainable. Further, a new feature for EDS derivatives, a clawback lien, closes out the equity default swap. Here it is optimized at 77\\%, and is to be paid back to the underwriter at a future date to prevent perverse incentive to deliberately fail. This new feature creates an Equity Default Clawback Swap (EDCS) which can be used safely. This proposal also solves an old problem in banking, because it matches the term of the loan with the term of the investment. I show that the venture-bank investment and the EDCS underwriting business are profitable.", "edit_actions": [{"type": "R", "before": "insuring", "after": "obtaining default swap instruments on", "start_char_pos": 230, "end_char_pos": 238}, {"type": "R", "before": "default insurance notes", "after": "equity default swaps", "start_char_pos": 396, "end_char_pos": 419}, {"type": "R", "before": "insurance", "after": "swap", "start_char_pos": 438, "end_char_pos": 447}, {"type": "R", "before": "I propose a", "after": "A", "start_char_pos": 522, "end_char_pos": 533}, {"type": "R", "before": "Default Insurance Note (DIN", "after": "equity default swap (EDS", "start_char_pos": 575, "end_char_pos": 602}, {"type": "R", "before": "insure loans to", "after": "cover loans made as", "start_char_pos": 609, "end_char_pos": 624}, {"type": "R", "before": "A DIN", "after": "An EDS", "start_char_pos": 646, "end_char_pos": 651}, {"type": "R", "before": "a host of", "after": "some", "start_char_pos": 703, "end_char_pos": 712}, {"type": "R", "before": "rules", "after": "features", "start_char_pos": 907, "end_char_pos": 912}, {"type": "R", "before": "DINs", "after": "EDSs", "start_char_pos": 997, "end_char_pos": 1001}, {"type": "R", "before": "establish a", "after": "provide a potential", "start_char_pos": 1069, "end_char_pos": 1080}, {"type": "R", "before": ", which is the key to achieving regulatory acceptance of the fully-insured version of this proposal. That fully-insured version", "after": ". Full coverage", "start_char_pos": 1146, "end_char_pos": 1273}, {"type": "R", "before": "10X", "after": "20X", "start_char_pos": 1422, "end_char_pos": 1425}, {"type": "R", "before": "I further propose", "after": "Further,", "start_char_pos": 1442, "end_char_pos": 1459}, {"type": "R", "before": "insurance type derivativeswhich is", "after": "EDS derivatives,", "start_char_pos": 1478, "end_char_pos": 1512}, {"type": "R", "before": "here", "after": "closes out the equity default swap. Here it is optimized at", "start_char_pos": 1530, "end_char_pos": 1534}, {"type": "A", "before": null, "after": "and is", "start_char_pos": 1541, "end_char_pos": 1541}, {"type": "A", "before": null, "after": "at a future date", "start_char_pos": 1577, "end_char_pos": 1577}, {"type": "R", "before": ". This proposal", "after": "to deliberately fail. This new feature creates an Equity Default Clawback Swap (EDCS) which can be used safely. This proposal also", "start_char_pos": 1608, "end_char_pos": 1623}, {"type": "R", "before": "both the venture", "after": "the venture-bank", "start_char_pos": 1743, "end_char_pos": 1759}, {"type": "R", "before": "DIN", "after": "EDCS", "start_char_pos": 1779, "end_char_pos": 1782}], "sents_char_pos": [0, 207, 323, 521, 645, 729, 836, 955, 1246, 1398, 1441, 1609, 1730]} {"doc_id": "1708.00062", "revision_depth": "1", "before_revision": "In banking practice, rating transition matrices have become the standard approach of deriving multi-year probabilities of default (PDs) from one-year PDs, with the latter normally being available from Basel ratings. Rating transition matrices have gained in importance with the newly adopted IFRS 9 accounting standard. Here, the multi-year PDs can be used to calculate the so-called expected credit losses (ECL) over the entire lifetime of relevant credit assets. A typical approach for estimating the rating transition matrices relies on calculating empirical rating migration counts and frequencies from rating history data. However, for small portfolios this approach often leads to zero counts and high count volatility, which makes the estimations unreliable and volatile , and can also produce counter-intuitive prediction patterns . This paper proposes a structural model which overcomes these problems. We retort to a plausible assumption of an autoregressive mean-reverting specification for the underlying ability-to-pay process. With only three parameters, this sparse process can describe well an entire typical rating transition matrix, provided the one-year PDs of the rating classes are specified (e. g. in the rating master scale). The transition probabilities produced by the structural approach are well-behaved . The approach reduces significantly the statistical degrees of freedom of the estimated transition probabilities, which makes the rating transition matrix significantly more reliable for small portfolios. The approach can be applied to data with as few as 50 observed rating transitions. Moreover, the approach can be efficiently applied for data consisting of continuous (undiscretized)PDs . In the IFRS9 context, the approach offers an additional merit of an easy way to account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.", "after_revision": "In banking practice, rating transition matrices have become the standard approach of deriving multi-year probabilities of default (PDs) from one-year PDs, the latter normally being available from Basel ratings. Rating transition matrices have gained in importance with the newly adopted IFRS 9 accounting standard. Here, the multi-year PDs can be used to calculate the so-called expected credit losses (ECL) over the entire lifetime of relevant credit assets. A typical approach for estimating the rating transition matrices relies on calculating empirical rating migration counts and frequencies from rating history data. For small portfolios, however, this approach often leads to zero counts and high count volatility, which makes the estimations unreliable and unstable , and can also produce counter-intuitive prediction patterns such as non-parallel/crossing forward PD patterns . This paper proposes a structural model which overcomes these problems. We make a plausible assumption of an underlying autoregressive mean-reverting ability-to-pay process. With only three parameters, this sparse process can well describe an entire typical rating transition matrix, provided the one-year PDs of the rating classes are specified . The transition probabilities produced by the structural approach are well-behaved by design . The approach significantly reduces the statistical degrees of freedom of the estimated transition probabilities, which makes the rating transition matrix more reliable for small portfolios. The approach can be applied to data with as few as 50 observed rating transitions. Moreover, the approach can be efficiently applied to data consisting of continuous PDs (prior to rating discretization) . In the IFRS 9 context, the approach offers an additional merit : it can easily account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.", "edit_actions": [{"type": "D", "before": "with", "after": null, "start_char_pos": 155, "end_char_pos": 159}, {"type": "R", "before": "However, for small portfolios", "after": "For small portfolios, however,", "start_char_pos": 628, "end_char_pos": 657}, {"type": "R", "before": "volatile", "after": "unstable", "start_char_pos": 769, "end_char_pos": 777}, {"type": "A", "before": null, "after": "such as non-parallel/crossing forward PD patterns", "start_char_pos": 839, "end_char_pos": 839}, {"type": "R", "before": "retort to", "after": "make", "start_char_pos": 916, "end_char_pos": 925}, {"type": "A", "before": null, "after": "underlying", "start_char_pos": 955, "end_char_pos": 955}, {"type": "D", "before": "specification for the underlying", "after": null, "start_char_pos": 986, "end_char_pos": 1018}, {"type": "R", "before": "describe well", "after": "well describe", "start_char_pos": 1095, "end_char_pos": 1108}, {"type": "R", "before": "(e. g. in the rating master scale).", "after": ".", "start_char_pos": 1215, "end_char_pos": 1250}, {"type": "A", "before": null, "after": "by design", "start_char_pos": 1333, "end_char_pos": 1333}, {"type": "R", "before": "reduces significantly", "after": "significantly reduces", "start_char_pos": 1349, "end_char_pos": 1370}, {"type": "D", "before": "significantly", "after": null, "start_char_pos": 1490, "end_char_pos": 1503}, {"type": "R", "before": "for", "after": "to", "start_char_pos": 1673, "end_char_pos": 1676}, {"type": "R", "before": "(undiscretized)PDs", "after": "PDs (prior to rating discretization)", "start_char_pos": 1707, "end_char_pos": 1725}, {"type": "R", "before": "IFRS9", "after": "IFRS 9", "start_char_pos": 1735, "end_char_pos": 1740}, {"type": "R", "before": "of an easy way to", "after": ": it can easily", "start_char_pos": 1790, "end_char_pos": 1807}], "sents_char_pos": [0, 215, 319, 464, 627, 841, 912, 1042, 1250, 1335, 1539, 1622]} {"doc_id": "1708.02691", "revision_depth": "1", "before_revision": "This article conerns the expressive power of depth in neural nets with ReLU activations . We prove that ReLU nets with width 2d+2 can approximate any continuous scalar function on the d-dimensional cube [0,1]^d arbitrarily well. We obtain quantitative depth estimates for such approximations . Our approach is based on the observation that ReLU nets are particularly well-suited for representing convex functions. Indeed, we give a constructive proof that ReLU nets with width d+1 can approximate any continuous convex function of d arbitrarily well. Moreover, when approximating convex, piecewise affine functions by width d+1 ReLU nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal. ]", "after_revision": "This article concerns the expressive power of depth in neural nets with ReLU activations and bounded width. We are particularly interested in the following questions: what is the minimal width w_{\\text{min that ReLU nets of width w_{\\text{min can approximate any continuous function on the unit cube [0,1]^d aribitrarily well? For ReLU nets near this minimal width, what can one say about the depth necessary to approximate a given function? We obtain an essentially complete answer to these questions for convex functions . Our approach is based on the observation that , due to the convexity of the ReLU activation, ReLU nets are particularly well-suited for representing convex functions. In particular, we prove that ReLU nets with width d+1 can approximate any continuous convex function of d variables arbitrarily well. Moreover, when approximating convex, piecewise affine functions by such nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal. These results then give quantitative depth estimates for the rate of approximation of any continuous scalar function on the d-dimensional cube 0,1]^d by ReLU nets with width d+3.", "edit_actions": [{"type": "R", "before": "conerns", "after": "concerns", "start_char_pos": 13, "end_char_pos": 20}, {"type": "R", "before": ". We prove", "after": "and bounded width. We are particularly interested in the following questions: what is the minimal width w_{\\text{min", "start_char_pos": 88, "end_char_pos": 98}, {"type": "R", "before": "with width 2d+2", "after": "of width w_{\\text{min", "start_char_pos": 114, "end_char_pos": 129}, {"type": "D", "before": "scalar", "after": null, "start_char_pos": 161, "end_char_pos": 167}, {"type": "R", "before": "d-dimensional", "after": "unit", "start_char_pos": 184, "end_char_pos": 197}, {"type": "R", "before": "arbitrarily well. We obtain quantitative depth estimates for such approximations", "after": "aribitrarily well? For ReLU nets near this minimal width, what can one say about the depth necessary to approximate a given function? We obtain an essentially complete answer to these questions for convex functions", "start_char_pos": 211, "end_char_pos": 291}, {"type": "R", "before": "ReLU", "after": ", due to the convexity of the ReLU activation, ReLU", "start_char_pos": 340, "end_char_pos": 344}, {"type": "R", "before": "Indeed, we give a constructive proof", "after": "In particular, we prove", "start_char_pos": 414, "end_char_pos": 450}, {"type": "A", "before": null, "after": "variables", "start_char_pos": 533, "end_char_pos": 533}, {"type": "R", "before": "width d+1 ReLU", "after": "such", "start_char_pos": 619, "end_char_pos": 633}, {"type": "A", "before": null, "after": "These results then give quantitative depth estimates for the rate of approximation of any continuous scalar function on the d-dimensional cube", "start_char_pos": 759, "end_char_pos": 759}, {"type": "A", "before": null, "after": "0,1", "start_char_pos": 760, "end_char_pos": 760}, {"type": "A", "before": null, "after": "^d by ReLU nets with width d+3.", "start_char_pos": 761, "end_char_pos": 761}], "sents_char_pos": [0, 89, 228, 293, 413, 551]} {"doc_id": "1708.08778", "revision_depth": "3", "before_revision": "Let G be a graph topological embedded in the plane and let \\mathcal A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \\mathcal A is a planar polyline drawing \\Gamma of G with an arrangement A of lines so that \\Gamma and A are homeomorphic to G and \\mathcal A . We show that if \\mathcal A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline , then G and \\mathcal A have a straight-line aligned drawing. In order to prove these results , we strengthen the result of Da Lozzo et al., and prove that a planar graph G and a single pseudoline \\mathcal L have an aligned drawing with a prescribed convex drawing of the outer face. We also study the more general version of the problem where only a set of vertices is given and we need to determine whether they can be collinear. We show that the problem is \\mathcal{NP but fixed-parameter tractable.", "after_revision": "Let G be a graph that is topologically embedded in the plane and let \\mathcal{A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \\mathcal{A is a planar polyline drawing \\Gamma of G with an arrangement A of lines so that \\Gamma and A are homeomorphic to G and \\mathcal{A . We show that if \\mathcal{A is stretchable and every edge e either entirely lies on a pseudoline or it has at most one intersection with \\mathcal{A , then G and \\mathcal{A have a straight-line aligned drawing. In order to prove this result , we strengthen a result of Da Lozzo et al., and prove that a planar graph G and a single pseudoline \\mathcal{L have an aligned drawing with a prescribed convex drawing of the outer face. We also study the less restrictive version of the alignment problem with respect to one line, where only a set of vertices is given and we need to determine whether they can be collinear. We show that the problem is NP-complete but fixed-parameter tractable.", "edit_actions": [{"type": "R", "before": "topological", "after": "that is topologically", "start_char_pos": 17, "end_char_pos": 28}, {"type": "R", "before": "\\mathcal A", "after": "\\mathcal{A", "start_char_pos": 59, "end_char_pos": 69}, {"type": "R", "before": "\\mathcal A", "after": "\\mathcal{A", "start_char_pos": 162, "end_char_pos": 172}, {"type": "R", "before": "\\mathcal A", "after": "\\mathcal{A", "start_char_pos": 292, "end_char_pos": 302}, {"type": "R", "before": "\\mathcal A", "after": "\\mathcal{A", "start_char_pos": 321, "end_char_pos": 331}, {"type": "R", "before": "intersects", "after": "it has", "start_char_pos": 404, "end_char_pos": 414}, {"type": "R", "before": "pseudoline", "after": "intersection with \\mathcal{A", "start_char_pos": 427, "end_char_pos": 437}, {"type": "R", "before": "\\mathcal A", "after": "\\mathcal{A", "start_char_pos": 451, "end_char_pos": 461}, {"type": "R", "before": "these results", "after": "this result", "start_char_pos": 518, "end_char_pos": 531}, {"type": "R", "before": "the", "after": "a", "start_char_pos": 548, "end_char_pos": 551}, {"type": "R", "before": "\\mathcal L", "after": "\\mathcal{L", "start_char_pos": 635, "end_char_pos": 645}, {"type": "R", "before": "more general", "after": "less restrictive", "start_char_pos": 740, "end_char_pos": 752}, {"type": "R", "before": "problem", "after": "alignment problem with respect to one line,", "start_char_pos": 768, "end_char_pos": 775}, {"type": "R", "before": "\\mathcal{NP", "after": "NP-complete", "start_char_pos": 898, "end_char_pos": 909}], "sents_char_pos": [0, 304, 499, 721, 869]} {"doc_id": "1708.09850", "revision_depth": "2", "before_revision": "Investor trading networks are attracting growing attention in the financial market literature . In this paper, we propose three improvements to their analysis: information aggregation, transaction bootstrapping , and investor categorization. These components can be used individually or in combination. For information aggregation, we introduce a tractable multilayer aggregation procedure to integrate security-wise and time-wise information about investor category trading networks. We use transaction bootstrapping to capture the properties of the actual data generation process and to have a more robust statistical testing procedure . Investor categorization allows for inferring constant size networks and more observations for each node, which is important especially for less liquid securities. We apply this procedure by analyzing a unique data set of Finnish shareholders during the period 2004--2009. We find that households play a central role in investor networks, as they have the most synchronized trading. Furthermore, we observe that the window size used for averaging has a substantial effect on the number of inferred relationships. Importantly, the use of our proposed aggregation framework is not limited to the field of investor trading networks; in fact, it can be used for different non-financial applications, with both observable and inferred relationships, spanning a number of different information layers .", "after_revision": "Multilayer networks are attracting growing attention in many fields, including finance . In this paper, we develop a new tractable procedure for multilayer aggregation based on statistical validation, which we apply to investor networks. Moreover, we propose two other improvements to their analysis: transaction bootstrapping and investor categorization. The aggregation procedure can be used to integrate security-wise and time-wise information about investor trading networks, but it is not limited to finance. In fact, it can be used for different applications, such as gene, transportation, and social networks, were they inferred or observable. Additionally, in the investor network inference, we use transaction bootstrapping for better statistical validation . Investor categorization allows for constant size networks and having more observations for each node, which is important in the inference especially for less liquid securities. Furthermore, we observe that the window size used for averaging has a substantial effect on the number of inferred relationships. We apply this procedure by analyzing a unique data set of Finnish shareholders during the period 2004-2009. We find that households in the capital have high centrality in investor networks, which, under the theory of information channels in investor networks suggests that they are well-informed investors .", "edit_actions": [{"type": "R", "before": "Investor trading", "after": "Multilayer", "start_char_pos": 0, "end_char_pos": 16}, {"type": "R", "before": "the financial market literature", "after": "many fields, including finance", "start_char_pos": 62, "end_char_pos": 93}, {"type": "R", "before": "propose three", "after": "develop a new tractable procedure for multilayer aggregation based on statistical validation, which we apply to investor networks. Moreover, we propose two other", "start_char_pos": 114, "end_char_pos": 127}, {"type": "R", "before": "information aggregation, transaction bootstrapping ,", "after": "transaction bootstrapping", "start_char_pos": 160, "end_char_pos": 212}, {"type": "R", "before": "These components", "after": "The aggregation procedure", "start_char_pos": 242, "end_char_pos": 258}, {"type": "D", "before": "individually or in combination. For information aggregation, we introduce a tractable multilayer aggregation procedure", "after": null, "start_char_pos": 271, "end_char_pos": 389}, {"type": "R", "before": "category trading networks. We", "after": "trading networks, but it is not limited to finance. In fact, it can be used for different applications, such as gene, transportation, and social networks, were they inferred or observable. Additionally, in the investor network inference, we", "start_char_pos": 458, "end_char_pos": 487}, {"type": "R", "before": "to capture the properties of the actual data generation process and to have a more robust statistical testing procedure", "after": "for better statistical validation", "start_char_pos": 518, "end_char_pos": 637}, {"type": "D", "before": "inferring", "after": null, "start_char_pos": 675, "end_char_pos": 684}, {"type": "A", "before": null, "after": "having", "start_char_pos": 712, "end_char_pos": 712}, {"type": "A", "before": null, "after": "in the inference", "start_char_pos": 765, "end_char_pos": 765}, {"type": "D", "before": "We apply this procedure by analyzing a unique data set of Finnish shareholders during the period 2004--2009. We find that households play a central role in investor networks, as they have the most synchronized trading.", "after": null, "start_char_pos": 805, "end_char_pos": 1023}, {"type": "R", "before": "Importantly, the use of our proposed aggregation framework is not limited to the field of investor trading networks; in fact, it can be used for different non-financial applications, with both observable and inferred relationships, spanning a number of different information layers", "after": "We apply this procedure by analyzing a unique data set of Finnish shareholders during the period 2004-2009. We find that households in the capital have high centrality in investor networks, which, under the theory of information channels in investor networks suggests that they are well-informed investors", "start_char_pos": 1154, "end_char_pos": 1435}], "sents_char_pos": [0, 95, 241, 302, 484, 639, 804, 913, 1023, 1153, 1270]} {"doc_id": "1709.00765", "revision_depth": "2", "before_revision": "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. This problem arises in various scenarios in thermodynamics of computation and nonequilibrium statistical physics (e.g., when designing processes to implement some desired computation, feedback-control protocol, or Maxwellian demon). 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. Here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional \"hidden\" states , not in X . We investigate how the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P. We provide exact results in the special case of conditional distributions that represent single-valued functions. In the general case, we provide an upper bound on the needed number of hidden states in terms of the nonnegative rank of P. 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. 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 . These results can be seen as uncovering and investigating a novel type of cost of the physical resources needed to perform information processing---the size of a system's hidden state space .", "after_revision": "We consider the problem of how to construct a physical process over a finite state space X that applies some desired conditional distribution P to initial states to produce final states. This problem arises often in the thermodynamics of computation and nonequilibrium statistical physics more generally (e.g., when designing processes to implement some desired computation, feedback controller, or Maxwell demon). It was previously known that some conditional distributions cannot be implemented using any master equation that involves just the states in X. However, here we show that any conditional distribution P can in fact be implemented---if additional \"hidden\" states not in X are available. Moreover, we show that it is always possible to implement P in a thermodynamically reversible manner. We then investigate a novel cost of the physical resources needed to implement a given distribution P: the minimal number of hidden states needed to do so. We calculate this cost exactly for the special case where P represents a single-valued function, and provide an upper bound for the general case, in terms of the nonnegative rank of P. These results show that having access to one extra binary degree of freedom , thus doubling the total number of states , is sufficient to implement any P with a master equation in a thermodynamically reversible way, if there are no constraints on the allowed form of the master equation. (Such constraints can greatly increase the minimal needed number of hidden states.) 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_actions": [{"type": "A", "before": null, "after": "finite", "start_char_pos": 70, "end_char_pos": 70}, {"type": "R", "before": "in various scenarios in", "after": "often in the", "start_char_pos": 201, "end_char_pos": 224}, {"type": "A", "before": null, "after": "more generally", "start_char_pos": 294, "end_char_pos": 294}, {"type": "R", "before": "feedback-control protocol, or Maxwellian", "after": "feedback controller, or Maxwell", "start_char_pos": 366, "end_char_pos": 406}, {"type": "R", "before": "is known that there are classes of conditional distributions that", "after": "was previously known that some conditional distributions", "start_char_pos": 418, "end_char_pos": 483}, {"type": "R", "before": "time-inhomogeneous master equation dynamics involving", "after": "master equation that involves", "start_char_pos": 516, "end_char_pos": 569}, {"type": "R", "before": "Here", "after": "However, here", "start_char_pos": 592, "end_char_pos": 596}, {"type": "R", "before": "however be implemented if the master equation dynamics has access to", "after": "in fact be implemented---if", "start_char_pos": 645, "end_char_pos": 713}, {"type": "D", "before": ",", "after": null, "start_char_pos": 741, "end_char_pos": 742}, {"type": "R", "before": ". We investigate how the", "after": "are available. Moreover, we show that it is always possible to implement P in a thermodynamically reversible manner. We then investigate a novel cost of the physical resources needed to implement a given distribution P: the", "start_char_pos": 752, "end_char_pos": 776}, {"type": "D", "before": "such", "after": null, "start_char_pos": 795, "end_char_pos": 799}, {"type": "R", "before": "implement some P in a thermodynamically reversible manner depends on P. We provide exact results in", "after": "do so. We calculate this cost exactly for", "start_char_pos": 824, "end_char_pos": 923}, {"type": "R", "before": "of conditional distributions that represent", "after": "where P represents a", "start_char_pos": 941, "end_char_pos": 984}, {"type": "R", "before": "functions. In the general case, we", "after": "function, and", "start_char_pos": 999, "end_char_pos": 1033}, {"type": "R", "before": "on the needed number of hidden states", "after": "for the general case,", "start_char_pos": 1057, "end_char_pos": 1094}, {"type": "R", "before": "In particular, we show that if there are no constraints on what master equation we can construct, then", "after": "These results show that", "start_char_pos": 1134, "end_char_pos": 1236}, {"type": "R", "before": "(", "after": ", thus", "start_char_pos": 1289, "end_char_pos": 1290}, {"type": "R", "before": ")", "after": ",", "start_char_pos": 1327, "end_char_pos": 1328}, {"type": "R", "before": "carry out", "after": "implement", "start_char_pos": 1346, "end_char_pos": 1355}, {"type": "R", "before": "zero entropy production.", "after": "a master equation in a thermodynamically reversible way, if there are no constraints on the allowed form of the master equation. (Such constraints can greatly increase the minimal needed number of hidden states.)", "start_char_pos": 1367, "end_char_pos": 1391}, {"type": "R", "before": "additional states available", "after": "hidden states", "start_char_pos": 1488, "end_char_pos": 1515}, {"type": "D", "before": ". These results can be seen as uncovering and investigating a novel type of cost of the physical resources needed to perform information processing---the size of a system's hidden state space", "after": null, "start_char_pos": 1567, "end_char_pos": 1758}], "sents_char_pos": [0, 180, 414, 591, 895, 1009, 1133, 1391, 1568]} {"doc_id": "1709.07122", "revision_depth": "1", "before_revision": "PageRank is a fundamental link analysis algorithm and a key representative of the performance of other graph algorithms and Sparse Matrix Vector (SpMV) multiplication. Calculating PageRank on sparse graphs generates large amount of random memory accesses resulting in low cache line utilization and poor use of memory bandwidth . In this paper, we present a novel Partition-Centric Processing Methodology (PCPM) that drastically reduces the amount of communication with DRAM and achieves high memory bandwidth. Similar to the state of the art Binning with Vertex-centric Gather-Apply-Scatter ( BVGAS) method, PCPM performs partition wise scatter and gather of updates with both phases enjoying full cache line utilization. However, BVGAS suffers from random memory accesses and redundant read/write of update values from nodes to their neighbors. In contrast, PCPM propagates single update from source node to all destinations in a partition, thus decreasing redundancy effectively. We make use of this characteristic to develop a novel bipartite Partition-Node Graph (PNG) data layout for PCPM, that enables streaming memory accesses, with very little generation overhead . We perform detailed analysis of PCPM and provide theoretical bounds on the amount of communication and random DRAM accesses. We experimentally evaluate our approach using 6 large graph datasets and demonstrate an average 2.7x speedup in execution time and 1.7x reduction in communication , compared to the state of the art . We also show that unlike the BVGAS implementation , PCPM is able to take advantage of intelligent node labeling that enhances locality in graphs, by further reducing the amount of communication with DRAM . Although we use PageRank as the target application in this paper, our approach can be applied to generic SpMV computation.", "after_revision": "PageRank is a fundamental link analysis algorithm that also functions as a key representative of the performance of Sparse Matrix-Vector (SpMV) multiplication. The traditional PageRank implementation generates fine granularity random memory accesses resulting in large amount of wasteful DRAM traffic and poor bandwidth utilization . In this paper, we present a novel Partition-Centric Processing Methodology (PCPM) to compute PageRank, that drastically reduces the amount of DRAM communication while achieving high sustained memory bandwidth. PCPM uses a Partition-centric abstraction coupled with the Gather-Apply-Scatter ( GAS) programming model. By carefully examining how a PCPM based implementation impacts communication characteristics of the algorithm, we propose several system optimizations that improve the execution time substantially. More specifically, we develop (1) a new data layout that significantly reduces communication and random DRAM accesses, and (2) branch avoidance mechanisms to get rid of unpredictable data-dependent branches . We perform detailed analytical and experimental evaluation of our approach using 6 large graphs and demonstrate an average 2.7x speedup in execution time and 1.7x reduction in communication volume , compared to the state-of-the-art . We also show that unlike other GAS based implementations , PCPM is able to further reduce main memory traffic by taking advantage of intelligent node labeling that enhances locality . Although we use PageRank as the target application in this paper, our approach can be applied to generic SpMV computation.", "edit_actions": [{"type": "R", "before": "and", "after": "that also functions as", "start_char_pos": 50, "end_char_pos": 53}, {"type": "R", "before": "other graph algorithms and Sparse Matrix Vector", "after": "Sparse Matrix-Vector", "start_char_pos": 97, "end_char_pos": 144}, {"type": "R", "before": "Calculating PageRank on sparse graphs generates large amount of", "after": "The traditional PageRank implementation generates fine granularity", "start_char_pos": 168, "end_char_pos": 231}, {"type": "R", "before": "low cache line utilization and poor use of memory bandwidth", "after": "large amount of wasteful DRAM traffic and poor bandwidth utilization", "start_char_pos": 268, "end_char_pos": 327}, {"type": "A", "before": null, "after": "to compute PageRank,", "start_char_pos": 412, "end_char_pos": 412}, {"type": "R", "before": "communication with DRAM and achieves high", "after": "DRAM communication while achieving high sustained", "start_char_pos": 452, "end_char_pos": 493}, {"type": "R", "before": "Similar to the state of the art Binning with Vertex-centric", "after": "PCPM uses a Partition-centric abstraction coupled with the", "start_char_pos": 512, "end_char_pos": 571}, {"type": "R", "before": "BVGAS) method, PCPM performs partition wise scatter and gather of updates with both phases enjoying full cache line utilization. However, BVGAS suffers from random memory accesses and redundant read/write of update values from nodes to their neighbors. In contrast, PCPM propagates single update from source node to all destinations in a partition, thus decreasing redundancy effectively. We make use of this characteristic to develop a novel bipartite Partition-Node Graph (PNG) data layout for PCPM, that enables streaming memory accesses, with very little generation overhead", "after": "GAS) programming model. By carefully examining how a PCPM based implementation impacts communication characteristics of the algorithm, we propose several system optimizations that improve the execution time substantially. More specifically, we develop (1) a new data layout that significantly reduces communication and random DRAM accesses, and (2) branch avoidance mechanisms to get rid of unpredictable data-dependent branches", "start_char_pos": 595, "end_char_pos": 1173}, {"type": "R", "before": "analysis of PCPM and provide theoretical bounds on the amount of communication and random DRAM accesses. We experimentally evaluate", "after": "analytical and experimental evaluation of", "start_char_pos": 1196, "end_char_pos": 1327}, {"type": "R", "before": "graph datasets", "after": "graphs", "start_char_pos": 1355, "end_char_pos": 1369}, {"type": "A", "before": null, "after": "volume", "start_char_pos": 1464, "end_char_pos": 1464}, {"type": "R", "before": "state of the art", "after": "state-of-the-art", "start_char_pos": 1483, "end_char_pos": 1499}, {"type": "R", "before": "the BVGAS implementation", "after": "other GAS based implementations", "start_char_pos": 1527, "end_char_pos": 1551}, {"type": "R", "before": "take", "after": "further reduce main memory traffic by taking", "start_char_pos": 1570, "end_char_pos": 1574}, {"type": "D", "before": "in graphs, by further reducing the amount of communication with DRAM", "after": null, "start_char_pos": 1637, "end_char_pos": 1705}], "sents_char_pos": [0, 167, 329, 511, 723, 847, 983, 1175, 1300, 1501]} {"doc_id": "1709.10483", "revision_depth": "1", "before_revision": "Voxel based analysis (VBA) of preclinical magnetic resonance images is widely used in neuroscience. Recent studies have highlighted the need for robust statistical analysis in neuroimaging , stability, and controlling error rates ; but a thorough examination of such effects is hindered by computational demands. Workflow optimization is often based on intuition and experience; while validation studies are scarce. While the main goal of many neuroscience questions is to understand the human brain, much of the current knowledge has been gained from small animal models, which replicate many genetic, structural, and connectivity aspects of the human brain. To increase throughput and reproducibility of small animal brain studies, we have developed a publicly shared VBA pipeline in a high-performance computing environment, called SAMBA. Increasing computational efficiency allowed us to produce VBA results in 1-3 days for large multidimensional arrays which previously took 1 month. To address the need for quantitative VBA validation we propose a framework consisting of morphological phantoms, and four quantitative metrics. We address several factors that impact VBA results, including registration parameters, and template construction strategies. Due to shorter processing times, we could explore multiple parameter sets, and VBA stability. We have used this framework to guide the selection of spatial registration parameters in a VBA study for a mouse model of epilepsy. We conclude that verifying the accuracy of VBA merits attention, and should be the focus of a broader effort within the community . By significantly reducing processing times, we were able to do a thorough evaluation of the variability and reliability of VBA results . The proposed framework promotes consistent quality assurance of VBA in preclinical neuroimaging; facilitating the creation and communication of robust results.", "after_revision": "While many neuroscience questions aim to understand the human brain, much current knowledge has been gained using animal models, which replicate genetic, structural, and connectivity aspects of the human brain. While voxel-based analysis (VBA) of preclinical magnetic resonance images is widely-used, a thorough examination of the statistical robustness , stability, and error rates is hindered by high computational demands of processing large arrays, and the many parameters involved. Thus, workflows are often based on intuition or experience, while preclinical validation studies remain scarce. To increase throughput and reproducibility of quantitative small animal brain studies, we have developed a publicly shared , high throughput VBA pipeline in a high-performance computing environment, called SAMBA. The increased computational efficiency allowed large multidimensional arrays to be processed in 1-3 days , a task that previously took ~ 1 month. To quantify the variability and reliability of preclinical VBA in rodent models, we propose a validation framework consisting of morphological phantoms, and four metrics. This addresses several sources that impact VBA results, including registration and template construction strategies. We have used this framework to inform the VBA workflow parameters in a VBA study for a mouse model of epilepsy. We also present initial efforts towards standardizing small animal neuroimaging data in a similar fashion with human neuroimaging. We conclude that verifying the accuracy of VBA merits attention, and should be the focus of a broader effort within the community . The proposed framework promotes consistent quality assurance of VBA in preclinical neuroimaging; facilitating the creation and communication of robust results.", "edit_actions": [{"type": "R", "before": "Voxel based", "after": "While many neuroscience questions aim to understand the human brain, much current knowledge has been gained using animal models, which replicate genetic, structural, and connectivity aspects of the human brain. While voxel-based", "start_char_pos": 0, "end_char_pos": 11}, {"type": "R", "before": "widely used in neuroscience. Recent studies have highlighted the need for robust statistical analysis in neuroimaging", "after": "widely-used, a thorough examination of the statistical robustness", "start_char_pos": 71, "end_char_pos": 188}, {"type": "R", "before": "controlling error rates ; but a thorough examination of such effects", "after": "error rates", "start_char_pos": 206, "end_char_pos": 274}, {"type": "R", "before": "computational demands. Workflow optimization is", "after": "high computational demands of processing large arrays, and the many parameters involved. Thus, workflows are", "start_char_pos": 290, "end_char_pos": 337}, {"type": "R", "before": "and experience; while validation studies are scarce. While the main goal of many neuroscience questions is to understand the human brain, much of the current knowledge has been gained from small animal models, which replicate many genetic, structural, and connectivity aspects of the human brain.", "after": "or experience, while preclinical validation studies remain scarce.", "start_char_pos": 363, "end_char_pos": 659}, {"type": "A", "before": null, "after": "quantitative", "start_char_pos": 706, "end_char_pos": 706}, {"type": "A", "before": null, "after": ", high throughput", "start_char_pos": 771, "end_char_pos": 771}, {"type": "R", "before": "Increasing", "after": "The increased", "start_char_pos": 844, "end_char_pos": 854}, {"type": "R", "before": "us to produce VBA results", "after": "large multidimensional arrays to be processed", "start_char_pos": 888, "end_char_pos": 913}, {"type": "R", "before": "for large multidimensional arrays which previously took", "after": ", a task that previously took ~", "start_char_pos": 926, "end_char_pos": 981}, {"type": "R", "before": "address the need for quantitative VBA validation", "after": "quantify the variability and reliability of preclinical VBA in rodent models,", "start_char_pos": 994, "end_char_pos": 1042}, {"type": "A", "before": null, "after": "validation", "start_char_pos": 1056, "end_char_pos": 1056}, {"type": "R", "before": "quantitative metrics. We address several factors", "after": "metrics. This addresses several sources", "start_char_pos": 1114, "end_char_pos": 1162}, {"type": "D", "before": "parameters,", "after": null, "start_char_pos": 1211, "end_char_pos": 1222}, {"type": "D", "before": "Due to shorter processing times, we could explore multiple parameter sets, and VBA stability.", "after": null, "start_char_pos": 1261, "end_char_pos": 1354}, {"type": "R", "before": "guide the selection of spatial registration", "after": "inform the VBA workflow", "start_char_pos": 1386, "end_char_pos": 1429}, {"type": "A", "before": null, "after": "also present initial efforts towards standardizing small animal neuroimaging data in a similar fashion with human neuroimaging. We", "start_char_pos": 1490, "end_char_pos": 1490}, {"type": "D", "before": ". By significantly reducing processing times, we were able to do a thorough evaluation of the variability and reliability of VBA results", "after": null, "start_char_pos": 1618, "end_char_pos": 1754}], "sents_char_pos": [0, 99, 231, 312, 378, 415, 659, 843, 990, 1135, 1260, 1354, 1486, 1619, 1756, 1853]} {"doc_id": "1710.03499", "revision_depth": "2", "before_revision": "Molecular motors play key roles URLanizing the interior of cells. An efficient motor in cargo transport would travel with a high speed and a minimal error in transport time (or distance ) while consuming minimal amount of energy. The travel distance and its variance of motor are, however, physically constrained by energy consumption, the principle of which has recently been formulated into the thermodynamic uncertainty relation , the product between the heat dissipated from a motor and the squared relative error in the displacement, has a minimal theoretical bound (Q \\geq 2 k_B T), which is approached when the time trajectory of the motor is maximally regular for a given amount of free energy input. Here, we use \\mathcal{Q} to quantify the transport efficiency of biological motors} . Here, we reinterpret the uncertainty measure (\\mathcal{Q) defined in the thermodynamic uncertainty relation such that a motor efficient in cargo transport is characterized with a small \\mathcal{Q} . } Analyses on the motility data from several types of molecular motors show that \\mathcal{Q} is a nonmonotic function of ATP concentration and load (f). For kinesin-1, \\mathcal{Q} \\muM is locally minimized at [ATP] \\approx 200 \\muM and f\\approx 4 pN. Remarkably, for the mutant with a longer neck-linker this local minimum vanishes , and the energetic cost to achieve the same precision as the wild-type increases significantly , which underscores the importance of molecular structure in transport properties. For the biological motors studied here , their value of \\mathcal{Q semi-optimized under the cellular condition ([ATP] \\approx 1 mM, f=0-1 pN). We find that among the motors, kinesin-1 at single molecule level is the most efficient in cargo transport .", "after_revision": "Molecular motors play pivotal roles URLanizing the interior of cells. A motor efficient in cargo transport would move along cytoskeletal filaments with a high speed and a minimal error in transport distance (or time ) while consuming a minimal amount of energy. The travel distance of the motor and its variance are, however, physically constrained by the free energy being consumed. A recently formulated thermodynamic uncertainty relation offers a theoretical framework for the energy-accuracy trade-off relation ubiquitous in biological processes. According to the relation, a measure \\mathcal{Q, the product between the heat dissipated from a motor and the squared relative error in the displacement, has a minimal theoretical bound (Q \\geq 2 k_B T), which is approached when the time trajectory of the motor is maximally regular for a given amount of free energy input. Here, we use \\mathcal{Q} to quantify the transport efficiency of biological motors} . ) defined in the thermodynamic uncertainty relation such that a motor efficient in cargo transport is characterized with a small \\mathcal{Q} . } Analyses on the motility data from several types of molecular motors reveal that \\mathcal{Q} is a complex function of ATP concentration and load (f). For kinesin-1, \\mathcal{Q} approaches the theoretical bound at f\\approx 4 pN and over a broad range of ATP concentration (1\\muM - 10 mM), and is locally minimized at [ATP] \\approx 200 \\muM . In stark contrast, this local minimum vanishes for a mutant that has a longer neck-linker , and the value of \\mathcal{Q , which underscores the importance of molecular structure . Transport efficiencies of the biological motors studied here are semi-optimized under the cellular condition ([ATP] \\approx 1 mM, f=0-1 pN). Our study indicates that among many possible directions of optimization, cytoskeletal motors are designed to operate at a high speed with a minimal error while leveraging their energy resources .", "edit_actions": [{"type": "R", "before": "key", "after": "pivotal", "start_char_pos": 22, "end_char_pos": 25}, {"type": "R", "before": "An efficient motor", "after": "A motor efficient", "start_char_pos": 66, "end_char_pos": 84}, {"type": "R", "before": "travel", "after": "move along cytoskeletal filaments", "start_char_pos": 110, "end_char_pos": 116}, {"type": "R", "before": "time (or distance", "after": "distance (or time", "start_char_pos": 168, "end_char_pos": 185}, {"type": "A", "before": null, "after": "a", "start_char_pos": 204, "end_char_pos": 204}, {"type": "A", "before": null, "after": "of the motor", "start_char_pos": 251, "end_char_pos": 251}, {"type": "D", "before": "of motor", "after": null, "start_char_pos": 269, "end_char_pos": 277}, {"type": "R", "before": "energy consumption, the principle of which has recently been formulated into the", "after": "the free energy being consumed. A recently formulated", "start_char_pos": 318, "end_char_pos": 398}, {"type": "A", "before": null, "after": "offers a theoretical framework for the energy-accuracy trade-off relation ubiquitous in biological processes. According to the relation, a measure \\mathcal{Q", "start_char_pos": 434, "end_char_pos": 434}, {"type": "D", "before": "Here, we reinterpret the uncertainty measure (\\mathcal{Q", "after": null, "start_char_pos": 797, "end_char_pos": 853}, {"type": "R", "before": "show", "after": "reveal", "start_char_pos": 1067, "end_char_pos": 1071}, {"type": "R", "before": "nonmonotic", "after": "complex", "start_char_pos": 1094, "end_char_pos": 1104}, {"type": "A", "before": null, "after": "approaches the theoretical bound at f\\approx 4 pN and over a broad range of ATP concentration (1", "start_char_pos": 1176, "end_char_pos": 1176}, {"type": "A", "before": null, "after": "- 10 mM), and", "start_char_pos": 1181, "end_char_pos": 1181}, {"type": "R", "before": "and f\\approx 4 pN. Remarkably, for the mutant with", "after": ". In stark contrast, this local minimum vanishes for a mutant that has", "start_char_pos": 1229, "end_char_pos": 1279}, {"type": "D", "before": "this local minimum vanishes", "after": null, "start_char_pos": 1301, "end_char_pos": 1328}, {"type": "R", "before": "energetic cost to achieve the same precision as the wild-type increases significantly", "after": "value of \\mathcal{Q", "start_char_pos": 1339, "end_char_pos": 1424}, {"type": "R", "before": "in transport properties. For", "after": ". Transport efficiencies of", "start_char_pos": 1483, "end_char_pos": 1511}, {"type": "R", "before": ", their value of \\mathcal{Q", "after": "are", "start_char_pos": 1547, "end_char_pos": 1574}, {"type": "R", "before": "We find that among the motors, kinesin-1 at single molecule level is the most efficient in cargo transport", "after": "Our study indicates that among many possible directions of optimization, cytoskeletal motors are designed to operate at a high speed with a minimal error while leveraging their energy resources", "start_char_pos": 1651, "end_char_pos": 1757}], "sents_char_pos": [0, 65, 230, 710, 1148, 1507, 1650]} {"doc_id": "1710.07989", "revision_depth": "1", "before_revision": "Mathematical models of the circulation continue to be an essential tool to study how the cardiovascular (CV) system maintains homeostasis. The utility of these models is ultimately limited by how much we can trust the accuracy of their predictions . The predictive capability of a model can be measured by uncertainty quantification (UQ). A challenge in implementing UQ procedures is that many published methods require that the model be identifiable . An identifiable model is one with a one-to-one mapping from the parameter space to the model output . In this paper we use a novel and reproducible methodology to calibrate a lumped-parameter CV model to left ventricular pressure and volume time series data from rats . Key steps in our methodology include using (1) literature and available data to define a set of nominal parameter values specific to each rat ; (2) sensitivity analysis and subset selection to determine a set of identifiable parameters; (3) optimization to find a point estimate for identifiable parameters; and (4) both frequentist and Bayesian UQ methods to assess the predictive capability of the model .", "after_revision": "Mathematical models are essential tools to study how the cardiovascular system maintains homeostasis. The utility of such models is limited by the accuracy of their predictions , which can be determined by uncertainty quantification (UQ). A challenge associated with the use of UQ is that many published methods assume that the underlying model is identifiable (e.g. that a one-to-one mapping exists from the parameter space to the model output ) . In this study we present a novel methodology that is used here to calibrate a lumped-parameter model to left ventricular pressure and volume time series data sets . Key steps include using (1) literature and available data to determine nominal parameter values ; (2) sensitivity analysis and subset selection to determine a set of identifiable parameters; (3) optimization to find a point estimate for identifiable parameters; and (4) frequentist and Bayesian UQ calculations to assess the predictive capability of the model . Our results show that it is possible to determine 5 identifiable model parameters that can be estimated to our experimental data from three rats, and that computed UQ intervals capture the measurement and model error .", "edit_actions": [{"type": "R", "before": "of the circulation continue to be an essential tool", "after": "are essential tools", "start_char_pos": 20, "end_char_pos": 71}, {"type": "D", "before": "(CV)", "after": null, "start_char_pos": 104, "end_char_pos": 108}, {"type": "R", "before": "these models is ultimately limited by how much we can trust", "after": "such models is limited by", "start_char_pos": 154, "end_char_pos": 213}, {"type": "R", "before": ". The predictive capability of a model can be measured", "after": ", which can be determined", "start_char_pos": 248, "end_char_pos": 302}, {"type": "R", "before": "in implementing UQ procedures", "after": "associated with the use of UQ", "start_char_pos": 351, "end_char_pos": 380}, {"type": "R", "before": "require that the model be identifiable . An identifiable model is one with", "after": "assume that the underlying model is identifiable (e.g. that", "start_char_pos": 412, "end_char_pos": 486}, {"type": "A", "before": null, "after": "exists", "start_char_pos": 508, "end_char_pos": 508}, {"type": "A", "before": null, "after": ")", "start_char_pos": 554, "end_char_pos": 554}, {"type": "R", "before": "paper we use a novel and reproducible methodology", "after": "study we present a novel methodology that is used here", "start_char_pos": 565, "end_char_pos": 614}, {"type": "D", "before": "CV", "after": null, "start_char_pos": 647, "end_char_pos": 649}, {"type": "R", "before": "from rats", "after": "sets", "start_char_pos": 713, "end_char_pos": 722}, {"type": "D", "before": "in our methodology", "after": null, "start_char_pos": 735, "end_char_pos": 753}, {"type": "R", "before": "define a set of", "after": "determine", "start_char_pos": 805, "end_char_pos": 820}, {"type": "D", "before": "specific to each rat", "after": null, "start_char_pos": 846, "end_char_pos": 866}, {"type": "D", "before": "both", "after": null, "start_char_pos": 1041, "end_char_pos": 1045}, {"type": "R", "before": "methods", "after": "calculations", "start_char_pos": 1074, "end_char_pos": 1081}, {"type": "A", "before": null, "after": ". Our results show that it is possible to determine 5 identifiable model parameters that can be estimated to our experimental data from three rats, and that computed UQ intervals capture the measurement and model error", "start_char_pos": 1131, "end_char_pos": 1131}], "sents_char_pos": [0, 138, 249, 338, 452, 556, 868, 961, 1032]} {"doc_id": "1710.09797", "revision_depth": "1", "before_revision": "Consider a countably infinite collection of coupled queuesrepresenting a large wireless network with a queue at each point of the d-dimensional integer grid . These queues have independent Poisson arrivals, but are coupled through their service rateswhich is the signal to interference ratio of wireless network theory. More precisely, the service discipline is translation invariant and of the processor sharing type,with the service rate in each queue slowed down, when the neighboring queues have a larger workload. The dynamics is infinite dimensional Markov, with each queue having a non compact state space . It is neither reversible nor asymptotically product form, as in the mean-field setting . Coupling and percolation techniques are first used to show that this dynamics has well defined trajectories. Coupling from the past techniques of the Loynes' type are then proposed to build its minimal stationary regime. This regime is the one obtained when starting from the all empty initial condition in the distant past. The rate conservation principle of Palm calculus is then used to identify the stability condition of this system, namely the condition on the interference sequence and arrival rates guaranteeing the finiteness of this minimal regime . Remarkably, the rate conservation principle also provides a closed form expression for its mean queue size. When the stability condition holds, this minimal solution is the unique stationary regime, provided it has finite second moments, and this is the case if the arrival rate is small enough . In addition, there exists a range of small initial conditions for which the dynamics is attracted to the minimal regime. Surprisingly however , there exists another range of larger though finite initial conditions for which the dynamics diverges, even though stability criterion holds.", "after_revision": "Consider a countably infinite collection of interacting queues, with a queue located at each point of the d-dimensional integer grid , having independent Poisson arrivals, but dependent service rates. The service discipline is of the processor sharing type,with the service rate in each queue slowed down, when the neighboring queues have a larger workload. The interactions are translation invariant in space and is neither of the Jackson Networks type, nor of the mean-field type . Coupling and percolation techniques are first used to show that this dynamics has well defined trajectories. Coupling from the past techniques are then proposed to build its minimal stationary regime. The rate conservation principle of Palm calculus is then used to identify the stability condition of this system, where the notion of stability is appropriately defined for an infinite dimensional process. We show that the identified condition is also necessary in certain special cases and conjecture it to be true in all cases . Remarkably, the rate conservation principle also provides a closed form expression for the mean queue size. When the stability condition holds, this minimal solution is the unique translation invariant stationary regime . In addition, there exists a range of small initial conditions for which the dynamics is attracted to the minimal regime. Nevertheless , there exists another range of larger though finite initial conditions for which the dynamics diverges, even though stability criterion holds.", "edit_actions": [{"type": "R", "before": "coupled queuesrepresenting a large wireless network", "after": "interacting queues,", "start_char_pos": 44, "end_char_pos": 95}, {"type": "A", "before": null, "after": "located", "start_char_pos": 109, "end_char_pos": 109}, {"type": "R", "before": ". These queues have", "after": ", having", "start_char_pos": 158, "end_char_pos": 177}, {"type": "R", "before": "are coupled through their service rateswhich is the signal to interference ratio of wireless network theory. More precisely, the", "after": "dependent service rates. The", "start_char_pos": 212, "end_char_pos": 340}, {"type": "D", "before": "translation invariant and", "after": null, "start_char_pos": 363, "end_char_pos": 388}, {"type": "R", "before": "dynamics is infinite dimensional Markov, with each queue having a non compact state space . It is neither reversible nor asymptotically product form, as in", "after": "interactions are translation invariant in space and is neither of the Jackson Networks type, nor of", "start_char_pos": 524, "end_char_pos": 679}, {"type": "R", "before": "setting", "after": "type", "start_char_pos": 695, "end_char_pos": 702}, {"type": "D", "before": "of the Loynes' type", "after": null, "start_char_pos": 848, "end_char_pos": 867}, {"type": "D", "before": "This regime is the one obtained when starting from the all empty initial condition in the distant past.", "after": null, "start_char_pos": 926, "end_char_pos": 1029}, {"type": "R", "before": "namely the condition on the interference sequence and arrival rates guaranteeing the finiteness of this minimal regime", "after": "where the notion of stability is appropriately defined for an infinite dimensional process. We show that the identified condition is also necessary in certain special cases and conjecture it to be true in all cases", "start_char_pos": 1144, "end_char_pos": 1262}, {"type": "R", "before": "its", "after": "the", "start_char_pos": 1352, "end_char_pos": 1355}, {"type": "R", "before": "stationary regime, provided it has finite second moments, and this is the case if the arrival rate is small enough", "after": "translation invariant stationary regime", "start_char_pos": 1445, "end_char_pos": 1559}, {"type": "R", "before": "Surprisingly however", "after": "Nevertheless", "start_char_pos": 1683, "end_char_pos": 1703}], "sents_char_pos": [0, 159, 320, 519, 615, 813, 925, 1029, 1372, 1561, 1682]} {"doc_id": "1710.10711", "revision_depth": "1", "before_revision": "We study fractional stochastic volatility models for the asset price , in which the volatility process is a positive continuous function \\sigma of a continuous fractional stochastic process B. The main result obtained in the present paper is a generalization of the large deviation principle for the log-price process due to M. Forde and H. Zhang. In their work, Forde and Zhang assume that the function \\sigma satisfies a global H\\\"{o is fractional Brownian motion, whereas in the present paper , the function \\sigma satisfies a very mild condition expressed in terms of a local modulus of continuity , while the process \\widehat{B} is a general Volterra type Gaussian process. Welder condition and the process }\\widehat{B} establish a small-noise large deviation principle for the log-price in a fractional stochastic volatility model, and under an additional condition of self-similarity of the process \\widehat{B}, derive a similar large deviation principle in the small-time regime. Using the latter result , we obtain asymptotic formulas for binary options, call and put options , and the implied volatility in the small-maturity small-log-moneyness regime .", "after_revision": "We study fractional stochastic volatility models for asset prices , in which the volatility process is a positive continuous function \\sigma of a continuous fractional stochastic process B. The main results obtained in the present paper are generalizations of small-noise and small-time large deviation principles for the log-price process due to Forde and Zhang. It is assumed in the present paper that the function \\sigma satisfies a relatively mild condition expressed in terms of its local modulus of continuity in L^2 , while the process \\widehat{B} is a Volterra type Gaussian process. The assumptions used by Forde and Zhang are more restrictive. It is supposed in their work that the function \\sigma satisfies the global H\\\"{older condition and the process }\\widehat{B} is fractional Brownian motion. In the present paper, we establish a small-noise large deviation principle for the log-price in a fractional stochastic volatility model, and under an additional assumption of the self-similarity of the process \\widehat{B}, derive a similar large deviation principle in the small-time regime. As an application , we obtain asymptotic formulas for binary options, call and put pricing functions , and the implied volatility in certain mixed regimes .", "edit_actions": [{"type": "R", "before": "the asset price", "after": "asset prices", "start_char_pos": 53, "end_char_pos": 68}, {"type": "R", "before": "result", "after": "results", "start_char_pos": 202, "end_char_pos": 208}, {"type": "R", "before": "is a generalization of the large deviation principle", "after": "are generalizations of small-noise and small-time large deviation principles", "start_char_pos": 239, "end_char_pos": 291}, {"type": "D", "before": "M. Forde and H. Zhang. In their work, Forde and Zhang assume that the function \\sigma satisfies a global H\\\"{o", "after": null, "start_char_pos": 325, "end_char_pos": 435}, {"type": "R", "before": "is fractional Brownian motion, whereas", "after": "Forde and Zhang. It is assumed", "start_char_pos": 436, "end_char_pos": 474}, {"type": "R", "before": ",", "after": "that", "start_char_pos": 496, "end_char_pos": 497}, {"type": "R", "before": "very", "after": "relatively", "start_char_pos": 530, "end_char_pos": 534}, {"type": "R", "before": "a", "after": "its", "start_char_pos": 572, "end_char_pos": 573}, {"type": "A", "before": null, "after": "in L^2", "start_char_pos": 602, "end_char_pos": 602}, {"type": "D", "before": "general", "after": null, "start_char_pos": 640, "end_char_pos": 647}, {"type": "R", "before": "We", "after": "The assumptions used by Forde and Zhang are more restrictive. It is supposed in their work that the function \\sigma satisfies the global H\\\"{o", "start_char_pos": 680, "end_char_pos": 682}, {"type": "A", "before": null, "after": "is fractional Brownian motion. In the present paper, we", "start_char_pos": 726, "end_char_pos": 726}, {"type": "R", "before": "condition of", "after": "assumption of the", "start_char_pos": 864, "end_char_pos": 876}, {"type": "R", "before": "Using the latter result", "after": "As an application", "start_char_pos": 990, "end_char_pos": 1013}, {"type": "R", "before": "options", "after": "pricing functions", "start_char_pos": 1079, "end_char_pos": 1086}, {"type": "R", "before": "the small-maturity small-log-moneyness regime", "after": "certain mixed regimes", "start_char_pos": 1119, "end_char_pos": 1164}], "sents_char_pos": [0, 192, 347, 679, 989]} {"doc_id": "1711.07677", "revision_depth": "1", "before_revision": "Understanding the structure of interactions between corporate firms is critical to identify risk concentration and the possible pathways of propagation of financial distress. In this paper we consider the in- teraction due to payments and, by investigating a large proprietary dataset of Italian firms, we characterize the topological properties of the payment network. We then focus on the relation between the net- work of payments and the risk of firms. We show the existence of an homophily of risk, i.e. the tendency of firms with similar risk pro- file to be statistically more connected among themselves. This effect is observed both when considering pairs of firms and when consider- ing communities or hierarchies identified in the network. By applying machine learning techniques, we leverage this knowledge to show that network properties of a node can be used to predict the missing rating of a firm . Our results suggest that risk assessment should take quan- titatively into account also the network of interactions among firms .", "after_revision": "This paper provides empirical evidences that corporate firms risk assessment could benefit from taking quantitatively into account the network of interactions among firms. Indeed, the structure of interactions between firms is critical to identify risk concentration and the possible pathways of propagation of financial distress. In this work, we consider the interactions by investigating a large proprietary dataset of payments among Italian firms. We first characterise the topological properties of the payment networks, and then we focus our attention on the relation between the network and the risk of firms. Our main finding is to document the existence of an homophily of risk, i.e. the tendency of firms with similar risk profile to be statistically more connected among themselves. This effect is observed when considering both pairs of firms and communities or hierarchies identified in the network. We leverage this knowledge to predict the missing rating of a firm using only network properties of a node by means of machine learning methods .", "edit_actions": [{"type": "R", "before": "Understanding the", "after": "This paper provides empirical evidences that corporate firms risk assessment could benefit from taking quantitatively into account the network of interactions among firms. Indeed, the", "start_char_pos": 0, "end_char_pos": 17}, {"type": "D", "before": "corporate", "after": null, "start_char_pos": 52, "end_char_pos": 61}, {"type": "R", "before": "paper", "after": "work,", "start_char_pos": 183, "end_char_pos": 188}, {"type": "R", "before": "in- teraction due to payments and,", "after": "interactions", "start_char_pos": 205, "end_char_pos": 239}, {"type": "R", "before": "Italian firms, we characterize", "after": "payments among Italian firms. We first characterise", "start_char_pos": 288, "end_char_pos": 318}, {"type": "R", "before": "network. We then focus", "after": "networks, and then we focus our attention", "start_char_pos": 361, "end_char_pos": 383}, {"type": "R", "before": "net- work of payments", "after": "network", "start_char_pos": 412, "end_char_pos": 433}, {"type": "R", "before": "We show", "after": "Our main finding is to document", "start_char_pos": 457, "end_char_pos": 464}, {"type": "R", "before": "pro- file", "after": "profile", "start_char_pos": 549, "end_char_pos": 558}, {"type": "R", "before": "both when considering", "after": "when considering both", "start_char_pos": 636, "end_char_pos": 657}, {"type": "D", "before": "when consider- ing", "after": null, "start_char_pos": 677, "end_char_pos": 695}, {"type": "R", "before": "By applying machine learning techniques, we", "after": "We", "start_char_pos": 750, "end_char_pos": 793}, {"type": "D", "before": "show that network properties of a node can be used to", "after": null, "start_char_pos": 821, "end_char_pos": 874}, {"type": "R", "before": ". Our results suggest that risk assessment should take quan- titatively into account also the network of interactions among firms", "after": "using only network properties of a node by means of machine learning methods", "start_char_pos": 912, "end_char_pos": 1041}], "sents_char_pos": [0, 174, 369, 456, 611, 749, 913]} {"doc_id": "1712.01790", "revision_depth": "2", "before_revision": "Network analysis has driven key developments in animal behavior research by providing quantitative methods to study the social structures of animal groups and populations. A recent advancement in network science,multilayer network analysis , the study of network structures of multiple interconnected 'layers' and associated dynamical processes, offers a novel way to represent and analyze animal behavior. It also helps strengthen the links between animal social behavior and broader ecological and evolutionary contexts and processes. In this article, we describe how to encode animal behavior data as different types of multilayer networks, and we link recently-developed multilayer methods to individual-, group-, population-, and evolutionary-level questions in behavioral ecology. We outline a variety of examples for how to apply multilayer methods in behavioral ecology research, including examples that demonstrate how taking a multilayer approach can alter inferences about social structure and the positions of individuals within such a structure. These new insights have consequences for ecological processes such as disease transmission. We also discuss caveats to undertaking multilayer network analysis in the study of animal social networks, and we outline methodological challenges for the application of these approaches. Multilayer network analysis offers a promising approach for tackling classical research questions from a new perspective, and it opens a plethora of new questions that have thus far been out of reach .", "after_revision": "Network analysis has driven key developments in animal behaviour research by providing quantitative methods to study the social structures of animal groups and populations. A recent formalism, known as multilayer network analysis, has advanced the study of multifaceted networked systems and offers a novel way to represent and analyse animal behaviour as connected `layers' of interactions. In this article, we outline the types of behavioural data and questions that may be suitable to study using multilayer network analysis. We detail several multilayer methods, which can provide new insights into questions about animal sociality at the individual-, group-, population-, and evolutionary-levels. We give examples for how to implement multilayer methods to demonstrate how taking a multilayer approach can alter inferences about social structure and the positions of individuals within such a structure. Finally, we discuss caveats to undertaking multilayer network analysis in the study of animal social networks, and we call attention to methodological challenges for the application of these approaches. Our aim is to instigate the study of new questions about animal sociality using the new toolbox of multilayer network analysis .", "edit_actions": [{"type": "R", "before": "behavior", "after": "behaviour", "start_char_pos": 55, "end_char_pos": 63}, {"type": "D", "before": "advancement in network science,", "after": null, "start_char_pos": 181, "end_char_pos": 212}, {"type": "D", "before": "multilayer network analysis", "after": null, "start_char_pos": 212, "end_char_pos": 239}, {"type": "R", "before": ",", "after": "formalism, known as multilayer network analysis, has advanced", "start_char_pos": 240, "end_char_pos": 241}, {"type": "R", "before": "network structures of multiple interconnected 'layers' and associated dynamical processes,", "after": "multifaceted networked systems and", "start_char_pos": 255, "end_char_pos": 345}, {"type": "R", "before": "analyze animal behavior. It also helps strengthen the links between animal social behavior and broader ecological and evolutionary contexts and processes.", "after": "analyse animal behaviour as connected `layers' of interactions.", "start_char_pos": 382, "end_char_pos": 536}, {"type": "R", "before": "describe how to encode animal behavior data as different types of multilayer networks, and we link recently-developed multilayer methods to", "after": "outline the types of behavioural data and questions that may be suitable to study using multilayer network analysis. We detail several multilayer methods, which can provide new insights into questions about animal sociality at the", "start_char_pos": 557, "end_char_pos": 696}, {"type": "R", "before": "evolutionary-level questions in behavioral ecology. We outline a variety of", "after": "evolutionary-levels. We give", "start_char_pos": 735, "end_char_pos": 810}, {"type": "R", "before": "apply multilayer methods in behavioral ecology research, including examples that", "after": "implement multilayer methods to", "start_char_pos": 831, "end_char_pos": 911}, {"type": "R", "before": "These new insights have consequences for ecological processes such as disease transmission. We also", "after": "Finally, we", "start_char_pos": 1059, "end_char_pos": 1158}, {"type": "R", "before": "outline", "after": "call attention to", "start_char_pos": 1265, "end_char_pos": 1272}, {"type": "R", "before": "Multilayer network analysis offers a promising approach for tackling classical research questions from a new perspective, and it opens a plethora", "after": "Our aim is to instigate the study", "start_char_pos": 1340, "end_char_pos": 1485}, {"type": "R", "before": "that have thus far been out of reach", "after": "about animal sociality using the new toolbox of multilayer network analysis", "start_char_pos": 1503, "end_char_pos": 1539}], "sents_char_pos": [0, 171, 406, 536, 786, 1058, 1150, 1339]} {"doc_id": "1712.02949", "revision_depth": "1", "before_revision": "\\Re{R} \\eps{\\varepsilon} \\Net{S} \\tldO{{O}} \\body{C} We revisit the problem of building weak%DIFDELCMD < \\eps%%% -nets for convex ranges over a point set in \\Re^d. Unfortunately, the known constructions of weak%DIFDELCMD < \\eps%%% -nets yields sets that are of size \\Omega(%DIFDELCMD < \\eps%%% ^{-d e^{c d^2} ) }%DIFDELCMD < \\Bigr.%%% , where c is some constant. We offer two alternative schemes that yield significantly smaller sets, and two related results, as follows: (A)Let%DIFDELCMD < \\Net %%% be a sample of size ] \\tldO(d ^2%DIFDELCMD < \\eps%%% ^{-1 , where \\tldO hides polylogarithmic terms. Given a convex body%DIFDELCMD < \\body%%% , via a separation oracle, the algorithm performs a small sequence of (oracle) stabbing queries (computed from%DIFDELCMD < \\Net%%% ) -- if none of the query points hits%DIFDELCMD < \\body%%% , then%DIFDELCMD < \\body %%% contains less than an%DIFDELCMD < \\eps%%% -fraction of the input points. The number of stabbing queries performed is O( d^2\\log%DIFDELCMD < \\eps%%% ^{-1 \\tldO(d ^9%DIFDELCMD < \\eps%%% ^{-1 is the first weak%DIFDELCMD < \\eps%%% -net related construction where all constants/bounds are polynomial in the dimension. (B) If one is allowed to expand the convex range before checking if it intersects the sample, then a sample of size%DIFDELCMD < \\Bigl.\\tldO%%% (%DIFDELCMD < \\eps%%% ^{-(d+1)/2), from the original point set, is sufficient to form a net. (C) We show a construction of weak }%DIFDELCMD < \\eps%%% -nets which have the following additional property: For a heavy body, there is a net point that stabs the body, and it is also a good centerpoint for the points contained inside the body. (D) We present a variant of a known algorithm for approximating a centerpoint, improving the running time from%DIFDELCMD < \\tldO%%% (d^9) to%DIFDELCMD < \\tldO%%% (d^7). Our analysis of this algorithmis arguably cleaner than the previous version .", "after_revision": "\\Re{R} \\eps{\\varepsilon} \\Net{S} \\tldO{{O}} \\body{C} We revisit %DIFDELCMD < \\eps%%% %DIFDELCMD < \\eps%%% %DIFDELCMD < \\eps%%% e^{c d^2} ) }%DIFDELCMD < \\Bigr.%%% %DIFDELCMD < \\Net %%% an algorithm of Clarkson etal CEMST96], that computes (roughly) a 1/(4d^2)-centerpoint in \\tldO(d %DIFDELCMD < \\eps%%% ^9) time, for a point set in \\Re^d , where \\tldO hides polylogarithmic terms. %DIFDELCMD < \\body%%% %DIFDELCMD < \\Net%%% %DIFDELCMD < \\body%%% %DIFDELCMD < \\body %%% %DIFDELCMD < \\eps%%% %DIFDELCMD < \\eps%%% We present an improved algorithm that computes (roughly) a 1/d^2-centerpoint with running time \\tldO(d %DIFDELCMD < \\eps%%% ^7). While the improvements are (arguably) mild, it is the first %DIFDELCMD < \\eps%%% %DIFDELCMD < \\Bigl.\\tldO%%% %DIFDELCMD < \\eps%%% ), from the original point set, is sufficient to form a net. (C) We show a construction of weak }%DIFDELCMD < \\eps%%% %DIFDELCMD < \\tldO%%% %DIFDELCMD < \\tldO%%% progress on this well known problem in over twenty years. The new algorithm is simpler, and the running time bound follows by a simple random walk argument, which we believe to be of independent interest. We also present several new applications of the improved centerpoint algorithm .", "edit_actions": [{"type": "D", "before": "the problem of building weak", "after": null, "start_char_pos": 64, "end_char_pos": 92}, {"type": "D", "before": "-nets for convex ranges over a point set in \\Re^d. Unfortunately, the known constructions of weak", "after": null, "start_char_pos": 113, "end_char_pos": 210}, {"type": "D", "before": "-nets yields sets that are of size \\Omega(", "after": null, "start_char_pos": 231, "end_char_pos": 273}, {"type": "D", "before": "^{-d", "after": null, "start_char_pos": 294, "end_char_pos": 298}, {"type": "D", "before": ", where c is some constant. We offer two alternative schemes that yield significantly smaller sets, and two related results, as follows: (A)Let", "after": null, "start_char_pos": 335, "end_char_pos": 478}, {"type": "R", "before": "be a sample of size", "after": "an algorithm of Clarkson etal", "start_char_pos": 500, "end_char_pos": 519}, {"type": "A", "before": null, "after": "CEMST96", "start_char_pos": 520, "end_char_pos": 520}, {"type": "A", "before": null, "after": ", that computes (roughly) a 1/(4d^2)-centerpoint in", "start_char_pos": 521, "end_char_pos": 521}, {"type": "D", "before": "^2", "after": null, "start_char_pos": 530, "end_char_pos": 532}, {"type": "R", "before": "^{-1", "after": "^9) time, for a point set in \\Re^d", "start_char_pos": 553, "end_char_pos": 557}, {"type": "D", "before": "Given a convex body", "after": null, "start_char_pos": 601, "end_char_pos": 620}, {"type": "D", "before": ", via a separation oracle, the algorithm performs a small sequence of (oracle) stabbing queries (computed from", "after": null, "start_char_pos": 642, "end_char_pos": 752}, {"type": "D", "before": ") -- if none of the query points hits", "after": null, "start_char_pos": 773, "end_char_pos": 810}, {"type": "D", "before": ", then", "after": null, "start_char_pos": 832, "end_char_pos": 838}, {"type": "D", "before": "contains less than an", "after": null, "start_char_pos": 861, "end_char_pos": 882}, {"type": "D", "before": "-fraction of the input points. The number of stabbing queries performed is O( d^2\\log", "after": null, "start_char_pos": 903, "end_char_pos": 988}, {"type": "R", "before": "^{-1", "after": "We present an improved algorithm that computes (roughly) a 1/d^2-centerpoint with running time", "start_char_pos": 1009, "end_char_pos": 1013}, {"type": "D", "before": "^9", "after": null, "start_char_pos": 1022, "end_char_pos": 1024}, {"type": "R", "before": "^{-1", "after": "^7). While the improvements are (arguably) mild, it", "start_char_pos": 1045, "end_char_pos": 1049}, {"type": "D", "before": "weak", "after": null, "start_char_pos": 1063, "end_char_pos": 1067}, {"type": "D", "before": "-net related construction where all constants/bounds are polynomial in the dimension. (B) If one is allowed to expand the convex range before checking if it intersects the sample, then a sample of size", "after": null, "start_char_pos": 1088, "end_char_pos": 1289}, {"type": "D", "before": "(", "after": null, "start_char_pos": 1317, "end_char_pos": 1318}, {"type": "D", "before": "^{-(d+1)/2", "after": null, "start_char_pos": 1339, "end_char_pos": 1349}, {"type": "D", "before": "-nets which have the following additional property: For a heavy body, there is a net point that stabs the body, and it is also a good centerpoint for the points contained inside the body. (D) We present a variant of a known algorithm for approximating a centerpoint, improving the running time from", "after": null, "start_char_pos": 1467, "end_char_pos": 1765}, {"type": "D", "before": "(d^9) to", "after": null, "start_char_pos": 1787, "end_char_pos": 1795}, {"type": "R", "before": "(d^7). Our analysis of this algorithmis arguably cleaner than the previous version", "after": "progress on this well known problem in over twenty years. The new algorithm is simpler, and the running time bound follows by a simple random walk argument, which we believe to be of independent interest. We also present several new applications of the improved centerpoint algorithm", "start_char_pos": 1817, "end_char_pos": 1899}], "sents_char_pos": [0, 163, 362, 600, 933, 1173, 1409, 1654, 1823]} {"doc_id": "1712.03448", "revision_depth": "1", "before_revision": "We introduce a Random Attention Model (RAM) allowing for a large class of stochastic consideration maps in the context of an otherwise canonical limited attention model for decision theory. The model relies on a new restriction on the unobserved, possibly stochastic consideration map, termedMonotonic Attention , which is intuitive and nests many recent contributions in the literature on limited attention. We develop revealed preference theory within RAM and obtain precise testable implications for observable choice probabilities. Using these results, we show that a set (possibly a singleton) of strict preference orderings compatible with RAM is identifiable from the decision maker's choice probabilities, and establish a representation of this identified set of unobserved preferencesas a collection of inequality constrains on her choice probabilities. Given this nonparametric identification result, we develop uniformly valid inference methods for the (partially) identifiable preferences. We showcase the performance of our proposed econometric methods using simulations, and provide general-purpose software implementation of our estimation and inference results in theR software package\\texttt{ramchoice . Our proposed econometric methods are computationally very fast to implement .", "after_revision": "This paper illustrates how one can deduce preference from observed choices when attention is not only limited but also random. In contrast to earlier approaches, we introduce a Random Attention Model (RAM) where we abstain from any particular attention formation, and instead consider a large class of nonparametric random attention rules. Our model imposes one intuitive condition, termed Monotonic Attention, which captures the idea that each consideration set competes for the decision-maker's attention. We then develop revealed preference theory within RAM and obtain precise testable implications for observable choice probabilities. Based on these theoretical findings, we propose econometric methods for identification, estimation, and inference of the decision maker's preferences. To illustrate the applicability of our results and their concrete empirical content in specific settings, we also develop revealed preference theory and accompanying econometric methods under additional nonparametric assumptions on the consideration set for binary choice problems. Finally, we provide general purpose software implementation of our estimation and inference results \\texttt{ , and showcase their performance using simulations .", "edit_actions": [{"type": "R", "before": "We", "after": "This paper illustrates how one can deduce preference from observed choices when attention is not only limited but also random. In contrast to earlier approaches, we", "start_char_pos": 0, "end_char_pos": 2}, {"type": "R", "before": "allowing for", "after": "where we abstain from any particular attention formation, and instead consider", "start_char_pos": 44, "end_char_pos": 56}, {"type": "D", "before": "stochastic consideration maps in the context of an otherwise canonical limited attention model for decision theory. The model relies on a new restriction on the unobserved, possibly stochastic consideration map, termed", "after": null, "start_char_pos": 74, "end_char_pos": 292}, {"type": "D", "before": "Monotonic Attention", "after": null, "start_char_pos": 292, "end_char_pos": 311}, {"type": "R", "before": ", which is intuitive and nests many recent contributions in the literature on limited", "after": "nonparametric random attention rules. Our model imposes one intuitive condition, termed Monotonic Attention, which captures the idea that each consideration set competes for the decision-maker's", "start_char_pos": 312, "end_char_pos": 397}, {"type": "A", "before": null, "after": "then", "start_char_pos": 412, "end_char_pos": 412}, {"type": "R", "before": "Using these results, we show that a set (possibly a singleton) of strict preference orderings compatible with RAM is identifiable from", "after": "Based on these theoretical findings, we propose econometric methods for identification, estimation, and inference of", "start_char_pos": 537, "end_char_pos": 671}, {"type": "R", "before": "choice probabilities, and establish a representation of this identified set of unobserved preferencesas a collection of inequality constrains on her choice probabilities. Given this nonparametric identification result, we develop uniformly valid inference methods for the (partially) identifiable preferences. We showcase the performance of our proposed econometric methods using simulations, and provide general-purpose", "after": "preferences. To illustrate the applicability of our results and their concrete empirical content in specific settings, we also develop revealed preference theory and accompanying econometric methods under additional nonparametric assumptions on the consideration set for binary choice problems. Finally, we provide general purpose", "start_char_pos": 693, "end_char_pos": 1113}, {"type": "D", "before": "in the", "after": null, "start_char_pos": 1178, "end_char_pos": 1184}, {"type": "D", "before": "R", "after": null, "start_char_pos": 1184, "end_char_pos": 1185}, {"type": "D", "before": "software package", "after": null, "start_char_pos": 1186, "end_char_pos": 1202}, {"type": "D", "before": "ramchoice", "after": null, "start_char_pos": 1210, "end_char_pos": 1219}, {"type": "R", "before": ". Our proposed econometric methods are computationally very fast to implement", "after": ", and showcase their performance using simulations", "start_char_pos": 1220, "end_char_pos": 1297}], "sents_char_pos": [0, 189, 408, 536, 863, 1002, 1221]} {"doc_id": "1712.08911", "revision_depth": "1", "before_revision": "In this paper we study the following problem: we are given a set of imprecise points modeled as parallel line segments , and we wish to place a point on each line segment such that the resulting point set maximizes /minimizes the size of the largest /smallest area k-gon. We first study the problem for the case k=3. We show that for a given set of parallel line segments of equal length the largest possible area triangle can be found in O(n \\log n) time , and for line segments of arbitrary length the problem can be solved in O(n ^2) time . Also, we show that the smallest largest-area triangle can be found in O(n^2 \\log n) time . As for finding smallest-area triangles, we show that finding the largest smallest-area triangle is NP-hard , but that the smallest possible area triangle for a set of arbitrary length parallel line segments can be found in O(n^2) time. Finally, we discuss to what extent our results can be generalized to larger values of k .", "after_revision": "Assume we are given a set of parallel line segments in the plane , and we wish to place a point on each line segment such that the resulting point set maximizes or minimizes the area of the largest or smallest triangle in the set. We analyze the complexity of the four resulting computational problems, and we show that three of them admit polynomial-time algorithms, while the fourth is NP-hard. Specifically, we show that maximizing the largest triangle can be done in O(n ^2) time (or in O(n \\log n) time for unit segments); minimizing the largest triangle can be done in O(n^2 \\log n) time ; maximizing the smallest triangle is NP-hard ; but minimizing the smallest triangle can be done in O(n^2) time. We also discuss to what extent our results can be generalized to polygons with k>3 sides .", "edit_actions": [{"type": "R", "before": "In this paper we study the following problem: we", "after": "Assume we", "start_char_pos": 0, "end_char_pos": 48}, {"type": "D", "before": "imprecise points modeled as", "after": null, "start_char_pos": 68, "end_char_pos": 95}, {"type": "A", "before": null, "after": "in the plane", "start_char_pos": 119, "end_char_pos": 119}, {"type": "R", "before": "/minimizes the size", "after": "or minimizes the area", "start_char_pos": 216, "end_char_pos": 235}, {"type": "R", "before": "/smallest area k-gon. We first study the problem for the case k=3. We show that for a given set of parallel line segments of equal length the largest possible area", "after": "or smallest triangle in the set. We analyze the complexity of the four resulting computational problems, and we show that three of them admit polynomial-time algorithms, while the fourth is NP-hard. Specifically, we show that maximizing the largest", "start_char_pos": 251, "end_char_pos": 414}, {"type": "R", "before": "found", "after": "done", "start_char_pos": 431, "end_char_pos": 436}, {"type": "R", "before": "\\log n) time , and for line segments of arbitrary length the problem can be solved", "after": "^2) time (or", "start_char_pos": 444, "end_char_pos": 526}, {"type": "R", "before": "^2) time . Also, we show that the smallest largest-area", "after": "\\log n) time for unit segments); minimizing the largest", "start_char_pos": 534, "end_char_pos": 589}, {"type": "R", "before": "found", "after": "done", "start_char_pos": 606, "end_char_pos": 611}, {"type": "R", "before": ". As for finding smallest-area triangles, we show that finding the largest smallest-area", "after": "; maximizing the smallest", "start_char_pos": 634, "end_char_pos": 722}, {"type": "R", "before": ", but that the smallest possible area triangle for a set of arbitrary length parallel line segments can be found", "after": "; but minimizing the smallest triangle can be done", "start_char_pos": 743, "end_char_pos": 855}, {"type": "R", "before": "Finally, we", "after": "We also", "start_char_pos": 872, "end_char_pos": 883}, {"type": "R", "before": "larger values of k", "after": "polygons with k>3 sides", "start_char_pos": 941, "end_char_pos": 959}], "sents_char_pos": [0, 272, 317, 544, 635, 871]} {"doc_id": "1801.00864", "revision_depth": "1", "before_revision": "Limitations in processing capabilities and memory of today's computers make spiking neuron-based (human) whole-brain simulations inevitably characterized by a compromise between bio-plausibility and computational cost. It translates into brain models composed of a reduced number of neurons and a simplified neuron's mathematical model . Taking advantage of the sparse character of brain-like computation, eventdriven technique allows us to carry out efficient simulation of large-scale Spiking Neural Networks (SNN). The recent Leaky Integrate-and-Fire with Latency (LIFL) spiking neuron model is event-driven compatible and exhibits some realistic neuronal features, opening new horizons in whole-brain modelling. In this paper we present FNS, a LIFL-based exact event-driven spiking neural network framework implemented in Java and oriented to wholebrain simulations. FNS combines spiking/synaptic whole-brain modelling with the event-driven approach, allowing us to define heterogeneous modules and multi-scale connectivity with delayed connections and plastic synapses , providing fast simulations at the same time. A novel parallelization strategy is also implemented in order to further speed up simulations . This paper presents mathematical models, software implementation and simulation routines on which FNS is based. Finally, a reduced brain network model (1400 neurons and 45000 synapses) is synthesized on the basis of real brain structural data, and the resulting model activity is compared with associated brain functional (source-space MEG) data . The conducted test shows a good matching between the activity of model and that of the emulated subject, in outstanding simulation times (about 20s for simulating 4s of activity with a normal PC). Dedicated sections of stimuli editing and output synthesis allow the neuroscientist to introduce and extract brain-like signals, respectively.. .", "after_revision": "Limitations in processing capabilities and memory of today's computers make spiking neuron-based (human) whole-brain simulations inevitably characterized by a compromise between bio-plausibility and computational cost. It translates into brain models composed of a reduced number of neurons and a simplified neuron's mathematical model , leading to the search for new simulation strategies . Taking advantage of the sparse character of brain-like computation, the event-driven technique could represent a way to carry out efficient simulation of large-scale Spiking Neural Networks (SNN). The recent Leaky Integrate-and-Fire with Latency (LIFL) spiking neuron model is event-driven compatible and exhibits some realistic neuronal features, opening new avenues for brain modelling. In this paper we introduce FNS, the first LIFL-based spiking neural network framework , which combines spiking/synaptic neural modelling with the event-driven approach, allowing us to define heterogeneous neuron modules and multi-scale connectivity with delayed connections and plastic synapses . In order to allow multi-thread implementations a novel parallelization strategy is also introduced . This paper presents mathematical models, software implementation and simulation routines on which FNS is based. Finally, a brain subnetwork is modeled on the basis of real brain structural data, and the resulting simulated activity is compared with associated brain functional (source-space MEG) data , demonstrating a good matching between the activity of the model and that of the experimetal data. This work aims to lay the groundwork for future event-driven based personalised brain models .", "edit_actions": [{"type": "A", "before": null, "after": ", leading to the search for new simulation strategies", "start_char_pos": 336, "end_char_pos": 336}, {"type": "R", "before": "eventdriven technique allows us", "after": "the event-driven technique could represent a way", "start_char_pos": 407, "end_char_pos": 438}, {"type": "R", "before": "horizons in whole-brain", "after": "avenues for brain", "start_char_pos": 682, "end_char_pos": 705}, {"type": "R", "before": "present FNS, a", "after": "introduce FNS, the first", "start_char_pos": 734, "end_char_pos": 748}, {"type": "D", "before": "exact event-driven", "after": null, "start_char_pos": 760, "end_char_pos": 778}, {"type": "R", "before": "implemented in Java and oriented to wholebrain simulations. FNS", "after": ", which", "start_char_pos": 812, "end_char_pos": 875}, {"type": "R", "before": "whole-brain", "after": "neural", "start_char_pos": 902, "end_char_pos": 913}, {"type": "A", "before": null, "after": "neuron", "start_char_pos": 992, "end_char_pos": 992}, {"type": "R", "before": ", providing fast simulations at the same time. A", "after": ". In order to allow multi-thread implementations a", "start_char_pos": 1076, "end_char_pos": 1124}, {"type": "R", "before": "implemented in order to further speed up simulations", "after": "introduced", "start_char_pos": 1164, "end_char_pos": 1216}, {"type": "R", "before": "reduced brain network model (1400 neurons and 45000 synapses) is synthesized", "after": "brain subnetwork is modeled", "start_char_pos": 1342, "end_char_pos": 1418}, {"type": "R", "before": "model", "after": "simulated", "start_char_pos": 1481, "end_char_pos": 1486}, {"type": "R", "before": ". The conducted test shows", "after": ", demonstrating", "start_char_pos": 1565, "end_char_pos": 1591}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1632, "end_char_pos": 1632}, {"type": "R", "before": "emulated subject, in outstanding simulation times (about 20s for simulating 4s of activity with a normal PC). Dedicated sections of stimuli editing and output synthesis allow the neuroscientist to introduce and extract brain-like signals, respectively..", "after": "experimetal data. This work aims to lay the groundwork for future event-driven based personalised brain models", "start_char_pos": 1655, "end_char_pos": 1908}], "sents_char_pos": [0, 218, 338, 518, 716, 871, 1122, 1218, 1330, 1566, 1764]} {"doc_id": "1801.01853", "revision_depth": "1", "before_revision": "Maximum Entropy models can be inferred from large data-sets to uncover how local interactions can generate collective dynamics . Here, we employ such methods to investigate the characteristics of neurons recorded by multielectrode arrays in the cortex of human and monkey throughout states of wakefulness and sleep . Taking advantage of the separation of cells into excitatory and inhibitory types, we construct a model including this biological feature. By comparing the performances of Maximum Entropy models at predicting neural activity in wakefulness and deep sleep, we identify the dominant interactions between neurons in each brain state. We find that during wakefulness, dominant functional interactions are pairwise while during sleep, interactions are population-wide . In particular, inhibitory cells are shown to be strongly tuned to the inhibitory population. This shows that Maximum Entropy models can be useful to analyze data-sets with excitatory and inhibitory cells, and can reveal the role of inhibitory cells URLanizing coherent dynamics in cerebral cortex.", "after_revision": "Maximum Entropy models can be inferred from large data-sets to uncover how collective dynamics emerge from local interactions . Here, such models are employed to investigate neurons recorded by multielectrode arrays in the human and monkey cortex . Taking advantage of the separation of excitatory and inhibitory neuron types, we construct a model including this distinction. This approach allows to shed light upon differences between excitatory and inhibitory activity across different brain states such as wakefulness and deep sleep, in agreement with previous findings. Additionally, Maximum Entropy models can also unveil novel features of neuronal interactions, which are found to be dominated by pairwise interactions during wakefulness, but are population-wide during deep sleep . In particular, inhibitory neurons are observed to be strongly tuned to the inhibitory population. Overall, we demonstrate Maximum Entropy models can be useful to analyze data-sets with classified neuron types, and to reveal the respective roles of excitatory and inhibitory neurons URLanizing coherent dynamics in the cerebral cortex.", "edit_actions": [{"type": "R", "before": "local interactions can generate collective dynamics", "after": "collective dynamics emerge from local interactions", "start_char_pos": 75, "end_char_pos": 126}, {"type": "R", "before": "we employ such methods to investigate the characteristics of", "after": "such models are employed to investigate", "start_char_pos": 135, "end_char_pos": 195}, {"type": "D", "before": "cortex of", "after": null, "start_char_pos": 245, "end_char_pos": 254}, {"type": "R", "before": "throughout states of wakefulness and sleep", "after": "cortex", "start_char_pos": 272, "end_char_pos": 314}, {"type": "D", "before": "cells into", "after": null, "start_char_pos": 355, "end_char_pos": 365}, {"type": "A", "before": null, "after": "neuron", "start_char_pos": 392, "end_char_pos": 392}, {"type": "R", "before": "biological feature. By comparing the performances of Maximum Entropy models at predicting neural activity in", "after": "distinction. This approach allows to shed light upon differences between excitatory and inhibitory activity across different brain states such as", "start_char_pos": 436, "end_char_pos": 544}, {"type": "R", "before": "we identify the dominant interactions between neurons in each brain state. We find that during wakefulness, dominant functional interactions", "after": "in agreement with previous findings. Additionally, Maximum Entropy models can also unveil novel features of neuronal interactions, which are found to be dominated by pairwise interactions during wakefulness, but", "start_char_pos": 573, "end_char_pos": 713}, {"type": "D", "before": "pairwise while during sleep, interactions are", "after": null, "start_char_pos": 718, "end_char_pos": 763}, {"type": "A", "before": null, "after": "during deep sleep", "start_char_pos": 780, "end_char_pos": 780}, {"type": "R", "before": "cells are shown", "after": "neurons are observed", "start_char_pos": 809, "end_char_pos": 824}, {"type": "R", "before": "This shows that", "after": "Overall, we demonstrate", "start_char_pos": 876, "end_char_pos": 891}, {"type": "R", "before": "excitatory and inhibitory cells, and can reveal the role of inhibitory cells", "after": "classified neuron types, and to reveal the respective roles of excitatory and inhibitory neurons", "start_char_pos": 955, "end_char_pos": 1031}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1064, "end_char_pos": 1064}], "sents_char_pos": [0, 128, 455, 647, 782, 875]} {"doc_id": "1801.07330", "revision_depth": "1", "before_revision": "We for the first time combine generated adversarial network (GAN) with wide-field light microscopy to achieve deep learning super-resolution under a large field of view (FOV). By appropriately adopting prior microscopy data in an adversarial training, the network can recover a high-resolution, accurate image of new specimen from its single low-resolution measurement. This capacity has been adequately demonstrated by imaging various types of samples, such as USAF resolution target, human pathological slides and fluorescence-labelled fibroblast cells . Their gigapixel, multi-color reconstructions verify a successful GAN-based single image super-resolution procedure. Furthermore, this deep learning-based imaging approach doesn;t necessarily introduce any change to the setup of a conventional wide-filed microscope, reconstructing large FOV ( about 95 mm^2 ), high-resolution ( about 1.7 {\\mu}m) image at a high speed ( in 1 second) . As a result, GAN-microscopy opens a new way to computationally overcome the general challenge of high-throughput , high-resolution microscopy that is originally coupled to the physical limitation of system's optics .", "after_revision": "We combine generative adversarial network (GAN) with light microscopy to achieve deep learning super-resolution under a large field of view (FOV). By appropriately adopting prior microscopy data in an adversarial training, the neural network can recover a high-resolution, accurate image of new specimen from its single low-resolution measurement. Its capacity has been broadly demonstrated via imaging various types of samples, such as USAF resolution target, human pathological slides , fluorescence-labelled fibroblast cells , and deep tissues in transgenic mouse brain, by both wide-field and light-sheet microscopes. The gigapixel, multi-color reconstruction of these samples verifies a successful GAN-based single image super-resolution procedure. We also propose an image degrading model to generate low resolution images for training, making our approach free from the complex image registration during training dataset preparation. After a welltrained network being created, this deep learning-based imaging approach is capable of recovering a large FOV ( ~ 95 mm2 ), high-resolution ( ~ 1.7 {\\mu}m) image at high speed ( within 1 second) , while not necessarily introducing any changes to the setup of existing microscopes .", "edit_actions": [{"type": "R", "before": "for the first time combine generated", "after": "combine generative", "start_char_pos": 3, "end_char_pos": 39}, {"type": "D", "before": "wide-field", "after": null, "start_char_pos": 71, "end_char_pos": 81}, {"type": "A", "before": null, "after": "neural", "start_char_pos": 256, "end_char_pos": 256}, {"type": "R", "before": "This", "after": "Its", "start_char_pos": 371, "end_char_pos": 375}, {"type": "R", "before": "adequately demonstrated by", "after": "broadly demonstrated via", "start_char_pos": 394, "end_char_pos": 420}, {"type": "R", "before": "and", "after": ",", "start_char_pos": 513, "end_char_pos": 516}, {"type": "R", "before": ". Their", "after": ", and deep tissues in transgenic mouse brain, by both wide-field and light-sheet microscopes. The", "start_char_pos": 556, "end_char_pos": 563}, {"type": "R", "before": "reconstructions verify", "after": "reconstruction of these samples verifies", "start_char_pos": 587, "end_char_pos": 609}, {"type": "R", "before": "Furthermore,", "after": "We also propose an image degrading model to generate low resolution images for training, making our approach free from the complex image registration during training dataset preparation. After a welltrained network being created,", "start_char_pos": 674, "end_char_pos": 686}, {"type": "R", "before": "doesn;t necessarily introduce any change to the setup of a conventional wide-filed microscope, reconstructing", "after": "is capable of recovering a", "start_char_pos": 729, "end_char_pos": 838}, {"type": "R", "before": "about", "after": "~", "start_char_pos": 851, "end_char_pos": 856}, {"type": "R", "before": "mm^2", "after": "mm2", "start_char_pos": 860, "end_char_pos": 864}, {"type": "R", "before": "about", "after": "~", "start_char_pos": 886, "end_char_pos": 891}, {"type": "D", "before": "a", "after": null, "start_char_pos": 913, "end_char_pos": 914}, {"type": "R", "before": "in", "after": "within", "start_char_pos": 928, "end_char_pos": 930}, {"type": "D", "before": ". As a result, GAN-microscopy opens a new way to computationally overcome the general challenge of high-throughput", "after": null, "start_char_pos": 941, "end_char_pos": 1055}, {"type": "R", "before": "high-resolution microscopy that is originally coupled to the physical limitation of system's optics", "after": "while not necessarily introducing any changes to the setup of existing microscopes", "start_char_pos": 1058, "end_char_pos": 1157}], "sents_char_pos": [0, 175, 370, 557, 673, 942]} {"doc_id": "1801.09212", "revision_depth": "1", "before_revision": "The past decades witness FLOPS (Floating-point Operations per Second) , as an important computation-centric performance metric , guides computer architecture evolution, bridges hardware and software co-design, and provides quantitative performance number for system optimization . However, for emerging datacenter computing (in short, DC) workloads, such as internet services or big data analytics, previous work reports on the modern CPU architecture that the average proportion of floating-point instructions only takes 1\\% and the average FLOPS efficiency is only 0.1\\%, while the average CPU utilization is high as 63\\%. These contradicting performance numbers imply that FLOPS is inappropriate for evaluating DC computer systems. To address the above issue, we propose a new computation-centric metric BOPS (Basic OPerations per Second) . In our definition, Basic Operations include all of arithmetic, logical, comparing and array addressing operations for integer and floating point. BOPS is the average number of BOPs (Basic OPerations) completed each second. To that end, we present a dwarf-based measuring tool to evaluate DC computer systems in terms of our new metrics . On the basis of BOPS, also we propose a new roofline performance model for DC computing . Through the experiments, we demonstrate that our new metrics--BOPS, measuring tool, and new performance modelindeed facilitate DC computer system design and optimization .", "after_revision": "The past decades witness FLOPS (Floating-point Operations per Second) as an important computation-centric performance metric . However, for datacenter (in short, DC) computing workloads, such as Internet services or big data analytics, previous work reports that they have extremely low floating point operation intensity, and the average FLOPS efficiency is only 0.1\\%, while the average IPC is 1.3 (the theoretic IPC is 4 on the Intel Xeon E5600 platform). Furthermore, we reveal that the traditional FLOPS based Roofline performance model is not suitable for modern DC workloads, and gives misleading information for system optimization. These observations imply that FLOPS is inappropriate for evaluating DC computer systems. To address the above issue, we propose a new computation-centric metric BOPs (Basic OPerations ) that measures the efficient work defined by the source code, includes floating-point operations and the arithmetic, logical, comparing , and array addressing parts of integer operations. We define BOPS as the average number of BOPs per second, and propose replacing FLOPS with BOPS to measure DC computer systems . On the basis of BOPS, we propose a new Roofline performance model for DC computing , which we call DC-Roofline model, with which we optimize DC workloads with the improvement varying from 119\\% to 325\\% .", "edit_actions": [{"type": "D", "before": ",", "after": null, "start_char_pos": 70, "end_char_pos": 71}, {"type": "D", "before": ", guides computer architecture evolution, bridges hardware and software co-design, and provides quantitative performance number for system optimization", "after": null, "start_char_pos": 127, "end_char_pos": 278}, {"type": "R", "before": "emerging datacenter computing", "after": "datacenter", "start_char_pos": 294, "end_char_pos": 323}, {"type": "A", "before": null, "after": "computing", "start_char_pos": 339, "end_char_pos": 339}, {"type": "R", "before": "internet", "after": "Internet", "start_char_pos": 359, "end_char_pos": 367}, {"type": "R", "before": "on the modern CPU architecture that the average proportion of floating-point instructions only takes 1\\%", "after": "that they have extremely low floating point operation intensity,", "start_char_pos": 422, "end_char_pos": 526}, {"type": "R", "before": "CPU utilization is high as 63\\%. These contradicting performance numbers", "after": "IPC is 1.3 (the theoretic IPC is 4 on the Intel Xeon E5600 platform). Furthermore, we reveal that the traditional FLOPS based Roofline performance model is not suitable for modern DC workloads, and gives misleading information for system optimization. These observations", "start_char_pos": 593, "end_char_pos": 665}, {"type": "R", "before": "BOPS", "after": "BOPs", "start_char_pos": 808, "end_char_pos": 812}, {"type": "R", "before": "per Second) . In our definition, Basic Operations include all of", "after": ") that measures the efficient work defined by the source code, includes floating-point operations and the", "start_char_pos": 831, "end_char_pos": 895}, {"type": "A", "before": null, "after": ",", "start_char_pos": 927, "end_char_pos": 927}, {"type": "R", "before": "operations for integer and floating point. BOPS is", "after": "parts of integer operations. We define BOPS as", "start_char_pos": 949, "end_char_pos": 999}, {"type": "R", "before": "(Basic OPerations) completed each second. To that end, we present a dwarf-based measuring tool to evaluate", "after": "per second, and propose replacing FLOPS with BOPS to measure", "start_char_pos": 1027, "end_char_pos": 1133}, {"type": "D", "before": "in terms of our new metrics", "after": null, "start_char_pos": 1154, "end_char_pos": 1181}, {"type": "D", "before": "also", "after": null, "start_char_pos": 1206, "end_char_pos": 1210}, {"type": "R", "before": "roofline", "after": "Roofline", "start_char_pos": 1228, "end_char_pos": 1236}, {"type": "R", "before": ". Through the experiments, we demonstrate that our new metrics--BOPS, measuring tool, and new performance modelindeed facilitate DC computer system design and optimization", "after": ", which we call DC-Roofline model, with which we optimize DC workloads with the improvement varying from 119\\% to 325\\%", "start_char_pos": 1272, "end_char_pos": 1443}], "sents_char_pos": [0, 280, 625, 735, 844, 991, 1068, 1183, 1273]} {"doc_id": "1801.09212", "revision_depth": "2", "before_revision": "The past decades witness FLOPS (Floating-point Operations per Second) as an important computation-centric performance metric. However, for datacenter (in short, DC) computing workloads, such as Internet services or big data analytics, previous work reports that they have extremely low floating point operation intensity , and the average FLOPS efficiency is only 0.1\\% , while the average IPC is 1.3 (the theoretic IPC is 4 on the Intel Xeon E5600 platform). Furthermore, we reveal that the traditional FLOPS based Roofline performance model is not suitable for modern DC workloads , and gives misleading information for system optimization . These observations imply that FLOPS is inappropriate for evaluating DC computer systems. To address the above issue, we propose a new computation-centric metric BOPs (Basic OPerations ) that measures the efficient work defined by the source code, includes floating-point operations and the arithmetic, logical, comparing , and array addressing parts of integer operations. We define BOPS as the average number of BOPs per second, and propose replacing FLOPS with BOPS to measure DC computer systems. On the basis of BOPS, we propose a new Roofline performance model for DC computing , which we call DC-Roofline model, with which we optimize DC workloads with the improvement varying from 119\\% to 325\\% .", "after_revision": "For datacenter computing workloads, previous work reports that they have extremely low floating point operation intensity . Our experiments also show that the average FLOPS efficiency of the DC workloads is only 0.1\\% . The FLOPS gap is 12X between the two systems equipped with Intel Xeon or Intel Atom processors, but the average user-perceived performance gap of the DC workloads is only 7.4X between them . These observations imply that FLOPS (Floating-point Operations per Second) is inappropriate to evaluate DC computing systems. To address the above issue, we propose BOPS (Basic OPerations per Second), which is the average number of BOPs (Basic OPerations) completed per second, as a new computation-centric metric. BOPs include the integer and floating point computations of arithmetic, logical, comparing and array addressing . The number of BOPs is independent of the underlying system and hardware implementation, and can be calculated through automatically analyzing the source code of the workload. Based on the BOPS metric, an upper bound performance model, named DC-Roofline, is proposed for DC computing . In our experiments, three typical systems equipped with different Intel processors are evaluated using 17 typical DC workloads. The bias between the BOPS gap and the average user-perceived performance gap is no more than 11\\%, and the BOPS efficiency of the Sort workload achieves 32\\%. We optimize the typical DC kernel workloads under the guidance of the DC-Roofline model, and all workloads have achieved performance improvements ranging from 1.1X to 4.4X. Furthermore, as the real DC workload always has million lines of codes and tens of thousands of functions, it is not easy to use the DC-Roofline model directly. We propose an optimization methodology for the real-world DC workloads. Under the guidance of the proposed methodology, we optimize Redis by 1.2X .", "edit_actions": [{"type": "R", "before": "The past decades witness FLOPS (Floating-point Operations per Second) as an important computation-centric performance metric. However, for datacenter (in short, DC)", "after": "For datacenter", "start_char_pos": 0, "end_char_pos": 164}, {"type": "D", "before": "such as Internet services or big data analytics,", "after": null, "start_char_pos": 186, "end_char_pos": 234}, {"type": "R", "before": ", and", "after": ". Our experiments also show that", "start_char_pos": 321, "end_char_pos": 326}, {"type": "A", "before": null, "after": "of the DC workloads", "start_char_pos": 356, "end_char_pos": 356}, {"type": "R", "before": ", while the average IPC is 1.3 (the theoretic IPC is 4 on the Intel Xeon E5600 platform). Furthermore, we reveal that the traditional FLOPS based Roofline performance model is not suitable for modern DC workloads , and gives misleading information for system optimization", "after": ". The FLOPS gap is 12X between the two systems equipped with Intel Xeon or Intel Atom processors, but the average user-perceived performance gap of the DC workloads is only 7.4X between them", "start_char_pos": 371, "end_char_pos": 642}, {"type": "R", "before": "is inappropriate for evaluating DC computer", "after": "(Floating-point Operations per Second) is inappropriate to evaluate DC computing", "start_char_pos": 681, "end_char_pos": 724}, {"type": "R", "before": "a new computation-centric metric BOPs", "after": "BOPS", "start_char_pos": 773, "end_char_pos": 810}, {"type": "R", "before": ") that measures the efficient work defined by the source code, includes floating-point operations and the", "after": "per Second), which is the average number of BOPs (Basic OPerations) completed per second, as a new computation-centric metric. BOPs include the integer and floating point computations of", "start_char_pos": 829, "end_char_pos": 934}, {"type": "D", "before": ",", "after": null, "start_char_pos": 966, "end_char_pos": 967}, {"type": "R", "before": "parts of integer operations. We define BOPS as the average", "after": ". The", "start_char_pos": 989, "end_char_pos": 1047}, {"type": "R", "before": "per second, and propose replacing FLOPS with BOPS to measure DC computer systems. On the basis of BOPS, we propose a new Roofline performance model", "after": "is independent of the underlying system and hardware implementation, and can be calculated through automatically analyzing the source code of the workload. Based on the BOPS metric, an upper bound performance model, named DC-Roofline, is proposed", "start_char_pos": 1063, "end_char_pos": 1210}, {"type": "R", "before": ", which we call", "after": ". In our experiments, three typical systems equipped with different Intel processors are evaluated using 17 typical DC workloads. The bias between the BOPS gap and the average user-perceived performance gap is no more than 11\\%, and the BOPS efficiency of the Sort workload achieves 32\\%. We optimize the typical DC kernel workloads under the guidance of the", "start_char_pos": 1228, "end_char_pos": 1243}, {"type": "R", "before": "model, with which we optimize DC workloads with the improvement varying from 119\\% to 325\\%", "after": "model, and all workloads have achieved performance improvements ranging from 1.1X to 4.4X. Furthermore, as the real DC workload always has million lines of codes and tens of thousands of functions, it is not easy to use the DC-Roofline model directly. We propose an optimization methodology for the real-world DC workloads. Under the guidance of the proposed methodology, we optimize Redis by 1.2X", "start_char_pos": 1256, "end_char_pos": 1347}], "sents_char_pos": [0, 125, 460, 644, 733, 1017, 1144]} {"doc_id": "1802.00543", "revision_depth": "1", "before_revision": "The use of multiple drugs , termed polypharmacy, is common to treat patients with complex diseases or co-existing medical conditions. However, a major consequence of polypharmacy is a much higher risk of side effects for the patient. Polypharmacy side effects emerge because of drug interactions, in which activity of one drug may change , favorably or unfavorably, if taken with another drug. The knowledge of drug interactions is limited because these complex relationships are usually not observed in small clinical testing. Discovering polypharmacy side effects thus remains a challenge with significant implications for patient mortality and morbidity. Herewe introduce Decagon, an approach for modeling polypharmacy side effects. The approach constructs a multimodal graph of protein-protein interactions, drug-protein interactions, and the polypharmacy side effects, which are represented as drug-drug interactions, where each side effect is an edge of a different type. Decagon is developed specifically to handle such multimodal graphs with a large number of edge types. Our approach develops a new graph convolutional neural network for multirelational link prediction in multimodal networks. Unlike approaches limited to predicting simple drug-drug interaction values, Decagon can predict the exact side effect, if any, through which a given drug combination manifests clinically. Decagon accurately predicts polypharmacy side effects, outperforming baselines by up to 69\\%. Furthermore, Decagon models particularly well side effects that have a strong molecular basis, while on predominantly non-molecular side effects, it achieves good performance because of effective sharing of model parameters across edge types. Decagon creates an opportunity to use large molecular and patient population data to flag and prioritize polypharmacy side effects for follow-up analysis via formal pharmacological studies .", "after_revision": "The use of drug combinations , termed polypharmacy, is common to treat patients with complex diseases and co-existing conditions. However, a major consequence of polypharmacy is a much higher risk of adverse side effects for the patient. Polypharmacy side effects emerge because of drug-drug interactions, in which activity of one drug may change if taken with another drug. The knowledge of drug interactions is limited because these complex relationships are rare, and are usually not observed in relatively small clinical testing. Discovering polypharmacy side effects thus remains an important challenge with significant implications for patient mortality . Here, we present Decagon, an approach for modeling polypharmacy side effects. The approach constructs a multimodal graph of protein-protein interactions, drug-protein target interactions, and the polypharmacy side effects, which are represented as drug-drug interactions, where each side effect is an edge of a different type. Decagon is developed specifically to handle such multimodal graphs with a large number of edge types. Our approach develops a new graph convolutional neural network for multirelational link prediction in multimodal networks. Decagon predicts the exact side effect, if any, through which a given drug combination manifests clinically. Decagon accurately predicts polypharmacy side effects, outperforming baselines by up to 69\\%. We find that it automatically learns representations of side effects indicative of co-occurrence of polypharmacy in patients. Furthermore, Decagon models particularly well side effects with a strong molecular basis, while on predominantly non-molecular side effects, it achieves good performance because of effective sharing of model parameters across edge types. Decagon creates opportunities to use large pharmacogenomic and patient data to flag and prioritize side effects for follow-up analysis .", "edit_actions": [{"type": "R", "before": "multiple drugs", "after": "drug combinations", "start_char_pos": 11, "end_char_pos": 25}, {"type": "R", "before": "or", "after": "and", "start_char_pos": 99, "end_char_pos": 101}, {"type": "D", "before": "medical", "after": null, "start_char_pos": 114, "end_char_pos": 121}, {"type": "A", "before": null, "after": "adverse", "start_char_pos": 204, "end_char_pos": 204}, {"type": "R", "before": "drug", "after": "drug-drug", "start_char_pos": 279, "end_char_pos": 283}, {"type": "D", "before": ", favorably or unfavorably,", "after": null, "start_char_pos": 339, "end_char_pos": 366}, {"type": "A", "before": null, "after": "rare, and are", "start_char_pos": 481, "end_char_pos": 481}, {"type": "A", "before": null, "after": "relatively", "start_char_pos": 506, "end_char_pos": 506}, {"type": "R", "before": "a", "after": "an important", "start_char_pos": 582, "end_char_pos": 583}, {"type": "R", "before": "and morbidity. Herewe introduce", "after": ". Here, we present", "start_char_pos": 646, "end_char_pos": 677}, {"type": "A", "before": null, "after": "target", "start_char_pos": 828, "end_char_pos": 828}, {"type": "R", "before": "Unlike approaches limited to predicting simple drug-drug interaction values, Decagon can predict", "after": "Decagon predicts", "start_char_pos": 1207, "end_char_pos": 1303}, {"type": "A", "before": null, "after": "We find that it automatically learns representations of side effects indicative of co-occurrence of polypharmacy in patients.", "start_char_pos": 1490, "end_char_pos": 1490}, {"type": "R", "before": "that have", "after": "with", "start_char_pos": 1550, "end_char_pos": 1559}, {"type": "R", "before": "an opportunity", "after": "opportunities", "start_char_pos": 1750, "end_char_pos": 1764}, {"type": "R", "before": "molecular and patient population", "after": "pharmacogenomic and patient", "start_char_pos": 1778, "end_char_pos": 1810}, {"type": "D", "before": "polypharmacy", "after": null, "start_char_pos": 1839, "end_char_pos": 1851}, {"type": "D", "before": "via formal pharmacological studies", "after": null, "start_char_pos": 1888, "end_char_pos": 1922}], "sents_char_pos": [0, 133, 234, 394, 530, 660, 738, 981, 1083, 1206, 1395, 1489, 1733]} {"doc_id": "1802.04595", "revision_depth": "2", "before_revision": "We provide an epistemic foundation for the cooperative game by proof theory by studying the knowledge needed for players to unanimously accept only core payoffs. We first transform each cooperative game into a decision problem where each player accept or reject each payoff vector . Then we use a modified KD-system in epistemic logic to describe a player's knowledge, decision-making criterion, and reasoning process; especially, we define a formula called C-acceptability to describe the criterion for accepting a core payoff vector. Within this syn- tactical framework, we characterize the core of a cooperative game in terms of each player' s knowledge. Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas , on one hand, has constant require- ment on each participator 's knowledge in the competitive market, while , on the other hand, requires unbounded epistemic ability for at least one player in the cooperative situation .", "after_revision": "We provide an epistemic foundation for cooperative games by proof theory via studying the knowledge for players unanimously accepting only core payoffs. We first transform each cooperative game into a decision problem where a player can accept or reject any payoff vector offered to her based on her knowledge about available cooperation . Then we use a modified KD-system in epistemic logic , which can be regarded as a counterpart of the model for non-cooperative games in Bonanno (2008), (2015), to describe a player's knowledge, decision-making criterion, and reasoning process; especially, a formula called C-acceptability is defined to capture the criterion for accepting a core payoff vector. Within this syntactical framework, we characterize the core of a cooperative game in terms of players' knowledge. Based on that result, we discuss an epistemic inconsistency behind Debreu-Scarf Theorem, that is, the increase of the number of replicas has invariant requirement on each participant 's knowledge from the aspect of competitive market, while requires unbounded epistemic ability players from the aspect of cooperative game .", "edit_actions": [{"type": "R", "before": "the cooperative game", "after": "cooperative games", "start_char_pos": 39, "end_char_pos": 59}, {"type": "R", "before": "by", "after": "via", "start_char_pos": 76, "end_char_pos": 78}, {"type": "R", "before": "needed for players to unanimously accept", "after": "for players unanimously accepting", "start_char_pos": 102, "end_char_pos": 142}, {"type": "R", "before": "each player", "after": "a player can", "start_char_pos": 233, "end_char_pos": 244}, {"type": "R", "before": "each payoff vector", "after": "any payoff vector offered to her based on her knowledge about available cooperation", "start_char_pos": 262, "end_char_pos": 280}, {"type": "A", "before": null, "after": ", which can be regarded as a counterpart of the model for non-cooperative games in Bonanno (2008), (2015),", "start_char_pos": 335, "end_char_pos": 335}, {"type": "D", "before": "we define", "after": null, "start_char_pos": 432, "end_char_pos": 441}, {"type": "R", "before": "to describe", "after": "is defined to capture", "start_char_pos": 475, "end_char_pos": 486}, {"type": "R", "before": "syn- tactical", "after": "syntactical", "start_char_pos": 549, "end_char_pos": 562}, {"type": "R", "before": "each player' s", "after": "players'", "start_char_pos": 633, "end_char_pos": 647}, {"type": "R", "before": ", on one hand, has constant require- ment on each participator", "after": "has invariant requirement on each participant", "start_char_pos": 796, "end_char_pos": 858}, {"type": "R", "before": "in the", "after": "from the aspect of", "start_char_pos": 872, "end_char_pos": 878}, {"type": "D", "before": ", on the other hand,", "after": null, "start_char_pos": 905, "end_char_pos": 925}, {"type": "R", "before": "for at least one player in the cooperative situation", "after": "players from the aspect of cooperative game", "start_char_pos": 963, "end_char_pos": 1015}], "sents_char_pos": [0, 161, 282, 419, 536, 658]} {"doc_id": "1802.08667", "revision_depth": "2", "before_revision": "We provide adaptive inference methods, based on l1 regularizationmethods , for regular (semi-parametric) and non-regular (nonparametric) linear functionals of the conditional expectation function. Examples of regular functionals include average treatment effects, policy effects from covariate distribution shifts and stochastic transformations, and average derivatives. Examples of non-regular functionals include the local linear functionals defined as local averages that approximate perfectly localized quantities: average treatment , average policy effects, and average derivatives , conditional on a covariate subvector fixed at a point. Our construction relies on building Neyman orthogonal equations for the target parameter that are approximately invariant to small perturbations of the nuisance parameters. To achieve this property we include the linear Riesz representer for the functionals in the equations as the additional nuisance parameter. We use l1-regularized methods to learn approximations to the regression function and the linear representer, in settings where dimension of (possibly overcomplete) dictionary of basis functions P is much larger than N. We then estimate the linear functional by the solution to the empirical analog of the orthogonal equations. Our key result is that under weak assumptions the estimator of the functional concentrates in a L/ root(n) neighborhood of the target with deviations controlled by the Gaussian law , provided L/root(n)%DIFDELCMD < \\to %%% 0; L is the operator norm of the functional , measuring the degree of its non-regularity, with L diverging for local functionals (or under weak identification of the global functionals) .", "after_revision": "We provide novel adaptive inference methods, based on \\ell_1 regularization , for regular (semi-parametric) and non-regular (nonparametric) linear functionals of the conditional expectation function. Examples of regular functionals include average treatment effects, policy effects , and derivatives. Examples of non-regular functionals include localized quantities: average treatment effects, policy effects, and derivatives conditional on a covariate subvector fixed at a point. We construct a Neyman orthogonal equation for the target parameter that is approximately invariant to small perturbations of the nuisance parameters. To achieve this property , we include the linear Riesz representer for the functional as an additional nuisance parameter. Under weak assumptions, the estimator of the functional concentrates in a L/ \\sqrt{n neighborhood of the target with deviations controlled by the Gaussian law %DIFDELCMD < \\to %%% . We require that the operator norm L of the functional is small compared to \\sqrt{n .", "edit_actions": [{"type": "A", "before": null, "after": "novel", "start_char_pos": 11, "end_char_pos": 11}, {"type": "R", "before": "l1 regularizationmethods", "after": "\\ell_1 regularization", "start_char_pos": 49, "end_char_pos": 73}, {"type": "R", "before": "from covariate distribution shifts and stochastic transformations, and average", "after": ", and", "start_char_pos": 280, "end_char_pos": 358}, {"type": "D", "before": "the local linear functionals defined as local averages that approximate perfectly", "after": null, "start_char_pos": 416, "end_char_pos": 497}, {"type": "R", "before": ", average", "after": "effects,", "start_char_pos": 538, "end_char_pos": 547}, {"type": "R", "before": "average derivatives ,", "after": "derivatives", "start_char_pos": 568, "end_char_pos": 589}, {"type": "R", "before": "Our construction relies on building Neyman orthogonal equations", "after": "We construct a Neyman orthogonal equation", "start_char_pos": 645, "end_char_pos": 708}, {"type": "R", "before": "are", "after": "is", "start_char_pos": 739, "end_char_pos": 742}, {"type": "A", "before": null, "after": ",", "start_char_pos": 843, "end_char_pos": 843}, {"type": "R", "before": "functionals in the equations as the", "after": "functional as an", "start_char_pos": 892, "end_char_pos": 927}, {"type": "R", "before": "We use l1-regularized methods to learn approximations to the regression function and the linear representer, in settings where dimension of (possibly overcomplete) dictionary of basis functions P is much larger than N. We then estimate the linear functional by the solution to the empirical analog of the orthogonal equations. Our key result is that under weak assumptions", "after": "Under weak assumptions,", "start_char_pos": 959, "end_char_pos": 1331}, {"type": "R", "before": "root(n)", "after": "\\sqrt{n", "start_char_pos": 1385, "end_char_pos": 1392}, {"type": "D", "before": ", provided L/root(n)", "after": null, "start_char_pos": 1467, "end_char_pos": 1487}, {"type": "R", "before": "0; L is", "after": ". We require that", "start_char_pos": 1508, "end_char_pos": 1515}, {"type": "A", "before": null, "after": "L", "start_char_pos": 1534, "end_char_pos": 1534}, {"type": "R", "before": ", measuring the degree of its non-regularity, with L diverging for local functionals (or under weak identification of the global functionals)", "after": "is small compared to \\sqrt{n", "start_char_pos": 1553, "end_char_pos": 1694}], "sents_char_pos": [0, 197, 371, 644, 817, 958, 1177, 1285, 1510]} {"doc_id": "1803.03571", "revision_depth": "2", "before_revision": "The occurrence of drug-drug-interactions (DDI) from multiple drug prescriptions is a serious problem, both for individuals and health-care systems, since patients with complications due to DDI are likely to re-enter the system at a costlier level. We present a large-scale longitudinal study of the DDI phenomenon at the primary- and secondary-care level using electronic health records from the city of Blumenau in Southern Brazil (pop. ~340,000). This is the first study of DDI we are aware of that follows an entire city longitudinally for 18 months. We found that 181 distinct drug pairs known to interact were dispensed concomitantly to 12\\% of the patients in the city's public health-care system. Further, 4\\% of the patients were dispensed major DDI combinations, likely to result in very serious adverse reactions and costs we estimate to be larger than previously reported . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions . Analysis reveals that women have a 60\\% increased risk of DDI as compared to men; the increase becomes 90\\% when only major DDI are considered. Furthermore, DDI risk increases substantially with age. Patients aged 70-79 years have a 34\\% risk of DDI when they are prescribed two or more drugs concomitantly. Interestingly, a null model demonstrates that age and women-specific risks from increased polypharmacy far exceed expectations in those populations. This suggests that social and biological factors are at play. Finally, we demonstrate that machine learning classifiers accurately predict patients likely to be administered DDI given their history of prescribed drugs, gender , and age (MCC=.7, AUC=.97). These results demonstrate that accurate warning systems for known DDI can be devised for health-care systems leading to substantial reduction of DDI-related adverse reactions and health-care savings .", "after_revision": "The occurrence of drug-drug-interactions (DDI) from multiple drug dispensations is a serious problem, both for individuals and health-care systems, since patients with complications due to DDI are likely to re-enter the system at a costlier level. We present a large-scale longitudinal study (18 months) of the DDI phenomenon at the primary- and secondary-care level using electronic health records (EHR) from the city of Blumenau in Southern Brazil (pop. ~340,000). This is the first study of DDI we are aware of that follows an entire city longitudinally for more than 3 months. We found that 181 distinct drug pairs known to interact were dispensed concomitantly to 12\\% of the patients in the city's public health-care system. Further, 4\\% of the patients were dispensed DDI combinations, likely to result in major adverse reactions with costs estimated to be larger than previously reported in smaller studies . DDI results are integrated into associative networks for inference and visualization, revealing key medications and interactions involved in the DDI phenomenon . Analysis reveals that women have a 60\\% increased risk of DDI as compared to men; the increase becomes 90\\% when only major DDI are considered. Furthermore, DDI risk increases substantially with age. Patients aged 70-79 years have a 34\\% risk of DDI when they are dispensed two or more drugs concomitantly. Interestingly, a null model demonstrates that age- and women-specific risks from increased polypharmacy fail by far to explain the observed risks of DDI in those populations. This suggests that social and biological factors are at play. These results demonstrate that considerable gender and age biases exist, but that accurate warning systems for known DDI can be devised for health-care systems and public-health policy management, to reduce DDI-related adverse reactions and health-care costs .", "edit_actions": [{"type": "R", "before": "prescriptions", "after": "dispensations", "start_char_pos": 66, "end_char_pos": 79}, {"type": "A", "before": null, "after": "(18 months)", "start_char_pos": 292, "end_char_pos": 292}, {"type": "A", "before": null, "after": "(EHR)", "start_char_pos": 388, "end_char_pos": 388}, {"type": "R", "before": "18", "after": "more than 3", "start_char_pos": 545, "end_char_pos": 547}, {"type": "D", "before": "major", "after": null, "start_char_pos": 750, "end_char_pos": 755}, {"type": "R", "before": "very serious adverse reactions and costs we estimate", "after": "major adverse reactions with costs estimated", "start_char_pos": 794, "end_char_pos": 846}, {"type": "A", "before": null, "after": "in smaller studies", "start_char_pos": 885, "end_char_pos": 885}, {"type": "A", "before": null, "after": "involved in the DDI phenomenon", "start_char_pos": 1017, "end_char_pos": 1017}, {"type": "R", "before": "prescribed", "after": "dispensed", "start_char_pos": 1284, "end_char_pos": 1294}, {"type": "R", "before": "age", "after": "age-", "start_char_pos": 1374, "end_char_pos": 1377}, {"type": "R", "before": "far exceed expectations", "after": "fail by far to explain the observed risks of DDI", "start_char_pos": 1431, "end_char_pos": 1454}, {"type": "R", "before": "Finally, we demonstrate that machine learning classifiers accurately predict patients likely to be administered DDI given their history of prescribed drugs, gender , and age (MCC=.7, AUC=.97). These results demonstrate", "after": "These results demonstrate that considerable gender and age biases exist, but", "start_char_pos": 1539, "end_char_pos": 1757}, {"type": "R", "before": "leading to substantial reduction of", "after": "and public-health policy management, to reduce", "start_char_pos": 1841, "end_char_pos": 1876}, {"type": "R", "before": "savings", "after": "costs", "start_char_pos": 1923, "end_char_pos": 1930}], "sents_char_pos": [0, 247, 450, 555, 705, 1101, 1163, 1219, 1327, 1476, 1538, 1731]} {"doc_id": "1803.05372", "revision_depth": "1", "before_revision": "Updating an abstract Voronoi diagram in linear time, after deletion of one site , has been an open problemfor a long time. Similarly for various concrete Voronoi diagrams of generalized sites, other than points . In this paper we present a simple, expected linear-time algorithm to update an abstract Voronoi diagram after deletion . We introduce the concept of a Voronoi-like diagram, a relaxed version of a Voronoi construct that has a structure similar to an abstract Voronoi diagram, without however being one. Voronoi-like diagrams serve as intermediate structures, which are considerably simpler to compute, thus, making an expected linear-time construction possible. We formalize the concept and prove that it is robust under an insertionoperation, thus , enabling its use in incremental constructions .", "after_revision": "Updating an abstract Voronoi diagram after deletion of one site in linear time has been a well-known open problem; similarly, for concrete Voronoi diagrams of non-point sites . In this paper , we present an expected linear-time algorithm to update an abstract Voronoi diagram after deletion of one site . We introduce the concept of a Voronoi-like diagram, a relaxed version of an abstract Voronoi construct that has a structure similar to an ordinary Voronoi diagram, without , however, being one. We formalize the concept , and prove that it is robust under insertion , therefore, enabling its use in incremental constructions . The time-complexity analysis of the resulting simple randomized incremental construction is non-standard, and interesting in its own right, because the intermediate Voronoi-like structures are order-dependent. We further extend the approach to compute the following structures in expected linear time: the order-(k+1) subdivision within an order-k Voronoi region, and the farthest abstract Voronoi diagram after the order of its regions at infinity is known .", "edit_actions": [{"type": "D", "before": "in linear time,", "after": null, "start_char_pos": 37, "end_char_pos": 52}, {"type": "R", "before": ", has been an open problemfor a long time. Similarly for various", "after": "in linear time has been a well-known open problem; similarly, for", "start_char_pos": 80, "end_char_pos": 144}, {"type": "R", "before": "generalized sites, other than points", "after": "non-point sites", "start_char_pos": 174, "end_char_pos": 210}, {"type": "R", "before": "we present a simple,", "after": ", we present an", "start_char_pos": 227, "end_char_pos": 247}, {"type": "A", "before": null, "after": "of one site", "start_char_pos": 332, "end_char_pos": 332}, {"type": "R", "before": "a", "after": "an abstract", "start_char_pos": 408, "end_char_pos": 409}, {"type": "R", "before": "abstract", "after": "ordinary", "start_char_pos": 463, "end_char_pos": 471}, {"type": "R", "before": "however", "after": ", however,", "start_char_pos": 497, "end_char_pos": 504}, {"type": "D", "before": "Voronoi-like diagrams serve as intermediate structures, which are considerably simpler to compute, thus, making an expected linear-time construction possible.", "after": null, "start_char_pos": 516, "end_char_pos": 674}, {"type": "A", "before": null, "after": ",", "start_char_pos": 700, "end_char_pos": 700}, {"type": "R", "before": "an insertionoperation, thus", "after": "insertion", "start_char_pos": 735, "end_char_pos": 762}, {"type": "A", "before": null, "after": "therefore,", "start_char_pos": 765, "end_char_pos": 765}, {"type": "A", "before": null, "after": ". The time-complexity analysis of the resulting simple randomized incremental construction is non-standard, and interesting in its own right, because the intermediate Voronoi-like structures are order-dependent. We further extend the approach to compute the following structures in expected linear time: the order-(k+1) subdivision within an order-k Voronoi region, and the farthest abstract Voronoi diagram after the order of its regions at infinity is known", "start_char_pos": 812, "end_char_pos": 812}], "sents_char_pos": [0, 122, 212, 334, 515, 674]} {"doc_id": "1803.08341", "revision_depth": "3", "before_revision": "Fast constant factor approximation algorithms are devised for an NP- and W 1%DIFDELCMD < ]%%% -hard problem of intersecting a set of n straight line segments with the smallest cardinality set of disks of fixed radii r>0, where the set of segments forms a straight line drawing G=(V,E) of a planar graph without edge crossings. Exploiting tough connection of the problem with the geometric Hitting Set problem, an \\left(50+52\\frac{12{13}}+ \\varepsilon \\right)-approximate O\\left(n^4\\log n\\right)-time and O\\left(n^2\\log n\\right)-space algorithm is given based on the modified Agarwal-Pan algorithm . More accurate (34+242+ \\varepsilon )- and \\left( 34 + 44\\sqrt{\\frac{6 + \\varepsilon \\right)-approxi\\-mate algorithms are also proposed for cases where G is any subgraph of either an outerplane graph or a Delaunay triangulation respectively, which work within the same time and space complexity bounds, where \\varepsilon >0 is an arbitrary small constant. Moreover, an O(n^2\\log n)-time and O(n^2)-space 18-approximation is designed for the case where G is any subgraph of a Gabriel graph. To the best of our knowledge, related work only tackles the case where E consists of axis-parallel segments, resulting in an O(n\\log n)-time and O(n\\log n)-space 8-approximation .", "after_revision": " %DIFDELCMD < ]%%% An NP-hard problem is considered of intersecting a given set of n straight line segments on the plane with the smallest cardinality set of disks of fixed radii r>0, where the set of segments forms a straight line drawing G=(V,E) of a planar graph without proper edge crossings. To the best of our knowledge, related work only tackles a setting where E consists of (generally, properly overlapping) axis-parallel segments, resulting in an O(n\\log n)-time and O(n\\log n)-space 8-approximation algorithm. Exploiting tough connection of the problem with the geometric Hitting Set problem, an \\left(50+52\\frac{12{13}}+ \\nu \\right)-approximate O\\left(n^4\\log n\\right)-time and O\\left(n^2\\log n\\right)-space algorithm is devised based on the modified Agarwal-Pan algorithm , which uses epsilon nets . More accurate (34+242+ \\nu )- and \\left( \\frac{144 + 32\\sqrt{\\frac{3 + \\nu \\right)-approxi\\-mate algorithms are also proposed for cases where G is any subgraph of either a generalized outerplane graph or a Delaunay triangulation respectively, which work within the same time and space complexity bounds, where \\nu >0 is an arbitrarily small constant .", "edit_actions": [{"type": "D", "before": "Fast constant factor approximation algorithms are devised for an NP- and W", "after": null, "start_char_pos": 0, "end_char_pos": 74}, {"type": "D", "before": "1", "after": null, "start_char_pos": 75, "end_char_pos": 76}, {"type": "R", "before": "-hard problem", "after": "An NP-hard problem is considered", "start_char_pos": 94, "end_char_pos": 107}, {"type": "A", "before": null, "after": "given", "start_char_pos": 126, "end_char_pos": 126}, {"type": "A", "before": null, "after": "on the plane", "start_char_pos": 159, "end_char_pos": 159}, {"type": "A", "before": null, "after": "proper", "start_char_pos": 313, "end_char_pos": 313}, {"type": "A", "before": null, "after": "To the best of our knowledge, related work only tackles a setting where E consists of (generally, properly overlapping) axis-parallel segments, resulting in an O(n\\log n)-time and O(n\\log n)-space 8-approximation algorithm.", "start_char_pos": 330, "end_char_pos": 330}, {"type": "R", "before": "\\varepsilon", "after": "\\nu", "start_char_pos": 443, "end_char_pos": 454}, {"type": "R", "before": "given", "after": "devised", "start_char_pos": 551, "end_char_pos": 556}, {"type": "A", "before": null, "after": ", which uses epsilon nets", "start_char_pos": 601, "end_char_pos": 601}, {"type": "R", "before": "\\varepsilon", "after": "\\nu", "start_char_pos": 627, "end_char_pos": 638}, {"type": "R", "before": "34", "after": "\\frac{144", "start_char_pos": 653, "end_char_pos": 655}, {"type": "R", "before": "44\\sqrt{\\frac{6", "after": "32\\sqrt{\\frac{3", "start_char_pos": 658, "end_char_pos": 673}, {"type": "R", "before": "\\varepsilon", "after": "\\nu", "start_char_pos": 676, "end_char_pos": 687}, {"type": "R", "before": "an", "after": "a generalized", "start_char_pos": 783, "end_char_pos": 785}, {"type": "R", "before": "\\varepsilon", "after": "\\nu", "start_char_pos": 912, "end_char_pos": 923}, {"type": "R", "before": "arbitrary small constant. Moreover, an O(n^2\\log n)-time and O(n^2)-space 18-approximation is designed for the case where G is any subgraph of a Gabriel graph. To the best of our knowledge, related work only tackles the case where E consists of axis-parallel segments, resulting in an O(n\\log n)-time and O(n\\log n)-space 8-approximation", "after": "arbitrarily small constant", "start_char_pos": 933, "end_char_pos": 1270}], "sents_char_pos": [0, 329, 603, 958, 1092]} {"doc_id": "1804.00049", "revision_depth": "2", "before_revision": "A sequence of pathological changes takes place in Alzheimer's disease , which can be assessed in vivo using various brain imaging methods . Currently, there is no appropriate statistical model available that can easily integrate multiple imaging modalities , being able to utilize the additional information provided from the combined data . We applied Gaussian graphical models (GGMs) for analyzing the conditional dependency networks of multimodal neuroimaging dataand assessed alterations of the network structure in mild cognitive impairment (MCI) and Alzheimer's dementia (AD) compared to cognitively healthy controls. Data from N= 667 subjects were obtained from the Alzheimer's Disease Neuroimaging Initiative. Mean amyloid load (AV45-PET), glucose metabolism (FDG-PET), and gray matter volume (MRI) was calculatedfor each brain region. Separate GGMs were estimated using a Bayesian framework for the combined multimodal data for each diagnostic category. Graph-theoretical statistics were calculated to determine network alterations associated with disease severity. Network measures clustering coefficient, path length and small-world coefficient were significantly altered across diagnostic groups, with a biphasic u-shape trajectory , i. e. increased small-world coefficient in early MCI , intermediate values in late MCI, and decreased values in ADpatients compared to controls. In contrast, no group differences were found for clustering coefficient and small-world coefficient when estimating conditional dependency networkson single imaging modalities. GGMs provide a useful methodology to analyze the conditional dependency networks of multimodal neuroimaging data .", "after_revision": " Alzheimer's disease (AD) is characterized by a sequence of pathological changes, which are commonly assessed in vivo using MRI and PET . Currently, the most approaches to analyze statistical associations between brain regions rely on Pearson correlation. However, these are prone to spurious correlations arising from uninformative shared variance. Notably, there are no appropriate multivariate statistical models available that can easily integrate dozens of variables derived from such data , being able to use the additional information provided from the combination of data sources. Gaussian graphical models (GGMs) can estimate the conditional dependency from given data, which is expected to reflect the underlying causal relationships. We applied GGMs to assess multimodal regional brain alterations in AD. We obtained data from N= 972 subjects from the Alzheimer's Disease Neuroimaging Initiative. The mean amyloid load (AV45-PET), glucose metabolism (FDG-PET), and gray matter volume (MRI) were calculated. GGMs were estimated using a Bayesian framework for the combined multimodal data to obtain conditional dependency networks. Conditional dependency matrices were much sparser (10\\% density) than Pearson correlation matrices (50\\% density). Within modalities, conditional dependency networks yielded clusters connecting anatomically adjacent regions. For associations between different modalities, only few region-specific connections remained. Graph-theoretical network statistics were significantly altered between groups, with a biphasic u-shape trajectory . GGMs removed shared variance among multimodal measures of regional brain alterations in MCI and AD, and yielded sparser matrices compared to Pearson correlation networks. Therefore, GGMs may be used as alternative to thresholding-approaches typically applied to correlation networks to obtain the most informative relations between variables .", "edit_actions": [{"type": "D", "before": "A sequence of pathological changes takes place in", "after": null, "start_char_pos": 0, "end_char_pos": 49}, {"type": "R", "before": ", which can be", "after": "(AD) is characterized by a sequence of pathological changes, which are commonly", "start_char_pos": 70, "end_char_pos": 84}, {"type": "R", "before": "various brain imaging methods", "after": "MRI and PET", "start_char_pos": 108, "end_char_pos": 137}, {"type": "R", "before": "there is no appropriate statistical model", "after": "the most approaches to analyze statistical associations between brain regions rely on Pearson correlation. However, these are prone to spurious correlations arising from uninformative shared variance. Notably, there are no appropriate multivariate statistical models", "start_char_pos": 151, "end_char_pos": 192}, {"type": "R", "before": "multiple imaging modalities", "after": "dozens of variables derived from such data", "start_char_pos": 229, "end_char_pos": 256}, {"type": "R", "before": "utilize", "after": "use", "start_char_pos": 273, "end_char_pos": 280}, {"type": "R", "before": "combined data . We applied", "after": "combination of data sources.", "start_char_pos": 326, "end_char_pos": 352}, {"type": "R", "before": "for analyzing", "after": "can estimate", "start_char_pos": 386, "end_char_pos": 399}, {"type": "R", "before": "networks of multimodal neuroimaging dataand assessed alterations of the network structure in mild cognitive impairment (MCI) and Alzheimer's dementia (AD) compared to cognitively healthy controls. Data", "after": "from given data, which is expected to reflect the underlying causal relationships. We applied GGMs to assess multimodal regional brain alterations in AD. We obtained data", "start_char_pos": 427, "end_char_pos": 628}, {"type": "R", "before": "667 subjects were obtained", "after": "972 subjects", "start_char_pos": 637, "end_char_pos": 663}, {"type": "R", "before": "Mean", "after": "The mean", "start_char_pos": 718, "end_char_pos": 722}, {"type": "R", "before": "was calculatedfor each brain region. Separate", "after": "were calculated.", "start_char_pos": 807, "end_char_pos": 852}, {"type": "R", "before": "for each diagnostic category.", "after": "to obtain conditional dependency networks. Conditional dependency matrices were much sparser (10\\% density) than Pearson correlation matrices (50\\% density). Within modalities, conditional dependency networks yielded clusters connecting anatomically adjacent regions. For associations between different modalities, only few region-specific connections remained.", "start_char_pos": 933, "end_char_pos": 962}, {"type": "R", "before": "statistics were calculated to determine network alterations associated with disease severity. Network measures clustering coefficient, path length and small-world coefficient", "after": "network statistics", "start_char_pos": 981, "end_char_pos": 1155}, {"type": "R", "before": "across diagnostic", "after": "between", "start_char_pos": 1183, "end_char_pos": 1200}, {"type": "R", "before": ", i. e. increased small-world coefficient in early MCI , intermediate values in late MCI, and decreased values in ADpatients compared to controls. In contrast, no group differences were found for clustering coefficient and small-world coefficient when estimating conditional dependency networkson single imaging modalities. GGMs provide a useful methodology to analyze the conditional dependency networks of multimodal neuroimaging data", "after": ". GGMs removed shared variance among multimodal measures of regional brain alterations in MCI and AD, and yielded sparser matrices compared to Pearson correlation networks. Therefore, GGMs may be used as alternative to thresholding-approaches typically applied to correlation networks to obtain the most informative relations between variables", "start_char_pos": 1244, "end_char_pos": 1680}], "sents_char_pos": [0, 341, 623, 717, 843, 962, 1074, 1390, 1567]} {"doc_id": "1804.01614", "revision_depth": "1", "before_revision": "The pigeonhole principle states that if n items are contained in m boxes, then at least one box has no fewer than n/m items. It is utilized to solve many data management problems, especially for thresholded similarity searches. Despite many pigeonhole principle-based solutions proposed in the last few decades, the condition stated by the principle is weak. It only constrains the number of items in a single box. URLanizing the boxes in a ring, we observe that the number of items in multiple boxes are also constrained. We propose a new principle called the pigeonring principle which formally captures such constraints and yields stronger conditions. To utilize the pigeonring principle, we focus on problems defined in the form of identifying data objects whose similarities or distances to the query is constrained by a threshold. Many solutions to these problems utilize the pigeonhole principle to find candidates that satisfy a filtering condition. By the pigeonring principle, stronger filtering conditions can be established. We show that the pigeonhole principle is a special case of the pigeonring principle. This suggests that all the solutions based on the pigeonhole principle are possible to be accelerated by the pigeonring principle. A universal filtering framework is introduced to encompass the solutions to these problems based on the pigeonring principle. Besides, we discuss how to quickly find candidates specified by the pigeonring principlewith minor modifications on top of existing algorithms. Experimental results on real datasets demonstrate the applicability of the pigeonring principle as well as the superior performance of the algorithms based on the principle.", "after_revision": "The pigeonhole principle states that if n items are contained in m boxes, then at least one box has no more than n/m items. It is utilized to solve many data management problems, especially for thresholded similarity searches. Despite many pigeonhole principle-based solutions proposed in the last few decades, the condition stated by the principle is weak. It only constrains the number of items in a single box. URLanizing the boxes in a ring, we propose a new principle , called the pigeonring principle , which constrains the number of items in multiple boxes and yields stronger conditions. To utilize the new principle, we focus on problems defined in the form of identifying data objects whose similarities or distances to the query is constrained by a threshold. Many solutions to these problems utilize the pigeonhole principle to find candidates that satisfy a filtering condition. By the new principle, stronger filtering conditions can be established. We show that the pigeonhole principle is a special case of the new principle. This suggests that all the pigeonhole principle-based solutions are possible to be accelerated by the new principle. A universal filtering framework is introduced to encompass the solutions to these problems based on the new principle. Besides, we discuss how to quickly find candidates specified by the new principle. The implementation requires only minor modifications on top of existing pigeonhole principle-based algorithms. Experimental results on real datasets demonstrate the applicability of the new principle as well as the superior performance of the algorithms based on the new principle.", "edit_actions": [{"type": "R", "before": "fewer", "after": "more", "start_char_pos": 103, "end_char_pos": 108}, {"type": "D", "before": "observe that the number of items in multiple boxes are also constrained. We", "after": null, "start_char_pos": 450, "end_char_pos": 525}, {"type": "A", "before": null, "after": ",", "start_char_pos": 550, "end_char_pos": 550}, {"type": "R", "before": "which formally captures such constraints", "after": ", which constrains the number of items in multiple boxes", "start_char_pos": 583, "end_char_pos": 623}, {"type": "R", "before": "pigeonring", "after": "new", "start_char_pos": 671, "end_char_pos": 681}, {"type": "R", "before": "pigeonring", "after": "new", "start_char_pos": 966, "end_char_pos": 976}, {"type": "R", "before": "pigeonring", "after": "new", "start_char_pos": 1101, "end_char_pos": 1111}, {"type": "R", "before": "solutions based on the pigeonhole principle", "after": "pigeonhole principle-based solutions", "start_char_pos": 1150, "end_char_pos": 1193}, {"type": "R", "before": "pigeonring", "after": "new", "start_char_pos": 1232, "end_char_pos": 1242}, {"type": "R", "before": "pigeonring", "after": "new", "start_char_pos": 1358, "end_char_pos": 1368}, {"type": "R", "before": "pigeonring principlewith", "after": "new principle. The implementation requires only", "start_char_pos": 1448, "end_char_pos": 1472}, {"type": "A", "before": null, "after": "pigeonhole principle-based", "start_char_pos": 1512, "end_char_pos": 1512}, {"type": "R", "before": "pigeonring", "after": "new", "start_char_pos": 1600, "end_char_pos": 1610}, {"type": "A", "before": null, "after": "new", "start_char_pos": 1688, "end_char_pos": 1688}], "sents_char_pos": [0, 124, 227, 358, 414, 522, 655, 837, 958, 1037, 1122, 1253, 1379, 1524]} {"doc_id": "1804.10264", "revision_depth": "1", "before_revision": "Stock networks constitute a well established tool for characterization of complex behavior in stock markets. The networks are constructed from time series of stock prices. Since Mantegnaseminal paper the linear Pearson's correlation coefficient between pairs of stocks is used to determine network edges. Recently, possible effects of nonlinearity on graph characteristics have been demonstrated when using nonlinear measures such as mutual information instead of linear correlation. In this paper, we quantitatively characterize the nonlinearity in stock time series and the effect it has on stock network properties. It is achieved by a systematic multi-step approach , that allows 1. to quantify the nonlinearity of coupling , 2. to correct its effects wherever it is caused by simple univariate non-Gaussianity , 3. to potentially localize in space and time any remaining strong sources of this nonlinearity , andfinally, 4. to study the effect the nonlinearity has on global network properties. By applying the presented approach to stocks included in three prominent indices (NYSE100, FTSE100 and SP500), we document that most of the apparent nonlinearity is due to univariate non-Gaussianity. Further , strong nonstationarity in a few specific stocks may play a role. In particular, the sharp decrease of some stocks during the global finance crisis in 2008 gives rise to apparent nonlinear dependences among stocks.", "after_revision": "Stock networks , constructed from stock price time series, are a well-established tool for the characterization of complex behavior in stock markets. Following Mantegna's seminal paper, the linear Pearson's correlation coefficient between pairs of stocks has been the usual way to determine network edges. Recently, possible effects of nonlinearity on the graph-theoretical properties of such networks have been demonstrated when using nonlinear measures such as mutual information instead of linear correlation. In this paper, we quantitatively characterize the nonlinearity in stock time series and the effect it has on stock network properties. This is achieved by a systematic multi-step approach that allows us to quantify the nonlinearity of coupling ; correct its effects wherever it is caused by simple univariate non-Gaussianity ; potentially localize in space and time any remaining strong sources of this nonlinearity ; and, finally, study the effect nonlinearity has on global network properties. By applying this multi-step approach to stocks included in three prominent indices (NYSE100, FTSE100 and SP500), we establish that the apparent nonlinearity that has been observed is largely due to univariate non-Gaussianity. Furthermore , strong nonstationarity in a few specific stocks may play a role. In particular, the sharp decrease in some stocks during the global financial crisis of 2008 gives rise to apparent nonlinear dependencies among stocks.", "edit_actions": [{"type": "R", "before": "constitute a well established tool for", "after": ", constructed from stock price time series, are a well-established tool for the", "start_char_pos": 15, "end_char_pos": 53}, {"type": "R", "before": "The networks are constructed from time series of stock prices. Since Mantegnaseminal paper", "after": "Following Mantegna's seminal paper,", "start_char_pos": 109, "end_char_pos": 199}, {"type": "R", "before": "is used", "after": "has been the usual way", "start_char_pos": 269, "end_char_pos": 276}, {"type": "R", "before": "graph characteristics", "after": "the graph-theoretical properties of such networks", "start_char_pos": 351, "end_char_pos": 372}, {"type": "R", "before": "It", "after": "This", "start_char_pos": 619, "end_char_pos": 621}, {"type": "R", "before": ", that allows 1.", "after": "that allows us", "start_char_pos": 670, "end_char_pos": 686}, {"type": "R", "before": ", 2. to", "after": ";", "start_char_pos": 728, "end_char_pos": 735}, {"type": "R", "before": ", 3. to", "after": ";", "start_char_pos": 815, "end_char_pos": 822}, {"type": "R", "before": ", andfinally, 4. to", "after": "; and, finally,", "start_char_pos": 912, "end_char_pos": 931}, {"type": "D", "before": "the", "after": null, "start_char_pos": 949, "end_char_pos": 952}, {"type": "R", "before": "the presented", "after": "this multi-step", "start_char_pos": 1012, "end_char_pos": 1025}, {"type": "R", "before": "document that most of", "after": "establish that", "start_char_pos": 1114, "end_char_pos": 1135}, {"type": "R", "before": "is", "after": "that has been observed is largely", "start_char_pos": 1162, "end_char_pos": 1164}, {"type": "R", "before": "Further", "after": "Furthermore", "start_char_pos": 1200, "end_char_pos": 1207}, {"type": "R", "before": "of", "after": "in", "start_char_pos": 1309, "end_char_pos": 1311}, {"type": "R", "before": "finance crisis in", "after": "financial crisis of", "start_char_pos": 1342, "end_char_pos": 1359}, {"type": "R", "before": "dependences", "after": "dependencies", "start_char_pos": 1398, "end_char_pos": 1409}], "sents_char_pos": [0, 108, 171, 304, 483, 618, 999, 1199, 1274]} {"doc_id": "1805.01547", "revision_depth": "1", "before_revision": "The Euclidean k-center problem is a classical problem that has been extensively studied in many areas of computer science. Given a set G of n points in Euclidean space, the problem is to determine a set C of k centers (not necessarily part of G) such that the maximum distance between a point in G and its nearest neighbor in C is minimized. In this paper we study the corresponding (k,\\ell)-center problem for polygonal curves under the Fr\\'echet distance, that is, given a set G of n polygonal curves in R^d, each of complexity m, determine a set C of k polygonal curves in R^d, each of complexity \\ell, such that the maximum Fr\\'echet distance of a curve in G to its closest curve in C is minimized. We show that there is no polynomial-time (\\frac{3{2}-\\varepsilon)-approximation algorithm for any \\varepsilon~>~0 } unless \\mathsf{P}=\\mathsf{NP}. This bound even holds for one-dimensional curves under the continuous Fr\\'echet distance , and is further improved to (3\\sin(\\frac{\\pi{3})-\\varepsilon) if the curves may lie in the plane and if the } discrete Fr\\'echet distance is used. These hardness results hold even when k=1, -hardness extends to the case that \\ell=\\infty, } i.e., for the minimum-enclosing ball version of the problem. At the same time, we prove that a careful adaptation of Gonzalez' algorithm in combination with a curve simplification yields a 3-approximation in any dimension, provided that an optimal simplification can be computed exactly. We give a comprehensive analysis of this approximation scheme in spaces of arbitrary dimension and for both the discrete and continuous Fr\\'echet distances. Overall, our results significantly extend and improve the known approximation bounds for the (k,\\ell)-center clustering problem .", "after_revision": "The Euclidean k-center problem is a classical problem that has been extensively studied in computer science. Given a set G of n points in Euclidean space, the problem is to determine a set C of k centers (not necessarily part of G) such that the maximum distance between a point in G and its nearest neighbor in C is minimized. In this paper we study the corresponding (k,\\ell)-center problem for polygonal curves under the Fr\\'echet distance, that is, given a set G of n polygonal curves in R^d, each of complexity m, determine a set C of k polygonal curves in R^d, each of complexity \\ell, such that the maximum Fr\\'echet distance of a curve in G to its closest curve in C is minimized. In this paper, we substantially extend and improve the known approximation bounds for curves in dimension 2 and higher. We show that , if \\ell is part of the input, then there is no polynomial-time {2}-\\varepsilon)-approximation algorithm for any \\varepsilon~>~0 } approximation scheme unless \\mathsf{P}=\\mathsf{NP}. Our constructions yield different bounds for one and two-dimensional curves and the discrete and continuous Fr\\'echet distance {3})-\\varepsilon) if the curves may lie in the plane and if the } . In the case of the discrete Fr\\'echet distance on two-dimensional curves, we show hardness of approximation within a factor close to 2.598. This result also holds when k=1, and the \\mathsf{NP-hardness extends to the case that \\ell=\\infty, } i.e., for the problem of computing the minimum-enclosing ball under the Fr\\'echet distance. Finally, we observe that a careful adaptation of Gonzalez' algorithm in combination with a curve simplification yields a 3-approximation in any dimension, provided that an optimal simplification can be computed exactly. We conclude that our approximation bounds are close to being tight .", "edit_actions": [{"type": "D", "before": "many areas of", "after": null, "start_char_pos": 91, "end_char_pos": 104}, {"type": "A", "before": null, "after": "In this paper, we substantially extend and improve the known approximation bounds for curves in dimension 2 and higher.", "start_char_pos": 703, "end_char_pos": 703}, {"type": "A", "before": null, "after": ", if \\ell is part of the input, then", "start_char_pos": 717, "end_char_pos": 717}, {"type": "D", "before": "(\\frac{3", "after": null, "start_char_pos": 746, "end_char_pos": 754}, {"type": "A", "before": null, "after": "approximation scheme", "start_char_pos": 821, "end_char_pos": 821}, {"type": "R", "before": "This bound even holds for one-dimensional curves under the", "after": "Our constructions yield different bounds for one and two-dimensional curves and the discrete and", "start_char_pos": 853, "end_char_pos": 911}, {"type": "D", "before": ", and is further improved to (3\\sin(\\frac{\\pi", "after": null, "start_char_pos": 942, "end_char_pos": 987}, {"type": "A", "before": null, "after": ". In the case of the", "start_char_pos": 1053, "end_char_pos": 1053}, {"type": "R", "before": "is used. These hardness results hold even", "after": "on two-dimensional curves, we show hardness of approximation within a factor close to 2.598. This result also holds", "start_char_pos": 1082, "end_char_pos": 1123}, {"type": "A", "before": null, "after": "and the \\mathsf{NP", "start_char_pos": 1134, "end_char_pos": 1134}, {"type": "A", "before": null, "after": "problem of computing the", "start_char_pos": 1198, "end_char_pos": 1198}, {"type": "R", "before": "version of the problem. At the same time, we prove", "after": "under the Fr\\'echet distance. Finally, we observe", "start_char_pos": 1222, "end_char_pos": 1272}, {"type": "R", "before": "give a comprehensive analysis of this approximation scheme in spaces of arbitrary dimension and for both the discrete and continuous Fr\\'echet distances. Overall, our results significantly extend and improve the known approximation bounds for the (k,\\ell)-center clustering problem", "after": "conclude that our approximation bounds are close to being tight", "start_char_pos": 1476, "end_char_pos": 1757}], "sents_char_pos": [0, 122, 341, 702, 852, 1090, 1245, 1472, 1629]} {"doc_id": "1805.07512", "revision_depth": "1", "before_revision": "Data is scaling exponentially in fields ranging from genomics to neuroscience to economics. A central question is whether modern machine learning methods can be applied to construct predictive models based on large data sets drawn from complex, natural systems like cells and brains . In machine learning, the predictive power or generalizability of a model is determined by the statistics of training data . In this paper, we ask how predictive inference is impacted when training data is generated by the statistical behavior of a physical system . We develop an information-theoretic analysis of a canonical problem , spin network inference. Our analysis reveals the essential role that thermal fluctuations play in determining the efficiency of predictive inference. Thermal noise drives a system to explore a range of configurations providing `raw' information for a learning algorithm to construct a predictive model. Conversely, thermal energy degrades information by blurring energetic differences between network states . In general, spin networks have an intrinsic optimal temperature at which inference becomes maximally efficient. Simple active learning protocols allow optimization of network temperature , without prior knowledge, to dramatically increase the efficiency of inference . Our results reveal a fundamental link between physics and information and show how the physical environment can be tuned to optimize the efficiency of machine learning.", "after_revision": "Data is scaling exponentially in fields ranging from genomics to neuroscience to economics. A central question is : can modern machine learning methods be applied to construct predictive models of natural systems like cells and brains based on large data sets? In this paper, we examine how inference is impacted when training data is generated by the statistical behavior of a physical system , and hence outside direct control by the experimentalist . We develop an information-theoretic analysis for the canonical problem of spin-network inference. Our analysis reveals the essential role that the physical properties of the spin network and its environment play in determining the difficulty of the underlying machine learning problem. Specifically, stochastic fluctuations drive a system to explore a range of configurations providing `raw' information for a learning algorithm to construct an accurate model; yet they also blur energetic differences between network states and thereby degrade information. This competition leads spin networks to generically have an intrinsic optimal temperature at which stochastic spin fluctuations provide maximal information for discriminating among competing models, maximizing inference efficiency. We demonstrate a simple active learning protocol that optimizes network temperature to boost inference efficiency and dramatically increases the efficiency of inference on a neural circuit reconstruction task . Our results reveal a fundamental link between physics and information and show how the physical environment can be tuned to optimize the efficiency of machine learning.", "edit_actions": [{"type": "R", "before": "whether", "after": ": can", "start_char_pos": 114, "end_char_pos": 121}, {"type": "D", "before": "can", "after": null, "start_char_pos": 154, "end_char_pos": 157}, {"type": "R", "before": "based on large data sets drawn from complex,", "after": "of", "start_char_pos": 200, "end_char_pos": 244}, {"type": "R", "before": ". In machine learning, the predictive power or generalizability of a model is determined by the statistics of training data .", "after": "based on large data sets?", "start_char_pos": 283, "end_char_pos": 408}, {"type": "R", "before": "ask how predictive", "after": "examine how", "start_char_pos": 427, "end_char_pos": 445}, {"type": "A", "before": null, "after": ", and hence outside direct control by the experimentalist", "start_char_pos": 549, "end_char_pos": 549}, {"type": "R", "before": "of a canonical problem , spin network", "after": "for the canonical problem of spin-network", "start_char_pos": 597, "end_char_pos": 634}, {"type": "R", "before": "thermal fluctuations", "after": "the physical properties of the spin network and its environment", "start_char_pos": 691, "end_char_pos": 711}, {"type": "R", "before": "efficiency of predictive inference. Thermal noise drives", "after": "difficulty of the underlying machine learning problem. Specifically, stochastic fluctuations drive", "start_char_pos": 736, "end_char_pos": 792}, {"type": "R", "before": "a predictive model. Conversely, thermal energy degrades information by blurring", "after": "an accurate model; yet they also blur", "start_char_pos": 905, "end_char_pos": 984}, {"type": "R", "before": ". In general, spin networks", "after": "and thereby degrade information. This competition leads spin networks to generically", "start_char_pos": 1030, "end_char_pos": 1057}, {"type": "R", "before": "inference becomes maximally efficient. Simple active learning protocols allow optimization of network temperature , without prior knowledge, to dramatically increase", "after": "stochastic spin fluctuations provide maximal information for discriminating among competing models, maximizing inference efficiency. We demonstrate a simple active learning protocol that optimizes network temperature to boost inference efficiency and dramatically increases", "start_char_pos": 1105, "end_char_pos": 1270}, {"type": "A", "before": null, "after": "on a neural circuit reconstruction task", "start_char_pos": 1299, "end_char_pos": 1299}], "sents_char_pos": [0, 91, 284, 408, 551, 645, 771, 924, 1031, 1143, 1301]} {"doc_id": "1805.11553", "revision_depth": "1", "before_revision": "The sociality of cattle facilitates the maintenance of herd cohesion and synchronisation, making these species the ideal choice for domestication as livestock for humans. However, livestock populations are not self-regulated, and farmers transfer individuals across different groups throughout their lives for reasons such as genetic mixing, reproduction and pastureland management. Individuals consequently have to adapt to different group compositions during their lives , compared to their wild counterparts choosing their own herd mates . These changes may lead to social instability and stress, entailing potentially negative effects on animal welfare. In this study, we assess the how the transfers of Highland cattle (Bos taurus) impact individual and group social network measures. We studied four groups with nine different compositions and 18 individual transfers to study 1. ) the effect of group composition on individual social centralities and 2. ) the effect of group composition changes on these centralities. As shown in previous studies , dyadic associations are stronger between individuals with identical age and dominance rank. Our study showed that dyadic spatial relationships are stable relatively stable between changes in group composition or enclosure but this depends on identities more than the quantity of transferred individuals . Older cattle have higher network centralities than other individuals. The centrality of individuals is also affected by their sex and the number of familiar individuals in the group. When individuals are transferred to a group with few (one or two) or no familiar individuals, their social centralities are substantially impacted. This study reveals the necessity of understanding the social structure of a group to predict social instability through the transfer of individuals between groups .", "after_revision": "The sociality of cattle facilitates the maintenance of herd cohesion and synchronisation, making these species the ideal choice for domestication as livestock for humans. However, livestock populations are not self-regulated, and farmers transfer individuals across different groups throughout their lives for reasons such as genetic mixing, reproduction and pastureland management. Individuals consequently have to adapt to different group compositions during their lives rather than choose their own herd mates , as they would do in the wild . These changes may lead to social instability and stress, entailing potentially negative effects on animal welfare. In this study, we assess how the transfer of Highland cattle (Bos taurus) impacts individual and group social network measures. Four groups with nine different compositions and 18 individual transfers were studied to evaluate 1 ) the effect of group composition on individual social centralities and 2 ) the effect of group composition changes on these centralities. As shown in previous works , dyadic associations are stronger between individuals with similar age and dominance rank. This study reveals that the relative stability of dyadic spatial relationships between changes in group composition or enclosure is due to the identities of transferred individuals more than the quantity of individuals that are transferred . Older cattle had higher network centralities than other individuals. The centrality of individuals was also affected by their sex and the number of familiar individuals in the group. This study reveals the necessity of understanding the social structure of a group to predict social instability following the transfer of individuals between groups . The developing of guidelines for the modification of group composition could improve livestock management and reduce stress for the animals concerned .", "edit_actions": [{"type": "R", "before": ", compared to their wild counterparts choosing their", "after": "rather than choose their", "start_char_pos": 473, "end_char_pos": 525}, {"type": "A", "before": null, "after": ", as they would do in the wild", "start_char_pos": 541, "end_char_pos": 541}, {"type": "R", "before": "the how the transfers", "after": "how the transfer", "start_char_pos": 684, "end_char_pos": 705}, {"type": "R", "before": "impact", "after": "impacts", "start_char_pos": 738, "end_char_pos": 744}, {"type": "R", "before": "We studied four", "after": "Four", "start_char_pos": 791, "end_char_pos": 806}, {"type": "R", "before": "to study 1.", "after": "were studied to evaluate 1", "start_char_pos": 875, "end_char_pos": 886}, {"type": "R", "before": "2.", "after": "2", "start_char_pos": 959, "end_char_pos": 961}, {"type": "R", "before": "studies", "after": "works", "start_char_pos": 1048, "end_char_pos": 1055}, {"type": "R", "before": "identical", "after": "similar", "start_char_pos": 1116, "end_char_pos": 1125}, {"type": "R", "before": "Our study showed that", "after": "This study reveals that the relative stability of", "start_char_pos": 1150, "end_char_pos": 1171}, {"type": "D", "before": "are stable relatively stable", "after": null, "start_char_pos": 1201, "end_char_pos": 1229}, {"type": "R", "before": "but this depends on identities", "after": "is due to the identities of transferred individuals", "start_char_pos": 1280, "end_char_pos": 1310}, {"type": "R", "before": "transferred individuals", "after": "individuals that are transferred", "start_char_pos": 1337, "end_char_pos": 1360}, {"type": "R", "before": "have", "after": "had", "start_char_pos": 1376, "end_char_pos": 1380}, {"type": "R", "before": "is", "after": "was", "start_char_pos": 1463, "end_char_pos": 1465}, {"type": "D", "before": "When individuals are transferred to a group with few (one or two) or no familiar individuals, their social centralities are substantially impacted.", "after": null, "start_char_pos": 1546, "end_char_pos": 1693}, {"type": "R", "before": "through", "after": "following", "start_char_pos": 1806, "end_char_pos": 1813}, {"type": "A", "before": null, "after": ". The developing of guidelines for the modification of group composition could improve livestock management and reduce stress for the animals concerned", "start_char_pos": 1857, "end_char_pos": 1857}], "sents_char_pos": [0, 170, 382, 543, 658, 790, 1026, 1149, 1362, 1432, 1545, 1693]} {"doc_id": "1806.01778", "revision_depth": "1", "before_revision": "How stable and general is behavior once reached maximum learning? To answer this question and understand post-acquisition behavior and its related individual differences, we explore analytic models of Pavlovian conditioning extending the basic associative model of Hull (i.e., the Rescorla-Wagner model with just one cue) and propose three new models valid for individual data, which we argue to be quite natural. The first two are descriptive settings: ( i) a framework of dynamical models inspired by the classical mechanics of a particle in a given potential, which comprises Hull model and also a specific model encoding resistance to learning in the first few sessions followed by an over-optimal response peak ; (ii) the most direct stochastic extension of Hull model, characterized by the presence of stochastic noise; (iii) a theory where response fluctuations are described by quantum mechanics and based on the general framework of dynamical models (i) explaining the noise met in (ii) and giving characteristic predictions . We ran an unusually long experiment with 32 rats over 3960 trials, where we excluded habituation and other well-known phenomena as sources of variability in the subjects' performance. The best nonlinear regression to averaged data and 60\\% of individual data is Hull's model, while for the remaining 40\\% of the subjects the dynamical model (i) provides a better fit . The noise encountered in all individual responses is white, thus confirming the simplest version of model ( ii ) but standing in contrast with the colored-noise findings in human performance. Finally, data are compatible with theory (iii ), although experimental uncertainties dominate the result. On the other hand, data do not favor models with a long-memory effect or where response variability is solely described by a random fractal.", "after_revision": "How stable and general is behavior once reached maximum learning? To answer this question and understand post-acquisition behavior and its related individual differences, we propose a psychological principle that naturally extends the basic associative single-cue Rescorla-Wagner model ( which may also be called Hull model) of Pavlovian conditioning to ( i) a framework of dynamical models predicting resistance to learning in the first few sessions followed by an over-optimal response peak . In turn, (ii) the theory can be further extended to describe response fluctuations by the laws of quantum mechanics. (iii) We also introduce an independent model characterized by the presence of a stochastic noise of cognitive origin . We ran an unusually long experiment with 32 rats over 3960 trials, where we excluded habituation and other well-known phenomena as sources of variability in the subjects' performance. There is weak to positive evidence that Hull model is the best nonlinear regression to averaged data only for a minority of the subjects , while its dynamical extension (i) can explain the totality of data . The noise encountered in all individual responses is white, thus confirming the simplest version of model ( iii ) but standing in contrast with the colored-noise findings in human performance. Finally, data are compatible with the quantum extension (ii ), although experimental uncertainties dominate the result. On the other hand, data do not favor models with (iv) a long-memory effect or (v) where response variability is solely described by a random fractal.", "edit_actions": [{"type": "R", "before": "explore analytic models of Pavlovian conditioning extending", "after": "propose a psychological principle that naturally extends", "start_char_pos": 174, "end_char_pos": 233}, {"type": "R", "before": "model of Hull (i.e., the", "after": "single-cue", "start_char_pos": 256, "end_char_pos": 280}, {"type": "D", "before": "with just one cue) and propose three new models valid for individual data, which we argue to be quite natural. The first two are descriptive settings:", "after": null, "start_char_pos": 303, "end_char_pos": 453}, {"type": "A", "before": null, "after": "which may also be called Hull model) of Pavlovian conditioning to (", "start_char_pos": 456, "end_char_pos": 456}, {"type": "R", "before": "inspired by the classical mechanics of a particle in a given potential, which comprises Hull model and also a specific model encoding", "after": "predicting", "start_char_pos": 492, "end_char_pos": 625}, {"type": "R", "before": ";", "after": ". In turn,", "start_char_pos": 717, "end_char_pos": 718}, {"type": "R", "before": "most direct stochastic extension of Hull model, characterized by the presence of stochastic noise; (iii) a theory where response fluctuations are described by quantum mechanics and based on the general framework of dynamical models (i) explaining the noise met in (ii) and giving characteristic predictions", "after": "theory can be further extended to describe response fluctuations by the laws of quantum mechanics. (iii) We also introduce an independent model characterized by the presence of a stochastic noise of cognitive origin", "start_char_pos": 728, "end_char_pos": 1034}, {"type": "R", "before": "The", "after": "There is weak to positive evidence that Hull model is the", "start_char_pos": 1221, "end_char_pos": 1224}, {"type": "R", "before": "and 60\\% of individual data is Hull's model, while for the remaining 40\\%", "after": "only for a minority", "start_char_pos": 1268, "end_char_pos": 1341}, {"type": "R", "before": "the dynamical model", "after": ", while its dynamical extension", "start_char_pos": 1358, "end_char_pos": 1377}, {"type": "R", "before": "provides a better fit", "after": "can explain the totality of data", "start_char_pos": 1382, "end_char_pos": 1403}, {"type": "R", "before": "ii", "after": "iii", "start_char_pos": 1514, "end_char_pos": 1516}, {"type": "R", "before": "theory (iii", "after": "the quantum extension (ii", "start_char_pos": 1632, "end_char_pos": 1643}, {"type": "A", "before": null, "after": "(iv)", "start_char_pos": 1753, "end_char_pos": 1753}, {"type": "A", "before": null, "after": "(v)", "start_char_pos": 1778, "end_char_pos": 1778}], "sents_char_pos": [0, 65, 413, 718, 826, 1036, 1220, 1405, 1597, 1703]} {"doc_id": "1806.01783", "revision_depth": "1", "before_revision": "Objective: Higher-order tensor decompositions have hardly been used in muscle activity analysis despite the fact that multichannel electromyography (EMG) datasets used in muscle synergy studies naturally present multi-way structure . Here, we seek to discuss and demonstrate the potential of tensor decomposition as a framework to estimate muscle synergies from 3^{rd}-order EMG tensors constructed by stacking repetitions of multi-channel EMG for several tasks. Methods: We compare the two most common decomposition models -Parallel Factor Analysis (PARAFAC) and Tucker- in muscle synergy extraction from the three main degrees of freedom (DoF) of the wrist using the first Ninapro database. We then utilise the power tensor factorisation to create a novel direct method for shared and task-specific synergy estimation from two biomechanically related tasks by developing a constrained Tucker decomposition method . Our approach is compared with the current standard approach of repetitively applying non-negative matrix factorisation (NMF) to a series of the movements. Results: The results show that the constrained Tucker method successfully identified the shared and task-specific synergies for all 3 DoF tensorsdirectly and it was robust to misassignments with regard to task-repetition information unlike NMF, thanks to exploring the multi-way structure of muscle activity. Conclusions: We showed the potential of tensor factorisations to study and characterise muscle activity and developed a new direct method for shared and task-specific synergy identificationwith a constrained Tucker decomposition. Significance: We expect that this study will pave the way for the development of muscle activity analysis methods based on higher-order techniques.", "after_revision": " Higher-order tensor decompositions have hardly been used in muscle activity analysis despite multichannel electromyography (EMG) datasets naturally occurring as multi-way structures . Here, we seek to demonstrate and discuss the potential of tensor decompositions as a framework to estimate muscle synergies from 3^{rd}-order EMG tensors built by stacking repetitions of multi-channel EMG for several tasks. We compare the two most widespread tensor decomposition models -- Parallel Factor Analysis (PARAFAC) and Tucker -- in muscle synergy analysis of the wrist's three main Degree of Freedoms (DoFs) using the public first Ninapro database. Furthermore, we proposed a constrained Tucker decomposition (consTD) method for efficient synergy extraction building on the power of tensor decompositions. This method is proposed as a direct novel approach for shared and task-specific synergy estimation from two biomechanically related tasks . Our approach is compared with the current standard approach of repetitively applying non-negative matrix factorisation (NMF) to a series of movements. The results show that the consTD method is suitable for synergy extraction compared to PARAFAC and Tucker. Moreover, exploiting the multi-way structure of muscle activity, the proposed methods successfully identified shared and task-specific synergies for all three DoFs tensors. These were found to be robust to disarrangement with regard to task-repetition information , unlike the commonly used NMF. In summary, we demonstrate how to use tensors to characterise muscle activity and develop a new consTD method for muscle synergy extraction that could be used for shared and task-specific synergies identification. We expect that this study will pave the way for the development of novel muscle activity analysis methods based on higher-order techniques.", "edit_actions": [{"type": "D", "before": "Objective:", "after": null, "start_char_pos": 0, "end_char_pos": 10}, {"type": "D", "before": "the fact that", "after": null, "start_char_pos": 104, "end_char_pos": 117}, {"type": "R", "before": "used in muscle synergy studies naturally present", "after": "naturally occurring as", "start_char_pos": 163, "end_char_pos": 211}, {"type": "R", "before": "structure", "after": "structures", "start_char_pos": 222, "end_char_pos": 231}, {"type": "R", "before": "discuss and demonstrate", "after": "demonstrate and discuss", "start_char_pos": 251, "end_char_pos": 274}, {"type": "R", "before": "decomposition", "after": "decompositions", "start_char_pos": 299, "end_char_pos": 312}, {"type": "R", "before": "constructed", "after": "built", "start_char_pos": 387, "end_char_pos": 398}, {"type": "D", "before": "Methods:", "after": null, "start_char_pos": 463, "end_char_pos": 471}, {"type": "R", "before": "common decomposition models -Parallel", "after": "widespread tensor decomposition models -- Parallel", "start_char_pos": 496, "end_char_pos": 533}, {"type": "R", "before": "Tucker-", "after": "Tucker --", "start_char_pos": 564, "end_char_pos": 571}, {"type": "R", "before": "extraction from the three main degrees of freedom (DoF) of the wrist using the", "after": "analysis of the wrist's three main Degree of Freedoms (DoFs) using the public", "start_char_pos": 590, "end_char_pos": 668}, {"type": "R", "before": "We then utilise the power tensor factorisation to create a novel direct method", "after": "Furthermore, we proposed a constrained Tucker decomposition (consTD) method for efficient synergy extraction building on the power of tensor decompositions. This method is proposed as a direct novel approach", "start_char_pos": 693, "end_char_pos": 771}, {"type": "D", "before": "by developing a constrained Tucker decomposition method", "after": null, "start_char_pos": 859, "end_char_pos": 914}, {"type": "R", "before": "the movements. Results:", "after": "movements.", "start_char_pos": 1057, "end_char_pos": 1080}, {"type": "R", "before": "constrained Tucker method successfully identified the", "after": "consTD method is suitable for synergy extraction compared to PARAFAC and Tucker. Moreover, exploiting the multi-way structure of muscle activity, the proposed methods successfully identified", "start_char_pos": 1107, "end_char_pos": 1160}, {"type": "R", "before": "3 DoF tensorsdirectly and it was robust to misassignments", "after": "three DoFs tensors. These were found to be robust to disarrangement", "start_char_pos": 1204, "end_char_pos": 1261}, {"type": "R", "before": "unlike NMF, thanks to exploring the multi-way structure of muscle activity. Conclusions: We showed the potential of tensor factorisations to study and", "after": ", unlike the commonly used NMF. In summary, we demonstrate how to use tensors to", "start_char_pos": 1305, "end_char_pos": 1455}, {"type": "R", "before": "developed a new direct method for", "after": "develop a new consTD method for muscle synergy extraction that could be used for", "start_char_pos": 1489, "end_char_pos": 1522}, {"type": "R", "before": "synergy identificationwith a constrained Tucker decomposition. Significance:", "after": "synergies identification.", "start_char_pos": 1548, "end_char_pos": 1624}, {"type": "A", "before": null, "after": "novel", "start_char_pos": 1692, "end_char_pos": 1692}], "sents_char_pos": [0, 233, 462, 692, 916, 1071, 1380, 1610]} {"doc_id": "1806.04032", "revision_depth": "1", "before_revision": "Many real-world dynamical systems can successfully be analyzed using the temporal network formalism. Empirical temporal networks and dynamic processes that take place in these situations show heterogeneous, non-Markovian, and intrinsically correlated dynamics, making their analysis particularly challenging. Randomized reference models (RRMs) for temporal networks constitute a versatile toolbox for studying such systems. Defined as ensembles of random networks with given features constrained to match those of an input (empirical) network, they may be used to identify statistically significant motifs in empirical temporal networks (i.e. overrepresented w.r.t. the null random networks) and to infer the effects of such motifs on dynamical processes unfolding in the network. However, the effects of most randomization procedures on temporal network characteristics remain poorly understood, rendering their use non-trivial and susceptible to misinterpretation. Here we propose a unified framework for classifying and understanding microcanonical RRMs (MRRMs). We use this framework to propose a canonical naming convention for existing randomization procedures, classify them, and deduce their effects on a range of important temporal network features. We furthermore show that certain classes of compatible MRRMs may be applied in sequential composition to generate more than a hundred new MRRMs from existing ones surveyed in this article. We provide a tutorial for the use of MRRMs to analyze an empirical temporal network and we review applications of MRRMs found in literature . The taxonomy of MRRMs we have developed provides a reference to ease the use of MRRMs, and the theoretical foundations laid here may further serve as a base for the development of a principled and systematic way to generate and apply randomized reference null models for the study of temporal networks .", "after_revision": "Many dynamical systems can be successfully analyzed by representing them as networks. Empirically measured networks and dynamic processes that take place in these situations show heterogeneous, non-Markovian, and intrinsically correlated topologies and dynamics. This makes their analysis particularly challenging. Randomized reference models (RRMs) have emerged as a general and versatile toolbox for studying such systems. Defined as ensembles of random networks with given features constrained to match those of an input (empirical) network, they may for example be used to identify important features of empirical networks and their effects on dynamical processes unfolding in the network. RRMs are typically implemented as procedures that reshuffle an empirical network, making them very generally applicable. However, the effects of most shuffling procedures on network features remain poorly understood, rendering their use non-trivial and susceptible to misinterpretation. Here we propose a unified framework for classifying and understanding microcanonical RRMs (MRRMs). Focusing on temporal networks, we use this framework to build a taxonomy of MRRMs that proposes a canonical naming convention , classifies them, and deduces their effects on a range of important network features. We furthermore show that certain classes of compatible MRRMs may be applied in sequential composition to generate over a hundred new MRRMs from the existing ones surveyed in this article. We provide two tutorials showing applications of the MRRM framework to empirical temporal networks: 1) to analyze how different features of a network affect other features and 2) to analyze how such features affect a dynamic process in the network. We finally survey applications of MRRMs found in literature .", "edit_actions": [{"type": "D", "before": "real-world", "after": null, "start_char_pos": 5, "end_char_pos": 15}, {"type": "R", "before": "successfully be analyzed using the temporal network formalism. Empirical temporal", "after": "be successfully analyzed by representing them as networks. Empirically measured", "start_char_pos": 38, "end_char_pos": 119}, {"type": "R", "before": "dynamics, making", "after": "topologies and dynamics. This makes", "start_char_pos": 251, "end_char_pos": 267}, {"type": "R", "before": "for temporal networks constitute a", "after": "have emerged as a general and", "start_char_pos": 344, "end_char_pos": 378}, {"type": "A", "before": null, "after": "for example", "start_char_pos": 553, "end_char_pos": 553}, {"type": "R", "before": "statistically significant motifs in empirical temporal networks (i.e. overrepresented w.r.t. the null random networks) and to infer the effects of such motifs", "after": "important features of empirical networks and their effects", "start_char_pos": 574, "end_char_pos": 732}, {"type": "A", "before": null, "after": "RRMs are typically implemented as procedures that reshuffle an empirical network, making them very generally applicable.", "start_char_pos": 782, "end_char_pos": 782}, {"type": "R", "before": "randomization procedures on temporal network characteristics", "after": "shuffling procedures on network features", "start_char_pos": 812, "end_char_pos": 872}, {"type": "R", "before": "We", "after": "Focusing on temporal networks, we", "start_char_pos": 1068, "end_char_pos": 1070}, {"type": "R", "before": "propose a", "after": "build a taxonomy of MRRMs that proposes a", "start_char_pos": 1093, "end_char_pos": 1102}, {"type": "R", "before": "for existing randomization procedures, classify", "after": ", classifies", "start_char_pos": 1131, "end_char_pos": 1178}, {"type": "R", "before": "deduce", "after": "deduces", "start_char_pos": 1189, "end_char_pos": 1195}, {"type": "D", "before": "temporal", "after": null, "start_char_pos": 1234, "end_char_pos": 1242}, {"type": "R", "before": "more than", "after": "over", "start_char_pos": 1375, "end_char_pos": 1384}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1410, "end_char_pos": 1410}, {"type": "R", "before": "a tutorial for the use of MRRMs to analyze an empirical temporal network and we review", "after": "two tutorials showing applications of the MRRM framework to empirical temporal networks: 1) to analyze how different features of a network affect other features and 2) to analyze how such features affect a dynamic process in the network. We finally survey", "start_char_pos": 1462, "end_char_pos": 1548}, {"type": "D", "before": ". The taxonomy of MRRMs we have developed provides a reference to ease the use of MRRMs, and the theoretical foundations laid here may further serve as a base for the development of a principled and systematic way to generate and apply randomized reference null models for the study of temporal networks", "after": null, "start_char_pos": 1591, "end_char_pos": 1894}], "sents_char_pos": [0, 100, 308, 423, 781, 968, 1067, 1260, 1450, 1592]} {"doc_id": "1806.08386", "revision_depth": "1", "before_revision": "Cryptocurrencies are increasingly popular digital assets/cashes programmed to work as a medium of exchange that are \"secure\" by design (e.g., through block-chains and cryptography). The year 2017 saw the rise and fall of the cryptocurrency market, followed by high volatility in the price of each cryptocurrency . In this work, we study critical transitions in cryptocurrency residualsthrough the phenomenon of critical slowing down . We find that, regardless of the specific cryptocurrency or rolling window size, the autocorrelation always fluctuates around a high value and the standard deviation increases monotonically. In particular, we have detected two sudden jumps in the standard deviation, in the second quarter of 2017 and at the beginning of 2018, suggesting early warning signals of two majors price collapse that have happened in those periods. Our findings represent a first step towards a better diagnostic of the risk of critical transition in the price and/or volume of cryptocurrencies .", "after_revision": " The year 2017 saw the rise and fall of the crypto-currency market, followed by high variability in the price of all crypto-currencies . In this work, we study the abrupt transition in crypto-currency residuals, which is associated with the critical transition (the phenomenon of critical slowing down ) or the stochastic transition phenomena . We find that, regardless of the specific crypto-currency or rolling window size, the autocorrelation always fluctuates around a high value , while the standard deviation increases monotonically. Therefore, while the autocorrelation does not display signals of critical slowing down, the standard deviation can be used to anticipate critical or stochastic transitions. In particular, we have detected two sudden jumps in the standard deviation, in the second quarter of 2017 and at the beginning of 2018, which could have served as early warning signals of two majors price collapses that have happened in the following periods. We finally propose a mean-field phenomenological model for the price of crypto-currency to show how the use of the standard deviation of the residuals is a better leading indicator of the collapse in price than the time series' autocorrelation. Our findings represent a first step towards a better diagnostic of the risk of critical transition in the price and/or volume of crypto-currencies .", "edit_actions": [{"type": "D", "before": "Cryptocurrencies are increasingly popular digital assets/cashes programmed to work as a medium of exchange that are \"secure\" by design (e.g., through block-chains and cryptography).", "after": null, "start_char_pos": 0, "end_char_pos": 181}, {"type": "R", "before": "cryptocurrency", "after": "crypto-currency", "start_char_pos": 225, "end_char_pos": 239}, {"type": "R", "before": "volatility", "after": "variability", "start_char_pos": 265, "end_char_pos": 275}, {"type": "R", "before": "each cryptocurrency", "after": "all crypto-currencies", "start_char_pos": 292, "end_char_pos": 311}, {"type": "R", "before": "critical transitions in cryptocurrency residualsthrough the", "after": "the abrupt transition in crypto-currency residuals, which is associated with the critical transition (the", "start_char_pos": 337, "end_char_pos": 396}, {"type": "A", "before": null, "after": ") or the stochastic transition phenomena", "start_char_pos": 433, "end_char_pos": 433}, {"type": "R", "before": "cryptocurrency", "after": "crypto-currency", "start_char_pos": 477, "end_char_pos": 491}, {"type": "R", "before": "and", "after": ", while", "start_char_pos": 574, "end_char_pos": 577}, {"type": "A", "before": null, "after": "Therefore, while the autocorrelation does not display signals of critical slowing down, the standard deviation can be used to anticipate critical or stochastic transitions.", "start_char_pos": 626, "end_char_pos": 626}, {"type": "R", "before": "suggesting", "after": "which could have served as", "start_char_pos": 763, "end_char_pos": 773}, {"type": "R", "before": "collapse", "after": "collapses", "start_char_pos": 816, "end_char_pos": 824}, {"type": "R", "before": "those periods.", "after": "the following periods. We finally propose a mean-field phenomenological model for the price of crypto-currency to show how the use of the standard deviation of the residuals is a better leading indicator of the collapse in price than the time series' autocorrelation.", "start_char_pos": 847, "end_char_pos": 861}, {"type": "R", "before": "cryptocurrencies", "after": "crypto-currencies", "start_char_pos": 991, "end_char_pos": 1007}], "sents_char_pos": [0, 181, 313, 435, 625, 861]} {"doc_id": "1807.00509", "revision_depth": "1", "before_revision": "Cortical neurons in the fluctuation driven regime can realize ultrafast population encoding. The underlying biophysical mechanisms, however, are not well understood. Reducing action potential onset rapidness can impair the ultrafast population encoding, but it is not clear whether rapid action potential onset is sufficient for ultrafast population encoding. One hypothesis proposes that rapid action potential onset is caused by the separation of the axon initial segment, that is the initiation site of action potentials, from the soma, and that this spatial separation also results in ultrafast population encoding. Here we examined this hypothesis by studying the linear response properties of a population of model neurons . We find that the axonal initiation site position is not sufficient to generate an ultrafast response and reproduce the high bandwidth observed in cortical neuron populations . Furthermore, the high frequency regime of the linear response function of this model is insensitive to correlation times of the input current contradicting empirical evidence. By tuning the activation slope of the sodium current, we examined the impact of voltage sensitivity of sodium channels on population encoding. When high voltage sensitivity is introduced , the two empirically observed phenomena can be recovered. By investigating varying soma sizes, we furthermore highlight the effect of neuron morphology on the linear response. Our results show that high onset rapidness of action potential initiation is not sufficient for ultrafast response. In the light of recent experimental evidence about neural activity dependent repositioning of the axon initial segment and the resulting question about the functional properties of this phenomenon , our study predicts that , while it can lead to more rapid action potential onsets in the soma, it does not affect the linear response of a population of neurons.", "after_revision": "Cortical neurons in the fluctuation driven regime can realize ultrafast population encoding. The underlying biophysical mechanisms, however, are not well understood. Reducing the sharpness of the action potential onset can impair ultrafast population encoding, but it is not clear whether a sharp action potential onset is sufficient for ultrafast population encoding. One hypothesis proposes that the sharp action potential onset is caused by the electrotonic separation of the site of action potential initiation from the soma, and that this spatial separation also results in ultrafast population encoding. Here we examined this hypothesis by studying the linear response properties of model neurons with a defined initiation site . We find that placing the initiation site at different axonal positions has only a weak impact on the linear response function of the model. It fails to generate the ultrafast response and high bandwidth that is observed in cortical neurons . Furthermore, the high frequency regime of the linear response function of this model is insensitive to correlation times of the input current contradicting empirical evidence. When we increase the voltage sensitivity of sodium channels at the initiation site , the two empirically observed phenomena can be recovered. We provide an explanation for the dissociation of sharp action potential onset and ultrafast response. By investigating varying soma sizes, we furthermore highlight the effect of neuron morphology on the linear response. Our results show that a sharp onset of action potentials is not sufficient for the ultrafast response. In the light of recent reports of activity-dependent repositioning of the axon initial segment , our study predicts that a more distal initiation site can lead to an increased sharpness of the somatic waveform but it does not affect the linear response of a population of neurons.", "edit_actions": [{"type": "A", "before": null, "after": "the sharpness of the", "start_char_pos": 175, "end_char_pos": 175}, {"type": "R", "before": "rapidness can impair the", "after": "can impair", "start_char_pos": 199, "end_char_pos": 223}, {"type": "R", "before": "rapid", "after": "a sharp", "start_char_pos": 283, "end_char_pos": 288}, {"type": "R", "before": "rapid", "after": "the sharp", "start_char_pos": 390, "end_char_pos": 395}, {"type": "A", "before": null, "after": "electrotonic", "start_char_pos": 436, "end_char_pos": 436}, {"type": "D", "before": "axon initial segment, that is the initiation", "after": null, "start_char_pos": 455, "end_char_pos": 499}, {"type": "R", "before": "potentials,", "after": "potential initiation", "start_char_pos": 515, "end_char_pos": 526}, {"type": "R", "before": "a population of model neurons", "after": "model neurons with a defined initiation site", "start_char_pos": 701, "end_char_pos": 730}, {"type": "A", "before": null, "after": "placing the initiation site at different axonal positions has only a weak impact on the linear response function of the model. It fails to generate", "start_char_pos": 746, "end_char_pos": 746}, {"type": "D", "before": "axonal initiation site position is not sufficient to generate an", "after": null, "start_char_pos": 751, "end_char_pos": 815}, {"type": "R", "before": "reproduce the high bandwidth", "after": "high bandwidth that is", "start_char_pos": 839, "end_char_pos": 867}, {"type": "R", "before": "neuron populations", "after": "neurons", "start_char_pos": 889, "end_char_pos": 907}, {"type": "R", "before": "By tuning the activation slope of the sodium current, we examined the impact of", "after": "When we increase the", "start_char_pos": 1086, "end_char_pos": 1165}, {"type": "R", "before": "on population encoding. When high voltage sensitivity is introduced", "after": "at the initiation site", "start_char_pos": 1205, "end_char_pos": 1272}, {"type": "A", "before": null, "after": "We provide an explanation for the dissociation of sharp action potential onset and ultrafast response.", "start_char_pos": 1332, "end_char_pos": 1332}, {"type": "R", "before": "high onset rapidness of action potential initiation", "after": "a sharp onset of action potentials", "start_char_pos": 1473, "end_char_pos": 1524}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1547, "end_char_pos": 1547}, {"type": "R", "before": "experimental evidence about neural activity dependent", "after": "reports of activity-dependent", "start_char_pos": 1591, "end_char_pos": 1644}, {"type": "D", "before": "and the resulting question about the functional properties of this phenomenon", "after": null, "start_char_pos": 1687, "end_char_pos": 1764}, {"type": "R", "before": ", while it", "after": "a more distal initiation site", "start_char_pos": 1791, "end_char_pos": 1801}, {"type": "R", "before": "more rapid action potential onsets in the soma,", "after": "an increased sharpness of the somatic waveform but", "start_char_pos": 1814, "end_char_pos": 1861}], "sents_char_pos": [0, 92, 165, 360, 621, 732, 909, 1085, 1228, 1331, 1450, 1567]} {"doc_id": "1807.01776", "revision_depth": "1", "before_revision": "Stunting, or impaired child growth due to undernutrition, has multiple negative health effects, making it a top global health priority. The current benchmark for classifying stunting assumes a universal model of growth with height-for-age z-score (HAZ) cutoffs set by the WHO. However, this universal model may hide hotspots of stunting if populations differ in HAZ in ways that are independent of undernutrition. We assess the potential magnitude of this problem by decomposing variation in HAZ from 1,406,609 children from 63 low-and middle-income countries into two components : ( 1) a component shaped by environmental inputs, such as poverty, infectious disease, inadequate sanitation, and healthcare access, and ( 2) a country-specific starting point that is independent of such inputs. After removing the effects of environmental inputs, we find that different countries have reliably and substantially different starting points in average HAZ scores even before considering environmental inputs (a range of 1.7 SD). As expected from a two-component model, these country-specific starting points (basal HAZ) are not associated with key indicators of undernutrition (e.g., infant mortality and average calorie deficit). By contrast, increases in HAZ above a country's basal estimate (accrued HAZ) show strong correlations with these same variables, suggesting that accrued HAZ captures standard definitions of stunting as impaired growth due to undernutrition. Using these two components, we show how universal cutoffs can underestimate stunting in specific world regions (e.g., sub-Saharan Africa and the Caribbean), where children on average start off taller. As stunting is a high priority global health problem, standards that are sensitive to such population variation in healthy growth should improve efforts to target those most vulnerable to childhood undernutrition.", "after_revision": "Stunting, or impaired child growth due to undernutrition, has multiple negative health effects, making it a top global health priority. The current benchmark for classifying stunting assumes a universal model of growth with height-for-age z-score (HAZ) cutoffs set by the WHO. However, this universal model may hide hotspots of stunting if populations differ in HAZ in ways that are independent of undernutrition. We assess the potential magnitude of this bias by decomposing variation in HAZ from 1,406,609 children from 63 low- and middle-income countries into two components ; 1) a component shaped by environmental inputs, poverty, infectious disease, inadequate sanitation, and healthcare access, and 2) a country-specific basal starting point that is independent of such inputs. After removing the effects of numerous environmental inputs, we find that different countries have reliably and substantially different basal starting points in average HAZ scores (a range of 1.7 SD). These country-specific starting points , which we define as basal HAZ, are not associated with key indicators of undernutrition (e.g., infant mortality and average calorie deficit). By contrast, average increases in HAZ above a country's starting point, which we define as accrued HAZ, show strong correlations with these same variables, suggesting that low accrued HAZ captures standard definitions of stunting as impaired growth due to undernutrition. Using these two components, we show how universal cutoffs can underestimate stunting in specific world regions (e.g., sub-Saharan Africa and the Caribbean), where children in even very deprived situations start off taller. As stunting is a high priority global health problem, standards that are sensitive to such population variation in healthy growth should improve efforts to target those most vulnerable to childhood undernutrition.", "edit_actions": [{"type": "R", "before": "problem", "after": "bias", "start_char_pos": 456, "end_char_pos": 463}, {"type": "R", "before": "low-and", "after": "low- and", "start_char_pos": 528, "end_char_pos": 535}, {"type": "R", "before": ": (", "after": ";", "start_char_pos": 580, "end_char_pos": 583}, {"type": "D", "before": "such as", "after": null, "start_char_pos": 631, "end_char_pos": 638}, {"type": "D", "before": "(", "after": null, "start_char_pos": 718, "end_char_pos": 719}, {"type": "A", "before": null, "after": "basal", "start_char_pos": 742, "end_char_pos": 742}, {"type": "A", "before": null, "after": "numerous", "start_char_pos": 824, "end_char_pos": 824}, {"type": "A", "before": null, "after": "basal", "start_char_pos": 922, "end_char_pos": 922}, {"type": "D", "before": "even before considering environmental inputs", "after": null, "start_char_pos": 961, "end_char_pos": 1005}, {"type": "R", "before": "As expected from a two-component model, these", "after": "These", "start_char_pos": 1027, "end_char_pos": 1072}, {"type": "R", "before": "(basal HAZ)", "after": ", which we define as basal HAZ,", "start_char_pos": 1106, "end_char_pos": 1117}, {"type": "A", "before": null, "after": "average", "start_char_pos": 1242, "end_char_pos": 1242}, {"type": "R", "before": "basal estimate (accrued HAZ)", "after": "starting point, which we define as accrued HAZ,", "start_char_pos": 1278, "end_char_pos": 1306}, {"type": "A", "before": null, "after": "low", "start_char_pos": 1375, "end_char_pos": 1375}, {"type": "R", "before": "on average", "after": "in even very deprived situations", "start_char_pos": 1644, "end_char_pos": 1654}], "sents_char_pos": [0, 135, 276, 413, 793, 1026, 1228, 1471, 1672]} {"doc_id": "1807.01776", "revision_depth": "2", "before_revision": "Stunting, or impaired child growth due to undernutrition, has multiple negative health effects, making it a top global health priority. The current benchmark for classifying stunting assumes a universal model of growth with height-for-age z-score (HAZ) cutoffs set by the WHO . However, this universal model may hide hotspots of stunting if populations differ in HAZ in ways that are independent of undernutrition. We assess the potential magnitude of this bias by decomposing variation in HAZ from 1, 406,609 children from 63 low- and middle-income countries into two components ; 1) a component shaped by environmental inputs, poverty, infectious disease, inadequate sanitation, and healthcare access, and 2) a country-specific basal starting point that is independent of such inputs. After removing the effects of numerous environmental inputs, we find that different countries have reliably and substantially different basal starting points in average HAZ scores (a range of 1.7 SD) . These country-specific starting points, which we define as basal HAZ, are not associated with key indicators of undernutrition (e. g., infant mortality and average calorie deficit). By contrast, average increases in HAZ above a country's starting point, which we define as accrued HAZ , show strong correlations with these same variables, suggesting that low accrued HAZ captures standard definitions of stunting as impaired growth due to undernutrition. Using these two components, we show how universal cutoffs can underestimate stunting in specific world regions (e.g., sub-Saharan Africa and the Caribbean), where children in even very deprived situations start off taller . As stunting is a high priority global health problem , standards that are sensitive to such population variation in healthy growth should improve efforts to target those most vulnerable to childhood undernutrition.", "after_revision": "Background: Stunting-or impaired child growth due to undernutrition-has multiple negative health effects, making it a top global health priority. The current benchmark for classifying stunting assumes a universal model of growth with height-for-age z-score (HAZ) cutoffs set by the World Health Organization . However, this model may hide hotspots of stunting if populations differ in HAZ in ways that are independent of undernutrition. We examine how universal cutoffs can underestimate stunting in specific regions around the world. Methods: Using a non-linear multi-level model, we decompose variation in height-for-age z-scores (HAZ) from 1, 430,986 children across 63 countries into two components : 1) \"accrued HAZ\" shaped by environmental inputs-undernutrition, infectious disease, inadequate sanitation, and 2) a country-specific \"basal HAZ\" independent of such inputs. We validate these components by assessing their associations with key indicators of undernutrition. We then re-estimate stunting prevalence with population-sensitive cutoffs based on the estimates of these two components. Results: Basal HAZ differs reliably across countries (range of 1.6 SD) and is independent of measures of undernutrition. By contrast, accrued HAZ captures stunting as impaired growth due to deprivation. Population-sensitive estimates suggest that universal cutoffs can miss 1 in 5 children in specific world regions , where children have greater basal heights. Conclusion: Current universal cutoffs may miss stunting in populations with taller basal HAZ . As stunting is a high priority in global health , standards that are sensitive to population variation in healthy growth should improve efforts to target those most vulnerable to childhood undernutrition.", "edit_actions": [{"type": "R", "before": "Stunting, or", "after": "Background: Stunting-or", "start_char_pos": 0, "end_char_pos": 12}, {"type": "R", "before": "undernutrition, has", "after": "undernutrition-has", "start_char_pos": 42, "end_char_pos": 61}, {"type": "R", "before": "WHO", "after": "World Health Organization", "start_char_pos": 272, "end_char_pos": 275}, {"type": "D", "before": "universal", "after": null, "start_char_pos": 292, "end_char_pos": 301}, {"type": "R", "before": "assess the potential magnitude of this bias by decomposing variation in HAZ", "after": "examine how universal cutoffs can underestimate stunting in specific regions around the world. Methods: Using a non-linear multi-level model, we decompose variation in height-for-age z-scores (HAZ)", "start_char_pos": 418, "end_char_pos": 493}, {"type": "R", "before": "406,609 children from", "after": "430,986 children across", "start_char_pos": 502, "end_char_pos": 523}, {"type": "D", "before": "low- and middle-income", "after": null, "start_char_pos": 527, "end_char_pos": 549}, {"type": "R", "before": ";", "after": ":", "start_char_pos": 580, "end_char_pos": 581}, {"type": "R", "before": "a component", "after": "\"accrued HAZ\"", "start_char_pos": 585, "end_char_pos": 596}, {"type": "R", "before": "inputs, poverty,", "after": "inputs-undernutrition,", "start_char_pos": 621, "end_char_pos": 637}, {"type": "D", "before": "healthcare access, and", "after": null, "start_char_pos": 685, "end_char_pos": 707}, {"type": "R", "before": "basal starting point that is", "after": "\"basal HAZ\"", "start_char_pos": 730, "end_char_pos": 758}, {"type": "R", "before": "After removing the effects of numerous environmental inputs, we find that different countries have reliably and substantially different basal starting points in average HAZ scores (a range of 1.7 SD) . These country-specific starting points, which we define as basal HAZ, are not associated with key indicators of undernutrition (e. g., infant mortality and average calorie deficit).", "after": "We validate these components by assessing their associations with key indicators of undernutrition. We then re-estimate stunting prevalence with population-sensitive cutoffs based on the estimates of these two components. Results: Basal HAZ differs reliably across countries (range of 1.6 SD) and is independent of measures of undernutrition.", "start_char_pos": 787, "end_char_pos": 1170}, {"type": "R", "before": "average increases in HAZ above a country's starting point, which we define as accrued HAZ , show strong correlations with these same variables, suggesting that low accrued HAZ captures standard definitions of", "after": "accrued HAZ captures", "start_char_pos": 1184, "end_char_pos": 1392}, {"type": "R", "before": "undernutrition. Using these two components, we show how", "after": "deprivation. Population-sensitive estimates suggest that", "start_char_pos": 1428, "end_char_pos": 1483}, {"type": "R", "before": "underestimate stunting in", "after": "miss 1 in 5 children in", "start_char_pos": 1506, "end_char_pos": 1531}, {"type": "R", "before": "(e.g., sub-Saharan Africa and the Caribbean), where children in even very deprived situations start off taller", "after": ", where children have greater basal heights. Conclusion: Current universal cutoffs may miss stunting in populations with taller basal HAZ", "start_char_pos": 1555, "end_char_pos": 1665}, {"type": "R", "before": "global health problem", "after": "in global health", "start_char_pos": 1699, "end_char_pos": 1720}, {"type": "D", "before": "such", "after": null, "start_char_pos": 1755, "end_char_pos": 1759}], "sents_char_pos": [0, 135, 414, 581, 786, 1170, 1443, 1667]} {"doc_id": "1807.01776", "revision_depth": "3", "before_revision": "Background: Stunting-or impaired child growth due to undernutrition-has multiple negative health effects, making it a top global health priority. The current benchmark for classifying stunting assumes a universal model of growth with height-for-age z-score (HAZ) cutoffs set by the World Health Organization. However, this model may hide hotspots of stunting if populations differ in HAZ in ways that are independent of undernutrition. We examine how universal cutoffs can underestimate stunting in specific regions around the world. Methods: Using a non-linear multi-level model , we decompose variation in height-for-age z-scores (HAZ) from 1, 430,986 children across 63 countries into two components: 1) \"accrued HAZ\" shaped by environmental inputs-undernutrition, infectious disease, inadequate sanitation, and 2) a country-specific \"basal HAZ\" independent of such inputs. We validate these components by assessing their associations with key indicators of undernutrition. We then re-estimate stuntingprevalence with population-sensitive cutoffs based on the estimates of these two components . Results: Basal HAZ differs reliably across countries (range of 1.6 SD) and is independent of measures of undernutrition . By contrast, accrued HAZ captures stunting as impaired growth due to deprivation . Population-sensitive estimates suggest that universal cutoffs can miss 1 in 5 children in specific world regions, where children have greater basal heights. Conclusion : Current universal cutoffs may miss stunting in populations with taller basal HAZ. As stunting is a high priority in global health, standards that are sensitive to population variation in healthy growth should improve efforts to target those most vulnerable to childhood undernutrition .", "after_revision": "Objectives: Current standards for comparing stunting across human populations assume a universal model of child growth. Such comparisons ignore population differences that are independent of deprivation and health outcomes. This paper partitions variation in height-for-age that is specifically associated with deprivation and health outcomes to provide a basis for cross-population comparisons. Materials Methods: Using a multi-level model with a sigmoid relationship of resources and growth, we partition variation in height-for-age z-scores (HAZ) from 1, 522,564 children across 70 countries into two components: 1) \"accrued HAZ\" shaped by environmental inputs (e.g., undernutrition, infectious disease, inadequate sanitation, poverty), and 2) a country-specific \"basal HAZ\" independent of such inputs. We validate these components against population-level infant mortality rates, and assess how these basal differences may affect cross-population comparisons of stunting . Results: Basal HAZ differs reliably across countries (range of 1.5 SD) and is independent of measures of infant mortality . By contrast, accrued HAZ captures stunting as impaired growth due to deprivation and is more closely associated with infant mortality than observed HAZ. Ranking populations by accrued HAZ suggest that populations in West Africa and the Caribbean suffer much greater levels of stunting than suggested by observed HAZ. Discussion : Current universal standards may dramatically underestimate stunting in populations with taller basal HAZ. Relying on observed HAZ rather than accrued HAZ may also lead to inappropriate cross-population comparisons, such as concluding that Haitian children enjoy better conditions for growth than do Indian or Guatemalan children .", "edit_actions": [{"type": "R", "before": "Background: Stunting-or impaired child growth due to undernutrition-has multiple negative health effects, making it a top global health priority. The current benchmark for classifying stunting assumes", "after": "Objectives: Current standards for comparing stunting across human populations assume", "start_char_pos": 0, "end_char_pos": 200}, {"type": "R", "before": "growth with height-for-age z-score (HAZ) cutoffs set by the World Health Organization. However, this model may hide hotspots of stunting if populations differ in HAZ in ways", "after": "child growth. Such comparisons ignore population differences", "start_char_pos": 222, "end_char_pos": 395}, {"type": "R", "before": "undernutrition. We examine how universal cutoffs can underestimate stunting in specific regions around the world.", "after": "deprivation and health outcomes. This paper partitions variation in height-for-age that is specifically associated with deprivation and health outcomes to provide a basis for cross-population comparisons. Materials", "start_char_pos": 420, "end_char_pos": 533}, {"type": "D", "before": "non-linear", "after": null, "start_char_pos": 551, "end_char_pos": 561}, {"type": "R", "before": ", we decompose", "after": "with a sigmoid relationship of resources and growth, we partition", "start_char_pos": 580, "end_char_pos": 594}, {"type": "R", "before": "430,986 children across 63", "after": "522,564 children across 70", "start_char_pos": 646, "end_char_pos": 672}, {"type": "R", "before": "inputs-undernutrition,", "after": "inputs (e.g., undernutrition,", "start_char_pos": 745, "end_char_pos": 767}, {"type": "A", "before": null, "after": "poverty),", "start_char_pos": 811, "end_char_pos": 811}, {"type": "R", "before": "by assessing their associations with key indicators of undernutrition. We then re-estimate stuntingprevalence with population-sensitive cutoffs based on the estimates of these two components", "after": "against population-level infant mortality rates, and assess how these basal differences may affect cross-population comparisons of stunting", "start_char_pos": 907, "end_char_pos": 1097}, {"type": "R", "before": "1.6", "after": "1.5", "start_char_pos": 1163, "end_char_pos": 1166}, {"type": "R", "before": "undernutrition", "after": "infant mortality", "start_char_pos": 1205, "end_char_pos": 1219}, {"type": "R", "before": ". Population-sensitive estimates suggest that universal cutoffs can miss 1 in 5 children in specific world regions, where children have greater basal heights. Conclusion", "after": "and is more closely associated with infant mortality than observed HAZ. Ranking populations by accrued HAZ suggest that populations in West Africa and the Caribbean suffer much greater levels of stunting than suggested by observed HAZ. Discussion", "start_char_pos": 1303, "end_char_pos": 1472}, {"type": "R", "before": "cutoffs may miss", "after": "standards may dramatically underestimate", "start_char_pos": 1493, "end_char_pos": 1509}, {"type": "R", "before": "As stunting is a high priority in global health, standards that are sensitive to population variation in healthy growth should improve efforts to target those most vulnerable to childhood undernutrition", "after": "Relying on observed HAZ rather than accrued HAZ may also lead to inappropriate cross-population comparisons, such as concluding that Haitian children enjoy better conditions for growth than do Indian or Guatemalan children", "start_char_pos": 1557, "end_char_pos": 1759}], "sents_char_pos": [0, 145, 308, 435, 533, 877, 977, 1221, 1461, 1556]} {"doc_id": "1807.10114", "revision_depth": "1", "before_revision": "Since Bachelier 's thesis in 1900, when mathematical finance began, attempts at understanding the nature of stock market prices and at predicting them have not succeeded. Statistical models have only found minor regularities and anomalies. Other approaches have failed or are illusory. To this day, physicists and mathematicians working in economy consider that the evolution of security prices is largely random, and, thus, not predictable. We show that not only is the evolution of security prices not random but it is semi-deterministic and, more remarkably, governed by a physical law. The law takes the form of a physicomathematical theory centered around a purely mathematical function (not a model and unrelated to statistical methods). The function , which can be described as an \"isodense\" network of \"moving\" regression curves of an order greater than or equal to 1, can be conveniently represented graphically . The graphical representation , called a \"topological network\" , reveals the existence of new mathematical objects , which emerge spontaneously (they are not mathematically drawn). What is remarkable is that these objects, called \"characteristic figures\" , mainly \"cords\" , have the unique property of attracting and repelling the price, so that the price bounces from one cord to another. The direct consequence is that prices are driven by these cords in a semi-deterministic manner (leaning towards deterministic). We can say that we now understand the reason behind price movements and can predict stock prices both qualitatively and quantitatively. Note that time series data (not limited to financial) is input directly into the function without any fitting. The function is universal (it is a one fits all function) and, thanks to its extreme sensitivity, reveals the hidden order present in time series data that other methods have never uncovered.", "after_revision": "Since Bachelier in 1900, when mathematical finance began, attempts at understanding the nature of stock market prices and at predicting them have not succeeded. Statistical models have only found minor regularities and anomalies. Other approaches have failed or are illusory. To this day, the physicists and mathematicians working in economy consider that the evolution of security prices is basically random, and, thus, not predictable. We show that the evolution of security prices not at all random but is largely deterministic and, more remarkably, governed by a physical law. The law takes the form of a physicomathematical theory centered around a purely mathematical function (not a model and unrelated to statistical methods). The function can be described as an \"isodense\" network of \"moving\" regression curves of an order greater than or equal to 1. When inputting a time series of any security into the function, new mathematical objects emerge spontaneously . The graphical representation of the function is called a \"topological network\" and the emergent objects are called \"characteristic figures\" ( mainly \"cords\" ). What is central to the function is that these cords have the unique property of attracting and repelling the price, so that the price bounces from one cord to another. The direct consequence is that prices are driven by the cords in a semi-deterministic manner (leaning towards deterministic). Having a function that describes the evolution of the price, we now understand the reason behind each price movement and can predict stock prices both qualitatively and quantitatively. The function is universal , does not rely on any fitting, and, thanks to its extreme sensitivity, reveals the hidden order present in time series data that other methods have never uncovered.", "edit_actions": [{"type": "D", "before": "'s thesis", "after": null, "start_char_pos": 16, "end_char_pos": 25}, {"type": "A", "before": null, "after": "the", "start_char_pos": 299, "end_char_pos": 299}, {"type": "R", "before": "largely", "after": "basically", "start_char_pos": 399, "end_char_pos": 406}, {"type": "D", "before": "not only is", "after": null, "start_char_pos": 456, "end_char_pos": 467}, {"type": "R", "before": "random but it is semi-deterministic", "after": "at all random but is largely deterministic", "start_char_pos": 505, "end_char_pos": 540}, {"type": "D", "before": ", which", "after": null, "start_char_pos": 758, "end_char_pos": 765}, {"type": "R", "before": "1, can be conveniently represented graphically", "after": "1. When inputting a time series of any security into the function, new mathematical objects emerge spontaneously", "start_char_pos": 875, "end_char_pos": 921}, {"type": "R", "before": ",", "after": "of the function is", "start_char_pos": 953, "end_char_pos": 954}, {"type": "R", "before": ", reveals the existence of new mathematical objects , which emerge spontaneously (they are not mathematically drawn). What is remarkable is that these objects,", "after": "and the emergent objects are", "start_char_pos": 986, "end_char_pos": 1145}, {"type": "R", "before": ",", "after": "(", "start_char_pos": 1178, "end_char_pos": 1179}, {"type": "R", "before": ",", "after": "). What is central to the function is that these cords", "start_char_pos": 1195, "end_char_pos": 1196}, {"type": "R", "before": "these", "after": "the", "start_char_pos": 1365, "end_char_pos": 1370}, {"type": "R", "before": "We can say that", "after": "Having a function that describes the evolution of the price,", "start_char_pos": 1441, "end_char_pos": 1456}, {"type": "R", "before": "price movements", "after": "each price movement", "start_char_pos": 1493, "end_char_pos": 1508}, {"type": "D", "before": "Note that time series data (not limited to financial) is input directly into the function without any fitting.", "after": null, "start_char_pos": 1577, "end_char_pos": 1687}, {"type": "R", "before": "(it is a one fits all function)", "after": ", does not rely on any fitting,", "start_char_pos": 1714, "end_char_pos": 1745}], "sents_char_pos": [0, 170, 239, 285, 442, 590, 744, 923, 1103, 1312, 1440, 1576, 1687]} {"doc_id": "1808.05464", "revision_depth": "1", "before_revision": "Almost all EEG-based brain-computer interfaces (BCIs) need some labeled subject-specific data to calibrate a new subject, as neural responses are different across subjects to even the same stimulus. So, a major challenge in developing high-performance and user-friendly BCIs is to cope with such individual differences so that the calibration can be reduced or even completely eliminated. This paper focuses on the latter. More specifically, we consider an offline application scenario, in which we have unlabeled EEG trials from a new subject, and would like to accurately label them by leveraging auxiliary labeled EEG trials from other subjects in the same task. To accommodate the individual differences, we propose a novel unsupervised approach to align the EEG trials from different subjects in the Euclidean space to make them more consistent. It has three desirable properties: 1) the aligned trial lie in the Euclidean space, which can be used by any Euclidean space signal processing and machine learning approach ; 2) it can be computed very efficiently ; and, 3) it does not need any labeled trials from the new subject. Experiments on motor imagery and event-related potentials demonstrated the effectiveness and efficiency of our approach .", "after_revision": "Objective: This paper targets a major challenge in developing practical EEG-based brain-computer interfaces (BCIs) : how to cope with individual differences so that better learning performance can be obtained for a new subject, with minimum or even no subject-specific data? Methods: We propose a novel approach to align EEG trials from different subjects in the Euclidean space to make them more similar, and hence improve the learning performance for a new subject. Our approach has three desirable properties: 1) it aligns the EEG trials directly in the Euclidean space, and any signal processing, feature extraction and machine learning algorithms can then be applied to the aligned trials ; 2) its computational cost is very low ; and, 3) it is unsupervised and does not need any label information from the new subject. Results: Both offline and simulated online experiments on motor imagery classification and event-related potential classification verified that our proposed approach outperformed a state-of-the-art Riemannian space data alignment approach, and several approaches without data alignment. Conclusion: The proposed Euclidean space EEG data alignment approach can greatly facilitate transfer learning in BCIs. Significance: Our proposed approach is effective, efficient, and easy to implement. It could be an essential pre-processing step for EEG-based BCIs .", "edit_actions": [{"type": "R", "before": "Almost all", "after": "Objective: This paper targets a major challenge in developing practical", "start_char_pos": 0, "end_char_pos": 10}, {"type": "R", "before": "need some labeled subject-specific data to calibrate a new subject, as neural responses are different across subjects to even the same stimulus. So, a major challenge in developing high-performance and user-friendly BCIs is to cope with such", "after": ": how to cope with", "start_char_pos": 54, "end_char_pos": 295}, {"type": "R", "before": "the calibration can be reduced or even completely eliminated. This paper focuses on the latter. More specifically, we consider an offline application scenario, in which we have unlabeled EEG trials from", "after": "better learning performance can be obtained for", "start_char_pos": 327, "end_char_pos": 529}, {"type": "R", "before": "and would like to accurately label them by leveraging auxiliary labeled EEG trials from other subjects in the same task. To accommodate the individual differences, we", "after": "with minimum or even no subject-specific data? Methods: We", "start_char_pos": 545, "end_char_pos": 711}, {"type": "D", "before": "unsupervised", "after": null, "start_char_pos": 728, "end_char_pos": 740}, {"type": "D", "before": "the", "after": null, "start_char_pos": 759, "end_char_pos": 762}, {"type": "R", "before": "consistent. It", "after": "similar, and hence improve the learning performance for a new subject. Our approach", "start_char_pos": 839, "end_char_pos": 853}, {"type": "R", "before": "the aligned trial lie", "after": "it aligns the EEG trials directly", "start_char_pos": 889, "end_char_pos": 910}, {"type": "R", "before": "which can be used by any Euclidean space signal processing", "after": "and any signal processing, feature extraction", "start_char_pos": 935, "end_char_pos": 993}, {"type": "R", "before": "approach", "after": "algorithms can then be applied to the aligned trials", "start_char_pos": 1015, "end_char_pos": 1023}, {"type": "R", "before": "it can be computed very efficiently", "after": "its computational cost is very low", "start_char_pos": 1029, "end_char_pos": 1064}, {"type": "A", "before": null, "after": "is unsupervised and", "start_char_pos": 1078, "end_char_pos": 1078}, {"type": "R", "before": "labeled trials", "after": "label information", "start_char_pos": 1097, "end_char_pos": 1111}, {"type": "R", "before": "Experiments", "after": "Results: Both offline and simulated online experiments", "start_char_pos": 1134, "end_char_pos": 1145}, {"type": "A", "before": null, "after": "classification", "start_char_pos": 1163, "end_char_pos": 1163}, {"type": "R", "before": "potentials demonstrated the effectiveness and efficiency of our approach", "after": "potential classification verified that our proposed approach outperformed a state-of-the-art Riemannian space data alignment approach, and several approaches without data alignment. Conclusion: The proposed Euclidean space EEG data alignment approach can greatly facilitate transfer learning in BCIs. Significance: Our proposed approach is effective, efficient, and easy to implement. It could be an essential pre-processing step for EEG-based BCIs", "start_char_pos": 1182, "end_char_pos": 1254}], "sents_char_pos": [0, 198, 388, 422, 665, 850, 1025, 1066, 1133]} {"doc_id": "1808.07768", "revision_depth": "2", "before_revision": "Jeandel and Rao proved that 11 is the size of the smallest set of Wang tiles, i.e., unit squares with colored edges, that admit valid (contiguous edges of adjacent tiles have the same color) tilings of the plane none of them being invariant under a nontrivial translation. In this contribution, we study the Wang shift \\Omega_0 made of all valid tilings using the set T_0 of 11 aperiodic Wang tiles discovered by Jeandel and Rao. We show that there exists a minimal subshift X_0 of \\Omega_0 such that any tiling in X_0 can be decomposed uniquely into 19 distinct patches of sizes ranging from 45 to 112 that are equivalent to a set of self-similar and aperiodic 19 Wang tiles. We think that this gives an almost complete description of the substitutive structure of Jeandel-Rao tilings as we believe that \\Omega_0\\setminus X_0 is a null set for any shift-invariant probability measure on \\Omega_0. The proof is based on twelve elementary stepswhere ten of them are using the same procedure allowing to desubstitute Wang tilings from the existence of a subset of marker tiles. The two other steps are adding decorations to deal with fault lines and are changing the base of the \\mathbb{Z}^2-action through a shear conjugacy. Algorithms are provided to find markers, recognizable substitutions and shear conjugacy from a set of Wang tiles.", "after_revision": "Jeandel and Rao proved that 11 is the size of the smallest set of Wang tiles, i.e., unit squares with colored edges, that admit valid tilings (contiguous edges of adjacent tiles have the same color) of the plane , none of them being invariant under a nontrivial translation. We study herein the Wang shift \\Omega_0 made of all valid tilings using the set T_0 of 11 aperiodic Wang tiles discovered by Jeandel and Rao. We show that there exists a minimal subshift X_0 of \\Omega_0 such that every tiling in X_0 can be decomposed uniquely into 19 distinct patches of sizes ranging from 45 to 112 that are equivalent to a set of 19 self-similar and aperiodic Wang tiles. We suggest that this provides an almost complete description of the substitutive structure of Jeandel-Rao tilings , as we believe that \\Omega_0\\setminus X_0 is a null set for any shift-invariant probability measure on \\Omega_0. The proof is based on 12 elementary steps, 10 of which involve the same procedure allowing one to desubstitute Wang tilings from the existence of a subset of marker tiles. The 2 other steps involve the addition of decorations to deal with fault lines and changing the base of the \\mathbb{Z}^2-action through a shear conjugacy. Algorithms are provided to find markers, recognizable substitutions , and shear conjugacy from a set of Wang tiles.", "edit_actions": [{"type": "A", "before": null, "after": "tilings", "start_char_pos": 134, "end_char_pos": 134}, {"type": "D", "before": "tilings", "after": null, "start_char_pos": 192, "end_char_pos": 199}, {"type": "A", "before": null, "after": ",", "start_char_pos": 213, "end_char_pos": 213}, {"type": "R", "before": "In this contribution, we study", "after": "We study herein", "start_char_pos": 275, "end_char_pos": 305}, {"type": "R", "before": "any", "after": "every", "start_char_pos": 503, "end_char_pos": 506}, {"type": "A", "before": null, "after": "19", "start_char_pos": 637, "end_char_pos": 637}, {"type": "D", "before": "19", "after": null, "start_char_pos": 665, "end_char_pos": 667}, {"type": "R", "before": "think that this gives", "after": "suggest that this provides", "start_char_pos": 683, "end_char_pos": 704}, {"type": "A", "before": null, "after": ",", "start_char_pos": 789, "end_char_pos": 789}, {"type": "R", "before": "twelve elementary stepswhere ten of them are using", "after": "12 elementary steps, 10 of which involve", "start_char_pos": 924, "end_char_pos": 974}, {"type": "A", "before": null, "after": "one", "start_char_pos": 1003, "end_char_pos": 1003}, {"type": "R", "before": "two other steps are adding", "after": "2 other steps involve the addition of", "start_char_pos": 1085, "end_char_pos": 1111}, {"type": "D", "before": "are", "after": null, "start_char_pos": 1153, "end_char_pos": 1156}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1297, "end_char_pos": 1297}], "sents_char_pos": [0, 274, 431, 679, 901, 1080, 1228]} {"doc_id": "1808.08563", "revision_depth": "3", "before_revision": "In an economy which could not accommodate the full employment of its labor force, it employs some labor but does not employ others. The bipartition of the labor force is random, and we characterize it by a compound Beta-Binomial probability distribution with equal employment opportunity. We value each employed individual by his or her marginal contribution to the production function; we also value each unemployed individual by the potential marginal contribution the person would make if the market hired the individual. We fully recognize both the individual value and its national aggregates in distributing the net production to the unemployment welfare and the employment benefits. Using a real-time balanced budget rule of taxation , we derive a fair, debt-free, and asymptotic risk-free tax rate for any given unemployment rate . The tax rate minimizes the asymptotic mean, variance, semi-variance, and mean absolute deviation of the underlying posterior unemployment rate. The allocation rule stimulates employment and boosts productivity. Under some symmetry assumptions, we find that an unemployed person should also enjoy equivalent employment benefits, and the tax rate goes with this welfare equality. The tool employed is the cooperative game theory in which we assume a large number of players. The players are randomly bi-partitioned , and the payoff varies with the partition. Thus, one could apply the fair distribution rule and valuation approach to other profit-sharing or cost-sharing situations with similar characteristics. This framework is open to alternative identification strategies and other forms of equal opportunity .", "after_revision": "In an economy which could not accommodate the full employment of its labor force, it employs some labor but does not employ others. The bipartition of the labor force is random, and we characterize it by an axiom of equal employment opportunity. We value each employed individual by his or her marginal contribution to the production function; we also value each unemployed individual by the potential marginal contribution the person would make if the market hired the individual. We then use the aggregate individual value to distribute the net production to the unemployment welfare and the employment benefits. Using real-time balanced-budget rule as a constraint and policy stability as an objective , we derive a scientific formula which describes a fair, debt-free, and asymptotic risk-free tax rate for any given unemployment rate and national spending level . The tax rate minimizes the asymptotic mean, variance, semi-variance, and mean absolute deviation of the underlying posterior unemployment rate. The allocation rule stimulates employment and boosts productivity. Under some symmetry assumptions, we even find that an unemployed person should enjoy equivalent employment benefits, and the tax rate goes with this welfare equality. The tool employed is the cooperative game theory in which we assume many players. The players are randomly bipartitioned , and the payoff varies with the partition. One could apply the fair distribution rule and valuation approach to other profit-sharing or cost-sharing situations with these characteristics. This framework is open to alternative identification strategies and other forms of equal opportunity axiom .", "edit_actions": [{"type": "R", "before": "a compound Beta-Binomial probability distribution with", "after": "an axiom of", "start_char_pos": 204, "end_char_pos": 258}, {"type": "R", "before": "fully recognize both the individual value and its national aggregates in distributing", "after": "then use the aggregate individual value to distribute", "start_char_pos": 528, "end_char_pos": 613}, {"type": "D", "before": "a", "after": null, "start_char_pos": 696, "end_char_pos": 697}, {"type": "R", "before": "balanced budget rule of taxation", "after": "balanced-budget rule as a constraint and policy stability as an objective", "start_char_pos": 708, "end_char_pos": 740}, {"type": "A", "before": null, "after": "scientific formula which describes a", "start_char_pos": 755, "end_char_pos": 755}, {"type": "A", "before": null, "after": "and national spending level", "start_char_pos": 839, "end_char_pos": 839}, {"type": "A", "before": null, "after": "even", "start_char_pos": 1089, "end_char_pos": 1089}, {"type": "D", "before": "also", "after": null, "start_char_pos": 1128, "end_char_pos": 1132}, {"type": "R", "before": "a large number of", "after": "many", "start_char_pos": 1289, "end_char_pos": 1306}, {"type": "R", "before": "bi-partitioned", "after": "bipartitioned", "start_char_pos": 1341, "end_char_pos": 1355}, {"type": "R", "before": "Thus, one", "after": "One", "start_char_pos": 1400, "end_char_pos": 1409}, {"type": "R", "before": "similar", "after": "these", "start_char_pos": 1528, "end_char_pos": 1535}, {"type": "A", "before": null, "after": "axiom", "start_char_pos": 1654, "end_char_pos": 1654}], "sents_char_pos": [0, 131, 288, 386, 524, 689, 841, 985, 1052, 1220, 1315, 1399, 1552]} {"doc_id": "1809.07300", "revision_depth": "1", "before_revision": "We present a novel method for the numerical pricing of American options based on Monte Carlo simulation and optimization of exercise strategies. Previous solutions to this problem either explicitly or implicitly determine so-called optimal exercise regions , which consist of points in time and space at which the option is exercised. In contrast, our method determines exercise rates of randomized exercise strategies. We show that the supremum of the corresponding stochastic optimization problem provides the correct option price. By integrating analytically over the random exercise decision, we obtain an objective function that is differentiable with respect to perturbations of the exercise rate even for finitely many sample paths. Starting in a neutral strategy with constant exercise rate then allows us to globally optimize this function in a gradual manner . Numerical experiments on vanilla put options in the multivariate Black--Scholes model and preliminary theoretical analysis underline the efficiency of our method both with respect to the number of time-discretization steps and the required number of degrees of freedom in the parametrization of exercise rates. Finally, the flexibility of our method is demonstrated by numerical experiments on max call options in the Black--Scholes model and vanilla put options in Heston model and the non-Markovian rough Bergomi model.", "after_revision": "We present a novel method for the numerical pricing of American options based on Monte Carlo simulation and the optimization of exercise strategies. Previous solutions to this problem either explicitly or implicitly determine so-called optimal exercise regions , which consist of points in time and space at which a given option is exercised. In contrast, our method determines the exercise rates of randomized exercise strategies. We show that the supremum of the corresponding stochastic optimization problem provides the correct option price. By integrating analytically over the random exercise decision, we obtain an objective function that is differentiable with respect to perturbations of the exercise rate even for finitely many sample paths. The global optimum of this function can be approached gradually when starting from a constant exercise rate . Numerical experiments on vanilla put options in the multivariate Black-Scholes model and a preliminary theoretical analysis underline the efficiency of our method , both with respect to the number of time-discretization steps and the required number of degrees of freedom in the parametrization of the exercise rates. Finally, we demonstrate the flexibility of our method through numerical experiments on max call options in the classical Black-Scholes model, and vanilla put options in both the Heston model and the non-Markovian rough Bergomi model.", "edit_actions": [{"type": "A", "before": null, "after": "the", "start_char_pos": 108, "end_char_pos": 108}, {"type": "R", "before": "exercise regions", "after": "exercise regions", "start_char_pos": 241, "end_char_pos": 257}, {"type": "R", "before": "the", "after": "a given", "start_char_pos": 311, "end_char_pos": 314}, {"type": "R", "before": "exercise rates", "after": "the exercise rates", "start_char_pos": 371, "end_char_pos": 385}, {"type": "R", "before": "Starting in a neutral strategy with", "after": "The global optimum of this function can be approached gradually when starting from a", "start_char_pos": 741, "end_char_pos": 776}, {"type": "D", "before": "then allows us to globally optimize this function in a gradual manner", "after": null, "start_char_pos": 800, "end_char_pos": 869}, {"type": "R", "before": "Black--Scholes model and", "after": "Black-Scholes model and a", "start_char_pos": 937, "end_char_pos": 961}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1034, "end_char_pos": 1034}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1168, "end_char_pos": 1168}, {"type": "A", "before": null, "after": "we demonstrate", "start_char_pos": 1194, "end_char_pos": 1194}, {"type": "R", "before": "is demonstrated by", "after": "through", "start_char_pos": 1225, "end_char_pos": 1243}, {"type": "R", "before": "Black--Scholes model", "after": "classical Black-Scholes model,", "start_char_pos": 1293, "end_char_pos": 1313}, {"type": "A", "before": null, "after": "both the", "start_char_pos": 1341, "end_char_pos": 1341}], "sents_char_pos": [0, 145, 335, 420, 534, 740, 1184]} {"doc_id": "1809.10269", "revision_depth": "1", "before_revision": "In this paper we consider the classical min--\\# curve simplification problem in three different variants. Let \\delta>0, P be a polygonal curve with n vertices in \\mathbb{R^d, and D(\\cdot,\\cdot) be a distance measure. We aim to simplify P by } another polygonal curve P' with minimum number of vertices satisfying D(P,P' ) \\leq \\delta. We obtain three main results for this problem: (1) An O(n^4)-time algorithm when D(P,P') is the Fr\\'echet distance and vertices in P' are selected from a subsequence of vertices in P. (2) An \\emph{ NP-hardness result for the case that D(P ,P') is the directed Hausdorff distance from P' to P and the vertices of P' can lie anywhere on P while respecting the order of edges along P. (3) For any \\epsilon>0, an O^*(n^2\\log n \\log \\log n)-time algorithm that computes P'whose vertices can lie anywhere in the space and whose Fr\\'echet distance to P is at most (1+\\epsilon)\\delta with at most 2m+1 links, where m is the number of links in the optimal simplified curve and O^* hides polynomial factors of 1/\\epsilon .", "after_revision": "Due to its many applications,curve simplification is a long-studied problem in computational geometry and adjacent disciplines, such as graphics, geographical information science, etc. Given a polygonal curve P with n vertices ^d, and D(\\cdot,\\cdot) be a distance measure. We aim to simplify P by } , the goal is to find another polygonal curve P' with a smaller number of vertices such that P' is sufficiently similar to P. Quality guarantees of a simplification are usually given in alocal sense, bounding the distance between a shortcut and its corresponding section of the curve. In this work, we aim to provide a systematic overview of curve simplification problems underglobal distance measures that bound the distance between P and P'. We consider six different curve distance measures: three variants of theHausdorff distance and three variants of the\\emph{Fr\\'echet distance. And we study different restrictions on the choice of vertices for P'. We provide polynomial-time algorithms for some variants of the global curve simplification problem and show NP-hardness for other variants. Through this systematic study we observe, for the first time, some surprising patterns, and suggest directions for future research in this important area .", "edit_actions": [{"type": "R", "before": "In this paper we consider the classical min--\\# curve simplification problem in three different variants. Let \\delta>0, P be", "after": "Due to its many applications,", "start_char_pos": 0, "end_char_pos": 124}, {"type": "A", "before": null, "after": "curve simplification", "start_char_pos": 124, "end_char_pos": 124}, {"type": "A", "before": null, "after": "is a long-studied problem in computational geometry and adjacent disciplines, such as graphics, geographical information science, etc. Given", "start_char_pos": 125, "end_char_pos": 125}, {"type": "A", "before": null, "after": "P", "start_char_pos": 144, "end_char_pos": 144}, {"type": "D", "before": "in \\mathbb{R", "after": null, "start_char_pos": 161, "end_char_pos": 173}, {"type": "A", "before": null, "after": ", the goal is to find", "start_char_pos": 245, "end_char_pos": 245}, {"type": "R", "before": "minimum", "after": "a smaller", "start_char_pos": 278, "end_char_pos": 285}, {"type": "R", "before": "satisfying D(P,P' ) \\leq \\delta. We obtain three main results for this problem: (1) An O(n^4)-time algorithm when D(P,P') is the Fr\\'echet distance and vertices in P' are selected from a subsequence of vertices in P. (2) An", "after": "such that P' is sufficiently similar to P. Quality guarantees of a simplification are usually given in a", "start_char_pos": 305, "end_char_pos": 528}, {"type": "A", "before": null, "after": "local", "start_char_pos": 528, "end_char_pos": 528}, {"type": "A", "before": null, "after": "sense, bounding the distance between a shortcut and its corresponding section of the curve. In this work, we aim to provide a systematic overview of curve simplification problems under", "start_char_pos": 529, "end_char_pos": 529}, {"type": "A", "before": null, "after": "global", "start_char_pos": 529, "end_char_pos": 529}, {"type": "A", "before": null, "after": "distance measures that bound the distance between P and P'. We consider six different curve distance measures: three variants of the", "start_char_pos": 530, "end_char_pos": 530}, {"type": "A", "before": null, "after": "Hausdorff", "start_char_pos": 530, "end_char_pos": 530}, {"type": "A", "before": null, "after": "distance and three variants of the", "start_char_pos": 531, "end_char_pos": 531}, {"type": "A", "before": null, "after": "Fr\\'echet", "start_char_pos": 537, "end_char_pos": 537}, {"type": "A", "before": null, "after": "distance. And we study different restrictions on the choice of vertices for P'. We provide polynomial-time algorithms for some variants of the global curve simplification problem and show", "start_char_pos": 538, "end_char_pos": 538}, {"type": "R", "before": "result for the case that D(P ,P') is the directed Hausdorff distance from P' to P and the vertices of P' can lie anywhere on P while respecting the order of edges along P. (3) For any \\epsilon>0, an O^*(n^2\\log n \\log \\log n)-time algorithm that computes P'whose vertices can lie anywhere in the space and whose Fr\\'echet distance to P is at most (1+\\epsilon)\\delta with at most 2m+1 links, where m is the number of links in the optimal simplified curve and O^* hides polynomial factors of 1/\\epsilon", "after": "for other variants. Through this systematic study we observe, for the first time, some surprising patterns, and suggest directions for future research in this important area", "start_char_pos": 551, "end_char_pos": 1051}], "sents_char_pos": [0, 105, 218, 337, 384, 426, 471, 525, 584]} {"doc_id": "1810.01576", "revision_depth": "1", "before_revision": "It is standard practice in applied work to study the effect of a binary variable (\"treatment\") on an outcome of interest using linear models with additive effects. In this paper I study the interpretation of the ordinary and two-stage least squares estimands in such models when treatment effects are in fact heterogeneous. I show that in both cases the coefficient on treatment is identical to a convex combination of two other parameters(different for OLS and 2SLS), which can be interpreted as the average treatment effects on the treated and controls under additional assumptions. Importantly, the OLS and 2SLS weights on these parameters are inversely related to the proportion of each group. The more units get treatment, the less weight is placed on the effect on the treated. What follows, the reliance on these implicit weights can have serious consequences for applied work . I illustrate some of these issues in four empirical applicationsfrom different fields of economics. I also develop a weighted least squares correction and simple diagnostic tools that applied researchers can use to avoid potential biases . In an important special case, my diagnostics only require the knowledge of the proportion of treated units.", "after_revision": "Applied work often studies the effect of a binary variable (\"treatment\") using linear models with additive effects. I study the interpretation of the OLS estimands in such models when treatment effects are heterogeneous. I show that the treatment coefficient is a convex combination of two parameters, which under certain conditions can be interpreted as the average treatment effects on the treated and untreated. The weights on these parameters are inversely related to the proportion of observations in each group. Reliance on these implicit weights can have serious consequences for applied work , as I illustrate with two well-known applications. I develop simple diagnostic tools that empirical researchers can use to avoid potential biases . Software for implementing these methods is available in R and Stata . In an important special case, my diagnostics only require the knowledge of the proportion of treated units.", "edit_actions": [{"type": "R", "before": "It is standard practice in applied work to study", "after": "Applied work often studies", "start_char_pos": 0, "end_char_pos": 48}, {"type": "D", "before": "on an outcome of interest", "after": null, "start_char_pos": 95, "end_char_pos": 120}, {"type": "D", "before": "In this paper", "after": null, "start_char_pos": 164, "end_char_pos": 177}, {"type": "R", "before": "ordinary and two-stage least squares", "after": "OLS", "start_char_pos": 212, "end_char_pos": 248}, {"type": "D", "before": "in fact", "after": null, "start_char_pos": 301, "end_char_pos": 308}, {"type": "R", "before": "in both cases the coefficient on treatment is identical to", "after": "the treatment coefficient is", "start_char_pos": 336, "end_char_pos": 394}, {"type": "R", "before": "other parameters(different for OLS and 2SLS), which", "after": "parameters, which under certain conditions", "start_char_pos": 423, "end_char_pos": 474}, {"type": "R", "before": "controls under additional assumptions. Importantly, the OLS and 2SLS", "after": "untreated. The", "start_char_pos": 546, "end_char_pos": 614}, {"type": "A", "before": null, "after": "observations in", "start_char_pos": 686, "end_char_pos": 686}, {"type": "R", "before": "The more units get treatment, the less weight is placed on the effect on the treated. What follows, the reliance on", "after": "Reliance on", "start_char_pos": 699, "end_char_pos": 814}, {"type": "R", "before": ". I illustrate some of these issues in four empirical applicationsfrom different fields of economics. I also develop a weighted least squares correction and", "after": ", as I illustrate with two well-known applications. I develop", "start_char_pos": 885, "end_char_pos": 1041}, {"type": "R", "before": "applied", "after": "empirical", "start_char_pos": 1071, "end_char_pos": 1078}, {"type": "A", "before": null, "after": ". Software for implementing these methods is available in R and Stata", "start_char_pos": 1125, "end_char_pos": 1125}], "sents_char_pos": [0, 163, 323, 584, 698, 784, 886, 986, 1127]} {"doc_id": "1810.05815", "revision_depth": "1", "before_revision": "It has been developed a model of the DNA in MATLAB , where it has been taken into account each one of the component atoms. It is possible to have a sequence length of even 10000 basis pairs with the possibility for introducing all types of sequences. It was studied the DNA damage in a single strain and in double strain, SSB and DSB respectively as a product of ionising radiation from X-rays when interacting with the DNA immersed in water. This is a theoretical and experimental study in-vitro that quantifies the SSB and DSB with respect to different Gy's of radiation, this allows the understanding and prediction about the exact risks of the exposition. It has been developed for energies corresponding to the 17.6 KeV however the energy parameters are also variable which allows the simulation of all type of ionising radiation. For this simulation it is also taken into account the indirect damage as a product of the free electrons and radicals from the water effects. The information of the spatial distribution of the electrones is obtained form Geant4 and afterwards it is implemented in Matlab where rays are created with tri-dimensional random trajectories through Monte Carlo simulations. The experimental confirmation was developed by radiating DNA samples immersed in water with a X-rays unit with Molibdeno targetand it is observed and quantified the damage level through Atomic Force Microscopy (AFM). It was obtained a direct relation between the damage and the radiation dose in the experiment and in the model and it is concluded that for 17.6 KeV the deterioration for interaction is observed very low doses but the mutagenic damage only appears until the 17 Gy .", "after_revision": "This paper describes the model for DNA in MATLAB taking into account all of component atoms. In this model, it is possible to generate sequences with length 10000 basis pairs available for introducing all types of sequences. Once the strands are generated, it is studied the DNA damage in the single strand and double strand. The damage are outcomes of ionising radiation of X-rays when interacting with the DNA immersed in water. This is a theoretical and experimental in-vitro study that quantifies the single strand and double strand damage for different doses of radiation. This can be useful to predict the exact risks of expositions to radiations. In simulations, it is taken into account the damage caused by free electrons generated by the effect of the interaction with the water molecules, this is different to the effect considered in radiobiology, where indirect damages are due to chemical reactions. The spatial distribution of the electrons is obtained from Geant4 and here this distribution is used for the creation of rays as three-dimensional random trajectories through Monte Carlo simulations. It is also presented the experimental DNA damage through radiating DNA samples immersed in water with a X-rays unit with Molybdenum target. The damage level is quantified through Atomic Force Microscopy (AFM). It is possible to conclude a direct relation between the damage and the radiation doses with the experimental results .", "edit_actions": [{"type": "R", "before": "It has been developed a model of the", "after": "This paper describes the model for", "start_char_pos": 0, "end_char_pos": 36}, {"type": "R", "before": ", where it has been taken into account each one of the", "after": "taking into account all of", "start_char_pos": 51, "end_char_pos": 105}, {"type": "R", "before": "It", "after": "In this model, it", "start_char_pos": 123, "end_char_pos": 125}, {"type": "R", "before": "have a sequence length of even", "after": "generate sequences with length", "start_char_pos": 141, "end_char_pos": 171}, {"type": "R", "before": "with the possibility", "after": "available", "start_char_pos": 190, "end_char_pos": 210}, {"type": "R", "before": "It was", "after": "Once the strands are generated, it is", "start_char_pos": 251, "end_char_pos": 257}, {"type": "R", "before": "a single strain and in double strain, SSB and DSB respectively as a product", "after": "the single strand and double strand. The damage are outcomes", "start_char_pos": 284, "end_char_pos": 359}, {"type": "R", "before": "from", "after": "of", "start_char_pos": 382, "end_char_pos": 386}, {"type": "D", "before": "study", "after": null, "start_char_pos": 482, "end_char_pos": 487}, {"type": "A", "before": null, "after": "study", "start_char_pos": 497, "end_char_pos": 497}, {"type": "R", "before": "SSB and DSB with respect to different Gy's of radiation, this allows the understanding and prediction about the", "after": "single strand and double strand damage for different doses of radiation. This can be useful to predict the", "start_char_pos": 518, "end_char_pos": 629}, {"type": "R", "before": "the exposition. It has been developed for energies corresponding to the 17.6 KeV however the energy parameters are also variable which allows the simulation of all type of ionising radiation. For this simulation it is also", "after": "expositions to radiations. In simulations, it is", "start_char_pos": 645, "end_char_pos": 867}, {"type": "R", "before": "indirect damage as a product of the free electrons and radicals from the water effects. The information of the", "after": "damage caused by free electrons generated by the effect of the interaction with the water molecules, this is different to the effect considered in radiobiology, where indirect damages are due to chemical reactions. The", "start_char_pos": 891, "end_char_pos": 1001}, {"type": "R", "before": "electrones is obtained form", "after": "electrons is obtained from", "start_char_pos": 1030, "end_char_pos": 1057}, {"type": "R", "before": "afterwards it is implemented in Matlab where rays are created with tri-dimensional", "after": "here this distribution is used for the creation of rays as three-dimensional", "start_char_pos": 1069, "end_char_pos": 1151}, {"type": "R", "before": "The experimental confirmation was developed by", "after": "It is also presented the experimental DNA damage through", "start_char_pos": 1205, "end_char_pos": 1251}, {"type": "R", "before": "Molibdeno targetand it is observed and quantified the damage level", "after": "Molybdenum target. The damage level is quantified", "start_char_pos": 1316, "end_char_pos": 1382}, {"type": "R", "before": "was obtained", "after": "is possible to conclude", "start_char_pos": 1425, "end_char_pos": 1437}, {"type": "R", "before": "dose in the experiment and in the model and it is concluded that for 17.6 KeV the deterioration for interaction is observed very low doses but the mutagenic damage only appears until the 17 Gy", "after": "doses with the experimental results", "start_char_pos": 1493, "end_char_pos": 1685}], "sents_char_pos": [0, 122, 250, 442, 660, 836, 978, 1204, 1421]} {"doc_id": "1810.09945", "revision_depth": "1", "before_revision": "The analysis of neuroimaging data poses several strong challenges, in particular, due to its high dimensionality, its strong spatio-temporal correlation and the comparably small sample sizes of the respective datasets. To address these challenges, conventional decoding approaches such as the searchlight reduce the complexity of the decoding problem by considering local clusters of voxels only. Thereby, neglecting the distributed spatial patterns of brain activity underlying many cognitive states. In this work , we introduce the DLight framework, which overcomes these challenges by utilizing a long short-term memory unit (LSTM) based deep neural network architecture to analyze the spatial dependency structure of whole-brain fMRI data. In order to maintain interpretability of the neuroimaging data, we adapt the layer-wise relevance propagation (LRP) method . Thereby, we enable the neuroscientist user to study the learned association of the LSTM between the data and the cognitive state of the individual. We demonstrate the versatility of DLight by applying it to a large fMRI dataset of the Human Connectome Project. We show that the decoding performance of our method scales better with large datasets, and moreover outperforms conventional decoding approaches , while still detecting physiologically appropriate brain areas for the cognitive statesclassified. We also demonstrate that DLight is able to detect these areas on several levels of data granularity (i.e., group, subject, trial, time point) .", "after_revision": "The application of deep learning (DL) models to neuroimaging data poses several challenges, due to the high dimensionality, low sample size and complex temporo-spatial dependency structure of these datasets. Even further, DL models act as as black-box models, impeding insight into the association of cognitive state and brain activity. To approach these challenges , we introduce the DeepLight framework, which utilizes long short-term memory (LSTM) based DL models to analyze whole-brain functional Magnetic Resonance Imaging (fMRI) data. To decode a cognitive state (e.g., seeing the image of a house), DeepLight separates the fMRI volume into a sequence of axial brain slices, which is then sequentially processed by an LSTM. To maintain interpretability, DeepLight adapts the layer-wise relevance propagation (LRP) technique . Thereby, decomposing its decoding decision into the contributions of the single input voxels to this decision. Importantly, the decomposition is performed on the level of single fMRI volumes, enabling DeepLight to study the associations between cognitive state and brain activity on several levels of data granularity, from the level of the group down to the level of single time points. To demonstrate the versatility of DeepLight, we apply it to a large fMRI dataset of the Human Connectome Project. We show that DeepLight outperforms conventional approaches of uni- and multivariate fMRI analysis in decoding the cognitive states and in identifying the physiologically appropriate brain regions associated with these states. We further demonstrate DeepLight's ability to study the fine-grained temporo-spatial variability of brain activity over sequences of single fMRI samples .", "edit_actions": [{"type": "R", "before": "analysis of", "after": "application of deep learning (DL) models to", "start_char_pos": 4, "end_char_pos": 15}, {"type": "R", "before": "strong challenges, in particular, due to its", "after": "challenges, due to the", "start_char_pos": 48, "end_char_pos": 92}, {"type": "R", "before": "its strong spatio-temporal correlation and the comparably small sample sizes of the respective datasets. To address these challenges, conventional decoding approaches such as the searchlight reduce the complexity of the decoding problem by considering local clusters of voxels only. Thereby, neglecting the distributed spatial patterns of brain activity underlying many cognitive states. In this work", "after": "low sample size and complex temporo-spatial dependency structure of these datasets. Even further, DL models act as as black-box models, impeding insight into the association of cognitive state and brain activity. To approach these challenges", "start_char_pos": 114, "end_char_pos": 514}, {"type": "R", "before": "DLight", "after": "DeepLight", "start_char_pos": 534, "end_char_pos": 540}, {"type": "R", "before": "overcomes these challenges by utilizing a", "after": "utilizes", "start_char_pos": 558, "end_char_pos": 599}, {"type": "D", "before": "unit", "after": null, "start_char_pos": 623, "end_char_pos": 627}, {"type": "R", "before": "deep neural network architecture to analyze the spatial dependency structure of", "after": "DL models to analyze", "start_char_pos": 641, "end_char_pos": 720}, {"type": "R", "before": "fMRI data. In order to maintain interpretability of", "after": "functional Magnetic Resonance Imaging (fMRI) data. To decode a cognitive state (e.g., seeing the image of a house), DeepLight separates the fMRI volume into a sequence of axial brain slices, which is then sequentially processed by an LSTM. To maintain interpretability, DeepLight adapts", "start_char_pos": 733, "end_char_pos": 784}, {"type": "D", "before": "neuroimaging data, we adapt the", "after": null, "start_char_pos": 789, "end_char_pos": 820}, {"type": "R", "before": "method", "after": "technique", "start_char_pos": 860, "end_char_pos": 866}, {"type": "R", "before": "we enable the neuroscientist user to study the learned association of the LSTM between the data and the cognitive state of the individual. We", "after": "decomposing its decoding decision into the contributions of the single input voxels to this decision. Importantly, the decomposition is performed on the level of single fMRI volumes, enabling DeepLight to study the associations between cognitive state and brain activity on several levels of data granularity, from the level of the group down to the level of single time points. To", "start_char_pos": 878, "end_char_pos": 1019}, {"type": "R", "before": "DLight by applying", "after": "DeepLight, we apply", "start_char_pos": 1051, "end_char_pos": 1069}, {"type": "R", "before": "the decoding performance of our method scales better with large datasets, and moreover outperforms conventional decoding approaches , while still detecting", "after": "DeepLight outperforms conventional approaches of uni- and multivariate fMRI analysis in decoding the cognitive states and in identifying the", "start_char_pos": 1143, "end_char_pos": 1298}, {"type": "R", "before": "areas for the cognitive statesclassified. We also demonstrate that DLight is able to detect these areas on several levels of data granularity (i.e., group, subject, trial, time point)", "after": "regions associated with these states. We further demonstrate DeepLight's ability to study the fine-grained temporo-spatial variability of brain activity over sequences of single fMRI samples", "start_char_pos": 1333, "end_char_pos": 1516}], "sents_char_pos": [0, 218, 396, 501, 743, 868, 1016, 1129, 1374]} {"doc_id": "1810.12898", "revision_depth": "1", "before_revision": "We propose a neural field model of color perception in context , for the visual area V1 in the cortex. This model reconciles into a common framework two opposing perceptual phenomena, simultaneous contrast and chromatic assimilation. Previous works showed that they act simultaneously, and can produce larger shifts in color matching when acting in synergy with a spatial pattern. At some point in an image, the color perceptually seems more similar to that of the adjacent locations , while being more dissimilar from that of remote neighbors. The influence of neighbors hence reverses its nature above some characteristic scale . Our model fully exploits the balance between attraction and repulsion in color space, combined at small or large scales in physical space. For that purpose we rely on the opponent color theory introduced by Hering, and suppose a hypercolumnar structure coding for colors. At some neural mass, the pointwise influence of neighbors is spatially integrated to obtain the final effect that we call a color sensation. Alongside this neural field model, we describe the search for a color match in asymmetric matching experiments as a mathematical projector . We validate it by fitting the parameters of the model to data from (Monnier and Shevell, 2004) and (Monnier, 2008) and our own data . All the results show that we are able to explain the nonlinear behavior of the observed shifts along one or two dimensions in color space, which cannot be done using a simple linear model.", "after_revision": "We address the question of color-space interactions in the brain, by proposing a neural field model of color perception with spatial context for the visual area V1 of the cortex. Our framework reconciles two opposing perceptual phenomena, known as simultaneous contrast and chromatic assimilation. They have been previously shown to act synergistically, so that at some point in an image, the color seems perceptually more similar to that of adjacent neighbors , while being more dissimilar from that of remote ones. Thus, their combined effects are enhanced in the presence of a spatial pattern, and can be measured as larger shifts in color matching experiments . Our model supposes a hypercolumnar structure coding for colors in V1, and relies on the notion of color opponency introduced by Hering. The connectivity kernel of the neural field exploits the balance between attraction and repulsion in color and physical spaces, so as to reproduce the sign reversal in the influence of neighboring points. The color sensation at a point, defined from a steady state of the neural activities, is then extracted as a nonlinear percept conveyed by an assembly of neurons. It connects the cortical and perceptual levels, because we describe the search for a color match in asymmetric matching experiments as a mathematical projection on color sensations . We validate our color neural field alongside this color matching framework, by performing a multi-parameter regression to data produced by psychophysicists and ourselves . All the results show that we are able to explain the nonlinear behavior of shifts observed along one or two dimensions in color space, which cannot be done using a simple linear model.", "edit_actions": [{"type": "R", "before": "propose", "after": "address the question of color-space interactions in the brain, by proposing", "start_char_pos": 3, "end_char_pos": 10}, {"type": "R", "before": "in context ,", "after": "with spatial context", "start_char_pos": 52, "end_char_pos": 64}, {"type": "R", "before": "in", "after": "of", "start_char_pos": 88, "end_char_pos": 90}, {"type": "R", "before": "This model reconciles into a common framework", "after": "Our framework reconciles", "start_char_pos": 103, "end_char_pos": 148}, {"type": "A", "before": null, "after": "known as", "start_char_pos": 184, "end_char_pos": 184}, {"type": "R", "before": "Previous works showed that they act simultaneously, and can produce larger shifts in color matching when acting in synergy with a spatial pattern. At", "after": "They have been previously shown to act synergistically, so that at", "start_char_pos": 235, "end_char_pos": 384}, {"type": "R", "before": "perceptually seems", "after": "seems perceptually", "start_char_pos": 419, "end_char_pos": 437}, {"type": "R", "before": "the adjacent locations", "after": "adjacent neighbors", "start_char_pos": 462, "end_char_pos": 484}, {"type": "R", "before": "neighbors. The influence of neighbors hence reverses its nature above some characteristic scale", "after": "ones. Thus, their combined effects are enhanced in the presence of a spatial pattern, and can be measured as larger shifts in color matching experiments", "start_char_pos": 535, "end_char_pos": 630}, {"type": "R", "before": "fully", "after": "supposes a hypercolumnar structure coding for colors in V1, and relies on the notion of color opponency introduced by Hering. The connectivity kernel of the neural field", "start_char_pos": 643, "end_char_pos": 648}, {"type": "R", "before": "space, combined at small or large scales in physical space. For that purpose we rely on the opponent color theory introduced by Hering, and suppose a hypercolumnar structure coding for colors. At some neural mass, the pointwise influence of neighbors is spatially integrated to obtain the final effect that we call a color sensation. Alongside this neural field model,", "after": "and physical spaces, so as to reproduce the sign reversal in the influence of neighboring points. The color sensation at a point, defined from a steady state of the neural activities, is then extracted as a nonlinear percept conveyed by an assembly of neurons. It connects the cortical and perceptual levels, because", "start_char_pos": 712, "end_char_pos": 1080}, {"type": "R", "before": "projector", "after": "projection on color sensations", "start_char_pos": 1175, "end_char_pos": 1184}, {"type": "R", "before": "it by fitting the parameters of the model to data from (Monnier and Shevell, 2004) and (Monnier, 2008) and our own data", "after": "our color neural field alongside this color matching framework, by performing a multi-parameter regression to data produced by psychophysicists and ourselves", "start_char_pos": 1199, "end_char_pos": 1318}, {"type": "R", "before": "the observed shifts", "after": "shifts observed", "start_char_pos": 1396, "end_char_pos": 1415}], "sents_char_pos": [0, 102, 234, 381, 545, 632, 771, 904, 1045, 1186, 1320]} {"doc_id": "1811.03620", "revision_depth": "1", "before_revision": "Diffusion kurtosis imaging (DKI), is an imaging modality that yields novel disease biomarkers and provides access to microstructural parameters. DKI and subsequent estimation of microstructural model parameters has been commonly used for assessment of tissue changes in neurodegenerative diseases and the animal modelsof such diseases . In this study, mice spinal cords from the experimental autoimmune encephalomyelitis (EAE) model of multiple sclerosis (MS) were investigated for the first time using this modality in combination with biophysical modeling to reveal the relationship between microstructural metrics and clinical disability. Thirteen EAE spinal cords of variable disability were extracted, dissected and subsequently scanned in a high-field MRI scanner along with 5 control specimen. The diffusion weighted data were acquired together with high resolution T2* images. Diffusion weighted data were fit to estimate diffusion and kurtosis tensors and white matter modeling parameters, which were all used for subsequent statistical analysis using a linear mixed effects model. T2* images were used to delineate focal demyelination/inflammation. Our results show strong relationship between disability and mean of the kurtosis tensor, radial kurtosis, radial diffusivity, similar to what was found in other hypomyelinating MS models and in patients. However, changes in WM-modeling parameters and in particular in extra-axonal axial diffusivity are clearly different from previous studies using other animal models of MS. Our data suggest that DKI and microstructural modeling can provide a unique contrast capable of detecting EAE-specific changes in normal appearing white matter and gray matter correlating with clinical disability. These findings could close the gap between MRI findings and clinical presentation in patients and deepen our understanding of EAE and MS mechanisms.", "after_revision": "Diffusion kurtosis imaging (DKI), is an imaging modality that yields novel disease biomarkers and in combination with nervous tissue modeling, provides access to microstructural parameters. Recently, DKI and subsequent estimation of microstructural model parameters has been used for assessment of tissue changes in neurodegenerative diseases and their animal models . In this study, mouse spinal cords from the experimental autoimmune encephalomyelitis (EAE) model of multiple sclerosis (MS) were investigated for the first time using DKI in combination with biophysical modeling to study the relationship between microstructural metrics and degree of animal dysfunction. Thirteen spinal cords were extracted from animals of variable disability and scanned in a high-field MRI scanner along with five control specimen. Diffusion weighted data were acquired together with high resolution T2* images. Diffusion data were fit to estimate diffusion and kurtosis tensors and white matter modeling parameters, which were all used for subsequent statistical analysis using a linear mixed effects model. T2* images were used to delineate focal demyelination/inflammation. Our results unveil a strong relationship between disability and measured microstructural parameters in normal appearing white matter and gray matter. The changes we found in biophysical modeling parameters and in particular in extra-axonal axial diffusivity were clearly different from previous studies employing other animal models of MS. In conclusion, our data suggest that DKI and microstructural modeling can provide a unique contrast capable of detecting EAE-specific changes correlating with clinical disability. These findings could close the gap between MRI findings and clinical presentation in patients and deepen our understanding of EAE and the MS mechanisms.", "edit_actions": [{"type": "A", "before": null, "after": "in combination with nervous tissue modeling,", "start_char_pos": 98, "end_char_pos": 98}, {"type": "A", "before": null, "after": "Recently,", "start_char_pos": 146, "end_char_pos": 146}, {"type": "D", "before": "commonly", "after": null, "start_char_pos": 222, "end_char_pos": 230}, {"type": "R", "before": "the animal modelsof such diseases", "after": "their animal models", "start_char_pos": 303, "end_char_pos": 336}, {"type": "R", "before": "mice", "after": "mouse", "start_char_pos": 354, "end_char_pos": 358}, {"type": "R", "before": "this modality", "after": "DKI", "start_char_pos": 505, "end_char_pos": 518}, {"type": "R", "before": "reveal", "after": "study", "start_char_pos": 563, "end_char_pos": 569}, {"type": "R", "before": "clinical disability. Thirteen EAE spinal cords", "after": "degree of animal dysfunction. Thirteen spinal cords were extracted from animals", "start_char_pos": 623, "end_char_pos": 669}, {"type": "R", "before": "were extracted, dissected and subsequently", "after": "and", "start_char_pos": 693, "end_char_pos": 735}, {"type": "R", "before": "5", "after": "five", "start_char_pos": 783, "end_char_pos": 784}, {"type": "R", "before": "The diffusion", "after": "Diffusion", "start_char_pos": 803, "end_char_pos": 816}, {"type": "D", "before": "weighted", "after": null, "start_char_pos": 897, "end_char_pos": 905}, {"type": "R", "before": "show", "after": "unveil a", "start_char_pos": 1173, "end_char_pos": 1177}, {"type": "R", "before": "mean of the kurtosis tensor, radial kurtosis, radial diffusivity, similar to what was found in other hypomyelinating MS models and in patients. However, changes in WM-modeling", "after": "measured microstructural parameters in normal appearing white matter and gray matter. The changes we found in biophysical modeling", "start_char_pos": 1221, "end_char_pos": 1396}, {"type": "R", "before": "are", "after": "were", "start_char_pos": 1460, "end_char_pos": 1463}, {"type": "R", "before": "using", "after": "employing", "start_char_pos": 1504, "end_char_pos": 1509}, {"type": "R", "before": "Our", "after": "In conclusion, our", "start_char_pos": 1537, "end_char_pos": 1540}, {"type": "D", "before": "in normal appearing white matter and gray matter", "after": null, "start_char_pos": 1664, "end_char_pos": 1712}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1885, "end_char_pos": 1885}], "sents_char_pos": [0, 145, 338, 643, 802, 886, 1092, 1160, 1364, 1750]} {"doc_id": "1811.05849", "revision_depth": "1", "before_revision": "Attempting to recognize a tree inside a network is a fundamental undertaking in evolutionary analysis. Therefore, the notion of tree-based phylogenetic networks, which was introduced by Francis and Steel, has attracted much attention of researchers in the area of theoretical biology in the last few years. Tree-based networks can be viewed as a natural generalization of rooted binary phylogenetic trees because they are merely trees with additional arcs, and in defining those networks, a certain kind of spanning trees called subdivision trees plays an essential role . In this paper, we provide a structural characterization of tree-based networks that furnishes efficient algorithms for solving the following problems in linear time (for enumeration, in linear delay) : given a rooted binary phylogenetic network N, 1) determine whether or not N is tree-based and find a subdivision tree if there exists any (decision/search problem); 2) compute the number of subdivision trees of N (counting problem); 3) list all subdivision trees of N (enumeration problem); and 4) find a subdivision tree to maximize or minimize a prescribed objective function (optimization problem). Our structural result settles numerous questions including the complexity of the problem of counting subdivision trees that was left open in the paper of Francis and Steel, and also provides short proofs of different known results from a unifying point of view. The results in this paper still hold for a certain class of non-binary networks. Some applications and further research directions are also mentioned .", "after_revision": "Attempting to recognize a tree inside a phylogenetic network is a fundamental undertaking in evolutionary analysis. Therefore, the concept of \" tree-based \" phylogenetic networks, which was introduced by Francis and Steel, has attracted much attention of theoretical biologists in the last few years. In this context, spanning trees of a certain kind called \"subdivision trees\" play an essential role and there are many important computational problems about them, whose time complexity is still unclear. Against this backdrop, the present paper aims to provide a graph theoretical framework for solving different problems on subdivision trees in a simple and unified manner. To this end, we focus on a structure called the maximal zig-zag trail decomposition that is inherent in any rooted binary phylogenetic network N and prove a structure theorem that characterizes the collection of all subdivision trees of N. Our theorem does not only imply and unify various results in the literature but also yield linear time (for enumeration, linear delay) algorithms for the following problems : given a rooted binary phylogenetic network N, 1) determine whether or not N has a subdivision tree and find one if there exists any (decision/search problem); 2) compute the number of subdivision trees of N (counting problem); 3) list all subdivision trees of N (enumeration problem); and 4) find a subdivision tree to maximize or minimize a prescribed objective function (optimization problem). Importantly, the results and algorithms in this paper still hold true for some non-binary phylogenetic networks and this generalization gives a partial answer to an open question from Pons, Semple, and Steel. We also mention some statistical applications and further research directions .", "edit_actions": [{"type": "A", "before": null, "after": "phylogenetic", "start_char_pos": 40, "end_char_pos": 40}, {"type": "R", "before": "notion of", "after": "concept of \"", "start_char_pos": 119, "end_char_pos": 128}, {"type": "A", "before": null, "after": "\"", "start_char_pos": 140, "end_char_pos": 140}, {"type": "R", "before": "researchers in the area of theoretical biology", "after": "theoretical biologists", "start_char_pos": 239, "end_char_pos": 285}, {"type": "R", "before": "Tree-based networks can be viewed as a natural generalization of rooted binary phylogenetic trees because they are merely trees with additional arcs, and in defining those networks,", "after": "In this context, spanning trees of", "start_char_pos": 309, "end_char_pos": 490}, {"type": "R", "before": "of spanning trees called subdivision trees plays", "after": "called \"subdivision trees\" play", "start_char_pos": 506, "end_char_pos": 554}, {"type": "R", "before": ". In this paper, we provide a structural characterization of tree-based networks that furnishes efficient algorithms for solving the following problems in", "after": "and there are many important computational problems about them, whose time complexity is still unclear. Against this backdrop, the present paper aims to provide a graph theoretical framework for solving different problems on subdivision trees in a simple and unified manner. To this end, we focus on a structure called the maximal zig-zag trail decomposition that is inherent in any rooted binary phylogenetic network N and prove a structure theorem that characterizes the collection of all subdivision trees of N. Our theorem does not only imply and unify various results in the literature but also yield", "start_char_pos": 573, "end_char_pos": 727}, {"type": "D", "before": "in", "after": null, "start_char_pos": 758, "end_char_pos": 760}, {"type": "A", "before": null, "after": "algorithms for the following problems", "start_char_pos": 775, "end_char_pos": 775}, {"type": "R", "before": "is tree-based and find", "after": "has", "start_char_pos": 854, "end_char_pos": 876}, {"type": "A", "before": null, "after": "and find one", "start_char_pos": 896, "end_char_pos": 896}, {"type": "R", "before": "Our structural result settles numerous questions including the complexity of the problem of counting subdivision trees that was left open in the paper of Francis and Steel, and also provides short proofs of different known results from a unifying point of view. The results", "after": "Importantly, the results and algorithms", "start_char_pos": 1181, "end_char_pos": 1454}, {"type": "R", "before": "for a certain class of", "after": "true for some", "start_char_pos": 1480, "end_char_pos": 1502}, {"type": "R", "before": "networks. Some", "after": "phylogenetic networks and this generalization gives a partial answer to an open question from Pons, Semple, and Steel. We also mention some statistical", "start_char_pos": 1514, "end_char_pos": 1528}, {"type": "D", "before": "are also mentioned", "after": null, "start_char_pos": 1574, "end_char_pos": 1592}], "sents_char_pos": [0, 103, 308, 574, 943, 1011, 1069, 1180, 1442, 1523]} {"doc_id": "1812.01082", "revision_depth": "2", "before_revision": "In many fields of science and engineering , geometric features play a key role in understanding certain quantity or phenomena. Recently, convolutional neural networks (CNNs) have been shown to possess a promising capability of extracting and codifying features from visual information. However, the application of such capable CNNs has been quite limited to mostly computer vision problems where the visual information is inherently given on a grid-like structure. This, unfortunately, was not the case for the geometry processing community, where many visual recognition problems are defined on arbitrary surfaces(2D-manifolds). Technical difficulties hindering the generalization of CNNs to arbitrary-shaped manifold are rooted in the lacks of such key elements including the canonical grid-like representation, the notion of consistent orientation, and a compatible local topology across the domain. Unfortunately, except for a few pioneering works, only very little has been studied in this regard. To this end, in this paper, we propose a novel mathematical formulation to extend CNNs onto two-dimensional (2D) manifold domains. More specifically, we approximate a tensor field defined over a manifold using orthogonal basis functions, called Zernike polynomials, on local tangent spaces. We prove that the convolution of two functions can be represented as a simple dot product between Zernike polynomial coefficients . We also prove that a rotation of a convolution kernel equates to a set of 2 by 2 rotation matrices applied to Zernike polynomial coefficients, which can be critical in manifold domains . As such, the key contribution of this work resides in a concise but rigorous mathematical generalization of the CNN building blocks . Furthermore, comparative to the other state-of-the-art methods, our method demonstrates substantially better performance on both classification and regression tasks .", "after_revision": "In this paper, we propose a novel formulation to extend CNNs to two-dimensional (2D) manifolds using orthogonal basis functions, called Zernike polynomials. In many areas , geometric features play a key role in understanding scientific phenomena. Thus, an ability to codify geometric features into a mathematical quantity can be critical. Recently, convolutional neural networks (CNNs) have demonstrated the promising capability of extracting and codifying features from visual information. However, the progress has been concentrated in computer vision applications where there exists an inherent grid-like structure. In contrast, many geometry processing problems are defined on curved surfaces, and the generalization of CNNs is not quite trivial. The difficulties are rooted in the lack of key ingredients such as the canonical grid-like representation, the notion of consistent orientation, and a compatible local topology across the domain. In this paper, we prove that the convolution of two functions can be represented as a simple dot product between Zernike polynomial coefficients ; and the rotation of a convolution kernel is essentially a set of 2-by-2 rotation matrices applied to the coefficients . As such, the key contribution of this work resides in a concise but rigorous mathematical generalization of the CNN building blocks .", "edit_actions": [{"type": "R", "before": "many fields of science and engineering", "after": "this paper, we propose a novel formulation to extend CNNs to two-dimensional (2D) manifolds using orthogonal basis functions, called Zernike polynomials. In many areas", "start_char_pos": 3, "end_char_pos": 41}, {"type": "R", "before": "certain quantity or phenomena.", "after": "scientific phenomena. Thus, an ability to codify geometric features into a mathematical quantity can be critical.", "start_char_pos": 96, "end_char_pos": 126}, {"type": "R", "before": "been shown to possess a", "after": "demonstrated the", "start_char_pos": 179, "end_char_pos": 202}, {"type": "R", "before": "application of such capable CNNs has been quite limited to mostly computer vision problems where the visual information is inherently given on a", "after": "progress has been concentrated in computer vision applications where there exists an inherent", "start_char_pos": 299, "end_char_pos": 443}, {"type": "R", "before": "This, unfortunately, was not the case for the geometry processing community, where many visual recognition", "after": "In contrast, many geometry processing", "start_char_pos": 465, "end_char_pos": 571}, {"type": "R", "before": "arbitrary surfaces(2D-manifolds). Technical difficulties hindering", "after": "curved surfaces, and", "start_char_pos": 596, "end_char_pos": 662}, {"type": "R", "before": "to arbitrary-shaped manifold", "after": "is not quite trivial. The difficulties", "start_char_pos": 690, "end_char_pos": 718}, {"type": "R", "before": "lacks of such key elements including", "after": "lack of key ingredients such as", "start_char_pos": 737, "end_char_pos": 773}, {"type": "R", "before": "Unfortunately, except for a few pioneering works, only very little has been studied in this regard. To this end, in this", "after": "In this", "start_char_pos": 903, "end_char_pos": 1023}, {"type": "D", "before": "propose a novel mathematical formulation to extend CNNs onto two-dimensional (2D) manifold domains. More specifically, we approximate a tensor field defined over a manifold using orthogonal basis functions, called Zernike polynomials, on local tangent spaces. We", "after": null, "start_char_pos": 1034, "end_char_pos": 1296}, {"type": "R", "before": ". We also prove that a", "after": "; and the", "start_char_pos": 1424, "end_char_pos": 1446}, {"type": "R", "before": "equates to", "after": "is essentially", "start_char_pos": 1480, "end_char_pos": 1490}, {"type": "R", "before": "2 by 2", "after": "2-by-2", "start_char_pos": 1500, "end_char_pos": 1506}, {"type": "R", "before": "Zernike polynomial coefficients, which can be critical in manifold domains", "after": "the coefficients", "start_char_pos": 1536, "end_char_pos": 1610}, {"type": "D", "before": ". Furthermore, comparative to the other state-of-the-art methods, our method demonstrates substantially better performance on both classification and regression tasks", "after": null, "start_char_pos": 1745, "end_char_pos": 1911}], "sents_char_pos": [0, 126, 285, 464, 629, 902, 1002, 1133, 1293, 1425, 1612, 1746]} {"doc_id": "1812.09218", "revision_depth": "1", "before_revision": "Networks in the brain consist of different types of neurons. We here investigate the influence of neuron diversity on the dynamical stability , phase space structure , and computational capabilities of inhibitory spiking networks using mixtures of neurons with positive and negative dissipation . We find that already a single neuron of a different type may qualitatively change the dynamics of a neural network and that mixed networks can combine the computational capabilities of ones with only a single neuron type. Our networks contain leaky integrate-and-fire neurons (positive dissipation) as well as neurons with inverted sign of the leak current (negative dissipation) . We first show that such networkscan exhibit a balanced state of irregular , asynchronous spiking activity, if the neurons with negative dissipation are endowed with a voltage-dependent input cutoff, which may be interpreted as a simple conductance-based implementation of their synapses. We compute the voltage probability distributions and self-consistent firing rates for both types of neurons for finite size spike impacts assuming that inputs are Poissonian. The balanced state exists in a variety of neural network models and its dynamical properties such as chaoticity vary considerably. Our models generalize networks of leaky integrate-and-fire neurons where the dynamics are non-chaotic despite their irregularity. We show that switching the sign of the dissipation of a single neuron renders the entire network dynamics unstable and chaotic as indicated by a positive largest Lyapunov exponent. To further characterize the dynamics we consider the full spectrum of Lyapunov exponents and the related covariant Lyapunov vectors (CLVs) , which indicate the directions in which infinitesimal perturbations grow or shrink with a rate given by the Lyapunov exponents . We find that for each .. .", "after_revision": "Networks in the brain consist of different types of neurons. Here we investigate the influence of neuron diversity on the dynamics , phase space structure and computational capabilities of spiking neural networks . We find that already a single neuron of a different type can qualitatively change the network dynamics and that mixed networks may combine the computational capabilities of ones with a single neuron type. We study inhibitory networks of concave leaky (LIF) and convex \"anti-leaky\" (XIF) integrate-and-fire neurons that generalize irregularly spiking non-chaotic LIF neuron networks. Endowed with simple conductance-based synapses for XIF neurons, our networks can generate a balanced state of irregular asynchronous spiking as well. We determine the voltage probability distributions and self-consistent firing rates assuming Poisson input with finite size spike impacts . Further, we compute the full spectrum of Lyapunov exponents (LEs) and the covariant Lyapunov vectors (CLVs) specifying the corresponding perturbation directions . We find that there is approximately one positive LE for each XIF neuron. This indicates in particular that a single XIF neuron renders the network dynamics chaotic. A simple mean-field approach, which can be justified by properties of the CLVs, explains the finding. As an application, we propose a spike-based computing scheme where our networks serve as computational reservoirs and their different stability properties yield different computational capabilities .", "edit_actions": [{"type": "R", "before": "We here", "after": "Here we", "start_char_pos": 61, "end_char_pos": 68}, {"type": "R", "before": "dynamical stability", "after": "dynamics", "start_char_pos": 122, "end_char_pos": 141}, {"type": "D", "before": ",", "after": null, "start_char_pos": 166, "end_char_pos": 167}, {"type": "R", "before": "inhibitory spiking networks using mixtures of neurons with positive and negative dissipation", "after": "spiking neural networks", "start_char_pos": 202, "end_char_pos": 294}, {"type": "R", "before": "may", "after": "can", "start_char_pos": 354, "end_char_pos": 357}, {"type": "R", "before": "dynamics of a neural network", "after": "network dynamics", "start_char_pos": 383, "end_char_pos": 411}, {"type": "R", "before": "can", "after": "may", "start_char_pos": 436, "end_char_pos": 439}, {"type": "D", "before": "only", "after": null, "start_char_pos": 492, "end_char_pos": 496}, {"type": "R", "before": "Our networks contain leaky", "after": "We study inhibitory networks of concave leaky (LIF) and convex \"anti-leaky\" (XIF)", "start_char_pos": 519, "end_char_pos": 545}, {"type": "R", "before": "neurons (positive dissipation) as well as neurons with inverted sign of the leak current (negative dissipation) . We first show that such networkscan exhibit", "after": "neurons that generalize irregularly spiking non-chaotic LIF neuron networks. Endowed with simple conductance-based synapses for XIF neurons, our networks can generate", "start_char_pos": 565, "end_char_pos": 722}, {"type": "R", "before": ", asynchronous spiking activity, if the neurons with negative dissipation are endowed with a voltage-dependent input cutoff, which may be interpreted as a simple conductance-based implementation of their synapses. We compute", "after": "asynchronous spiking as well. We determine", "start_char_pos": 753, "end_char_pos": 977}, {"type": "R", "before": "for both types of neurons for", "after": "assuming Poisson input with", "start_char_pos": 1049, "end_char_pos": 1078}, {"type": "R", "before": "assuming that inputs are Poissonian. The balanced state exists in a variety of neural network models and its dynamical properties such as chaoticity vary considerably. Our models generalize networks of leaky integrate-and-fire neurons where the dynamics are non-chaotic despite their irregularity. We show that switching the sign of the dissipation of a single neuron renders the entire network dynamics unstable and chaotic as indicated by a positive largest Lyapunov exponent. To further characterize the dynamics we consider", "after": ". Further, we compute", "start_char_pos": 1105, "end_char_pos": 1632}, {"type": "R", "before": "and the related", "after": "(LEs) and the", "start_char_pos": 1673, "end_char_pos": 1688}, {"type": "R", "before": ", which indicate the directions in which infinitesimal perturbations grow or shrink with a rate given by the Lyapunov exponents", "after": "specifying the corresponding perturbation directions", "start_char_pos": 1723, "end_char_pos": 1850}, {"type": "R", "before": "for each ..", "after": "there is approximately one positive LE for each XIF neuron. This indicates in particular that a single XIF neuron renders the network dynamics chaotic. A simple mean-field approach, which can be justified by properties of the CLVs, explains the finding. As an application, we propose a spike-based computing scheme where our networks serve as computational reservoirs and their different stability properties yield different computational capabilities", "start_char_pos": 1866, "end_char_pos": 1877}], "sents_char_pos": [0, 60, 296, 518, 678, 966, 1141, 1272, 1402, 1583, 1852]} {"doc_id": "1812.09418", "revision_depth": "1", "before_revision": "A distinguishing feature of living matter is its ability to control force-generating structures that accomplish tasks such as chromosome segregation, intracellular transport, and cell movement. To generate and manipulate these micron-scale structures and force fields , cells create spatiotemporal patterns of molecular-scale activity ] ] ] . Here, we control micron-scale structures and fluid flow by manipulating molecular-scale protein activity set by dynamic optical boundaries in an engineered system of purified proteins . Our engineered system consists of microtubules and light-activatable motor proteins that crosslink and URLanize microtubules upon illumination. During URLanization, crosslinked motors do work to create non-equilibrium structures. We design light patternsthat enable us to create, move, and merge microtubule asters with spatial and temporal precision . By composing these basic operations, we create microtubule networks that can span several hundred microns in length and contract at speeds up to an order of magnitude faster than the speed of an individual motor. By scaling the size and speed of contractile networks , we generate and sculpt advective fluid flows. Our work shows that dynamic boundaries enable control over active matter . The principles of boundary-mediated control we uncover may be used to study emergent cellular structures and forces and to develop programmable active matter devices.", "after_revision": "Living systems are capable of locomotion, reconfiguration, and replication. To perform these tasks, cells spatiotemporally coordinate the interactions of force-generating , \"active\" molecules that create and manipulate non-equilibrium structures and force fields that span up to millimeter length scales 1-3]. Experimental active matter systems of biological or synthetic molecules are capable of URLanizing into structures 4,5] and generating global flows 6-9]. However, these experimental systems lack the spatiotemporal control found in cells, limiting their utility for studying non-equilibrium phenomena and bioinspired engineering . Here, we uncover non-equilibrium phenomena and principles by optically controlling structures and fluid flow in an engineered system of active biomolecules . Our engineered system consists of purified microtubules and light-activatable motor proteins that crosslink URLanize microtubules into distinct structures upon illumination. We develop basic operations, defined as sets of light patterns, to create, move, and merge microtubule structures . By composing these basic operations, we are able to create microtubule networks that span several hundred microns in length and contract at speeds up to an order of magnitude faster than the speed of an individual motor. We manipulate these contractile networks to generate and sculpt persistent fluid flows . The principles of boundary-mediated control we uncover may be used to study emergent cellular structures and forces and to develop programmable active matter devices.", "edit_actions": [{"type": "R", "before": "A distinguishing feature of living matter is its ability to control", "after": "Living systems are capable of locomotion, reconfiguration, and replication. To perform these tasks, cells spatiotemporally coordinate the interactions of", "start_char_pos": 0, "end_char_pos": 67}, {"type": "R", "before": "structures that accomplish tasks such as chromosome segregation, intracellular transport, and cell movement. To generate and manipulate these micron-scale", "after": ", \"active\" molecules that create and manipulate non-equilibrium", "start_char_pos": 85, "end_char_pos": 239}, {"type": "R", "before": ", cells create spatiotemporal patterns of molecular-scale activity", "after": "that span up to millimeter length scales", "start_char_pos": 268, "end_char_pos": 334}, {"type": "A", "before": null, "after": "1-3", "start_char_pos": 335, "end_char_pos": 335}, {"type": "A", "before": null, "after": ". Experimental active matter systems of biological or synthetic molecules are capable of URLanizing into structures", "start_char_pos": 336, "end_char_pos": 336}, {"type": "A", "before": null, "after": "4,5", "start_char_pos": 337, "end_char_pos": 337}, {"type": "A", "before": null, "after": "and generating global flows", "start_char_pos": 339, "end_char_pos": 339}, {"type": "A", "before": null, "after": "6-9", "start_char_pos": 340, "end_char_pos": 340}, {"type": "A", "before": null, "after": ". However, these experimental systems lack the spatiotemporal control found in cells, limiting their utility for studying non-equilibrium phenomena and bioinspired engineering", "start_char_pos": 341, "end_char_pos": 341}, {"type": "R", "before": "control micron-scale", "after": "uncover non-equilibrium phenomena and principles by optically controlling", "start_char_pos": 353, "end_char_pos": 373}, {"type": "D", "before": "by manipulating molecular-scale protein activity set by dynamic optical boundaries", "after": null, "start_char_pos": 400, "end_char_pos": 482}, {"type": "R", "before": "purified proteins", "after": "active biomolecules", "start_char_pos": 510, "end_char_pos": 527}, {"type": "A", "before": null, "after": "purified", "start_char_pos": 564, "end_char_pos": 564}, {"type": "R", "before": "and URLanize microtubules", "after": "URLanize microtubules into distinct structures", "start_char_pos": 630, "end_char_pos": 655}, {"type": "R", "before": "During URLanization, crosslinked motors do work to create non-equilibrium structures. We design light patternsthat enable us", "after": "We develop basic operations, defined as sets of light patterns,", "start_char_pos": 675, "end_char_pos": 799}, {"type": "R", "before": "asters with spatial and temporal precision", "after": "structures", "start_char_pos": 839, "end_char_pos": 881}, {"type": "A", "before": null, "after": "are able to", "start_char_pos": 924, "end_char_pos": 924}, {"type": "D", "before": "can", "after": null, "start_char_pos": 958, "end_char_pos": 961}, {"type": "R", "before": "By scaling the size and speed of contractile networks , we", "after": "We manipulate these contractile networks to", "start_char_pos": 1098, "end_char_pos": 1156}, {"type": "R", "before": "advective fluid flows. Our work shows that dynamic boundaries enable control over active matter", "after": "persistent fluid flows", "start_char_pos": 1177, "end_char_pos": 1272}], "sents_char_pos": [0, 193, 529, 674, 760, 883, 1097, 1199, 1274]} {"doc_id": "1812.09431", "revision_depth": "1", "before_revision": "Despite the remarkable similarities between deep neural networks ( DNN ) and the human brain as shown in previous studies, the fact that DNNs still fall behind humans in many visual tasks suggests that considerable differences still exist between the two systems. To probe their dissimilarities , we leverage adversarial noise (AN) and adversarial interference (AI) images that yield distinct recognition performance in a prototypical DNN (AlexNet) and human vision. The evoked activity by regular (RE) and adversarial images in both systems is thoroughly compared. We find that representational similarity between RE and adversarial images in the human brain resembles their perceptual similarity . However, such representation-perception association is disrupted in the DNN. Especially, the representational similarity between RE and AN images idiosyncratically increases from low- to high-level layers . Furthermore, forward encoding modeling reveals that the DNN-brain hierarchical correspondence proposed in previous studies only holds when the two systems process RE and AI images but not AN images. These results might be due to the deterministic modeling approach of current DNNs. Taken together, our results provide a complementary perspective on the comparison between DNNs and the human brain , and highlight the need to characterize their differences to further bridge artificial and human intelligence research .", "after_revision": "Despite the remarkable similarities between convolutional neural networks ( CNN ) and the human brain , CNNs still fall behind humans in many visual tasks , indicating that there still exist considerable differences between the two systems. Here , we leverage adversarial noise (AN) and adversarial interference (AI) images to quantify the consistency between neural representations and perceptual outcomes in the two systems. Humans can successfully recognize AI images as corresponding categories but perceive AN images as meaningless noise. In contrast, CNNs can correctly recognize AN images but mistakenly classify AI images into wrong categories with surprisingly high confidence. We use functional magnetic resonance imaging to measure brain activity evoked by regular and adversarial images in the human brain, and compare it to the activity of artificial neurons in a prototypical CNN-AlexNet. In the human brain, we find that the representational similarity between regular and adversarial images largely echoes their perceptual similarity in all early visual areas. In AlexNet, however, the neural representations of adversarial images are inconsistent with network outputs in all intermediate processing layers, providing no neural foundations for perceptual similarity . Furthermore, we show that voxel-encoding models trained on regular images can successfully generalize to the neural responses to AI images but not AN images. These remarkable differences between the human brain and AlexNet in the representation-perception relation suggest that future CNNs should emulate both behavior and the internal neural presentations of the human brain .", "edit_actions": [{"type": "R", "before": "deep", "after": "convolutional", "start_char_pos": 44, "end_char_pos": 48}, {"type": "R", "before": "DNN", "after": "CNN", "start_char_pos": 67, "end_char_pos": 70}, {"type": "R", "before": "as shown in previous studies, the fact that DNNs", "after": ", CNNs", "start_char_pos": 93, "end_char_pos": 141}, {"type": "R", "before": "suggests that considerable differences still exist", "after": ", indicating that there still exist considerable differences", "start_char_pos": 188, "end_char_pos": 238}, {"type": "R", "before": "To probe their dissimilarities", "after": "Here", "start_char_pos": 264, "end_char_pos": 294}, {"type": "R", "before": "that yield distinct recognition performance in a prototypical DNN (AlexNet) and human vision. The evoked activity by regular (RE)", "after": "to quantify the consistency between neural representations and perceptual outcomes in the two systems. Humans can successfully recognize AI images as corresponding categories but perceive AN images as meaningless noise. In contrast, CNNs can correctly recognize AN images but mistakenly classify AI images into wrong categories with surprisingly high confidence. We use functional magnetic resonance imaging to measure brain activity evoked by regular", "start_char_pos": 373, "end_char_pos": 502}, {"type": "R", "before": "both systems is thoroughly compared. We find that", "after": "the human brain, and compare it to the activity of artificial neurons in a prototypical CNN-AlexNet. In the human brain, we find that the", "start_char_pos": 529, "end_char_pos": 578}, {"type": "R", "before": "RE", "after": "regular", "start_char_pos": 615, "end_char_pos": 617}, {"type": "R", "before": "in the human brain resembles", "after": "largely echoes", "start_char_pos": 641, "end_char_pos": 669}, {"type": "R", "before": ". However, such representation-perception association is disrupted in the DNN. Especially, the representational similarity between RE and AN images idiosyncratically increases from low- to high-level layers", "after": "in all early visual areas. In AlexNet, however, the neural representations of adversarial images are inconsistent with network outputs in all intermediate processing layers, providing no neural foundations for perceptual similarity", "start_char_pos": 698, "end_char_pos": 904}, {"type": "R", "before": "forward encoding modeling reveals that the DNN-brain hierarchical correspondence proposed in previous studies only holds when the two systems process RE and", "after": "we show that voxel-encoding models trained on regular images can successfully generalize to the neural responses to", "start_char_pos": 920, "end_char_pos": 1076}, {"type": "R", "before": "results might be due to the deterministic modeling approach of current DNNs. Taken together, our results provide a complementary perspective on the comparison between DNNs and", "after": "remarkable differences between", "start_char_pos": 1112, "end_char_pos": 1287}, {"type": "R", "before": ", and highlight the need to characterize their differences to further bridge artificial and human intelligence research", "after": "and AlexNet in the representation-perception relation suggest that future CNNs should emulate both behavior and the internal neural presentations of the human brain", "start_char_pos": 1304, "end_char_pos": 1423}], "sents_char_pos": [0, 263, 466, 565, 699, 906, 1105, 1188]} {"doc_id": "1812.11246", "revision_depth": "1", "before_revision": "This paper studies identification and estimation of a class of dynamic models in which the decision maker (DM) is uncertain about the data-generating process. The DM maximizes his or her continuation value under a worst-case model which lies within a nonparametric neighborhood of a benchmark model . The DM's benchmark model and preference parameters are jointly underidentified. With the DM's benchmark model fixed, primitive conditions are established for nonparametric identification of the worst-case model and local identification of the DM's preference parameters. The key step in the identification analysis is to establish existence and uniqueness of the DM's continuation value function allowing for unbounded statespace and unbounded utilities, both of which are important in applications. To do so, we derive new fixed-point results which use monotonicity and convexity of the value function recursion and which are embedded within a Banach space of \" thin-tailed \" functions that arises naturally from the structure of recursion. The fixed-point results are quite general and are also applied to models where the DM learns about a hidden state and Rust-type dynamic discrete choice models . A perturbation result is derived which provides a necessary and sufficient condition for consistent estimation of continuation values and the worst-case model. A robust consumption-investment problem is studied as an empirical application and some connections are drawn with the literature on macroeconomic uncertainty.", "after_revision": "This paper studies identification and estimation of a class of dynamic models in which the decision maker (DM) is uncertain about the data-generating process. The DM surrounds a benchmark model that he or she fears is misspecified by a set of models. Decisions are evaluated under a \"worst-case\" model that delivers the lowest utility among all models in this set . The DM's benchmark model and preference parameters are jointly underidentified. With the benchmark model held fixed, primitive conditions are established for identification of the DM's worst-case model and preference parameters. The key step in the identification analysis is to establish existence and uniqueness of the DM's continuation value function allowing for unbounded statespace and unbounded utilities, both of which are important in applications. To do so, new fixed-point results are derived for monotone, convex operators that act on a Banach space of thin-tailed functions arising naturally from the structure of the continuation value recursion. The fixed-point results are quite general ; applications to models with learning and Rust-type dynamic discrete choice models are also discussed. For estimation, a perturbation result is derived which provides a necessary and sufficient condition for consistent estimation of continuation values and the worst-case model. The result also allows convergence rates of estimators to be characterized. An empirical application studies an endowment economy where the DM's benchmark model may be interpreted as an aggregate of experts' forecasting models. The application reveals time-variation in the way the DM pessimistically distorts benchmark probabilities. Consequences for asset pricing are explored and connections are drawn with the literature on macroeconomic uncertainty.", "edit_actions": [{"type": "R", "before": "maximizes his or her continuation value under a worst-case model which lies within a nonparametric neighborhood of a", "after": "surrounds a", "start_char_pos": 166, "end_char_pos": 282}, {"type": "A", "before": null, "after": "that he or she fears is misspecified by a set of models. Decisions are evaluated under a \"worst-case\" model that delivers the lowest utility among all models in this set", "start_char_pos": 299, "end_char_pos": 299}, {"type": "R", "before": "DM's benchmark model", "after": "benchmark model held", "start_char_pos": 391, "end_char_pos": 411}, {"type": "D", "before": "nonparametric", "after": null, "start_char_pos": 460, "end_char_pos": 473}, {"type": "D", "before": "worst-case model and local identification of the", "after": null, "start_char_pos": 496, "end_char_pos": 544}, {"type": "A", "before": null, "after": "worst-case model and", "start_char_pos": 550, "end_char_pos": 550}, {"type": "D", "before": "we derive", "after": null, "start_char_pos": 813, "end_char_pos": 822}, {"type": "R", "before": "which use monotonicity and convexity of the value function recursion and which are embedded within", "after": "are derived for monotone, convex operators that act on", "start_char_pos": 847, "end_char_pos": 945}, {"type": "D", "before": "\"", "after": null, "start_char_pos": 964, "end_char_pos": 965}, {"type": "R", "before": "\" functions that arises", "after": "functions arising", "start_char_pos": 978, "end_char_pos": 1001}, {"type": "A", "before": null, "after": "the continuation value", "start_char_pos": 1034, "end_char_pos": 1034}, {"type": "R", "before": "and are also applied to models where the DM learns about a hidden state", "after": "; applications to models with learning", "start_char_pos": 1088, "end_char_pos": 1159}, {"type": "R", "before": ". A", "after": "are also discussed. For estimation, a", "start_char_pos": 1205, "end_char_pos": 1208}, {"type": "R", "before": "A robust consumption-investment problem is studied as an empirical application and some", "after": "The result also allows convergence rates of estimators to be characterized. An empirical application studies an endowment economy where the DM's benchmark model may be interpreted as an aggregate of experts' forecasting models. The application reveals time-variation in the way the DM pessimistically distorts benchmark probabilities. Consequences for asset pricing are explored and", "start_char_pos": 1367, "end_char_pos": 1454}], "sents_char_pos": [0, 158, 301, 381, 573, 802, 1045, 1366]} {"doc_id": "1901.02414", "revision_depth": "1", "before_revision": "We consider assignment policies that allocate resources to requesting users, where everyone is located on a one-dimensional line. First, we consider a unidirectional problem where a resource can only be allocated to a user located to its leftas exemplified here. Imagine a one-way city street with traffic flowing from right to left; a ride-sharing company has distributed its vehicles along the street, which are ready to pick up users waiting at various locations. Users equipped with smartphone ride-hailing apps can register their requests on a ride allocation system. The latter then attempts to service each user by assigning a vehicle with spare capacity located to the user's right such that the average \"pick up\" distance is minimized. We propose the Move to Right (MTR) policy which assigns the nearest available resource located to the right , and contrast it with the Unidirectional Gale-Shapley (UGS) Matching policyknown in the literature . While both these policies are optimal , we show that they are equivalent with respect to the expected distance traveled by a request (request distance), although MTR tends to be fairer, i. e., has low variance. Moreover, we show that when the locations of users and resources are modeled by statistical point processes, the spatial system under unidirectional policies can be mapped to a temporal queuing system , thus allowing the application of a plethora of queuing theory results that yield closed form expressions. We also consider the bidirectional problem where there are no directional restrictions on resource allocation and give an optimal policy that has lower expected time complexity than known algorithms in literature in resource rich regimes . Finally, numerical evaluation of performance of unidirectional and bidirectional allocation schemes yield design guidelines beneficial for resource placement.", "after_revision": "We consider assignment policies that allocate resources to users, where both resources and users are located on a one-dimensional line. First, we consider unidirectional assignment policies that allocate resources only to users located to their left. We propose the Move to Right (MTR) policy , which scans from left to right assigning nearest rightmost available resource to a user , and contrast it to the Unidirectional Gale-Shapley (UGS) matching policy . While both these policies are optimal among all unidirectional policies , we show that they are equivalent with respect to the expected distance traveled by a request (request distance), although MTR is fairer. Moreover, we show that when user and resource locations are modeled by statistical point processes, and resources are allowed to satisfy more than one user, the spatial system under unidirectional policies can be mapped into bulk service queuing systems , thus allowing the application of a plethora of queuing theory results that yield closed form expressions. As we consider a case where different resources can satisfy different numbers of users, we also generate new results for bulk service queues. We also consider bidirectional policies where there are no directional restrictions on resource allocation and develop an algorithm for computing the optimal assignment which is more efficient than known algorithms in the literature when there are more resources than users . Finally, numerical evaluation of performance of unidirectional and bidirectional allocation schemes yields design guidelines beneficial for resource placement.", "edit_actions": [{"type": "D", "before": "requesting", "after": null, "start_char_pos": 59, "end_char_pos": 69}, {"type": "R", "before": "everyone is", "after": "both resources and users are", "start_char_pos": 83, "end_char_pos": 94}, {"type": "R", "before": "a unidirectional problem where a resource can only be allocated to a user located to its leftas exemplified here. Imagine a one-way city street with traffic flowing from right to left; a ride-sharing company has distributed its vehicles along the street, which are ready to pick up users waiting at various locations. Users equipped with smartphone ride-hailing apps can register their requests on a ride allocation system. The latter then attempts to service each user by assigning a vehicle with spare capacity located to the user's right such that the average \"pick up\" distance is minimized.", "after": "unidirectional assignment policies that allocate resources only to users located to their left.", "start_char_pos": 149, "end_char_pos": 744}, {"type": "R", "before": "which assigns the nearest available resource located to the right", "after": ", which scans from left to right assigning nearest rightmost available resource to a user", "start_char_pos": 787, "end_char_pos": 852}, {"type": "R", "before": "with", "after": "to", "start_char_pos": 871, "end_char_pos": 875}, {"type": "R", "before": "Matching policyknown in the literature", "after": "matching policy", "start_char_pos": 914, "end_char_pos": 952}, {"type": "A", "before": null, "after": "among all unidirectional policies", "start_char_pos": 993, "end_char_pos": 993}, {"type": "R", "before": "tends to be fairer, i. e., has low variance.", "after": "is fairer.", "start_char_pos": 1122, "end_char_pos": 1166}, {"type": "R", "before": "the locations of users and resources", "after": "user and resource locations", "start_char_pos": 1195, "end_char_pos": 1231}, {"type": "A", "before": null, "after": "and resources are allowed to satisfy more than one user,", "start_char_pos": 1276, "end_char_pos": 1276}, {"type": "R", "before": "to a temporal queuing system", "after": "into bulk service queuing systems", "start_char_pos": 1340, "end_char_pos": 1368}, {"type": "A", "before": null, "after": "As we consider a case where different resources can satisfy different numbers of users, we also generate new results for bulk service queues.", "start_char_pos": 1477, "end_char_pos": 1477}, {"type": "R", "before": "the bidirectional problem", "after": "bidirectional policies", "start_char_pos": 1495, "end_char_pos": 1520}, {"type": "R", "before": "give an optimal policy that has lower expected time complexity", "after": "develop an algorithm for computing the optimal assignment which is more efficient", "start_char_pos": 1592, "end_char_pos": 1654}, {"type": "R", "before": "literature in resource rich regimes", "after": "the literature when there are more resources than users", "start_char_pos": 1680, "end_char_pos": 1715}, {"type": "R", "before": "yield", "after": "yields", "start_char_pos": 1818, "end_char_pos": 1823}], "sents_char_pos": [0, 129, 262, 333, 466, 572, 744, 954, 1166, 1476, 1717]} {"doc_id": "1902.00706", "revision_depth": "1", "before_revision": "We analyze the probability of ruin for the {\\it scaled} classical Cramer-Lundberg (CL) risk process and the corresponding diffusion approximation. The scaling, introduced by Iglehart (1969) to the actuarial literature, amounts to multiplying the Poisson rate \\lambda \\la by n, dividing the claim severity by \\sqrt{n , and adjusting the premium rate so that net premium income remains constant. Therefore, we think of the associated diffusion approximation as being `` asymptotic for large values of \\lambda.'' \\la We are the first to use a comparison method to prove convergence of the probability of ruin for the scaled CL process and to derive the rate of convergence. Specifically, we prove a comparison lemma for the corresponding integro-differential equation and use this comparison lemma to prove that the probability of ruin for the scaled CL process converges to the probability of ruin for the limiting diffusion process. Moreover, we show that the rate of convergence for the ruin probability is of order O(n^{-1/2 \\mO\\big(}\\big) , and we show that the convergence is {\\it uniform} with respect to the surplus. To the best of our knowledge, this is the first rate of convergence achieved for these ruin probabilities, and we show that it is the tightest one . For the case of exponentially-distributed claims, we are able to improve the approximation arising from the diffusion, attaining a uniform O(n \\mO\\big( ^{ -1 } ) \\big) rate of convergence \\N . We also include two examples that illustrate our results.", "after_revision": "We analyze the probability of ruin for the {\\it scaled} classical Cram\\'er-Lundberg (CL) risk process and the corresponding diffusion approximation. The scaling, introduced by Iglehart \\mbox{%DIFAUXCMD I1969 to the actuarial literature, amounts to multiplying the Poisson rate \\la by n, dividing the claim severity by \\sqrtn , and adjusting the premium rate so that net premium income remains constant. \\% Therefore, we think of the associated diffusion approximation as being \" asymptotic for large values of \\la.\" We are the first to use a comparison method to prove convergence of the probability of ruin for the scaled CL process and to derive the rate of convergence. Specifically, we prove a comparison lemma for the corresponding integro-differential equation and use this comparison lemma to prove that the probability of ruin for the scaled CL process converges to the probability of ruin for the limiting diffusion process. Moreover, we show that the rate of convergence for the ruin probability is of order \\mO\\big(n^{-1/2}\\big) , and we show that the convergence is {\\it uniform} with respect to the surplus. To the best of our knowledge, this is the first rate of convergence achieved for these ruin probabilities, and we show that it is the tightest one in the general case . For the case of exponentially-distributed claims, we are able to improve the approximation arising from the diffusion, attaining a uniform \\mO\\big(n ^{ -k/2 } \\big) rate of convergence for arbitrary k \\in\\N . We also include two examples that illustrate our results.", "edit_actions": [{"type": "R", "before": "Cramer-Lundberg", "after": "Cram\\'er-Lundberg", "start_char_pos": 66, "end_char_pos": 81}, {"type": "R", "before": "(1969)", "after": "\\mbox{%DIFAUXCMD I1969", "start_char_pos": 183, "end_char_pos": 189}, {"type": "D", "before": "\\lambda", "after": null, "start_char_pos": 259, "end_char_pos": 266}, {"type": "R", "before": "\\sqrt{n", "after": "\\sqrtn", "start_char_pos": 308, "end_char_pos": 315}, {"type": "A", "before": null, "after": "\\%", "start_char_pos": 394, "end_char_pos": 394}, {"type": "R", "before": "``", "after": "\"", "start_char_pos": 466, "end_char_pos": 468}, {"type": "D", "before": "\\lambda.''", "after": null, "start_char_pos": 500, "end_char_pos": 510}, {"type": "A", "before": null, "after": ".\"", "start_char_pos": 514, "end_char_pos": 514}, {"type": "D", "before": "O(n^{-1/2", "after": null, "start_char_pos": 1017, "end_char_pos": 1026}, {"type": "A", "before": null, "after": "n^{-1/2", "start_char_pos": 1035, "end_char_pos": 1035}, {"type": "A", "before": null, "after": "in the general case", "start_char_pos": 1270, "end_char_pos": 1270}, {"type": "D", "before": "O(n", "after": null, "start_char_pos": 1412, "end_char_pos": 1415}, {"type": "A", "before": null, "after": "n", "start_char_pos": 1424, "end_char_pos": 1424}, {"type": "R", "before": "-1", "after": "-k/2", "start_char_pos": 1428, "end_char_pos": 1430}, {"type": "D", "before": ")", "after": null, "start_char_pos": 1433, "end_char_pos": 1434}, {"type": "A", "before": null, "after": "for arbitrary k \\in", "start_char_pos": 1461, "end_char_pos": 1461}], "sents_char_pos": [0, 146, 393, 671, 932, 1122, 1272]} {"doc_id": "1902.05622", "revision_depth": "1", "before_revision": " We study interactionsamong players in cooperative games. We propose a new interaction index called Shapley-Taylor interaction index . It decomposes the value of the game into terms that model the interactions between subsets of players, analogous to how the Taylor series represents a function in terms of its derivatives of various orders . We axiomatize the method using the standard Shapley axioms--linearity , dummy, symmetry and efficiency--and also an additional axiom that we call the interaction distribution axiom. This new axiom explicitly characterizes how inter-actions are distributed for a class of games called interactiongames . We contrast the Shapley-Taylor interaction index against the previously pro-posed Shapley Interaction index and the Banzhaf interaction index (cf. [ 2 ]) .", "after_revision": "The attribution problem, that is the problem of attributing a model's prediction to its base features, is well-studied. We extend the notion of attribution to also apply to feature interactions. The Shapley value is a commonly used method to attribute a model's prediction to its base features. We propose a generalization of the Shapley value called Shapley-Taylor index that attributes the model's prediction to interactions of subsets of features up to some size k. The method is analogous to how the truncated Taylor Series decomposes the function value at a certain point using its derivatives at a different point. In fact, we show that the Shapley Taylor index is equal to the Taylor Series of the multilinear extension of the set-theoretic behavior of the model . We axiomatize this method using the standard Shapley axioms -- linearity , dummy, symmetry and efficiency -- and an additional axiom that we call the interaction distribution axiom. This new axiom explicitly characterizes how interactions are distributed for a class of functions that model pure interaction . We contrast the Shapley-Taylor index against the previously proposed Shapley Interaction index (cf. [ 9 ]) from the cooperative game theory literature. We also apply the Shapley Taylor index to three models and identify interesting qualitative insights .", "edit_actions": [{"type": "A", "before": null, "after": "The attribution problem, that is the problem of attributing a model's prediction to its base features, is well-studied. We extend the notion of attribution to also apply to feature interactions. The Shapley value is a commonly used method to attribute a model's prediction to its base features.", "start_char_pos": 0, "end_char_pos": 0}, {"type": "D", "before": "study interactionsamong players in cooperative games. We", "after": null, "start_char_pos": 4, "end_char_pos": 60}, {"type": "R", "before": "new interaction index", "after": "generalization of the Shapley value", "start_char_pos": 71, "end_char_pos": 92}, {"type": "R", "before": "interaction index . It decomposes the value of the game into terms that model the interactions between subsets of players,", "after": "index that attributes the model's prediction to interactions of subsets of features up to some size k. The method is", "start_char_pos": 115, "end_char_pos": 237}, {"type": "R", "before": "Taylor series represents a function in terms of its derivatives of various orders", "after": "truncated Taylor Series decomposes the function value at a certain point using its derivatives at a different point. In fact, we show that the Shapley Taylor index is equal to the Taylor Series of the multilinear extension of the set-theoretic behavior of the model", "start_char_pos": 259, "end_char_pos": 340}, {"type": "R", "before": "the", "after": "this", "start_char_pos": 357, "end_char_pos": 360}, {"type": "R", "before": "axioms--linearity", "after": "axioms -- linearity", "start_char_pos": 395, "end_char_pos": 412}, {"type": "R", "before": "efficiency--and also", "after": "efficiency -- and", "start_char_pos": 435, "end_char_pos": 455}, {"type": "R", "before": "inter-actions", "after": "interactions", "start_char_pos": 569, "end_char_pos": 582}, {"type": "R", "before": "games called interactiongames", "after": "functions that model pure interaction", "start_char_pos": 614, "end_char_pos": 643}, {"type": "D", "before": "interaction", "after": null, "start_char_pos": 677, "end_char_pos": 688}, {"type": "R", "before": "pro-posed", "after": "proposed", "start_char_pos": 718, "end_char_pos": 727}, {"type": "D", "before": "and the Banzhaf interaction index", "after": null, "start_char_pos": 754, "end_char_pos": 787}, {"type": "R", "before": "2", "after": "9", "start_char_pos": 795, "end_char_pos": 796}, {"type": "A", "before": null, "after": "from the cooperative game theory literature. We also apply the Shapley Taylor index to three models and identify interesting qualitative insights", "start_char_pos": 800, "end_char_pos": 800}], "sents_char_pos": [0, 57, 134, 342, 524, 645]} {"doc_id": "1902.06687", "revision_depth": "2", "before_revision": "We present the first sublinear memory sketch which can be queried to find the v nearest neighbors in a dataset. Our online sketching algorithm can compress an N-element dataset to a sketch of size O(N^b \\log ^3{N ) in O(N^{ b+1 } \\log ^3{N ) time, where b < 1 when the query satisfies a data-dependent near-neighbor stability condition . We achieve data-dependent sublinear space by combining recent advances in locality sensitive hashing (LSH)-based estimators with compressed sensing. Our results shed new light on the memory-accuracy tradeoff for near-neighbor search. The techniques presented reveal a deep connection between the fundamental compressed sensing (or heavy hitters) recovery problem and near-neighbor search, leading to new insight for geometric search problems and implications for sketching algorithms .", "after_revision": "We present the first sublinear memory sketch that can be queried to find the nearest neighbors in a dataset. Our online sketching algorithm compresses an N element dataset to a sketch of size O(N^b \\log ^3 N ) in O(N^{ ( b+1 ) } \\log ^3 N ) time, where b < 1. This sketch can correctly report the nearest neighbors of any query that satisfies a stability condition parameterized by b . We achieve sublinear memory performance on stable queries by combining recent advances in locality sensitive hash (LSH)-based estimators , online kernel density estimation, and compressed sensing. Our theoretical results shed new light on the memory-accuracy tradeoff for nearest neighbor search, and our sketch, which consists entirely of short integer arrays, has a variety of attractive features in practice. We evaluate the memory-recall tradeoff of our method on a friend recommendation task in the Google Plus social media network. We obtain orders of magnitude better compression than the random projection based alternative while retaining the ability to report the nearest neighbors of practical queries .", "edit_actions": [{"type": "R", "before": "which", "after": "that", "start_char_pos": 45, "end_char_pos": 50}, {"type": "D", "before": "v", "after": null, "start_char_pos": 78, "end_char_pos": 79}, {"type": "R", "before": "can compress an N-element", "after": "compresses an N element", "start_char_pos": 143, "end_char_pos": 168}, {"type": "R", "before": "^3{N", "after": "^3 N", "start_char_pos": 208, "end_char_pos": 212}, {"type": "A", "before": null, "after": "(", "start_char_pos": 224, "end_char_pos": 224}, {"type": "A", "before": null, "after": ")", "start_char_pos": 229, "end_char_pos": 229}, {"type": "R", "before": "^3{N", "after": "^3 N", "start_char_pos": 237, "end_char_pos": 241}, {"type": "R", "before": "1 when the query satisfies a data-dependent near-neighbor stability condition", "after": "1. This sketch can correctly report the nearest neighbors of any query that satisfies a stability condition parameterized by b", "start_char_pos": 260, "end_char_pos": 337}, {"type": "R", "before": "data-dependent sublinear space", "after": "sublinear memory performance on stable queries", "start_char_pos": 351, "end_char_pos": 381}, {"type": "R", "before": "hashing", "after": "hash", "start_char_pos": 433, "end_char_pos": 440}, {"type": "R", "before": "with", "after": ", online kernel density estimation, and", "start_char_pos": 464, "end_char_pos": 468}, {"type": "A", "before": null, "after": "theoretical", "start_char_pos": 493, "end_char_pos": 493}, {"type": "R", "before": "near-neighbor search. The techniques presented reveal a deep connection between the fundamental compressed sensing (or heavy hitters) recovery problem and near-neighbor search, leading to new insight for geometric search problems and implications for sketching algorithms", "after": "nearest neighbor search, and our sketch, which consists entirely of short integer arrays, has a variety of attractive features in practice. We evaluate the memory-recall tradeoff of our method on a friend recommendation task in the Google Plus social media network. We obtain orders of magnitude better compression than the random projection based alternative while retaining the ability to report the nearest neighbors of practical queries", "start_char_pos": 553, "end_char_pos": 824}], "sents_char_pos": [0, 111, 339, 488, 574]} {"doc_id": "1902.07190", "revision_depth": "1", "before_revision": "The persistence diagram is an increasingly useful tool arising from the field of Topological Data Analysis . However, using these diagrams in conjunction with machine learning techniques requires some mathematical finesse. The most success to date has come from finding methods for turning persistence diagrams into vectors in \\mathbb{R in a way which preserves as much of the space of persistence diagrams as possible, commonly referred to as featurization. In this paper, we describe a mathematical framework for featurizing the persistence diagram space using template functions. These functions are general as they are only required to be continuous , have a compact support, and separate points . We discuss two example realizationsof these functions : tent functions and Chybeyshev interpolating polynomials. Both of these functions are defined on a grid superposed on the birth-lifetime plane. We then combine the resulting features with machine learning algorithms to perform supervised classification and regression on several example data sets, including manifold data, shape data , and an embedded time series from a Rossler system. Our results show that the template function approach yields high accuracy rates that match and often exceed the results of existing methods for featurizing persistence diagrams . One counter-intuitive observation is that in most cases using interpolating polynomials, where each point contributes globally to the feature vector, yields significantly better results than using tent functions, where the contribution of each point is localized to its grid cell . Along the way, we also provide a complete characterization of compact sets in persistence diagram space endowed with the bottleneck distance .", "after_revision": "The persistence diagram is an increasingly useful tool from Topological Data Analysis , but its use alongside typical machine learning techniques requires mathematical finesse. The most success to date has come from methods that map persistence diagrams into \\mathbb{R in a way which maximizes the structure preserved. This process is commonly referred to as featurization. In this paper, we describe a mathematical framework for featurization using template functions. These functions are general as they are only required to be continuous and compactly supported . We discuss two realizations : tent functions , which emphasize the local contributions of points in a persistence diagram, and interpolating polynomials, which capture global pairwise interactions. We combine the resulting features with classification and regression algorithms on several examples including shape data and the Rossler system. Our results show that using template functions yields high accuracy rates that match and often exceed those of existing featurization methods . One counter-intuitive observation is that in most cases using interpolating polynomials, where each point contributes globally to the feature vector, yields significantly better results than using tent functions, where the contribution of each point is localized . Along the way, we provide a complete characterization of compactness in the space of persistence diagrams .", "edit_actions": [{"type": "R", "before": "arising from the field of", "after": "from", "start_char_pos": 55, "end_char_pos": 80}, {"type": "R", "before": ". However, using these diagrams in conjunction with", "after": ", but its use alongside typical", "start_char_pos": 107, "end_char_pos": 158}, {"type": "D", "before": "some", "after": null, "start_char_pos": 196, "end_char_pos": 200}, {"type": "R", "before": "finding methods for turning", "after": "methods that map", "start_char_pos": 262, "end_char_pos": 289}, {"type": "R", "before": "vectors in \\mathbb{R", "after": "\\mathbb{R", "start_char_pos": 316, "end_char_pos": 336}, {"type": "R", "before": "preserves as much of the space of persistence diagrams as possible,", "after": "maximizes the structure preserved. This process is", "start_char_pos": 352, "end_char_pos": 419}, {"type": "R", "before": "featurizing the persistence diagram space", "after": "featurization", "start_char_pos": 515, "end_char_pos": 556}, {"type": "R", "before": ", have a compact support, and separate points", "after": "and compactly supported", "start_char_pos": 654, "end_char_pos": 699}, {"type": "R", "before": "example realizationsof these functions", "after": "realizations", "start_char_pos": 717, "end_char_pos": 755}, {"type": "R", "before": "and Chybeyshev interpolating polynomials. Both of these functions are defined on a grid superposed on the birth-lifetime plane. We then", "after": ", which emphasize the local contributions of points in a persistence diagram, and interpolating polynomials, which capture global pairwise interactions. We", "start_char_pos": 773, "end_char_pos": 908}, {"type": "D", "before": "machine learning algorithms to perform supervised", "after": null, "start_char_pos": 945, "end_char_pos": 994}, {"type": "R", "before": "on several example data sets, including manifold data, shape data , and an embedded time series from a", "after": "algorithms on several examples including shape data and the", "start_char_pos": 1025, "end_char_pos": 1127}, {"type": "R", "before": "the template function approach", "after": "using template functions", "start_char_pos": 1166, "end_char_pos": 1196}, {"type": "R", "before": "the results of existing methods for featurizing persistence diagrams", "after": "those of existing featurization methods", "start_char_pos": 1252, "end_char_pos": 1320}, {"type": "D", "before": "to its grid cell", "after": null, "start_char_pos": 1586, "end_char_pos": 1602}, {"type": "D", "before": "also", "after": null, "start_char_pos": 1623, "end_char_pos": 1627}, {"type": "R", "before": "compact sets in persistence diagram space endowed with the bottleneck distance", "after": "compactness in the space of persistence diagrams", "start_char_pos": 1667, "end_char_pos": 1745}], "sents_char_pos": [0, 108, 222, 458, 582, 701, 814, 900, 1143, 1322, 1604]} {"doc_id": "1902.10240", "revision_depth": "1", "before_revision": "Seagrass meadows are among the most important coastal ecosystems in terms of both spatial extent and ecosystem services but are declining worldwide. Understanding the drivers of seagrass meadow dynamics is essential for designing sound management, conservation and restoration strategies. However, the effect of clonality on the population genetics of natural populations understood, severely limiting our comprehension of the dynamics and connectivity of meadows. Here, we revisited population genetics data on 165 meadows of four seagrass species in light of recent theoretical developments, which provide new expectations for the distributions of genotypic and genetic polymorphism under increasing clonal rates . Contrasting shoot life span and rhizome turnover lead to the prediction of a decreasing influence of asexual reproduction along a gradient from Posidonia oceanica to Cymodocea nodosa, Zostera marinaand Zostera noltii , which should be reflected by decreasing departure from Hardy-Weinberg equilibrium (Fis) and increasing genotypic diversity (R). This meta-analysis provides a nested validation of this hypothesis at the species scale but also at the meadow scale through the emergence of a significant relationship between Fis and R within each species. By empirically demonstrating the theoretical expectations derived from recent modelling approaches, this work calls for the use of Hardy-Weinberg equilibrium (Fis) rather than the strongly sampling-sensitive genotypic index R in studies aiming at understanding the importance of clonal reproduction. We also emphasize the need to revise our perception of the influence of clonality on the dynamics, connectivity and evolutionary trajectory of seagrass meadows to develop the most accurate conservation strategies.", "after_revision": "Seagrass meadows are among the most important coastal ecosystems , in terms of both spatial extent and ecosystem services , but they are also declining worldwide. Understanding the drivers of seagrass meadow dynamics is essential for designing sound management, conservation , and restoration strategies. However, the poor knowledge of the effect of clonality on the population genetics of natural populations severely limits our understanding of the dynamics and connectivity of meadows. Recent modelling approaches have described the expected distributions of genotypic and genetic descriptors under increasing clonal rates. Here, in light of these recent theoretical developments, we revisited population genetic data for 165 meadows of four seagrass species . Contrasting shoot life span and rhizome turnover led to the prediction that the influence of asexual reproduction will increase along a gradient from Zostera noltii to Zostera marina, Cymodocea nodosa and Posidonia oceanica , which should be reflected by an increasing departure from Hardy-Weinberg equilibrium (Fis) and decreasing genotypic diversity (R). This meta-analysis provides a nested validation of this hypothesis at both the species and meadow scales through a significant relationship between Fis and R within each species. By empirically demonstrating the theoretical expectations derived from recent modelling approaches, this work calls for the use of Hardy-Weinberg equilibrium (Fis) rather than the strongly sampling-sensitive genotypic index R to assess the importance of clonal reproduction. The results also emphasize the need to revise our appraisal of the extent of clonality and its influence on the dynamics, connectivity and evolutionary trajectory of partial asexuals in general, including in seagrass meadows, to develop the most accurate management strategies.", "edit_actions": [{"type": "A", "before": null, "after": ",", "start_char_pos": 65, "end_char_pos": 65}, {"type": "R", "before": "but are", "after": ", but they are also", "start_char_pos": 121, "end_char_pos": 128}, {"type": "A", "before": null, "after": ",", "start_char_pos": 262, "end_char_pos": 262}, {"type": "A", "before": null, "after": "poor knowledge of the", "start_char_pos": 304, "end_char_pos": 304}, {"type": "R", "before": "understood, severely limiting our comprehension", "after": "severely limits our understanding", "start_char_pos": 375, "end_char_pos": 422}, {"type": "R", "before": "Here,", "after": "Recent modelling approaches have described the expected distributions of genotypic and genetic descriptors under increasing clonal rates. Here, in light of these recent theoretical developments,", "start_char_pos": 468, "end_char_pos": 473}, {"type": "R", "before": "genetics data on", "after": "genetic data for", "start_char_pos": 498, "end_char_pos": 514}, {"type": "D", "before": "in light of recent theoretical developments, which provide new expectations for the distributions of genotypic and genetic polymorphism under increasing clonal rates", "after": null, "start_char_pos": 552, "end_char_pos": 717}, {"type": "R", "before": "lead", "after": "led", "start_char_pos": 769, "end_char_pos": 773}, {"type": "R", "before": "of a decreasing", "after": "that the", "start_char_pos": 792, "end_char_pos": 807}, {"type": "A", "before": null, "after": "will increase", "start_char_pos": 842, "end_char_pos": 842}, {"type": "R", "before": "Posidonia oceanica to Cymodocea nodosa, Zostera marinaand Zostera noltii", "after": "Zostera noltii to Zostera marina, Cymodocea nodosa and Posidonia oceanica", "start_char_pos": 865, "end_char_pos": 937}, {"type": "R", "before": "decreasing", "after": "an increasing", "start_char_pos": 969, "end_char_pos": 979}, {"type": "R", "before": "increasing", "after": "decreasing", "start_char_pos": 1032, "end_char_pos": 1042}, {"type": "R", "before": "the species scale but also at the meadow scale through the emergence of", "after": "both the species and meadow scales through", "start_char_pos": 1138, "end_char_pos": 1209}, {"type": "R", "before": "in studies aiming at understanding", "after": "to assess", "start_char_pos": 1502, "end_char_pos": 1536}, {"type": "R", "before": "We", "after": "The results", "start_char_pos": 1576, "end_char_pos": 1578}, {"type": "R", "before": "perception of the influence of clonality", "after": "appraisal of the extent of clonality and its influence", "start_char_pos": 1617, "end_char_pos": 1657}, {"type": "R", "before": "seagrass meadows", "after": "partial asexuals in general, including in seagrass meadows,", "start_char_pos": 1719, "end_char_pos": 1735}, {"type": "R", "before": "conservation", "after": "management", "start_char_pos": 1765, "end_char_pos": 1777}], "sents_char_pos": [0, 149, 290, 467, 596, 1067, 1275, 1575]} {"doc_id": "1903.03304", "revision_depth": "1", "before_revision": "Spectral risk measures (SRMs) belongs to the family of coherent risk measures. A natural estimator for the class of spectral risk measures (SRMs ) has the form of L-statistics. In the literature, various authors have studied and derived the asymptotic properties of the estimator of SRM using the empirical distribution function. But no such estimator of SRM is studied considering distribution function estimator other than empirical cdf . We propose a kernel based estimator of SRM. We try to investigate the large sample properties of general L-statistics based on i.i.d cases and apply them to our kernel based estimatorof SRM . We prove that the estimator is strongly consistent and the estimator is asymptotically normal. We compare the finite sample performance of the kernel based estimator with that of empirical estimator of SRM using Monte Carlo simulation , where appropriate choice of smoothing parameter and the user's coefficient of risk aversion plays an important role . Based on our simulation study we have estimated the exponential SRM of four future index-that is Nikkei 225, Dax, FTSE 100 and Hang Seng using our proposed kernel based estimator .", "after_revision": "Spectral risk measures (SRMs) belong to the family of coherent risk measures. A natural estimator for the class of SRMs has the form of L-statistics. Various authors have studied and derived the asymptotic properties of the empirical estimator of SRM . We propose a kernel based estimator of SRM. We investigate the large sample properties of general L-statistics based on i.i.d and dependent observations and apply them to our estimator . We prove that it is strongly consistent and asymptotically normal. We compare the finite sample performance of our proposed kernel estimator with that of several existing estimators for different SRMs using Monte Carlo simulation . We observe that our proposed kernel estimator outperforms all the estimators . Based on our simulation study we have estimated the exponential SRM of four future indices-that is Nikkei 225, Dax, FTSE 100 , and Hang Seng . We also perform a backtesting exercise of SRM .", "edit_actions": [{"type": "R", "before": "belongs", "after": "belong", "start_char_pos": 30, "end_char_pos": 37}, {"type": "R", "before": "spectral risk measures (SRMs )", "after": "SRMs", "start_char_pos": 116, "end_char_pos": 146}, {"type": "R", "before": "In the literature, various", "after": "Various", "start_char_pos": 177, "end_char_pos": 203}, {"type": "R", "before": "estimator of SRM using the empirical distribution function. But no such", "after": "empirical", "start_char_pos": 270, "end_char_pos": 341}, {"type": "D", "before": "is studied considering distribution function estimator other than empirical cdf", "after": null, "start_char_pos": 359, "end_char_pos": 438}, {"type": "D", "before": "try to", "after": null, "start_char_pos": 488, "end_char_pos": 494}, {"type": "R", "before": "cases and", "after": "and dependent observations and", "start_char_pos": 574, "end_char_pos": 583}, {"type": "R", "before": "kernel based estimatorof SRM", "after": "estimator", "start_char_pos": 602, "end_char_pos": 630}, {"type": "R", "before": "the estimator", "after": "it", "start_char_pos": 647, "end_char_pos": 660}, {"type": "D", "before": "the estimator is", "after": null, "start_char_pos": 688, "end_char_pos": 704}, {"type": "R", "before": "the kernel based", "after": "our proposed kernel", "start_char_pos": 772, "end_char_pos": 788}, {"type": "R", "before": "empirical estimator of SRM", "after": "several existing estimators for different SRMs", "start_char_pos": 812, "end_char_pos": 838}, {"type": "R", "before": ", where appropriate choice of smoothing parameter and the user's coefficient of risk aversion plays an important role", "after": ". We observe that our proposed kernel estimator outperforms all the estimators", "start_char_pos": 868, "end_char_pos": 985}, {"type": "R", "before": "index-that", "after": "indices-that", "start_char_pos": 1071, "end_char_pos": 1081}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1111, "end_char_pos": 1111}, {"type": "R", "before": "using our proposed kernel based estimator", "after": ". We also perform a backtesting exercise of SRM", "start_char_pos": 1126, "end_char_pos": 1167}], "sents_char_pos": [0, 78, 176, 329, 440, 484, 727]} {"doc_id": "1903.04448", "revision_depth": "1", "before_revision": "Visual modes of communication are ubiquitous in modern life . Here we investigate drawing, the most basic form of visual communication. Communicative drawing poses a core challenge for theories of how vision and social cognition interact, requiring a detailed understanding of how sensory information and social context jointly determine what information is relevant to communicate. Participants (N=192) were paired in an online environment to play a sketching-based reference game. On each trial, both participants were shown the same four objects, but in different locations. The sketcher's goal was to draw one of these objects - the target - so that the viewer could select it from the array. There were two types of trials: close, where objects belonged to the same basic-level category, and far, where objects belonged to different categories. We found that people exploited information in common ground with their partner to efficiently communicate about the target : on far trials, sketchers achieved high recognition accuracy while applying fewer strokes, using less ink, and spending less time on their drawings than on close trials. We hypothesized that humans succeed in this task by recruiting two core competencies: (1) visual abstraction, the capacity to perceive the correspondence between an object and a drawing of it; and (2) pragmatic inference, the ability to infer what information would help a viewer distinguish the target from distractors. To evaluate this hypothesis, we developed a computational model of the sketcher that embodied both competencies , instantiated as a deep convolutional neural network nested within a probabilistic program. We found that this model fit human data well and outperformed lesioned variants , providing an algorithmically explicit theory of how perception and social cognition jointly support contextual flexibility in visual communication.", "after_revision": "Visual modes of communication are ubiquitous in modern life --- from maps to data plots to political cartoons . Here we investigate drawing, the most basic form of visual communication. Participants were paired in an online environment to play a drawing-based reference game. On each trial, both participants were shown the same four objects, but in different locations. The sketcher's goal was to draw one of these objects so that the viewer could select it from the array. On `close' trials, objects belonged to the same basic-level category, whereas on `far' trials objects belonged to different categories. We found that people exploited shared information to efficiently communicate about the target object : on far trials, sketchers achieved high recognition accuracy while applying fewer strokes, using less ink, and spending less time on their drawings than on close trials. We hypothesized that humans succeed in this task by recruiting two core faculties: visual abstraction, the ability to perceive the correspondence between an object and a drawing of it; and pragmatic inference, the ability to judge what information would help a viewer distinguish the target from distractors. To evaluate this hypothesis, we developed a computational model of the sketcher that embodied both faculties , instantiated as a deep convolutional neural network nested within a probabilistic program. We found that this model fit human data well and outperformed lesioned variants . Together, this work provides the first algorithmically explicit theory of how visual perception and social cognition jointly support contextual flexibility in visual communication.", "edit_actions": [{"type": "A", "before": null, "after": "--- from maps to data plots to political cartoons", "start_char_pos": 60, "end_char_pos": 60}, {"type": "R", "before": "Communicative drawing poses a core challenge for theories of how vision and social cognition interact, requiring a detailed understanding of how sensory information and social context jointly determine what information is relevant to communicate. Participants (N=192)", "after": "Participants", "start_char_pos": 137, "end_char_pos": 404}, {"type": "R", "before": "sketching-based", "after": "drawing-based", "start_char_pos": 452, "end_char_pos": 467}, {"type": "D", "before": "- the target -", "after": null, "start_char_pos": 632, "end_char_pos": 646}, {"type": "R", "before": "There were two types of trials: close, where", "after": "On `close' trials,", "start_char_pos": 698, "end_char_pos": 742}, {"type": "R", "before": "and far, where", "after": "whereas on `far' trials", "start_char_pos": 794, "end_char_pos": 808}, {"type": "R", "before": "information in common ground with their partner", "after": "shared information", "start_char_pos": 882, "end_char_pos": 929}, {"type": "A", "before": null, "after": "object", "start_char_pos": 974, "end_char_pos": 974}, {"type": "R", "before": "competencies: (1)", "after": "faculties:", "start_char_pos": 1218, "end_char_pos": 1235}, {"type": "R", "before": "capacity", "after": "ability", "start_char_pos": 1260, "end_char_pos": 1268}, {"type": "D", "before": "(2)", "after": null, "start_char_pos": 1343, "end_char_pos": 1346}, {"type": "R", "before": "infer", "after": "judge", "start_char_pos": 1383, "end_char_pos": 1388}, {"type": "R", "before": "competencies", "after": "faculties", "start_char_pos": 1566, "end_char_pos": 1578}, {"type": "R", "before": ", providing an", "after": ". Together, this work provides the first", "start_char_pos": 1752, "end_char_pos": 1766}, {"type": "A", "before": null, "after": "visual", "start_char_pos": 1806, "end_char_pos": 1806}], "sents_char_pos": [0, 62, 136, 383, 483, 578, 697, 850, 1145, 1338, 1466, 1671]} {"doc_id": "1903.05898", "revision_depth": "1", "before_revision": "IoT Edge intelligence requires Convolutional Neural Network (CNN) inference to take place in the edge device itself. ARM big.LITTLE architecture is at the heart of common commercial edge devices. It comprises of single-ISA heterogeneous multi-cores grouped in homogeneous clusters that enables performance and power trade-offs. However, high communication overhead involved in parallelization of computation from a convolution kernel across clusters is detrimental to throughput. We present an alternative framework called Pipe-it that employs a pipelined design to split the convolutional layers across clusters while limiting the parallelization of their respective kernels to the assigned clusters . We develop a performance prediction model that , from convolutional layer descriptors , predicts the execution time of each layer individually on all different core types and number of cores . Pipe-it then exploits the predictions to create a balanced pipeline using an efficient design space exploration algorithm. Pipe-it on average results in 39\\% higher throughput than the highest antecedent throughput.", "after_revision": "IoT Edge intelligence requires Convolutional Neural Network (CNN) inference to take place in the edge devices itself. ARM big.LITTLE architecture is at the heart of prevalent commercial edge devices. It comprises of single-ISA heterogeneous cores grouped into multiple homogeneous clusters that enable power and performance trade-offs. All cores are expected to be simultaneously employed in inference to attain maximal throughput. However, high communication overhead involved in parallelization of computations from convolution kernels across clusters is detrimental to throughput. We present an alternative framework called Pipe-it that employs pipelined design to split convolutional layers across clusters while limiting parallelization of their respective kernels to the assigned cluster . We develop a performance-prediction model that utilizes only the convolutional layer descriptors to predict the execution time of each layer individually on all permitted core configurations (type and count) . Pipe-it then exploits the predictions to create a balanced pipeline using an efficient design space exploration algorithm. Pipe-it on average results in a 39\\% higher throughput than the highest antecedent throughput.", "edit_actions": [{"type": "R", "before": "device", "after": "devices", "start_char_pos": 102, "end_char_pos": 108}, {"type": "R", "before": "common", "after": "prevalent", "start_char_pos": 164, "end_char_pos": 170}, {"type": "R", "before": "multi-cores grouped in", "after": "cores grouped into multiple", "start_char_pos": 237, "end_char_pos": 259}, {"type": "R", "before": "enables performance and power", "after": "enable power and performance", "start_char_pos": 286, "end_char_pos": 315}, {"type": "A", "before": null, "after": "All cores are expected to be simultaneously employed in inference to attain maximal throughput.", "start_char_pos": 328, "end_char_pos": 328}, {"type": "R", "before": "computation from a convolution kernel", "after": "computations from convolution kernels", "start_char_pos": 397, "end_char_pos": 434}, {"type": "D", "before": "a", "after": null, "start_char_pos": 545, "end_char_pos": 546}, {"type": "D", "before": "the", "after": null, "start_char_pos": 573, "end_char_pos": 576}, {"type": "D", "before": "the", "after": null, "start_char_pos": 629, "end_char_pos": 632}, {"type": "R", "before": "clusters", "after": "cluster", "start_char_pos": 693, "end_char_pos": 701}, {"type": "R", "before": "performance prediction model that , from", "after": "performance-prediction model that utilizes only the", "start_char_pos": 717, "end_char_pos": 757}, {"type": "R", "before": ", predicts", "after": "to predict", "start_char_pos": 790, "end_char_pos": 800}, {"type": "R", "before": "different core types and number of cores", "after": "permitted core configurations (type and count)", "start_char_pos": 854, "end_char_pos": 894}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1050, "end_char_pos": 1050}], "sents_char_pos": [0, 116, 195, 327, 480, 703, 1019]} {"doc_id": "1903.06731", "revision_depth": "1", "before_revision": "The \\Lambda-Wright--Fisher process describes the type-frequency evolution of an infinite population. We model frequency-dependent selection pressure with a general polynomial drift vanishing at the boundary. An appropriate decomposition of the drift allows us to construct a series of Moran-type models that converge under suitable conditions to the solution of the associated stochastic differential equation . The genealogical structure inherent in the graphical representation of these finite population models can be seen in the large population limit as a generalisation of the ancestral selection graph of Krone and Neuhauser. We introduce an ancestral process that keeps track of the sampling distribution along the ancestral structures and that satisfies a duality relation with the type-frequency process. We refer to it as Bernstein coefficient process and to the relation as Bernstein duality. The latter is a generalisation of the classic moment duality. Many classic results in the restricted setting of a moment duality generalise into our framework. In particular, we derive criteria for the accessibility of the boundary and determine the time to absorption. It turns out that multiple ancestral processes are associated to the same forward dynamics. We characterise the set of optimal ancestral structures and provide a recipe to construct them from the drift. In particular, this allows us to recover well-known ancestral structures of the literature .", "after_revision": " \\Lambda-Wright--Fisher processes provide a robust framework to describe the type-frequency evolution of an infinite neutral population. We add a polynomial drift to the corresponding stochastic differential equation to incorporate frequency-dependent selection. A decomposition of the drift allows us to approximate the solution of the stochastic differential equation by a sequence of Moran models . The genealogical structure underlying the Moran model leads in the large population limit to a generalisation of the ancestral selection graph of Krone and Neuhauser. Building on this object, we construct a continuous-time Markov chain and relate it to the forward process via a new form of duality, which we call Bernstein duality. We adapt classical methods based on the moment duality to determine the time to absorption and criteria for the accessibility of the boundaries; this extends a recent result by Gonz\\'alez Casanova and Span\\`o. An intriguing feature of the construction is that the same forward process is compatible with multiple backward models. In this context we introduce suitable notions for minimality among the ancestral processes and characterise the corresponding parameter sets. In this way we recover classic ancestral structures as minimal ones .", "edit_actions": [{"type": "D", "before": "The", "after": null, "start_char_pos": 0, "end_char_pos": 3}, {"type": "R", "before": "process describes", "after": "processes provide a robust framework to describe", "start_char_pos": 27, "end_char_pos": 44}, {"type": "A", "before": null, "after": "neutral", "start_char_pos": 89, "end_char_pos": 89}, {"type": "R", "before": "model", "after": "add a polynomial drift to the corresponding stochastic differential equation to incorporate", "start_char_pos": 105, "end_char_pos": 110}, {"type": "R", "before": "selection pressure with a general polynomial drift vanishing at the boundary. An appropriate", "after": "selection. A", "start_char_pos": 131, "end_char_pos": 223}, {"type": "R", "before": "construct a series of Moran-type models that converge under suitable conditions to", "after": "approximate", "start_char_pos": 264, "end_char_pos": 346}, {"type": "D", "before": "associated", "after": null, "start_char_pos": 367, "end_char_pos": 377}, {"type": "A", "before": null, "after": "by a sequence of Moran models", "start_char_pos": 411, "end_char_pos": 411}, {"type": "R", "before": "inherent in the graphical representation of these finite population models can be seen", "after": "underlying the Moran model leads", "start_char_pos": 441, "end_char_pos": 527}, {"type": "R", "before": "as", "after": "to", "start_char_pos": 558, "end_char_pos": 560}, {"type": "R", "before": "We introduce an ancestral process that keeps track of the sampling distribution along the ancestral structures and that satisfies a duality relation with the type-frequency process. We refer to it as Bernstein coefficient process and to the relation as Bernstein duality. The latter is a generalisation of the classic moment duality. Many classic results in the restricted setting of a moment duality generalise into our framework. In particular, we derive", "after": "Building on this object, we construct a continuous-time Markov chain and relate it to the forward process via a new form of duality, which we call Bernstein duality. We adapt classical methods based on the moment duality to determine the time to absorption and", "start_char_pos": 635, "end_char_pos": 1091}, {"type": "R", "before": "boundary and determine the time to absorption. It turns out that multiple ancestral processes are associated to", "after": "boundaries; this extends a recent result by Gonz\\'alez Casanova and Span\\`o. An intriguing feature of the construction is that", "start_char_pos": 1130, "end_char_pos": 1241}, {"type": "R", "before": "dynamics. We characterise the set of optimal ancestral structures and provide a recipe to construct them from the drift. In particular, this allows us to recover well-known ancestral structures of the literature", "after": "process is compatible with multiple backward models. In this context we introduce suitable notions for minimality among the ancestral processes and characterise the corresponding parameter sets. In this way we recover classic ancestral structures as minimal ones", "start_char_pos": 1259, "end_char_pos": 1470}], "sents_char_pos": [0, 101, 208, 413, 634, 816, 906, 968, 1066, 1176, 1268, 1379]} {"doc_id": "1904.01008", "revision_depth": "1", "before_revision": "The paper [ sorensen16 } ] presents and discusses results for a Quantum Moves game, BringHomeWater, where players have attempted to move a quantum state from one position to another in a simulated optical tweezer and atoms setup. The paper compares the player solutions to numerical methods that the authors discuss. In particular, [ sorensen16 } ] show evidence that the so-called Krotov optimization method krotov performs worse than solutions that the human players have come up with. Given the assumption that the Krotov method has been correctly applied, the evidence points to the fact that human players can outperform the Krotov method. This is the find and claim of [ sorensen16 } ] and it features prominent in the abstract of the paper. It leads the authors to conclude that 'players succeed where purely numerical optimization fails, and analysis of their solutions provide insights into the problem of optimization of a more profound and general nature.' While it seems clear from the presented data that human players have indeed outperformed a particular implementation of the Krotov algorithm (and, according to [ sorensen16 } ], as a consequence also algorithms like CRAB CRAB and evolutionary approaches evolve which perform worse than Krotov), there is no reason to believe that this finding is of any particular significance. In fact, as has been discussed first by D. Sels [ DSels ], a very simple approach using classical arguments can capture the BringHomeWater Quantum Moves game far better than the player approach. Furthermore, as also shown by [ DSels ], one of the simplest optimization algorithms available, Stochastic Ascent, can outperform all of the above. Here we elaborate on the method discussed by [ DSels ] and verify the conclusions put forward by D. Sels", "after_revision": "The paper [ S \\o}rensen et al., Nature 532 ] presents and discusses results for a Quantum Moves game, BringHomeWater, where players have attempted to move a quantum state from one position to another in a simulated optical tweezer and atoms setup. The paper compares the player solutions to numerical methods that the authors discuss. In particular, [ S \\o}rensen et al., Nature 532 ] show evidence that the so-called Krotov optimization method performs worse than solutions that the human players have come up with. Given the assumption that the Krotov method has been correctly applied, the evidence points to the fact that human players can outperform the Krotov method. This is the find and claim of [ S \\o}rensen et al., Nature 532 ] and it features prominent in the abstract of the paper. It leads the authors to conclude that 'players succeed where purely numerical optimization fails, and analysis of their solutions provide insights into the problem of optimization of a more profound and general nature.' While it seems clear from the presented data that human players have indeed outperformed a particular implementation of the Krotov algorithm (and, according to [ S \\o}rensen et al., Nature 532 ], as a consequence also algorithms like CRAB and evolutionary approaches which perform worse than Krotov), there is no reason to believe that this finding is of any particular significance. In fact, as has been discussed first by D. Sels [ D. Sels, Phys. Rev. A 97, 040302 ], a very simple approach using classical arguments can capture the BringHomeWater Quantum Moves game far better than the player approach. Furthermore, as also shown by [ D. Sels, Phys. Rev. A 97, 040302 ], one of the simplest optimization algorithms available, Stochastic Ascent, can outperform all of the above. Here we elaborate on the method discussed by [ D. Sels, Phys. Rev. A 97, 040302 ] and verify the conclusions put forward by D. Sels", "edit_actions": [{"type": "R", "before": "sorensen16", "after": "S", "start_char_pos": 12, "end_char_pos": 22}, {"type": "A", "before": null, "after": "\\o", "start_char_pos": 23, "end_char_pos": 23}, {"type": "A", "before": null, "after": "rensen et al., Nature 532", "start_char_pos": 24, "end_char_pos": 24}, {"type": "R", "before": "sorensen16", "after": "S", "start_char_pos": 334, "end_char_pos": 344}, {"type": "A", "before": null, "after": "\\o", "start_char_pos": 345, "end_char_pos": 345}, {"type": "A", "before": null, "after": "rensen et al., Nature 532", "start_char_pos": 346, "end_char_pos": 346}, {"type": "D", "before": "krotov", "after": null, "start_char_pos": 409, "end_char_pos": 415}, {"type": "R", "before": "sorensen16", "after": "S", "start_char_pos": 677, "end_char_pos": 687}, {"type": "A", "before": null, "after": "\\o", "start_char_pos": 688, "end_char_pos": 688}, {"type": "A", "before": null, "after": "rensen et al., Nature 532", "start_char_pos": 689, "end_char_pos": 689}, {"type": "R", "before": "sorensen16", "after": "S", "start_char_pos": 1130, "end_char_pos": 1140}, {"type": "A", "before": null, "after": "\\o", "start_char_pos": 1141, "end_char_pos": 1141}, {"type": "A", "before": null, "after": "rensen et al., Nature 532", "start_char_pos": 1142, "end_char_pos": 1142}, {"type": "D", "before": "CRAB", "after": null, "start_char_pos": 1189, "end_char_pos": 1193}, {"type": "D", "before": "evolve", "after": null, "start_char_pos": 1222, "end_char_pos": 1228}, {"type": "R", "before": "DSels", "after": "D. Sels, Phys. Rev. A 97, 040302", "start_char_pos": 1396, "end_char_pos": 1401}, {"type": "R", "before": "DSels", "after": "D. Sels, Phys. Rev. A 97, 040302", "start_char_pos": 1573, "end_char_pos": 1578}, {"type": "R", "before": "DSels", "after": "D. Sels, Phys. Rev. A 97, 040302", "start_char_pos": 1736, "end_char_pos": 1741}], "sents_char_pos": [0, 229, 316, 487, 644, 747, 967, 1345, 1540, 1688]} {"doc_id": "1904.05581", "revision_depth": "1", "before_revision": "The adaptive immune system can detect, respond to, and learn diverse pathogens from the past experience. While the clonal selection of the T helper (Th) cells is the simple and established mechanism for learning a better recognition of new pathogens, the question still remains unexplored is how the Th cells can learn to eliminate them by activating or deactivating appropriate immune cells after recognition . In this work, we address this problem by associating the adaptive immune URLanized by the Th cells with reinforcement learning (RL). By employing recent advancements of the deep RL, we show that the Th immune network can acquire the association of antigen patterns of pathogens and the effective responses to them . Moreover, the clonal selection as well as other inter-lymphocyte interactions are derived as a learning rule of the network. We also demonstrate that the stationary clone distribution after the learning shares characteristic features with those observed experimentally. Our theoretical framework can contribute to revising and renewing our understanding of adaptive immunity as a learning system.", "after_revision": "The adaptive immune system of vertebrates can detect, respond to, and memorize diverse pathogens from past experience. While the clonal selection of T helper (Th) cells is the simple and established mechanism to better recognize new pathogens, the question that still remains unexplored is how the Th cells can acquire better ways to bias the responses of immune cells for eliminating pathogens more efficiently by translating the recognized antigen information into regulatory signals . In this work, we address this problem by associating the adaptive immune URLanized by the Th cells with reinforcement learning (RL). By employing recent advancements of network-based RL, we show that the Th immune network can acquire the association between antigen patterns of and the effective responses to pathogens . Moreover, the clonal selection as well as other inter-cellular interactions are derived as a learning rule of the network. We also demonstrate that the stationary clone-size distribution after learning shares characteristic features with those observed experimentally. Our theoretical framework may contribute to revising and renewing our understanding of adaptive immunity as a learning system.", "edit_actions": [{"type": "A", "before": null, "after": "of vertebrates", "start_char_pos": 27, "end_char_pos": 27}, {"type": "R", "before": "learn", "after": "memorize", "start_char_pos": 56, "end_char_pos": 61}, {"type": "D", "before": "the", "after": null, "start_char_pos": 85, "end_char_pos": 88}, {"type": "D", "before": "the", "after": null, "start_char_pos": 136, "end_char_pos": 139}, {"type": "R", "before": "for learning a better recognition of", "after": "to better recognize", "start_char_pos": 200, "end_char_pos": 236}, {"type": "A", "before": null, "after": "that", "start_char_pos": 265, "end_char_pos": 265}, {"type": "R", "before": "learn to eliminate them by activating or deactivating appropriate immune cells after recognition", "after": "acquire better ways to bias the responses of immune cells for eliminating pathogens more efficiently by translating the recognized antigen information into regulatory signals", "start_char_pos": 315, "end_char_pos": 411}, {"type": "R", "before": "the deep", "after": "network-based", "start_char_pos": 583, "end_char_pos": 591}, {"type": "R", "before": "of", "after": "between", "start_char_pos": 659, "end_char_pos": 661}, {"type": "D", "before": "pathogens", "after": null, "start_char_pos": 682, "end_char_pos": 691}, {"type": "R", "before": "them", "after": "pathogens", "start_char_pos": 723, "end_char_pos": 727}, {"type": "R", "before": "inter-lymphocyte", "after": "inter-cellular", "start_char_pos": 778, "end_char_pos": 794}, {"type": "R", "before": "clone distribution after the", "after": "clone-size distribution after", "start_char_pos": 895, "end_char_pos": 923}, {"type": "R", "before": "can", "after": "may", "start_char_pos": 1026, "end_char_pos": 1029}], "sents_char_pos": [0, 105, 413, 546, 729, 854, 999]} {"doc_id": "1904.08505", "revision_depth": "1", "before_revision": "With the advance of technologies, machines are increasingly present in people's daily lives. Thus, there has been more and more effort for developing interfaces, such as dynamic gestures, that provide an intuitive way of interaction. Currently, the most common trend is to use multimodal data, as depth and skeleton information, to try to recognize dynamic gestures . However, the use of only color information would be more interesting, once RGB cameras are usually found in almost every public place, and could be used for gesture recognition without the need to install other equipment. The main problem with this approach is the difficulty of representing spatio-temporal information using just color. With this in mind, we propose a technique that we called Star RGB, capable of describing a videoclip containing a dynamic gestureas an RGB image. This image is then passed to a classifier formed by two Resnet CNN's , a soft-attention ensemble, and a multilayer perceptron, which returns the predicted class label that indicates to which type of gesture the input video belongs . Experiments were carried out using the Montalbano and GRIT datasets. On the Montalbano dataset, the proposed approach achieved an accuracy of 94.58\\% , this result reaches the state-of-the-art using this dataset , considering only color information. On the GRIT dataset, our proposal achieves more than 98\\% of accuracy, recall, precision, and F1-score, outperforming the reference approach in more than 6\\%.", "after_revision": "Due to the advance of technologies, machines are increasingly present in people's daily lives. Thus, there has been more and more effort to develop interfaces, such as dynamic gestures, that provide an intuitive way of interaction. Currently, the most common trend is to use multimodal data, as depth and skeleton information, to enable dynamic gesture recognition . However, using only color information would be more interesting, since RGB cameras are usually available in almost every public place, and could be used for gesture recognition without the need of installing other equipment. The main problem with such approach is the difficulty of representing spatio-temporal information using just color. With this in mind, we propose a technique capable of condensing a dynamic gesture, shown in a video, in just one RGB image. We call this technique star RGB. This image is then passed to a classifier formed by two Resnet CNNs , a soft-attention ensemble, and a fully connected layer, which indicates the class of the gesture present in the input video . Experiments were carried out using both Montalbano and GRIT datasets. For Montalbano dataset, the proposed approach achieved an accuracy of 94.58\\% . Such result reaches the state-of-the-art when considering this dataset and only color information. Regarding the GRIT dataset, our proposal achieves more than 98\\% of accuracy, recall, precision, and F1-score, outperforming the reference approach by more than 6\\%.", "edit_actions": [{"type": "R", "before": "With", "after": "Due to", "start_char_pos": 0, "end_char_pos": 4}, {"type": "R", "before": "for developing", "after": "to develop", "start_char_pos": 135, "end_char_pos": 149}, {"type": "R", "before": "try to recognize dynamic gestures", "after": "enable dynamic gesture recognition", "start_char_pos": 332, "end_char_pos": 365}, {"type": "R", "before": "the use of", "after": "using", "start_char_pos": 377, "end_char_pos": 387}, {"type": "R", "before": "once", "after": "since", "start_char_pos": 438, "end_char_pos": 442}, {"type": "R", "before": "found", "after": "available", "start_char_pos": 467, "end_char_pos": 472}, {"type": "R", "before": "to install", "after": "of installing", "start_char_pos": 562, "end_char_pos": 572}, {"type": "R", "before": "this", "after": "such", "start_char_pos": 612, "end_char_pos": 616}, {"type": "R", "before": "that we called Star RGB, capable of describing a videoclip containing a dynamic gestureas an", "after": "capable of condensing a dynamic gesture, shown in a video, in just one", "start_char_pos": 748, "end_char_pos": 840}, {"type": "A", "before": null, "after": "We call this technique star RGB.", "start_char_pos": 852, "end_char_pos": 852}, {"type": "R", "before": "CNN's", "after": "CNNs", "start_char_pos": 916, "end_char_pos": 921}, {"type": "R", "before": "multilayer perceptron, which returns the predicted class label that indicates to which type of gesture", "after": "fully connected layer, which indicates the class of the gesture present in", "start_char_pos": 957, "end_char_pos": 1059}, {"type": "D", "before": "belongs", "after": null, "start_char_pos": 1076, "end_char_pos": 1083}, {"type": "R", "before": "the", "after": "both", "start_char_pos": 1121, "end_char_pos": 1124}, {"type": "R", "before": "On the", "after": "For", "start_char_pos": 1155, "end_char_pos": 1161}, {"type": "R", "before": ", this", "after": ". Such", "start_char_pos": 1236, "end_char_pos": 1242}, {"type": "R", "before": "using this dataset , considering", "after": "when considering this dataset and", "start_char_pos": 1279, "end_char_pos": 1311}, {"type": "R", "before": "On", "after": "Regarding", "start_char_pos": 1336, "end_char_pos": 1338}, {"type": "R", "before": "in", "after": "by", "start_char_pos": 1477, "end_char_pos": 1479}], "sents_char_pos": [0, 92, 233, 367, 589, 705, 851, 1154, 1335]} {"doc_id": "1904.09406", "revision_depth": "1", "before_revision": "We introduce DeepMoD, a deep learning based model discovery algorithmwhich seeks the partial differential equation underlying a spatio-temporal data set . DeepMoD employs sparse regression on a library of basis functions and their corresponding spatial derivatives. A feed-forward neural network approximates the data set and automatic differentiation is used to construct this function libraryand perform regression within the neural network . This construction makes it extremely robust to noise and applicable to small data sets and, contrary to other deep learning methods, does not require a training set and is impervious to overfitting. We illustrate this approach on several physical problems , such as the Burgers', Korteweg-de Vries , advection-diffusion and Keller-Segel equations, and find that it requires as few as O (10^2) samples and works at noise levels up to 75 \\%. This resilience to noise and high performance at very few samples highlights the potential of this method to be applied on experimental data. Code and examples available at URL%DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% \\\\%DIF > . Motivated by these results, we apply DeepMoD directly on noisy experimental time-series data from a gel electrophoresis experiment and find that it discovers the advection-diffusion equation describing this system.", "after_revision": "We introduce DeepMoD, a Deep learning based Model Discovery algorithm. DeepMoD discovers the partial differential equation underlying a spatio-temporal data set using sparse regression on a library of possible functions and their derivatives. A neural network approximates the data and constructs the function library, but it also performs the sparse regression . This construction makes it extremely robust to noise , applicable to small data sets , and, contrary to other deep learning methods, does not require a training set . We benchmark our approach on several physical problems such as the Burgers', Korteweg-de Vries and Keller-Segel equations, and find that it requires as few as \\mathcal{O (10^2) samples and works at noise levels up to 75 %DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% \\\\%DIF > . Motivated by these results, we apply DeepMoD directly on noisy experimental time-series data from a gel electrophoresis experiment and find that it discovers the advection-diffusion equation describing this system.", "edit_actions": [{"type": "R", "before": "deep learning based model discovery algorithmwhich seeks", "after": "Deep learning based Model Discovery algorithm. DeepMoD discovers", "start_char_pos": 24, "end_char_pos": 80}, {"type": "R", "before": ". DeepMoD employs", "after": "using", "start_char_pos": 153, "end_char_pos": 170}, {"type": "R", "before": "basis", "after": "possible", "start_char_pos": 205, "end_char_pos": 210}, {"type": "D", "before": "corresponding spatial", "after": null, "start_char_pos": 231, "end_char_pos": 252}, {"type": "D", "before": "feed-forward", "after": null, "start_char_pos": 268, "end_char_pos": 280}, {"type": "R", "before": "set and automatic differentiation is used to construct this function libraryand perform regression within the neural network", "after": "and constructs the function library, but it also performs the sparse regression", "start_char_pos": 318, "end_char_pos": 442}, {"type": "R", "before": "and", "after": ",", "start_char_pos": 498, "end_char_pos": 501}, {"type": "A", "before": null, "after": ",", "start_char_pos": 532, "end_char_pos": 532}, {"type": "R", "before": "and is impervious to overfitting. We illustrate this", "after": ". We benchmark our", "start_char_pos": 611, "end_char_pos": 663}, {"type": "D", "before": ",", "after": null, "start_char_pos": 702, "end_char_pos": 703}, {"type": "D", "before": ", advection-diffusion", "after": null, "start_char_pos": 744, "end_char_pos": 765}, {"type": "R", "before": "O", "after": "\\mathcal{O", "start_char_pos": 830, "end_char_pos": 831}, {"type": "D", "before": "\\%. This resilience to noise and high performance at very few samples highlights the potential of this method to be applied on experimental data. Code and examples available at URL", "after": null, "start_char_pos": 882, "end_char_pos": 1062}], "sents_char_pos": [0, 265, 444, 644, 885, 1027]} {"doc_id": "1904.11156", "revision_depth": "1", "before_revision": "The goal of this paper is to provide some statistical tools for nonparametric estimation and inference in psychological and economic experiments. We consider a framework in which a quantity of interest depends on some primitives through an unknown function f. An estimator of this unknown function can be obtained from a controlled experiment in which n subjects are gathered, and a vector of stimuli is administered to each subject who provides a set of T responses . We propose to estimate f nonparametrically using the method of sieves. We provide conditions for consistency of this estimator when either n or T or both divergeto infinity, and when the answers of each subject are correlated and this correlation differs across subjects. We further demonstrate that the rate of convergence depends upon the covariance structure of the error term taken across individuals. A convergence rate is also obtained for derivatives. These results allow us to derive the optimal divergence rate of the dimension of the sieve basis with both n and T and thus provide guidance about the optimal balance between the number of subjects and the number of questions in a laboratory experiment . We argue that in general a large value of n is better than a large value of T. Conditions for asymptotic normality of linear and nonlinear functionals of the estimated function of interest are derived. These results are further applied to obtain the asymptotic distribution of the Wald test when the number of constraints under the null is finite and when it diverges to infinity along with other asymptotic parameters. Lastly, we investigate the properties of the previous test when the conditional covariance matrix is replaced by a consistent estimator.", "after_revision": "The goal of this paper is to provide some tools for nonparametric estimation and inference in psychological and economic experiments. We consider an experimental framework in which each of nsubjects provides T responses to a vector of T stimuli . We propose to estimate the unknown function f linking stimuli to responses through a nonparametric sieve estimator. We give conditions for consistency when either nor Tor both diverge. The rate of convergence depends upon the error covariance structure, that is allowed to differ across subjects. With these results we derive the optimal divergence rate of the dimension of the sieve basis with both n and T . We provide guidance about the optimal balance between the number of subjects and questions in a laboratory experiment and argue that a large nis often better than a large T. We derive conditions for asymptotic normality of functionals of the estimator of Tand apply them to obtain the asymptotic distribution of the Wald test when the number of constraints under the null is finite and when it diverges along with other asymptotic parameters. Lastly, we investigate the previous properties when the conditional covariance matrix is replaced by an estimator.", "edit_actions": [{"type": "D", "before": "statistical", "after": null, "start_char_pos": 42, "end_char_pos": 53}, {"type": "R", "before": "a", "after": "an experimental", "start_char_pos": 158, "end_char_pos": 159}, {"type": "R", "before": "a quantity of interest depends on some primitives through an unknown function f. An estimator of this unknown function can be obtained from a controlled experiment in which n subjects are gathered, and a vector of stimuli is administered to each subject who provides a set of T responses", "after": "each of nsubjects provides T responses to a vector of T stimuli", "start_char_pos": 179, "end_char_pos": 466}, {"type": "R", "before": "f nonparametrically using the method of sieves. We provide", "after": "the unknown function f linking stimuli to responses through a nonparametric sieve estimator. We give", "start_char_pos": 492, "end_char_pos": 550}, {"type": "R", "before": "of this estimator when either n or T or both divergeto infinity, and when the answers of each subject are correlated and this correlation differs across subjects. We further demonstrate that the", "after": "when either nor Tor both diverge. The", "start_char_pos": 578, "end_char_pos": 772}, {"type": "R", "before": "covariance structure of the error term taken across individuals. A convergence rate is also obtained for derivatives. These results allow us to", "after": "error covariance structure, that is allowed to differ across subjects. With these results we", "start_char_pos": 810, "end_char_pos": 953}, {"type": "R", "before": "and thus", "after": ". We", "start_char_pos": 1043, "end_char_pos": 1051}, {"type": "D", "before": "the number of", "after": null, "start_char_pos": 1130, "end_char_pos": 1143}, {"type": "R", "before": ". We argue that in general a large value of n is", "after": "and argue that a large nis often", "start_char_pos": 1181, "end_char_pos": 1229}, {"type": "R", "before": "value of T. Conditions", "after": "T. We derive conditions", "start_char_pos": 1250, "end_char_pos": 1272}, {"type": "D", "before": "linear and nonlinear", "after": null, "start_char_pos": 1301, "end_char_pos": 1321}, {"type": "R", "before": "estimated function of interest are derived. These results are further applied", "after": "estimator of Tand apply them", "start_char_pos": 1341, "end_char_pos": 1418}, {"type": "D", "before": "to infinity", "after": null, "start_char_pos": 1551, "end_char_pos": 1562}, {"type": "R", "before": "properties of the previous test", "after": "previous properties", "start_char_pos": 1630, "end_char_pos": 1661}, {"type": "R", "before": "a consistent", "after": "an", "start_char_pos": 1716, "end_char_pos": 1728}], "sents_char_pos": [0, 145, 259, 468, 539, 740, 874, 927, 1182, 1384, 1602]} {"doc_id": "1904.12420", "revision_depth": "1", "before_revision": "During muscle contraction, myosin motors anchored on thick filaments bind to and slide actin thin filaments. These motors rely on ATP, supplied at the limits of diffusion from the sarcoplasm to the interior of the lattice of actin and myosin . Classic sliding filament theory suggests that lattice spacing is constant . If so, then the lattice changes volume during contraction and could provide fluid motion and hence assist in transport of molecules between the contractile lattice and surrounding intracellular space. If, however, the lattice is isovolumetric, it must expand when muscle shortens. Doing so would alter the binding dynamics of myosin which are sensitive to spacing. We first create a convective-diffusive flow model and show that flow into and out of the sarcomere lattice would be significant in the absence of lattice expansion. Convective transport coupled to diffusion has the potential to substantially enhance metabolite exchange within the crowded sarcomere. Using time resolved x-ray diffraction of contracting muscle we next show that the contractile lattice is neither isovolumetric , nor constant in spacing. Instead lattice spacing is time-varying, depends on activation, and can manifest a negative (auxetic) Poisson ratio. This unusual material behavior arises from the multiscale interaction of muscle axial strain, lattice spacing and myosin binding. The resulting fluid flow in the sarcomere lattice is even greater than would be expected from constant lattice spacing conditions. Akin to ``breathing,'' convective-diffusive transport in sarcomeres is sufficient to promote metabolite exchange , and may play a role in the regulation of contraction itself.", "after_revision": "During muscle contraction, myosin motors anchored to thick filaments bind to and slide actin thin filaments. These motors rely on energy derived from ATP, supplied , in part, by diffusion from the sarcoplasm to the interior of the lattice of actin and myosin filaments. The radial spacing of filaments in this lattice may change or remain constant during during contraction. If the lattice is isovolumetric, it must expand when the muscle shortens. If, however, the spacing is constant or has a different pattern of axial and radial motion, then the lattice changes volume during contraction , driving fluid motion and assisting in the transport of molecules between the contractile lattice and the surrounding intracellular space. We first create an advective-diffusive-reaction flow model and show that the flow into and out of the sarcomere lattice would be significant in the absence of lattice expansion. Advective transport coupled to diffusion has the potential to substantially enhance metabolite exchange within the crowded sarcomere. Using time-resolved x-ray diffraction of contracting muscle , we next show that the contractile lattice is neither isovolumetric nor constant in spacing. Instead , lattice spacing is time-varying, depends on activation, and can manifest as an effective time-varying Poisson ratio. The resulting fluid flow in the sarcomere lattice of synchronous insect flight muscles is even greater than expected from constant lattice spacing conditions. Volume change and advective solute transport varies with the phase of muscle stimulation during periodic contraction but remains significant at all conditions. Nonetheless, advective transport varies will occur in all cases where the sarcomere is not isovolumetric. Akin to \"breathing,\" advective-diffusive transport in sarcomeres is sufficient to promote metabolite exchange and may play a role in the regulation of contraction itself.", "edit_actions": [{"type": "R", "before": "on", "after": "to", "start_char_pos": 50, "end_char_pos": 52}, {"type": "A", "before": null, "after": "energy derived from", "start_char_pos": 130, "end_char_pos": 130}, {"type": "R", "before": "at the limits of", "after": ", in part, by", "start_char_pos": 145, "end_char_pos": 161}, {"type": "R", "before": ". Classic sliding filament theory suggests that lattice spacing is constant . If so,", "after": "filaments. The radial spacing of filaments in this lattice may change or remain constant during during contraction. If the lattice is isovolumetric, it must expand when the muscle shortens. If, however, the spacing is constant or has a different pattern of axial and radial motion,", "start_char_pos": 243, "end_char_pos": 327}, {"type": "R", "before": "and could provide", "after": ", driving", "start_char_pos": 379, "end_char_pos": 396}, {"type": "R", "before": "hence assist in", "after": "assisting in the", "start_char_pos": 414, "end_char_pos": 429}, {"type": "A", "before": null, "after": "the", "start_char_pos": 489, "end_char_pos": 489}, {"type": "D", "before": "If, however, the lattice is isovolumetric, it must expand when muscle shortens. Doing so would alter the binding dynamics of myosin which are sensitive to spacing.", "after": null, "start_char_pos": 523, "end_char_pos": 686}, {"type": "R", "before": "a convective-diffusive", "after": "an advective-diffusive-reaction", "start_char_pos": 703, "end_char_pos": 725}, {"type": "A", "before": null, "after": "the", "start_char_pos": 751, "end_char_pos": 751}, {"type": "R", "before": "Convective", "after": "Advective", "start_char_pos": 853, "end_char_pos": 863}, {"type": "R", "before": "time resolved", "after": "time-resolved", "start_char_pos": 994, "end_char_pos": 1007}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1048, "end_char_pos": 1048}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1116, "end_char_pos": 1117}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1151, "end_char_pos": 1151}, {"type": "R", "before": "a negative (auxetic)", "after": "as an effective time-varying", "start_char_pos": 1225, "end_char_pos": 1245}, {"type": "D", "before": "This unusual material behavior arises from the multiscale interaction of muscle axial strain, lattice spacing and myosin binding.", "after": null, "start_char_pos": 1261, "end_char_pos": 1390}, {"type": "A", "before": null, "after": "of synchronous insect flight muscles", "start_char_pos": 1441, "end_char_pos": 1441}, {"type": "D", "before": "would be", "after": null, "start_char_pos": 1463, "end_char_pos": 1471}, {"type": "R", "before": "Akin to ``breathing,'' convective-diffusive", "after": "Volume change and advective solute transport varies with the phase of muscle stimulation during periodic contraction but remains significant at all conditions. Nonetheless, advective transport varies will occur in all cases where the sarcomere is not isovolumetric. Akin to \"breathing,\" advective-diffusive", "start_char_pos": 1523, "end_char_pos": 1566}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1636, "end_char_pos": 1637}], "sents_char_pos": [0, 108, 320, 522, 602, 686, 852, 987, 1142, 1260, 1390, 1522]} {"doc_id": "1904.13086", "revision_depth": "2", "before_revision": "AI and advanced automation are involved in almost all aspects of our life. In the interaction with such systems, human causal responsibility for the outcomes becomes equivocal. We analyze the descriptive abilities of a newly developed responsibility quantification model (ResQu) to predict actual human responsibility and perceptions of responsibility in the interaction with intelligent systems. In two laboratory experiments, participants performed a classification task , and were aided by binary automated classification systems with different capabilities. We compared the theoretical responsibility values , predicted by the ResQu model, to the actual measured responsibility participants took on and to their subjective ranking of responsibility. The ResQu model predictions were strongly correlated with both measured and subjective responsibility. The model generally provided quite accurate predictions of the actual values of the measured responsibility. A bias existed only when participants ' classification capabilities were much worse than those of the automated classification system. In this case, the participants overestimated their own capabilities, relied less-than-optimally on the automated system and assumed greater-than-optimal responsibility. The results demonstrate the value of the ResQu model as a descriptive model, considering some systematic deviations. It is possible to compute a ResQu model score to predict behavior or perceptions of responsibility , taking into account the characteristics of the human, the intelligent system and the environment . The ResQu model provides a new quantitative method that may aid system design and guide policy and legal decisions , regarding human responsibility in events involving intelligent systems.", "after_revision": "When humans interact with intelligent systems, their causal responsibility for outcomes becomes equivocal. We analyze the descriptive abilities of a newly developed responsibility quantification model (ResQu) to predict actual human responsibility and perceptions of responsibility in the interaction with intelligent systems. In two laboratory experiments, participants performed a classification task . They were aided by classification systems with different capabilities. We compared the predicted theoretical responsibility values to the actual measured responsibility participants took on and to their subjective rankings of responsibility. The model predictions were strongly correlated with both measured and subjective responsibility. A bias existed only when participants with poor classification capabilities relied less-than-optimally on a system that had superior classification capabilities and assumed higher-than-optimal responsibility. The study implies that when humans interact with advanced intelligent systems, with capabilities that greatly exceed their own, their comparative causal responsibility will be small, even if formally the human is assigned major roles. Simply putting a human into the loop does not assure that the human will meaningfully contribute to the outcomes. The results demonstrate the descriptive value of the ResQu model to predict behavior and perceptions of responsibility by considering the characteristics of the human, the intelligent system , the environment and some systematic behavioral biases . The ResQu model is a new quantitative method that can be used in system design and can guide policy and legal decisions regarding human responsibility in events involving intelligent systems.", "edit_actions": [{"type": "R", "before": "AI and advanced automation are involved in almost all aspects of our life. In the interaction with such systems, human", "after": "When humans interact with intelligent systems, their", "start_char_pos": 0, "end_char_pos": 118}, {"type": "D", "before": "the", "after": null, "start_char_pos": 145, "end_char_pos": 148}, {"type": "R", "before": ", and", "after": ". They", "start_char_pos": 473, "end_char_pos": 478}, {"type": "D", "before": "binary automated", "after": null, "start_char_pos": 493, "end_char_pos": 509}, {"type": "A", "before": null, "after": "predicted", "start_char_pos": 578, "end_char_pos": 578}, {"type": "D", "before": ", predicted by the ResQu model,", "after": null, "start_char_pos": 613, "end_char_pos": 644}, {"type": "R", "before": "ranking", "after": "rankings", "start_char_pos": 728, "end_char_pos": 735}, {"type": "D", "before": "ResQu", "after": null, "start_char_pos": 759, "end_char_pos": 764}, {"type": "D", "before": "The model generally provided quite accurate predictions of the actual values of the measured responsibility.", "after": null, "start_char_pos": 858, "end_char_pos": 966}, {"type": "R", "before": "' classification capabilities were much worse than those of the automated classification system. In this case, the participants overestimated their own capabilities,", "after": "with poor classification capabilities", "start_char_pos": 1005, "end_char_pos": 1170}, {"type": "R", "before": "the automated system and assumed greater-than-optimal", "after": "a system that had superior classification capabilities and assumed higher-than-optimal", "start_char_pos": 1201, "end_char_pos": 1254}, {"type": "A", "before": null, "after": "study implies that when humans interact with advanced intelligent systems, with capabilities that greatly exceed their own, their comparative causal responsibility will be small, even if formally the human is assigned major roles. Simply putting a human into the loop does not assure that the human will meaningfully contribute to the outcomes. The", "start_char_pos": 1275, "end_char_pos": 1275}, {"type": "A", "before": null, "after": "descriptive", "start_char_pos": 1300, "end_char_pos": 1300}, {"type": "R", "before": "as a descriptive model, considering some systematic deviations. It is possible to compute a ResQu model score to predict behavior or", "after": "to predict behavior and", "start_char_pos": 1326, "end_char_pos": 1458}, {"type": "R", "before": ", taking into account", "after": "by considering", "start_char_pos": 1489, "end_char_pos": 1510}, {"type": "R", "before": "and the environment", "after": ", the environment and some systematic behavioral biases", "start_char_pos": 1568, "end_char_pos": 1587}, {"type": "R", "before": "provides", "after": "is", "start_char_pos": 1606, "end_char_pos": 1614}, {"type": "R", "before": "may aid", "after": "can be used in", "start_char_pos": 1646, "end_char_pos": 1653}, {"type": "A", "before": null, "after": "can", "start_char_pos": 1672, "end_char_pos": 1672}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1706, "end_char_pos": 1707}], "sents_char_pos": [0, 74, 176, 396, 561, 754, 857, 966, 1101, 1270, 1389, 1589]} {"doc_id": "1905.03229", "revision_depth": "2", "before_revision": "With the improvement of pattern recognition and feature extraction of Deep Neural Networks ( DNNs), more and more problems are attempted to solve from the view of images . Recently, a Reconstructive Neural Network (ReConNN) was proposed to obtain an image-based model from an analysis-based model , which can help us to solve many high frequency problems with difficult sampling, e.g. sonic wave and collision. However, due to the slight difference between simulated images, the low-accuracy of the Convolutional Neural Network ( CNN)and poor-diversity of the Generative Adversarial Network (GAN) make the reconstruction process low-accuracy, poor-efficiency, expensive-computation and high-manpower. In this study, an improved ReConNN model is proposed to address the mentioned weaknesses. Through experiments, comparisons and analyses, the improved one is demonstrated to outperform in accuracy, efficiency and cost .", "after_revision": "With the improvement of the pattern recognition and feature extraction of Deep Neural Networks ( DPNNs), image-based design and optimization have been widely used in multidisciplinary researches . Recently, a Reconstructive Neural Network (ReConNN) has been proposed to obtain an image-based model from an analysis-based model 1, 2 , and a steady-state heat transfer of a heat sink has been successfully reconstructed. Commonly, this method is suitable to handle stable-state problems. However, it has difficulties handling nonlinear transient impact problems, due to the bottlenecks of the Deep Neural Network ( DPNN). For example, nonlinear transient problems make it difficult for the Generative Adversarial Network (GAN) to generate various reasonable images. Therefore, in this study, an improved ReConNN method is proposed to address the mentioned weaknesses. Time-dependent ordered images can be generated. Furthermore, the improved method is successfully applied in impact simulation case and engineering experiment. Through the experiments, comparisons and analyses, the improved method is demonstrated to outperform the former one in terms of its accuracy, efficiency and costs .", "edit_actions": [{"type": "A", "before": null, "after": "the", "start_char_pos": 24, "end_char_pos": 24}, {"type": "R", "before": "DNNs), more and more problems are attempted to solve from the view of images", "after": "DPNNs), image-based design and optimization have been widely used in multidisciplinary researches", "start_char_pos": 94, "end_char_pos": 170}, {"type": "R", "before": "was", "after": "has been", "start_char_pos": 225, "end_char_pos": 228}, {"type": "R", "before": ", which can help us to solve many high frequency problems with difficult sampling, e.g. sonic wave and collision. However,", "after": "1, 2", "start_char_pos": 298, "end_char_pos": 420}, {"type": "A", "before": null, "after": ", and a steady-state heat transfer of a heat sink has been successfully reconstructed. Commonly, this method is suitable to handle stable-state problems. However, it has difficulties handling nonlinear transient impact problems,", "start_char_pos": 421, "end_char_pos": 421}, {"type": "R", "before": "slight difference between simulated images, the low-accuracy of the Convolutional", "after": "bottlenecks of the Deep", "start_char_pos": 433, "end_char_pos": 514}, {"type": "R", "before": "CNN)and poor-diversity of", "after": "DPNN). For example, nonlinear transient problems make it difficult for", "start_char_pos": 532, "end_char_pos": 557}, {"type": "R", "before": "make the reconstruction process low-accuracy, poor-efficiency, expensive-computation and high-manpower. In", "after": "to generate various reasonable images. Therefore, in", "start_char_pos": 599, "end_char_pos": 705}, {"type": "R", "before": "model", "after": "method", "start_char_pos": 738, "end_char_pos": 743}, {"type": "R", "before": "Through", "after": "Time-dependent ordered images can be generated. Furthermore, the improved method is successfully applied in impact simulation case and engineering experiment. Through the", "start_char_pos": 793, "end_char_pos": 800}, {"type": "R", "before": "one", "after": "method", "start_char_pos": 853, "end_char_pos": 856}, {"type": "R", "before": "in", "after": "the former one in terms of its", "start_char_pos": 887, "end_char_pos": 889}, {"type": "R", "before": "cost", "after": "costs", "start_char_pos": 915, "end_char_pos": 919}], "sents_char_pos": [0, 411, 702, 792]} {"doc_id": "1905.09647", "revision_depth": "1", "before_revision": "In the past decade, Bitcoin has become an emerging asset class well known to most people because of their extraordinary return potential in phases of extreme price growth and their unpredictable massive crashes. We apply the LPPLS confidence indicator as a diagnostic tool for identifying bubbles using the daily data of Bitcoin price in the past two years. We find that the LPPLS confidence indicator based on the daily data of Bitcoin price fails to provide effective warnings for detecting the bubbles when the Bitcoin price suffers from a large fluctuation in a short time, especially for positive bubbles. In order to diagnose the existence of bubbles and accurately predict the bubble crashes in the cryptocurrency market, this study proposes an adaptive multilevel time series detection methodology based on the LPPLS model . We adopt two levels of time series, 1 hour and 30 minutes, to demonstrate the adaptive multilevel time series detection methodology. The results show that the LPPLS confidence indicator based on the adaptive multilevel time series detection methodology have not only an outstanding performance to effectively detect the bubbles and accurately forecast the bubble crashes, but can also monitor the development and the crash of bubbles even if a bubble exists in a short time. In addition, we discover that the short-term LPPLS confidence indicator greatly affected by the extreme fluctuations of Bitcoin price can provide some useful insights into the bubble status on a shorter time scale , and the long-term LPPLS confidence indicator has a stable performance in terms of effectively monitoring the bubble status on a longer time scale . The adaptive multilevel time series detection methodology can provide real-time detection of bubbles and advanced forecast to warn of an imminent crash riskin not only the cryptocurrency market but also the other financial markets .", "after_revision": "In the past decade, Bitcoin as an emerging asset class has gained widespread public attention because of their extraordinary returns in phases of extreme price growth and their unpredictable massive crashes. We apply the log-periodic power law singularity (LPPLS) confidence indicator as a diagnostic tool for identifying bubbles using the daily data on Bitcoin price in the past two years. We find that the LPPLS confidence indicator based on the daily Bitcoin price data fails to provide effective warnings for detecting the bubbles when the Bitcoin price suffers from a large fluctuation in a short time, especially for positive bubbles. In order to diagnose the existence of bubbles and accurately predict the bubble crashes in the cryptocurrency market, this study proposes an adaptive multilevel time series detection methodology based on the LPPLS model and finer (than daily) timescale for the Bitcoin price data . We adopt two levels of time series, 1 hour and 30 minutes, to demonstrate the adaptive multilevel time series detection methodology. The results show that the LPPLS confidence indicator based on this new method is an outstanding instrument to effectively detect the bubbles and accurately forecast the bubble crashes, even if a bubble exists in a short time. In addition, we discover that the short-term LPPLS confidence indicator highly sensitive to the extreme fluctuations of Bitcoin price can provide some useful insights into the bubble status on a shorter time scale - on a day to week scale , and the long-term LPPLS confidence indicator has a stable performance in terms of effectively monitoring the bubble status on a longer time scale - on a week to month scale . The adaptive multilevel time series detection methodology can provide real-time detection of bubbles and advanced forecast of crashes to warn of the imminent risk .", "edit_actions": [{"type": "R", "before": "has become", "after": "as", "start_char_pos": 28, "end_char_pos": 38}, {"type": "R", "before": "well known to most people", "after": "has gained widespread public attention", "start_char_pos": 63, "end_char_pos": 88}, {"type": "R", "before": "return potential", "after": "returns", "start_char_pos": 120, "end_char_pos": 136}, {"type": "R", "before": "LPPLS", "after": "log-periodic power law singularity (LPPLS)", "start_char_pos": 225, "end_char_pos": 230}, {"type": "R", "before": "of", "after": "on", "start_char_pos": 318, "end_char_pos": 320}, {"type": "R", "before": "data of Bitcoin price", "after": "Bitcoin price data", "start_char_pos": 421, "end_char_pos": 442}, {"type": "A", "before": null, "after": "and finer (than daily) timescale for the Bitcoin price data", "start_char_pos": 831, "end_char_pos": 831}, {"type": "R", "before": "the adaptive multilevel time series detection methodology have not only an outstanding performance", "after": "this new method is an outstanding instrument", "start_char_pos": 1029, "end_char_pos": 1127}, {"type": "D", "before": "but can also monitor the development and the crash of bubbles", "after": null, "start_char_pos": 1206, "end_char_pos": 1267}, {"type": "R", "before": "greatly affected by", "after": "highly sensitive to", "start_char_pos": 1381, "end_char_pos": 1400}, {"type": "A", "before": null, "after": "- on a day to week scale", "start_char_pos": 1523, "end_char_pos": 1523}, {"type": "A", "before": null, "after": "- on a week to month scale", "start_char_pos": 1672, "end_char_pos": 1672}, {"type": "A", "before": null, "after": "of crashes", "start_char_pos": 1798, "end_char_pos": 1798}, {"type": "R", "before": "an imminent crash riskin not only the cryptocurrency market but also the other financial markets", "after": "the imminent risk", "start_char_pos": 1810, "end_char_pos": 1906}], "sents_char_pos": [0, 211, 357, 610, 833, 966, 1308, 1674]} {"doc_id": "1905.09888", "revision_depth": "1", "before_revision": "Pancreatic ductal adenocarcinoma (PDAC) is one of the most aggressive cancers with an extremely poor prognosis. Radiomics has shown prognostic ability in multiple types of cancer including PDAC. However, the prognostic value of traditional radiomics pipelines, which are based on hand-crafted radiomic features alone , is limiteddue to multicollinearity of features and multiple testing problem, and limited performance of conventional machine learning classifiers. Deep learning architectures, such as convolutional neural networks (CNNs) , have been shown to outperform traditional techniques in computer vision tasks , such as object detection . However, they require large sample sizes for training which limits their development . As an alternative solution, CNN-based transfer learning has shown the potential for achieving reasonable performance using datasets with small sample sizes . In this work, we developed a CNN-based transfer learning approach for prognostication in PDAC patients for overall survival . The results showed that transfer learning approach outperformed the traditional radiomics model on PDAC data. A transfer learning approach may fill the gap between radiomics and deep learning analytics for cancer prognosis and improve performance beyond what CNNs can achieve using small datasets .", "after_revision": "Pancreatic Ductal Adenocarcinoma (PDAC) is one of the most aggressive cancers with an extremely poor prognosis. Radiomics has shown prognostic ability in multiple types of cancer including PDAC. However, the prognostic value of traditional radiomics pipelines, which are based on hand-crafted radiomic features alone is limited. Convolutional neural networks (CNNs) have been shown to outperform these feature-based models in computer vision tasks . However, training a CNN from scratch needs a large sample size which is not feasible in most medical imaging studies . As an alternative solution, CNN-based transfer learning has shown potential for achieving reasonable performance using small datasets . In this work, we developed and validated a CNN-based transfer learning approach for prognostication of PDAC patients for overall survival using two independent resectable PDAC cohorts. The proposed deep transfer learning model for prognostication of PDAC achieved the area under the receiver operating characteristic curve of 0.74, which was significantly higher than that of the traditional radiomics model (0.56) as well as a CNN model trained from scratch (0.50). These results suggest that deep transfer learning may significantly improve prognosis performance using small datasets in medical imaging .", "edit_actions": [{"type": "R", "before": "ductal adenocarcinoma", "after": "Ductal Adenocarcinoma", "start_char_pos": 11, "end_char_pos": 32}, {"type": "R", "before": ", is limiteddue to multicollinearity of features and multiple testing problem, and limited performance of conventional machine learning classifiers. Deep learning architectures, such as convolutional", "after": "is limited. Convolutional", "start_char_pos": 317, "end_char_pos": 516}, {"type": "D", "before": ",", "after": null, "start_char_pos": 540, "end_char_pos": 541}, {"type": "R", "before": "traditional techniques", "after": "these feature-based models", "start_char_pos": 572, "end_char_pos": 594}, {"type": "D", "before": ", such as object detection", "after": null, "start_char_pos": 620, "end_char_pos": 646}, {"type": "R", "before": "they require large sample sizes for training which limits their development", "after": "training a CNN from scratch needs a large sample size which is not feasible in most medical imaging studies", "start_char_pos": 658, "end_char_pos": 733}, {"type": "D", "before": "the", "after": null, "start_char_pos": 802, "end_char_pos": 805}, {"type": "R", "before": "datasets with small sample sizes", "after": "small datasets", "start_char_pos": 859, "end_char_pos": 891}, {"type": "A", "before": null, "after": "and validated", "start_char_pos": 921, "end_char_pos": 921}, {"type": "R", "before": "in", "after": "of", "start_char_pos": 981, "end_char_pos": 983}, {"type": "R", "before": ". The results showed that transfer learning approach outperformed the", "after": "using two independent resectable PDAC cohorts. The proposed deep transfer learning model for prognostication of PDAC achieved the area under the receiver operating characteristic curve of 0.74, which was significantly higher than that of the", "start_char_pos": 1019, "end_char_pos": 1088}, {"type": "R", "before": "on PDAC data. A transfer learning approach may fill the gap between radiomics and deep learning analytics for cancer prognosis and improve performance beyond what CNNs can achieve", "after": "(0.56) as well as a CNN model trained from scratch (0.50). These results suggest that deep transfer learning may significantly improve prognosis performance", "start_char_pos": 1117, "end_char_pos": 1296}, {"type": "A", "before": null, "after": "in medical imaging", "start_char_pos": 1318, "end_char_pos": 1318}], "sents_char_pos": [0, 111, 194, 465, 648, 735, 893, 1020, 1130]} {"doc_id": "1905.11795", "revision_depth": "1", "before_revision": "In this paper, the credit scoring problem is studied by incorporating network information, where the advantages of such incorporation are investigated in two scenarios. Firstly, a Bayesian optimal filter is proposed to provide a prediction for lenders assuming that published credit scores are estimated merely from structured individual data. Such prediction is used as a monitoring indicator for the risk warning in lenders' future financial decisions. Secondly, we further propose a recursive Bayes estimator to improve the accuracy of credit scoring estimation by incorporating the dynamic interaction topology of clients as well . It is shown that under the proposed evolution framework, the designed estimator has a higher precision than any efficient estimator, and the mean square errors are strictly smaller than the Cram\\'er-Rao lower bound for clients within a certain range of scores. Finally, simulation results for a specific case illustrate the effectiveness and feasibility of the proposed methods .", "after_revision": "In this paper, the credit scoring problem is studied by incorporating networked information, where the advantages of such incorporation are investigated theoretically in two scenarios. Firstly, a Bayesian optimal filter is proposed to provide risk prediction for lenders assuming that published credit scores are estimated merely from structured financial data. Such prediction can then be used as a monitoring indicator for the risk management in lenders' future decisions. Secondly, a recursive Bayes estimator is further proposed to improve the precision of credit scoring by incorporating the dynamic interaction topology of clients . It is shown that under the proposed evolution framework, the designed estimator has a higher precision than any efficient estimator, and the mean square errors are strictly smaller than the Cram\\'er-Rao lower bound for clients within a certain range of scores. Finally, simulation results for a special case illustrate the feasibility and effectiveness of the proposed algorithms .", "edit_actions": [{"type": "R", "before": "network", "after": "networked", "start_char_pos": 70, "end_char_pos": 77}, {"type": "A", "before": null, "after": "theoretically", "start_char_pos": 151, "end_char_pos": 151}, {"type": "R", "before": "a", "after": "risk", "start_char_pos": 228, "end_char_pos": 229}, {"type": "R", "before": "individual", "after": "financial", "start_char_pos": 328, "end_char_pos": 338}, {"type": "R", "before": "is", "after": "can then be", "start_char_pos": 361, "end_char_pos": 363}, {"type": "R", "before": "warning", "after": "management", "start_char_pos": 408, "end_char_pos": 415}, {"type": "D", "before": "financial", "after": null, "start_char_pos": 435, "end_char_pos": 444}, {"type": "D", "before": "we further propose", "after": null, "start_char_pos": 466, "end_char_pos": 484}, {"type": "A", "before": null, "after": "is further proposed", "start_char_pos": 513, "end_char_pos": 513}, {"type": "R", "before": "accuracy", "after": "precision", "start_char_pos": 529, "end_char_pos": 537}, {"type": "D", "before": "estimation", "after": null, "start_char_pos": 556, "end_char_pos": 566}, {"type": "D", "before": "as well", "after": null, "start_char_pos": 628, "end_char_pos": 635}, {"type": "R", "before": "specific", "after": "special", "start_char_pos": 933, "end_char_pos": 941}, {"type": "R", "before": "effectiveness and feasibility", "after": "feasibility and effectiveness", "start_char_pos": 962, "end_char_pos": 991}, {"type": "R", "before": "methods", "after": "algorithms", "start_char_pos": 1008, "end_char_pos": 1015}], "sents_char_pos": [0, 169, 344, 455, 637, 898]} {"doc_id": "1905.13313", "revision_depth": "1", "before_revision": "Nowadays a huge number of user-generated videos are uploaded to social media every second, capturing glimpses of events all over the world . These videos provide important and useful information for reconstructing the events. In this paper , we describe the DAISY system, enabled by established machine learning techniques and physics models, that can localize the shooter location only based on a couple of user-generated videos that capture the gun shot sound . The DAISY system utilizes machine learning techniques like video synchronization and gunshot temporal localization URLanize the unstructured social media videos and quickly localize gunshot in the videos. It provides a web interface for human-in-the-loop verification to ensure accurate estimations. We present the results of estimating the shooter's location of the Las Vegas Shooting in 2017 and show that DAISY is able to get accurate location using only the first few shots . We then point out future directions that can help improve the system and further reduces human labor in the process. We publish all relevant source code including the web interface and machine learning models in the hope that such tool can be of use to help preserve life and get contributions from the research and software engineering community to make the tool better .", "after_revision": "Every minute, hundreds of hours of video are uploaded to social media sites and the Internet from around the world. This material creates a visual record of the experiences of a significant percentage of humanity and can help illuminate how we live in the present moment. When properly analyzed, this video can also help analysts to reconstruct events of interest, including war crimes, human rights violations, and terrorist acts . In this technical report , we describe a newly developed tool, the Video Event Reconstruction and Analysis (VERA) system, that enables the localization of a shooter from just a few videos that include the sound of gunshots using established machine learning techniques and straightforward physics models. This tool relies on other tools we have already developed including video synchronization and geolocation to order unstructured videos lacking metadata over time and space, and sound detection algorithms. Both this gunshot localization tool and the previous systems it incorporates are run through a web interface that enables human-in-the-loop verification to ensure accurate estimations. To demonstrate the efficacy of this suite of tools, we present the results of estimating the shooter's location of the Las Vegas Shooting in 2017 and show that VERA accurately predicts the shooter's location using only the first few gunshots . We then point out future directions that can help improve the system and further reduce unnecessary human labor in the process. All relevant source code , including the web interface and machine learning models , are freely available in Github. We do so in the hope that this tool can be used by anyone who needs it to protect and promote human rights and public safety. We also hope that researchers and software developers will be inspired to improve and expand this system moving forward to better meet the needs of public safety and human rights .", "edit_actions": [{"type": "R", "before": "Nowadays a huge number of user-generated videos", "after": "Every minute, hundreds of hours of video", "start_char_pos": 0, "end_char_pos": 47}, {"type": "R", "before": "every second, capturing glimpses of events all over the world", "after": "sites and the Internet from around the world. This material creates a visual record of the experiences of a significant percentage of humanity and can help illuminate how we live in the present moment. When properly analyzed, this video can also help analysts to reconstruct events of interest, including war crimes, human rights violations, and terrorist acts", "start_char_pos": 77, "end_char_pos": 138}, {"type": "D", "before": "These videos provide important and useful information for reconstructing the events.", "after": null, "start_char_pos": 141, "end_char_pos": 225}, {"type": "R", "before": "paper", "after": "technical report", "start_char_pos": 234, "end_char_pos": 239}, {"type": "R", "before": "the DAISY system, enabled by established machine learning techniques and physics models, that can localize the shooter location only based on a couple of user-generated videos that capture the gun shot sound . The DAISY system utilizes", "after": "a newly developed tool, the Video Event Reconstruction and Analysis (VERA) system, that enables the localization of a shooter from just a few videos that include the sound of gunshots using established", "start_char_pos": 254, "end_char_pos": 489}, {"type": "R", "before": "like", "after": "and straightforward physics models. This tool relies on other tools we have already developed including", "start_char_pos": 518, "end_char_pos": 522}, {"type": "R", "before": "gunshot temporal localization URLanize the unstructured social media videos and quickly localize gunshot in the videos. It provides", "after": "geolocation to order unstructured videos lacking metadata over time and space, and sound detection algorithms. Both this gunshot localization tool and the previous systems it incorporates are run through", "start_char_pos": 549, "end_char_pos": 680}, {"type": "R", "before": "for", "after": "that enables", "start_char_pos": 697, "end_char_pos": 700}, {"type": "R", "before": "We", "after": "To demonstrate the efficacy of this suite of tools, we", "start_char_pos": 764, "end_char_pos": 766}, {"type": "R", "before": "DAISY is able to get accurate", "after": "VERA accurately predicts the shooter's", "start_char_pos": 872, "end_char_pos": 901}, {"type": "R", "before": "shots", "after": "gunshots", "start_char_pos": 936, "end_char_pos": 941}, {"type": "R", "before": "reduces", "after": "reduce unnecessary", "start_char_pos": 1025, "end_char_pos": 1032}, {"type": "R", "before": "We publish all", "after": "All", "start_char_pos": 1061, "end_char_pos": 1075}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1097, "end_char_pos": 1097}, {"type": "R", "before": "in", "after": ", are freely available in Github. We do so in", "start_char_pos": 1154, "end_char_pos": 1156}, {"type": "R", "before": "such", "after": "this", "start_char_pos": 1171, "end_char_pos": 1175}, {"type": "R", "before": "of use to help preserve life and get contributions from the research and software engineering community to make the tool better", "after": "used by anyone who needs it to protect and promote human rights and public safety. We also hope that researchers and software developers will be inspired to improve and expand this system moving forward to better meet the needs of public safety and human rights", "start_char_pos": 1188, "end_char_pos": 1315}], "sents_char_pos": [0, 140, 225, 463, 668, 763, 943, 1060]} {"doc_id": "1906.04266", "revision_depth": "1", "before_revision": "Determining which proteins interact together is crucial to a systems-level understanding of the cell. Recently, algorithms based on Direct Coupling Analysis (DCA) pairwise maximum-entropy models have allowed to identify interaction partners among the paralogs of ubiquitous prokaryotic proteins families, starting from sequence data alone. Since DCA allows to infer the three-dimensional structure of protein complexes, its success in predicting protein-protein interactions could be mainly based on contacting residues coevolving to remain physicochemically complementary. However, interacting proteins often possess similar evolutionary histories , which also gives rise to correlations among their sequences . What is the role of purely phylogenetic correlations in the performance of DCA-based methods to infer interaction partners? To address this question, we employ controlled synthetic data that only involves phylogeny and no interactions or contacts. We find that DCA accurately identifies the pairs of synthetic sequences that only share evolutionary history. It performs as well as methods explicitly based on sequence similarity, and even slightly better with large and accurate training sets. We further demonstrate the ability of these various methods to correctly predict pairings among actual paralogous proteins with genome proximity but no known direct physical interaction, which illustrates the importance of phylogenetic correlations in real data. However, for actually interacting and strongly coevolving proteins, DCA and mutual information outperform sequence similarity .", "after_revision": "Determining which proteins interact together is crucial to a systems-level understanding of the cell. Recently, algorithms based on Direct Coupling Analysis (DCA) pairwise maximum-entropy models have allowed to identify interaction partners among paralogous proteins from sequence data . This success of DCA at predicting protein-protein interactions could be mainly based on its known ability to identify pairs of residues that are in contact in the three-dimensional structure of protein complexes and that coevolve to remain physicochemically complementary. However, interacting proteins possess similar evolutionary histories . What is the role of purely phylogenetic correlations in the performance of DCA-based methods to infer interaction partners? To address this question, we employ controlled synthetic data that only involve phylogeny and no interactions or contacts. We find that DCA accurately identifies the pairs of synthetic sequences that share evolutionary history. While phylogenetic correlations confound the identification of contacting residues by DCA, they are thus useful to predict interacting partners among paralogs. We find that DCA performs as well as phylogenetic methods to this end, and slightly better than them with large and accurate training sets. Employing DCA or phylogenetic methods within an Iterative Pairing Algorithm (IPA) allows to predict pairs of evolutionary partners without a training set. We demonstrate the ability of these various methods to correctly predict pairings among real paralogous proteins with genome proximity but no known physical interaction, illustrating the importance of phylogenetic correlations in natural data. However, for physically interacting and strongly coevolving proteins, DCA and mutual information outperform phylogenetic methods. We discuss how to distinguish physically interacting proteins from those only sharing evolutionary history .", "edit_actions": [{"type": "R", "before": "the paralogs of ubiquitous prokaryotic proteins families, starting", "after": "paralogous proteins", "start_char_pos": 247, "end_char_pos": 313}, {"type": "R", "before": "alone. Since DCA allows to infer the three-dimensional structure of protein complexes, its success in", "after": ". This success of DCA at", "start_char_pos": 333, "end_char_pos": 434}, {"type": "R", "before": "contacting residues coevolving", "after": "its known ability to identify pairs of residues that are in contact in the three-dimensional structure of protein complexes and that coevolve", "start_char_pos": 500, "end_char_pos": 530}, {"type": "D", "before": "often", "after": null, "start_char_pos": 604, "end_char_pos": 609}, {"type": "D", "before": ", which also gives rise to correlations among their sequences", "after": null, "start_char_pos": 649, "end_char_pos": 710}, {"type": "R", "before": "involves", "after": "involve", "start_char_pos": 909, "end_char_pos": 917}, {"type": "D", "before": "only", "after": null, "start_char_pos": 1038, "end_char_pos": 1042}, {"type": "R", "before": "It", "after": "While phylogenetic correlations confound the identification of contacting residues by DCA, they are thus useful to predict interacting partners among paralogs. We find that DCA", "start_char_pos": 1071, "end_char_pos": 1073}, {"type": "R", "before": "methods explicitly based on sequence similarity, and even slightly better", "after": "phylogenetic methods to this end, and slightly better than them", "start_char_pos": 1094, "end_char_pos": 1167}, {"type": "R", "before": "We further", "after": "Employing DCA or phylogenetic methods within an Iterative Pairing Algorithm (IPA) allows to predict pairs of evolutionary partners without a training set. We", "start_char_pos": 1207, "end_char_pos": 1217}, {"type": "R", "before": "actual", "after": "real", "start_char_pos": 1303, "end_char_pos": 1309}, {"type": "D", "before": "direct", "after": null, "start_char_pos": 1365, "end_char_pos": 1371}, {"type": "R", "before": "which illustrates", "after": "illustrating", "start_char_pos": 1394, "end_char_pos": 1411}, {"type": "R", "before": "real", "after": "natural", "start_char_pos": 1459, "end_char_pos": 1463}, {"type": "R", "before": "actually", "after": "physically", "start_char_pos": 1483, "end_char_pos": 1491}, {"type": "R", "before": "sequence similarity", "after": "phylogenetic methods. We discuss how to distinguish physically interacting proteins from those only sharing evolutionary history", "start_char_pos": 1576, "end_char_pos": 1595}], "sents_char_pos": [0, 101, 339, 573, 712, 836, 960, 1070, 1206, 1469]} {"doc_id": "1906.06360", "revision_depth": "1", "before_revision": "Economists are often interested in computing averages with respect to a distribution of unobservables. Examples are moments or distributions of individual fixed-effects, average partial effects in discrete choice models, or counterfactual policy simulations based on a structural model. We consider posterior estimators of such effects , where the average is computed conditional on the observation sample. While in various settings it is common to \"shrink\" individual estimates -- e.g., of teacher value-added or hospital quality -- toward a common mean to reduce estimation noise, a study of the frequentist properties of posterior average estimators is lacking. We establish two robustness properties of posterior estimators under misspecification of the assumed distribution of unobservables: they are optimal in terms of local worst-case bias, and their global bias is no larger than twice the minimum worst-case bias that can be achieved within a large class of estimators. These results provide a theoretical foundation for the use of posterior average estimators . In addition, our theory suggests a simple measure of the information contained in the posterior conditioning. For illustration, we consider two empirical settings: the estimation of the distribution of neighborhood effects in the US, and the estimation of the densities of permanent and transitory components in a model of income dynamics.", "after_revision": "Economists are often interested in estimating averages with respect to distributions of unobservables. Examples are moments of individual fixed-effects, average effects in discrete choice models, or counterfactual simulations in structural models. For such quantities, we propose and study \"posterior average effects\" , where the average is computed conditional on the sample, in the spirit of empirical Bayes and shrinkage methods. While the usefulness of shrinkage for prediction is well-understood, a justification of posterior conditioning to estimate population averages is currently lacking. We establish two robustness properties of posterior average effects under misspecification of the assumed distribution of unobservables: they are optimal in terms of local worst-case bias, and their global bias is at most twice the minimum worst-case bias within a large class of estimators. We establish related robustness results for posterior predictors . In addition, we suggest a simple measure of the information contained in the posterior conditioning. Lastly, we present two empirical illustrations, to estimate the distributions of neighborhood effects in the US, and of permanent and transitory components in a model of income dynamics.", "edit_actions": [{"type": "R", "before": "computing", "after": "estimating", "start_char_pos": 35, "end_char_pos": 44}, {"type": "R", "before": "a distribution", "after": "distributions", "start_char_pos": 70, "end_char_pos": 84}, {"type": "D", "before": "or distributions", "after": null, "start_char_pos": 124, "end_char_pos": 140}, {"type": "D", "before": "partial", "after": null, "start_char_pos": 178, "end_char_pos": 185}, {"type": "R", "before": "policy simulations based on a structural model. We consider posterior estimators of such effects", "after": "simulations in structural models. For such quantities, we propose and study \"posterior average effects\"", "start_char_pos": 239, "end_char_pos": 335}, {"type": "R", "before": "observation sample. While in various settings it is common to \"shrink\" individual estimates -- e.g., of teacher value-added or hospital quality -- toward a common mean to reduce estimation noise, a study of the frequentist properties of posterior average estimators is", "after": "sample, in the spirit of empirical Bayes and shrinkage methods. While the usefulness of shrinkage for prediction is well-understood, a justification of posterior conditioning to estimate population averages is currently", "start_char_pos": 387, "end_char_pos": 655}, {"type": "R", "before": "estimators", "after": "average effects", "start_char_pos": 717, "end_char_pos": 727}, {"type": "R", "before": "no larger than", "after": "at most", "start_char_pos": 874, "end_char_pos": 888}, {"type": "D", "before": "that can be achieved", "after": null, "start_char_pos": 923, "end_char_pos": 943}, {"type": "R", "before": "These results provide a theoretical foundation for the use of posterior average estimators", "after": "We establish related robustness results for posterior predictors", "start_char_pos": 980, "end_char_pos": 1070}, {"type": "R", "before": "our theory suggests", "after": "we suggest", "start_char_pos": 1086, "end_char_pos": 1105}, {"type": "R", "before": "For illustration, we consider two empirical settings: the estimation of the distribution of", "after": "Lastly, we present two empirical illustrations, to estimate the distributions of", "start_char_pos": 1183, "end_char_pos": 1274}, {"type": "D", "before": "the estimation of the densities", "after": null, "start_char_pos": 1311, "end_char_pos": 1342}], "sents_char_pos": [0, 102, 286, 406, 664, 979, 1072, 1182]} {"doc_id": "1906.07491", "revision_depth": "1", "before_revision": "Multifractal Detrended Cross-Correlation methodology is applied to the foreign exchange (Forex) market . High frequency fluctuations of exchange rates of eight major world currencies over the period 2010--2018 are used to study cross-correlations. The currencies include the Australian dollar, Canadian dollar, Swiss franc, euro, British pound sterling, Japanese yen, New Zealand dollar and US dollar . Dominant multiscale cross--correlations between the exchange rates are found to typically occur on the level of small and medium size fluctuations. URLanization of ties between the exchange rates, formulated in terms of the dendrograms, are however more pronounced on the level of larger fluctuations. The cross--correlations are quantified to be stronger on average between those exchange rate pairs that are bound within triangular relation . Some pairs from outside the triangular relation are however identified to be exceptionally strongly correlated as compared to the average strength of correlations in this sector .This in particular applies to those exchange rates that involve the Australian and New Zealand dollars and reflects their economic relations. Significant events with impact on the Forex are shown to induce triangular arbitrage opportunities which at the same time reduce cross--correlations on the smallest time scales and act destructively on the URLanization of correlations. In the years 2010--2018 such instances took place in connection with the Swiss National Bank intervention and the weakening of British pound sterling accompanying the initiation of Brexit procedure .", "after_revision": "Multifractal detrended cross-correlation methodology is described and applied to Foreign exchange (Forex) market time series. Fluctuations of high frequency exchange rates of eight major world currencies over 2010-2018 period are used to study cross-correlations. The study is motivated by fundamental questions in complex systems' response to significant environmental changes and by potential applications in investment strategies, including detecting triangular arbitrage opportunities . Dominant multiscale cross-correlations between the exchange rates are found to typically occur at smaller fluctuation levels. However URLanization of ties expressed in terms of dendrograms, with a novel application of the multiscale cross-correlation coefficient, are more pronounced at large fluctuations. The cross-correlations are quantified to be stronger on average between those exchange rate pairs that are bound within triangular relations . Some pairs from outside triangular relations are however identified to be exceptionally strongly correlated as compared to the average strength of triangular correlations .This in particular applies to those exchange rates that involve Australian and New Zealand dollars and reflects their economic relations. Significant events with impact on the Forex are shown to induce triangular arbitrage opportunities which at the same time reduce cross--correlations on the smallest time scales and act destructively on the URLanization of correlations. In 2010--2018 such instances took place in connection with the Swiss National Bank intervention and the weakening of British pound sterling accompanying the initiation of Brexit procedure . The methodology could be applicable to temporal and multiscale pattern detection in any time series .", "edit_actions": [{"type": "R", "before": "Detrended Cross-Correlation methodology is applied to the foreign", "after": "detrended cross-correlation methodology is described and applied to Foreign", "start_char_pos": 13, "end_char_pos": 78}, {"type": "R", "before": ". High frequency fluctuations of", "after": "time series. Fluctuations of high frequency", "start_char_pos": 103, "end_char_pos": 135}, {"type": "R", "before": "the period 2010--2018", "after": "2010-2018 period", "start_char_pos": 188, "end_char_pos": 209}, {"type": "R", "before": "currencies include the Australian dollar, Canadian dollar, Swiss franc, euro, British pound sterling, Japanese yen, New Zealand dollar and US dollar", "after": "study is motivated by fundamental questions in complex systems' response to significant environmental changes and by potential applications in investment strategies, including detecting triangular arbitrage opportunities", "start_char_pos": 252, "end_char_pos": 400}, {"type": "R", "before": "cross--correlations", "after": "cross-correlations", "start_char_pos": 423, "end_char_pos": 442}, {"type": "R", "before": "on the level of small and medium size fluctuations.", "after": "at smaller fluctuation levels. However", "start_char_pos": 499, "end_char_pos": 550}, {"type": "R", "before": "between the exchange rates, formulated", "after": "expressed", "start_char_pos": 572, "end_char_pos": 610}, {"type": "R", "before": "the dendrograms, are however more pronounced on the level of larger", "after": "dendrograms, with a novel application of the multiscale cross-correlation coefficient, are more pronounced at large", "start_char_pos": 623, "end_char_pos": 690}, {"type": "R", "before": "cross--correlations", "after": "cross-correlations", "start_char_pos": 709, "end_char_pos": 728}, {"type": "R", "before": "relation", "after": "relations", "start_char_pos": 837, "end_char_pos": 845}, {"type": "R", "before": "the triangular relation", "after": "triangular relations", "start_char_pos": 872, "end_char_pos": 895}, {"type": "R", "before": "correlations in this sector", "after": "triangular correlations", "start_char_pos": 998, "end_char_pos": 1025}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1091, "end_char_pos": 1094}, {"type": "D", "before": "the years", "after": null, "start_char_pos": 1408, "end_char_pos": 1417}, {"type": "A", "before": null, "after": ". The methodology could be applicable to temporal and multiscale pattern detection in any time series", "start_char_pos": 1603, "end_char_pos": 1603}], "sents_char_pos": [0, 104, 247, 550, 704, 1027, 1168, 1404]} {"doc_id": "1906.08455", "revision_depth": "1", "before_revision": " B-rep model editing plays an essential role in CAD and motivates the very recent direct modeling CAD paradigm, which features intuitive push-pull manipulation of the model geometry. Boundary faces in a B-rep model could be connected in a smooth manner, typically G1 continuous, for functional, manufacturing or aesthetic reasons. Quite often, it is desirable to preserve such smooth connections during push-pull moves . This is, however, no trivial matter and introduces additional challenges. To preserve the G1 connections , neighboring faces of push-pulled faces need to be made movable, but their motions are not known explicitly. Consequently, it becomes challenging to track the geometry-topology inconsistency caused by these movable faces and to attain a robust update for push-pulled solid models. No effective ways exist in the literature to deal with the challenges; the industrial state of the art has implemented this function, but the challenges are not addressed satisfactorily and robustness issues are observed. This paper proposes a novel reverse tracking method to solve the above challenges, and then, based on it, presents a systematic method for push-pull direct modeling while preserving G1 connections. The developed method has been validated with a series of case studies .", "after_revision": "Boundary representation ( B-rep ) model editing plays an essential role in computer-aided design and motivates the very recent direct modeling paradigm, which features intuitive push-pull manipulation of the model geometry. In mechanical design, a substantial part of B-rep models being used are quadric models (composed of linear and quadric surfaces). However, push-pulling such models is not trivial due to the possible smooth face-face connections in the models. The major issue is that, during push-pull moves , it is often desirable to preserve these connections for functional, manufacturing, or aesthetic reasons, but this could cause complex inconsistencies between the geometry and topology in the model and lead to robustness issues in updating the model. The challenge lies in effectiveness towards detecting the instants when geometry-topology inconsistencies occur during push-pull moves. This paper proposes a novel reverse detection method to solve the challenge and then, based on it, presents a robust method for push-pull direct modeling while preserving smooth connections. Case studies and comparisons have been conducted to demonstrate the effectiveness of the method .", "edit_actions": [{"type": "A", "before": null, "after": "Boundary representation (", "start_char_pos": 0, "end_char_pos": 0}, {"type": "A", "before": null, "after": ")", "start_char_pos": 7, "end_char_pos": 7}, {"type": "R", "before": "CAD", "after": "computer-aided design", "start_char_pos": 49, "end_char_pos": 52}, {"type": "D", "before": "CAD", "after": null, "start_char_pos": 99, "end_char_pos": 102}, {"type": "R", "before": "Boundary faces in a", "after": "In mechanical design, a substantial part of", "start_char_pos": 184, "end_char_pos": 203}, {"type": "R", "before": "model could be connected in a smooth manner, typically G1 continuous, for functional, manufacturing or aesthetic reasons. Quite often, it is desirable to preserve such smooth connections", "after": "models being used are quadric models (composed of linear and quadric surfaces). However, push-pulling such models is not trivial due to the possible smooth face-face connections in the models. The major issue is that,", "start_char_pos": 210, "end_char_pos": 396}, {"type": "D", "before": ". This is, however, no trivial matter and introduces additional challenges. To preserve the G1 connections", "after": null, "start_char_pos": 420, "end_char_pos": 526}, {"type": "R", "before": "neighboring faces of push-pulled faces need to be made movable, but their motions are not known explicitly. Consequently, it becomes challenging to track the", "after": "it is often desirable to preserve these connections for functional, manufacturing, or aesthetic reasons, but this could cause complex inconsistencies between the geometry and topology in the model and lead to robustness issues in updating the model. The challenge lies in effectiveness towards detecting the instants when", "start_char_pos": 529, "end_char_pos": 686}, {"type": "R", "before": "inconsistency caused by these movable faces and to attain a robust update for push-pulled solid models. No effective ways exist in the literature to deal with the challenges; the industrial state of the art has implemented this function, but the challenges are not addressed satisfactorily and robustness issues are observed.", "after": "inconsistencies occur during push-pull moves.", "start_char_pos": 705, "end_char_pos": 1030}, {"type": "R", "before": "tracking", "after": "detection", "start_char_pos": 1067, "end_char_pos": 1075}, {"type": "R", "before": "above challenges,", "after": "challenge", "start_char_pos": 1096, "end_char_pos": 1113}, {"type": "R", "before": "systematic", "after": "robust", "start_char_pos": 1148, "end_char_pos": 1158}, {"type": "R", "before": "G1 connections. The developed method has been validated with a series of case studies", "after": "smooth connections. Case studies and comparisons have been conducted to demonstrate the effectiveness of the method", "start_char_pos": 1213, "end_char_pos": 1298}], "sents_char_pos": [0, 183, 331, 421, 495, 636, 808, 879, 1030, 1228]} {"doc_id": "1906.09034", "revision_depth": "1", "before_revision": "We characterize the asymptotic small-time and large-time implied volatility smile for the rough Heston model introduced by El Euch, Jaissonand Rosenbaum .0pt%DIFAUXCMD in the small-time, large-time and \\alpha }\\to \\to We show that the asymptotic short-maturity smile scales in qualitatively the same way as a general rough stochastic volatility model , and is characterized by0pt%DIFAUXCMD , \\mbox{%DIFAUXCMD FGP18a }0pt%DIFAUXCMD et al.), and the rate function is equal to } the Fenchel-Legendre transform of the solution a Volterra integral equation (VIE) \\hspace{0pt}%DIFAUXCMD , but with the drift and mean reversion terms removed} . The solution of this VIE satisfies a space-time scaling property which simplifies its computation. We corroborate our results numerically with Monte Carlo simulations. We also compute a power series in the log-moneyness variable for the asymptotic implied volatility , which yields tractable expressions for the vol skew and convexity , thus being useful for calibration purposes. We also derive formal asymptotics for the small-time moderate deviations regime and a formal saddlepoint approximation for call options in the large deviations regime. This goes to higher order than previous works for rough models, and in particular captures the effect of the mean reversion term. In the large maturity case, the limiting asymptotic smile turns out to be the same as for the standard Heston model , for which there is a well known closed-form formula in terms of the SVI parametrization}\\hspace{0pt}%DIFAUXCMD . Finally, using L\\'{e}vy's convergence theorem, we show that the log stock price X_t tends weakly to a non-symmetric random variable X^{(1/2)}_t as \\alpha }\\to \\to _t/\\sqrt{t} tends weakly to a non-symmetric random variable as t}\\to \\to }\\hspace{0pt}%DIFAUXCMD where the skew flattens or blows up) and the V process converges on pathspace to a random tempered distribution} .", "after_revision": "We characterize the behaviour of the Rough Heston model introduced by Jaisson\\&Rosenbaum \\mbox{%DIFAUXCMD JR160pt%DIFAUXCMD in the small-time, large-time and \\alpha }\\to 1/2 (i.e. H\\to 0) limits. We show that the short-maturity smile scales in qualitatively the same way as a general rough stochastic volatility model (cf.\\ \\mbox{%DIFAUXCMD FZ170pt%DIFAUXCMD , \\mbox{%DIFAUXCMD FGP18a }0pt%DIFAUXCMD et al.), and the rate function is equal to } the Fenchel-Legendre transform of a simple transformation of the solution to the same Volterra integral equation (VIE) that appears in \\mbox{%DIFAUXCMD ER19\\hspace{0pt}%DIFAUXCMD , but with the drift and mean reversion terms removed} . The solution to this VIE satisfies a space-time scaling property which means we only need to solve this equation for the moment values of p=1 and p=-1 so the rate function can be efficiently computed using an Adams scheme or a power series, and we compute a power series in the log-moneyness variable for the asymptotic implied volatility which yields tractable expressions for the implied vol skew and convexity . The limiting asymptotic smile in the large-maturity regime is obtained via a stability analysis of the fixed points of the VIE, and is the same as for the standard Heston model in \\mbox{%DIFAUXCMD \\cite{FJ11}\\hspace{0pt}%DIFAUXCMD . Finally, using L\\'{e}vy's convergence theorem, we show that the log stock price X_t tends weakly to a non-symmetric random variable X^{(1/2)}_t as \\alpha }\\to 1/2 (i.e. H\\to 0) whose mgf is also the solution to the Rough Heston VIE with \\alpha=1/2, and we show that X^{(1/2)_t/\\sqrt{t} tends weakly to a non-symmetric random variable as t}\\to 0, which leads to a non-flat non-symmetric asymptotic smile in the Edgeworth regime. We also show that the third moment of the log stock price tends to a finite constant as H\\to 0 (in contrast to the Rough Bergomi model discussed in \\mbox{%DIFAUXCMD \\cite{FFGS20 }\\hspace{0pt}%DIFAUXCMD where the skew flattens or blows up) and the V process converges on pathspace to a random tempered distribution} .", "edit_actions": [{"type": "R", "before": "asymptotic small-time and large-time implied volatility smile for the rough", "after": "behaviour of the Rough", "start_char_pos": 20, "end_char_pos": 95}, {"type": "R", "before": "El Euch, Jaissonand Rosenbaum .", "after": "Jaisson\\&Rosenbaum \\mbox{%DIFAUXCMD JR16", "start_char_pos": 123, "end_char_pos": 154}, {"type": "A", "before": null, "after": "1/2 (i.e. H", "start_char_pos": 214, "end_char_pos": 214}, {"type": "A", "before": null, "after": "0) limits.", "start_char_pos": 218, "end_char_pos": 218}, {"type": "D", "before": "asymptotic", "after": null, "start_char_pos": 236, "end_char_pos": 246}, {"type": "R", "before": ", and is characterized by", "after": "(cf.\\ \\mbox{%DIFAUXCMD FZ17", "start_char_pos": 352, "end_char_pos": 377}, {"type": "R", "before": "the solution a", "after": "a simple transformation of the solution to the same", "start_char_pos": 511, "end_char_pos": 525}, {"type": "A", "before": null, "after": "that appears in \\mbox{%DIFAUXCMD ER19", "start_char_pos": 559, "end_char_pos": 559}, {"type": "R", "before": "of", "after": "to", "start_char_pos": 652, "end_char_pos": 654}, {"type": "R", "before": "simplifies its computation. We corroborate our results numerically with Monte Carlo simulations. We also", "after": "means we only need to solve this equation for the moment values of p=1 and p=-1 so the rate function can be efficiently computed using an Adams scheme or a power series, and we", "start_char_pos": 710, "end_char_pos": 814}, {"type": "D", "before": ",", "after": null, "start_char_pos": 906, "end_char_pos": 907}, {"type": "A", "before": null, "after": "implied", "start_char_pos": 951, "end_char_pos": 951}, {"type": "R", "before": ", thus being useful for calibration purposes. We also derive formal asymptotics for the small-time moderate deviations regime and a formal saddlepoint approximation for call options in the large deviations regime. This goes to higher order than previous works for rough models, and in particular captures the effect of the mean reversion term. In the large maturity case, the limiting asymptotic smile turns out to be the", "after": ". The limiting asymptotic smile in the large-maturity regime is obtained via a stability analysis of the fixed points of the VIE, and is the", "start_char_pos": 975, "end_char_pos": 1396}, {"type": "R", "before": ", for which there is a well known closed-form formula in terms of the SVI parametrization", "after": "in \\mbox{%DIFAUXCMD \\cite{FJ11", "start_char_pos": 1435, "end_char_pos": 1524}, {"type": "A", "before": null, "after": "1/2 (i.e. H", "start_char_pos": 1709, "end_char_pos": 1709}, {"type": "A", "before": null, "after": "0) whose mgf is also the solution to the Rough Heston VIE with \\alpha=1/2, and we show that X^{(1/2)", "start_char_pos": 1713, "end_char_pos": 1713}, {"type": "A", "before": null, "after": "0, which leads to a non-flat non-symmetric asymptotic smile in the Edgeworth regime. We also show that the third moment of the log stock price tends to a finite constant as H", "start_char_pos": 1782, "end_char_pos": 1782}, {"type": "A", "before": null, "after": "0 (in contrast to the Rough Bergomi model discussed in \\mbox{%DIFAUXCMD \\cite{FFGS20", "start_char_pos": 1786, "end_char_pos": 1786}], "sents_char_pos": [0, 439, 638, 737, 806, 1020, 1188, 1318, 1346, 1436]} {"doc_id": "1906.09054", "revision_depth": "2", "before_revision": "Gene expression is a noisy process. That consists of several random events among which the reinitiation of transcription by RNAP is an important one. The RNAP molecules can bind the gene only after the promoter gets activated by transcription factors. Several transcription factors bind the promoter to put the gene in the active state. The gene turns into the inactive state as the bound transcription factors leave the promoter. During the active period of the gene, many RNAP molecules transcribe the gene to synthesize the mRNA . The binding event of RNAP to the active state of the gene is an probabilistic process and therefore, introduces noise or fluctuations in the protein levels. The binding event of RNAP to the active state of the gene is an probabilistic process and therefore introduces noise in the protein levels. In this paper, we analytically calculate the noise in mRNA and protein levels and also the probability distribution of mRNA numbers exactly with the binding event of RNAP in gene transcription process. The theoretically calculated noise expression of proteins shows excellent agreement with an experimental results. Then , we show that the noise in mRNA level can be sub-Poissonian due to the reinitiation of transcription by RNAP and the mean mRNA level can be increased without increasing the noise. We find that the reinitiation of transcription behaves like the fine-tuned control process to regulate the mRNA/protein level in the cell . We also find the exact distribution of mRNA numbers with the reinitiation of transcription .", "after_revision": "Gene expression is a random or noisy process. The process consists of several random events among which the reinitiation of transcription by RNAP is an important one. The RNAP molecules can bind the gene only after the promoter gets activated by transcription factors. Several transcription factors bind the promoter to put the gene in the active state. The gene turns into inactive state as the bound transcription factors leave the promoter. During the active period of the gene, many RNAP molecules transcribe the gene to synthesize the mRNAs . The binding event of RNAP to the active state of the gene is a probabilistic process and therefore, introduces noise or fluctuations in the mRNA and protein levels. In this paper, we analytically calculate the Fano factor in mRNA and protein levels and also the probability distribution of mRNA numbers exactly with the binding event of RNAPs in gene transcription process. The analytically calculated expression of Fano factor of proteins shows excellent agreement with an experimental result. Then we show that the Fano factor in mRNA levels can be sub-Poissonian due to the reinitiation of transcription by RNAP and the mean mRNA level can be increased without increasing the Fano factor. Our study show that the Fano factor can also be reduced keeping mRNA levels fixed. We find that the reinitiation of transcription can behave as a fine-tuned control process to regulate the mRNA/protein level in the cell .", "edit_actions": [{"type": "A", "before": null, "after": "random or", "start_char_pos": 21, "end_char_pos": 21}, {"type": "R", "before": "That", "after": "The process", "start_char_pos": 37, "end_char_pos": 41}, {"type": "D", "before": "the", "after": null, "start_char_pos": 358, "end_char_pos": 361}, {"type": "R", "before": "mRNA", "after": "mRNAs", "start_char_pos": 528, "end_char_pos": 532}, {"type": "R", "before": "an", "after": "a", "start_char_pos": 596, "end_char_pos": 598}, {"type": "R", "before": "protein levels. The binding event of RNAP to the active state of the gene is an probabilistic process and therefore introduces noise in the", "after": "mRNA and", "start_char_pos": 676, "end_char_pos": 815}, {"type": "R", "before": "noise", "after": "Fano factor", "start_char_pos": 877, "end_char_pos": 882}, {"type": "R", "before": "RNAP", "after": "RNAPs", "start_char_pos": 998, "end_char_pos": 1002}, {"type": "R", "before": "theoretically calculated noise expression of", "after": "analytically calculated expression of Fano factor of", "start_char_pos": 1038, "end_char_pos": 1082}, {"type": "R", "before": "results. Then ,", "after": "result. Then", "start_char_pos": 1139, "end_char_pos": 1154}, {"type": "R", "before": "noise in mRNA level", "after": "Fano factor in mRNA levels", "start_char_pos": 1172, "end_char_pos": 1191}, {"type": "R", "before": "noise.", "after": "Fano factor. Our study show that the Fano factor can also be reduced keeping mRNA levels fixed.", "start_char_pos": 1327, "end_char_pos": 1333}, {"type": "R", "before": "behaves like the", "after": "can behave as a", "start_char_pos": 1381, "end_char_pos": 1397}, {"type": "D", "before": ". We also find the exact distribution of mRNA numbers with the reinitiation of transcription", "after": null, "start_char_pos": 1472, "end_char_pos": 1564}], "sents_char_pos": [0, 36, 150, 252, 337, 431, 691, 831, 1033, 1147, 1333, 1473]} {"doc_id": "1906.09465", "revision_depth": "2", "before_revision": "Developing efficient computational methods to change the state of a cell from an undesirable condition, e.g. diseased, into a desirable, e.g. healthy, condition is an important goal of systems biology. The identification of potential interventions can be achieved through mathematical modeling of the state of a cell by finding appropriate input manipulations in the model that represent external interventions. This paper focuses on quantifying the unwanted or unplanned changes that come along with the application of an intervention , which we define as the total effect of the intervention. The type of mathematical models that we will consider are discrete dynamical systems which include the widely used Boolean networks and their generalizations. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. Regulatory rules that appear in published models tend to have special features such as the property of being nested canalizing, a concept inspired by the concept of canalization in evolutionary biology. We provide a polynomial normal form based on the canalizing properties of regulatory functions. This polynomial normal form provides a partition of the inputs of the function into canalizing and non-canalizing variables and, within the canalizing ones, we categorize the input variables into layers of canalization. Using this polynomial normal form, we provide a set of formulas for counting the maximum number of transitions that will change in the state space upon an edge deletion in the wiring diagram. These formulas rely on the canalizing structure of the target function where the number of changed transitions depends on the canalizing layer that includes the input to be deleted. We applied our methods to two published models to compare the accuracy of the upper bounds and shown that the bounds are sharp .", "after_revision": "Developing efficient computational methods to assess the impact of external interventions on the dynamics of a network model is an important problem in systems biology. This paper focuses on quantifying the global changes that result from the application of an intervention to produce a desired effect , which we define as the total effect of the intervention. The type of mathematical models that we will consider are discrete dynamical systems which include the widely used Boolean networks and their generalizations. The potential interventions can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. We use a class of regulatory rules called nested canalizing functions that frequently appear in published models and were inspired by the concept of canalization in evolutionary biology. In this paper, we provide a polynomial normal form based on the canalizing properties of regulatory functions. Using this polynomial normal form, we give a set of formulas for counting the maximum number of transitions that will change in the state space upon an edge deletion in the wiring diagram. These formulas rely on the canalizing structure of the target function since the number of changed transitions depends on the canalizing layer that includes the input to be deleted. We also present computations on random networks to compare the exact number of changes with the upper bounds provided by our formulas. Finally, we provide statistics on the sharpness of these upper bounds in random networks .", "edit_actions": [{"type": "R", "before": "change the state of a cell from an undesirable condition, e.g. diseased, into a desirable, e.g. healthy, condition", "after": "assess the impact of external interventions on the dynamics of a network model", "start_char_pos": 46, "end_char_pos": 160}, {"type": "R", "before": "goal of", "after": "problem in", "start_char_pos": 177, "end_char_pos": 184}, {"type": "D", "before": "The identification of potential interventions can be achieved through mathematical modeling of the state of a cell by finding appropriate input manipulations in the model that represent external interventions.", "after": null, "start_char_pos": 202, "end_char_pos": 411}, {"type": "R", "before": "unwanted or unplanned changes that come along with", "after": "global changes that result from", "start_char_pos": 450, "end_char_pos": 500}, {"type": "A", "before": null, "after": "to produce a desired effect", "start_char_pos": 536, "end_char_pos": 536}, {"type": "R", "before": "total effect", "after": "total effect", "start_char_pos": 562, "end_char_pos": 574}, {"type": "R", "before": "control targets", "after": "interventions", "start_char_pos": 769, "end_char_pos": 784}, {"type": "R", "before": "Regulatory rules that", "after": "We use a class of regulatory rules called nested canalizing functions that frequently", "start_char_pos": 899, "end_char_pos": 920}, {"type": "R", "before": "tend to have special features such as the property of being nested canalizing, a concept", "after": "and were", "start_char_pos": 948, "end_char_pos": 1036}, {"type": "R", "before": "We", "after": "In this paper, we", "start_char_pos": 1102, "end_char_pos": 1104}, {"type": "D", "before": "This polynomial normal form provides a partition of the inputs of the function into canalizing and non-canalizing variables and, within the canalizing ones, we categorize the input variables into layers of canalization.", "after": null, "start_char_pos": 1198, "end_char_pos": 1417}, {"type": "R", "before": "provide", "after": "give", "start_char_pos": 1456, "end_char_pos": 1463}, {"type": "R", "before": "where", "after": "since", "start_char_pos": 1681, "end_char_pos": 1686}, {"type": "R", "before": "applied our methods to two published models to compare the accuracy of", "after": "also present computations on random networks to compare", "start_char_pos": 1795, "end_char_pos": 1865}, {"type": "A", "before": null, "after": "exact number of changes with the", "start_char_pos": 1870, "end_char_pos": 1870}, {"type": "R", "before": "and shown that the bounds are sharp", "after": "provided by our formulas. Finally, we provide statistics on the sharpness of these upper bounds in random networks", "start_char_pos": 1884, "end_char_pos": 1919}], "sents_char_pos": [0, 201, 411, 595, 754, 898, 1101, 1197, 1417, 1609, 1791]} {"doc_id": "1907.01652", "revision_depth": "1", "before_revision": "This work introduces RadVR, a virtual reality daylighiting analysis tools, that simultaneously allows the analysis of qualitative immersive renderings and the assessment of quantitative data of physically correct daylighting simulations in a 6DOF virtual environment. With an end-to-end workflow and integration with commonly used modeling software, the system takes a 3D model and material properties as input and allows user-designers to (1) perform physically-based daylighting simulations powered by the Radianceengine (2) study sunlight penetration in different hours of the year by navigating through time (3) Interact with a 9-point-in-time matrix for the nine most representative times of the year (4) Visualize, compare and analyze daylighting simulation results using integrated tools in virtual reality. By conducting user experiments and comparing the system with a conventional 2D-display daylight analysis tool , Diva4Rhino, the results show that RadVR outperforms Diva4Rhino in spatial understanding tasks, navigation and sun position analysis .", "after_revision": "This work introduces RadVR, a virtual reality tool for daylighting analysis that simultaneously combines qualitative assessments through immersive real-time renderings with quantitative physically correct daylighting simulations in a 6DOF virtual environment. By taking a 3D building model with material properties as input , RadVR allows users to (1) perform physically-based daylighting simulations via Radiance, (2) study sunlight in different hours-of-the-year, (3) interact with a 9-point-in-time matrix for the most representative times of the year , and (4) visualize, compare, and analyze daylighting simulation results . With an end-to-end workflow, RadVR integrates with 3D modeling software that is commonly used by building designers. Additionally, by conducting user experiments we compare the proposed system with DIVA for Rhino, a Radiance-based tool that uses conventional 2D-displays. The results show that RadVR can provide promising assistance in spatial understanding tasks, navigation , and sun position analysis in virtual reality .", "edit_actions": [{"type": "R", "before": "daylighiting analysis tools, that simultaneously allows the analysis of qualitative immersive renderings and the assessment of quantitative data of", "after": "tool for daylighting analysis that simultaneously combines qualitative assessments through immersive real-time renderings with quantitative", "start_char_pos": 46, "end_char_pos": 193}, {"type": "R", "before": "With an end-to-end workflow and integration with commonly used modeling software, the system takes", "after": "By taking", "start_char_pos": 268, "end_char_pos": 366}, {"type": "R", "before": "model and", "after": "building model with", "start_char_pos": 372, "end_char_pos": 381}, {"type": "R", "before": "and allows user-designers", "after": ", RadVR allows users", "start_char_pos": 411, "end_char_pos": 436}, {"type": "R", "before": "powered by the Radianceengine", "after": "via Radiance,", "start_char_pos": 493, "end_char_pos": 522}, {"type": "R", "before": "penetration in different hours of the year by navigating through time", "after": "in different hours-of-the-year,", "start_char_pos": 542, "end_char_pos": 611}, {"type": "R", "before": "Interact", "after": "interact", "start_char_pos": 616, "end_char_pos": 624}, {"type": "D", "before": "nine", "after": null, "start_char_pos": 663, "end_char_pos": 667}, {"type": "A", "before": null, "after": ", and", "start_char_pos": 706, "end_char_pos": 706}, {"type": "R", "before": "Visualize, compare", "after": "visualize, compare,", "start_char_pos": 711, "end_char_pos": 729}, {"type": "R", "before": "using integrated tools in virtual reality. By", "after": ". With an end-to-end workflow, RadVR integrates with 3D modeling software that is commonly used by building designers. Additionally, by", "start_char_pos": 773, "end_char_pos": 818}, {"type": "R", "before": "and comparing the system with a conventional 2D-display daylight analysis tool , Diva4Rhino, the", "after": "we compare the proposed system with DIVA for Rhino, a Radiance-based tool that uses conventional 2D-displays. The", "start_char_pos": 847, "end_char_pos": 943}, {"type": "R", "before": "outperforms Diva4Rhino", "after": "can provide promising assistance", "start_char_pos": 968, "end_char_pos": 990}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1034, "end_char_pos": 1034}, {"type": "A", "before": null, "after": "in virtual reality", "start_char_pos": 1061, "end_char_pos": 1061}], "sents_char_pos": [0, 267, 443, 815]} {"doc_id": "1907.02936", "revision_depth": "1", "before_revision": "Surprise-based learning allows agents to adapt quickly in non-stationary stochastic environments . Most existing approaches to surprise-based learning and change point detection assume either implicitly or explicitly a simple, hierarchical generative model of observation sequences that are characterized by stationary periods separated by sudden changes. In this work we show that exact Bayesian inference gives naturally rise to a surprise-modulated trade-off between URLetting and integrating the new observations with the current belief. We demonstrate that many existing approximate Bayesian approaches also show surprise-based modulation of learning rates, and we derive novel particle filters and variational filters with update rules that exhibit surprise-based modulation. Our derived filters have a constant scaling in observation sequence length and particularly simple update dynamics for any distribution in the exponential family. Empirical results show that these filters estimate parameters better than alternative approximate approaches and reach comparative levels of performance to computationally more expensive algorithms. The theoretical insight of casting various approaches under the same interpretation of surprise-based learning, as well as the proposed filters, may find useful applications in reinforcement learning in non-stationary environments and in the analysis of animal and human behavior .", "after_revision": "Surprise-based learning allows agents to rapidly adapt to non-stationary stochastic environments characterized by stationary periods separated by sudden changes. We show that exact Bayesian inference in a hierarchical model gives rise to a surprise-modulated trade-off between URLetting old observations and integrating them with the new ones. The modulation depends on a probability ratio, called the \"Bayes Factor Surprise\" that tests the prior belief against the current belief. We demonstrate that in several existing approximate algorithms the Bayes Factor Surprise modulates the rate of adaptation to new observations. We derive three novel surprised-based algorithms, one in the family of particle filters, one in the family of variational learning, and the other in the family of message passing, that are biologically plausible, have constant scaling in observation sequence length and particularly simple update dynamics for any distribution in the exponential family. Empirical results show that these surprise-based algorithms estimate parameters better than alternative approximate approaches and reach levels of performance comparable to computationally more expensive algorithms. The Bayes Factor Surprise is related to but different from Shannon Surprise. In two hypothetical experiments, we make testable predictions for physiological or behavioral indicators that dissociate the Bayes Factor Surprise from Shannon Surprise. The theoretical insight of casting various approaches as surprise-based learning, as well as the proposed online algorithms, may be applied to the analysis of animal and human behavior , and to reinforcement learning in non-stationary environments .", "edit_actions": [{"type": "R", "before": "adapt quickly in", "after": "rapidly adapt to", "start_char_pos": 41, "end_char_pos": 57}, {"type": "D", "before": ". Most existing approaches to surprise-based learning and change point detection assume either implicitly or explicitly a simple, hierarchical generative model of observation sequences that are", "after": null, "start_char_pos": 97, "end_char_pos": 290}, {"type": "R", "before": "In this work we", "after": "We", "start_char_pos": 356, "end_char_pos": 371}, {"type": "R", "before": "gives naturally", "after": "in a hierarchical model gives", "start_char_pos": 407, "end_char_pos": 422}, {"type": "R", "before": "and integrating the new observations with the", "after": "old observations and integrating them with the new ones. The modulation depends on a probability ratio, called the \"Bayes Factor Surprise\" that tests the prior belief against the", "start_char_pos": 480, "end_char_pos": 525}, {"type": "R", "before": "many existing approximate Bayesian approaches also show surprise-based modulation of learning rates, and we derive novel particle filters and variational filters with update rules that exhibit surprise-based modulation. Our derived filters have a", "after": "in several existing approximate algorithms the Bayes Factor Surprise modulates the rate of adaptation to new observations. We derive three novel surprised-based algorithms, one in the family of particle filters, one in the family of variational learning, and the other in the family of message passing, that are biologically plausible, have", "start_char_pos": 562, "end_char_pos": 808}, {"type": "R", "before": "filters", "after": "surprise-based algorithms", "start_char_pos": 979, "end_char_pos": 986}, {"type": "D", "before": "comparative", "after": null, "start_char_pos": 1064, "end_char_pos": 1075}, {"type": "A", "before": null, "after": "comparable", "start_char_pos": 1098, "end_char_pos": 1098}, {"type": "A", "before": null, "after": "Bayes Factor Surprise is related to but different from Shannon Surprise. In two hypothetical experiments, we make testable predictions for physiological or behavioral indicators that dissociate the Bayes Factor Surprise from Shannon Surprise. The", "start_char_pos": 1149, "end_char_pos": 1149}, {"type": "R", "before": "under the same interpretation of", "after": "as", "start_char_pos": 1200, "end_char_pos": 1232}, {"type": "R", "before": "filters, may find useful applications in reinforcement learning in non-stationary environments and in", "after": "online algorithms, may be applied to", "start_char_pos": 1282, "end_char_pos": 1383}, {"type": "A", "before": null, "after": ", and to reinforcement learning in non-stationary environments", "start_char_pos": 1426, "end_char_pos": 1426}], "sents_char_pos": [0, 98, 355, 541, 781, 944, 1144]} {"doc_id": "1907.07412", "revision_depth": "1", "before_revision": "This paper provides a unified approach for detecting sample selection in nonparametric conditional mean and quantile functions. In fact, as sample selection leads to a loss of point identification in the nonparametric quantile case, our tests are of particular relevance when interest lies in the conditional distribution. Our testing strategy consists of a two-step procedure: the first test is an omitted predictor test , where the omitted variable is the propensity score . This test has power against generic n-alternatives , and failure to reject the null implies no selection . By contrast, as any omnibus test, we cannot distinguish between a rejection due to genuine selection or to generic mis-specification, when the omitted variable is correlated with the propensity score. Under the maintained assumption of no selection , our second test is therefore designed to detect mis-specification. This is achieved by a localized version of the first test, using only individuals with propensity score close to one . Although the second step requires `identification at infinity' , we can allow for cases of irregular identification. Finally, our testing procedure does not require any parametric assumptions on neither the outcome nor the selection equation(s) , and all our results in the conditional quantile case hold uniformly across quantile ranks in a compact set. We apply our procedure to test for selection in log hourly wages of females and males in the UK using the UK Family Expenditure Survey .", "after_revision": "This paper provides a unified approach for detecting sample selection in nonparametric conditional quantileand mean functions. Our testing strategy consists of a two-step procedure: the first test is an omitted predictor test with the propensity score as omitted variable . This test has power against n-alternatives . While failure to reject the null implies no selection , we cannot, as any omnibus test, distinguish between rejection due to genuine selection or to misspecification. Since differentiation of the latter has implications for nonparametric (point) identification and estimation of the conditional quantile function , our second test is designed to detect misspecification. Using only individuals with propensity score close to one , this test relies on an `identification at infinity' argument, but accommodates cases of irregular identification. Finally, our testing procedure does not require any parametric assumptions on the selection equation , and all our results in the quantile case hold uniformly across quantile ranks in a compact set. We apply our procedure to test for selection in log hourly wages using UK Family Expenditure Survey data .", "edit_actions": [{"type": "R", "before": "mean and quantile functions. In fact, as sample selection leads to a loss of point identification in the nonparametric quantile case, our tests are of particular relevance when interest lies in the conditional distribution.", "after": "quantile", "start_char_pos": 99, "end_char_pos": 322}, {"type": "A", "before": null, "after": "and", "start_char_pos": 322, "end_char_pos": 322}, {"type": "A", "before": null, "after": "mean functions.", "start_char_pos": 323, "end_char_pos": 323}, {"type": "R", "before": ", where the omitted variable is the propensity score", "after": "with the propensity score as omitted variable", "start_char_pos": 423, "end_char_pos": 475}, {"type": "D", "before": "generic", "after": null, "start_char_pos": 506, "end_char_pos": 513}, {"type": "R", "before": ", and", "after": ". While", "start_char_pos": 529, "end_char_pos": 534}, {"type": "R", "before": ". By contrast,", "after": ", we cannot,", "start_char_pos": 583, "end_char_pos": 597}, {"type": "R", "before": "we cannot distinguish between a", "after": "distinguish between", "start_char_pos": 619, "end_char_pos": 650}, {"type": "R", "before": "generic mis-specification, when the omitted variable is correlated with the propensity score. Under the maintained assumption of no selection", "after": "misspecification. Since differentiation of the latter has implications for nonparametric (point) identification and estimation of the conditional quantile function", "start_char_pos": 692, "end_char_pos": 833}, {"type": "D", "before": "therefore", "after": null, "start_char_pos": 855, "end_char_pos": 864}, {"type": "R", "before": "mis-specification. This is achieved by a localized version of the first test, using", "after": "misspecification. Using", "start_char_pos": 884, "end_char_pos": 967}, {"type": "R", "before": ". Although the second step requires", "after": ", this test relies on an", "start_char_pos": 1020, "end_char_pos": 1055}, {"type": "R", "before": ", we can allow for", "after": "argument, but accommodates", "start_char_pos": 1085, "end_char_pos": 1103}, {"type": "R", "before": "neither the outcome nor the selection equation(s)", "after": "the selection equation", "start_char_pos": 1217, "end_char_pos": 1266}, {"type": "D", "before": "conditional", "after": null, "start_char_pos": 1296, "end_char_pos": 1307}, {"type": "R", "before": "of females and males in the UK using the", "after": "using", "start_char_pos": 1442, "end_char_pos": 1482}, {"type": "A", "before": null, "after": "data", "start_char_pos": 1512, "end_char_pos": 1512}], "sents_char_pos": [0, 127, 322, 477, 584, 785, 902, 1021, 1138, 1376]} {"doc_id": "1907.07835", "revision_depth": "1", "before_revision": "In this paper, we propose a regularized graph neural network (RGNN) for EEG-based emotion recognition. EEG signals measure the neuronal activities on different brain regions via electrodes attached on them. Existing studies do not exploit the topological structure of EEG signals effectively. Our RGNNmodel is biologically supported and captures both local and global inter-channel relations. In addition, we propose two regularizers, namely NodeDAT and EmotionDL , to improve the robustness of our model against cross-subject EEG variations and noisy labels during recording . To thoroughly evaluate our model, we conduct extensive experiment in both subject-dependent and subject-independent classification settings on two public datasets SEED and SEED-IV. Our model obtains better performance than a few competitive baselines such as SVM, DBN, DGCNN, BiDANN, and the state-of-the-art BiHDM on most of the tasks . Our model analysis demonstrates that our proposed biologically-supported adjacency matrix and two regularizers contribute consistent and significant gain to the performance of our model . Investigations on the neuronal activities reveal that pre-frontal, parietal and occipital regions may be the most informative regions in emotion recognition . In addition, local inter-channel relations between (FP1, AF3), (F6, F8) and (FP2, AF4) may provide useful information as well .", "after_revision": " EEG signals measure the neuronal activities on different brain regions via electrodes . Many existing studies on EEG-based emotion recognition do not exploit the topological structure of EEG signals . In this paper, we propose a regularized graph neural network (RGNN) for EEG-based emotion recognition, which is biologically supported and captures both local and global inter-channel relations. Specifically, we model the inter-channel relations in EEG signals via an adjacency matrix in our graph neural network where the connection and sparseness of the adjacency matrix are supported by the neurosicience theories of human URLanization. In addition, we propose two regularizers, namely node-wise domain adversarial training (NodeDAT) and emotion-aware distribution learning (EmotionDL) , to improve the robustness of our model against cross-subject EEG variations and noisy labels , respectively . To thoroughly evaluate our model, we conduct extensive experiments in both subject-dependent and subject-independent classification settings on two public datasets : SEED and SEED-IV. Our model obtains better performance than competitive baselines such as SVM, DBN, DGCNN, BiDANN, and the state-of-the-art BiHDM in most experimental settings . Our model analysis demonstrates that the proposed biologically supported adjacency matrix and two regularizers contribute consistent and significant gain to the performance . Investigations on the neuronal activities reveal that pre-frontal, parietal and occipital regions may be the most informative regions for emotion recognition, which is consistent with relevant prior studies . In addition, experimental results suggest that global inter-channel relations between the left and right hemispheres are important for emotion recognition and local inter-channel relations between (FP1, AF3), (F6, F8) and (FP2, AF4) may also provide useful information .", "edit_actions": [{"type": "D", "before": "In this paper, we propose a regularized graph neural network (RGNN) for EEG-based emotion recognition.", "after": null, "start_char_pos": 0, "end_char_pos": 102}, {"type": "R", "before": "attached on them. Existing studies", "after": ". Many existing studies on EEG-based emotion recognition", "start_char_pos": 189, "end_char_pos": 223}, {"type": "R", "before": "effectively. Our RGNNmodel", "after": ". In this paper, we propose a regularized graph neural network (RGNN) for EEG-based emotion recognition, which", "start_char_pos": 280, "end_char_pos": 306}, {"type": "A", "before": null, "after": "Specifically, we model the inter-channel relations in EEG signals via an adjacency matrix in our graph neural network where the connection and sparseness of the adjacency matrix are supported by the neurosicience theories of human URLanization.", "start_char_pos": 393, "end_char_pos": 393}, {"type": "R", "before": "NodeDAT and EmotionDL", "after": "node-wise domain adversarial training (NodeDAT) and emotion-aware distribution learning (EmotionDL)", "start_char_pos": 443, "end_char_pos": 464}, {"type": "R", "before": "during recording", "after": ", respectively", "start_char_pos": 560, "end_char_pos": 576}, {"type": "R", "before": "experiment", "after": "experiments", "start_char_pos": 634, "end_char_pos": 644}, {"type": "A", "before": null, "after": ":", "start_char_pos": 742, "end_char_pos": 742}, {"type": "D", "before": "a few", "after": null, "start_char_pos": 803, "end_char_pos": 808}, {"type": "R", "before": "on most of the tasks", "after": "in most experimental settings", "start_char_pos": 895, "end_char_pos": 915}, {"type": "R", "before": "our proposed biologically-supported", "after": "the proposed biologically supported", "start_char_pos": 955, "end_char_pos": 990}, {"type": "D", "before": "of our model", "after": null, "start_char_pos": 1091, "end_char_pos": 1103}, {"type": "R", "before": "in emotion recognition", "after": "for emotion recognition, which is consistent with relevant prior studies", "start_char_pos": 1240, "end_char_pos": 1262}, {"type": "A", "before": null, "after": "experimental results suggest that global inter-channel relations between the left and right hemispheres are important for emotion recognition and", "start_char_pos": 1278, "end_char_pos": 1278}, {"type": "A", "before": null, "after": "also", "start_char_pos": 1357, "end_char_pos": 1357}, {"type": "D", "before": "as well", "after": null, "start_char_pos": 1385, "end_char_pos": 1392}], "sents_char_pos": [0, 102, 206, 292, 392, 578, 760, 917, 1105, 1264]} {"doc_id": "1907.09738", "revision_depth": "1", "before_revision": "Quantitative analyses of cells' nuclei in microscopical images is an essential yet still challenging step for further biological and pathological information. Accurate detection and segmentation of densely-packed nuclei in images acquired under a variety of conditions is the major challenge. With a sufficient number of training examples, Mask R-CNN based methods have achieved state-of-the-art results on nuclei segmentation. However, the current pipeline requires fully-annotated training images, which are time-consuming to create and sometimes infeasible because of the noisy nature of microscopical images. On the other hand , nuclei often have similar appearances within the same image - this could be utilized to segment nuclei with only partially labeled training examples. We propose a simple , yet effective region proposal module for the current Mask R-CNN pipeline to perform few exemplar learning. To capture the similarities between the unlabeled image regions and labeled nuclei, we apply decomposed self-attention to the learned image features. By carefully examining the self-attention map of the labeled nuclei , we observe strong activations on the centers and edges of all nuclei in the image, including those unlabeled . Based on this , our region proposal module propagates the partial annotations to the whole image , and then generates effective bounding box proposals for the bounding box regression and binary mask generation modules. When training with only 1/4 of the nuclei annotation , the baseline pipeline suffers from severe false negatives, while our approach can retain a comparable detection accuracy , compared to that of training with the fully annotated data. Moreover, our method can be used as a bootstrapping step to create full annotation of a dataset, where annotations are iteratively generated and corrected until the predetermined coverage and accuracy has been reached.", "after_revision": "Quantitative analysis of cell nuclei in microscopic images is an essential yet still challenging source of biological and pathological information. The major challenge is accurate detection and segmentation of densely packed nuclei in images acquired under a variety of conditions . With sufficient training examples, Mask R-CNN-based methods have achieved state-of-the-art nucleus segmentation. However, the current pipeline requires fully annotated training images, which are time consuming to create and sometimes infeasible because of the noisy nature of microscopic images. Importantly , nuclei often have similar appearances within the same image ; this similarity could be utilized to segment nuclei with only partially labeled training examples. We propose a simple yet effective region proposal module for the current Mask R-CNN pipeline to perform few-exemplar learning. To capture the similarities between the unlabeled regions and labeled nuclei, we apply decomposed self-attention to the learned features. On the self-attention map , we observe strong activation at the centers and edges of all nuclei , including the unlabeled ones. On this basis, our region proposal module propagates the partial annotations to the whole image and then proposes effective bounding boxes for the bounding box regression and binary mask generation modules. When trained with only 1/4 of the nuclei annotated , the baseline pipeline gives frequent false negatives, while our approach retains detection accuracy comparable to that of training with the fully annotated data. Moreover, our method can serve as a bootstrapping step to create a full annotation of a dataset, where annotations are iteratively generated and corrected until the predetermined coverage and accuracy are reached. The source code is available at URL", "edit_actions": [{"type": "R", "before": "analyses of cells' nuclei in microscopical", "after": "analysis of cell nuclei in microscopic", "start_char_pos": 13, "end_char_pos": 55}, {"type": "R", "before": "step for further", "after": "source of", "start_char_pos": 101, "end_char_pos": 117}, {"type": "R", "before": "Accurate", "after": "The major challenge is accurate", "start_char_pos": 159, "end_char_pos": 167}, {"type": "R", "before": "densely-packed", "after": "densely packed", "start_char_pos": 198, "end_char_pos": 212}, {"type": "R", "before": "is the major challenge. With a sufficient number of", "after": ". With sufficient", "start_char_pos": 269, "end_char_pos": 320}, {"type": "R", "before": "R-CNN based", "after": "R-CNN-based", "start_char_pos": 345, "end_char_pos": 356}, {"type": "R", "before": "results on nuclei", "after": "nucleus", "start_char_pos": 396, "end_char_pos": 413}, {"type": "R", "before": "fully-annotated", "after": "fully annotated", "start_char_pos": 467, "end_char_pos": 482}, {"type": "R", "before": "time-consuming", "after": "time consuming", "start_char_pos": 510, "end_char_pos": 524}, {"type": "R", "before": "microscopical images. On the other hand", "after": "microscopic images. Importantly", "start_char_pos": 591, "end_char_pos": 630}, {"type": "R", "before": "- this", "after": "; this similarity", "start_char_pos": 693, "end_char_pos": 699}, {"type": "D", "before": ",", "after": null, "start_char_pos": 803, "end_char_pos": 804}, {"type": "R", "before": "few exemplar", "after": "few-exemplar", "start_char_pos": 889, "end_char_pos": 901}, {"type": "D", "before": "image", "after": null, "start_char_pos": 962, "end_char_pos": 967}, {"type": "R", "before": "image features. By carefully examining", "after": "features. On", "start_char_pos": 1046, "end_char_pos": 1084}, {"type": "D", "before": "of the labeled nuclei", "after": null, "start_char_pos": 1108, "end_char_pos": 1129}, {"type": "R", "before": "activations on", "after": "activation at", "start_char_pos": 1150, "end_char_pos": 1164}, {"type": "D", "before": "in the image, including those unlabeled . Based on this", "after": null, "start_char_pos": 1201, "end_char_pos": 1256}, {"type": "A", "before": null, "after": "including the unlabeled ones. On this basis,", "start_char_pos": 1259, "end_char_pos": 1259}, {"type": "R", "before": ", and then generates effective bounding box proposals", "after": "and then proposes effective bounding boxes", "start_char_pos": 1341, "end_char_pos": 1394}, {"type": "R", "before": "training", "after": "trained", "start_char_pos": 1468, "end_char_pos": 1476}, {"type": "R", "before": "annotation", "after": "annotated", "start_char_pos": 1505, "end_char_pos": 1515}, {"type": "R", "before": "suffers from severe", "after": "gives frequent", "start_char_pos": 1540, "end_char_pos": 1559}, {"type": "R", "before": "can retain a comparable detection accuracy , compared", "after": "retains detection accuracy comparable", "start_char_pos": 1596, "end_char_pos": 1649}, {"type": "R", "before": "be used", "after": "serve", "start_char_pos": 1726, "end_char_pos": 1733}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1768, "end_char_pos": 1768}, {"type": "R", "before": "has been reached.", "after": "are reached. The source code is available at URL", "start_char_pos": 1903, "end_char_pos": 1920}], "sents_char_pos": [0, 158, 292, 427, 612, 782, 911, 1061, 1462, 1700]} {"doc_id": "1907.12030", "revision_depth": "1", "before_revision": "Gene regulatory networks (GRNs) are complex systems in which many genes mutually regulate their expressions for changing the cell state adaptively to the environmental conditions. Besides the functions , the GRNs utilized by living systems possess several kinds of robustness. Here, the robustness means that the GRNs do not lose their functions when exposed to mutation or noises. Both the adaptive response and the robustness have been acquired through the evolution. In this respect, real GRNs are rare among \"all the possible GRNs\" . In this study, we explore the fitness landscape of GRNs and investigate how the robustness emerge in the \"well-fitted\" GRNs. For that purpose, we employ the Multi-Canonical Monte Carlo method, which can sample GRNs randomly in wide range of fitness. We consider a toy model of GRNs having one input gene and one output gene. The difference in the expression levels between the input states \"on\" and \"off\" is taken as the fitness. Thus the more sensitively a GRN responds to the input , the fitter it is.We show the following properties for the GRNs in the \"fittest ensemble\" : (1) They distinguish two different states of the input by switching the fixed points . Thus they exhibit bistability , which necessarily emerges as the fitness becomes high. (2) They are robust against noises thanks to the bistability. (3) Many GRNs in the fittest ensemble are robust against mutation. These properties are universal irrespective of the evolutionary pathway, because we did not perform evolutionary simulations .", "after_revision": "Gene regulatory networks (GRNs) are complex systems in which many genes regulate mutually to adapt the cell state to environmental conditions. In addition to function , the GRNs possess several kinds of robustness. This robustness means that systems do not lose their functionality when exposed to disturbances such as mutations or noise, and is widely observed at many levels in living systems. Both function and robustness have been acquired through evolution. In this respect, GRNs utilized in living systems are rare among all possible GRNs . In this study, we explored the fitness landscape of GRNs and investigated how robustness emerged in highly-fit GRNs. We considered a toy model of GRNs with one input gene and one output gene. The difference in the expression level of the output gene between two input states, \"on\" and \"off\" , was considered as fitness. Thus , the determination of the fitness of a GRN was based on how sensitively it responded to the input .We employed the multicanonical Monte Carlo method, which can sample GRNs randomly in a wide range of fitness levels, and classified the GRNs according to their fitness. The following properties were found : (1) Highly-fit GRNs exhibited bistability for intermediate input between \"on\" and \"off\". This means that such GRNs responded to two input states by using different fixed points of dynamics. This bistability emerges necessarily as fitness increases . (2) These highly-fit GRNs were robust against noise because of their bistability. In other words, noise robustness is a byproduct of high fitness. (3) GRNs that were robust against mutations were not extremely rare among the highly-fit GRNs. This implies that mutational robustness is readily acquired through the evolutionary process. These properties are universal irrespective of the evolutionary pathway, because the results do not rely on evolutionary simulation .", "edit_actions": [{"type": "R", "before": "mutually regulate their expressions for changing", "after": "regulate mutually to adapt", "start_char_pos": 72, "end_char_pos": 120}, {"type": "R", "before": "adaptively to the", "after": "to", "start_char_pos": 136, "end_char_pos": 153}, {"type": "R", "before": "Besides the functions", "after": "In addition to function", "start_char_pos": 180, "end_char_pos": 201}, {"type": "D", "before": "utilized by living systems", "after": null, "start_char_pos": 213, "end_char_pos": 239}, {"type": "R", "before": "Here, the", "after": "This", "start_char_pos": 277, "end_char_pos": 286}, {"type": "R", "before": "the GRNs", "after": "systems", "start_char_pos": 309, "end_char_pos": 317}, {"type": "R", "before": "functions", "after": "functionality", "start_char_pos": 336, "end_char_pos": 345}, {"type": "R", "before": "mutation or noises. Both the adaptive response and the", "after": "disturbances such as mutations or noise, and is widely observed at many levels in living systems. Both function and", "start_char_pos": 362, "end_char_pos": 416}, {"type": "D", "before": "the", "after": null, "start_char_pos": 455, "end_char_pos": 458}, {"type": "R", "before": "real GRNs", "after": "GRNs utilized in living systems", "start_char_pos": 487, "end_char_pos": 496}, {"type": "R", "before": "\"all the possible GRNs\"", "after": "all possible GRNs", "start_char_pos": 512, "end_char_pos": 535}, {"type": "R", "before": "explore", "after": "explored", "start_char_pos": 556, "end_char_pos": 563}, {"type": "R", "before": "investigate how the robustness emerge in the \"well-fitted\" GRNs. For that purpose, we employ the Multi-Canonical Monte Carlo method, which can sample GRNs randomly in wide range of fitness. We consider", "after": "investigated how robustness emerged in highly-fit GRNs. We considered", "start_char_pos": 598, "end_char_pos": 799}, {"type": "R", "before": "having", "after": "with", "start_char_pos": 820, "end_char_pos": 826}, {"type": "R", "before": "levels between the input states", "after": "level of the output gene between two input states,", "start_char_pos": 896, "end_char_pos": 927}, {"type": "R", "before": "is taken as the", "after": ", was considered as", "start_char_pos": 943, "end_char_pos": 958}, {"type": "R", "before": "the more sensitively a GRN responds", "after": ", the determination of the fitness of a GRN was based on how sensitively it responded", "start_char_pos": 973, "end_char_pos": 1008}, {"type": "R", "before": ", the fitter it is.We show the following properties for the GRNs in the \"fittest ensemble\"", "after": ".We employed the multicanonical Monte Carlo method, which can sample GRNs randomly in a wide range of fitness levels, and classified the GRNs according to their fitness. The following properties were found", "start_char_pos": 1022, "end_char_pos": 1112}, {"type": "R", "before": "They distinguish two different states of the input by switching the fixed points", "after": "Highly-fit GRNs exhibited bistability for intermediate input between \"on\" and \"off\". This means that such GRNs responded to two input states by using different fixed points of dynamics. This bistability emerges necessarily as fitness increases", "start_char_pos": 1119, "end_char_pos": 1199}, {"type": "D", "before": "Thus they exhibit bistability , which necessarily emerges as the fitness becomes high.", "after": null, "start_char_pos": 1202, "end_char_pos": 1288}, {"type": "R", "before": "They are robust against noises thanks to the bistability.", "after": "These highly-fit GRNs were robust against noise because of their bistability. In other words, noise robustness is a byproduct of high fitness.", "start_char_pos": 1293, "end_char_pos": 1350}, {"type": "R", "before": "Many GRNs in the fittest ensemble are robust against mutation.", "after": "GRNs that were robust against mutations were not extremely rare among the highly-fit GRNs. This implies that mutational robustness is readily acquired through the evolutionary process.", "start_char_pos": 1355, "end_char_pos": 1417}, {"type": "R", "before": "we did not perform evolutionary simulations", "after": "the results do not rely on evolutionary simulation", "start_char_pos": 1499, "end_char_pos": 1542}], "sents_char_pos": [0, 179, 276, 381, 469, 787, 862, 967, 1041, 1201, 1288, 1350, 1417]} {"doc_id": "1908.00981", "revision_depth": "1", "before_revision": "One challenging aspect of the Connected and Automated Vehicle (CAV) operation in mixed traffic is the development of a situation awareness module for CAVs. While operating on public roads, CAVs need to assess the surrounding, especially intentions of non-CAVs. Generally, CAVs demonstrate a defensive driving behavior, and CAVs expect other non-autonomous entities on the road will follow the traffic rules or common driving norms . However, the presence of aggressive human drivers in the surrounding environment, who may not follow traffic rules and behave abruptly, can lead to serious safety consequences. In this paper, we have addressed the CAV and non-CAV interaction by evaluating a situation awareness module for left-turning CAV operations in an urban area. Existing literature does not consider the intent of the follower vehicle for a left-turning movement of a CAV , and existing CAV controllers do not assess intents of the follower non-CAVs . Based on our simulation study, the situation-aware CAV controller module reduces 40 \\% of the abrupt braking of the follower non-CAVs for the scenario of 600 vphpl on the opposing through movement , compared to the base scenario with the autonomous vehicle without considering intents of the follower vehicles . For opposite through traffic volumes with 800 and 1000 vphpln, the reduction decreases to 10\\%. The analysis shows that the average travel time reductions for the opposite through traffic volumes of 600, 800 and 1000 vphpln are 61\\%, 23 \\%, and 41 \\%, respectively, for the follower non-CAV if the intent of the follower vehicle is considered by a CAV in making a left turn at an intersection.", "after_revision": "One challenging aspect of the Connected and Automated Vehicle (CAV) operation in mixed traffic is the development of a situation-awareness module for CAVs. While operating on public roads, CAVs need to assess their surroundings, especially the intentions of non-CAVs. Generally, CAVs demonstrate a defensive driving behavior, and CAVs expect other non-autonomous entities on the road will follow the traffic rules or common driving behavior . However, the presence of aggressive human drivers in the surrounding environment, who may not follow traffic rules and behave abruptly, can lead to serious safety consequences. In this paper, we have addressed the CAV and non-CAV interaction by evaluating a situation-awareness module for left-turning CAV operations in an urban area. Existing literature does not consider the intent of the following vehicle for a CAVs left-turning movement , and existing CAV controllers do not assess the following non-CAVs intents . Based on our simulation study, the situation-aware CAV controller module reduces up to 27 \\% of the abrupt braking of the following non-CAVs for scenarios with different opposing through movement compared to the base scenario with the autonomous vehicle , without considering the following vehicles intent. The analysis shows that the average travel time reductions for the opposite through traffic volumes of 600, 800 , and 1000 vehicle/hour/lane are 58\\%, 52 \\%, and 62 \\%, respectively, for the aggressive human driver following the CAV if the following vehicles intent is considered by a CAV in making a left turn at an intersection.", "edit_actions": [{"type": "R", "before": "situation awareness", "after": "situation-awareness", "start_char_pos": 119, "end_char_pos": 138}, {"type": "R", "before": "the surrounding, especially", "after": "their surroundings, especially the", "start_char_pos": 209, "end_char_pos": 236}, {"type": "R", "before": "norms", "after": "behavior", "start_char_pos": 425, "end_char_pos": 430}, {"type": "R", "before": "situation awareness", "after": "situation-awareness", "start_char_pos": 691, "end_char_pos": 710}, {"type": "R", "before": "follower", "after": "following", "start_char_pos": 824, "end_char_pos": 832}, {"type": "A", "before": null, "after": "CAVs", "start_char_pos": 847, "end_char_pos": 847}, {"type": "D", "before": "of a CAV", "after": null, "start_char_pos": 870, "end_char_pos": 878}, {"type": "R", "before": "intents of the follower", "after": "the following", "start_char_pos": 924, "end_char_pos": 947}, {"type": "A", "before": null, "after": "intents", "start_char_pos": 957, "end_char_pos": 957}, {"type": "R", "before": "40", "after": "up to 27", "start_char_pos": 1041, "end_char_pos": 1043}, {"type": "R", "before": "follower", "after": "following", "start_char_pos": 1076, "end_char_pos": 1084}, {"type": "R", "before": "the scenario of 600 vphpl on the", "after": "scenarios with different", "start_char_pos": 1098, "end_char_pos": 1130}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1157, "end_char_pos": 1158}, {"type": "R", "before": "without considering intents of the follower vehicles . For opposite through traffic volumes with 800 and 1000 vphpln, the reduction decreases to 10\\%.", "after": ", without considering the following vehicles intent.", "start_char_pos": 1217, "end_char_pos": 1367}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1480, "end_char_pos": 1480}, {"type": "R", "before": "vphpln are 61\\%, 23", "after": "vehicle/hour/lane are 58\\%, 52", "start_char_pos": 1490, "end_char_pos": 1509}, {"type": "R", "before": "41", "after": "62", "start_char_pos": 1518, "end_char_pos": 1520}, {"type": "R", "before": "follower non-CAV if the intent of the follower vehicle", "after": "aggressive human driver following the CAV if the following vehicles intent", "start_char_pos": 1547, "end_char_pos": 1601}], "sents_char_pos": [0, 155, 260, 432, 609, 767, 880, 1271, 1367]} {"doc_id": "1908.04875", "revision_depth": "1", "before_revision": "Standard approaches for uncertainty quantification (UQ) in cardiovascular modeling pose challenges due to the large number of uncertain inputs and the significant computational cost of realistic 3D simulations. We propose an efficient UQ framework utilizing a multilevel multifidelity Monte Carlo (MLMF) estimator to improve the accuracy of hemodynamic quantities of interest while maintaining reasonable computational cost. This is achieved by leveraging three cardiovascular model fidelities, each with varying spatial resolution to rigorously quantify the variability in hemodynamic outputs. Our goal is to investigate and compare the efficiency of estimators built from two low-fidelity model alternatives and our high-fidelity 3D models. We demonstrate this framework on healthy and diseased models of aortic and coronary anatomy, including uncertainties in material property and boundary condition parameters. Our goal is to demonstrate that for this application it is possible to accelerate the convergence of the estimators by utilizing a MLMF paradigm. Therefore, we compare our approach to single fidelity Monte Carlo estimators and to a multilevel Monte Carlo approach based only on 3D simulations, but leveraging multiple spatial resolutions . We demonstrate significant , on the order of 10 to 100 times, reduction in total computational cost with the MLMF estimators. We also examine the differing properties of the MLMF estimators in healthy versus diseased models, as well as global versus local quantities of interest. As expected, healthy models and global quantities show larger reductions than diseased models and local quantities as the latter rely more heavily on the highest fidelity model evaluations. In all cases, our workflow coupling Dakota MLMF estimators with the SimVascular cardiovascular workflow make UQ feasible for constrained computational budgets.", "after_revision": "Standard approaches for uncertainty quantification in cardiovascular modeling pose challenges due to the large number of uncertain inputs and the significant computational cost of realistic three-dimensional simulations. We propose an efficient uncertainty quantification framework utilizing a multilevel multifidelity Monte Carlo estimator to improve the accuracy of hemodynamic quantities of interest while maintaining reasonable computational cost. This is achieved by leveraging three cardiovascular model fidelities, each with varying spatial resolution to rigorously quantify the variability in hemodynamic outputs. We employ two low-fidelity models to construct several different estimators. Our goal is to investigate and compare the efficiency of estimators built from combinations of these low-fidelity and high-fidelity models. We demonstrate this framework on healthy and diseased models of aortic and coronary anatomy, including uncertainties in material property and boundary condition parameters. We seek to demonstrate that for this application it is possible to accelerate the convergence of the estimators by utilizing a MLMF paradigm. Therefore, we compare our approach to Monte Carlo and multilevel Monte Carlo estimators based only on three-dimensional simulations . We demonstrate significant reduction in total computational cost with the MLMF estimators. We also examine the differing properties of the MLMF estimators in healthy versus diseased models, as well as global versus local quantities of interest. As expected, global quantities and healthy models show larger reductions than local quantities and diseased model, as the latter rely more heavily on the highest fidelity model evaluations. In all cases, our workflow coupling Dakota 's MLMF estimators with the SimVascular cardiovascular modeling framework makes uncertainty quantification feasible for constrained computational budgets.", "edit_actions": [{"type": "D", "before": "(UQ)", "after": null, "start_char_pos": 51, "end_char_pos": 55}, {"type": "R", "before": "3D", "after": "three-dimensional", "start_char_pos": 195, "end_char_pos": 197}, {"type": "R", "before": "UQ", "after": "uncertainty quantification", "start_char_pos": 235, "end_char_pos": 237}, {"type": "D", "before": "(MLMF)", "after": null, "start_char_pos": 297, "end_char_pos": 303}, {"type": "A", "before": null, "after": "We employ two low-fidelity models to construct several different estimators.", "start_char_pos": 595, "end_char_pos": 595}, {"type": "R", "before": "two", "after": "combinations of these", "start_char_pos": 675, "end_char_pos": 678}, {"type": "R", "before": "model alternatives and our", "after": "and", "start_char_pos": 692, "end_char_pos": 718}, {"type": "D", "before": "3D", "after": null, "start_char_pos": 733, "end_char_pos": 735}, {"type": "R", "before": "Our goal is", "after": "We seek", "start_char_pos": 917, "end_char_pos": 928}, {"type": "R", "before": "single fidelity Monte Carlo estimators and to a", "after": "Monte Carlo and", "start_char_pos": 1101, "end_char_pos": 1148}, {"type": "R", "before": "approach", "after": "estimators", "start_char_pos": 1172, "end_char_pos": 1180}, {"type": "R", "before": "3D simulations, but leveraging multiple spatial resolutions", "after": "three-dimensional simulations", "start_char_pos": 1195, "end_char_pos": 1254}, {"type": "D", "before": ", on the order of 10 to 100 times,", "after": null, "start_char_pos": 1284, "end_char_pos": 1318}, {"type": "R", "before": "healthy models and global quantities", "after": "global quantities and healthy models", "start_char_pos": 1550, "end_char_pos": 1586}, {"type": "R", "before": "diseased models and local quantities", "after": "local quantities and diseased model,", "start_char_pos": 1615, "end_char_pos": 1651}, {"type": "A", "before": null, "after": "'s", "start_char_pos": 1770, "end_char_pos": 1770}, {"type": "R", "before": "workflow make UQ", "after": "modeling framework makes uncertainty quantification", "start_char_pos": 1823, "end_char_pos": 1839}], "sents_char_pos": [0, 210, 424, 594, 743, 916, 1062, 1256, 1382, 1536, 1726]} {"doc_id": "1908.05086", "revision_depth": "1", "before_revision": "By extending the crude Goldman-Hodgkin-Katz electrodiffusion model for resting-state membrane potentials in perfused axons of squid we reformulate the Hodgkin-Huxley (HH) phenomenological quantitative model to create a model which is simpler , more quantitative, and based more fundamentally on electrodiffusion principles. Our dynamical system, like that of HH, behaves as a 4-dimensional resonator exhibiting subthreshold oscillations. Speeds of propagating action potentials at 20 degrees Celsius are in very good agreement with the HH experimental value at 18.5 degrees Celsius. Unlike its HH counterpart it does not predict spike trains during prolonged constant-current stimulation, in agreement with recent experiments . Our resonator model predicts rebound spiking following prolonged hyperpolarizing stimulation, observed at 18.5 degrees Celsius by HH but not predicted at this temperature by their quantitative model. Spiking promoted by brief (0.1 ms) hyperpolarization is also predicted at room temperature by our electrodiffusion model but only at much lower temperatures (ca. 6 degrees Celsius) by the HH model. Such spiking in giant axons induced directly by brief hyperpolarizing stimulation at room temperature does not appear to have been investigated experimentally for either stationary membrane action potentialsor their propagating counterparts .", "after_revision": "By extending the crude Goldman-Hodgkin-Katz electrodiffusion model for resting-state membrane potentials in perfused giant axons of squid , we reformulate the Hodgkin-Huxley (HH) phenomenological quantitative model to create a new model which is simpler and based more fundamentally on electrodiffusion principles. Our dynamical system, like that of HH, behaves as a 4-dimensional resonator exhibiting subthreshold oscillations. The predicted speed of propagating action potentials at 20 degrees Celsius is in good agreement with the HH experimental value at 18.5 degrees Celsius. After the external concentration of calcium ions is reduced, the generation of repetitive rebound action potentials is predicted by our model, in agreement with experiment, when the membrane is stimulated by a brief (0.1 ms) depolarizing current. Unlike the HH model, our model predicts, in agreement with experiment, that prolonged constant-current stimulation does not generate spike trains in perfused axons . Our resonator model predicts rebound spiking following prolonged hyperpolarizing stimulation, observed at 18.5 degrees Celsius by HH but not predicted at this temperature by their quantitative model. Spiking promoted by brief hyperpolarization is also predicted , at room temperature , by our electrodiffusion model , but only at much lower temperatures (ca. 6 degrees Celsius) by the HH model. We discuss qualitatively, more completely than do HH, temperature dependences of the various physical effects which determine resting and action potentials .", "edit_actions": [{"type": "A", "before": null, "after": "giant", "start_char_pos": 117, "end_char_pos": 117}, {"type": "A", "before": null, "after": ",", "start_char_pos": 133, "end_char_pos": 133}, {"type": "A", "before": null, "after": "new", "start_char_pos": 221, "end_char_pos": 221}, {"type": "D", "before": ", more quantitative,", "after": null, "start_char_pos": 245, "end_char_pos": 265}, {"type": "R", "before": "Speeds", "after": "The predicted speed", "start_char_pos": 441, "end_char_pos": 447}, {"type": "R", "before": "are in very", "after": "is in", "start_char_pos": 503, "end_char_pos": 514}, {"type": "R", "before": "Unlike its HH counterpart it does not predict spike trains during prolonged", "after": "After the external concentration of calcium ions is reduced, the generation of repetitive rebound action potentials is predicted by our model, in agreement with experiment, when the membrane is stimulated by a brief (0.1 ms) depolarizing current. Unlike the HH model, our model predicts, in agreement with experiment, that prolonged", "start_char_pos": 586, "end_char_pos": 661}, {"type": "R", "before": "stimulation, in agreement with recent experiments", "after": "stimulation does not generate spike trains in perfused axons", "start_char_pos": 679, "end_char_pos": 728}, {"type": "D", "before": "(0.1 ms)", "after": null, "start_char_pos": 957, "end_char_pos": 965}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1002, "end_char_pos": 1002}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1023, "end_char_pos": 1023}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1054, "end_char_pos": 1054}, {"type": "R", "before": "Such spiking in giant axons induced directly by brief hyperpolarizing stimulation at room temperature does not appear to have been investigated experimentally for either stationary membrane action potentialsor their propagating counterparts", "after": "We discuss qualitatively, more completely than do HH, temperature dependences of the various physical effects which determine resting and action potentials", "start_char_pos": 1132, "end_char_pos": 1372}], "sents_char_pos": [0, 326, 440, 585, 730, 930, 1131]} {"doc_id": "1908.06869", "revision_depth": "1", "before_revision": "The world sees a proliferation of machine learning/deep learning (ML) models and their wide adoption in different application domainsrecently . This has made the profiling and characterization of ML models an increasingly pressing task for both hardware designers and system providers, as they would like to offer the best possible computing system to serve ML models with the desired latency, throughput, and energy requirements while maximizing resource utilization. Such an endeavor is challenging as the characteristics of an ML model depend on the interplay between the model, framework, system libraries, and the hardware (or the HW/SW stack). A thorough characterization requires understanding the behavior of the model execution across the HW/SW stack levels. Existing profiling tools are disjoint, however, and only focus on profiling within a particular level of the stack . This paper proposes a leveled profiling design that leverages existing profiling tools to perform across-stack profiling. The design does so in spite of the profiling overheads incurred from the profiling providers. We coupled the profiling capability with an automatic analysis pipeline to systematically characterize 65 state-of-the-art ML models. Through this characterization, we show that our across-stack profiling solution provides insights (which are difficult to discern otherwise ) on the characteristics of ML models, ML frameworks, and GPU hardware .", "after_revision": "There has been a rapid proliferation of machine learning/deep learning (ML) models and wide adoption of them in many application domains . This has made profiling and characterization of ML model performance an increasingly pressing task for both hardware designers and system providers, as they would like to offer the best possible system to serve ML models with the target latency, throughput, cost, and energy requirements while maximizing resource utilization. Such an endeavor is challenging as the characteristics of an ML model depend on the interplay between the model, framework, system libraries, and the hardware (or the HW/SW stack). Existing profiling tools are disjoint, however, and only focus on profiling within a particular level of the stack , which limits the thoroughness and usefulness of the profiling results . This paper proposes XSP --- an across-stack profiling design that gives a holistic and hierarchical view of ML model execution. XSP leverages distributed tracing to aggregate and correlate profile data from different sources. XSP introduces a leveled and iterative measurement approach that accurately captures the latencies at all levels of the HW/SW stack in spite of the profiling overhead. We couple the profiling design with an automated analysis pipeline to systematically analyze 65 state-of-the-art ML models. We demonstrate that XSP provides insights which would be difficult to discern otherwise .", "edit_actions": [{"type": "R", "before": "The world sees a", "after": "There has been a rapid", "start_char_pos": 0, "end_char_pos": 16}, {"type": "R", "before": "their wide adoption in different application domainsrecently", "after": "wide adoption of them in many application domains", "start_char_pos": 81, "end_char_pos": 141}, {"type": "D", "before": "the", "after": null, "start_char_pos": 158, "end_char_pos": 161}, {"type": "R", "before": "models", "after": "model performance", "start_char_pos": 199, "end_char_pos": 205}, {"type": "D", "before": "computing", "after": null, "start_char_pos": 332, "end_char_pos": 341}, {"type": "R", "before": "desired", "after": "target", "start_char_pos": 377, "end_char_pos": 384}, {"type": "A", "before": null, "after": "cost,", "start_char_pos": 406, "end_char_pos": 406}, {"type": "D", "before": "A thorough characterization requires understanding the behavior of the model execution across the HW/SW stack levels.", "after": null, "start_char_pos": 651, "end_char_pos": 768}, {"type": "A", "before": null, "after": ", which limits the thoroughness and usefulness of the profiling results", "start_char_pos": 884, "end_char_pos": 884}, {"type": "R", "before": "a leveled", "after": "XSP --- an across-stack", "start_char_pos": 907, "end_char_pos": 916}, {"type": "R", "before": "leverages existing profiling tools to perform across-stack profiling. The design does so", "after": "gives a holistic and hierarchical view of ML model execution. XSP leverages distributed tracing to aggregate and correlate profile data from different sources. XSP introduces a leveled and iterative measurement approach that accurately captures the latencies at all levels of the HW/SW stack", "start_char_pos": 939, "end_char_pos": 1027}, {"type": "R", "before": "overheads incurred from the profiling providers. We coupled the profiling capability with an automatic", "after": "overhead. We couple the profiling design with an automated", "start_char_pos": 1054, "end_char_pos": 1156}, {"type": "R", "before": "characterize", "after": "analyze", "start_char_pos": 1193, "end_char_pos": 1205}, {"type": "R", "before": "Through this characterization, we show that our across-stack profiling solution provides insights (which are", "after": "We demonstrate that XSP provides insights which would be", "start_char_pos": 1237, "end_char_pos": 1345}, {"type": "D", "before": ") on the characteristics of ML models, ML frameworks, and GPU hardware", "after": null, "start_char_pos": 1377, "end_char_pos": 1447}], "sents_char_pos": [0, 143, 469, 650, 768, 886, 1008, 1102, 1236]} {"doc_id": "1908.07395", "revision_depth": "1", "before_revision": "Using molecular dynamics (MD) to simulate drug binding unbinding is a challenge . Because it requires sampling rugged energy landscapes that separate bound and unbound states , it has a high cost and consumes significant computational resources. Here, we describe the use of interactive molecular dynamics in virtual reality (iMD-VR) as a low-cost strategy for generating reversible protein-ligand binding and unbinding pathways . We outline an experimental protocol which enables expert iMD-VR users to generate reversible pathways for guiding ligands into and out of the binding pockets of trypsin, neuraminidase, and HIV-1 protease, and recreate their respective crystallographic protein-ligand binding poses within 5 - 10 minutes. Detailed test carried out to evaluate the use of iMD-VR by novices showed that (following a brief training phase ) they were similarly able to generate unbinding and rebinding pathways which recovered binding poses on similar timescales as the experts . These results indicate that iMD-VR affords sufficient control for users to generate reversible binding pathways that recover crystallographic poses, offering a new approach for simulating drug docking and generating binding hypothesis .", "after_revision": "Simulating drug binding and unbinding is a challenge , as the rugged energy landscapes that separate bound and unbound states require extensive sampling that consumes significant computational resources. Here, we describe the use of interactive molecular dynamics in virtual reality (iMD-VR) as an accurate low-cost strategy for flexible protein-ligand docking . We outline an experimental protocol which enables expert iMD-VR users to guide ligands into and out of the binding pockets of trypsin, neuraminidase, and HIV-1 protease, and recreate their respective crystallographic protein-ligand binding poses within 5 - 10 minutes. Following a brief training phase , our studies shown that iMD-VR novices were able to generate unbinding and rebinding pathways on similar timescales as iMD-VR experts, with the majority able to recover binding poses within 2.15 Angstrom RMSD of the crystallographic binding pose . These results indicate that iMD-VR affords sufficient control for users to carry out the detailed atomic manipulations required to dock flexible ligands into dynamic enzyme active sites and recover crystallographic poses, offering an interesting new approach for simulating drug docking and generating binding hypotheses .", "edit_actions": [{"type": "R", "before": "Using molecular dynamics (MD) to simulate drug binding", "after": "Simulating drug binding and", "start_char_pos": 0, "end_char_pos": 54}, {"type": "R", "before": ". Because it requires sampling", "after": ", as the", "start_char_pos": 80, "end_char_pos": 110}, {"type": "R", "before": ", it has a high cost and", "after": "require extensive sampling that", "start_char_pos": 175, "end_char_pos": 199}, {"type": "R", "before": "a", "after": "an accurate", "start_char_pos": 337, "end_char_pos": 338}, {"type": "R", "before": "generating reversible", "after": "flexible", "start_char_pos": 361, "end_char_pos": 382}, {"type": "R", "before": "binding and unbinding pathways", "after": "docking", "start_char_pos": 398, "end_char_pos": 428}, {"type": "R", "before": "generate reversible pathways for guiding", "after": "guide", "start_char_pos": 504, "end_char_pos": 544}, {"type": "R", "before": "Detailed test carried out to evaluate the use of iMD-VR by novices showed that (following", "after": "Following", "start_char_pos": 735, "end_char_pos": 824}, {"type": "R", "before": ") they were similarly", "after": ", our studies shown that iMD-VR novices were", "start_char_pos": 848, "end_char_pos": 869}, {"type": "D", "before": "which recovered binding poses", "after": null, "start_char_pos": 920, "end_char_pos": 949}, {"type": "R", "before": "the experts", "after": "iMD-VR experts, with the majority able to recover binding poses within 2.15 Angstrom RMSD of the crystallographic binding pose", "start_char_pos": 975, "end_char_pos": 986}, {"type": "R", "before": "generate reversible binding pathways that", "after": "carry out the detailed atomic manipulations required to dock flexible ligands into dynamic enzyme active sites and", "start_char_pos": 1064, "end_char_pos": 1105}, {"type": "R", "before": "a", "after": "an interesting", "start_char_pos": 1147, "end_char_pos": 1148}, {"type": "R", "before": "hypothesis", "after": "hypotheses", "start_char_pos": 1213, "end_char_pos": 1223}], "sents_char_pos": [0, 81, 245, 430, 734, 988]} {"doc_id": "1908.09067", "revision_depth": "1", "before_revision": "Different convolutional neural network (CNN) models have been tested for their application in histologic imaging analyses. However, these models are prone to overfitting due to their large parameter capacity, requiring more data and expensive computational resources for model training. Given these limitations, we developed and tested PlexusNet for histologic evaluation using a single GPU by a batch dimension of 16x512x512x3 . We utilized 62 Hematoxylin and eosin stain (H&E) annotated histological images of radical prostatectomy cases from TCGA-PRAD and Stanford University , and 24 H&E whole-slide images with hepatocellular carcinoma from TCGA-LIHC diagnostic histology images. Base models were DenseNet, Inception V3, and MobileNet and compared with PlexusNet. The dice coefficient (DSC) was evaluated for each model . PlexusNet delivered comparable classification performance ( DSC at patch level: 0.89) for H E whole-slice images in distinguishing prostate cancer from normal tissues. The parameter capacity of PlexusNet is 9 times smallerthan MobileNet or 58 times smaller than Inception V3, respectively. Similar findings were observed in distinguishing hepatocellular carcinoma from non-cancerous liver histologies (DSC at patch level: 0.85). As conclusion, PlexusNet represents a novel model architecture for histological image analysis that achieves classification performance comparable to the base models while providing orders-of-magnitude memory savings .", "after_revision": "Different convolutional neural network (CNN) models have been tested for their application in histological image analyses. However, these models are prone to overfitting due to their large parameter capacity, requiring more data or valuable computational resources for model training. Given these limitations, we introduced a novel architecture (termed PlexusNet) . We utilized 310 Hematoxylin and Eosin stained (H&E) annotated histological images of prostate cancer cases from TCGA-PRAD and Stanford University and 398 H&E whole slides images from the Camelyon 2016 challenge. PlexusNet-architecture -derived models were compared to models derived from several existing \"state of the art\" architectures. We measured discrimination accuracy, calibration, and clinical utility. An ablation study was conducted to study the effect of each component of PlexusNet on model performance. A well-fitted PlexusNet-based model delivered comparable classification performance ( AUC: 0.963) in distinguishing prostate cancer from healthy tissues, although it was at least 23 times smaller, had a better model calibration and clinical utility than the comparison models. A separate smaller PlexusNet model accurately detected slides with breast cancer metastases (AUC: 0.978); it helped reduce the slide number to examine by 43.8\\% without consequences, although its parameter capacity was 200 times smaller than ResNet18. We found that the partitioning of the development set influences the model calibration for all models. However, with PlexusNet architecture, we could achieve comparable well-calibrated models trained on different partitions. In conclusion, PlexusNet represents a novel model architecture for histological image analysis that achieves classification performance comparable to other models while providing orders-of-magnitude parameter reduction .", "edit_actions": [{"type": "R", "before": "histologic imaging", "after": "histological image", "start_char_pos": 94, "end_char_pos": 112}, {"type": "R", "before": "and expensive", "after": "or valuable", "start_char_pos": 229, "end_char_pos": 242}, {"type": "R", "before": "developed and tested PlexusNet for histologic evaluation using a single GPU by a batch dimension of 16x512x512x3", "after": "introduced a novel architecture (termed PlexusNet)", "start_char_pos": 315, "end_char_pos": 427}, {"type": "R", "before": "62 Hematoxylin and eosin stain", "after": "310 Hematoxylin and Eosin stained", "start_char_pos": 442, "end_char_pos": 472}, {"type": "R", "before": "radical prostatectomy", "after": "prostate cancer", "start_char_pos": 512, "end_char_pos": 533}, {"type": "R", "before": ", and 24", "after": "and 398", "start_char_pos": 579, "end_char_pos": 587}, {"type": "R", "before": "whole-slide images with hepatocellular carcinoma from TCGA-LIHC diagnostic histology images. Base models were DenseNet, Inception V3, and MobileNet and compared with PlexusNet. The dice coefficient (DSC) was evaluated for each", "after": "whole slides images from the Camelyon 2016 challenge. PlexusNet-architecture -derived models were compared to models derived from several existing \"state of the art\" architectures. We measured discrimination accuracy, calibration, and clinical utility. An ablation study was conducted to study the effect of each component of PlexusNet on model performance. A well-fitted PlexusNet-based", "start_char_pos": 592, "end_char_pos": 818}, {"type": "D", "before": ". PlexusNet", "after": null, "start_char_pos": 825, "end_char_pos": 836}, {"type": "D", "before": "DSC at patch level: 0.89) for H", "after": null, "start_char_pos": 887, "end_char_pos": 918}, {"type": "R", "before": "E whole-slice images", "after": "AUC: 0.963)", "start_char_pos": 919, "end_char_pos": 939}, {"type": "R", "before": "normal tissues. The parameter capacity of PlexusNet is 9 times smallerthan MobileNet or 58 times smaller than Inception V3, respectively. Similar findings were observed in distinguishing hepatocellular carcinoma from non-cancerous liver histologies (DSC at patch level: 0.85). As", "after": "healthy tissues, although it was at least 23 times smaller, had a better model calibration and clinical utility than the comparison models. A separate smaller PlexusNet model accurately detected slides with breast cancer metastases (AUC: 0.978); it helped reduce the slide number to examine by 43.8\\% without consequences, although its parameter capacity was 200 times smaller than ResNet18. We found that the partitioning of the development set influences the model calibration for all models. However, with PlexusNet architecture, we could achieve comparable well-calibrated models trained on different partitions. In", "start_char_pos": 979, "end_char_pos": 1258}, {"type": "R", "before": "the base", "after": "other", "start_char_pos": 1406, "end_char_pos": 1414}, {"type": "R", "before": "memory savings", "after": "parameter reduction", "start_char_pos": 1458, "end_char_pos": 1472}], "sents_char_pos": [0, 122, 286, 429, 684, 768, 994, 1116, 1255]} {"doc_id": "1909.03348", "revision_depth": "1", "before_revision": "We reveal thepsychological bias of economic agents in their judgments of future economic conditions by applying the behavioral economics and weakly supervised learning . In the Economy Watcher Survey, which is a dataset published by the Japanese government, there are assessments of current and future economic conditions by people with various occupations . Although this dataset gives essential insights regarding economic policy to the Japanese government and the central bank of Japan, there is no clear definition of future economic conditions. Hence, in the survey, respondents answer their assessments based on their interpretations of the future. In our research, we classify the text data using learning from positive and unlabeled data (PU learning), which is a method of weakly supervised learning. The dataset is composed of several periods, and we develop a new algorithm of PU learning for efficient training with the dataset . Through empirical analysis, we show the interpretation of the classification results from the viewpoint of behavioral economics.", "after_revision": "We reveal the different interpretations of the future in their judgments of future economic conditions by applying weakly supervised learning and text mining . In the Economy Watcher Survey, which is a market survey published by the Japanese government, there are assessments of current and future economic conditions by people from various fields . Although this survey provides insights regarding an economic policy for policymakers in Japan, there is no clear definition of the future, in future economic conditions. Hence, in the survey, respondents make their assessments based on their interpretations of the future. In our research, we separate the assessments of future economic conditions into near and distant future economic conditions using learning from positive and unlabeled data (PU learning), which is weakly supervised learning. The dataset is composed of several periods, and we develop a PU learning algorithm for efficient training , using the dataset with the time series . Through empirical analysis, we interpret the classification results from the viewpoint of economics.", "edit_actions": [{"type": "R", "before": "thepsychological bias of economic agents", "after": "the different interpretations of the future", "start_char_pos": 10, "end_char_pos": 50}, {"type": "D", "before": "the behavioral economics and", "after": null, "start_char_pos": 112, "end_char_pos": 140}, {"type": "A", "before": null, "after": "and text mining", "start_char_pos": 168, "end_char_pos": 168}, {"type": "R", "before": "dataset", "after": "market survey", "start_char_pos": 213, "end_char_pos": 220}, {"type": "R", "before": "assessments of current and future economic conditions by people with various occupations", "after": "assessments of current and future economic conditions", "start_char_pos": 269, "end_char_pos": 357}, {"type": "A", "before": null, "after": "by people from various fields", "start_char_pos": 358, "end_char_pos": 358}, {"type": "R", "before": "dataset gives essential insights regarding economic policy to the Japanese government and the central bank of", "after": "survey provides insights regarding an economic policy for policymakers in", "start_char_pos": 375, "end_char_pos": 484}, {"type": "R", "before": "future", "after": "the future, in future", "start_char_pos": 524, "end_char_pos": 530}, {"type": "R", "before": "answer", "after": "make", "start_char_pos": 586, "end_char_pos": 592}, {"type": "R", "before": "classify the text data", "after": "separate the assessments of future economic conditions into near and distant future economic conditions", "start_char_pos": 677, "end_char_pos": 699}, {"type": "D", "before": "a method of", "after": null, "start_char_pos": 772, "end_char_pos": 783}, {"type": "R", "before": "new algorithm of PU learning", "after": "PU learning algorithm", "start_char_pos": 873, "end_char_pos": 901}, {"type": "R", "before": "with the dataset", "after": ", using the dataset with the time series", "start_char_pos": 925, "end_char_pos": 941}, {"type": "R", "before": "show the interpretation of the", "after": "interpret the", "start_char_pos": 975, "end_char_pos": 1005}, {"type": "D", "before": "behavioral", "after": null, "start_char_pos": 1051, "end_char_pos": 1061}], "sents_char_pos": [0, 170, 360, 551, 656, 811, 943]} {"doc_id": "1909.04452", "revision_depth": "1", "before_revision": "Income inequality is one of the most significant socio-economic challenges confronting India, with potentially long-lasting implications for the future of its democracy and society. In this work, we explore income inequality in India, without assumptions of equilibrium, and illustrate the nature and direction of re-distribution within the income distributionin a dynamic sense. Given that both mean income and income inequality show a rising trend post the Industrial Revolution, we argue that such a process is appropriately modeled using Geometric Brownian Motion (GBM). Specifically, we use the mechanism of GBM with a reallocation parameter (which indicates the nature of re-distribution occurring in the income distribution) proposed by Berman et al. We find that since the mid-1990s, reallocation is negative, meaning that incomes are exponentially diverging , indicating that there is a perverse re-distribution of resources from the poor to the rich. It has been well known that static inequality is rising in India , but the assumption has been that while the rich may be benefiting more than proportionally from economic growth, the poor are also better off than before. The surprising finding from our work is that the nature of income inequality is such that we have moved from a regime of progressive to regressive re-distribution. Essentially, continued impoverishment of the poor is directly spurring multiplicative income growth of the rich. We characterize these findings in the context of increasing informality of the workforce in the formal manufacturing and service sectors, as well as the possible evolution of negative net incomes of the agriculture workforce in India. Significant structural changes may be required to address this phenomenon.", "after_revision": "We investigate the nature and extent of reallocation occurring within the Indian income distribution, with a particular focus on the dynamics of the bottom of the distribution. We argue that income evolution is appropriately modelled using Geometric Brownian Motion (GBM). Specifically, we use the mechanism of GBM with a reallocation parameter that quantifies the extent and direction of reallocation in the distribution, as proposed by Berman et al. We find that since the early 2000s reallocation is negative, meaning that incomes are exponentially diverging and that there is a perverse redistribution of resources from the poor to the rich. It is well known that inequality has been rising in India in the recent past , but the assumption has been that while the rich benefit more than proportionally from economic growth, the poor are also better off than before. Our work refutes this as we find that India has moved from a regime of progressive to regressive redistribution, where continued impoverishment of the poor is directly spurring multiplicative income growth of the rich. Outcomes from the model suggest that income shares of the bottom decile (~1\\%) and bottom percentile (~0.03\\%) are at historic lows. We characterize these findings in the context of increasing informalization of the workforce in the formal manufacturing and service sectors, as well as the growing economic insecurity of the agricultural workforce in India. Significant structural changes will be required to address this phenomenon.", "edit_actions": [{"type": "R", "before": "Income inequality is one of", "after": "We investigate the nature and extent of reallocation occurring within the Indian income distribution, with a particular focus on the dynamics of", "start_char_pos": 0, "end_char_pos": 27}, {"type": "R", "before": "most significant socio-economic challenges confronting India, with potentially long-lasting implications for the future of its democracy and society. In this work, we explore income inequality in India, without assumptions of equilibrium, and illustrate the nature and direction of re-distribution within the income distributionin a dynamic sense. Given that both mean income and income inequality show a rising trend post the Industrial Revolution, we argue that such a process is appropriately modeled", "after": "bottom of the distribution. We argue that income evolution is appropriately modelled", "start_char_pos": 32, "end_char_pos": 535}, {"type": "R", "before": "(which indicates the nature of re-distribution occurring in the income distribution)", "after": "that quantifies the extent and direction of reallocation in the distribution, as", "start_char_pos": 647, "end_char_pos": 731}, {"type": "R", "before": "mid-1990s,", "after": "early 2000s", "start_char_pos": 781, "end_char_pos": 791}, {"type": "R", "before": ", indicating", "after": "and", "start_char_pos": 867, "end_char_pos": 879}, {"type": "R", "before": "re-distribution", "after": "redistribution", "start_char_pos": 905, "end_char_pos": 920}, {"type": "R", "before": "has been", "after": "is", "start_char_pos": 964, "end_char_pos": 972}, {"type": "R", "before": "static inequality is", "after": "inequality has been", "start_char_pos": 989, "end_char_pos": 1009}, {"type": "A", "before": null, "after": "in the recent past", "start_char_pos": 1026, "end_char_pos": 1026}, {"type": "R", "before": "may be benefiting", "after": "benefit", "start_char_pos": 1077, "end_char_pos": 1094}, {"type": "R", "before": "The surprising finding from our work is that the nature of income inequality is such that we have", "after": "Our work refutes this as we find that India has", "start_char_pos": 1184, "end_char_pos": 1281}, {"type": "R", "before": "re-distribution. Essentially,", "after": "redistribution, where", "start_char_pos": 1331, "end_char_pos": 1360}, {"type": "A", "before": null, "after": "Outcomes from the model suggest that income shares of the bottom decile (~1\\%) and bottom percentile (~0.03\\%) are at historic lows.", "start_char_pos": 1461, "end_char_pos": 1461}, {"type": "R", "before": "informality", "after": "informalization", "start_char_pos": 1522, "end_char_pos": 1533}, {"type": "R", "before": "possible evolution of negative net incomes of the agriculture", "after": "growing economic insecurity of the agricultural", "start_char_pos": 1615, "end_char_pos": 1676}, {"type": "R", "before": "may", "after": "will", "start_char_pos": 1728, "end_char_pos": 1731}], "sents_char_pos": [0, 181, 379, 574, 757, 960, 1183, 1347, 1460, 1696]} {"doc_id": "1909.05719", "revision_depth": "1", "before_revision": "Virtual reality (VR) has re-emerged as a low-cost, highly accessible consumer product, and training on simulators is rapidly becoming standard in many industrial sectors. Combined with the continued advancements in VR technology, the interest in platforms that generate immersive experiences has increased. However, the available systems are either focusing on gaming context, featuring limited capabilities (embedded editors in game engines) or they support only content creation of virtual environments without any rapid prototyping and modification. In this project we propose Scenior, an innovative coding-free, visual scripting platform to replicate gamified training scenarios through Rapid Prototyping via newly defined VR software design patterns. We implemented and compared three authoring tools: a) Prototyped scripting , b) Visual Scripting and c) VR Editor for rapid reconstruction of VR training scenarios. Our Visual Scripting module is capable generating training applications utilizing a node-based scripting system whereas the VR Editor gives the user/developer the ability to customize and populate new VR training scenarios directly from within the virtual environment. We also introduce Action Prototypes , a new software design pattern suitable to replicate behavioural tasks for VR experiences. In a addition, we present the scenegraph architecture as the main model to represent training scenarios on a modular, dynamic and highly adaptive acyclic graph based on a structured educational curriculum .", "after_revision": "Virtual reality (VR) has re-emerged as a low-cost, highly accessible consumer product, and training on simulators is rapidly becoming standard in many industrial sectors. However, the available systems are either focusing on gaming context, featuring limited capabilities or they support only content creation of virtual environments without any rapid prototyping and modification. In this project , we propose a code-free, visual scripting platform to replicate gamified training scenarios through rapid prototyping and VR software design patterns. We implemented and compared two authoring tools: a) visual scripting and b) VR editor for the rapid reconstruction of VR training scenarios. Our visual scripting module is capable to generate training applications utilizing a node-based scripting system whereas the VR editor gives user/developer the ability to customize and populate new VR training scenarios directly from the virtual environment. We also introduce action prototypes , a new software design pattern suitable to replicate behavioral tasks for VR experiences. In addition, we present the training scenegraph architecture as the main model to represent training scenarios on a modular, dynamic and highly adaptive acyclic graph based on a structured educational curriculum . Finally, a user-based evaluation of the proposed solution indicated that users - regardless of their programming expertise - can effectively use the tools to create and modify training scenarios in VR .", "edit_actions": [{"type": "D", "before": "Combined with the continued advancements in VR technology, the interest in platforms that generate immersive experiences has increased.", "after": null, "start_char_pos": 171, "end_char_pos": 306}, {"type": "D", "before": "(embedded editors in game engines)", "after": null, "start_char_pos": 408, "end_char_pos": 442}, {"type": "R", "before": "we propose Scenior, an innovative coding-free,", "after": ", we propose a code-free,", "start_char_pos": 569, "end_char_pos": 615}, {"type": "R", "before": "Rapid Prototyping via newly defined", "after": "rapid prototyping and", "start_char_pos": 691, "end_char_pos": 726}, {"type": "R", "before": "three", "after": "two", "start_char_pos": 784, "end_char_pos": 789}, {"type": "R", "before": "Prototyped scripting , b) Visual Scripting and c) VR Editor for", "after": "visual scripting and b) VR editor for the", "start_char_pos": 810, "end_char_pos": 873}, {"type": "R", "before": "Visual Scripting", "after": "visual scripting", "start_char_pos": 925, "end_char_pos": 941}, {"type": "R", "before": "generating", "after": "to generate", "start_char_pos": 960, "end_char_pos": 970}, {"type": "R", "before": "Editor gives the", "after": "editor gives", "start_char_pos": 1048, "end_char_pos": 1064}, {"type": "D", "before": "within", "after": null, "start_char_pos": 1158, "end_char_pos": 1164}, {"type": "R", "before": "Action Prototypes", "after": "action prototypes", "start_char_pos": 1208, "end_char_pos": 1225}, {"type": "R", "before": "behavioural", "after": "behavioral", "start_char_pos": 1280, "end_char_pos": 1291}, {"type": "D", "before": "a", "after": null, "start_char_pos": 1321, "end_char_pos": 1322}, {"type": "A", "before": null, "after": "training", "start_char_pos": 1348, "end_char_pos": 1348}, {"type": "A", "before": null, "after": ". Finally, a user-based evaluation of the proposed solution indicated that users - regardless of their programming expertise - can effectively use the tools to create and modify training scenarios in VR", "start_char_pos": 1524, "end_char_pos": 1524}], "sents_char_pos": [0, 170, 306, 552, 755, 920, 1189, 1317]} {"doc_id": "1909.06539", "revision_depth": "1", "before_revision": "Bioinformatics of high throughput omics data (e.g. microarrays and proteomics) has been plagued by uncountable issues with reproducibility at the start of the century. Concerns have motivated international initiatives such as the FDA's led MAQC Consortium, addressing reproducibility of predictive biomarkers by means of appropriate Data Analysis Plans (DAPs). For instance, nested cross-validation is a standard procedure meant to mitigate the risk that information from held-out validation data may be reached during model selection. We prove here that, many years later, Data Leakage can still be a non negligible overfitting source in deep learning models for digital pathology due to (i) the presence of multiple images for each subject in histology collections; (ii) the systematic adoption of training over collection of subregions ( tiles or patches ) extracted for the same subject. We quantify that between 1\\% and 12\\% of accuracy scores may result inflated , even if a well designed 10x5 nested cross-validation DAP is applied, unless all images from the same subject are kept together either in the internal training or validation splits. Results are replicated for 4 classification tasks on 3 datasets, for a total of 364 subjectsand 538 total slides ( about 27, 000 tiles). Impact of applying transfer learning methods is also discussed.", "after_revision": "Bioinformatics of high throughput omics data (e.g. microarrays and proteomics) has been plagued by uncountable issues with reproducibility at the start of the century. Concerns have motivated international initiatives such as the FDA's led MAQC Consortium, addressing reproducibility of predictive biomarkers by means of appropriate Data Analysis Plans (DAPs). For instance, repreated cross-validation is a standard procedure meant at mitigating the risk that information from held-out validation data may be used during model selection. We prove here that, many years later, Data Leakage can still be a non-negligible overfitting source in deep learning models for digital pathology . In particular, we evaluate the impact of (i) the presence of multiple images for each subject in histology collections; (ii) the systematic adoption of training over collection of subregions ( i.e. \"tiles\" or \"patches\" ) extracted for the same subject. We verify that accuracy scores may be inflated up to 41\\% , even if a well-designed 10x5 iterated cross-validation DAP is applied, unless all images from the same subject are kept together either in the internal training or validation splits. Results are replicated for 4 classification tasks in digital pathology on 3 datasets, for a total of 373 subjects, and 543 total slides ( around 27, 000 tiles). Impact of applying transfer learning strategies with models pre-trained on general-purpose or digital pathology datasets is also discussed.", "edit_actions": [{"type": "R", "before": "nested", "after": "repreated", "start_char_pos": 375, "end_char_pos": 381}, {"type": "R", "before": "to mitigate", "after": "at mitigating", "start_char_pos": 429, "end_char_pos": 440}, {"type": "R", "before": "reached", "after": "used", "start_char_pos": 504, "end_char_pos": 511}, {"type": "R", "before": "non negligible", "after": "non-negligible", "start_char_pos": 602, "end_char_pos": 616}, {"type": "R", "before": "due to", "after": ". In particular, we evaluate the impact of", "start_char_pos": 682, "end_char_pos": 688}, {"type": "R", "before": "tiles or patches", "after": "i.e. \"tiles\" or \"patches\"", "start_char_pos": 841, "end_char_pos": 857}, {"type": "R", "before": "quantify that between 1\\% and 12\\% of", "after": "verify that", "start_char_pos": 895, "end_char_pos": 932}, {"type": "R", "before": "result inflated", "after": "be inflated up to 41\\%", "start_char_pos": 953, "end_char_pos": 968}, {"type": "R", "before": "well designed", "after": "well-designed", "start_char_pos": 981, "end_char_pos": 994}, {"type": "R", "before": "nested", "after": "iterated", "start_char_pos": 1000, "end_char_pos": 1006}, {"type": "A", "before": null, "after": "in digital pathology", "start_char_pos": 1202, "end_char_pos": 1202}, {"type": "R", "before": "364 subjectsand 538", "after": "373 subjects, and 543", "start_char_pos": 1233, "end_char_pos": 1252}, {"type": "R", "before": "about", "after": "around", "start_char_pos": 1268, "end_char_pos": 1273}, {"type": "R", "before": "methods", "after": "strategies with models pre-trained on general-purpose or digital pathology datasets", "start_char_pos": 1327, "end_char_pos": 1334}], "sents_char_pos": [0, 167, 360, 535, 767, 891, 1151, 1289]} {"doc_id": "1909.09695", "revision_depth": "1", "before_revision": "In the last decades, the frequency of pandemics has been increased due to the growth of urbanization and mobility among countries. Since a disease spreading in one country could become a pandemic with a potential worldwide humanitarian and economic impact, it is important to develop models to estimate the probability of a worldwide pandemic. In this paper, we propose a model of disease spreading in a modular complex network (having communities) and study how the number of bridge nodes n that connect communities affects the disease spreading . We find that our model can be described at a global scale as an infectious transmission process between communities with infectious and recovery time distributions that depend on the internal structure of each community and n. At the steady state, we find that near the critical point as the number of bridge nodes increases, the disease could reach all the communitiesbut with a small fraction of recovered nodes in each community . In addition, we obtain that in this limit\\to , the probability of a pandemic increases abruptly at the critical point. This scenario could make more difficult the decision to launch or not a pandemic alert . Finally, we show that link percolation theory can be used at a global scale to estimate the probability of a pandemic .", "after_revision": "In the past few decades, the frequency of pandemics has been increased due to the growth of urbanization and mobility among countries. Since a disease spreading in one country could become a pandemic with a potential worldwide humanitarian and economic impact, it is important to develop models to estimate the probability of a worldwide pandemic. In this paper, we propose a model of disease spreading in a structural modular complex network (having communities) and study how the number of bridge nodes n that connect communities affects disease spread . We find that our model can be described at a global scale as an infectious transmission process between communities with global infectious and recovery time distributions that depend on the internal structure of each community and n. We find that near the critical point as n increases, the disease reaches most of the communities, but each community has only a small fraction of recovered nodes . In addition, we obtain that in the limit n\\to \\infty , the probability of a pandemic increases abruptly at the critical point. This scenario could make the decision on whether to launch a pandemic alert or not more difficult . Finally, we show that link percolation theory can be used at a global scale to estimate the probability of a pandemic since the global transmissibility between communities has a weak dependence on the global recovery time .", "edit_actions": [{"type": "R", "before": "last", "after": "past few", "start_char_pos": 7, "end_char_pos": 11}, {"type": "A", "before": null, "after": "structural", "start_char_pos": 404, "end_char_pos": 404}, {"type": "R", "before": "the disease spreading", "after": "disease spread", "start_char_pos": 526, "end_char_pos": 547}, {"type": "A", "before": null, "after": "global", "start_char_pos": 671, "end_char_pos": 671}, {"type": "R", "before": "At the steady state, we", "after": "We", "start_char_pos": 778, "end_char_pos": 801}, {"type": "R", "before": "the number of bridge nodes", "after": "n", "start_char_pos": 839, "end_char_pos": 865}, {"type": "R", "before": "could reach all the communitiesbut with", "after": "reaches most of the communities, but each community has only", "start_char_pos": 889, "end_char_pos": 928}, {"type": "D", "before": "in each community", "after": null, "start_char_pos": 965, "end_char_pos": 982}, {"type": "R", "before": "this limit", "after": "the limit n", "start_char_pos": 1016, "end_char_pos": 1026}, {"type": "A", "before": null, "after": "\\infty", "start_char_pos": 1030, "end_char_pos": 1030}, {"type": "R", "before": "more difficult the decision to launch or not", "after": "the decision on whether to launch", "start_char_pos": 1130, "end_char_pos": 1174}, {"type": "A", "before": null, "after": "or not more difficult", "start_char_pos": 1192, "end_char_pos": 1192}, {"type": "A", "before": null, "after": "since the global transmissibility between communities has a weak dependence on the global recovery time", "start_char_pos": 1313, "end_char_pos": 1313}], "sents_char_pos": [0, 130, 343, 549, 777, 984, 1104, 1194]} {"doc_id": "1910.03337", "revision_depth": "1", "before_revision": "Motivation: Discovering functional modules in protein-protein interaction (PPI) networks by optimization methods remains a longstanding challenge in biology . Traditional algorithms simply consider strong protein complexes that can be found in the original network by optimizing some metrics, which causes obstacles for the discovery of weak and hidden complexes shielded by stronger complexes. Also , protein complexes are not only in different density but also in a large range of scale, making it extremely difficult to be detected. Toward this objective, we propose a hierarchical hidden community approach to predict protein complexes . Results: We propose a method called HirHide (Hierarchical Hidden Community Detection), which can be combined with traditional community detection methods to enable them to discover hierarchical hidden communities . It is the first community detection algorithm that can find a hierarchical structure as well as hidden structure . We compare the performance of three traditional methods with their HirHide versions. Experimental results show that the HirHide methods using traditional methods as the base algorithms achieve better performance , sometimes even significantly outperform the baselines.", "after_revision": " Discovering functional modules in protein-protein interaction networks through optimization remains a longstanding challenge in Biology . Traditional algorithms simply consider strong protein complexes that can be found in the original network by optimizing some metric, which may cause obstacles for the discovery of weak and hidden complexes that are overshadowed by strong complexes. Additionally , protein complexes not only have different densities but also a various range of scales, making them extremely difficult to be detected. We address these issues and propose a hierarchical hidden community detection approach to accurately predict protein complexes of various strengths and scales. We propose a meta-method called HirHide (Hierarchical Hidden Community Detection), which can adopt any standard community detection method as the base algorithm and enable it to discover hierarchical hidden communities as well as boosting the detection on hierarchical strong communities. To our knowledge, this is the first combination of hierarchical structure with hidden structure, which provides a new perspective for finding protein complexes of various strengths and scales . We compare the performance of several standard community detection methods with their HirHide versions. Experimental results show that the HirHide versions achieve better performance and sometimes even significantly outperform the baselines.", "edit_actions": [{"type": "D", "before": "Motivation:", "after": null, "start_char_pos": 0, "end_char_pos": 11}, {"type": "R", "before": "(PPI) networks by optimization methods", "after": "networks through optimization", "start_char_pos": 74, "end_char_pos": 112}, {"type": "R", "before": "biology", "after": "Biology", "start_char_pos": 149, "end_char_pos": 156}, {"type": "R", "before": "metrics, which causes", "after": "metric, which may cause", "start_char_pos": 284, "end_char_pos": 305}, {"type": "R", "before": "shielded by stronger complexes. Also", "after": "that are overshadowed by strong complexes. Additionally", "start_char_pos": 363, "end_char_pos": 399}, {"type": "R", "before": "are not only in different density but also in a large range of scale, making it", "after": "not only have different densities but also a various range of scales, making them", "start_char_pos": 420, "end_char_pos": 499}, {"type": "R", "before": "Toward this objective, we", "after": "We address these issues and", "start_char_pos": 536, "end_char_pos": 561}, {"type": "R", "before": "approach to", "after": "detection approach to accurately", "start_char_pos": 602, "end_char_pos": 613}, {"type": "R", "before": ". Results:", "after": "of various strengths and scales.", "start_char_pos": 640, "end_char_pos": 650}, {"type": "R", "before": "method", "after": "meta-method", "start_char_pos": 664, "end_char_pos": 670}, {"type": "R", "before": "be combined with traditional community detection methods to enable them", "after": "adopt any standard community detection method as the base algorithm and enable it", "start_char_pos": 739, "end_char_pos": 810}, {"type": "R", "before": ". It", "after": "as well as boosting the detection on hierarchical strong communities. To our knowledge, this", "start_char_pos": 855, "end_char_pos": 859}, {"type": "R", "before": "community detection algorithm that can find a hierarchical structure as well as hidden structure", "after": "combination of hierarchical structure with hidden structure, which provides a new perspective for finding protein complexes of various strengths and scales", "start_char_pos": 873, "end_char_pos": 969}, {"type": "R", "before": "three traditional", "after": "several standard community detection", "start_char_pos": 1002, "end_char_pos": 1019}, {"type": "R", "before": "methods using traditional methods as the base algorithms", "after": "versions", "start_char_pos": 1100, "end_char_pos": 1156}, {"type": "R", "before": ",", "after": "and", "start_char_pos": 1184, "end_char_pos": 1185}], "sents_char_pos": [0, 158, 394, 535, 856, 971, 1056]} {"doc_id": "1910.03821", "revision_depth": "1", "before_revision": "This paper studies Quasi Maximum Likelihood estimation of dynamic factor models for large panels of time series. Specifically, we consider the case in which the autocorrelation of the factors is explicitly accounted for and therefore the factor model has a state-space form. Estimation of the factors and their loadings is implemented by means of the Expectation Maximization algorithm, jointly with the Kalman smoother. We prove that, as both the dimension of the panel n and the sample size T diverge to infinity , the estimated loadings , factors , and common components are \\min(\\sqrt n,\\sqrt T\\to \\to )-consistent and asymptotically normal . Although the model is estimated under the unrealistic constraint of independent idiosyncratic errors, this mis-specification does not affect consistency. Moreover, we give conditions under which the derived asymptotic distribution can still be used for inference even in case of mis-specifications. Our results are confirmed by a MonteCarlo simulation exercise where we compare the performance of our estimators with Principal Components .", "after_revision": "This paper studies Quasi Maximum Likelihood estimation of dynamic factor models for large panels of time series. Specifically, we consider the case in which the autocorrelation of the factors is explicitly accounted for and therefore the model has a state-space form. Estimation of the factors and of their loadings is implemented by means of the Expectation Maximization (EM) algorithm, jointly with the Kalman smoother. ~ We prove that, as both the dimension of the panel n and the sample size T diverge to infinity : (i) the estimated loadings are \\sqrt T-consistent and asymptotically normal if \\sqrt T/n\\to 0; (ii) the estimated factors are \\sqrt n-consistent and asymptotically normal if \\sqrt n/T\\to 0; (iii) the estimated common component is \\min(\\sqrt T,\\sqrt n )-consistent and asymptotically normal regardless of the relative rate of divergence of n and T . Although the model is estimated as if the idiosyncratic terms were cross-sectionally and serially uncorrelated, we show that these mis-specifications do not affect consistency. Moreover, the estimated loadings are asymptotically as efficient as those obtained with the Principal Components estimator, whereas numerical results show that the loss in efficiency of the estimated factors becomes negligible as n and T increase.~We then propose robust estimators of the asymptotic covariances, which can be used to conduct inference on the loadings and to compute confidence intervals for the factors and common components. In a MonteCarlo simulation exercise and an analysis of US macroeconomic data, we study the performance of our estimators and we compare them with the traditional Principal Components approach .", "edit_actions": [{"type": "D", "before": "factor", "after": null, "start_char_pos": 238, "end_char_pos": 244}, {"type": "A", "before": null, "after": "of", "start_char_pos": 305, "end_char_pos": 305}, {"type": "A", "before": null, "after": "(EM)", "start_char_pos": 377, "end_char_pos": 377}, {"type": "A", "before": null, "after": "~", "start_char_pos": 423, "end_char_pos": 423}, {"type": "R", "before": ",", "after": ": (i)", "start_char_pos": 518, "end_char_pos": 519}, {"type": "R", "before": ", factors , and common components are \\min(\\sqrt n,\\sqrt T", "after": "are \\sqrt T-consistent and asymptotically normal if \\sqrt T/n", "start_char_pos": 543, "end_char_pos": 601}, {"type": "A", "before": null, "after": "0; (ii) the estimated factors are \\sqrt n-consistent and asymptotically normal if \\sqrt n/T", "start_char_pos": 605, "end_char_pos": 605}, {"type": "A", "before": null, "after": "0; (iii) the estimated common component is \\min(\\sqrt T,\\sqrt n", "start_char_pos": 609, "end_char_pos": 609}, {"type": "A", "before": null, "after": "regardless of the relative rate of divergence of n and T", "start_char_pos": 649, "end_char_pos": 649}, {"type": "R", "before": "under the unrealistic constraint of independent idiosyncratic errors, this mis-specification does", "after": "as if the idiosyncratic terms were cross-sectionally and serially uncorrelated, we show that these mis-specifications do", "start_char_pos": 684, "end_char_pos": 781}, {"type": "R", "before": "we give conditions under which the derived asymptotic distribution can still be used for inference even in case of mis-specifications. Our results are confirmed by", "after": "the estimated loadings are asymptotically as efficient as those obtained with the Principal Components estimator, whereas numerical results show that the loss in efficiency of the estimated factors becomes negligible as n and T increase.~We then propose robust estimators of the asymptotic covariances, which can be used to conduct inference on the loadings and to compute confidence intervals for the factors and common components. In", "start_char_pos": 816, "end_char_pos": 979}, {"type": "R", "before": "where we compare", "after": "and an analysis of US macroeconomic data, we study", "start_char_pos": 1013, "end_char_pos": 1029}, {"type": "R", "before": "with Principal Components", "after": "and we compare them with the traditional Principal Components approach", "start_char_pos": 1064, "end_char_pos": 1089}], "sents_char_pos": [0, 112, 274, 422, 651, 805, 950]} {"doc_id": "1910.05546", "revision_depth": "2", "before_revision": "To predict and maximize future rewards in this ever-changing world, animals must be able to discover the temporal structure of stimuli and then anticipate or act correctly at the right time. However, we still lack a systematic understanding of the neural mechanisms of how animals perceive, maintain, and use time intervals ranging from hundreds of milliseconds to multi-seconds in working memory , the combination of time information with spatial information processing and decision making , and the reasons for the strong neuronal temporal signal even when animals performing tasks in which time information is not required . Here, we addressed these problems by training neural network models. We reveal that neural networks perceive time intervals through the evolution of population state along stereotypical trajectory, maintain time intervals by line attractor along which most neurons vary their activities monotonically with the duration of the maintained interval, and produce or compare time intervals by scaling the evolution velocity of population state . Time and non-time information is coded in subspaces orthogonal with each other, which facilitates generalizable decoding of time and non-time information . This is based on the network structure of multiple feedforward sequences that mutually excite or inhibit depending on whether their preferences of non-timing information are similar or not. Strong temporal signal in non-timing tasks arises from high temporal complexity of task, broad input tuning, multi-tasking and timing anticipation . Our work discloses fundamental computional principles of temporal processing, and is supported by and gives predictions to a number of experimental phenomena.", "after_revision": "To maximize future rewards in this ever-changing world, animals must be able to discover the temporal structure of stimuli and then anticipate or act correctly at the right time. How the animals perceive, maintain, and use time intervals ranging from hundreds of milliseconds to multi-seconds in working memory ? How temporal information is processed concurrently with spatial information and decision making ? Why there are strong neuronal temporal signals in tasks in which temporal information is not required ? A systematic understanding of the underlying neural mechanisms is still lacking . Here, we addressed these problems using supervised training of recurrent neural network models. We revealed that neural networks perceive elapsed time through state evolution along stereotypical trajectory, maintain time intervals in working memory in the monotonic increase or decrease of the firing rates of interval-tuned neurons, and compare or produce time intervals by scaling state evolution speed. Temporal and non-temporal information are coded in subspaces orthogonal with each other, and the state trajectories with time at different non-temporal information are quasi-parallel and isomorphic. Such coding geometry facilitates the decoding generalizability of temporal and non-temporal information across each other. The network structure exhibits multiple feedforward sequences that mutually excite or inhibit depending on whether their preferences of non-temporal information are similar or not. We identified four factors that facilitate strong temporal signals in non-timing tasks , including the anticipation of coming events . Our work discloses fundamental computational principles of temporal processing, and is supported by and gives predictions to a number of experimental phenomena.", "edit_actions": [{"type": "D", "before": "predict and", "after": null, "start_char_pos": 3, "end_char_pos": 14}, {"type": "R", "before": "However, we still lack a systematic understanding of the neural mechanisms of how", "after": "How the", "start_char_pos": 191, "end_char_pos": 272}, {"type": "R", "before": ", the combination of time information", "after": "? How temporal information is processed concurrently", "start_char_pos": 397, "end_char_pos": 434}, {"type": "D", "before": "processing", "after": null, "start_char_pos": 460, "end_char_pos": 470}, {"type": "R", "before": ", and the reasons for the", "after": "? Why there are", "start_char_pos": 491, "end_char_pos": 516}, {"type": "R", "before": "signal even when animals performing", "after": "signals in", "start_char_pos": 542, "end_char_pos": 577}, {"type": "R", "before": "time", "after": "temporal", "start_char_pos": 593, "end_char_pos": 597}, {"type": "A", "before": null, "after": "? A systematic understanding of the underlying neural mechanisms is still lacking", "start_char_pos": 626, "end_char_pos": 626}, {"type": "R", "before": "by training", "after": "using supervised training of recurrent", "start_char_pos": 663, "end_char_pos": 674}, {"type": "R", "before": "reveal", "after": "revealed", "start_char_pos": 701, "end_char_pos": 707}, {"type": "R", "before": "time intervals through the evolution of population state", "after": "elapsed time through state evolution", "start_char_pos": 738, "end_char_pos": 794}, {"type": "R", "before": "by line attractor along which most neurons vary their activities monotonically with the duration of the maintained interval, and produce or compare", "after": "in working memory in the monotonic increase or decrease of the firing rates of interval-tuned neurons, and compare or produce", "start_char_pos": 851, "end_char_pos": 998}, {"type": "R", "before": "the evolution velocity of population state . Time and non-time information is", "after": "state evolution speed. Temporal and non-temporal information are", "start_char_pos": 1025, "end_char_pos": 1102}, {"type": "R", "before": "which facilitates generalizable decoding of time and non-time information . This is based on the network structure of", "after": "and the state trajectories with time at different non-temporal information are quasi-parallel and isomorphic. Such coding geometry facilitates the decoding generalizability of temporal and non-temporal information across each other. The network structure exhibits", "start_char_pos": 1150, "end_char_pos": 1267}, {"type": "R", "before": "non-timing", "after": "non-temporal", "start_char_pos": 1373, "end_char_pos": 1383}, {"type": "R", "before": "Strong temporal signal", "after": "We identified four factors that facilitate strong temporal signals", "start_char_pos": 1416, "end_char_pos": 1438}, {"type": "R", "before": "arises from high temporal complexity of task, broad input tuning, multi-tasking and timing anticipation", "after": ", including the anticipation of coming events", "start_char_pos": 1459, "end_char_pos": 1562}, {"type": "R", "before": "computional", "after": "computational", "start_char_pos": 1596, "end_char_pos": 1607}], "sents_char_pos": [0, 190, 628, 697, 1069, 1225, 1415, 1564]} {"doc_id": "1910.06242", "revision_depth": "2", "before_revision": "One of the spectacular examples of a complex system is the financial market, which displays rich correlation structures among price returns of different assets. The eigenvalue decomposition of a correlation matrix into partial correlations - market, group and random modes, enables identification of dominant stocks or \"influential leaders\" and sectors or \"communities\". The correlation-based network of leaders and communities changes with time, especially during market events like crashes , bubbles, etc. Using the eigen-entropy measure , computed from the eigen-centralities (ranks) of different stocks in the correlation network, we extract information about the \"disorder \" (or randomness) in the market correlation and its different modes. The relative-entropy measures computed for these modes enable us to construct a \"phase space\", where the different market events undergo \"phase-separation\" and display \" order-disorder \" transitions, as observed in critical phenomena in physics. We choose the US S P-500 and Japanese Nikkei-225 financial markets, over a 32-year period, and study the evolution of the cross-correlation matrices and their corresponding eigen-entropies. One of the relative entropy measures displays \"universal scaling \" behaviorwith respect to the mean market correlation. Further, a functional of the relative entropy measure acts as a good gauge for the \"market fragility\" (minimum risk of the market portfolio) and the \"market fear\" (volatility index). This new methodology helps us to better understand market dynamics and characterize the events in different phases as anomalies, bubbles, crashes, etc. that display intriguing phase separation and universal scaling behavior .", "after_revision": "Financial markets, being spectacular examples of complex systems, display rich correlation structures among price returns of different assets. The correlation structures change drastically, akin to phase transitions in physical phenomena, as do the influential stocks (leaders) and sectors (communities), during market events like crashes . It is crucial to detect their signatures for timely intervention or prevention. Here we use eigenvalue decomposition and eigen-entropy , computed from eigen-centralities of different stocks in the cross-correlation matrix, to extract information about the disorder in the market . We construct a `phase space', where different market events (bubbles, crashes, etc.) undergo phase separation and display order-disorder transitions. An entropy functional exhibits scaling behavior. We propose a generic indicator that facilitates the continuous monitoring of the internal structure of the market -- important for managing risk and stress-testing the financial system. Our methodology would help in understanding and foreseeing tipping points or fluctuation patterns in complex systems .", "edit_actions": [{"type": "R", "before": "One of the", "after": "Financial markets, being", "start_char_pos": 0, "end_char_pos": 10}, {"type": "R", "before": "a complex system is the financial market, which displays", "after": "complex systems, display", "start_char_pos": 35, "end_char_pos": 91}, {"type": "R", "before": "eigenvalue decomposition of a correlation matrix into partial correlations - market, group and random modes, enables identification of dominant stocks or \"influential leaders\" and sectors or \"communities\". The correlation-based network of leaders and communities changes with time, especially", "after": "correlation structures change drastically, akin to phase transitions in physical phenomena, as do the influential stocks (leaders) and sectors (communities),", "start_char_pos": 165, "end_char_pos": 457}, {"type": "R", "before": ", bubbles, etc. Using the", "after": ". It is crucial to detect their signatures for timely intervention or prevention. Here we use eigenvalue decomposition and", "start_char_pos": 492, "end_char_pos": 517}, {"type": "D", "before": "measure", "after": null, "start_char_pos": 532, "end_char_pos": 539}, {"type": "D", "before": "the", "after": null, "start_char_pos": 556, "end_char_pos": 559}, {"type": "D", "before": "(ranks)", "after": null, "start_char_pos": 579, "end_char_pos": 586}, {"type": "R", "before": "correlation network, we", "after": "cross-correlation matrix, to", "start_char_pos": 614, "end_char_pos": 637}, {"type": "R", "before": "\"disorder \" (or randomness)", "after": "disorder", "start_char_pos": 668, "end_char_pos": 695}, {"type": "R", "before": "correlation and its different modes. The relative-entropy measures computed for these modes enable us to construct a \"phase space\", where the", "after": ". We construct a `phase space', where", "start_char_pos": 710, "end_char_pos": 851}, {"type": "R", "before": "undergo \"phase-separation\" and display \"", "after": "(bubbles, crashes, etc.) undergo phase separation and display", "start_char_pos": 876, "end_char_pos": 916}, {"type": "D", "before": "\" transitions, as observed in critical phenomena in physics. We choose the US S", "after": null, "start_char_pos": 932, "end_char_pos": 1011}, {"type": "R", "before": "P-500 and Japanese Nikkei-225 financial markets, over a 32-year period, and study the evolution of the cross-correlation matrices and their corresponding eigen-entropies. One of the relative entropy measures displays \"universal scaling \" behaviorwith respect to the mean market correlation. Further, a functional of the relative entropy measure acts as a good gauge for the \"market fragility\" (minimum risk", "after": "transitions. An entropy functional exhibits scaling behavior. We propose a generic indicator that facilitates the continuous monitoring of the internal structure", "start_char_pos": 1012, "end_char_pos": 1418}, {"type": "R", "before": "portfolio) and the \"market fear\" (volatility index). This new methodology helps us to better understand market dynamics and characterize the events in different phases as anomalies, bubbles, crashes, etc. that display intriguing phase separation and universal scaling behavior", "after": "-- important for managing risk and stress-testing the financial system. Our methodology would help in understanding and foreseeing tipping points or fluctuation patterns in complex systems", "start_char_pos": 1433, "end_char_pos": 1709}], "sents_char_pos": [0, 160, 370, 507, 746, 992, 1182, 1302, 1485]} {"doc_id": "1910.11380", "revision_depth": "1", "before_revision": "Introduction: Identifying the potential firing patterns following by different brain regions under normal and abnormal conditions increases our understanding of what is happening in the level of neural interactions in the brain. On the other hand, it is important to be capable of modeling the potential neural activities, in order to build precise artificial neural networks. The Izhikevich model is one of the simple biologically plausible models that is capable of capturing the most known firing patterns of neurons. This property makes the model efficient in simulating large-scale networks of neurons. Improving the Izhikevich model for adapting with the neuronal activity of rat brain with great accuracy would make the model effective for future neural network implementations. Methods: Data sampling from two brain regions, the HIP and BLA, is performed by extracellular recordings of male Wistar rats and spike sorting is done using Plexon offline sorter. Further data analyses are done through NeuroExplorer and MATLAB software. In order to optimize the Izhikevich model parameters, the genetic algorithm is used. Results: In the present study, the possible firing patterns of the real single neurons of the HIP and BLA are identified. Additionally, improvement of the Izhikevich model is achieved. As a result , the real neuronal spiking pattern of these regions neurons , and the corresponding cases of the Izhikevich neuron spiking pattern are adjusted with great accuracy. Conclusion: This study is conducted to elevate our knowledge of neural interactions in different structures of the brain and accelerate the quality of future large scale neural networks simulations, as well as reducing the modeling complexity. This aim is achievable by performing the improved Izhikevich model, and inserting only the plausible firing patterns and eliminating unrealistic ones , as the results of this study .", "after_revision": "Introduction- Identifying the potential firing patterns following different brain regions under normal and abnormal conditions increases our understanding of events at the level of neural interactions in the brain. The Izhikevich model is one of the simplest biologically plausible models , i.e. capable of capturing the most recognized firing patterns of neurons. This property makes the model efficient in simulating the large-scale networks of neurons. Improving the Izhikevich model for adapting to the neuronal activity of the rat brain with great accuracy would make the model effective for future neural network implementations. Methods- Data sampling from two brain regions, the HIP and BLA, was performed by the extracellular recordings of male rats, and spike sorting was conducted by Plexon offline sorter. Further analyses were performed through NeuroExplorer and MATLAB . To optimize the Izhikevich model parameters, a genetic algorithm was used. The process of comparison in each iteration leads to the survival of better populations until achieving the optimum solution. Results- In the present study, the possible firing patterns of the real single neurons of the HIP and BLA were identified. Additionally, an improved Izhikevich model was achieved. Accordingly , the real neuronal spiking pattern of these regions neurons and the corresponding cases of the Izhikevich neuron spiking pattern were adjusted with great accuracy. Conclusion- This study was conducted to elevate our knowledge of neural interactions in different structures of the brain and accelerate the quality of future large-scale neural network simulations, as well as reducing the modeling complexity. This aim was achievable by performing the improved Izhikevich model, and inserting only the plausible firing patterns , and eliminating unrealistic ones .", "edit_actions": [{"type": "R", "before": "Introduction:", "after": "Introduction-", "start_char_pos": 0, "end_char_pos": 13}, {"type": "D", "before": "by", "after": null, "start_char_pos": 66, "end_char_pos": 68}, {"type": "R", "before": "what is happening in", "after": "events at", "start_char_pos": 161, "end_char_pos": 181}, {"type": "D", "before": "On the other hand, it is important to be capable of modeling the potential neural activities, in order to build precise artificial neural networks.", "after": null, "start_char_pos": 229, "end_char_pos": 376}, {"type": "R", "before": "simple", "after": "simplest", "start_char_pos": 412, "end_char_pos": 418}, {"type": "R", "before": "that is", "after": ", i.e.", "start_char_pos": 449, "end_char_pos": 456}, {"type": "R", "before": "known", "after": "recognized", "start_char_pos": 487, "end_char_pos": 492}, {"type": "A", "before": null, "after": "the", "start_char_pos": 575, "end_char_pos": 575}, {"type": "R", "before": "with", "after": "to", "start_char_pos": 653, "end_char_pos": 657}, {"type": "A", "before": null, "after": "the", "start_char_pos": 683, "end_char_pos": 683}, {"type": "R", "before": "Methods:", "after": "Methods-", "start_char_pos": 788, "end_char_pos": 796}, {"type": "R", "before": "is performed by", "after": "was performed by the", "start_char_pos": 852, "end_char_pos": 867}, {"type": "R", "before": "Wistar rats", "after": "rats,", "start_char_pos": 901, "end_char_pos": 912}, {"type": "R", "before": "is done using", "after": "was conducted by", "start_char_pos": 931, "end_char_pos": 944}, {"type": "R", "before": "data analyses are done", "after": "analyses were performed", "start_char_pos": 976, "end_char_pos": 998}, {"type": "R", "before": "software. In order to", "after": ". To", "start_char_pos": 1032, "end_char_pos": 1053}, {"type": "R", "before": "the genetic algorithm is used. Results:", "after": "a genetic algorithm was used. The process of comparison in each iteration leads to the survival of better populations until achieving the optimum solution. Results-", "start_char_pos": 1096, "end_char_pos": 1135}, {"type": "R", "before": "are", "after": "were", "start_char_pos": 1233, "end_char_pos": 1236}, {"type": "R", "before": "improvement of the Izhikevich model is achieved. As a result", "after": "an improved Izhikevich model was achieved. Accordingly", "start_char_pos": 1263, "end_char_pos": 1323}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1385, "end_char_pos": 1386}, {"type": "R", "before": "are", "after": "were", "start_char_pos": 1456, "end_char_pos": 1459}, {"type": "R", "before": "Conclusion: This study is", "after": "Conclusion- This study was", "start_char_pos": 1490, "end_char_pos": 1515}, {"type": "R", "before": "large scale neural networks", "after": "large-scale neural network", "start_char_pos": 1648, "end_char_pos": 1675}, {"type": "R", "before": "is", "after": "was", "start_char_pos": 1743, "end_char_pos": 1745}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1851, "end_char_pos": 1851}, {"type": "D", "before": ", as the results of this study", "after": null, "start_char_pos": 1885, "end_char_pos": 1915}], "sents_char_pos": [0, 228, 376, 520, 608, 787, 967, 1041, 1126, 1248, 1311, 1489, 1733]} {"doc_id": "1910.12725", "revision_depth": "1", "before_revision": "An individual's reaction time data to visual stimuli have usually been represented in Experimental Psychology by means of an ex-Gaussian function (EGF). In most previous works, researchers have mainly aimed at finding a meaning for the three parameters of the EGF in relation to psychological phenomena. We will focus on interpreting the reaction times ( RT ) of a group of individuals rather than a single person's RT which is relevant for the different contexts of social sciences. In doing so, the same model as for the Ideal Gases (IG) emerges from the experimental reaction time data. We show that the law governing the experimental RT of a group of individuals is the same as the law governing the dynamics of an inanimate system , namely, a system of non-interacting particles (IG) . Both systems are characterized by a collective parameter which is k_BT for the system of particles and what we have called life span parameter for the system of brains. The dynamics of both systems is driven by the interaction with their respective thermostats, which are characterized by a temperature in the system of particles and by a thermostat-like entity, that we have called time driver for the group of individuals. Similarly, we come across a Maxwell-Boltzmann-type distribution for the system of brains which provides a more complete characterization of the collective time response than has ever been provided before. Another step taken is that now we are able to know about the behavior of a single individual in relation to the coetaneous group to which they belong and through the application of a physical law. This leads to a new entropy-based methodology for the classification of the individuals forming the system which emerges from the physical law governing the system of brains. To our knowledge, this is the first work reporting on the emergence of a physical theory (IG) from human RT experimental data.", "after_revision": "An individual's reaction time data to visual stimuli have usually been represented in Experimental Psychology by means of an ex-Gaussian function (EGF). In most previous works, researchers have mainly aimed at finding a meaning for the parameters of the EGF function in relation to psychological phenomena. We will focus on interpreting the reaction times ( RTs ) of a group of individuals rather than a single person's RT , which is relevant for the different contexts of social sciences. In doing so, the same model as for the Ideal Gases (IG) ( an inanimate system of non-interacting particles ) emerges from the experimental RT data . Both systems are characterised by a collective parameter which is k_BT in the case of the system of particles and what we have called life span parameter for the system of brains. Similarly, we came across a Maxwell-Boltzmann-type distribution for the system of brains which provides a natural and more complete characterisation of the collective time response than has ever been provided before. Thus, we are able to know about the behaviour of a single individual in relation to the coetaneous group to which they belong and through the application of a physical law. This leads to a new entropy-based methodology for the classification of the individuals forming the system which emerges from the physical law governing the system of brains. To the best of our knowledge, this is the first work in the literature reporting on the emergence of a physical theory (IG) from human RT experimental data.", "edit_actions": [{"type": "D", "before": "three", "after": null, "start_char_pos": 236, "end_char_pos": 241}, {"type": "A", "before": null, "after": "function", "start_char_pos": 264, "end_char_pos": 264}, {"type": "R", "before": "RT", "after": "RTs", "start_char_pos": 356, "end_char_pos": 358}, {"type": "A", "before": null, "after": ",", "start_char_pos": 420, "end_char_pos": 420}, {"type": "R", "before": "emerges from the experimental reaction time data. We show that the law governing the experimental RT of a group of individuals is the same as the law governing the dynamics of", "after": "(", "start_char_pos": 542, "end_char_pos": 717}, {"type": "D", "before": ", namely, a system", "after": null, "start_char_pos": 738, "end_char_pos": 756}, {"type": "R", "before": "(IG)", "after": ") emerges from the experimental RT data", "start_char_pos": 786, "end_char_pos": 790}, {"type": "R", "before": "characterized", "after": "characterised", "start_char_pos": 810, "end_char_pos": 823}, {"type": "R", "before": "for the", "after": "in the case of the", "start_char_pos": 864, "end_char_pos": 871}, {"type": "D", "before": "The dynamics of both systems is driven by the interaction with their respective thermostats, which are characterized by a temperature in the system of particles and by a thermostat-like entity, that we have called time driver for the group of individuals.", "after": null, "start_char_pos": 962, "end_char_pos": 1217}, {"type": "R", "before": "come", "after": "came", "start_char_pos": 1232, "end_char_pos": 1236}, {"type": "R", "before": "more complete characterization", "after": "natural and more complete characterisation", "start_char_pos": 1324, "end_char_pos": 1354}, {"type": "R", "before": "Another step taken is that now", "after": "Thus,", "start_char_pos": 1423, "end_char_pos": 1453}, {"type": "R", "before": "behavior", "after": "behaviour", "start_char_pos": 1484, "end_char_pos": 1492}, {"type": "A", "before": null, "after": "the best of", "start_char_pos": 1798, "end_char_pos": 1798}, {"type": "A", "before": null, "after": "in the literature", "start_char_pos": 1837, "end_char_pos": 1837}], "sents_char_pos": [0, 152, 304, 485, 591, 961, 1217, 1422, 1619, 1794]} {"doc_id": "1910.14459", "revision_depth": "1", "before_revision": "Convex bodies play a fundamental role in geometric computation, and approximating such bodies is often a key ingredient in the design of efficient algorithms. We consider the question of how to succinctly approximate a multidimensional convex body by a polytope. We are given a convex body K of unit diameter in Euclidean d-dimensional space (where d is a constant) along with an error parameter \\varepsilon > 0. The objective is to determine a polytope of low combinatorial complexity whose Hausdorff distance from K is at most \\varepsilon. By combinatorial complexity we mean the total number of faces of all dimensions of the polytope. In the mid-1970's, a result by Dudley showed that O(1/\\varepsilon^{(d-1)/2}) facets suffice, and Bronshteyn and Ivanov presented a similar bound on the number of vertices . While both results match known worst-case lower bounds , obtaining a similar upper bound on the total combinatorial complexity has been open for over 40 years. Recently, we made a first step forward towards this objective, obtaining a suboptimal bound. In this paper, we settle this problem with an asymptotically optimal bound of O(1/\\varepsilon^{(d-1)/2}) . Our result is based on a new relationship between \\varepsilon-width caps of a convex body and its polar . Using this relationship, we are able to obtain a volume-sensitive bound on the number of approximating caps that are \"essentially different.\" We achieve our result by combining this with a variant of the witness-collector method and a novel variable-width layered construction .", "after_revision": "This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body K of unit diameter in Euclidean d-dimensional space (where d is a constant) and an error parameter \\varepsilon > 0, the objective is to determine a convex polytope of low combinatorial complexity whose Hausdorff distance from K is at most \\varepsilon. By combinatorial complexity we mean the total number of faces of all dimensions . Classical constructions by Dudley and Bronshteyn/Ivanov show that O(1/\\varepsilon^{(d-1)/2}) facets or vertices are possible, respectively, but neither achieves both bounds simultaneously. In this paper, we show that it is possible to construct a polytope with O(1/\\varepsilon^{(d-1)/2}) combinatorial complexity, which is optimal in the worst case . Our result is based on a new relationship between \\varepsilon-width caps of a convex body and its polar body . Using this relationship, we are able to obtain a volume-sensitive bound on the number of approximating caps that are \"essentially different.\" We achieve our main result by combining this with a variant of the witness-collector method and a novel variable-thickness layered construction of the economical cap covering .", "edit_actions": [{"type": "R", "before": "Convex bodies play a fundamental role in geometric computation, and approximating such bodies is often a key ingredient in the design of efficient algorithms. We consider the", "after": "This paper considers the", "start_char_pos": 0, "end_char_pos": 174}, {"type": "R", "before": "We are given", "after": "Given", "start_char_pos": 263, "end_char_pos": 275}, {"type": "R", "before": "along with", "after": "and", "start_char_pos": 366, "end_char_pos": 376}, {"type": "R", "before": "0. The", "after": "0, the", "start_char_pos": 410, "end_char_pos": 416}, {"type": "A", "before": null, "after": "convex", "start_char_pos": 445, "end_char_pos": 445}, {"type": "R", "before": "combinatorial complexity", "after": "combinatorial complexity", "start_char_pos": 546, "end_char_pos": 570}, {"type": "R", "before": "of the polytope. In the mid-1970's, a result by Dudley showed", "after": ". Classical constructions by Dudley and Bronshteyn/Ivanov show", "start_char_pos": 623, "end_char_pos": 684}, {"type": "R", "before": "suffice, and Bronshteyn and Ivanov presented a similar bound on the number of vertices . While both results match known worst-case lower bounds , obtaining a similar upper bound on the total combinatorial complexity has been open for over 40 years. Recently, we made a first step forward towards this objective, obtaining a suboptimal bound.", "after": "or vertices are possible, respectively, but neither achieves both bounds simultaneously.", "start_char_pos": 724, "end_char_pos": 1065}, {"type": "R", "before": "settle this problem with an asymptotically optimal bound of", "after": "show that it is possible to construct a polytope with", "start_char_pos": 1084, "end_char_pos": 1143}, {"type": "A", "before": null, "after": "combinatorial complexity, which is optimal in the worst case", "start_char_pos": 1171, "end_char_pos": 1171}, {"type": "A", "before": null, "after": "body", "start_char_pos": 1278, "end_char_pos": 1278}, {"type": "A", "before": null, "after": "main", "start_char_pos": 1438, "end_char_pos": 1438}, {"type": "R", "before": "variable-width layered construction", "after": "variable-thickness layered construction of the economical cap covering", "start_char_pos": 1523, "end_char_pos": 1558}], "sents_char_pos": [0, 158, 262, 412, 542, 639, 812, 972, 1065, 1422]} {"doc_id": "1911.00571", "revision_depth": "1", "before_revision": "Shape decomposition is a fundamental problem in geometry processing where an arbitrary object is regarded as an arrangement of simple primitives or semantic components. The application of 3D shape decomposition in the context of image segmentation, however, is not well-studied. In this paper, we develop a shape decomposition algorithm called cylindrical shape decomposition (CSD) to be applied for the segmentation of tubular structures in large-scale 3D images. CSD starts by partitioning the curve skeleton of a tubular object into maximal-length sub-skeletons , minimizing an orientation objective. Each sub-skeleton corresponds to a semantic component. To determine boundaries between the semantic components, CSD searches for critical points where the object cross-section substantially changes . CSD then cuts the object at critical points and assigns the same label to those object parts which are along the same sub-skeleton, defining a semantic tubular component. CSD further rectify/reconstructs these semantic components using generalized cylinders. We demonstrate the application of CSD in the segmentation of large-scale 3D electron microscopy image datasets of myelinated axons, the decomposition of vascular networks, and synthetic objects. We also compare CSD to other state-of-the-art decomposition techniques in these applications . These experiments indicate that CSD outperforms other decomposition techniques and achieves a promising performance .", "after_revision": "We develop a cylindrical shape decomposition (CSD) algorithm to decompose an object, which is a union of several tubular structures, into its semantic components. We decompose the object using its curve skeleton and translational sweeps. For that, CSD partitions the curve skeleton into maximal-length sub-skeletons over an orientation function, each sub-skeleton corresponds to a semantic component. To find the intersection of the tubular components, CSD translationally sweeps the object in decomposition intervals to identify critical points at which the shape of the object changes substantially. CSD cuts the object at critical points and assigns the same label to parts along the same sub-skeleton, thereby constructing a semantic component. CSD further reconstructs the semantic components between parts using generalized cylinders. We apply CSD for the segmentation of axons in large 3D electron microscopy images, and the decomposition of vascular networks, as well as synthetic objects. We show that CSD outperforms state-of-the-art decomposition techniques in these applications .", "edit_actions": [{"type": "R", "before": "Shape decomposition is a fundamental problem in geometry processing where an arbitrary object is regarded as an arrangement of simple primitives or semantic components. The application of 3D shape decomposition in the context of image segmentation, however, is not well-studied. In this paper, we develop a shape decomposition algorithm called", "after": "We develop a", "start_char_pos": 0, "end_char_pos": 343}, {"type": "R", "before": "to be applied for the segmentation of tubular structures in large-scale 3D images. CSD starts by partitioning", "after": "algorithm to decompose an object, which is a union of several tubular structures, into its semantic components. We decompose the object using its curve skeleton and translational sweeps. For that, CSD partitions", "start_char_pos": 382, "end_char_pos": 491}, {"type": "D", "before": "of a tubular object", "after": null, "start_char_pos": 511, "end_char_pos": 530}, {"type": "R", "before": ", minimizing an orientation objective. Each", "after": "over an orientation function, each", "start_char_pos": 565, "end_char_pos": 608}, {"type": "R", "before": "determine boundaries between the semantic", "after": "find the intersection of the tubular", "start_char_pos": 662, "end_char_pos": 703}, {"type": "R", "before": "searches for critical points where the object cross-section substantially changes . CSD then", "after": "translationally sweeps the object in decomposition intervals to identify critical points at which the shape of the object changes substantially. CSD", "start_char_pos": 720, "end_char_pos": 812}, {"type": "R", "before": "those object parts which are", "after": "parts", "start_char_pos": 878, "end_char_pos": 906}, {"type": "R", "before": "defining a semantic tubular", "after": "thereby constructing a semantic", "start_char_pos": 936, "end_char_pos": 963}, {"type": "R", "before": "rectify/reconstructs these semantic components", "after": "reconstructs the semantic components between parts", "start_char_pos": 987, "end_char_pos": 1033}, {"type": "R", "before": "demonstrate the application of CSD in", "after": "apply CSD for", "start_char_pos": 1066, "end_char_pos": 1103}, {"type": "R", "before": "large-scale", "after": "axons in large", "start_char_pos": 1124, "end_char_pos": 1135}, {"type": "R", "before": "image datasets of myelinated axons,", "after": "images, and", "start_char_pos": 1159, "end_char_pos": 1194}, {"type": "R", "before": "and", "after": "as well as", "start_char_pos": 1235, "end_char_pos": 1238}, {"type": "R", "before": "also compare CSD to other", "after": "show that CSD outperforms", "start_char_pos": 1261, "end_char_pos": 1286}, {"type": "D", "before": ". These experiments indicate that CSD outperforms other decomposition techniques and achieves a promising performance", "after": null, "start_char_pos": 1351, "end_char_pos": 1468}], "sents_char_pos": [0, 168, 278, 464, 603, 658, 974, 1062, 1257, 1352]} {"doc_id": "1911.03445", "revision_depth": "1", "before_revision": "We revisit the scaling analysis and commonly accepted conditions for the validity of the standard, reverse and total quasi-steady-state approximations (sQSSA, rQSSA and tQSSA) through the lens of dimensional Tikhonov--Fenichel small parameters and their respective critical manifolds. By combining Tikhonov--Fenichel small parameter with scaling analysis , we derive improved upper bounds on the error for the sQSSA, rQSSA and tQSSA. We find that the condition for the validity of the rQSSA is far less restrictive than was previously assumed, and we derive a new small parameter that determines the validity of this approximation. Moreover, we show for the first time that the critical manifold of the rQSSA contains a singular point where normal hyperbolicity is lost. Associated with this singularity is a transcritical bifurcation, and the corresponding normal form of this bifurcation is recovered through scaling analysis. It is commonly accepted that the rQSSA is only valid in regions of parameter space where the influence of the singular point can be ignored. However, by using the method of slowly-varying Lyapunov functions, we provide asymptotic estimates for the validity of the rQSSA in parameter regions where the effect of the singular point cannot be disregarded. In doing so, we extend the established domain of validity for the rQSSA. Previous analysis has suggested that the rQSSA is only valid when initial enzyme concentrations greatly exceed initial substrate concentrations. However, our results indicate that this approximationcan be valid when initial enzyme and substrate concentrations are of equal magnitude . Consequently, this opens the possibility of utilizing the rQSSA to model enzyme catalyzed reactions and estimate kinetic parameters in enzymatic assays at much lower enzyme to substrate ratios than was previously thought .", "after_revision": "In this work, we revisit the scaling analysis and commonly accepted conditions for the validity of the standard, reverse and total quasi-steady-state approximations through the lens of dimensional Tikhonov-Fenichel parameters and their respective critical manifolds. By combining Tikhonov-Fenichel parameters with scaling analysis and energy methods , we derive improved upper bounds on the approximation error for the standard, reverse and total quasi-steady-state approximations. Furthermore, previous analyses suggest that the reverse quasi-steady-state approximation is only valid when initial enzyme concentrations greatly exceed initial substrate concentrations. However, our results indicate that this approximation can be valid when initial enzyme and substrate concentrations are of equal magnitude. Using energy methods, we find that the condition for the validity of the reverse quasi-steady-state approximation is far less restrictive than was previously assumed, and we derive a new \"small\" parameter that determines the validity of this approximation. In doing so, we extend the established domain of validity for the reverse quasi-steady-state approximation . Consequently, this opens up the possibility of utilizing the reverse quasi-steady-state approximation to model enzyme catalyzed reactions and estimate kinetic parameters in enzymatic assays at much lower enzyme to substrate ratios than was previously thought . Moreover, we show for the first time that the critical manifold of the reverse quasi-steady-state approximation contains a singular point where normal hyperbolicity is lost. Associated with this singularity is a transcritical bifurcation, and the corresponding normal form of this bifurcation is recovered through scaling analysis .", "edit_actions": [{"type": "R", "before": "We", "after": "In this work, we", "start_char_pos": 0, "end_char_pos": 2}, {"type": "D", "before": "(sQSSA, rQSSA and tQSSA)", "after": null, "start_char_pos": 151, "end_char_pos": 175}, {"type": "R", "before": "Tikhonov--Fenichel small", "after": "Tikhonov-Fenichel", "start_char_pos": 208, "end_char_pos": 232}, {"type": "R", "before": "Tikhonov--Fenichel small parameter", "after": "Tikhonov-Fenichel parameters", "start_char_pos": 298, "end_char_pos": 332}, {"type": "A", "before": null, "after": "and energy methods", "start_char_pos": 355, "end_char_pos": 355}, {"type": "A", "before": null, "after": "approximation", "start_char_pos": 397, "end_char_pos": 397}, {"type": "R", "before": "sQSSA, rQSSA and tQSSA. We", "after": "standard, reverse and total quasi-steady-state approximations. Furthermore, previous analyses suggest that the reverse quasi-steady-state approximation is only valid when initial enzyme concentrations greatly exceed initial substrate concentrations. However, our results indicate that this approximation can be valid when initial enzyme and substrate concentrations are of equal magnitude. Using energy methods, we", "start_char_pos": 412, "end_char_pos": 438}, {"type": "R", "before": "rQSSA", "after": "reverse quasi-steady-state approximation", "start_char_pos": 487, "end_char_pos": 492}, {"type": "R", "before": "small", "after": "\"small\"", "start_char_pos": 566, "end_char_pos": 571}, {"type": "D", "before": "Moreover, we show for the first time that the critical manifold of the rQSSA contains a singular point where normal hyperbolicity is lost. Associated with this singularity is a transcritical bifurcation, and the corresponding normal form of this bifurcation is recovered through scaling analysis. It is commonly accepted that the rQSSA is only valid in regions of parameter space where the influence of the singular point can be ignored. However, by using the method of slowly-varying Lyapunov functions, we provide asymptotic estimates for the validity of the rQSSA in parameter regions where the effect of the singular point cannot be disregarded.", "after": null, "start_char_pos": 634, "end_char_pos": 1283}, {"type": "R", "before": "rQSSA. Previous analysis has suggested that the rQSSA is only valid when initial enzyme concentrations greatly exceed initial substrate concentrations. However, our results indicate that this approximationcan be valid when initial enzyme and substrate concentrations are of equal magnitude", "after": "reverse quasi-steady-state approximation", "start_char_pos": 1350, "end_char_pos": 1639}, {"type": "A", "before": null, "after": "up", "start_char_pos": 1667, "end_char_pos": 1667}, {"type": "R", "before": "rQSSA", "after": "reverse quasi-steady-state approximation", "start_char_pos": 1701, "end_char_pos": 1706}, {"type": "A", "before": null, "after": ". Moreover, we show for the first time that the critical manifold of the reverse quasi-steady-state approximation contains a singular point where normal hyperbolicity is lost. Associated with this singularity is a transcritical bifurcation, and the corresponding normal form of this bifurcation is recovered through scaling analysis", "start_char_pos": 1864, "end_char_pos": 1864}], "sents_char_pos": [0, 284, 435, 633, 772, 930, 1071, 1283, 1501]} {"doc_id": "1911.04489", "revision_depth": "1", "before_revision": "LSTMs promise much to financial time-series analysis, temporal and cross-sectional inference, but we find they do not deliver in a real-world financial management task. We examine an alternative called Continual Learning (CL), a memory-augmented approach, which can provide transparent explanations ; which memory did what and when. This work has implications for many financial applications including to credit, time-varying fairness in decision making and more. We make three important new observations. Firstly, as well as being more explainable, time-series CL approaches outperform LSTM and a simple sliding window learner ( feed-forward neural net (FFNN) ) . Secondly, we show that CL based on a sliding window learner (FFNN) is more effective than CL based on a sequential learner (LSTM). Thirdly, we examine how real-world, time-series noise impacts several similarity approaches used in CL memory addressing. We provide these insights using an approach called Continual Learning Augmentation (CLA) tested on a complex real world problem; emerging market equities investment decision making. CLA provides a test-bed as it can be based on different types of time-series learner , allowing testing of LSTM and sliding window (FFNN ) learners side by side. CLA is also used to test several distance approaches used in a memory recall-gate: euclidean distance (ED), dynamic time warping (DTW), auto-encoder (AE) and a novel hybrid approach, warp-AE. We find CLA out-performs simple LSTM and FFNN learners and CLA based on a sliding window (CLA-FFNN) out-performs a LSTM (CLA-LSTM) implementation. While for memory-addressing, ED under-performs DTW and AE but warp-AE shows the best overall performance in a real-world financial task.", "after_revision": "LSTMs promise much to financial time-series analysis, temporal and cross-sectional inference, but we find that they do not deliver in a real-world financial management task. We examine an alternative called Continual Learning (CL), a memory-augmented approach, which can provide transparent explanations , i.e. which memory did what and when. This work has implications for many financial applications including credit, time-varying fairness in decision making and more. We make three important new observations. Firstly, as well as being more explainable, time-series CL approaches outperform LSTMs as well as a simple sliding window learner using feed-forward neural networks (FFNN) . Secondly, we show that CL based on a sliding window learner (FFNN) is more effective than CL based on a sequential learner (LSTM). Thirdly, we examine how real-world, time-series noise impacts several similarity approaches used in CL memory addressing. We provide these insights using an approach called Continual Learning Augmentation (CLA) tested on a complex real-world problem, emerging market equities investment decision making. CLA provides a test-bed as it can be based on different types of time-series learners , allowing testing of LSTM and FFNN learners side by side. CLA is also used to test several distance approaches used in a memory recall-gate: Euclidean distance (ED), dynamic time warping (DTW), auto-encoders (AE) and a novel hybrid approach, warp-AE. We find that ED under-performs DTW and AE but warp-AE shows the best overall performance in a real-world financial task.", "edit_actions": [{"type": "A", "before": null, "after": "that", "start_char_pos": 106, "end_char_pos": 106}, {"type": "R", "before": ";", "after": ", i.e.", "start_char_pos": 300, "end_char_pos": 301}, {"type": "D", "before": "to", "after": null, "start_char_pos": 403, "end_char_pos": 405}, {"type": "R", "before": "LSTM and", "after": "LSTMs as well as", "start_char_pos": 588, "end_char_pos": 596}, {"type": "R", "before": "(", "after": "using", "start_char_pos": 629, "end_char_pos": 630}, {"type": "R", "before": "net", "after": "networks", "start_char_pos": 651, "end_char_pos": 654}, {"type": "D", "before": ")", "after": null, "start_char_pos": 662, "end_char_pos": 663}, {"type": "R", "before": "real world problem;", "after": "real-world problem,", "start_char_pos": 1028, "end_char_pos": 1047}, {"type": "R", "before": "learner", "after": "learners", "start_char_pos": 1178, "end_char_pos": 1185}, {"type": "R", "before": "sliding window (FFNN )", "after": "FFNN", "start_char_pos": 1217, "end_char_pos": 1239}, {"type": "R", "before": "euclidean", "after": "Euclidean", "start_char_pos": 1346, "end_char_pos": 1355}, {"type": "R", "before": "auto-encoder", "after": "auto-encoders", "start_char_pos": 1399, "end_char_pos": 1411}, {"type": "R", "before": "CLA out-performs simple LSTM and FFNN learners and CLA based on a sliding window (CLA-FFNN) out-performs a LSTM (CLA-LSTM) implementation. While for memory-addressing,", "after": "that", "start_char_pos": 1463, "end_char_pos": 1630}], "sents_char_pos": [0, 169, 301, 333, 464, 506, 796, 918, 1047, 1100, 1262, 1454, 1601]} {"doc_id": "1911.07166", "revision_depth": "1", "before_revision": "Consider a curve \\Gamma in a domain D in the plane \\boldsymbol ^2. Thinking of D as a piece of paper, one can make a curved folding in the Euclidean space \\boldsymbol ^3. This can be expressed as the image of an `origami map' \\varphi :D\\to \\boldsymbol ^3 such that \\Gamma is the singular set of \\varphi , the word `origami' coming from the Japanese term for paper folding. We call the singular set image C:= \\varphi (\\Gamma) the crease of \\varphi and the singular set \\Gamma the crease pattern of \\varphi . We are interested in the number of origami maps whose creases and crease patterns are C and \\Gamma respectively. Two such possibilities have been known. In the previous authors' work, two other new possibilities and an explicit example with four such non-congruent distinct curved foldings were established. In this paper, we show that the case of four mutually non-congruent curved foldings with the same crease and crease pattern occurs if and only if \\Gamma and C do not admit any symmetries. Moreover , when C is a closed curve, we show that there are infinitely many distinct possibilities for curved foldings with the same crease and crease pattern, in general.", "after_revision": "Consider an oriented curve \\Gamma in a domain D in the plane \\boldsymbol R ^2. Thinking of D as a piece of paper, one can make a curved folding in the Euclidean space \\boldsymbol R ^3. This can be expressed as the image of an \"origami map\" \\Phi :D\\to \\boldsymbol R ^3 such that \\Gamma is the singular set of \\Phi , the word \"origami\" coming from the Japanese term for paper folding. We call the singular set image C:= \\Phi (\\Gamma) the crease of \\Phi and the singular set \\Gamma the crease pattern of \\Phi . We are interested in the number of origami maps whose creases and crease patterns are C and \\Gamma , respectively. Two such possibilities have been known. In the authors' previous work, two other new possibilities and an explicit example with four such non-congruent distinct curved foldings were established. In this paper, we determine the possibility of the number N of congruence classes of curved foldings with the same crease and crease pattern . As a consequence, if C is a non-closed simple arc, then N=4 if and only if both \\Gamma and C do not admit any symmetries. On the other hand , when C is a closed curve, there are infinitely many distinct possibilities for curved foldings with the same crease and crease pattern, in general.", "edit_actions": [{"type": "R", "before": "a", "after": "an oriented", "start_char_pos": 9, "end_char_pos": 10}, {"type": "A", "before": null, "after": "R", "start_char_pos": 63, "end_char_pos": 63}, {"type": "A", "before": null, "after": "R", "start_char_pos": 168, "end_char_pos": 168}, {"type": "R", "before": "`origami map' \\varphi", "after": "\"origami map\" \\Phi", "start_char_pos": 214, "end_char_pos": 235}, {"type": "A", "before": null, "after": "R", "start_char_pos": 254, "end_char_pos": 254}, {"type": "R", "before": "\\varphi", "after": "\\Phi", "start_char_pos": 298, "end_char_pos": 305}, {"type": "R", "before": "`origami'", "after": "\"origami\"", "start_char_pos": 317, "end_char_pos": 326}, {"type": "R", "before": "\\varphi", "after": "\\Phi", "start_char_pos": 411, "end_char_pos": 418}, {"type": "R", "before": "\\varphi", "after": "\\Phi", "start_char_pos": 442, "end_char_pos": 449}, {"type": "R", "before": "\\varphi", "after": "\\Phi", "start_char_pos": 500, "end_char_pos": 507}, {"type": "A", "before": null, "after": ",", "start_char_pos": 609, "end_char_pos": 609}, {"type": "R", "before": "previous authors'", "after": "authors' previous", "start_char_pos": 671, "end_char_pos": 688}, {"type": "R", "before": "show that the case of four mutually non-congruent", "after": "determine the possibility of the number N of congruence classes of", "start_char_pos": 837, "end_char_pos": 886}, {"type": "R", "before": "occurs if", "after": ". As a consequence, if C is a non-closed simple arc, then N=4 if", "start_char_pos": 943, "end_char_pos": 952}, {"type": "A", "before": null, "after": "both", "start_char_pos": 965, "end_char_pos": 965}, {"type": "R", "before": "Moreover", "after": "On the other hand", "start_char_pos": 1008, "end_char_pos": 1016}, {"type": "D", "before": "we show that", "after": null, "start_char_pos": 1045, "end_char_pos": 1057}], "sents_char_pos": [0, 67, 172, 375, 509, 623, 663, 818, 1007]} {"doc_id": "1911.08241", "revision_depth": "1", "before_revision": "Statistical modeling techniques, such as projection pursuit regression (PPR) and convolutional neural network (CNN)approaches, provide state-of-the-art performance in characterizing visual cortical neurons' receptive fields and predicting their responses to arbitrary input stimuli. However, the latent feature components recovered by these methods, particularly that of CNN , are often noisy and lack coherent structures , making it difficult to understand the underlying feature components that are used to construct the receptive fieldfeature tunings of the neurons . In this paper, we showed that using a dictionary of complex sparse codes, learned from natural scenes based on efficient coding theory, as the front-end for these methods can improve their performance in neural response prediction. At the same time , this approach makes the component features of the models more transparent and interpretable. We consider using these learned dictionaries as the front-end that can effectively imposing priors on the constituent components. We found that models with complex sparse code prior are significantly better than models with classical Gabor and/or Laplacian of Gaussian filter priors for modeling and predicting the activities of neurons that have been earlier identified to exhibit higher-order (HO) complex pattern selectivity but not better for modeling neurons that preferred orientation bars or grating (OT) . This observation affirms the recent discovery of complex feature selectivity of V1 neurons and also supports the predictions of efficient coding theory under over-complete conditions .", "after_revision": "System identification techniques---projection pursuit regression models (PPR) and convolutional neural networks (CNNs)---provide state-of-the-art performance in predicting visual cortical neurons' responses to arbitrary input stimuli. However, the constituent kernels recovered by these methods, particularly those of CNNs , are often noisy and lack coherent structure , making it difficult to understand the underlying component features of a neuron's receptive field . In this paper, we show that using a dictionary of complex sparse codes, which are learned from natural scenes based on efficient coding theory, as the front-end for PPR and CNNs can improve their performance in neuronal response prediction. More importantly , this approach makes the constituent kernels of these models substantially more coherent and interpretable. Extensive experimental results also indicate that these interpretable kernels provide important information on the component features of a neuron's receptive field. In addition, we find that models with a complex sparse code front-end are significantly better than models with a standard orientation-selective Gabor filter front-end for modeling V1 neurons that have been found to exhibit complex pattern selectivity . This observation adds further credence to the sparse coding theory as well as empirical findings of complex feature selectivity in V1 .", "edit_actions": [{"type": "R", "before": "Statistical modeling techniques, such as projection pursuit regression", "after": "System identification techniques---projection pursuit regression models", "start_char_pos": 0, "end_char_pos": 70}, {"type": "R", "before": "network (CNN)approaches, provide", "after": "networks (CNNs)---provide", "start_char_pos": 102, "end_char_pos": 134}, {"type": "R", "before": "characterizing", "after": "predicting", "start_char_pos": 167, "end_char_pos": 181}, {"type": "D", "before": "receptive fields and predicting their", "after": null, "start_char_pos": 207, "end_char_pos": 244}, {"type": "R", "before": "latent feature components", "after": "constituent kernels", "start_char_pos": 296, "end_char_pos": 321}, {"type": "R", "before": "that of CNN", "after": "those of CNNs", "start_char_pos": 363, "end_char_pos": 374}, {"type": "R", "before": "structures", "after": "structure", "start_char_pos": 411, "end_char_pos": 421}, {"type": "R", "before": "feature components that are used to construct the receptive fieldfeature tunings of the neurons", "after": "component features of a neuron's receptive field", "start_char_pos": 473, "end_char_pos": 568}, {"type": "R", "before": "showed", "after": "show", "start_char_pos": 589, "end_char_pos": 595}, {"type": "A", "before": null, "after": "which are", "start_char_pos": 645, "end_char_pos": 645}, {"type": "R", "before": "these methods", "after": "PPR and CNNs", "start_char_pos": 729, "end_char_pos": 742}, {"type": "R", "before": "neural", "after": "neuronal", "start_char_pos": 776, "end_char_pos": 782}, {"type": "R", "before": "At the same time", "after": "More importantly", "start_char_pos": 804, "end_char_pos": 820}, {"type": "R", "before": "component features of the models more transparent", "after": "constituent kernels of these models substantially more coherent", "start_char_pos": 847, "end_char_pos": 896}, {"type": "R", "before": "We consider using these learned dictionaries as the front-end that can effectively imposing priors on the constituent components. We found", "after": "Extensive experimental results also indicate that these interpretable kernels provide important information on the component features of a neuron's receptive field. In addition, we find", "start_char_pos": 916, "end_char_pos": 1054}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1072, "end_char_pos": 1072}, {"type": "R", "before": "prior", "after": "front-end", "start_char_pos": 1093, "end_char_pos": 1098}, {"type": "R", "before": "classical Gabor and/or Laplacian of Gaussian filter priors for modeling and predicting the activities of", "after": "a standard orientation-selective Gabor filter front-end for modeling V1", "start_char_pos": 1141, "end_char_pos": 1245}, {"type": "R", "before": "earlier identified to exhibit higher-order (HO)", "after": "found to exhibit", "start_char_pos": 1269, "end_char_pos": 1316}, {"type": "D", "before": "but not better for modeling neurons that preferred orientation bars or grating (OT)", "after": null, "start_char_pos": 1345, "end_char_pos": 1428}, {"type": "R", "before": "affirms the recent discovery", "after": "adds further credence to the sparse coding theory as well as empirical findings", "start_char_pos": 1448, "end_char_pos": 1476}, {"type": "R", "before": "of", "after": "in", "start_char_pos": 1508, "end_char_pos": 1510}, {"type": "D", "before": "neurons and also supports the predictions of efficient coding theory under over-complete conditions", "after": null, "start_char_pos": 1514, "end_char_pos": 1613}], "sents_char_pos": [0, 282, 570, 803, 915, 1045, 1430]} {"doc_id": "1911.08448", "revision_depth": "3", "before_revision": "We propose a mathematical model of momentum risk-taking, which is essentially real-time risk management , focused on short-term volatility of stock markets. Its implementation, an automated momentum equity trading system , proved to be successful in extensive historical and real-time experiments , discussed in the paper. Risk-taking is one of the key components of general decision-making, a challenge for artificial intelligence and machine learning . We begin with a relatively simple new algebraic-type theory of news impact on share-prices, which describes well their power growth, periodicity, logarithmic periodicity, and the market phenomena like price targets and profit-taking ; Bessel and hypergeometric functions are used . Its discretization results in some tables of bids, expected returns for different investment horizons. This is a new approach; its preimage is a new contract card game presented at the end, a combination of bridge and poker. The relations to random processes and fractional Brownian motion are outlined . We provide a reasonably complete description of our AI-type trading system, but our ML procedures are not discussed much (a special version of those in neural networking is used) .", "after_revision": "We propose a mathematical model of momentum risk-taking, which is essentially real-time risk management focused on short-term volatility of stock markets. Its implementation, our fully automated momentum equity trading system presented systematically , proved to be successful in extensive historical and real-time experiments . Momentum risk-taking is one of the key components of general decision-making, a challenge for artificial intelligence and machine learning with deep roots in cognitive science; its variants beyond stock markets are discussed . We begin with a new algebraic-type theory of news impact on share-prices, which describes well their power growth, periodicity, and the market phenomena like price targets and profit-taking . This theory generally requires Bessel and hypergeometric functions . Its discretization results in some tables of bids, which are basically expected returns for main investment horizons, the key in our trading system. The ML procedures we use are similar to those in neural networking. A preimage of our approach is the new contract card game provided at the end, a combination of bridge and poker. Relations to random processes and the fractional Brownian motion are outlined .", "edit_actions": [{"type": "D", "before": ",", "after": null, "start_char_pos": 104, "end_char_pos": 105}, {"type": "R", "before": "an", "after": "our fully", "start_char_pos": 177, "end_char_pos": 179}, {"type": "A", "before": null, "after": "presented systematically", "start_char_pos": 221, "end_char_pos": 221}, {"type": "R", "before": ", discussed in the paper. Risk-taking", "after": ". Momentum risk-taking", "start_char_pos": 298, "end_char_pos": 335}, {"type": "A", "before": null, "after": "with deep roots in cognitive science; its variants beyond stock markets are discussed", "start_char_pos": 454, "end_char_pos": 454}, {"type": "D", "before": "relatively simple", "after": null, "start_char_pos": 473, "end_char_pos": 490}, {"type": "D", "before": "logarithmic periodicity,", "after": null, "start_char_pos": 603, "end_char_pos": 627}, {"type": "R", "before": ";", "after": ". This theory generally requires", "start_char_pos": 690, "end_char_pos": 691}, {"type": "D", "before": "are used", "after": null, "start_char_pos": 728, "end_char_pos": 736}, {"type": "A", "before": null, "after": "which are basically", "start_char_pos": 790, "end_char_pos": 790}, {"type": "R", "before": "different investment horizons. This is a new approach; its preimage is a", "after": "main investment horizons, the key in our trading system. The ML procedures we use are similar to those in neural networking. A preimage of our approach is the", "start_char_pos": 812, "end_char_pos": 884}, {"type": "R", "before": "presented", "after": "provided", "start_char_pos": 908, "end_char_pos": 917}, {"type": "R", "before": "The relations", "after": "Relations", "start_char_pos": 965, "end_char_pos": 978}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1003, "end_char_pos": 1003}, {"type": "D", "before": ". We provide a reasonably complete description of our AI-type trading system, but our ML procedures are not discussed much (a special version of those in neural networking is used)", "after": null, "start_char_pos": 1044, "end_char_pos": 1224}], "sents_char_pos": [0, 156, 323, 456, 691, 738, 842, 866, 964, 1045]} {"doc_id": "1911.09103", "revision_depth": "1", "before_revision": "Often the development of novel materials is not amenable to high-throughput or purely computational screening methods. Instead, materials must be synthesized one at a time in a process that does not generate significant amounts of data. One way this method can be improved is by ensuring that each experiment provides the best improvement in both material properties and predictive modeling accuracy. In this work , we study the effectiveness of active learning, which optimizes the orderof experiments, and meta learning, which transfers knowledge from one context to another , to reduce the number of experiments necessary to build a predictive model. We present a novel multi-task benchmark database of peptides designed to advance active, few-shot, and meta-learning methods for experimental design. Each task is binary classification of peptides represented as a sequence string. We show results of standard active learning and meta-learning methods across these datasets to assess their ability to improve predictive models with the fewest number of experiments. We find the ensemble query by committee active learning method to be effective . The meta-learning method Reptile was found to improve accuracy. The robustness of these conclusions were tested across multiple model choices. We find that combining meta-learning with active learning methods offers inconsistent benefits.", "after_revision": "Often the development of novel functional peptides is not amenable to high throughput or purely computational screening methods. Peptides must be synthesized one at a time in a process that does not generate large amounts of data. One way this method can be improved is by ensuring that each experiment provides the best improvement in both peptide properties and predictive modeling accuracy. Here , we study the effectiveness of active learning, optimizing experiment order , and meta-learning, transferring knowledge between contexts, to reduce the number of experiments necessary to build a predictive model. We present a multi-task benchmark database of peptides designed to advance these methods for experimental design. Each task is binary classification of peptides represented as a sequence string. We find neither active learning method tested to be better than random choice . The meta-learning method Reptile was found to improve average accuracy across datasets. Combining meta-learning with active learning offers inconsistent benefits.", "edit_actions": [{"type": "R", "before": "materials", "after": "functional peptides", "start_char_pos": 31, "end_char_pos": 40}, {"type": "R", "before": "high-throughput", "after": "high throughput", "start_char_pos": 60, "end_char_pos": 75}, {"type": "R", "before": "Instead, materials", "after": "Peptides", "start_char_pos": 119, "end_char_pos": 137}, {"type": "R", "before": "significant", "after": "large", "start_char_pos": 208, "end_char_pos": 219}, {"type": "R", "before": "material", "after": "peptide", "start_char_pos": 347, "end_char_pos": 355}, {"type": "R", "before": "In this work", "after": "Here", "start_char_pos": 401, "end_char_pos": 413}, {"type": "R", "before": "which optimizes the orderof experiments, and meta learning, which transfers knowledge from one context to another", "after": "optimizing experiment order", "start_char_pos": 463, "end_char_pos": 576}, {"type": "A", "before": null, "after": "and meta-learning, transferring knowledge between contexts,", "start_char_pos": 579, "end_char_pos": 579}, {"type": "D", "before": "novel", "after": null, "start_char_pos": 668, "end_char_pos": 673}, {"type": "R", "before": "active, few-shot, and meta-learning", "after": "these", "start_char_pos": 736, "end_char_pos": 771}, {"type": "R", "before": "show results of standard active learning and meta-learning methods across these datasets to assess their ability to improve predictive models with the fewest number of experiments. We find the ensemble query by committee", "after": "find neither", "start_char_pos": 889, "end_char_pos": 1109}, {"type": "R", "before": "to be effective", "after": "tested to be better than random choice", "start_char_pos": 1133, "end_char_pos": 1148}, {"type": "R", "before": "accuracy. The robustness of these conclusions were tested across multiple model choices. We find that combining", "after": "average accuracy across datasets. Combining", "start_char_pos": 1205, "end_char_pos": 1316}, {"type": "D", "before": "methods", "after": null, "start_char_pos": 1352, "end_char_pos": 1359}], "sents_char_pos": [0, 118, 236, 400, 654, 804, 885, 1069, 1150, 1214, 1293]} {"doc_id": "1911.10009", "revision_depth": "1", "before_revision": "Divide and Choose among two agents , and the Diminishing Share (DS) and Moving Knife (MK) algorithms among many, elicit parsimonious information to guarantee to each a Fair Share, worth at least 1/ n-th of the whole manna. Our n-person Divide and Choose (D C) rule, unlike DS and MK, works if the manna has subjectively good and bad parts. If utilities are additive over indivisible items, it implements the canonical \"Fair Share up to one item\" approximation. The D%DIFDELCMD < &%%% C rule also offers one interpretation of the Fair Share when utilities are neither additivenor monotonic . Under a mild continuity assumption, it guarantees to each agent her minMax utility : that of her best share in the worst possible partition. This is lower than her Maxmin utility : that of her worst share in the best possible partition. When the manna is unanimously good, or unanimously bad, better guarantees than minMax are feasible. Our Bid & Choose rules fix an additive benchmark measure of shares, and ask agents to bid the smallest size of a share they find acceptable . The resulting Guarantee is between the minMax and Maxmin utilities ", "after_revision": "A basic test of fairness when we divide a manna of private items between n agents is the lowest welfare the rule guarantees to each agent, irrespective of others preferences. Two familiar examples are: the Equal Split Guarantee when the manna is divisible and preferences are convex; and 1/ %DIFDELCMD < &%%% n of the utility of a heterogenous non atomic cake, if utilities are additive. The minMax utility of an agent is that of her best share in the worst possible n-partition of. It is weakly below her Maxmin utility , that of her worst share in the best possible n-partition. The Maxmin guarantee is not feasible, even with two agents, if non convex preferences are allowed. The minMax guarantee is feasible in the very general class of problems where the manna is non atomic and utilities are continuous, but not necessarily additive or monotonic. The proof uses advanced algebraic topology techniques. And the minMax guarantee is implemented by the n-person version of Divide and Choose due to Kuhn (1967). When utilities are co-monotone (a larger part of the manna is weakly better for everyone, or weakly worse for everyone) better guarantees than minMax are feasible. In our Bid & Choose rules , agents bid the smallest size (according to some benchmark measure of the manna) of a share they find acceptable , and the lowest bidder picks such a share . The resulting guarantee is between the minMax and Maxmin utilities . 1", "edit_actions": [{"type": "R", "before": "Divide and Choose among two agents , and the Diminishing Share (DS) and Moving Knife (MK) algorithms among many, elicit parsimonious information to guarantee to each a Fair Share, worth at least", "after": "A basic test of fairness when we divide a manna of private items between n agents is the lowest welfare the rule guarantees to each agent, irrespective of others preferences. Two familiar examples are: the Equal Split Guarantee when the manna is divisible and preferences are convex; and", "start_char_pos": 0, "end_char_pos": 194}, {"type": "D", "before": "n-th of the whole manna. Our n-person Divide and Choose (D", "after": null, "start_char_pos": 198, "end_char_pos": 256}, {"type": "D", "before": "C) rule, unlike DS and MK, works if the manna has subjectively good and bad parts. If utilities are additive over indivisible items, it implements the canonical \"Fair Share up to one item\" approximation. The D", "after": null, "start_char_pos": 257, "end_char_pos": 466}, {"type": "R", "before": "C rule also offers one interpretation of the Fair Share when utilities are neither additivenor monotonic . Under a mild continuity assumption, it guarantees to each agent her minMax utility :", "after": "n of the utility of a heterogenous non atomic cake, if utilities are additive. The minMax utility of an agent is", "start_char_pos": 484, "end_char_pos": 675}, {"type": "R", "before": "partition. This is lower than", "after": "n-partition of. It is weakly below", "start_char_pos": 721, "end_char_pos": 750}, {"type": "R", "before": ":", "after": ",", "start_char_pos": 770, "end_char_pos": 771}, {"type": "R", "before": "partition. When the manna is unanimously good, or unanimously bad,", "after": "n-partition. The Maxmin guarantee is not feasible, even with two agents, if non convex preferences are allowed. The minMax guarantee is feasible in the very general class of problems where the manna is non atomic and utilities are continuous, but not necessarily additive or monotonic. The proof uses advanced algebraic topology techniques. And the minMax guarantee is implemented by the n-person version of Divide and Choose due to Kuhn (1967). When utilities are co-monotone (a larger part of the manna is weakly better for everyone, or weakly worse for everyone)", "start_char_pos": 817, "end_char_pos": 883}, {"type": "R", "before": "Our", "after": "In our", "start_char_pos": 928, "end_char_pos": 931}, {"type": "R", "before": "fix an additive benchmark measure of shares, and ask agents to", "after": ", agents", "start_char_pos": 951, "end_char_pos": 1013}, {"type": "R", "before": "of", "after": "(according to some benchmark measure of the manna) of", "start_char_pos": 1036, "end_char_pos": 1038}, {"type": "A", "before": null, "after": ", and the lowest bidder picks such a share", "start_char_pos": 1068, "end_char_pos": 1068}, {"type": "R", "before": "Guarantee", "after": "guarantee", "start_char_pos": 1085, "end_char_pos": 1094}, {"type": "A", "before": null, "after": ". 1", "start_char_pos": 1138, "end_char_pos": 1138}], "sents_char_pos": [0, 222, 339, 460, 590, 731, 827, 927, 1070]} {"doc_id": "1912.04015", "revision_depth": "1", "before_revision": "Financial market in oil-dependent countries has been always influenced by any changes in international energy market, In particular, oil price.It is therefore of considerable interest to investigate the impact of oil price on financial markets. The aim of this paperis to model the impact of oil price volatility on stock and industry indices by considering gas and gold price,exchange rate and trading volume as explanatory variables. We also propose Feed-forward networks as an accurate method to model non-linearity. we use data from 2009 to 2018 that is split in two periods during international energy sanction and post-sanction. The results show that Feed-forward networks perform well in predicting variables and oil price volatility has a significant impact on stock and industry market indices. The result is more robust in the post-sanction period and global financial crisis in 2014. Herein, it is important for financial market analysts and policy makers to note which factors and when influence the financial market, especially in an oil-dependent country such as Iran with uncertainty in the international politics. This research analyses the results in two different periods, which is important in the terms of oil price shock and international energy sanction. Also, using neural networks in methodology gives more accurate and reliable results. Keywords: Feed-forward networks,Industry index,International energy sanction,Oil price volatility ", "after_revision": "In this paper, we model the impact of oil price volatility on Tehranstock and industry indices in two periods of international sanctions and post-sanction. To analyse the purpose of study, we use Feed-forward neural net-works. The period of study is from 2008 to 2018 that is split in two periods during international energy sanction and post-sanction. The results show that Feed-forward neural networks perform well in predicting stock market and industry, which means oil price volatility has a significant impact on stock and industry market indices. During post-sanction and global financial crisis , the model performs better in predicting industry index. Additionally, oil price-stock market index prediction performs better in the period of international sanctions. Herein, these results are, up to some extent, important for financial market analysts and policy makers to understand which factors and when influence the financial market, especially in an oil-dependent country such asIran with uncertainty in the international politics. Keywords: Feed-forward neural networks,Industry index,International energy sanction,Oil price volatility ,Tehran stock index", "edit_actions": [{"type": "R", "before": "Financial market in oil-dependent countries has been always influenced by any changes in international energy market, In particular, oil price.It is therefore of considerable interest to investigate the impact of oil price on financial markets. The aim of this paperis to", "after": "In this paper, we", "start_char_pos": 0, "end_char_pos": 271}, {"type": "R", "before": "stock", "after": "Tehranstock", "start_char_pos": 316, "end_char_pos": 321}, {"type": "R", "before": "by considering gas and gold price,exchange rate and trading volume as explanatory variables. We also propose", "after": "in two periods of international sanctions and post-sanction. To analyse the purpose of study, we use", "start_char_pos": 343, "end_char_pos": 451}, {"type": "R", "before": "networks as an accurate method to model non-linearity. we use data from 2009", "after": "neural net-works. The period of study is from 2008", "start_char_pos": 465, "end_char_pos": 541}, {"type": "A", "before": null, "after": "neural", "start_char_pos": 670, "end_char_pos": 670}, {"type": "R", "before": "variables and", "after": "stock market and industry, which means", "start_char_pos": 707, "end_char_pos": 720}, {"type": "R", "before": "The result is more robust in the", "after": "During", "start_char_pos": 805, "end_char_pos": 837}, {"type": "D", "before": "period", "after": null, "start_char_pos": 852, "end_char_pos": 858}, {"type": "R", "before": "in 2014. Herein, it is", "after": ", the model performs better in predicting industry index. Additionally, oil price-stock market index prediction performs better in the period of international sanctions. Herein, these results are, up to some extent,", "start_char_pos": 887, "end_char_pos": 909}, {"type": "R", "before": "note", "after": "understand", "start_char_pos": 971, "end_char_pos": 975}, {"type": "R", "before": "as Iran", "after": "asIran", "start_char_pos": 1075, "end_char_pos": 1082}, {"type": "D", "before": "This research analyses the results in two different periods, which is important in the terms of oil price shock and international energy sanction. Also, using neural networks in methodology gives more accurate and reliable results.", "after": null, "start_char_pos": 1131, "end_char_pos": 1362}, {"type": "A", "before": null, "after": "neural", "start_char_pos": 1386, "end_char_pos": 1386}, {"type": "A", "before": null, "after": ",Tehran stock index", "start_char_pos": 1462, "end_char_pos": 1462}], "sents_char_pos": [0, 143, 244, 435, 634, 804, 895, 1130, 1277, 1362]} {"doc_id": "1912.05031", "revision_depth": "1", "before_revision": "A discrete system's heterogeneity is measured by the R\\'enyi heterogeneity family of indices (also known as Hill numbers or Hannah-Kay indices), whose units are known as the numbers equivalent , and whose scaling properties are consistent and intuitive . Unfortunately, numbers equivalent heterogeneity measures for non-categorical data require a priori (A) categorical partitioning and (B) pairwise distance measurement on the space of observable data . This precludes their application to problems in disciplines where categories are ill-defined or where semantically relevant features must be learned as abstractions from some data. We thus introduce representational R\\'enyi heterogeneity (RRH), which transforms an observable domain onto a latent space upon which the R\\'enyi heterogeneity is both tractable and semantically relevant. This method does not require a priori binning nor definition of a distance function on the observable space. Compared with existing state-of-the-art indices on a beta-mixture distribution, we show that RRH more accurately detects the number of distinct mixture components. We also show that RRH can measure heterogeneity in natural images whose semantically relevant features must be abstracted using deep generative models. We further show that RRH can uniquely capture heterogeneity caused by distinct components in mixture distributions. Our novel approach will enable measurement of heterogeneity in disciplines where a priori categorical partitions of observable data are not possible, or where semantically relevant features must be inferred using latent variable models .", "after_revision": "A discrete system's heterogeneity is measured by the R\\'enyi heterogeneity family of indices (also known as Hill numbers or Hannah--Kay indices), whose units are the numbers equivalent . Unfortunately, numbers equivalent heterogeneity measures for non-categorical data require a priori (A) categorical partitioning and (B) pairwise distance measurement on the observable data space, thereby precluding application to problems with ill-defined categories or where semantically relevant features must be learned as abstractions from some data. We thus introduce representational R\\'enyi heterogeneity (RRH), which transforms an observable domain onto a latent space upon which the R\\'enyi heterogeneity is both tractable and semantically relevant. This method requires neither a priori binning nor definition of a distance function on the observable space. We show that RRH can generalize existing biodiversity and economic equality indices. Compared with existing indices on a beta-mixture distribution, we show that RRH responds more appropriately to changes in mixture component separation and weighting. Finally, we demonstrate the measurement of RRH in a set of natural images, with respect to abstract representations learned by a deep neural network. The RRH approach will further enable heterogeneity measurement in disciplines whose data do not easily conform to the assumptions of existing indices .", "edit_actions": [{"type": "R", "before": "Hannah-Kay", "after": "Hannah--Kay", "start_char_pos": 124, "end_char_pos": 134}, {"type": "D", "before": "known as", "after": null, "start_char_pos": 161, "end_char_pos": 169}, {"type": "D", "before": ", and whose scaling properties are consistent and intuitive", "after": null, "start_char_pos": 193, "end_char_pos": 252}, {"type": "R", "before": "a priori", "after": "a priori", "start_char_pos": 345, "end_char_pos": 353}, {"type": "R", "before": "space of observable data . This precludes their", "after": "observable data space, thereby precluding", "start_char_pos": 428, "end_char_pos": 475}, {"type": "R", "before": "in disciplines where categories are", "after": "with", "start_char_pos": 500, "end_char_pos": 535}, {"type": "A", "before": null, "after": "categories", "start_char_pos": 548, "end_char_pos": 548}, {"type": "R", "before": "does not require a priori", "after": "requires neither", "start_char_pos": 853, "end_char_pos": 878}, {"type": "A", "before": null, "after": "a priori", "start_char_pos": 879, "end_char_pos": 879}, {"type": "A", "before": null, "after": "We show that RRH can generalize existing biodiversity and economic equality indices.", "start_char_pos": 951, "end_char_pos": 951}, {"type": "D", "before": "state-of-the-art", "after": null, "start_char_pos": 975, "end_char_pos": 991}, {"type": "R", "before": "more accurately detects the number of distinct mixture components. We also show that RRH can measure heterogeneity in natural images whose semantically relevant features must be abstracted using deep generative models. We further show that RRH can uniquely capture heterogeneity caused by distinct components in mixture distributions. Our novel approach will enable measurement of heterogeneity", "after": "responds more appropriately to changes in mixture component separation and weighting. Finally, we demonstrate the measurement of RRH", "start_char_pos": 1049, "end_char_pos": 1443}, {"type": "R", "before": "disciplines where a priori categorical partitions of observable data are not possible, or where semantically relevant features must be inferred using latent variable models", "after": "a set of natural images, with respect to abstract representations learned by a deep neural network. The RRH approach will further enable heterogeneity measurement in disciplines whose data do not easily conform to the assumptions of existing indices", "start_char_pos": 1447, "end_char_pos": 1619}], "sents_char_pos": [0, 254, 454, 636, 840, 950, 1115, 1267, 1383]} {"doc_id": "1912.08369", "revision_depth": "1", "before_revision": "Understanding the causes and effects of spatial patterns of vegetation is a fundamental problem in ecology, especially because these can be used as early predictors of catastrophic shifts such as desertification processes. Empirical studies of the vegetation cover of drylands and semiarid regions have revealed the existence of vegetation patches of broadly diverse sizes , such that the probability distribution of their sizes can be fitted by a power law, i.e. vegetation patches are approximately scale free. Different explanatory mechanisms, such as plant-plant interactions and plant-water feedback loops have been proposed to justify such a finding , yet a full understanding has not been reached. Using a simple individual-based model for vegetation dynamics, we show that environmental variability --a well-recognized characteristic feature of semiarid environments-- promotes the emergence of power-law vegetation patches in a robust way (i.e. for a broad range of parameter values) . Furthermore, these are related to a percolation phenomenon that occurs in an intermittent or fluctuating way. The model also reveals that the emerging power-law exponents depend on the overall vegetation-cover density exhibiting the same trend as empirical data and, remarkably, the fitted exponents agree reasonably well with the ones measured in well-known empirical studies. We conclude that environmental variability plays a key role in the formation of such vegetation patterns. From a practical viewpoint, this may be of importance to predict the effects that changes in environmental conditions may have in real ecosystems. From a theoretical side our study shed new light on intermittent percolation phenomena occurring under fluctuating conditions.", "after_revision": "Understanding the causes and effects of spatial patterns of vegetation is a fundamental problem in ecology, especially because these can be used as early predictors of catastrophic shifts such as desertification processes. Empirical studies of the vegetation cover in some areas such as drylands and semiarid regions have revealed the existence of vegetation patches of broadly diverse sizes . In particular, the probability distribution of patch sizes can be fitted by a power law, i.e. vegetation patches are approximately scale free. Different explanatory mechanisms, such as plant-plant interactions and plant-water feedback loops have been proposed to rationalize the emergence of such scale-free patterns , yet a full understanding has not been reached. Using a simple model for vegetation dynamics, we show that environmental temporal variability --a well-recognized feature of semiarid environments-- promotes in a robust way (i.e. for a broad range of parameter values) the emergence of scale-free vegetation patches . Furthermore, this observation is related to a percolation phenomenon that occurs in an intermittent or fluctuating way. The model also reveals that the emerging power-law exponents depend on the overall vegetation-cover density , in agreement with empirical observations, suggesting that environmental variability plays a key role in the formation of scale-free vegetation patterns. From a practical viewpoint, this may be of importance to predict the effects that changes in environmental conditions may have in real ecosystems. From a theoretical side , our study sheds new light on a novel type of percolation phenomenon occurring under temporally-varying external conditions.", "edit_actions": [{"type": "R", "before": "of", "after": "in some areas such as", "start_char_pos": 265, "end_char_pos": 267}, {"type": "R", "before": ", such that", "after": ". In particular,", "start_char_pos": 373, "end_char_pos": 384}, {"type": "R", "before": "their", "after": "patch", "start_char_pos": 417, "end_char_pos": 422}, {"type": "R", "before": "justify such a finding", "after": "rationalize the emergence of such scale-free patterns", "start_char_pos": 633, "end_char_pos": 655}, {"type": "D", "before": "individual-based", "after": null, "start_char_pos": 720, "end_char_pos": 736}, {"type": "A", "before": null, "after": "temporal", "start_char_pos": 795, "end_char_pos": 795}, {"type": "D", "before": "characteristic", "after": null, "start_char_pos": 828, "end_char_pos": 842}, {"type": "D", "before": "the emergence of power-law vegetation patches", "after": null, "start_char_pos": 887, "end_char_pos": 932}, {"type": "A", "before": null, "after": "the emergence of scale-free vegetation patches", "start_char_pos": 994, "end_char_pos": 994}, {"type": "R", "before": "these are", "after": "this observation is", "start_char_pos": 1010, "end_char_pos": 1019}, {"type": "R", "before": "exhibiting the same trend as empirical data and, remarkably, the fitted exponents agree reasonably well with the ones measured in well-known empirical studies. We conclude", "after": ", in agreement with empirical observations, suggesting", "start_char_pos": 1215, "end_char_pos": 1386}, {"type": "R", "before": "such", "after": "scale-free", "start_char_pos": 1455, "end_char_pos": 1459}, {"type": "R", "before": "our study shed", "after": ", our study sheds", "start_char_pos": 1652, "end_char_pos": 1666}, {"type": "R", "before": "intermittent percolation phenomena occurring under fluctuating", "after": "a novel type of percolation phenomenon occurring under temporally-varying external", "start_char_pos": 1680, "end_char_pos": 1742}], "sents_char_pos": [0, 222, 512, 704, 996, 1106, 1374, 1480, 1627]} {"doc_id": "1912.09380", "revision_depth": "1", "before_revision": "Within sEMG-based gesture recognition, a chasm exists in the literature between offline accuracy and real-time usability of a classifier. This gap mainly stems from the four main dynamic factors in sEMG-based gesture recognition: gesture intensity, limb position, electrode shift and transient changes in the signal . These factors are hard to include within an offline dataset as each of them exponentially augment the number of segments to be recorded. On the other hand , online datasets are biased towards the sEMG-based algorithms providing feedback to the participants, limiting the usability of such datasets as benchmarks. This paper proposes a virtual reality (VR) environment and a real-time experimental protocol from which the four main dynamic factors can more easily be studied. During the online experiment, the gesture recognition feedback is provided through the leap motion camera, enabling the proposed dataset to be re-used to compare future sEMG-based algorithms. 20 able-bodied persons took part in this study, completing three to four sessions over a period spanning between 14 and 21 days. Finally, TADANN, a new transfer learning-based algorithm, is proposed for long term gesture classification and significantly (p<0.05) outperforms fine-tuning a network .", "after_revision": "Within the field of electromyography-based (EMG) gesture recognition, disparities exist between the offline accuracy reported in the literature and the real-time usability of a classifier. This gap mainly stems from two factors: 1) The absence of a controller, making the data collected dissimilar to actual control. 2) The difficulty of including the four main dynamic factors (gesture intensity, limb position, electrode shift , and transient changes in the signal ), as including their permutations drastically increases the amount of data to be recorded. Contrarily , online datasets are limited to the exact EMG-based controller used to record them, necessitating the recording of a new dataset for each control method or variant to be tested. Consequently, this paper proposes a new type of dataset to serve as an intermediate between offline and online datasets, by recording the data using a real-time experimental protocol . The protocol, performed in virtual reality, includes the four main dynamic factors and uses an EMG-independent controller to guide movements. This EMG-independent feedback ensures that the user is in-the-loop during recording, while enabling the resulting dynamic dataset to be used as an EMG-based benchmark. The dataset is comprised of 20 able-bodied participants completing three to four sessions over a period of 14 to 21 days. The ability of the dynamic dataset to serve as a benchmark is leveraged to evaluate the impact of different recalibration techniques for long-term (across-day) gesture recognition, including a novel algorithm, named TADANN. TADANN consistently and significantly (p<0.05) outperforms using fine-tuning as the recalibration technique .", "edit_actions": [{"type": "R", "before": "sEMG-based", "after": "the field of electromyography-based (EMG)", "start_char_pos": 7, "end_char_pos": 17}, {"type": "R", "before": "a chasm exists in the literature between offline accuracy and", "after": "disparities exist between the offline accuracy reported in the literature and the", "start_char_pos": 39, "end_char_pos": 100}, {"type": "R", "before": "the", "after": "two factors: 1) The absence of a controller, making the data collected dissimilar to actual control. 2) The difficulty of including the", "start_char_pos": 165, "end_char_pos": 168}, {"type": "R", "before": "in sEMG-based gesture recognition: gesture", "after": "(gesture", "start_char_pos": 195, "end_char_pos": 237}, {"type": "A", "before": null, "after": ",", "start_char_pos": 280, "end_char_pos": 280}, {"type": "R", "before": ". These factors are hard to include within an offline dataset as each of them exponentially augment the number of segments", "after": "), as including their permutations drastically increases the amount of data", "start_char_pos": 317, "end_char_pos": 439}, {"type": "R", "before": "On the other hand", "after": "Contrarily", "start_char_pos": 456, "end_char_pos": 473}, {"type": "R", "before": "biased towards the sEMG-based algorithms providing feedback to the participants, limiting the usability of such datasets as benchmarks. This", "after": "limited to the exact EMG-based controller used to record them, necessitating the recording of a new dataset for each control method or variant to be tested. Consequently, this", "start_char_pos": 496, "end_char_pos": 636}, {"type": "R", "before": "virtual reality (VR) environment and", "after": "new type of dataset to serve as an intermediate between offline and online datasets, by recording the data using", "start_char_pos": 654, "end_char_pos": 690}, {"type": "R", "before": "from which", "after": ". The protocol, performed in virtual reality, includes", "start_char_pos": 725, "end_char_pos": 735}, {"type": "R", "before": "can more easily be studied. During the online experiment, the gesture recognition feedback is provided through the leap motion camera, enabling the proposed", "after": "and uses an EMG-independent controller to guide movements. This EMG-independent feedback ensures that the user is in-the-loop during recording, while enabling the resulting dynamic", "start_char_pos": 766, "end_char_pos": 922}, {"type": "R", "before": "re-used to compare future sEMG-based algorithms.", "after": "used as an EMG-based benchmark. The dataset is comprised of", "start_char_pos": 937, "end_char_pos": 985}, {"type": "R", "before": "persons took part in this study,", "after": "participants", "start_char_pos": 1001, "end_char_pos": 1033}, {"type": "R", "before": "spanning between", "after": "of", "start_char_pos": 1082, "end_char_pos": 1098}, {"type": "R", "before": "and", "after": "to", "start_char_pos": 1102, "end_char_pos": 1105}, {"type": "R", "before": "Finally, TADANN, a new transfer learning-based algorithm, is proposed for long term gesture classification", "after": "The ability of the dynamic dataset to serve as a benchmark is leveraged to evaluate the impact of different recalibration techniques for long-term (across-day) gesture recognition, including a novel algorithm, named TADANN. TADANN consistently", "start_char_pos": 1115, "end_char_pos": 1221}, {"type": "A", "before": null, "after": "using", "start_char_pos": 1261, "end_char_pos": 1261}, {"type": "R", "before": "a network", "after": "as the recalibration technique", "start_char_pos": 1274, "end_char_pos": 1283}], "sents_char_pos": [0, 137, 318, 455, 631, 793, 985, 1114]} {"doc_id": "1912.09765", "revision_depth": "1", "before_revision": "Availability codes have recently been proposed to facilitate efficient storage, management, and retrieval of frequently accessed data in distributed storage systems. Such codes provide multiple disjoint recovery groups for each data object, which makes it possible for multiple users to access the same object in a non-overlapping way. However in the presence of server-side performance variability, downloading an object using a recovery group takes longer than using a single server hosting the object. Therefore it is not immediately clear whether availability codes reduce latency to access hot data . Accordingly, the goal of this paper is to analyze, using a queuing theoretical approach, the download time in storage systems that employ availability codes . For data access, we consider the widely adopted Fork-Join model with redundancy. In this model, each request arrival splits into multiple copies and completes as soon as any one of the copies finishes service. We first carry out the analysis under the low-traffic regime in which case the system consists of at most one download request at any time. In this setting, we compare the download time in systems with availability, maximum distance separable (MDS), and replication codes. Our results indicate that availability codes can reduce download time in some settings, but are not always optimal. When the low-traffic assumption does not hold, system consists of multiple inter-dependent Fork-Join queues operating in parallel , which makes the exact analysis intractable . For this case we present upper and lower bounds on the download time . These bounds yield insight on system performance with respect to varying popularities over the stored objects. We also derive an M/G/1 queue approximation for the system, and show with simulations that it performs well in estimating the actual system performance .", "after_revision": "Availability codes have recently been proposed to facilitate efficient retrieval of frequently accessed (hot) data objects in distributed storage systems. Such codes provide multiple disjoint recovery groups for each data object, thus providing flexibility in accessing data objects. This paper presents techniques for analyzing the download time of systematic availability codes considering the Fork-Join scheme for data access. With the Fork-Join access scheme, each data request is replicated (forked) to the systematic server containing the object and all of its recovery groups. For low-traffic regime , when there is at most one request in the system, we compute the download time in closed-form and compare it across systems with availability, maximum distance separable (MDS), and replication codes. We demonstrate that availability codes can reduce download time in some settings, but are not always optimal. When the low-traffic assumption does not hold, system consists of multiple inter-dependent Fork-Join queues , which makes exact analysis intractable due to state space explosion . For this case , we present upper and lower bounds on the download time , and an M/G/1 queue approximation for several special cases of interest. Via numerical simulations, we evaluate our bounds, and demonstrate that the M/G/1 queue approximation has a high degree of accuracy. We also compare availability codes with MDS and replication codes .", "edit_actions": [{"type": "D", "before": "storage, management, and", "after": null, "start_char_pos": 71, "end_char_pos": 95}, {"type": "R", "before": "data", "after": "(hot) data objects", "start_char_pos": 129, "end_char_pos": 133}, {"type": "R", "before": "which makes it possible for multiple users to access the same object in a non-overlapping way. However in the presence of server-side performance variability, downloading an object using a recovery group takes longer than using a single server hosting the object. Therefore it is not immediately clear whether availability codes reduce latency to access hot data . Accordingly, the goal of this paper is to analyze, using a queuing theoretical approach,", "after": "thus providing flexibility in accessing data objects. This paper presents techniques for analyzing", "start_char_pos": 241, "end_char_pos": 694}, {"type": "R", "before": "in storage systems that employ availability codes . For data access, we consider the widely adopted", "after": "of systematic availability codes considering the", "start_char_pos": 713, "end_char_pos": 812}, {"type": "R", "before": "model with redundancy. In this model, each request arrival splits into multiple copies and completes as soon as any one of the copies finishes service. We first carry out the analysis under the", "after": "scheme for data access. With the Fork-Join access scheme, each data request is replicated (forked) to the systematic server containing the object and all of its recovery groups. For", "start_char_pos": 823, "end_char_pos": 1016}, {"type": "R", "before": "in which case the system consists of", "after": ", when there is", "start_char_pos": 1036, "end_char_pos": 1072}, {"type": "R", "before": "download request at any time. In this setting, we compare", "after": "request in the system, we compute", "start_char_pos": 1085, "end_char_pos": 1142}, {"type": "A", "before": null, "after": "closed-form and compare it across", "start_char_pos": 1164, "end_char_pos": 1164}, {"type": "R", "before": "Our results indicate", "after": "We demonstrate", "start_char_pos": 1249, "end_char_pos": 1269}, {"type": "D", "before": "operating in parallel", "after": null, "start_char_pos": 1473, "end_char_pos": 1494}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1509, "end_char_pos": 1512}, {"type": "A", "before": null, "after": "due to state space explosion", "start_char_pos": 1540, "end_char_pos": 1540}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1557, "end_char_pos": 1557}, {"type": "R", "before": ". These bounds yield insight on system performance with respect to varying popularities over the stored objects. We also derive", "after": ", and", "start_char_pos": 1613, "end_char_pos": 1740}, {"type": "R", "before": "the system, and show with simulations that it performs well in estimating the actual system performance", "after": "several special cases of interest. Via numerical simulations, we evaluate our bounds, and demonstrate that the M/G/1 queue approximation has a high degree of accuracy. We also compare availability codes with MDS and replication codes", "start_char_pos": 1774, "end_char_pos": 1877}], "sents_char_pos": [0, 165, 335, 504, 605, 764, 845, 974, 1114, 1248, 1364, 1542, 1614, 1725]} {"doc_id": "1912.10375", "revision_depth": "1", "before_revision": "While there has been great interest in generating imperceptible adversarial examples in continuous data domain (e.g. image and audio)to explore the model vulnerabilities, generatingadversarial text in the discrete domain is still challenging . The main contribution of this paper is to propose a general targeted attack framework AdvCodec for adversarial text generation which addresses the challenge of discrete input space and is easily adapted to general natural language processing (NLP ) tasks. In particular, we propose a tree-based autoencoder to encode discrete text data into continuous vector space, upon which we optimize the adversarial perturbation. A tree-based decoder is then applied to ensure the grammar correctness of the generated text . It also enables the flexibility of making manipulations on different levels of text, such as sentence (AdvCodec(sent)) and word (AdvCodec(word)) levels . We consider multiple attacking scenarios, including appending an adversarial sentence or adding unnoticeable words to a given paragraph, to achieve the arbitrary targeted attack. To demonstrate the effectiveness of the proposed method, we consider two most representative NLP tasks: sentiment analysis and question answering (QA). Extensive experimental results and human studies show that AdvCodec generated adversarial text can successfully attack the neural models without misleading the human. In particular, our attack causes a BERT-based sentiment classifier accuracy to drop from 0.703 to 0.006, and a BERT-based QA model's F1 score to drop from 88.62 to 33.21 (with best targeted attack F1 score as 46.54). Furthermore, we show that the white-box generated adversarial texts can transfer across other black-box models, shedding light on an effective way to examine the robustness of existing NLP models. ", "after_revision": "Adversarial attacks against natural language processing systems, which perform seemingly innocuous modifications to inputs, can induce arbitrary mistakes to the target models. Though raised great concerns, such adversarial attacks can be leveraged to estimate the robustness of NLP models. Compared with the adversarial example generation in continuous data domain (e.g. , image ) , generating adversarial text that preserves the original meaning is challenging since the text space is discrete and non-differentiable. To handle these challenges, we propose a target-controllable adversarial attack framework T3, which is applicable to a range of NLP tasks. In particular, we propose a tree-based autoencoder to embed the discrete text data into a continuous representation space, upon which we optimize the adversarial perturbation. A novel tree-based decoder is then applied to regularize the syntactic correctness of the generated text and manipulate it on either sentence (T3(Sent)) or word (T3(Word)) level . We consider two most representative NLP tasks: sentiment analysis and question answering (QA). Extensive experimental results and human studies show that T3 generated adversarial texts can successfully manipulate the NLP models to output the targeted incorrect answer without misleading the human. Moreover, we show that the generated adversarial texts have high transferability which enables the black-box attacks in practice. Our work sheds light on an effective and general way to examine the robustness of NLP models. Our code is publicly available at URL", "edit_actions": [{"type": "R", "before": "While there has been great interest in generating imperceptible adversarial examples", "after": "Adversarial attacks against natural language processing systems, which perform seemingly innocuous modifications to inputs, can induce arbitrary mistakes to the target models. Though raised great concerns, such adversarial attacks can be leveraged to estimate the robustness of NLP models. Compared with the adversarial example generation", "start_char_pos": 0, "end_char_pos": 84}, {"type": "D", "before": "image and audio)to explore the model vulnerabilities, generating", "after": null, "start_char_pos": 117, "end_char_pos": 181}, {"type": "D", "before": "adversarial text", "after": null, "start_char_pos": 181, "end_char_pos": 197}, {"type": "R", "before": "in the discrete domain is still challenging . The main contribution of this paper is to propose a general targeted attack framework AdvCodec for adversarial text generation which addresses the challenge of discrete input space and is easily adapted to general natural language processing (NLP", "after": ", image", "start_char_pos": 198, "end_char_pos": 490}, {"type": "A", "before": null, "after": ", generating adversarial text that preserves the original meaning is challenging since the text space is discrete and non-differentiable. To handle these challenges, we propose a target-controllable adversarial attack framework T3, which is applicable to a range of NLP", "start_char_pos": 493, "end_char_pos": 493}, {"type": "R", "before": "encode", "after": "embed the", "start_char_pos": 555, "end_char_pos": 561}, {"type": "R", "before": "continuous vector", "after": "a continuous representation", "start_char_pos": 586, "end_char_pos": 603}, {"type": "A", "before": null, "after": "novel", "start_char_pos": 666, "end_char_pos": 666}, {"type": "R", "before": "ensure the grammar", "after": "regularize the syntactic", "start_char_pos": 705, "end_char_pos": 723}, {"type": "R", "before": ". It also enables the flexibility of making manipulations on different levels of text, such as sentence (AdvCodec(sent)) and word (AdvCodec(word)) levels", "after": "and manipulate it on either sentence (T3(Sent)) or word (T3(Word)) level", "start_char_pos": 758, "end_char_pos": 911}, {"type": "D", "before": "multiple attacking scenarios, including appending an adversarial sentence or adding unnoticeable words to a given paragraph, to achieve the arbitrary targeted attack. To demonstrate the effectiveness of the proposed method, we consider", "after": null, "start_char_pos": 926, "end_char_pos": 1161}, {"type": "R", "before": "AdvCodec generated adversarial text can successfully attack the neural models", "after": "T3 generated adversarial texts can successfully manipulate the NLP models to output the targeted incorrect answer", "start_char_pos": 1304, "end_char_pos": 1381}, {"type": "R", "before": "In particular, our attack causes a BERT-based sentiment classifier accuracy to drop from 0.703 to 0.006, and a BERT-based QA model's F1 score to drop from 88.62 to 33.21 (with best targeted attack F1 score as 46.54). Furthermore,", "after": "Moreover,", "start_char_pos": 1412, "end_char_pos": 1641}, {"type": "D", "before": "white-box", "after": null, "start_char_pos": 1659, "end_char_pos": 1668}, {"type": "R", "before": "can transfer across other", "after": "have high transferability which enables the", "start_char_pos": 1697, "end_char_pos": 1722}, {"type": "R", "before": "models, shedding", "after": "attacks in practice. Our work sheds", "start_char_pos": 1733, "end_char_pos": 1749}, {"type": "A", "before": null, "after": "and general", "start_char_pos": 1772, "end_char_pos": 1772}, {"type": "D", "before": "existing", "after": null, "start_char_pos": 1806, "end_char_pos": 1814}, {"type": "A", "before": null, "after": "Our code is publicly available at URL", "start_char_pos": 1827, "end_char_pos": 1827}], "sents_char_pos": [0, 243, 500, 663, 759, 913, 1092, 1244, 1411, 1628]} {"doc_id": "1912.11430", "revision_depth": "1", "before_revision": "Molecular fingerprints are the workhorse in ligand-based drug discovery. In recent years, increasing number of research papers reported fascinating results on using deep neural networks to learn 2D molecular representations as fingerprints. One may anticipate that the integration of deep learning would also contribute to the prosperity of 3D fingerprints. Here, we presented a new 3D small molecule fingerprint, the three-dimensional force fields fingerprint (TF3P) , learned by deep capsular network whose training is in no need of labeled dataset for specific predictive tasks. TF3P can encode the 3D force fields information of molecules and demonstrates its stronger ability to capture 3D structural changes, recognize molecules alike in 3D but not in 2D, and recognize similar targets inaccessible by other fingerprints, including the solely existing 3D fingerprint E3FP, based on only ligands similarity. Furthermore, TF3P is compatible with both statistical models (e.g. similarity ensemble approach) and machine learning models. Altogether, we report TF3P as a new 3D small molecule fingerprint with promising future in ligand-based drug discovery. ", "after_revision": "Molecular fingerprints are the workhorse in ligand-based drug discovery. In recent years, an increasing number of research papers reported fascinating results on using deep neural networks to learn 2D molecular representations as fingerprints. It is anticipated that the integration of deep learning would also contribute to the prosperity of 3D fingerprints. Here, we unprecedentedly introduce deep learning into 3D small molecule fingerprints, presenting a new one we termed as the three-dimensional force fields fingerprint (TF3P) . TF3P is learned by a deep capsular network whose training is in no need of labeled datasets for specific predictive tasks. TF3P can encode the 3D force fields information of molecules and demonstrates the stronger ability to capture 3D structural changes, to recognize molecules alike in 3D but not in 2D, and to identify similar targets inaccessible by other 2D or 3D fingerprints based on only ligands similarity. Furthermore, TF3P is compatible with both statistical models (e.g. similarity ensemble approach) and machine learning models. Altogether, we report TF3P as a new 3D small molecule fingerprint with a promising future in ligand-based drug discovery. All codes are written in Python and available at URL", "edit_actions": [{"type": "A", "before": null, "after": "an", "start_char_pos": 90, "end_char_pos": 90}, {"type": "R", "before": "One may anticipate", "after": "It is anticipated", "start_char_pos": 242, "end_char_pos": 260}, {"type": "R", "before": "presented a new", "after": "unprecedentedly introduce deep learning into", "start_char_pos": 368, "end_char_pos": 383}, {"type": "R", "before": "fingerprint,", "after": "fingerprints, presenting a new one we termed as", "start_char_pos": 402, "end_char_pos": 414}, {"type": "R", "before": ", learned by", "after": ". TF3P is learned by a", "start_char_pos": 469, "end_char_pos": 481}, {"type": "R", "before": "dataset", "after": "datasets", "start_char_pos": 544, "end_char_pos": 551}, {"type": "R", "before": "its", "after": "the", "start_char_pos": 661, "end_char_pos": 664}, {"type": "A", "before": null, "after": "to", "start_char_pos": 716, "end_char_pos": 716}, {"type": "R", "before": "recognize", "after": "to identify", "start_char_pos": 768, "end_char_pos": 777}, {"type": "R", "before": "fingerprints, including the solely existing", "after": "2D or", "start_char_pos": 816, "end_char_pos": 859}, {"type": "R", "before": "fingerprint E3FP,", "after": "fingerprints", "start_char_pos": 863, "end_char_pos": 880}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1112, "end_char_pos": 1112}, {"type": "A", "before": null, "after": "All codes are written in Python and available at URL", "start_char_pos": 1162, "end_char_pos": 1162}], "sents_char_pos": [0, 72, 241, 358, 582, 914, 1040]} {"doc_id": "2001.03197", "revision_depth": "2", "before_revision": "The emerging autonomous vehicles (AV) can either supplement the public transportation (PT) system or be a competitor with it. This paper focuses on this competition in a hypothetical scenario--\"if both AV and PT operators are profit-oriented ,\" and uses an ABM to quantitatively evaluate the system performance in this competition from the perspectives of four stakeholders--AV operator, PT operator, passengers, and public authority. In our model, AV operator updates its supply by changing fleet sizes while PT by adjusting headways, and both use heuristic approaches to update supply in order to increase profits. We implement the model in the first-mile scenario in Tampines . In four regulation scenarios--two by two combinations regarding whether AV and PT are allowed to change supplies--we find that since AV can release the bus operator from low-demand routes, the competition can lead to higher profits of both, and higher system efficiency , simultaneously, rather than a one-sided loss-gain result. For PT, after supply updates, spatially the services are concentrated to short feeder routes directly to the subway station , and temporally concentrated to peak hours. For passengers , the competition reduces their travel time but increases their travel costs. Nonetheless, the generalized travel cost is still reduced when counting the value of time. For system efficiencyand sustainability, bus supply adjustment can increase the bus average load and reduce total PCE , while the AV supply adjustment shows the oppositeeffect. For policy implications, the paper suggests that PT should be allowed to optimize its supply strategies under specific operation goal constraints, and AV operation should be regulated to relieve its externality on the system, including limiting the number of licenses, operation time, and service areas, which makes AV operate like a complementary mode to PT .", "after_revision": "Emerging autonomous vehicles (AV) can either supplement the public transportation (PT) system or compete with it. This study examines the competitive perspective where both AV and PT operators are profit-oriented with dynamic adjustable supply strategies under five regulatory structures regarding whether the AV operator is allowed to change the fleet size and whether the PT operator is allowed to adjust headway. Four out of the five scenarios are constrained competition while the other one focuses on unconstrained competition to find the Nash Equilibrium. We evaluate the competition process as well as the system performance from the standpoints of four stakeholders -- the AV operator, the PT operator, passengers, and the transport authority. We also examine the impact of PT subsidies on the competition results including both demand-based and supply-based subsidies. A heuristic algorithm is proposed to update supply strategies for AV and PT based on the operators' historical actions and profits. An agent-based simulation model is implemented in the first-mile scenario in Tampines , Singapore. We find that the competition can result in higher profits and higher system efficiency for both operators compared to the status quo. After the supply updates, the PT services are spatially concentrated to shorter routes feeding directly to the subway station and temporally concentrated to peak hours. On average , the competition reduces the travel time of passengers but increases their travel costs. Nonetheless, the generalized travel cost is reduced when incorporating the value of time. With respect to the system efficiency, the bus supply adjustment increases the average vehicle load and reduces the total vehicle kilometer traveled measured by the passenger car equivalent (PCE) , while the AV supply adjustment does the opposite .", "edit_actions": [{"type": "R", "before": "The emerging", "after": "Emerging", "start_char_pos": 0, "end_char_pos": 12}, {"type": "R", "before": "be a competitor", "after": "compete", "start_char_pos": 101, "end_char_pos": 116}, {"type": "R", "before": "paper focuses on this competition in a hypothetical scenario--\"if", "after": "study examines the competitive perspective where", "start_char_pos": 131, "end_char_pos": 196}, {"type": "R", "before": ",\" and uses an ABM to quantitatively evaluate the system performance in this competition from the perspectives of four stakeholders--AV operator,", "after": "with dynamic adjustable supply strategies under five regulatory structures regarding whether the AV operator is allowed to change the fleet size and whether the PT operator is allowed to adjust headway. Four out of the five scenarios are constrained competition while the other one focuses on unconstrained competition to find the Nash Equilibrium. We evaluate the competition process as well as the system performance from the standpoints of four stakeholders -- the AV operator, the", "start_char_pos": 242, "end_char_pos": 387}, {"type": "R", "before": "public authority. In our model, AV operator updates its supply by changing fleet sizes while PT by adjusting headways, and both use heuristic approaches", "after": "the transport authority. We also examine the impact of PT subsidies on the competition results including both demand-based and supply-based subsidies. A heuristic algorithm is proposed", "start_char_pos": 417, "end_char_pos": 569}, {"type": "R", "before": "in order to increase profits. We implement the model", "after": "strategies for AV and PT based on the operators' historical actions and profits. An agent-based simulation model is implemented", "start_char_pos": 587, "end_char_pos": 639}, {"type": "R", "before": ". In four regulation scenarios--two by two combinations regarding whether AV and PT are allowed to change supplies--we find that since AV can release the bus operator from low-demand routes, the competition can lead to higher profits of both,", "after": ", Singapore. We find that the competition can result in higher profits", "start_char_pos": 679, "end_char_pos": 921}, {"type": "R", "before": ", simultaneously, rather than a one-sided loss-gain result. For PT, after", "after": "for both operators compared to the status quo. After the", "start_char_pos": 951, "end_char_pos": 1024}, {"type": "R", "before": "spatially the services are concentrated to short feeder routes", "after": "the PT services are spatially concentrated to shorter routes feeding", "start_char_pos": 1041, "end_char_pos": 1103}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1135, "end_char_pos": 1136}, {"type": "R", "before": "For passengers", "after": "On average", "start_char_pos": 1180, "end_char_pos": 1194}, {"type": "R", "before": "their travel time", "after": "the travel time of passengers", "start_char_pos": 1221, "end_char_pos": 1238}, {"type": "R", "before": "still reduced when counting", "after": "reduced when incorporating", "start_char_pos": 1317, "end_char_pos": 1344}, {"type": "R", "before": "For system efficiencyand sustainability,", "after": "With respect to the system efficiency, the", "start_char_pos": 1364, "end_char_pos": 1404}, {"type": "R", "before": "can increase the bus average load and reduce total PCE", "after": "increases the average vehicle load and reduces the total vehicle kilometer traveled measured by the passenger car equivalent (PCE)", "start_char_pos": 1427, "end_char_pos": 1481}, {"type": "R", "before": "shows the oppositeeffect. For policy implications, the paper suggests that PT should be allowed to optimize its supply strategies under specific operation goal constraints, and AV operation should be regulated to relieve its externality on the system, including limiting the number of licenses, operation time, and service areas, which makes AV operate like a complementary mode to PT", "after": "does the opposite", "start_char_pos": 1515, "end_char_pos": 1899}], "sents_char_pos": [0, 125, 434, 616, 680, 1010, 1179, 1272, 1363, 1540]} {"doc_id": "2001.04063", "revision_depth": "2", "before_revision": "In this paper , we present a new sequence-to-sequence pre-training model called ProphetNet, which introduces a novel self-supervised objective named future n-gram prediction and the proposed n-stream self-attention mechanism. Instead of the optimization of one-step ahead prediction in traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction which predicts the next n tokens simultaneously based on previous context tokens at each time step. The future n-gram prediction explicitly encourages the model to plan for the future tokens and prevent overfitting on strong local correlations. We pre-train ProphetNet using a base scale dataset (16GB) and a large scale dataset (160GB) respectively. Then we conduct experiments on CNN/DailyMail, Gigaword, and SQuAD 1.1 benchmarks for abstractive summarization and question generation tasks. Experimental results show that ProphetNet achieves new state-of-the-art results on all these datasets compared to the models using the same scale pre-training corpus.", "after_revision": "This paper presents a new sequence-to-sequence pre-training model called ProphetNet, which introduces a novel self-supervised objective named future n-gram prediction and the proposed n-stream self-attention mechanism. Instead of optimizing one-step-ahead prediction in the traditional sequence-to-sequence model, the ProphetNet is optimized by n-step ahead prediction that predicts the next n tokens simultaneously based on previous context tokens at each time step. The future n-gram prediction explicitly encourages the model to plan for the future tokens and prevent overfitting on strong local correlations. We pre-train ProphetNet using a base scale dataset (16GB) and a large-scale dataset (160GB) , respectively. Then we conduct experiments on CNN/DailyMail, Gigaword, and SQuAD 1.1 benchmarks for abstractive summarization and question generation tasks. Experimental results show that ProphetNet achieves new state-of-the-art results on all these datasets compared to the models using the same scale pre-training corpus.", "edit_actions": [{"type": "R", "before": "In this paper , we present", "after": "This paper presents", "start_char_pos": 0, "end_char_pos": 26}, {"type": "R", "before": "the optimization of one-step ahead prediction in", "after": "optimizing one-step-ahead prediction in the", "start_char_pos": 237, "end_char_pos": 285}, {"type": "R", "before": "which", "after": "that", "start_char_pos": 381, "end_char_pos": 386}, {"type": "R", "before": "large scale", "after": "large-scale", "start_char_pos": 690, "end_char_pos": 701}, {"type": "A", "before": null, "after": ",", "start_char_pos": 718, "end_char_pos": 718}], "sents_char_pos": [0, 225, 480, 625, 732, 874]} {"doc_id": "2001.04283", "revision_depth": "1", "before_revision": "Some consumers, such as householders , are unwilling to face volatile electricity prices, and perceive as unfair price differentiations based on location . For these reasons, nodal prices in distribution networks are rarely employed. However, the increasing availability of renewable resources in distribution grids, and emerging price-elastic behaviour, pave the way for the effective introduction of marginal nodal pricing schemes in distribution networks. The aim of the proposed framework is to show how traditional non-flexible consumers can coexist with flexible users in a local distribution area , where the latter pay nodal prices whereas the former are charged a fixed price , which is derived by the underlying nodal prices. In addition, it determines how the distribution system operator should manage the local grid by optimally determining the lines to be expanded, and the collected network tariff levied on network users, while accounting for both congestion rent and investment costs. The proposed framework is formulated as a non-linear integer bilevel model , which is then recast as an equivalent single optimization problem, by using integer algebra and complementarity relations. The power flows in the distribution area are modelled by resorting to a second-order cone relaxation, whose solution is exact for radial networks under mild assumptions. The final model results in a mixed-integer quadratically constrained program, which can be solved with off-the-shelf solvers. Numerical test cases based on a 5-bus and a 33-bus networks are reported to show the effectiveness of the proposed method.", "after_revision": "Some consumers, particularly households , are unwilling to face volatile electricity prices, and they can perceive as unfair price differentiation in the same local area . For these reasons, nodal prices in distribution networks are rarely employed. However, the increasing availability of renewable resources and emerging price-elastic behaviours pave the way for the effective introduction of marginal nodal pricing schemes in distribution networks. The aim of the proposed framework is to show how traditional non-flexible consumers can coexist with flexible users in a local distribution area . Flexible users will pay nodal prices , whereas non-flexible consumers will be charged a fixed price derived from the underlying nodal prices. Moreover, the developed approach shows how a distribution system operator should manage the local grid by optimally determining the lines to be expanded, and the collected network tariff levied on grid users, while accounting for both congestion rent and investment costs. The proposed model is formulated as a non-linear integer bilevel program , which is then recast as an equivalent single optimization problem, by using integer algebra and complementarity relations. The power flows in the distribution area are modelled by resorting to a second-order cone relaxation, whose solution is exact for radial networks under mild assumptions. The final model results in a mixed-integer quadratically constrained program, which can be solved with off-the-shelf solvers. Numerical test cases based on both 5-bus and 33-bus networks are reported to show the effectiveness of the proposed method.", "edit_actions": [{"type": "R", "before": "such as householders", "after": "particularly households", "start_char_pos": 16, "end_char_pos": 36}, {"type": "A", "before": null, "after": "they can", "start_char_pos": 94, "end_char_pos": 94}, {"type": "R", "before": "differentiations based on location", "after": "differentiation in the same local area", "start_char_pos": 120, "end_char_pos": 154}, {"type": "D", "before": "in distribution grids,", "after": null, "start_char_pos": 295, "end_char_pos": 317}, {"type": "R", "before": "behaviour,", "after": "behaviours", "start_char_pos": 345, "end_char_pos": 355}, {"type": "R", "before": ", where the latter", "after": ". Flexible users will", "start_char_pos": 605, "end_char_pos": 623}, {"type": "R", "before": "whereas the former are", "after": ", whereas non-flexible consumers will be", "start_char_pos": 641, "end_char_pos": 663}, {"type": "R", "before": ", which is derived by", "after": "derived from", "start_char_pos": 686, "end_char_pos": 707}, {"type": "R", "before": "In addition, it determines how the", "after": "Moreover, the developed approach shows how a", "start_char_pos": 737, "end_char_pos": 771}, {"type": "R", "before": "network", "after": "grid", "start_char_pos": 924, "end_char_pos": 931}, {"type": "R", "before": "framework", "after": "model", "start_char_pos": 1016, "end_char_pos": 1025}, {"type": "R", "before": "model", "after": "program", "start_char_pos": 1072, "end_char_pos": 1077}, {"type": "R", "before": "a", "after": "both", "start_char_pos": 1529, "end_char_pos": 1530}, {"type": "D", "before": "a", "after": null, "start_char_pos": 1541, "end_char_pos": 1542}], "sents_char_pos": [0, 156, 234, 459, 736, 1002, 1202, 1372, 1498]} {"doc_id": "2001.06927", "revision_depth": "1", "before_revision": "Existing VQA datasets contain questions with varying levels of complexity. While the majority of questions in these datasets require perception for recognizing existence, properties, and spatial relationships of entities, a significant portion of questions pose challenges that correspond to reasoning tasks -- tasks that can only be answered through a synthesis of perception and knowledge about the world, logic and / or reasoning. This distinction allows us to notice when existing VQA models have consistency issues -- they answer the reasoning question correctly but fail on associated low-level perception questions. For example, models answer the complex reasoning question \"Is the banana ripe enough to eat?\" correctly, but fail on the associated perception question \"Are the bananas mostly green or yellow?\" indicating that the model likely answered the reasoning question correctly but for the wrong reason. We quantify the extent to which this phenomenon occurs by creating a new Reasoning split of the VQA dataset and collecting Sub-VQA , a new dataset consisting of 200K new perception questions which serve as sub questions corresponding to the set of perceptual tasks needed to effectively answer the complex reasoning questions in the Reasoning split. Additionally, we propose an approach called Sub-Question Importance-aware Network Tuning (SQuINT), which encourages the model to attend do the same parts of the image when answering the reasoning question and the perception sub questions . We show that SQuINT improves model consistency by 7.8 \\%, also marginally improving its performance on the Reasoning questions in VQA, while also displaying qualitatively better attention maps.", "after_revision": "Existing VQA datasets contain questions with varying levels of complexity. While the majority of questions in these datasets require perception for recognizing existence, properties, and spatial relationships of entities, a significant portion of questions pose challenges that correspond to reasoning tasks - tasks that can only be answered through a synthesis of perception and knowledge about the world, logic and / or reasoning. Analyzing performance across this distinction allows us to notice when existing VQA models have consistency issues ; they answer the reasoning questions correctly but fail on associated low-level perception questions. For example, in Figure 1, models answer the complex reasoning question \"Is the banana ripe enough to eat?\" correctly, but fail on the associated perception question \"Are the bananas mostly green or yellow?\" indicating that the model likely answered the reasoning question correctly but for the wrong reason. We quantify the extent to which this phenomenon occurs by creating a new Reasoning split of the VQA dataset and collecting VQA-introspect , a new dataset1 which consists of 238K new perception questions which serve as sub questions corresponding to the set of perceptual tasks needed to effectively answer the complex reasoning questions in the Reasoning split. Our evaluation shows that state-of-the-art VQA models have comparable performance in answering perception and reasoning questions, but suffer from consistency problems. To address this shortcoming, we propose an approach called Sub-Question Importance-aware Network Tuning (SQuINT), which encourages the model to attend to the same parts of the image when answering the reasoning question and the perception sub question . We show that SQuINT improves model consistency by ~5 \\%, also marginally improving performance on the Reasoning questions in VQA, while also displaying better attention maps.", "edit_actions": [{"type": "R", "before": "--", "after": "-", "start_char_pos": 308, "end_char_pos": 310}, {"type": "R", "before": "This", "after": "Analyzing performance across this", "start_char_pos": 434, "end_char_pos": 438}, {"type": "R", "before": "--", "after": ";", "start_char_pos": 520, "end_char_pos": 522}, {"type": "R", "before": "question", "after": "questions", "start_char_pos": 549, "end_char_pos": 557}, {"type": "A", "before": null, "after": "in Figure 1,", "start_char_pos": 636, "end_char_pos": 636}, {"type": "R", "before": "Sub-VQA", "after": "VQA-introspect", "start_char_pos": 1042, "end_char_pos": 1049}, {"type": "R", "before": "dataset consisting of 200K", "after": "dataset1 which consists of 238K", "start_char_pos": 1058, "end_char_pos": 1084}, {"type": "R", "before": "Additionally,", "after": "Our evaluation shows that state-of-the-art VQA models have comparable performance in answering perception and reasoning questions, but suffer from consistency problems. To address this shortcoming,", "start_char_pos": 1269, "end_char_pos": 1282}, {"type": "R", "before": "do", "after": "to", "start_char_pos": 1405, "end_char_pos": 1407}, {"type": "R", "before": "questions", "after": "question", "start_char_pos": 1497, "end_char_pos": 1506}, {"type": "R", "before": "7.8", "after": "~5", "start_char_pos": 1559, "end_char_pos": 1562}, {"type": "D", "before": "its", "after": null, "start_char_pos": 1593, "end_char_pos": 1596}, {"type": "D", "before": "qualitatively", "after": null, "start_char_pos": 1666, "end_char_pos": 1679}], "sents_char_pos": [0, 74, 433, 622, 918, 1268, 1508]} {"doc_id": "2001.07676", "revision_depth": "1", "before_revision": "Some NLP tasks can be solved in a fully unsupervised fashion by providing a pretrained language model with \"task descriptions\" in natural language (e.g., Radford et al., 2019). While this approach underperforms its supervised counterpart, we show in this work that the two ideas can be combined: We introduce Pattern-Exploiting Training (PET), a semi-supervised training procedure that reformulates input examples as cloze-style phrases which help the language model understand the given task. Theses phrases are then used to assign soft labels to a large set of unlabeled examples. Finally, regular supervised training is performed on the resulting training set. On several tasks , we show that PET outperforms both supervised training and unsupervised approaches in low-resource settings by a large margin.", "after_revision": "Some NLP tasks can be solved in a fully unsupervised fashion by providing a pretrained language model with \"task descriptions\" in natural language (e.g., Radford et al., 2019). While this approach underperforms its supervised counterpart, we show in this work that the two ideas can be combined: We introduce Pattern-Exploiting Training (PET), a semi-supervised training procedure that reformulates input examples as cloze-style phrases to help language models understand a given task. These phrases are then used to assign soft labels to a large set of unlabeled examples. Finally, regular supervised training is performed on the resulting training set. For several tasks and languages, PET outperforms both supervised training and unsupervised approaches in low-resource settings by a large margin.", "edit_actions": [{"type": "R", "before": "which help the language model understand the", "after": "to help language models understand a", "start_char_pos": 437, "end_char_pos": 481}, {"type": "R", "before": "Theses", "after": "These", "start_char_pos": 494, "end_char_pos": 500}, {"type": "R", "before": "On several tasks , we show that", "after": "For several tasks and languages,", "start_char_pos": 664, "end_char_pos": 695}], "sents_char_pos": [0, 176, 493, 582, 663]} {"doc_id": "2001.08349", "revision_depth": "1", "before_revision": "Recent advances in brain recording technology and artificial intelligence are propelling a new paradigm in neuroscience beyond the traditional controlled experiment. Naturalistic neuroscience studies neural computations associated with spontaneous behaviors performed in unconstrained settings. Analyzing such unstructured data lacking a priori experimental design remains a significant challenge, especially when the data is multi-modal and long-term. Here we describe an automated approach for analyzing large (%DIFDELCMD < \\approx250 %%% GB/subject) datasets of simultaneously recorded human electrocorticography (ECoG) and naturalistic behavior video data for 12 subjects . Our pipeline discovers and annotates thousands of instances of human upper-limb movement events in long-term (7--9 day) naturalistic behavior data using a combination of computer vision, discrete latent-variable modeling, and string pattern-matching . Analysis of the simultaneously recorded brain data uncovers neural signatures of movement that corroborate prior findings from traditional controlled experiments. We also prototype a decoder for a movement initiation detection task to demonstrate the efficacy of our pipeline as a source of training data for brain-computer interfacing applications. We plan to publish our curated dataset, which captures naturalistic neural and behavioral variability at a scale not previously available . We believe this data will enable further research on models of neural function and decoding that incorporate such naturalistic variability and perform more robustly in real-world settings .", "after_revision": "Recent technological advances in brain recording and artificial intelligence are propelling a new paradigm in neuroscience beyond the traditional controlled experiment. Rather than focusing on cued, repeated trials, naturalistic neuroscience studies neural processes underlying spontaneous behaviors performed in unconstrained settings. However, analyzing such unstructured data lacking a priori experimental design remains a significant challenge, especially when the data is multi-modal and long-term. Here we describe an automated approach for analyzing %DIFDELCMD < \\approx250 %%% simultaneously recorded long-term, naturalistic electrocorticography (ECoG) and naturalistic behavior video data . We take a behavior-first approach to analyzing the long-term recordings. Using a combination of computer vision, discrete latent-variable modeling, and string pattern-matching on the behavioral video data, we find and annotate spontaneous human upper-limb movement events. We show results from our approach applied to data collected for 12 human subjects over 7--9 days for each subject . Our pipeline discovers and annotates over 40,000 instances of naturalistic human upper-limb movement events in the behavioral videos . Analysis of the simultaneously recorded brain data reveals neural signatures of movement that corroborate prior findings from traditional controlled experiments. We also prototype a decoder for a movement initiation detection task to demonstrate the efficacy of our pipeline as a source of training data for brain-computer interfacing applications. Our work addresses the unique data analysis challenges in studying naturalistic human behaviors, and contributes methods that may generalize to other neural recording modalities beyond ECoG. We publicly release our curated dataset, providing a resource to study naturalistic neural and behavioral variability at a scale not previously available .", "edit_actions": [{"type": "A", "before": null, "after": "technological", "start_char_pos": 7, "end_char_pos": 7}, {"type": "D", "before": "technology", "after": null, "start_char_pos": 36, "end_char_pos": 46}, {"type": "R", "before": "Naturalistic", "after": "Rather than focusing on cued, repeated trials, naturalistic", "start_char_pos": 167, "end_char_pos": 179}, {"type": "R", "before": "computations associated with", "after": "processes underlying", "start_char_pos": 208, "end_char_pos": 236}, {"type": "R", "before": "Analyzing", "after": "However, analyzing", "start_char_pos": 296, "end_char_pos": 305}, {"type": "D", "before": "large (", "after": null, "start_char_pos": 507, "end_char_pos": 514}, {"type": "R", "before": "GB/subject) datasets of simultaneously recorded human", "after": "simultaneously recorded long-term, naturalistic", "start_char_pos": 542, "end_char_pos": 595}, {"type": "A", "before": null, "after": ". We take a behavior-first approach to analyzing the long-term recordings. Using a combination of computer vision, discrete latent-variable modeling, and string pattern-matching on the behavioral video data, we find and annotate spontaneous human upper-limb movement events. We show results from our approach applied to data collected", "start_char_pos": 661, "end_char_pos": 661}, {"type": "R", "before": "subjects", "after": "human subjects over 7--9 days for each subject", "start_char_pos": 669, "end_char_pos": 677}, {"type": "R", "before": "thousands of instances of", "after": "over 40,000 instances of naturalistic", "start_char_pos": 717, "end_char_pos": 742}, {"type": "R", "before": "long-term (7--9 day) naturalistic behavior data using a combination of computer vision, discrete latent-variable modeling, and string pattern-matching", "after": "the behavioral videos", "start_char_pos": 779, "end_char_pos": 929}, {"type": "R", "before": "uncovers", "after": "reveals", "start_char_pos": 983, "end_char_pos": 991}, {"type": "R", "before": "We plan to publish", "after": "Our work addresses the unique data analysis challenges in studying naturalistic human behaviors, and contributes methods that may generalize to other neural recording modalities beyond ECoG. We publicly release", "start_char_pos": 1282, "end_char_pos": 1300}, {"type": "R", "before": "which captures", "after": "providing a resource to study", "start_char_pos": 1322, "end_char_pos": 1336}, {"type": "D", "before": ". We believe this data will enable further research on models of neural function and decoding that incorporate such naturalistic variability and perform more robustly in real-world settings", "after": null, "start_char_pos": 1420, "end_char_pos": 1609}], "sents_char_pos": [0, 166, 295, 453, 679, 931, 1094, 1281, 1421]} {"doc_id": "2001.08503", "revision_depth": "1", "before_revision": "A collaborative network is a social network that is comprised of experts who cooperate with each other to fulfill a special goal. Analyzing the graph of this network yields meaningful information about the expertise of these experts and their subject areas. To perform the analysis, graph embedding techniques have emerged as a promising tool. Graph embedding attempts to represent graph nodes as low-dimensional vectors. In this paper, we propose a graph embedding method, called ExEm, which using dominating-set theory and deep learning approaches . In the proposed method, the dominating set theory is applied to the collaborative network and dominating nodes of this network are found. After that, a set of random walks is created which starts from dominating nodes(experts). The main condition for constricting these random walks is the existence of another dominating node . After making the walks that satisfy the stated conditions, they are stored as a sequence in a corpus. In the next step, the corpus is fed to the SKIP-GRAM neural network model. Word2vec, fastText and their combination are employed to train the neural network of the SKIP-GRAM model. Finally, the result is the low dimensional vectors of experts, called expert embeddings. Expert embeddings can be used for various purposes including accurately modeling experts' expertise or computing experts' scores in expert recommendation systems. Hence, we also introduce a novel strategy to calculate experts' scores by using the extracted expert embedding vectors. The effectiveness of ExEm is validated through assessing its performance on multi-label classification, link prediction, and recommendation tasks . We conduct extensive experiments on common datasets . Moreover in this study, we present data related to a co-author network formed by crawling the vast author profiles from Scopus .", "after_revision": "A collaborative network is a social network that is comprised of experts who cooperate with each other to fulfill a special goal. Analyzing this network yields meaningful information about the expertise of these experts and their subject areas. To perform the analysis, graph embedding techniques have emerged as an effective and promising tool. Graph embedding attempts to represent graph nodes as low-dimensional vectors. In this paper, we propose a graph embedding method, called ExEm, that uses dominating-set theory and deep learning approaches to capture node representations. ExEm finds dominating nodes of the collaborative network and constructs intelligent random walks that comprise of at least two dominating nodes. One dominating node should appear at the beginning of each path sampled to characterize the local neighborhoods. Moreover, the second dominating node reflects the global structure information. To learn the node embeddings, ExEm exploits three embedding methods including Word2vec, fastText and the concatenation of these two. The final result is the low-dimensional vectors of experts, called expert embeddings. The extracted expert embeddings can be applied to many applications. In order to extend these embeddings into the expert recommendation system, we introduce a novel strategy that uses expert vectors to calculate experts' scores and recommend experts. At the end, we conduct extensive experiments to validate the effectiveness of ExEm through assessing its performance over the multi-label classification, link prediction, and recommendation tasks on common datasets and our collected data formed by crawling the vast author Scopus profiles. The experiments show that ExEm outperforms the baselines especially in dense networks .", "edit_actions": [{"type": "D", "before": "the graph of", "after": null, "start_char_pos": 140, "end_char_pos": 152}, {"type": "R", "before": "a", "after": "an effective and", "start_char_pos": 326, "end_char_pos": 327}, {"type": "R", "before": "which using", "after": "that uses", "start_char_pos": 487, "end_char_pos": 498}, {"type": "R", "before": ". In the proposed method, the dominating set theory is applied to", "after": "to capture node representations. ExEm finds dominating nodes of", "start_char_pos": 550, "end_char_pos": 615}, {"type": "R", "before": "dominating nodes of this network are found. After that, a set of random walks is created which starts from dominating nodes(experts). The main condition for constricting these random walks is the existence of another dominating node . After making the walks that satisfy the stated conditions, they are stored as a sequence in a corpus. In the next step, the corpus is fed to the SKIP-GRAM neural network model.", "after": "constructs intelligent random walks that comprise of at least two dominating nodes. One dominating node should appear at the beginning of each path sampled to characterize the local neighborhoods. Moreover, the second dominating node reflects the global structure information. To learn the node embeddings, ExEm exploits three embedding methods including", "start_char_pos": 646, "end_char_pos": 1057}, {"type": "D", "before": "their combination are employed to train the neural network of", "after": null, "start_char_pos": 1081, "end_char_pos": 1142}, {"type": "R", "before": "SKIP-GRAM model. Finally, the", "after": "concatenation of these two. The final", "start_char_pos": 1147, "end_char_pos": 1176}, {"type": "R", "before": "low dimensional", "after": "low-dimensional", "start_char_pos": 1191, "end_char_pos": 1206}, {"type": "R", "before": "Expert", "after": "The extracted expert", "start_char_pos": 1253, "end_char_pos": 1259}, {"type": "R", "before": "used for various purposes including accurately modeling experts' expertise or computing experts' scores in expert recommendation systems. Hence, we also", "after": "applied to many applications. In order to extend these embeddings into the expert recommendation system, we", "start_char_pos": 1278, "end_char_pos": 1430}, {"type": "A", "before": null, "after": "that uses expert vectors", "start_char_pos": 1458, "end_char_pos": 1458}, {"type": "R", "before": "by using the extracted expert embedding vectors. The", "after": "and recommend experts. At the end, we conduct extensive experiments to validate the", "start_char_pos": 1488, "end_char_pos": 1540}, {"type": "D", "before": "is validated", "after": null, "start_char_pos": 1563, "end_char_pos": 1575}, {"type": "R", "before": "on", "after": "over the", "start_char_pos": 1610, "end_char_pos": 1612}, {"type": "D", "before": ". We conduct extensive experiments", "after": null, "start_char_pos": 1683, "end_char_pos": 1717}, {"type": "R", "before": ". Moreover in this study, we present data related to a co-author network", "after": "and our collected data", "start_char_pos": 1737, "end_char_pos": 1809}, {"type": "R", "before": "profiles from Scopus", "after": "Scopus profiles. The experiments show that ExEm outperforms the baselines especially in dense networks", "start_char_pos": 1845, "end_char_pos": 1865}], "sents_char_pos": [0, 129, 257, 343, 421, 551, 689, 779, 880, 982, 1057, 1163, 1252, 1415, 1536, 1684, 1738]} {"doc_id": "2001.08604", "revision_depth": "1", "before_revision": "Recent works have shown that generative data augmentation, where synthetic samples generated from deep generative models are used to augment the training dataset, benefit certain NLP tasks. In this work, we extend this approach to the task of dialogue state tracking for goal-oriented dialogues, in which the data naturally exhibits a hierarchical structure over utterances and related annotations . Deep generative data augmentation for dialogue state tracking requires the generative model to be aware of the hierarchically structured data . We propose Variational Hierarchical Dialog Autoencoder (VHDA) for modeling various aspects of goal-oriented dialogues , including linguistic and underlying annotation structures. Our experiments show that our model is able to generate realistic and novel samples that improve the robustness of state-of-the-art dialogue state trackers, ultimately improving their final dialogue state tracking performances on several datasets .", "after_revision": "Recent works have shown that generative data augmentation, where synthetic samples generated from deep generative models are used to augment the training dataset, benefit certain NLP tasks. In this work, we extend this approach to the task of dialog state tracking for goal-oriented dialogs. Since, goal-oriented dialogs naturally exhibit a hierarchical structure over utterances and related annotations , deep generative data augmentation for the task requires the generative model to be aware of the hierarchical nature . We propose the Variational Hierarchical Dialog Autoencoder (VHDA) for modeling complete aspects of goal-oriented dialogs , including linguistic features and underlying structured annotations, namely dialog acts and goals. We also propose two training policies to mitigate issues that arise with training VAE-based models. Experiments show that our hierarchical model is able to generate realistic and novel samples that improve the robustness of state-of-the-art dialog state trackers, ultimately improving the dialog state tracking performances on various dialog domains. Surprisingly, the ability to jointly generate dialog features enables our model to outperform previous state-of-the-arts in related subtasks, such as language generation and user simulation .", "edit_actions": [{"type": "R", "before": "dialogue", "after": "dialog", "start_char_pos": 243, "end_char_pos": 251}, {"type": "R", "before": "dialogues, in which the data naturally exhibits", "after": "dialogs. Since, goal-oriented dialogs naturally exhibit", "start_char_pos": 285, "end_char_pos": 332}, {"type": "R", "before": ". Deep", "after": ", deep", "start_char_pos": 398, "end_char_pos": 404}, {"type": "R", "before": "dialogue state tracking", "after": "the task", "start_char_pos": 438, "end_char_pos": 461}, {"type": "R", "before": "hierarchically structured data", "after": "hierarchical nature", "start_char_pos": 511, "end_char_pos": 541}, {"type": "A", "before": null, "after": "the", "start_char_pos": 555, "end_char_pos": 555}, {"type": "R", "before": "various", "after": "complete", "start_char_pos": 620, "end_char_pos": 627}, {"type": "R", "before": "dialogues", "after": "dialogs", "start_char_pos": 653, "end_char_pos": 662}, {"type": "R", "before": "and underlying annotation structures. Our experiments", "after": "features and underlying structured annotations, namely dialog acts and goals. We also propose two training policies to mitigate issues that arise with training VAE-based models. Experiments", "start_char_pos": 686, "end_char_pos": 739}, {"type": "A", "before": null, "after": "hierarchical", "start_char_pos": 754, "end_char_pos": 754}, {"type": "R", "before": "dialogue", "after": "dialog", "start_char_pos": 857, "end_char_pos": 865}, {"type": "R", "before": "their final dialogue", "after": "the dialog", "start_char_pos": 903, "end_char_pos": 923}, {"type": "R", "before": "several datasets", "after": "various dialog domains. Surprisingly, the ability to jointly generate dialog features enables our model to outperform previous state-of-the-arts in related subtasks, such as language generation and user simulation", "start_char_pos": 955, "end_char_pos": 971}], "sents_char_pos": [0, 189, 399, 543, 723]} {"doc_id": "2001.09404", "revision_depth": "1", "before_revision": "This paper proposes a new method for financial portfolio optimisation based on reducing simultaneous asset shocks across a portfolio of assets. We adopt the new semi-metrics of \\mbox{%DIFAUXCMD James2019 to determine the distance between two time series' structural breaks. We build on the optimal portfolio theory of \\mbox{%DIFAUXCMD Markowitz1952 distance between asset structural breaks , rather than portfolio variance , as our penalty function . Our experiments are promising: on synthetic data, they indicate that our proposed method does indeed diversify among time series with highly similar structural breaks . On real data, experiments illustrate that our proposed optimisation method produces higher risk-adjusted returns than mean variance portfolio optimisation. The predictive distribution is superior in every measure , producing a higher mean, lower standard deviation and less kurtosis. The main implication for this method in portfolio management is reducing simultaneous asset shocks and potentially sharp associated drawdowns , during periods of highly similar structural breaks, such as a market crisis.", "after_revision": "This paper proposes a new method for financial portfolio optimization based on reducing simultaneous asset shocks across a collection of assets. We apply recently introduced semi-metrics between finite sets to determine the distance between time series' structural breaks. Then, we build on the classical portfolio optimization theory of Markowitz and use this distance between asset structural breaks for our penalty function , rather than portfolio variance . Our experiments are promising: on synthetic data, we show that our proposed method does indeed diversify among time series with highly similar structural breaks , and enjoys advantages over existing metrics between sets . On real data, experiments illustrate that our proposed optimization method produces higher risk-adjusted returns than mean-variance portfolio optimization. Moreover, the predictive distribution is superior in every measure analyzed , producing a higher mean, lower standard deviation and lower kurtosis. The main implication for this method in portfolio management is reducing simultaneous asset shocks and potentially sharp associated drawdowns during periods of highly similar structural breaks, such as a market crisis.", "edit_actions": [{"type": "R", "before": "optimisation", "after": "optimization", "start_char_pos": 57, "end_char_pos": 69}, {"type": "R", "before": "portfolio", "after": "collection", "start_char_pos": 123, "end_char_pos": 132}, {"type": "R", "before": "adopt the new", "after": "apply recently introduced", "start_char_pos": 147, "end_char_pos": 160}, {"type": "R", "before": "of \\mbox{%DIFAUXCMD James2019", "after": "between finite sets", "start_char_pos": 174, "end_char_pos": 203}, {"type": "D", "before": "two", "after": null, "start_char_pos": 238, "end_char_pos": 241}, {"type": "R", "before": "We", "after": "Then, we", "start_char_pos": 274, "end_char_pos": 276}, {"type": "R", "before": "optimal portfolio theory of \\mbox{%DIFAUXCMD Markowitz1952", "after": "classical portfolio optimization theory of Markowitz and use this", "start_char_pos": 290, "end_char_pos": 348}, {"type": "A", "before": null, "after": "for our penalty function", "start_char_pos": 390, "end_char_pos": 390}, {"type": "D", "before": ", as our penalty function", "after": null, "start_char_pos": 424, "end_char_pos": 449}, {"type": "R", "before": "they indicate", "after": "we show", "start_char_pos": 502, "end_char_pos": 515}, {"type": "A", "before": null, "after": ", and enjoys advantages over existing metrics between sets", "start_char_pos": 619, "end_char_pos": 619}, {"type": "R", "before": "optimisation", "after": "optimization", "start_char_pos": 677, "end_char_pos": 689}, {"type": "R", "before": "mean variance portfolio optimisation. The", "after": "mean-variance portfolio optimization. Moreover, the", "start_char_pos": 740, "end_char_pos": 781}, {"type": "A", "before": null, "after": "analyzed", "start_char_pos": 835, "end_char_pos": 835}, {"type": "R", "before": "less", "after": "lower", "start_char_pos": 892, "end_char_pos": 896}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1049, "end_char_pos": 1050}], "sents_char_pos": [0, 143, 273, 451, 621, 777, 906]} {"doc_id": "2002.00895", "revision_depth": "1", "before_revision": "On the basis of the evident ability of neuronal olfactory systems to evaluate the intensity of an odorous stimulus and also recognize the identity of the odorant over a large range of concentrations, a few biologically-realistic hypotheses on some of the underlying neural processes are made. The mathematical implementation of such phenomenological postulates allows to infer quite simply a functional relationship between the mean firing-rate of the neural population and the concentration of any odorant as well as the statistical distribution of the sensitivity of any receptor neuron to any odorant across the population; both of them turn out to be power-laws and an arithmetic, testable relationship between the respective exponents naturally appears . In order to compare quantitatively the prediction of power-law dependence of population mean firing-rate on odorant concentration, a probabilistic model is created to extract information from data available in the experimental literature which, inter alia, allows to pool together several data-sets and hence increase statistical accuracy . The values of the free parameters of the model are estimated by a Bayesian maximum likelihood inference which keeps into account the prior distribution of the parameters making use of theorems from Information Geometry . The eventual goodness of fit is quantified by means of a distribution-independent test. The probabilistic model results to be accurate, thus confirming the theoretical prediction of a power-law dependence on odorant concentration. The experimental data available about the distribution of sensitivities also agree with the other predictions, though they are not statistically sufficient for a very stringent verification. The theory also suggests a possible explanation for the range of values of the exponent of the sensitivity power-law found in experiments.", "after_revision": "On the basis of the evident ability of neuronal olfactory systems to evaluate the intensity of an odorous stimulus and at the same time also recognise the identity of the odorant over a large range of concentrations, a few biologically-realistic hypotheses on some of the underlying neural processes are made. In particular, it is assumed that the receptor neurons mean firing-rate scale monotonically with odorant intensity, and that the receptor sensitivities range widely across odorants and receptor neurons hence leading to highly distributed representations of the stimuli. The mathematical implementation of the phenomenological postulates allows for inferring explicit functional relationships between some measurable quantities. It results that both the dependence of the mean firing-rate on odorant concentration and the statistical distribution of receptor sensitivity across the neuronal population are power-laws , whose respective exponents are in an arithmetic, testable relationship . In order to test quantitatively the prediction of power-law dependence of population mean firing-rate on odorant concentration, a probabilistic model is created to extract information from data available in the experimental literature . The values of the free parameters of the model are estimated by an info-geometric Bayesian maximum-likelihood inference which keeps into account the prior distribution of the parameters . The eventual goodness of fit is quantified by means of a distribution-independent test. CONTINUES", "edit_actions": [{"type": "R", "before": "also recognize", "after": "at the same time also recognise", "start_char_pos": 119, "end_char_pos": 133}, {"type": "A", "before": null, "after": "In particular, it is assumed that the receptor neurons mean firing-rate scale monotonically with odorant intensity, and that the receptor sensitivities range widely across odorants and receptor neurons hence leading to highly distributed representations of the stimuli.", "start_char_pos": 293, "end_char_pos": 293}, {"type": "R", "before": "such", "after": "the", "start_char_pos": 329, "end_char_pos": 333}, {"type": "R", "before": "to infer quite simply a functional relationship between the", "after": "for inferring explicit functional relationships between some measurable quantities. It results that both the dependence of the", "start_char_pos": 369, "end_char_pos": 428}, {"type": "R", "before": "firing-rate of the neural population and the concentration of any odorant as well as the", "after": "firing-rate on odorant concentration and the", "start_char_pos": 434, "end_char_pos": 522}, {"type": "R", "before": "the sensitivity of any receptor neuron to any odorant across the population; both of them turn out to be", "after": "receptor sensitivity across the neuronal population are", "start_char_pos": 551, "end_char_pos": 655}, {"type": "R", "before": "and", "after": ", whose respective exponents are in", "start_char_pos": 667, "end_char_pos": 670}, {"type": "D", "before": "between the respective exponents naturally appears", "after": null, "start_char_pos": 708, "end_char_pos": 758}, {"type": "R", "before": "compare", "after": "test", "start_char_pos": 773, "end_char_pos": 780}, {"type": "D", "before": "which, inter alia, allows to pool together several data-sets and hence increase statistical accuracy", "after": null, "start_char_pos": 999, "end_char_pos": 1099}, {"type": "R", "before": "a Bayesian maximum likelihood", "after": "an info-geometric Bayesian maximum-likelihood", "start_char_pos": 1166, "end_char_pos": 1195}, {"type": "D", "before": "making use of theorems from Information Geometry", "after": null, "start_char_pos": 1272, "end_char_pos": 1320}, {"type": "R", "before": "The probabilistic model results to be accurate, thus confirming the theoretical prediction of a power-law dependence on odorant concentration. The experimental data available about the distribution of sensitivities also agree with the other predictions, though they are not statistically sufficient for a very stringent verification. The theory also suggests a possible explanation for the range of values of the exponent of the sensitivity power-law found in experiments.", "after": "CONTINUES", "start_char_pos": 1411, "end_char_pos": 1883}], "sents_char_pos": [0, 292, 627, 760, 1101, 1322, 1410, 1553, 1744]} {"doc_id": "2002.01696", "revision_depth": "1", "before_revision": "The paper deals with Age of Information in a network of multiple sources and parallel servers/ queues with buffering capabilities, preemption in service and losses in served packets. The servers do not communicate between each other and the packets are dispatched through the servers according to a predefined probabilistic routing. By making use of the Stochastic Hybrid System (SHS) method, we provide a derivation of the average Age of Information of a system of two parallel servers (with and without buffer capabilities) and compare the result with that of a single queue. We show known results of packets delay in Queuing Theory do not hold for Age of Information . Unfortunately, the complexity of computing the Age of Information using the SHS method increases highly with the number of queues. We therefore provide an upper bound of the average Age of Information in a parallel server system of an arbitrary number of M/M/1/(N+1) queues and its tightness in various regimes. This upper bound allows providing a tight approximation of the Age of Information with a very low complexity .", "after_revision": "The paper deals with Age of Information (AoI) in a network of multiple sources and parallel queues with buffering capabilities, preemption in service and losses in served packets. The queues do not communicate between each other and the packets are dispatched through the queues according to a predefined probabilistic routing. By making use of the Stochastic Hybrid System (SHS) method, we provide a derivation of the average AoI of a system of two parallel queues (with and without buffer capabilities) and compare the results with those of a single queue. We show that known results of packets delay in Queuing Theory do not hold for the AoI . Unfortunately, the complexity of computing the average AoI using the SHS method increases highly with the number of queues. We therefore provide an upper bound of the average AoI in a system of an arbitrary number of M/M/1/(N+1) queues and show its tightness in various regimes. This upper bound allows providing a tight approximation of the average AoI with a very low complexity . We then provide a game framework that allows each source to determine its best probabilistic routing decision. By using Mean Field Games, we provide an analysis of the routing game framework, propose an efficient iterative method to find the routing decision of each source and prove its convergence to the desired equilibrium .", "edit_actions": [{"type": "A", "before": null, "after": "(AoI)", "start_char_pos": 40, "end_char_pos": 40}, {"type": "D", "before": "servers/", "after": null, "start_char_pos": 87, "end_char_pos": 95}, {"type": "R", "before": "servers", "after": "queues", "start_char_pos": 188, "end_char_pos": 195}, {"type": "R", "before": "servers", "after": "queues", "start_char_pos": 277, "end_char_pos": 284}, {"type": "R", "before": "Age of Information of", "after": "AoI of", "start_char_pos": 433, "end_char_pos": 454}, {"type": "R", "before": "servers", "after": "queues", "start_char_pos": 480, "end_char_pos": 487}, {"type": "R", "before": "result with that", "after": "results with those", "start_char_pos": 543, "end_char_pos": 559}, {"type": "A", "before": null, "after": "that", "start_char_pos": 587, "end_char_pos": 587}, {"type": "R", "before": "Age of Information", "after": "the AoI", "start_char_pos": 653, "end_char_pos": 671}, {"type": "R", "before": "Age of Information", "after": "average AoI", "start_char_pos": 721, "end_char_pos": 739}, {"type": "R", "before": "Age of Information in a parallel server", "after": "AoI in a", "start_char_pos": 856, "end_char_pos": 895}, {"type": "A", "before": null, "after": "show", "start_char_pos": 952, "end_char_pos": 952}, {"type": "R", "before": "Age of Information", "after": "average AoI", "start_char_pos": 1050, "end_char_pos": 1068}, {"type": "A", "before": null, "after": ". We then provide a game framework that allows each source to determine its best probabilistic routing decision. By using Mean Field Games, we provide an analysis of the routing game framework, propose an efficient iterative method to find the routing decision of each source and prove its convergence to the desired equilibrium", "start_char_pos": 1096, "end_char_pos": 1096}], "sents_char_pos": [0, 183, 333, 578, 673, 804, 986]} {"doc_id": "2002.04164", "revision_depth": "1", "before_revision": "Scaling and multiscaling financial time series have been widely studied in the literature. The research on this topic is vast and still flourishing. One way to analyse the scaling properties of time series is through the estimation of scaling exponents. These exponents are recognized as being valuable measures to discriminate between random, persistent, and anti-persistent behaviours in time series. In the literature, several methods have been proposed to study the multiscaling property and in this paper we use the generalized Hurst exponent (GHE) . On the base of this methodology, we propose a novel statistical procedure to robustly estimate and test the multiscaling property and we name it RNSGHE. This methodology , together with a combination of t-tests and F-tests to discriminated between real and spurious scaling. Moreover, we also introduce a new methodology to estimate the optimal aggregation time used in our methodology . We numerically validate our procedure on simulated time series using the Multifractal Random Walk (MRW) and then apply it to real financial data. We also present results for times series with and without anomalies and we compute the bias that such anomalies introduce in the measurement of the scaling exponents. Finally, we show how the use of proper scaling and multiscaling can ameliorate the estimation of risk measures such as Value at Risk (VaR). We also propose a methodology based on Monte Carlo simulation, that we name Multiscaling Value at Risk (MSVaR), which takes into account the statical properties of multiscaling time series. We show that by using this statistical procedure in combination with the robustly estimated multiscaling exponents, the one year forecasted MSVaR mimics the VaR on the annual data for the majority of the stocks analysed .", "after_revision": "Scaling and multiscaling financial time series have been widely studied in the literature. The research on this topic is vast and still flourishing. One way to analyze the scaling properties of time series is through the estimation of their scaling exponents, that are recognized as being valuable measures to discriminate between random, persistent, and anti-persistent behaviors in these time series. In the literature, several methods have been proposed to study the multiscaling property . In this paper, we use the generalized Hurst exponent (GHE) tool and we propose a novel statistical procedure based on GHE which we name Relative Normalized and Standardized Generalized Hurst Exponent (RNSGHE). This method is used to robustly estimate and test the multiscaling property and , together with a combination of t-tests and F-tests , serves to discriminate between real and spurious scaling. Furthermore, we introduce a new tool to estimate the optimal aggregation time used in our methodology which we name Autocororrelation Segmented Regression . We numerically validate this procedure on simulated time series by using the Multifractal Random Walk (MRW) and we then apply it to real financial data. We present results for times series with and without anomalies and we compute the bias that such anomalies introduce in the measurement of the scaling exponents. We also show how the use of proper scaling and multiscaling can ameliorate the estimation of risk measures such as Value at Risk (VaR). Finally, we propose a methodology based on Monte Carlo simulation, which we name Multiscaling Value at Risk (MSVaR), that takes into account the statistical properties of multiscaling time series. We show that by using this statistical procedure in combination with the robustly estimated multiscaling exponents, the one year forecasted MSVaR mimics the VaR on the annual data for the majority of the stocks analyzed .", "edit_actions": [{"type": "R", "before": "analyse", "after": "analyze", "start_char_pos": 160, "end_char_pos": 167}, {"type": "R", "before": "scaling exponents. These exponents", "after": "their scaling exponents, that", "start_char_pos": 235, "end_char_pos": 269}, {"type": "R", "before": "behaviours in", "after": "behaviors in these", "start_char_pos": 376, "end_char_pos": 389}, {"type": "R", "before": "and in this paper", "after": ". In this paper,", "start_char_pos": 492, "end_char_pos": 509}, {"type": "R", "before": ". On the base of this methodology,", "after": "tool and", "start_char_pos": 554, "end_char_pos": 588}, {"type": "A", "before": null, "after": "based on GHE which we name Relative Normalized and Standardized Generalized Hurst Exponent (RNSGHE). This method is used", "start_char_pos": 630, "end_char_pos": 630}, {"type": "D", "before": "we name it RNSGHE. This methodology", "after": null, "start_char_pos": 691, "end_char_pos": 726}, {"type": "R", "before": "to discriminated", "after": ", serves to discriminate", "start_char_pos": 780, "end_char_pos": 796}, {"type": "R", "before": "Moreover, we also", "after": "Furthermore, we", "start_char_pos": 832, "end_char_pos": 849}, {"type": "R", "before": "methodology", "after": "tool", "start_char_pos": 866, "end_char_pos": 877}, {"type": "A", "before": null, "after": "which we name Autocororrelation Segmented Regression", "start_char_pos": 943, "end_char_pos": 943}, {"type": "R", "before": "our", "after": "this", "start_char_pos": 970, "end_char_pos": 973}, {"type": "A", "before": null, "after": "by", "start_char_pos": 1009, "end_char_pos": 1009}, {"type": "A", "before": null, "after": "we", "start_char_pos": 1055, "end_char_pos": 1055}, {"type": "D", "before": "also", "after": null, "start_char_pos": 1097, "end_char_pos": 1101}, {"type": "R", "before": "Finally, we", "after": "We also", "start_char_pos": 1261, "end_char_pos": 1272}, {"type": "R", "before": "We also", "after": "Finally, we", "start_char_pos": 1401, "end_char_pos": 1408}, {"type": "R", "before": "that", "after": "which", "start_char_pos": 1464, "end_char_pos": 1468}, {"type": "R", "before": "which", "after": "that", "start_char_pos": 1513, "end_char_pos": 1518}, {"type": "R", "before": "statical", "after": "statistical", "start_char_pos": 1542, "end_char_pos": 1550}, {"type": "R", "before": "analysed", "after": "analyzed", "start_char_pos": 1802, "end_char_pos": 1810}], "sents_char_pos": [0, 90, 148, 253, 402, 555, 709, 831, 945, 1093, 1260, 1400, 1590]} {"doc_id": "2002.05139", "revision_depth": "1", "before_revision": "We give the first efficient algorithm for the problem of list-decodable subspace recovery . Our algorithm takes input n samples \\alpha n ( \\alpha \\ll 1/2) are generated i.i.d. from Gaussian distribution \\mathcal{N(0,\\Sigma_*) on R^d with covariance \\Sigma_* of rank r } with a isotropic rank r covariance \\Pi_* (the } and the rest are arbitrary, potentially adversarial outliers. It outputs a list of O(1/\\alpha) projection matrices guaranteed to contain a projection matrix%DIFDELCMD < \\Pisuch %%% that\\hat{\\Pi} satisfies certifiable anti-concentration. The running time of both these algorithms, however, is d^{\\Omega(1/\\alpha^4)} and the error bounds on } \\|\\Pi-\\Pi_*\\|_F ^2 = \\kappa^4 \\log (r )%DIFDELCMD < \\tilde{O}%%% (\\emph{ 1/ \\alpha^2), where%DIFDELCMD < \\tilde{O} %%% hides polylogarithmic factors in 1/ \\alpha . Here, \\Pi_* is the projection matrix to the range space of \\Sigma_*. The algorithm needs n=d ^{ \\log ( r \\kappa ) %DIFDELCMD < \\tilde{O}%%% (\\hat{\\Pi} \\hat{\\Pi} 1/ \\alpha^2) samples and runs in time n^{\\log (r \\kappa) \\tilde{O(1/\\alpha^4)} time where \\kappa is the ratio of the largest to smallest non-zero eigenvalues of \\Sigma_*. Our algorithm builds on the recently developed framework for list-decodable learning via the sum-of-squares (SoS)method }%DIFDELCMD < [%%% KKK'19, RY'20 with some key technical and conceptual advancements. Our key conceptual contribution involves showing a (SoS \"certified\") lower bound on the eigenvalues of covariances of arbitrary small subsamples of an i.i.d. sample of a certifiably anti-concentrated distribution. One of our key technical contributions gives a new method that allows error reduction \"within SoS\" with only a logarithmic cost in the exponent in the running time (in contrast to polynomial cost in%DIFDELCMD < [%%% KKK'19, RY'20 . In a concurrent and independent work , to have }\\emph{ Raghavendra and Yau proved related results for list-decodable subspace recovery RY'20 satisfies certifiable anti-concentration, we obtain a stronger error guarantee of \\|}\\hat{\\Pi} .", "after_revision": "In list-decodable subspace recovery , the input is a collection of n points \\alpha n ( for some \\alpha \\ll 1/2) of which are drawn i.i.d. from (0,\\Sigma_*) on R^d with covariance \\Sigma_* of rank r } a distribution \\mathcal{D with a isotropic rank r covariance \\Pi_* (the }inliers) and the rest are arbitrary, potential adversarial outliers. The goal is to recover a O(1/\\alpha) %DIFDELCMD < \\Pisuch %%% size list of candidate covariances that contains a\\hat{\\Pi} close to \\Pi_*. Two recent independent works (Raghavendra-Yau, Bakshi-Kothari (2020)) gave algorithms for this problem that work whenever \\mathcal{D satisfies certifiable anti-concentration. The running time of both these algorithms, however, is d^{\\Omega(1/\\alpha^4)} and the error bounds on } \\|\\Pi-\\Pi_*\\|_F %DIFDELCMD < \\tilde{O}%%% grow with r (which can be \\Omega(d)). In this work, we improve on these results on all three fronts:\\emph{dimension-independent error via a faster fixed-polynomial running time under less restrictive distributional assumptions. Specifically, we give a poly( 1/ %DIFDELCMD < \\tilde{O} %%% \\alpha ) d ^{ O ( 1 ) %DIFDELCMD < \\tilde{O}%%% time algorithm that outputs a list containing a\\hat{\\Pi} satisfying \\|\\hat{\\Pi} -\\Pi_*\\|_F \\leq O( 1/ (1/\\alpha^4)} time where \\kappa is the ratio of the largest to smallest non-zero eigenvalues of \\Sigma_*. Our algorithm builds on the recently developed framework for list-decodable learning via the sum-of-squares (SoS)method }%DIFDELCMD < [%%% %DIFDELCMD < [%%% \\alpha). Our result only needs \\mathcal{D to have }\\emph{certifiably hypercontractive degree 2 polynomials - a condition satisfied by a much broader family of distributions in contrast to certifiable anticoncentration. As a result, in addition to Gaussians, our algorithm applies to uniform distribution on the hypercube and q-ary cubes and arbitrary product distributions with subgaussian marginals. Prior work ( Raghavendra and Yau , 2020) had identified such distributions as potential hard examples as such distributions do not exhibit strong enough anti-concentration. When \\mathcal{D satisfies certifiable anti-concentration, we obtain a stronger error guarantee of \\|}\\hat{\\Pi}-\\Pi_*\\|_F \\leq \\eta for any arbitrary \\eta > 0 in d^{O(poly(1/\\alpha) + \\log (1/\\eta)) .", "edit_actions": [{"type": "R", "before": "We give the first efficient algorithm for the problem of", "after": "In", "start_char_pos": 0, "end_char_pos": 56}, {"type": "R", "before": ". Our algorithm takes input n samples", "after": ", the input is a collection of n points", "start_char_pos": 90, "end_char_pos": 127}, {"type": "A", "before": null, "after": "for some", "start_char_pos": 139, "end_char_pos": 139}, {"type": "R", "before": "are generated", "after": "of which are drawn", "start_char_pos": 156, "end_char_pos": 169}, {"type": "D", "before": "Gaussian distribution \\mathcal{N", "after": null, "start_char_pos": 182, "end_char_pos": 214}, {"type": "A", "before": null, "after": "a distribution \\mathcal{D", "start_char_pos": 271, "end_char_pos": 271}, {"type": "A", "before": null, "after": "inliers", "start_char_pos": 319, "end_char_pos": 319}, {"type": "A", "before": null, "after": ")", "start_char_pos": 319, "end_char_pos": 319}, {"type": "R", "before": "potentially", "after": "potential", "start_char_pos": 348, "end_char_pos": 359}, {"type": "R", "before": "It outputs a list of", "after": "The goal is to recover a", "start_char_pos": 382, "end_char_pos": 402}, {"type": "D", "before": "projection matrices guaranteed to contain a projection matrix", "after": null, "start_char_pos": 415, "end_char_pos": 476}, {"type": "R", "before": "that", "after": "size list of candidate covariances that contains a", "start_char_pos": 501, "end_char_pos": 505}, {"type": "A", "before": null, "after": "close to \\Pi_*. Two recent independent works (Raghavendra-Yau, Bakshi-Kothari (2020)) gave algorithms for this problem that work whenever \\mathcal{D", "start_char_pos": 515, "end_char_pos": 515}, {"type": "D", "before": "^2 = \\kappa^4 \\log (r )", "after": null, "start_char_pos": 678, "end_char_pos": 701}, {"type": "R", "before": "(", "after": "grow with r (which can be \\Omega(d)). In this work, we improve on these results on all three fronts:", "start_char_pos": 727, "end_char_pos": 728}, {"type": "A", "before": null, "after": "dimension-independent", "start_char_pos": 734, "end_char_pos": 734}, {"type": "A", "before": null, "after": "error via a faster fixed-polynomial running time under less restrictive distributional assumptions. Specifically, we give a poly(", "start_char_pos": 735, "end_char_pos": 735}, {"type": "D", "before": "\\alpha^2), where", "after": null, "start_char_pos": 739, "end_char_pos": 755}, {"type": "D", "before": "hides polylogarithmic factors in 1/", "after": null, "start_char_pos": 782, "end_char_pos": 817}, {"type": "R", "before": ". Here, \\Pi_* is the projection matrix to the range space of \\Sigma_*. The algorithm needs n=d", "after": ") d", "start_char_pos": 825, "end_char_pos": 919}, {"type": "R", "before": "\\log", "after": "O", "start_char_pos": 923, "end_char_pos": 927}, {"type": "R", "before": "r \\kappa", "after": "1", "start_char_pos": 930, "end_char_pos": 938}, {"type": "R", "before": "(", "after": "time algorithm that outputs a list containing a", "start_char_pos": 967, "end_char_pos": 968}, {"type": "A", "before": null, "after": "satisfying \\|", "start_char_pos": 978, "end_char_pos": 978}, {"type": "A", "before": null, "after": "-\\Pi_*\\|_F \\leq O(", "start_char_pos": 988, "end_char_pos": 988}, {"type": "D", "before": "\\alpha^2)", "after": null, "start_char_pos": 992, "end_char_pos": 1001}, {"type": "D", "before": "samples and runs in time n^{\\log (r \\kappa) \\tilde{O", "after": null, "start_char_pos": 1002, "end_char_pos": 1054}, {"type": "D", "before": "KKK'19, RY'20", "after": null, "start_char_pos": 1299, "end_char_pos": 1312}, {"type": "D", "before": "with some key technical and conceptual advancements. Our key conceptual contribution involves showing a (SoS \"certified\") lower bound on the eigenvalues of covariances of arbitrary small subsamples of an i.i.d. sample of a certifiably anti-concentrated distribution. One of our key technical contributions gives a new method that allows error reduction \"within SoS\" with only a logarithmic cost in the exponent in the running time (in contrast to polynomial cost in", "after": null, "start_char_pos": 1313, "end_char_pos": 1778}, {"type": "D", "before": "KKK'19, RY'20", "after": null, "start_char_pos": 1796, "end_char_pos": 1809}, {"type": "R", "before": ". In a concurrent and independent work ,", "after": "\\alpha). Our result only needs \\mathcal{D", "start_char_pos": 1810, "end_char_pos": 1850}, {"type": "A", "before": null, "after": "certifiably hypercontractive", "start_char_pos": 1866, "end_char_pos": 1866}, {"type": "A", "before": null, "after": "degree 2 polynomials - a condition satisfied by a much broader family of distributions in contrast to certifiable anticoncentration. As a result, in addition to Gaussians, our algorithm applies to uniform distribution on the hypercube and q-ary cubes and arbitrary product distributions with subgaussian marginals. Prior work (", "start_char_pos": 1867, "end_char_pos": 1867}, {"type": "D", "before": "proved related results for list-decodable subspace recovery", "after": null, "start_char_pos": 1888, "end_char_pos": 1947}, {"type": "R", "before": "RY'20", "after": ", 2020) had identified such distributions as potential hard examples as such distributions do not exhibit strong enough anti-concentration. When \\mathcal{D", "start_char_pos": 1948, "end_char_pos": 1953}, {"type": "A", "before": null, "after": "-\\Pi_*\\|_F \\leq \\eta for any arbitrary \\eta > 0 in d^{O(poly(1/\\alpha) + \\log (1/\\eta))", "start_char_pos": 2048, "end_char_pos": 2048}], "sents_char_pos": [0, 91, 381, 557, 826, 895, 1159, 1365, 1579]} {"doc_id": "2002.05619", "revision_depth": "1", "before_revision": "Recurrent spiking neural networks (RSNN) in the brain learn to perform a wide range of perceptual, cognitive and motor tasks very efficiently in terms of time and energy consumption. This is due to the optimality of coding and learning schemes, which have yet to be unveiled. The formulation of biologically inspired networks capable to perform complex computations can mediate a synergetic interaction between Machine Learning and Neuroscience bringing to mutual benefits and helping to improve our understanding of biological and artificial intelligence. Even though several models have been proposed , it remains a challenging task to design RSNNs which use biologically plausible mechanisms . We propose a general probabilistic framework which relies on the principle of maximizing the likelihood for the network to solve the task . This principle permits to analytically work out an explicit and completely local plasticity rulesupporting the efficient solution of several tasks. We show that the learning algorithm can be achieved in a very few iterations, and that the online approximation of the likelihood maximization is extremely beneficial to fast learning . Our model is very general and it can be applied to a wide variety of network architectures and types of biological neurons. The derived plasticity learning rule is specific to each neuron model producing a theoretical prediction which can be verified experimentally .", "after_revision": "Recurrent spiking neural networks (RSNN) in the brain learn to perform a wide range of perceptual, cognitive and motor tasks very efficiently in terms of time and energy consumption. Moreover, learning can happen rapidly after very few examples. This is due to the optimality of coding and learning schemes, which have yet to be clearly understood. This naturally challenges the formulation of biologically inspired RSNNs in order to improve our understanding of biological intelligence and the efficiency of artificial ones. Several spiking network models have been proposed but it remains a challenge to design RSNNs that use biologically plausible mechanisms capable of solving complex temporal tasks. We use a general probabilistic framework that relies on the principle of maximizing the likelihood for the network to reproduce some temporal dynamics . This principle permits to analytically work out an explicit and biologically plausible plasticity rule. Here we propose a novel target-based learning scheme in which such a rule can be used to efficiently train a RSNN to solve several temporal tasks such as learning multidimensional trajectory and an implementation of the temporal XOR. We finally show that an online approximation of the gradient ascent, in addition to guaranteeing complete locality in time and space, allows learning after very few presentations of the target output . Our model is general and it can be applied to a wide variety of network architectures and types of biological neurons. The derived plasticity learning rule is specific to each neuron model and can produce a theoretical prediction to be experimentally verified .", "edit_actions": [{"type": "A", "before": null, "after": "Moreover, learning can happen rapidly after very few examples.", "start_char_pos": 183, "end_char_pos": 183}, {"type": "R", "before": "unveiled. The", "after": "clearly understood. This naturally challenges the", "start_char_pos": 267, "end_char_pos": 280}, {"type": "R", "before": "networks capable to perform complex computations can mediate a synergetic interaction between Machine Learning and Neuroscience bringing to mutual benefits and helping to", "after": "RSNNs in order to", "start_char_pos": 318, "end_char_pos": 488}, {"type": "R", "before": "and artificial intelligence. Even though several", "after": "intelligence and the efficiency of artificial ones. Several spiking network", "start_char_pos": 529, "end_char_pos": 577}, {"type": "R", "before": ",", "after": "but", "start_char_pos": 604, "end_char_pos": 605}, {"type": "R", "before": "challenging task", "after": "challenge", "start_char_pos": 619, "end_char_pos": 635}, {"type": "R", "before": "which", "after": "that", "start_char_pos": 652, "end_char_pos": 657}, {"type": "R", "before": ". We propose", "after": "capable of solving complex temporal tasks. We use", "start_char_pos": 696, "end_char_pos": 708}, {"type": "R", "before": "which", "after": "that", "start_char_pos": 743, "end_char_pos": 748}, {"type": "R", "before": "solve the task", "after": "reproduce some temporal dynamics", "start_char_pos": 821, "end_char_pos": 835}, {"type": "R", "before": "completely local plasticity rulesupporting the efficient solution of several tasks. We show that the learning algorithm can be achieved in a very few iterations, and that the", "after": "biologically plausible plasticity rule. Here we propose a novel target-based learning scheme in which such a rule can be used to efficiently train a RSNN to solve several temporal tasks such as learning multidimensional trajectory and an implementation of the temporal XOR. We finally show that an", "start_char_pos": 902, "end_char_pos": 1076}, {"type": "R", "before": "likelihood maximization is extremely beneficial to fast learning", "after": "gradient ascent, in addition to guaranteeing complete locality in time and space, allows learning after very few presentations of the target output", "start_char_pos": 1105, "end_char_pos": 1169}, {"type": "D", "before": "very", "after": null, "start_char_pos": 1185, "end_char_pos": 1189}, {"type": "R", "before": "producing", "after": "and can produce", "start_char_pos": 1366, "end_char_pos": 1375}, {"type": "R", "before": "which can be verified experimentally", "after": "to be experimentally verified", "start_char_pos": 1401, "end_char_pos": 1437}], "sents_char_pos": [0, 182, 276, 557, 697, 837, 985, 1171, 1295]} {"doc_id": "2002.06947", "revision_depth": "1", "before_revision": "Hadwiger and Debrunner showed that for families of convex sets in R^d with the property that among any p of them some q have a common point, the whole family can be stabbed with p-q+1 points if p \\geq q \\geq d+1 and (d-1)p < d(q-1). This generalizes a classical result by Helly. We show how such a stabbing set can be computed for n convex polygons of constant size in the plane in O((p-q+1)n^{4/3}\\log^{ 2 + \\epsilon (n ) + p^2\\log(p) ) expected time. For convex polyhedra in R^3, the method yields an algorithm running in O((p-q+1)n^{ 13/ 5 +\\epsilon } n(\\log\\log n)^{1/6} } + p^4 ) expected time. We also show that analogous results of the Hadwiger and Debrunner (p,q)-theorem hold in other settings, such as convex sets in \\mathbb{R}^d\\times\\mathbb{Z}^k or abstract convex geometries.", "after_revision": "Hadwiger and Debrunner showed that for families of convex sets in R^d with the property that among any p of them some q have a common point, the whole family can be stabbed with p-q+1 points if p \\geq q \\geq d+1 and (d-1)p < d(q-1). This generalizes a classical result by Helly. We show how such a stabbing set can be computed for a family of convex polygons in the plane with a total of n vertices in O((p-q+1)n^{4/3}\\log^{ 8 n(\\log\\log n)^{1/3 + np^2 ) expected time. For polyhedra in R^3, we get an algorithm running in O((p-q+1)n^{ 5 /2 } \\log^{10 n(\\log\\log n)^{1/6} } + np^3 ) expected time. We also investigate other conditions on convex polygons for which our algorithm can find a fixed number of points stabbing them. Finally, we show that analogous results of the Hadwiger and Debrunner (p,q)-theorem hold in other settings, such as convex sets in \\mathbb{R}^d\\times\\mathbb{Z}^k or abstract convex geometries.", "edit_actions": [{"type": "R", "before": "n convex polygons of constant size", "after": "a family of convex polygons", "start_char_pos": 331, "end_char_pos": 365}, {"type": "A", "before": null, "after": "with a total of n vertices", "start_char_pos": 379, "end_char_pos": 379}, {"type": "R", "before": "2", "after": "8", "start_char_pos": 406, "end_char_pos": 407}, {"type": "A", "before": null, "after": "n(\\log\\log n)^{1/3", "start_char_pos": 408, "end_char_pos": 408}, {"type": "D", "before": "\\epsilon", "after": null, "start_char_pos": 411, "end_char_pos": 419}, {"type": "R", "before": "(n", "after": "np^2", "start_char_pos": 420, "end_char_pos": 422}, {"type": "D", "before": "+ p^2\\log(p) )", "after": null, "start_char_pos": 425, "end_char_pos": 439}, {"type": "D", "before": "convex", "after": null, "start_char_pos": 459, "end_char_pos": 465}, {"type": "R", "before": "the method yields", "after": "we get", "start_char_pos": 484, "end_char_pos": 501}, {"type": "D", "before": "13/", "after": null, "start_char_pos": 539, "end_char_pos": 542}, {"type": "R", "before": "+\\epsilon", "after": "/2", "start_char_pos": 545, "end_char_pos": 554}, {"type": "A", "before": null, "after": "\\log^{10", "start_char_pos": 557, "end_char_pos": 557}, {"type": "R", "before": "p^4", "after": "np^3", "start_char_pos": 582, "end_char_pos": 585}, {"type": "A", "before": null, "after": "investigate other conditions on convex polygons for which our algorithm can find a fixed number of points stabbing them. Finally, we", "start_char_pos": 611, "end_char_pos": 611}], "sents_char_pos": [0, 232, 278, 454, 602]} {"doc_id": "2002.07611", "revision_depth": "1", "before_revision": " We study the maximal independent set (MIS) and maximum independent set ( MAX-IS ) problems on dynamic sets of O(n) axis-parallel rectangles, which can be modeled as dynamic rectangle intersection graphs. We consider the fully dynamic vertex update (insertion/deletion ) modelfor two types of rectangles: (i) uniform height and width and (ii) uniform height and arbitrary width . These types of dynamic vertex update problems arise, e.g., in interactive map labeling. We present the first deterministic algorithm for maintaining a MIS (and thus a 4-approximate MAX-IS ) of a dynamic set of uniform rectangles with amortized sub-logarithmic update time. This breaks the natural barrier of O (\\Delta) update time (where \\Delta is the maximum degree in the graph) for vertex updates presented by Assadi et al. (STOC 2018). We continue by investigating MAX-IS and provide a series of deterministic dynamic approximation schemes . For uniform rectangles, we first give an algorithm that maintains a 4-approximate MAX-IS with O(1) update time. In a subsequent algorithm, we establish the trade-off between approximation quality 2 (1+\\frac{1{k}) and update time O(k^2\\log n) for k\\in \\mathbb{N}. We conclude with an algorithm that maintains a 2-approximate MAX-IS for dynamic sets of uniform height and arbitrary width rectangles with O(\\omega \\log n) update time, where \\omega is the largest number of maximal cliques stabbed by any axis-parallel line} . We have implemented our algorithms and report the results of an experimental comparison exploring the trade-off between solution size and update time for synthetic and real-world map labeling data sets .", "after_revision": "Map labeling is a classical problem in cartography and geographic information systems that asks to place labels for area, line, and point features, with the goal to select and place the maximum number of independent, i.e., overlap-free, labels. A practically interesting case is point labeling with axis-parallel rectangular labels of common size. In a fully dynamic setting, at each time step, either a new label appears or an existing label disappears. Then, the challenge is to maintain a maximum cardinality subset of pairwise independent labels with sub-linear update time. We study the maximal independent set (MIS) and maximum independent set ( Max-IS ) problems on fully dynamic (insertion/deletion model) sets of axis-parallel rectangles of two types--- (i) uniform height and width and (ii) uniform height and arbitrary width ; both settings can be modeled as rectangle intersection graphs. We present the first deterministic algorithm for maintaining a MIS (and thus a 4-approximate Max-IS ) of a dynamic set of uniform rectangles with amortized sub-logarithmic update time. This breaks the natural barrier of \\Omega (\\Delta) update time (where \\Delta is the maximum degree in the graph) for vertex updates presented by Assadi et al. (STOC 2018). We continue by investigating Max-IS and provide a series of deterministic dynamic approximation schemes with approximation factors between 2 {k}) and update time O(k^2\\log n) for k\\in \\mathbb{N}. We conclude with an algorithm that maintains a 2-approximate MAX-IS for dynamic sets of uniform height and arbitrary width rectangles with O(\\omega \\log n) update time, where \\omega is the largest number of maximal cliques stabbed by any axis-parallel line} and 4 and corresponding running-time trade-offs . We have implemented our algorithms and report the results of an experimental comparison exploring the trade-off between solution quality and update time for synthetic and real-world map labeling instances .", "edit_actions": [{"type": "A", "before": null, "after": "Map labeling is a classical problem in cartography and geographic information systems that asks to place labels for area, line, and point features, with the goal to select and place the maximum number of independent, i.e., overlap-free, labels. A practically interesting case is point labeling with axis-parallel rectangular labels of common size. In a fully dynamic setting, at each time step, either a new label appears or an existing label disappears. Then, the challenge is to maintain a maximum cardinality subset of pairwise independent labels with sub-linear update time.", "start_char_pos": 0, "end_char_pos": 0}, {"type": "R", "before": "MAX-IS", "after": "Max-IS", "start_char_pos": 74, "end_char_pos": 80}, {"type": "R", "before": "dynamic sets of O(n) axis-parallel rectangles, which can be modeled as dynamic rectangle intersection graphs. We consider the fully dynamic vertex update", "after": "fully dynamic", "start_char_pos": 95, "end_char_pos": 248}, {"type": "R", "before": ") modelfor two types of rectangles:", "after": "model) sets of axis-parallel rectangles of two types---", "start_char_pos": 269, "end_char_pos": 304}, {"type": "R", "before": ". These types of dynamic vertex update problems arise, e.g., in interactive map labeling.", "after": "; both settings can be modeled as rectangle intersection graphs.", "start_char_pos": 378, "end_char_pos": 467}, {"type": "R", "before": "MAX-IS", "after": "Max-IS", "start_char_pos": 561, "end_char_pos": 567}, {"type": "R", "before": "O", "after": "\\Omega", "start_char_pos": 688, "end_char_pos": 689}, {"type": "R", "before": "MAX-IS", "after": "Max-IS", "start_char_pos": 849, "end_char_pos": 855}, {"type": "R", "before": ". For uniform rectangles, we first give an algorithm that maintains a 4-approximate MAX-IS with O(1) update time. In a subsequent algorithm, we establish the trade-off between approximation quality", "after": "with approximation factors between", "start_char_pos": 924, "end_char_pos": 1121}, {"type": "D", "before": "(1+\\frac{1", "after": null, "start_char_pos": 1124, "end_char_pos": 1134}, {"type": "A", "before": null, "after": "and 4 and corresponding running-time trade-offs", "start_char_pos": 1447, "end_char_pos": 1447}, {"type": "R", "before": "size", "after": "quality", "start_char_pos": 1579, "end_char_pos": 1583}, {"type": "R", "before": "data sets", "after": "instances", "start_char_pos": 1642, "end_char_pos": 1651}], "sents_char_pos": [0, 204, 379, 467, 652, 819, 925, 1037, 1188, 1449]} {"doc_id": "2002.07671", "revision_depth": "1", "before_revision": "Common reporting styles of statistical results, such as confidence intervals (CI), are prone to dichotomous interpretations especially on null hypothesis testing frameworks , for exampleby claiming significant differences between drug treatment and placebo groups due to the non-overlapping CIs of the mean effects , while disregarding the magnitudes and absolute difference in the effect sizes. Techniques relying on the visual estimation of the strength of evidence have been recommended to limit such dichotomous interpretations but their effectiveness has been challenged. We ran two experiments to compare several representation alternatives of confidence intervals , and used Bayesian multilevel models to estimate the effects of the representation styles on differences in subjective confidence of the results and preferences in visualization styles. Our results suggest that adding visual information to classic CI representation can decrease the sudden drop around p-value 0.05 compared to classic CIs and textual representation of CI with p-values. All data analysis and scripts are available at URL ", "after_revision": "Common reporting styles for statistical results, such as p-values and confidence intervals (CI), have been reported to be prone to dichotomous interpretations , especially with respect to null hypothesis testing frameworks . For example, when the p-value is small enough or the CIs of the mean effects of a studied drug and a placebo are not overlapping, scientists tend to claim significant differences while often disregarding the magnitudes and absolute differences in the effect sizes. Techniques relying on the visual estimation of the strength of evidence have been recommended to reduce such dichotomous interpretations but their effectiveness has also been challenged. We ran two experiments to compare several alternative representations of confidence intervals and used Bayesian multilevel models to estimate the effects of the representation styles on differences in subjective confidence in the results. We also asked the respondents' opinions and preferences in representation styles. Our results suggest that adding visual information to classic CI representation can decrease the tendency towards dichotomous interpretations - measured as the \"cliff effect\": the sudden drop in confidence around p-value 0.05 - compared with classic CI visualization and textual representation of the CI with p-values. As a contribution to open science, our data and all analyses are publicly available at URL .", "edit_actions": [{"type": "R", "before": "of", "after": "for", "start_char_pos": 24, "end_char_pos": 26}, {"type": "A", "before": null, "after": "p-values and", "start_char_pos": 56, "end_char_pos": 56}, {"type": "R", "before": "are", "after": "have been reported to be", "start_char_pos": 84, "end_char_pos": 87}, {"type": "R", "before": "especially on", "after": ", especially with respect to", "start_char_pos": 125, "end_char_pos": 138}, {"type": "R", "before": ", for exampleby claiming significant differences between drug treatment and placebo groups due to the non-overlapping", "after": ". For example, when the p-value is small enough or the", "start_char_pos": 174, "end_char_pos": 291}, {"type": "R", "before": ", while", "after": "of a studied drug and a placebo are not overlapping, scientists tend to claim significant differences while often", "start_char_pos": 316, "end_char_pos": 323}, {"type": "R", "before": "difference", "after": "differences", "start_char_pos": 365, "end_char_pos": 375}, {"type": "R", "before": "limit", "after": "reduce", "start_char_pos": 494, "end_char_pos": 499}, {"type": "A", "before": null, "after": "also", "start_char_pos": 561, "end_char_pos": 561}, {"type": "R", "before": "representation alternatives", "after": "alternative representations", "start_char_pos": 621, "end_char_pos": 648}, {"type": "D", "before": ",", "after": null, "start_char_pos": 673, "end_char_pos": 674}, {"type": "R", "before": "of the results", "after": "in the results. We also asked the respondents' opinions", "start_char_pos": 804, "end_char_pos": 818}, {"type": "R", "before": "visualization", "after": "representation", "start_char_pos": 838, "end_char_pos": 851}, {"type": "R", "before": "sudden drop", "after": "tendency towards dichotomous interpretations - measured as the \"cliff effect\": the sudden drop in confidence", "start_char_pos": 957, "end_char_pos": 968}, {"type": "R", "before": "compared to classic CIs", "after": "- compared with classic CI visualization", "start_char_pos": 989, "end_char_pos": 1012}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1043, "end_char_pos": 1043}, {"type": "R", "before": "All data analysis and scripts are", "after": "As a contribution to open science, our data and all analyses are publicly", "start_char_pos": 1062, "end_char_pos": 1095}, {"type": "A", "before": null, "after": ".", "start_char_pos": 1113, "end_char_pos": 1113}], "sents_char_pos": [0, 396, 578, 859, 1061]} {"doc_id": "2002.07698", "revision_depth": "1", "before_revision": "A cycle C of a graph G is isolating if every component of G-V(C) is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle C of length 8 \\leq |E(C)| < \\left \\lfloor 2{3}(|V(G)|+ 3)\\right \\rfloor implies an isolating cycle C' of larger length that contains V(C). By ``hopping'' iteratively to such larger cycles, we obtain a powerful and very general inductive motor for proving and computing long cycles (we will give an algorithm with running time O(n^2)). This provides a method to prove lower bounds on Tutte cycles, as C' will be a Tutte cycle of G if C is. We also prove that E(C') \\leq E(C) +3 if G does not contain faces of size five, which gives a new tool for proving results about cycle spectra and evidence that these face sizes obstruct long cycles . As a sample application, we test our motor on a conjecture on essentially 4-connected graphs. A planar graph is \\emph{essentially 4-connected} if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Essentially 4-connected graphs have been thoroughly investigated throughout literature as the subject of Hamiltonicity studies. Jackson and Wormald proved that every essentially 4-connected planar graph G on n vertices contains a cycle of length at least \\frac{2}{5}(n+2), and this result has recently been improved multiple times, culminating in the lower bound \\frac{5}{8}(n+2). However, the best known upper bound is given by an infinite family of such graphs in which every graph G on n vertices has no cycle longer than\\left \\lfloor \\frac{2}{3}(n+4) \\right \\rfloor ; this upper bound is still unmatched. Using isolating cycles, we improve the lower bound to match the upper (up to a summand +1). This settles the long-standing open problem of determining the circumference of essentially 4-connected planar graphs .", "after_revision": "A cycle C of a graph G is isolating if every component of G-V(C) is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle C of length 6 \\leq |E(C)| < \\left \\lfloor 2{3}(|V(G)|+ 4)\\right \\rfloor implies an isolating cycle C' of larger length that contains V(C). By \"hopping\" iteratively to such larger cycles, we obtain a powerful and very general inductive motor for proving long cycles and computing them (we will give an algorithm with quadratic running time). This is the first step towards the so far elusive quest of finding a universal induction that captures longest cycles of polyhedral graph classes. Our motor provides also a method to prove linear lower bounds on the length of Tutte cycles, as C' will be a Tutte cycle of G if C is. We prove in addition that | E(C') | \\leq | E(C) | +3 if G contains no face of size five, which gives a new tool for results about cycle spectra , and provides evidence that faces of size five may obstruct long cycles in many graph classes. We test our motor on the following conjecture about essentially 4-connected graphs. A planar graph is \\emph{essentially 4-connected} if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Jackson and Wormald proved that every essentially 4-connected planar graph G on n vertices contains a cycle of length at least \\frac{2}{5}(n+2), and this result has recently been improved multiple times, culminating in the lower bound \\frac{5}{8}(n+2). However, the currently best known upper bound is given by an infinite family of such graphs in which no graph G contains a cycle that is longer than\\left \\lfloor \\frac{2}{3}(n+4) \\right \\rfloor ; this upper bound is still unmatched. Using isolating cycles, we improve the lower bound to match the upper . All our results are tight .", "edit_actions": [{"type": "R", "before": "8", "after": "6", "start_char_pos": 202, "end_char_pos": 203}, {"type": "R", "before": "3)", "after": "4)", "start_char_pos": 245, "end_char_pos": 247}, {"type": "R", "before": "``hopping''", "after": "\"hopping\"", "start_char_pos": 332, "end_char_pos": 343}, {"type": "R", "before": "and computing long cycles", "after": "long cycles and computing them", "start_char_pos": 445, "end_char_pos": 470}, {"type": "R", "before": "running time O(n^2)). This provides", "after": "quadratic running time). This is the first step towards the so far elusive quest of finding a universal induction that captures longest cycles of polyhedral graph classes. Our motor provides also", "start_char_pos": 503, "end_char_pos": 538}, {"type": "A", "before": null, "after": "linear", "start_char_pos": 557, "end_char_pos": 557}, {"type": "A", "before": null, "after": "the length of", "start_char_pos": 574, "end_char_pos": 574}, {"type": "R", "before": "also prove that", "after": "prove in addition that |", "start_char_pos": 634, "end_char_pos": 649}, {"type": "R", "before": "\\leq", "after": "| \\leq |", "start_char_pos": 656, "end_char_pos": 660}, {"type": "A", "before": null, "after": "|", "start_char_pos": 666, "end_char_pos": 666}, {"type": "R", "before": "does not contain faces", "after": "contains no face", "start_char_pos": 675, "end_char_pos": 697}, {"type": "D", "before": "proving", "after": null, "start_char_pos": 739, "end_char_pos": 746}, {"type": "R", "before": "and evidence that these face sizes", "after": ", and provides evidence that faces of size five may", "start_char_pos": 775, "end_char_pos": 809}, {"type": "R", "before": ". As a sample application, we", "after": "in many graph classes. We", "start_char_pos": 831, "end_char_pos": 860}, {"type": "R", "before": "a conjecture on", "after": "the following conjecture about", "start_char_pos": 879, "end_char_pos": 894}, {"type": "D", "before": "Essentially 4-connected graphs have been thoroughly investigated throughout literature as the subject of Hamiltonicity studies.", "after": null, "start_char_pos": 1067, "end_char_pos": 1194}, {"type": "A", "before": null, "after": "currently", "start_char_pos": 1461, "end_char_pos": 1461}, {"type": "R", "before": "every graph G on n vertices has no cycle longer than", "after": "no graph G contains a cycle that is longer than", "start_char_pos": 1540, "end_char_pos": 1592}, {"type": "R", "before": "(up to a summand +1). This settles the long-standing open problem of determining the circumference of essentially 4-connected planar graphs", "after": ". All our results are tight", "start_char_pos": 1747, "end_char_pos": 1886}], "sents_char_pos": [0, 84, 328, 524, 630, 832, 926, 1066, 1194, 1447, 1639, 1676, 1768]} {"doc_id": "2002.08498", "revision_depth": "1", "before_revision": "We study approximation algorithms for the following three string measures that are widely used in practice: edit distance , longest common subsequence , and longest increasing sequence .\\ All three problems can be solved exactly by standard algorithms that run in polynomial time with roughly O (n) space, where n is the input length, and our goal is to design deterministic approximation algorithms that run in polynomial time with significantly smaller space. Towards this, we design several algorithms that achieve 1+\\epsilon or 1-\\epsilon approximation for all three problems, where \\epsilon>0 can be any constant . Our algorithms use space n^{\\delta for any constant \\delta>0 and have running time essentially the same as or slightly more than the standard algorithms . Our algorithms significantly improve previous results in terms of space complexity, where all known results need to use space at least \\Omega(n). Some of our algorithms can also be adapted to work in the asymmetric streaming model \\mbox{%DIFAUXCMD saks2013space\\hspace{0pt}%DIFAUXCMD } , and output the corresponding sequence. ] ] Our algorithms are based on the idea of using recursion as in Savitch's theorem \\mbox{%DIFAUXCMD \\cite{Savitch70}\\hspace{0pt}%DIFAUXCMD } , and a careful modification of previous techniques to make the recursion work. Along the way we also give a new logspace reduction from longest common subsequence to longest increasing sequence, which may be of independent interest.", "after_revision": "We study approximation algorithms for the following three string measures that are widely used in practice: edit distance (ED) , longest common subsequence (LCS) , and longest increasing sequence (LIS). All three problems can be solved exactly by standard algorithms that run in polynomial time with roughly \\Theta (n) space, where n is the input length, and our goal is to design deterministic approximation algorithms that run in polynomial time with significantly smaller space. Towards this, we design several algorithms that achieve 1+\\epsilon or 1-\\epsilon approximation for all three problems, where \\epsilon>0 can be any constant and even slightly sub constant . Our algorithms are flexible and can be adjusted to achieve the following two regimes of parameters: 1) space n^\\delta for any constant \\delta>0 with running time essentially the same as or slightly more than the standard algorithms ; and 2) space \\mathsf{polylog SC) . Our algorithms significantly improve previous results in terms of space complexity, where all known results need to use space at least \\Omega(n). Some of our algorithms can also be adapted to work in the asymmetric streaming model \\hspace{0pt}%DIFAUXCMD } SS13 , and output the corresponding sequence. Furthermore, our results can be used to improve a recent result by Farhadi et. al. FHRS20] about approximating ED in the asymmetric streaming model, reducing the running time from being exponential in FHRS20] to a polynomial. Our algorithms are based on the idea of using recursion as in Savitch's theorem }\\hspace{0pt}%DIFAUXCMD } Sav70 , and a careful adaption of previous techniques to make the recursion work. Along the way we also give a new logspace reduction from longest common subsequence to longest increasing sequence, which may be of independent interest.", "edit_actions": [{"type": "A", "before": null, "after": "(ED)", "start_char_pos": 122, "end_char_pos": 122}, {"type": "A", "before": null, "after": "(LCS)", "start_char_pos": 152, "end_char_pos": 152}, {"type": "R", "before": ".\\", "after": "(LIS).", "start_char_pos": 187, "end_char_pos": 189}, {"type": "R", "before": "O", "after": "\\Theta", "start_char_pos": 295, "end_char_pos": 296}, {"type": "A", "before": null, "after": "and even slightly sub constant", "start_char_pos": 620, "end_char_pos": 620}, {"type": "R", "before": "use space n^{\\delta", "after": "are flexible and can be adjusted to achieve the following two regimes of parameters: 1) space n^\\delta", "start_char_pos": 638, "end_char_pos": 657}, {"type": "R", "before": "and have", "after": "with", "start_char_pos": 684, "end_char_pos": 692}, {"type": "A", "before": null, "after": "; and 2) space \\mathsf{polylog", "start_char_pos": 776, "end_char_pos": 776}, {"type": "A", "before": null, "after": "SC", "start_char_pos": 777, "end_char_pos": 777}, {"type": "A", "before": null, "after": ")", "start_char_pos": 777, "end_char_pos": 777}, {"type": "D", "before": "\\mbox{%DIFAUXCMD saks2013space", "after": null, "start_char_pos": 1011, "end_char_pos": 1041}, {"type": "A", "before": null, "after": "SS13", "start_char_pos": 1066, "end_char_pos": 1066}, {"type": "A", "before": null, "after": "Furthermore, our results can be used to improve a recent result by Farhadi et. al.", "start_char_pos": 1108, "end_char_pos": 1108}, {"type": "A", "before": null, "after": "FHRS20", "start_char_pos": 1109, "end_char_pos": 1109}, {"type": "A", "before": null, "after": "about approximating ED in the asymmetric streaming model, reducing the running time from being exponential in", "start_char_pos": 1111, "end_char_pos": 1111}, {"type": "A", "before": null, "after": "FHRS20", "start_char_pos": 1112, "end_char_pos": 1112}, {"type": "A", "before": null, "after": "to a polynomial.", "start_char_pos": 1114, "end_char_pos": 1114}, {"type": "D", "before": "\\mbox{%DIFAUXCMD \\cite{Savitch70", "after": null, "start_char_pos": 1195, "end_char_pos": 1227}, {"type": "A", "before": null, "after": "Sav70", "start_char_pos": 1253, "end_char_pos": 1253}, {"type": "R", "before": "modification", "after": "adaption", "start_char_pos": 1270, "end_char_pos": 1282}], "sents_char_pos": [0, 463, 622, 779, 925, 1107, 1333]} {"doc_id": "2002.08608", "revision_depth": "1", "before_revision": "We propose FrameAxis, a method of characterizing the framing of a given text by identifying the most relevant semantic axes (\"microframes\") defined by antonym word pairs . In contrast to the traditional framing analysis, which has been constrained by a small number of manually annotated general frames, our unsupervised approach provides much more detailed insights , by considering a host of semantic axes. Our method is capable of quantitatively teasing out framing bias -- how biased a text is in each microframe -- and framing intensity \\textit{ -- how much each microframe is used -- from the text, offering a nuanced characterization of framing. We evaluate our approach using SemEval datasets as well as three other datasets and human evaluations, demonstrating that FrameAxis can reliably characterize documents with relevant microframes . Our method may allow scalable and nuanced computational analyses of framing across disciplines.", "after_revision": "Framing is a process of emphasizing a certain aspect of an issue over the others, nudging readers or listeners towards different positions on the issue even without making a biased argument. Here, we propose FrameAxis, a method for automatically characterizing framing of a given text by identifying the most relevant semantic axes (\"microframes\") that are overrepresented in the text using word embedding . In contrast to the traditional framing analysis, which tends to be constrained by a small number of manually annotated general frames, our unsupervised approach can be readily applied to large datasets because it does not require manual annotations. It can also provide more nuanced insights by considering a host of semantic axes. Our method is designed to quantitatively tease out two important dimensions of framing:framing bias -- how biased an argument is -- and \\textit{framing intensity -- how much a particular aspect over another is highlighted -- from the text, offering a nuanced characterization of framing. We demonstrate how FrameAxis successfully captures framing bias and intensity in a variety of text data from restaurant reviews to news media. The existing domain knowledge can be directly incorporated into FrameAxis by guiding candidate microframes to test and fine-tune automatically discovered microframes. We propose methods for explaining the results of FrameAxis at the level of individual words and documents. Our method may accelerate scalable and nuanced computational analyses of framing across disciplines.", "edit_actions": [{"type": "R", "before": "We", "after": "Framing is a process of emphasizing a certain aspect of an issue over the others, nudging readers or listeners towards different positions on the issue even without making a biased argument. Here, we", "start_char_pos": 0, "end_char_pos": 2}, {"type": "R", "before": "of characterizing the", "after": "for automatically characterizing", "start_char_pos": 31, "end_char_pos": 52}, {"type": "R", "before": "defined by antonym word pairs", "after": "that are overrepresented in the text using word embedding", "start_char_pos": 140, "end_char_pos": 169}, {"type": "R", "before": "has been", "after": "tends to be", "start_char_pos": 227, "end_char_pos": 235}, {"type": "R", "before": "provides much more detailed insights ,", "after": "can be readily applied to large datasets because it does not require manual annotations. It can also provide more nuanced insights", "start_char_pos": 330, "end_char_pos": 368}, {"type": "R", "before": "capable of quantitatively teasing out framing bias", "after": "designed to quantitatively tease out two important dimensions of framing:", "start_char_pos": 423, "end_char_pos": 473}, {"type": "A", "before": null, "after": "framing bias", "start_char_pos": 473, "end_char_pos": 473}, {"type": "R", "before": "a text is in each microframe", "after": "an argument is", "start_char_pos": 488, "end_char_pos": 516}, {"type": "D", "before": "framing intensity", "after": null, "start_char_pos": 524, "end_char_pos": 541}, {"type": "A", "before": null, "after": "framing intensity", "start_char_pos": 550, "end_char_pos": 550}, {"type": "R", "before": "each microframe is used", "after": "a particular aspect over another is highlighted", "start_char_pos": 563, "end_char_pos": 586}, {"type": "R", "before": "evaluate our approach using SemEval datasets as well as three other datasets and human evaluations, demonstrating that FrameAxis can reliably characterize documents with relevant microframes .", "after": "demonstrate how FrameAxis successfully captures framing bias and intensity in a variety of text data from restaurant reviews to news media. The existing domain knowledge can be directly incorporated into FrameAxis by guiding candidate microframes to test and fine-tune automatically discovered microframes. We propose methods for explaining the results of FrameAxis at the level of individual words and documents.", "start_char_pos": 656, "end_char_pos": 848}, {"type": "R", "before": "allow", "after": "accelerate", "start_char_pos": 864, "end_char_pos": 869}], "sents_char_pos": [0, 171, 408, 652, 848]} {"doc_id": "2002.09036", "revision_depth": "1", "before_revision": "Towards the realization of a sustainable, fair and inclusive society, we propose a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism , and make a hypothesis that interprets choice of action as the X-point for individual utility function increasing with actions and social norm function decreasing with actions. This hypothesis is based on humans balancing the value of utility and the value of norms psychologically in choosing actions. Using the hypothesis and approximation, we were able to isolate and infer utility function and norm function from real-world measurement data of actions on environmental conditions , and elucidate the interaction between the both functions to lead actions from current to target . As examples of collective data that aggregate decision-making of individuals, we looked at the changes in power usage before and after the Great East Japan Earthquake and the correlation between national GDP and CO2 emission in different countries. The first example is interpreted that the benefits for power (i.e., utility of power usage) is stronger than the power usage restrictions imposed by norms after the earthquake, contrary to our expectation. The second example is interpreted that the reduction of CO2 emission in each country is not related to utility derived from GDP but to norms related to CO2 emission. Going forward, we will apply this new X-point model to actual social practices involving normative problems, and design the approaches for the diagnosis, prognosis , and intervention of social systems (individual action, inter-individual interaction, and institution) by IT systems.", "after_revision": "Towards the realization of a sustainable, fair and inclusive society, we proposed a novel decision-making model that incorporates social norms in a rational choice model from the standpoints of deontology and utilitarianism . We proposed a hypothesis that interprets choice of action as the X-point for individual utility function that increases with actions and social norm function that decreases with actions. This hypothesis is based on humans psychologically balancing the value of utility and norms in selecting actions. Using the hypothesis and approximation, we were able to isolate and infer utility function and norm function from real-world measurement data of actions on environmental conditions and elucidate the interaction between the both functions that led from current status to target actions . As examples of collective data that aggregate decision-making of individuals, we looked at the changes in power usage before and after the Great East Japan Earthquake and the correlation between national GDP and CO2 emission in different countries. The first example showed that the perceived benefits of power (i.e., utility of power usage) was stronger than the power usage restrictions imposed by norms after the earthquake, contrary to our expectation. The second example showed that a reduction of CO2 emission in each country was not related to utility derived from GDP but to norms related to CO2 emission. Going forward, we will apply this new X-point model to actual social practices involving normative problems, and design the approaches for the diagnosis, prognosis and intervention of social systems by IT systems.", "edit_actions": [{"type": "R", "before": "propose", "after": "proposed", "start_char_pos": 73, "end_char_pos": 80}, {"type": "R", "before": ", and make", "after": ". We proposed", "start_char_pos": 223, "end_char_pos": 233}, {"type": "R", "before": "increasing", "after": "that increases", "start_char_pos": 327, "end_char_pos": 337}, {"type": "R", "before": "decreasing", "after": "that decreases", "start_char_pos": 376, "end_char_pos": 386}, {"type": "A", "before": null, "after": "psychologically", "start_char_pos": 436, "end_char_pos": 436}, {"type": "R", "before": "the value of norms psychologically in choosing", "after": "norms in selecting", "start_char_pos": 472, "end_char_pos": 518}, {"type": "D", "before": ",", "after": null, "start_char_pos": 709, "end_char_pos": 710}, {"type": "R", "before": "to lead actions from current to target", "after": "that led from current status to target actions", "start_char_pos": 768, "end_char_pos": 806}, {"type": "R", "before": "is interpreted that the benefits for", "after": "showed that the perceived benefits of", "start_char_pos": 1076, "end_char_pos": 1112}, {"type": "R", "before": "is", "after": "was", "start_char_pos": 1150, "end_char_pos": 1152}, {"type": "R", "before": "is interpreted that the", "after": "showed that a", "start_char_pos": 1283, "end_char_pos": 1306}, {"type": "R", "before": "is", "after": "was", "start_char_pos": 1349, "end_char_pos": 1351}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1594, "end_char_pos": 1595}, {"type": "D", "before": "(individual action, inter-individual interaction, and institution)", "after": null, "start_char_pos": 1631, "end_char_pos": 1697}], "sents_char_pos": [0, 400, 527, 808, 1057, 1263, 1429]} {"doc_id": "2002.09460", "revision_depth": "1", "before_revision": "Graph clustering objective functions with tunable resolution parameters make it possible to detect different types of clustering structure in the same graph. These objectives also provide a unifying view of other non-parametric objectives, which often can be captured as special cases. Previous research has largely focused on parametric objectives for standard graphs, in which all nodes are of the same type, and edges model pairwise relationships. In our work, we introduced parameterized objective functions and approximation algorithms specifically for clustering bipartite graphs and hypergraphs, based on correlation clustering. This enables us to develop principled approaches for clustering datasets with different node types (bipartite graphs) or multiway relationships (hypergraphs). Our hypergraph objective is related to higher-order notions of modularity and normalized cut , and is amenable to approximation algorithms via hypergraph expansion techniques. Our bipartite objective generalizes standard bipartite correlation clustering, and in a certain parameter regime is equivalent to bicluster deletion, i. e., removing a minimum number of edges to separate a bipartite graph into disjoint bicliques. The problem in general is NP-hard, but we show that in a certain parameter regime it is equivalent to a bipartite matching problem , meaning that it is polynomial timesolvable in this regime . For other regimes, we provide approximation guarantees based on LP-rounding. Our results include the first constant factor approximation algorithm for bicluster deletion . We illustrate the flexibility of our framework in several experiments . This includes clustering a food web and an email network based on higher-order motif structure, detecting clusters of retail products in product review hypergraph, and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs .", "after_revision": "Motivated by applications in community detection and dense subgraph discovery, we consider new clustering objectives in hypergraphs and bipartite graphs. These objectives are parameterized by one or more resolution parameters in order to enable diverse knowledge discovery in complex data. For both hypergraph and bipartite objectives, we identify parameter regimes that are equivalent to existing objectives and share their (polynomial-time) approximation algorithms. We first show that our parameterized hypergraph correlation clustering objective is related to higher-order notions of normalized cut and modularity in hypergraphs. It is further amenable to approximation algorithms via hyperedge expansion techniques. Our parameterized bipartite correlation clustering objective generalizes standard unweighted bipartite correlation clustering, as well as bicluster deletion. For a certain choice of parameters it is also related to our hypergraph objective. Although in general it is NP-hard, we highlight a parameter regime for the bipartite objective where the problem reduces to the bipartite matching problem and thus can be solved in polynomial time . For other parameter settings, we present approximation algorithms using linear program rounding techniques. These results allow us to introduce the first constant-factor approximation for bicluster deletion , the task of removing a minimum number of edges to partition a bipartite graph into disjoint bi-cliques. In several experimental results, we highlight the flexibility of our framework and the diversity of results that can be obtained in different parameter settings . This includes clustering bipartite graphs across a range of parameters, detecting motif-rich clusters in an email network and a food web, and forming clusters of retail products in a product review hypergraph, that are highly correlated with known product categories .", "edit_actions": [{"type": "R", "before": "Graph clustering objective functions with tunable resolution parameters make it possible to detect different types of clustering structure in the same graph. These objectives also provide a unifying view of other non-parametric", "after": "Motivated by applications in community detection and dense subgraph discovery, we consider new clustering objectives in hypergraphs and bipartite graphs. These objectives are parameterized by one or more resolution parameters in order to enable diverse knowledge discovery in complex data. For both hypergraph and bipartite", "start_char_pos": 0, "end_char_pos": 227}, {"type": "R", "before": "which often can be captured as special cases. Previous research has largely focused on parametric objectives for standard graphs, in which all nodes are of the same type, and edges model pairwise relationships. In our work, we introduced parameterized objective functions and approximation algorithms specifically for clustering bipartite graphs and hypergraphs, based on correlation clustering. This enables us to develop principled approaches for clustering datasets with different node types (bipartite graphs) or multiway relationships (hypergraphs). Our hypergraph", "after": "we identify parameter regimes that are equivalent to existing objectives and share their (polynomial-time) approximation algorithms. We first show that our parameterized hypergraph correlation clustering", "start_char_pos": 240, "end_char_pos": 809}, {"type": "R", "before": "modularity and normalized cut , and is", "after": "normalized cut and modularity in hypergraphs. It is further", "start_char_pos": 858, "end_char_pos": 896}, {"type": "R", "before": "hypergraph", "after": "hyperedge", "start_char_pos": 938, "end_char_pos": 948}, {"type": "R", "before": "bipartite", "after": "parameterized bipartite correlation clustering", "start_char_pos": 975, "end_char_pos": 984}, {"type": "A", "before": null, "after": "unweighted", "start_char_pos": 1016, "end_char_pos": 1016}, {"type": "R", "before": "and in a certain parameter regime is equivalent to bicluster deletion, i. e., removing a minimum number of edges to separate a bipartite graph into disjoint bicliques. The problem in general", "after": "as well as bicluster deletion. For a certain choice of parameters it is also related to our hypergraph objective. Although in general it", "start_char_pos": 1051, "end_char_pos": 1241}, {"type": "R", "before": "but we show that in a certain parameter regime it is equivalent to a", "after": "we highlight a parameter regime for the bipartite objective where the problem reduces to the", "start_char_pos": 1254, "end_char_pos": 1322}, {"type": "R", "before": ", meaning that it is polynomial timesolvable in this regime", "after": "and thus can be solved in polynomial time", "start_char_pos": 1350, "end_char_pos": 1409}, {"type": "R", "before": "regimes, we provide approximation guarantees based on LP-rounding. Our results include the first constant factor approximation algorithm", "after": "parameter settings, we present approximation algorithms using linear program rounding techniques. These results allow us to introduce the first constant-factor approximation", "start_char_pos": 1422, "end_char_pos": 1558}, {"type": "R", "before": ". We illustrate", "after": ", the task of removing a minimum number of edges to partition a bipartite graph into disjoint bi-cliques. In several experimental results, we highlight", "start_char_pos": 1582, "end_char_pos": 1597}, {"type": "R", "before": "in several experiments", "after": "and the diversity of results that can be obtained in different parameter settings", "start_char_pos": 1631, "end_char_pos": 1653}, {"type": "R", "before": "a food web and", "after": "bipartite graphs across a range of parameters, detecting motif-rich clusters in", "start_char_pos": 1681, "end_char_pos": 1695}, {"type": "R", "before": "based on higher-order motif structure, detecting", "after": "and a food web, and forming", "start_char_pos": 1713, "end_char_pos": 1761}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1793, "end_char_pos": 1793}, {"type": "R", "before": "and evaluating our algorithms across a range of parameter settings on several real world bipartite graphs", "after": "that are highly correlated with known product categories", "start_char_pos": 1821, "end_char_pos": 1926}], "sents_char_pos": [0, 157, 285, 450, 635, 794, 970, 1218, 1411, 1488, 1583, 1655]} {"doc_id": "2002.10045", "revision_depth": "1", "before_revision": "When selling information, sometimes the seller can increase the revenue by giving away some partial information to change the buyer' s belief about the information product, so the buyer may be more willing to purchase. This work studies the general problem of advertising information products by revealing some partial information. We consider a buyer who needs to make a decision, the outcome of which depends on the state of the world that is unknown to the buyer . There is an information seller who has access to information about the state of the world. The seller can advertise the information by revealing some partial information. We consider a seller who chooses an advertising strategy and then commits to it. The buyer decides whether to purchase the full information product after seeing the partial information. The seller's goal is to maximize the expected revenue. We prove that finding the optimal advertising strategy is hard, even in the simple case that the buyer typeis known. Nevertheless, we show that when the buyer type is known, the problem is equivalent to finding the concave closure of a function . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve the optimal mechanism by a convex program ( with exponential size in general, polynomial size for special cases). We also prove some interesting characterizations of the optimal mechanisms based on these properties. For the general problem when the seller only knows the type distribution of the buyer , it is NP-hard to find a constant factor approximation. We thus look at special cases and provide an approximation algorithm that finds an \\varepsilon-suboptimal mechanism when it is not too hard to predict the possible type of buyer who will make the purchase.", "after_revision": "When selling information, sometimes the seller can increase the revenue by giving away some partial information to change the buyers' belief about the information product, so the buyers may be more willing to purchase. This work studies the general problem of advertising information products by revealing some partial information. We consider buyers who need to make a decision, the outcome of which depends on the state of the world that is unknown to the buyers . There is an information seller who has access to the state of the world. The seller can advertise the information by revealing some partial information. We assume that the seller chooses a long-term advertising strategy and then commits to it. The buyers decide whether to purchase the full information product after seeing the partial information. The seller's goal is to maximize the expected revenue. We study the problem in two settings. 1. The seller targets the buyers of a certain type. In this case, we prove that finding the optimal advertising strategy is equivalent to finding the concave closure of a function , which is NP-hard in general . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve for the optimal mechanism by a convex program ( of exponential size in general, polynomial size for special cases). We also prove some interesting characterizations of the optimal mechanisms based on these properties. 2. For the general problem when the seller faces buyers of different types and only knows the distribution of their types , it is NP-hard to find a constant factor approximation. We thus look at special cases and provide an approximation algorithm that finds an \\varepsilon-suboptimal mechanism when it is not too hard to predict the possible type of buyers who will make the purchase.", "edit_actions": [{"type": "R", "before": "buyer' s", "after": "buyers'", "start_char_pos": 126, "end_char_pos": 134}, {"type": "R", "before": "buyer", "after": "buyers", "start_char_pos": 180, "end_char_pos": 185}, {"type": "R", "before": "a buyer who needs", "after": "buyers who need", "start_char_pos": 344, "end_char_pos": 361}, {"type": "R", "before": "buyer", "after": "buyers", "start_char_pos": 460, "end_char_pos": 465}, {"type": "D", "before": "information about", "after": null, "start_char_pos": 517, "end_char_pos": 534}, {"type": "R", "before": "consider a seller who chooses an", "after": "assume that the seller chooses a long-term", "start_char_pos": 642, "end_char_pos": 674}, {"type": "R", "before": "buyer decides", "after": "buyers decide", "start_char_pos": 724, "end_char_pos": 737}, {"type": "R", "before": "prove that finding the optimal advertising strategy is hard, even in the simple case that the buyer typeis known. Nevertheless, we show that when the buyer type is known, the problem is", "after": "study the problem in two settings. 1. The seller targets the buyers of a certain type. In this case, we prove that finding the optimal advertising strategy is", "start_char_pos": 883, "end_char_pos": 1068}, {"type": "A", "before": null, "after": ", which is NP-hard in general", "start_char_pos": 1125, "end_char_pos": 1125}, {"type": "A", "before": null, "after": "for", "start_char_pos": 1230, "end_char_pos": 1230}, {"type": "R", "before": "with", "after": "of", "start_char_pos": 1275, "end_char_pos": 1279}, {"type": "A", "before": null, "after": "2.", "start_char_pos": 1447, "end_char_pos": 1447}, {"type": "A", "before": null, "after": "faces buyers of different types and", "start_char_pos": 1488, "end_char_pos": 1488}, {"type": "R", "before": "type distribution of the buyer", "after": "distribution of their types", "start_char_pos": 1504, "end_char_pos": 1534}, {"type": "R", "before": "buyer", "after": "buyers", "start_char_pos": 1764, "end_char_pos": 1769}], "sents_char_pos": [0, 218, 331, 467, 558, 638, 719, 824, 879, 996, 1344, 1446, 1591]} {"doc_id": "2002.10045", "revision_depth": "2", "before_revision": "When selling information , sometimes the seller can increase the revenue by giving away some partial information to change the buyers'belief about the information product, so the buyers may be more willing to purchase. This work studies the general problem of advertising information products by revealing some partial information. We consider buyers who need to make a decision, the outcome of which depends on the state of the world that is unknown to the buyers. There is an information seller who has access to the state of the world. The seller can advertise the information by revealing some partial information. We assume that the seller chooses a long-term advertising strategy and then commits to it. The buyers decide whether to purchase the full information product after seeing the partial information. The seller's goal is to maximize the expected revenue. We study the problem in two settings. 1. The seller targets the buyers of a certain type. In this case, we prove that finding the optimal advertising strategy is equivalent to finding the concave closure of a function, which is NP-hard in general . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve for the optimal mechanism by a convex program (of exponential size in general, polynomial size for special cases). We also prove some interesting characterizations of the optimal mechanisms based on these properties. 2. For the general problem when the seller faces buyers of different types and only knows the distribution of their types, it is NP-hard to find a constant factor approximation. We thus look at special cases and provide an approximation algorithm that finds an \\varepsilon-suboptimal mechanism when it is not too hard to predict the possible type of buyers who will make the purchase .", "after_revision": "When selling information products, the seller can provide some free partial information to change people's valuations so that the overall revenue can possibly be increased. We study the general problem of advertising information products by revealing partial information. We consider buyers who are decision-makers. The outcomes of the decision problems depend on the state of the world that is unknown to the buyers. The buyers can make their own observations and thus can hold different personal beliefs about the state of the world. There is an information seller who has access to the state of the world. The seller can promote the information by revealing some partial information. We assume that the seller chooses a long-term advertising strategy and then commits to it. The seller's goal is to maximize the expected revenue. We study the problem in two settings. (1) The seller targets buyers of a certain type. In this case, we prove that finding the optimal advertising strategy is equivalent to finding the concave closure of a simple function. The function is a product of two quantities, the likelihood ratio and the cost of uncertainty . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve for the optimal mechanism by a finite-size convex program. The convex program will have a polynomial size if the state of the world has a constant number of possible realizations or the buyers face a decision problem with a constant number of options. For the general problem , we prove that it is NP-hard to find the optimal mechanism. (2) When the seller faces buyers of different types and only knows the distribution of their types, we provide an approximation algorithm when it is not too hard to predict the possible type of buyers who will make the purchase . For the general problem, we prove that it is NP-hard to find a constant-factor approximation .", "edit_actions": [{"type": "R", "before": ", sometimes", "after": "products,", "start_char_pos": 25, "end_char_pos": 36}, {"type": "R", "before": "increase the revenue by giving away some", "after": "provide some free", "start_char_pos": 52, "end_char_pos": 92}, {"type": "R", "before": "the buyers'belief about the information product, so", "after": "people's valuations so that the overall revenue can possibly be increased. We study", "start_char_pos": 123, "end_char_pos": 174}, {"type": "D", "before": "buyers may be more willing to purchase. This work studies the", "after": null, "start_char_pos": 179, "end_char_pos": 240}, {"type": "D", "before": "some", "after": null, "start_char_pos": 306, "end_char_pos": 310}, {"type": "R", "before": "need to make a decision, the outcome of which depends", "after": "are decision-makers. The outcomes of the decision problems depend", "start_char_pos": 355, "end_char_pos": 408}, {"type": "A", "before": null, "after": "The buyers can make their own observations and thus can hold different personal beliefs about the state of the world.", "start_char_pos": 466, "end_char_pos": 466}, {"type": "R", "before": "advertise", "after": "promote", "start_char_pos": 555, "end_char_pos": 564}, {"type": "D", "before": "buyers decide whether to purchase the full information product after seeing the partial information. The", "after": null, "start_char_pos": 715, "end_char_pos": 819}, {"type": "R", "before": "1.", "after": "(1)", "start_char_pos": 909, "end_char_pos": 911}, {"type": "D", "before": "the", "after": null, "start_char_pos": 931, "end_char_pos": 934}, {"type": "R", "before": "function, which is NP-hard in general", "after": "simple function. The function is a product of two quantities, the likelihood ratio and the cost of uncertainty", "start_char_pos": 1080, "end_char_pos": 1117}, {"type": "R", "before": "convex program (of exponential size in general, polynomial size for special cases). We also prove some interesting characterizations of the optimal mechanisms based on these properties. 2.", "after": "finite-size convex program. The convex program will have a polynomial size if the state of the world has a constant number of possible realizations or the buyers face a decision problem with a constant number of options.", "start_char_pos": 1253, "end_char_pos": 1441}, {"type": "R", "before": "when the", "after": ", we prove that it is NP-hard to find the optimal mechanism. (2) When the", "start_char_pos": 1466, "end_char_pos": 1474}, {"type": "R", "before": "it is NP-hard to find a constant factor approximation. We thus look at special cases and", "after": "we", "start_char_pos": 1562, "end_char_pos": 1650}, {"type": "D", "before": "that finds an \\varepsilon-suboptimal mechanism", "after": null, "start_char_pos": 1686, "end_char_pos": 1732}, {"type": "A", "before": null, "after": ". For the general problem, we prove that it is NP-hard to find a constant-factor approximation", "start_char_pos": 1823, "end_char_pos": 1823}], "sents_char_pos": [0, 218, 331, 465, 539, 619, 710, 815, 870, 908, 960, 1336, 1438, 1616]} {"doc_id": "2002.10415", "revision_depth": "1", "before_revision": "This paper studies the identification and estimationproblem in incomplete economic models with testable assumptions. Testable assumptions give strong and interpretable empirical content to the models but they also carry the possibility that our distribution of observed outcome may reject these assumptions. A natural way is to find a set of relaxed assumptions A that cannot be rejected by any reasonable distribution of observed outcome and preserves identified set of parameter of interest . The main contribution of this paper is to characterize the property of such relaxed assumption \\tilde{A} using a generalized definition of refutability and confirmability. \\tilde{A} A general estimation and inference procedure is proposed , and can be applied to most incomplete economic models. As the key application, I study the Imbens and Angrist Monotonicity assumption in potential outcome framework. I give a set of relaxed assumptions \\tilde{A} that can never be rejected and always preserve the identified set of local average treatment effect (LATE ). The LATE is point identified and easy to estimate under \\tilde{A} ", "after_revision": "This paper studies the identification , estimation, and hypothesis testing problem in complete and incomplete economic models with testable assumptions. Testable assumptions (A) give strong and interpretable empirical content to the models but they also carry the possibility that some distribution of observed outcomes may reject these assumptions. A natural way to avoid this is to find a set of relaxed assumptions ( A ) that cannot be rejected by any distribution of observed outcome and the identified set of the parameter of interest is not changed when the original assumption is not rejected . The main contribution of this paper is to characterize the properties of such a relaxed assumption \\tilde{A} using a generalized definition of refutability and confirmability. I also propose a general method to construct such\\tilde{A}. A general estimation and inference procedure is proposed and can be applied to most incomplete economic models. I apply my methodology to the instrument monotonicity assumption in Local Average Treatment Effect (LATE) estimation and to the sector selection assumption in a binary outcome Roy model of employment sector choice. In the LATE application, I use my general method to construct a set of relaxed assumptions \\tilde{A} that can never be rejected , and the identified set of LATE is the same as imposing A when A is not rejected. LATE is point identified under my extension \\tilde{A} in the LATE application. In the binary outcome Roy model, I use my method of incomplete models to relax Roy's sector selection assumption and characterize the identified set of the binary potential outcome as a polyhedron.", "edit_actions": [{"type": "R", "before": "and estimationproblem in", "after": ", estimation, and hypothesis testing problem in complete and", "start_char_pos": 38, "end_char_pos": 62}, {"type": "A", "before": null, "after": "(A)", "start_char_pos": 138, "end_char_pos": 138}, {"type": "R", "before": "our", "after": "some", "start_char_pos": 242, "end_char_pos": 245}, {"type": "R", "before": "outcome", "after": "outcomes", "start_char_pos": 271, "end_char_pos": 278}, {"type": "A", "before": null, "after": "to avoid this", "start_char_pos": 323, "end_char_pos": 323}, {"type": "A", "before": null, "after": "(", "start_char_pos": 364, "end_char_pos": 364}, {"type": "A", "before": null, "after": ")", "start_char_pos": 367, "end_char_pos": 367}, {"type": "D", "before": "reasonable", "after": null, "start_char_pos": 399, "end_char_pos": 409}, {"type": "R", "before": "preserves", "after": "the", "start_char_pos": 447, "end_char_pos": 456}, {"type": "A", "before": null, "after": "the", "start_char_pos": 475, "end_char_pos": 475}, {"type": "A", "before": null, "after": "is not changed when the original assumption is not rejected", "start_char_pos": 498, "end_char_pos": 498}, {"type": "R", "before": "property of such", "after": "properties of such a", "start_char_pos": 560, "end_char_pos": 576}, {"type": "A", "before": null, "after": "I also propose a general method to construct such", "start_char_pos": 673, "end_char_pos": 673}, {"type": "A", "before": null, "after": ".", "start_char_pos": 682, "end_char_pos": 682}, {"type": "D", "before": ",", "after": null, "start_char_pos": 740, "end_char_pos": 741}, {"type": "D", "before": "As the key application, I study the Imbens and Angrist Monotonicity assumption in potential outcome framework.", "after": null, "start_char_pos": 797, "end_char_pos": 907}, {"type": "R", "before": "give", "after": "apply my methodology to the instrument monotonicity assumption in Local Average Treatment Effect (LATE) estimation and to the sector selection assumption in a binary outcome Roy model of employment sector choice. In the LATE application, I use my general method to construct", "start_char_pos": 910, "end_char_pos": 914}, {"type": "R", "before": "and always preserve", "after": ", and", "start_char_pos": 981, "end_char_pos": 1000}, {"type": "D", "before": "local average treatment effect (LATE ). The", "after": null, "start_char_pos": 1023, "end_char_pos": 1066}, {"type": "A", "before": null, "after": "is the same as imposing A when A is not rejected. LATE", "start_char_pos": 1072, "end_char_pos": 1072}, {"type": "R", "before": "and easy to estimate under", "after": "under my extension", "start_char_pos": 1093, "end_char_pos": 1119}, {"type": "A", "before": null, "after": "in the LATE application. In the binary outcome Roy model, I use my method of incomplete models to relax Roy's sector selection assumption and characterize the identified set of the binary potential outcome as a polyhedron.", "start_char_pos": 1130, "end_char_pos": 1130}], "sents_char_pos": [0, 116, 308, 500, 672, 796, 907, 1062]} {"doc_id": "2002.10757", "revision_depth": "1", "before_revision": "Event detection (ED), a key subtask of information extraction, aims to recognize instances of specific types of events in text. Recently, graph convolutional networks (GCNs) over dependency trees have been widely used to capture syntactic structure information and get convincing performances in event detection . However, these works ignore the syntactic relation labels on the tree, which convey rich and useful linguistic knowledge for event detection . In this paper, we investigate a novel architecture named Relation-Aware GCN (RA-GCN ), which efficiently exploits syntactic relation labels and models the relation between words specifically. We first propose a relation-aware aggregation module to produce expressive word representation by aggregating syntactically connected words through specific relation . Furthermore, a context-aware relation update module is designed to explicitly update the relation representation between words, and these two modules work in the mutual promotion way. Experimental results on the ACE2005 dataset show that our model achieves a new state-of-the-art performance for event detection .", "after_revision": "Event detection (ED), a key subtask of information extraction, aims to recognize instances of specific event types in text. Previous studies on the task have verified the effectiveness of integrating syntactic dependency into graph convolutional networks . However, these methods usually ignore dependency label information, which conveys rich and useful linguistic knowledge for ED . In this paper, we propose a novel architecture named Edge-Enhanced Graph Convolution Networks (EE-GCN ), which simultaneously exploits syntactic structure and typed dependency label information to perform ED. Specifically, an edge-aware node update module is designed to generate expressive word representations by aggregating syntactically-connected words through specific dependency types . Furthermore, to fully explore clues hidden in dependency edges, a node-aware edge update module is introduced, which refines the relation representations with contextual information. These two modules are complementary to each other and work in a mutual promotion way. We conduct experiments on the widely used ACE2005 dataset and the results show significant improvement over competitive baseline methods .", "edit_actions": [{"type": "R", "before": "types of events", "after": "event types", "start_char_pos": 103, "end_char_pos": 118}, {"type": "R", "before": "Recently,", "after": "Previous studies on the task have verified the effectiveness of integrating syntactic dependency into", "start_char_pos": 128, "end_char_pos": 137}, {"type": "D", "before": "(GCNs) over dependency trees have been widely used to capture syntactic structure information and get convincing performances in event detection", "after": null, "start_char_pos": 167, "end_char_pos": 311}, {"type": "R", "before": "works ignore the syntactic relation labels on the tree, which convey", "after": "methods usually ignore dependency label information, which conveys", "start_char_pos": 329, "end_char_pos": 397}, {"type": "R", "before": "event detection", "after": "ED", "start_char_pos": 439, "end_char_pos": 454}, {"type": "R", "before": "investigate", "after": "propose", "start_char_pos": 475, "end_char_pos": 486}, {"type": "R", "before": "Relation-Aware GCN (RA-GCN", "after": "Edge-Enhanced Graph Convolution Networks (EE-GCN", "start_char_pos": 514, "end_char_pos": 540}, {"type": "R", "before": "efficiently exploits syntactic relation labels and models the relation between words specifically. We first propose a relation-aware aggregation module to produce expressive word representation by aggregating syntactically connected", "after": "simultaneously exploits syntactic structure and typed dependency label information to perform ED. Specifically, an edge-aware node update module is designed to generate expressive word representations by aggregating syntactically-connected", "start_char_pos": 550, "end_char_pos": 782}, {"type": "R", "before": "relation", "after": "dependency types", "start_char_pos": 806, "end_char_pos": 814}, {"type": "R", "before": "a context-aware relation", "after": "to fully explore clues hidden in dependency edges, a node-aware edge", "start_char_pos": 830, "end_char_pos": 854}, {"type": "R", "before": "designed to explicitly update the relation representation between words, and these two modules work in the", "after": "introduced, which refines the relation representations with contextual information. These two modules are complementary to each other and work in a", "start_char_pos": 872, "end_char_pos": 978}, {"type": "R", "before": "Experimental results on the", "after": "We conduct experiments on the widely used", "start_char_pos": 1001, "end_char_pos": 1028}, {"type": "R", "before": "show that our model achieves a new state-of-the-art performance for event detection", "after": "and the results show significant improvement over competitive baseline methods", "start_char_pos": 1045, "end_char_pos": 1128}], "sents_char_pos": [0, 127, 313, 456, 648, 816, 1000]} {"doc_id": "2003.00970", "revision_depth": "1", "before_revision": "YouTube recently announced a decision to exclude potentially harmful content from video recommendations while allowing such videos to remain on the platform , but it is unclear whether this compromise is sufficient in mitigating YouTube's role in propagating this content . To assess this impact, we measure YouTube sharing in Twitter and Reddit in the eight months around YouTube's announcement using interrupted time series models. These models evaluate YouTube's impact on sharing of videos from a curated set of alternative political channelsand popular videos shared in three conspiracy-oriented Reddit subreddits; we compare these models to a placebo dataset of makeup-oriented videos that should be unaffected by YouTube's announcement. Results suggest YouTube's de-recommending AIN-produced content has a significant suppressive effect on sharing of AIN videos in both Twitter and Reddit , with our models showing a significant and downward trend in sharing. For conspiracy video sharing , however, we see no significant change in Reddit and find an increase in the level of conspiracy sharing in Twitter. We see no significant effect on makeup sharingin either platform , suggesting YouTube's targeting particular content types has a targeted effect. Reducing exposure to anti-social videos without deleting them therefore has the potential to improve quality across the information ecosystem, but additional transparency is needed to evaluate these effects further.", "after_revision": "In January 2019, YouTube announced it would exclude potentially harmful content from video recommendations but allow such videos to remain on the platform . While this step intends to reduce YouTube's role in propagating such content, continued availability of these videos in other online spaces makes it unclear whether this compromise actually reduces their spread . To assess this impact, we apply interrupted time series models to measure whether different types of YouTube sharing in Twitter and Reddit changed significantly in the eight months around YouTube's announcement . We evaluate video sharing across three curated sets of potentially harmful, anti-social content: a set of conspiracy videos that have been shown to experience reduced recommendations in YouTube, a larger set of videos posted by conspiracy-oriented channels, and a set of videos posted by alternative influence network (AIN) channels. As a control, we also evaluate effects on video sharing in a dataset of videos from mainstream news channels. Results show conspiracy-labeled and AIN videos that have evidence of YouTube's de-recommendation experience a significant decreasing trend in sharing on both Twitter and Reddit . For videos from conspiracy-oriented channels , however, we see no significant effect in Twitter but find a significant increase in the level of conspiracy-channel sharing in Reddit. For mainstream news sharing, we actually see an increase in trend on both platforms , suggesting YouTube's suppressing particular content types has a targeted effect. This work finds evidence that reducing exposure to anti-social videos within YouTube, without deletion, has potential pro-social, cross-platform effects. At the same time, increases in the level of conspiracy-channel sharing raise concerns about content producers' responses to these changes, and platform transparency is needed to evaluate these effects further.", "edit_actions": [{"type": "R", "before": "YouTube recently announced a decision to", "after": "In January 2019, YouTube announced it would", "start_char_pos": 0, "end_char_pos": 40}, {"type": "R", "before": "while allowing", "after": "but allow", "start_char_pos": 104, "end_char_pos": 118}, {"type": "R", "before": ", but it is unclear whether this compromise is sufficient in mitigating", "after": ". While this step intends to reduce", "start_char_pos": 157, "end_char_pos": 228}, {"type": "R", "before": "this content", "after": "such content, continued availability of these videos in other online spaces makes it unclear whether this compromise actually reduces their spread", "start_char_pos": 259, "end_char_pos": 271}, {"type": "R", "before": "measure", "after": "apply interrupted time series models to measure whether different types of", "start_char_pos": 300, "end_char_pos": 307}, {"type": "A", "before": null, "after": "changed significantly", "start_char_pos": 346, "end_char_pos": 346}, {"type": "R", "before": "using interrupted time series models. These models evaluate YouTube's impact on sharing", "after": ". We evaluate video sharing across three curated sets of potentially harmful, anti-social content: a set of conspiracy videos that have been shown to experience reduced recommendations in YouTube, a larger set of videos posted by conspiracy-oriented channels, and a set of videos posted by alternative influence network (AIN) channels. As a control, we also evaluate effects on video sharing in a dataset", "start_char_pos": 397, "end_char_pos": 484}, {"type": "R", "before": "from a curated set of alternative political channelsand popular videos shared in three conspiracy-oriented Reddit subreddits; we compare these models to a placebo dataset of makeup-oriented videos that should be unaffected by YouTube's announcement. Results suggest", "after": "from mainstream news channels. Results show conspiracy-labeled and AIN videos that have evidence of", "start_char_pos": 495, "end_char_pos": 760}, {"type": "R", "before": "de-recommending AIN-produced content has a significant suppressive effect on sharing of AIN videos in", "after": "de-recommendation experience a significant decreasing trend in sharing on", "start_char_pos": 771, "end_char_pos": 872}, {"type": "R", "before": ", with our models showing a significant and downward trend in sharing. For conspiracy video sharing", "after": ". For videos from conspiracy-oriented channels", "start_char_pos": 897, "end_char_pos": 996}, {"type": "R", "before": "change in Reddit and find an", "after": "effect in Twitter but find a significant", "start_char_pos": 1030, "end_char_pos": 1058}, {"type": "R", "before": "conspiracy sharing in Twitter. We see no significant effect on makeup sharingin either platform", "after": "conspiracy-channel sharing in Reddit. For mainstream news sharing, we actually see an increase in trend on both platforms", "start_char_pos": 1084, "end_char_pos": 1179}, {"type": "R", "before": "targeting", "after": "suppressing", "start_char_pos": 1203, "end_char_pos": 1212}, {"type": "R", "before": "Reducing", "after": "This work finds evidence that reducing", "start_char_pos": 1261, "end_char_pos": 1269}, {"type": "R", "before": "without deleting them therefore has the potential to improve quality across the information ecosystem, but additional", "after": "within YouTube, without deletion, has potential pro-social, cross-platform effects. At the same time, increases in the level of conspiracy-channel sharing raise concerns about content producers' responses to these changes, and platform", "start_char_pos": 1301, "end_char_pos": 1418}], "sents_char_pos": [0, 273, 434, 620, 744, 967, 1114, 1260]} {"doc_id": "2003.03025", "revision_depth": "1", "before_revision": "An adaptive guidance system that supports equipment operators requires a comprehensive model of task and user behavior that considers different skill and knowledge levels as well as diverse situations. In this study , we investigated the relationships between user behaviors and skill levels under operational conditions. We captured sixty samples of two sewing tasks performed by five operators using a head-mounted RGB-d camera and a static gaze tracker. We examined the operators' gazeand head movements, and hand interactions to essential regions (hotspotson machine surface) to determine behavioral differences among continuous skill improving experiences. We modeled the variety of user behaviors to an extensive task model with a two-step automatic approach, baseline model selection and experience integration. The experimental results indicate that some features, such as task execution time and user head movements, are good indexes for skill level and provide valuable information that can be applied to obtain an effective task model. Operators with varying knowledge and operating habits demonstrate different operational features, which can contribute to the design of user-specific guidance .", "after_revision": "An adaptive guidance system that supports equipment operators requires a comprehensive model of task and user behavior that considers different skill and knowledge levels as well as diverse situations. In the present paper, we introduced a novel method for machine operation modeling aimed to integrate visual operation records provided by users with different skills, knowledge levels, and interpersonal behavior patterns. For this purpose , we investigated the relationships between user behavior patterns that could be visually observed and their skill levels under machine operation conditions. We considered sixty samples of two sewing tasks performed by five operators using a head-mounted RGB-D camera and a static gaze tracker. We examined behavioral features, such as the operator gaze, head movements, and hand interactions with hotspots, and observed significant behavioral changes as a result of continuous skill improvement. We automatically modeled the variety of behaviors of operation tasks with a two-step approach, prototype selection and experiences integration. The experimental results indicated that features, such as duration of task execution and user head movements, could serve as appropriate indices for skill level evaluation, and provide useful information for integrating various records corresponding to different skill levels and behavioral characteristics. Integrating operation records with operating habits allowed developing a rich inclusive task model that could be used to flexibly adapt to various user-specific behavior patterns .", "edit_actions": [{"type": "R", "before": "this study", "after": "the present paper, we introduced a novel method for machine operation modeling aimed to integrate visual operation records provided by users with different skills, knowledge levels, and interpersonal behavior patterns. For this purpose", "start_char_pos": 205, "end_char_pos": 215}, {"type": "R", "before": "behaviors and", "after": "behavior patterns that could be visually observed and their", "start_char_pos": 265, "end_char_pos": 278}, {"type": "R", "before": "operational", "after": "machine operation", "start_char_pos": 298, "end_char_pos": 309}, {"type": "R", "before": "captured", "after": "considered", "start_char_pos": 325, "end_char_pos": 333}, {"type": "R", "before": "RGB-d", "after": "RGB-D", "start_char_pos": 417, "end_char_pos": 422}, {"type": "R", "before": "the operators' gazeand", "after": "behavioral features, such as the operator gaze,", "start_char_pos": 469, "end_char_pos": 491}, {"type": "R", "before": "to essential regions (hotspotson machine surface) to determine behavioral differences among continuous skill improving experiences. We", "after": "with hotspots, and observed significant behavioral changes as a result of continuous skill improvement. We automatically", "start_char_pos": 530, "end_char_pos": 664}, {"type": "R", "before": "user behaviors to an extensive task model", "after": "behaviors of operation tasks", "start_char_pos": 688, "end_char_pos": 729}, {"type": "R", "before": "automatic approach, baseline model selection and experience", "after": "approach, prototype selection and experiences", "start_char_pos": 746, "end_char_pos": 805}, {"type": "R", "before": "indicate that some", "after": "indicated that", "start_char_pos": 844, "end_char_pos": 862}, {"type": "R", "before": "task execution time", "after": "duration of task execution", "start_char_pos": 881, "end_char_pos": 900}, {"type": "R", "before": "are good indexes", "after": "could serve as appropriate indices", "start_char_pos": 926, "end_char_pos": 942}, {"type": "R", "before": "and provide valuable information that can be applied to obtain an effective task model. Operators with varying knowledge and operating habits demonstrate different operational features, which can contribute to the design of", "after": "evaluation, and provide useful information for integrating various records corresponding to different skill levels and behavioral characteristics. Integrating operation records with operating habits allowed developing a rich inclusive task model that could be used to flexibly adapt to various", "start_char_pos": 959, "end_char_pos": 1182}, {"type": "R", "before": "guidance", "after": "behavior patterns", "start_char_pos": 1197, "end_char_pos": 1205}], "sents_char_pos": [0, 201, 321, 456, 661, 818, 1046]} {"doc_id": "2003.05113", "revision_depth": "1", "before_revision": "Many proofs of concept blockchain applications built using Hyperledger Fabric, a permissioned blockchain platform, have recently been transformed into production. However, the performance provided by Hyperledger Fabric is of significant concern for enterprises due to steady growth in network usage. Hence, in this paper, we study the performance achieved in a Fabricnetwork using vertical scaling (i.e., by adding more vCPUs) and horizontal scaling (i. e., by adding more nodes) techniques. We observe that network scales very poorly with both of these techniques. With vertical scaling, due to serial execution of validation commit phases of transactions, the allocated vCPUs are underutilized. With horizontal scaling, due to redundant work between nodes , allocated resources are wasted though it is utilized. Further, we identify these techniques to be unsuited for dynamically scaling anetwork quickly to mitigate an overload situation, and hence, it results in a 30\\% drop in the performance. To increase the CPU utilization and hence the performance, we re-architect Fabric to enable pipelined execution of validation & commit phases by introducing dirty state management using a trie data structure. Additionally, we facilitated the validation phase to validate transactions in parallel by introducing a waiting-transactions dependency graph. To avoid redundant work performed between nodes and to quickly scale up a network, we propose a new type of peer node called sparse peer , which selective commits transactions. Overall, we improved the throughput by 3x and reduced the timetaken to scale up a network by 96\\% .", "after_revision": "Permissioned blockchains are becoming popular as data management systems in the enterprise setting. Compared to traditional distributed databases, blockchain platforms provide increased security guarantees but significantly lower performance. Further, these platforms are quite expensive to run for the low throughput they provide. The following are two ways to improve performance and reduce cost: (1) make the system utilize allocated resources efficiently; (2) allow rapid and dynamic scaling of allocated resources based on load. We explore both of these in this work. We first investigate the reasons for the poor performance and scalability of the dominant permissioned blockchain flavor called Execute-Order-Validate (EOV). We do this by studying the scaling characteristics of Hyperledger Fabric, a popular EOV platform, using vertical scaling and horizontal scaling . We find that the transaction throughput scales very poorly with these techniques. At least in the permissioned setting, the real bottleneck is transaction processing, not the consensus protocol. With vertical scaling, the allocated vCPUs go under-utilized. In contrast, with horizontal scaling, the allocated resources get wasted due to redundant work across nodes within URLanization. To mitigate the above concerns, we first improve resource efficiency by (a) improving CPU utilization with a pipelined execution of validation & commit phases ; (b) avoiding redundant work across nodes by introducing a new type of peer node called sparse peer that selectively commits transactions. We further propose a technique that enables the rapid scaling of resources. Our implementation - SmartFabric, built on top of Hyperledger Fabric demonstrates 3x higher throughput, 12-26x faster scale-up time, and provides Fabric's throughput at 50\\% to 87\\% lower cost .", "edit_actions": [{"type": "R", "before": "Many proofs of concept blockchain applications built using Hyperledger Fabric, a permissioned blockchain platform, have recently been transformed into production. However, the performance provided by Hyperledger Fabric is of significant concern for enterprises due to steady growth in network usage. Hence, in this paper, we study the performance achieved in a Fabricnetwork", "after": "Permissioned blockchains are becoming popular as data management systems in the enterprise setting. Compared to traditional distributed databases, blockchain platforms provide increased security guarantees but significantly lower performance. Further, these platforms are quite expensive to run for the low throughput they provide. The following are two ways to improve performance and reduce cost: (1) make the system utilize allocated resources efficiently; (2) allow rapid and dynamic scaling of allocated resources based on load. We explore both of these in this work. We first investigate the reasons for the poor performance and scalability of the dominant permissioned blockchain flavor called Execute-Order-Validate (EOV). We do this by studying the scaling characteristics of Hyperledger Fabric, a popular EOV platform,", "start_char_pos": 0, "end_char_pos": 374}, {"type": "D", "before": "(i.e., by adding more vCPUs)", "after": null, "start_char_pos": 398, "end_char_pos": 426}, {"type": "R", "before": "(i. e., by adding more nodes) techniques. We observe that network", "after": ". We find that the transaction throughput", "start_char_pos": 450, "end_char_pos": 515}, {"type": "D", "before": "both of", "after": null, "start_char_pos": 540, "end_char_pos": 547}, {"type": "A", "before": null, "after": "At least in the permissioned setting, the real bottleneck is transaction processing, not the consensus protocol.", "start_char_pos": 566, "end_char_pos": 566}, {"type": "D", "before": "due to serial execution of validation", "after": null, "start_char_pos": 590, "end_char_pos": 627}, {"type": "D", "before": "commit phases of transactions,", "after": null, "start_char_pos": 628, "end_char_pos": 658}, {"type": "R", "before": "are underutilized. With", "after": "go under-utilized. In contrast, with", "start_char_pos": 679, "end_char_pos": 702}, {"type": "A", "before": null, "after": "the allocated resources get wasted", "start_char_pos": 723, "end_char_pos": 723}, {"type": "R", "before": "between nodes , allocated resources are wasted though it is utilized. Further, we identify these techniques to be unsuited for dynamically scaling anetwork quickly to mitigate an overload situation, and hence, it results in a 30\\% drop in the performance. To increase the CPU utilization and hence the performance, we re-architect Fabric to enable", "after": "across nodes within URLanization. To mitigate the above concerns, we first improve resource efficiency by (a) improving CPU utilization with a", "start_char_pos": 746, "end_char_pos": 1093}, {"type": "R", "before": "by introducing dirty state management using a trie data structure. Additionally, we facilitated the validation phase to validate transactions in parallel by introducing a waiting-transactions dependency graph. To avoid redundant work performed between nodes and to quickly scale up a network, we propose a", "after": "; (b) avoiding redundant work across nodes by introducing a", "start_char_pos": 1144, "end_char_pos": 1449}, {"type": "R", "before": ", which selective", "after": "that selectively", "start_char_pos": 1491, "end_char_pos": 1508}, {"type": "R", "before": "Overall, we improved the throughput by", "after": "We further propose a technique that enables the rapid scaling of resources. Our implementation - SmartFabric, built on top of Hyperledger Fabric demonstrates", "start_char_pos": 1531, "end_char_pos": 1569}, {"type": "R", "before": "and reduced the timetaken to scale up a network by 96\\%", "after": "higher throughput, 12-26x faster scale-up time, and provides Fabric's throughput at 50\\% to 87\\% lower cost", "start_char_pos": 1573, "end_char_pos": 1628}], "sents_char_pos": [0, 162, 299, 491, 565, 697, 815, 1001, 1210, 1353, 1530]} {"doc_id": "2003.08149", "revision_depth": "1", "before_revision": "Protein-ligand interaction is one of the fundamental molecular interactions of living systems. Proteins are the building blocks of functions in life at the molecular level. Ligands are small molecules that interact with proteins at specific regions on the surface of proteins called binding sites. Understanding the physicochemical properties of ligand-binding sites is very important in the field of drug discovery as well as understanding biological systems. Protein-ligand binding site plays an essential role in the interaction between protein and ligand that is necessary for any living system to survive. Comparing similarities between binding siteshas been one of the main focus areas since the last decade in bioinformatics and drug discovery . In this regard, several computational methods have been developed to compare binding sites so far. Binding site comparison requires fast and efficient method as the amount of three-dimensional protein structural information is increasing rapidly nowadays . We report in this study, development of Site2Vec , a novel machine learning-based method for reference frame invariant ligand-independent vector embedding of the 3D structure of a protein-ligand binding site. Each binding site is represented in a d-dimensional vector form. The 3D structures of binding sites are mapped to vector form such that similar binding sites hash into proximal localities, and dissimilar sitesfall across diverse regions. A sensitivity analysis of rotation and perturbation and validation study is performed to understand the behavior of the method . Benchmarking exercises have been carried out against state of the art binding site comparison methods on state of the art datasets. The exercises validate our proposed method and demonstrate that the proposed method is rotationally invariant and can handle natural perturbations expected in the biological system.", "after_revision": "Protein-ligand interactions are one of the fundamental types of molecular interactions in living systems. Ligands are small molecules that interact with protein molecules at specific regions on their surfaces called binding sites. Tasks such as assessment of protein functional similarity and detection of side effects of drugs need identification of similar binding sites of disparate proteins across diverse pathways. Machine learning methods for similarity assessment require feature descriptors of binding sites. Traditional methods based on hand engineered motifs and atomic configurations are not scalable across several thousands of sites . In this regard, deep neural network algorithms are now deployed which can capture very complex input feature space. However, one fundamental challenge in applying deep learning to structures of binding sites is the input representation and the reference frame . We report here a novel algorithm Site2Vec that derives reference frame invariant vector embedding of a protein-ligand binding site. The method is based on pairwise distances between representative points and chemical compositions in terms of constituent amino acids of a site. The vector embedding serves as a locality sensitive hash function for proximity queries and determining similar sites. The method has been the top performer with more than 95\\% quality scores in extensive benchmarking studies carried over 10 datasets and against 23 other site comparison methods . The algorithm serves for high throughput processing and has been evaluated for stability with respect to reference frame shifts, coordinate perturbations and residue mutations. We provide Site2Vec as a stand alone executable and a web service hosted at URL", "edit_actions": [{"type": "R", "before": "interaction is", "after": "interactions are", "start_char_pos": 15, "end_char_pos": 29}, {"type": "R", "before": "molecular interactions of", "after": "types of molecular interactions in", "start_char_pos": 53, "end_char_pos": 78}, {"type": "D", "before": "Proteins are the building blocks of functions in life at the molecular level.", "after": null, "start_char_pos": 95, "end_char_pos": 172}, {"type": "R", "before": "proteins", "after": "protein molecules", "start_char_pos": 220, "end_char_pos": 228}, {"type": "R", "before": "the surface of proteins", "after": "their surfaces", "start_char_pos": 252, "end_char_pos": 275}, {"type": "R", "before": "Understanding the physicochemical properties of ligand-binding sites is very important in the field of drug discovery as well as understanding biological systems. Protein-ligand binding site plays an essential role in the interaction between protein and ligand that is necessary for any living system to survive. Comparing similarities between binding siteshas been one of the main focus areas since the last decade in bioinformatics and drug discovery", "after": "Tasks such as assessment of protein functional similarity and detection of side effects of drugs need identification of similar binding sites of disparate proteins across diverse pathways. Machine learning methods for similarity assessment require feature descriptors of binding sites. Traditional methods based on hand engineered motifs and atomic configurations are not scalable across several thousands of sites", "start_char_pos": 298, "end_char_pos": 750}, {"type": "R", "before": "several computational methods have been developed to compare binding sites so far. Binding site comparison requires fast and efficient method as the amount of three-dimensional protein structural information is increasing rapidly nowadays", "after": "deep neural network algorithms are now deployed which can capture very complex input feature space. However, one fundamental challenge in applying deep learning to structures of binding sites is the input representation and the reference frame", "start_char_pos": 769, "end_char_pos": 1007}, {"type": "R", "before": "in this study, development of", "after": "here a novel algorithm", "start_char_pos": 1020, "end_char_pos": 1049}, {"type": "R", "before": ", a novel machine learning-based method for", "after": "that derives", "start_char_pos": 1059, "end_char_pos": 1102}, {"type": "D", "before": "ligand-independent", "after": null, "start_char_pos": 1129, "end_char_pos": 1147}, {"type": "D", "before": "the 3D structure of", "after": null, "start_char_pos": 1168, "end_char_pos": 1187}, {"type": "R", "before": "Each binding site is represented in a d-dimensional vector form. The 3D structures of binding sites are mapped to vector form such that similar binding sites hash into proximal localities, and dissimilar sitesfall across diverse regions. A sensitivity analysis of rotation and perturbation and validation study is performed to understand the behavior of the method . Benchmarking exercises have been carried out against state of the art binding", "after": "The method is based on pairwise distances between representative points and chemical compositions in terms of constituent amino acids of a site. The vector embedding serves as a locality sensitive hash function for proximity queries and determining similar sites. The method has been the top performer with more than 95\\% quality scores in extensive benchmarking studies carried over 10 datasets and against 23 other", "start_char_pos": 1219, "end_char_pos": 1663}, {"type": "R", "before": "on state of the art datasets. The exercises validate our proposed method and demonstrate that the proposed method is rotationally invariant and can handle natural perturbations expected in the biological system.", "after": ". The algorithm serves for high throughput processing and has been evaluated for stability with respect to reference frame shifts, coordinate perturbations and residue mutations. We provide Site2Vec as a stand alone executable and a web service hosted at URL", "start_char_pos": 1688, "end_char_pos": 1899}], "sents_char_pos": [0, 94, 172, 297, 460, 610, 752, 851, 1009, 1218, 1283, 1456, 1585, 1717]} {"doc_id": "2003.08150", "revision_depth": "1", "before_revision": "An outbreak of respiratory disease caused by a novel coronavirus is ongoing till December 2019. As of March 16 2020, It has caused an epidemic outbreak with more than 1,79,073 confirmed infections and 7,074 reported deaths worldwide. During the period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease (COVID ) are rising worldwide, forecasting is of utmost importance for health care planning and control the virus with limited resource . In this study, we propose and analyze a compartmental epidemic model of COVID to predict and control the outbreak. The basic reproduction number and control reproduction number are calculated analytically. A detailed stability analysis of the model is performed to observe the dynamics of the system. We calibrated the proposed model to fit daily data from five provinces of China namely, Hubei, Guangdong, Henan, Zhejiang and Hunan . Our findings suggest that independent self-sustaining human-to-human spread (R_0>1, R_c>1) is already present in all the five provinces . Short-term predictions show that the decreasing trend of new COVID cases is well captured by the model for all the five provinces. However, long term predictions for Hubei reveals that the symptomatic COVID cases will show oscillatory behaviour. Further, we found that effective management of quarantined individuals is more effective than management of isolated individuals to reduce the disease burden. Numerical results show that the modification factor for quarantine, modification factor for isolation and transmission rate are quite effective in reduction of the COVID casesin Hubei. Thus, COVID is controllable by reducing contacts with infected people and increasing the efficiency of quarantine and isolation. Health care officials should supply medications, protective masks and necessary human resources in the affected areas .", "after_revision": "An outbreak of respiratory disease caused by a novel coronavirus is ongoing from December 2019. As of June 30, 2020, it has caused an epidemic outbreak with more than 10 million confirmed infections and above 5 hundred thousand reported deaths worldwide. During this period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease 2019 (COVID-19 ) are rising worldwide, investigation of control strategies and forecasting are necessary for health care planning . In this study, we propose and analyze a compartmental epidemic model of COVID-19 to predict and control the outbreak. The basic reproduction number and control reproduction number are calculated analytically. A detailed stability analysis of the model is performed to observe the dynamics of the system. We calibrated the proposed model to fit daily data from the United Kingdom (UK) where the situation is still alarming . Our findings suggest that independent self-sustaining human-to-human spread (R_0>1, R_c>1) is already present . Short-term predictions show that the decreasing trend of new COVID-19 cases is well captured by the model . Further, we found that effective management of quarantined individuals is more effective than management of isolated individuals to reduce the disease burden. Thus, if limited resources are available, then investing on the quarantined individuals will be more fruitful in terms of reduction of cases .", "edit_actions": [{"type": "R", "before": "till", "after": "from", "start_char_pos": 76, "end_char_pos": 80}, {"type": "R", "before": "March 16", "after": "June 30,", "start_char_pos": 102, "end_char_pos": 110}, {"type": "R", "before": "It", "after": "it", "start_char_pos": 117, "end_char_pos": 119}, {"type": "R", "before": "1,79,073", "after": "10 million", "start_char_pos": 167, "end_char_pos": 175}, {"type": "R", "before": "7,074", "after": "above 5 hundred thousand", "start_char_pos": 201, "end_char_pos": 206}, {"type": "R", "before": "the", "after": "this", "start_char_pos": 241, "end_char_pos": 244}, {"type": "R", "before": "(COVID", "after": "2019 (COVID-19", "start_char_pos": 357, "end_char_pos": 363}, {"type": "R", "before": "forecasting is of utmost importance", "after": "investigation of control strategies and forecasting are necessary", "start_char_pos": 388, "end_char_pos": 423}, {"type": "D", "before": "and control the virus with limited resource", "after": null, "start_char_pos": 449, "end_char_pos": 492}, {"type": "R", "before": "COVID", "after": "COVID-19", "start_char_pos": 567, "end_char_pos": 572}, {"type": "R", "before": "five provinces of China namely, Hubei, Guangdong, Henan, Zhejiang and Hunan", "after": "the United Kingdom (UK) where the situation is still alarming", "start_char_pos": 852, "end_char_pos": 927}, {"type": "D", "before": "in all the five provinces", "after": null, "start_char_pos": 1040, "end_char_pos": 1065}, {"type": "R", "before": "COVID", "after": "COVID-19", "start_char_pos": 1129, "end_char_pos": 1134}, {"type": "R", "before": "for all the five provinces. However, long term predictions for Hubei reveals that the symptomatic COVID cases will show oscillatory behaviour.", "after": ".", "start_char_pos": 1171, "end_char_pos": 1313}, {"type": "R", "before": "Numerical results show that the modification factor for quarantine, modification factor for isolation and transmission rate are quite effective in reduction of the COVID casesin Hubei. Thus, COVID is controllable by reducing contacts with infected people and increasing the efficiency of quarantine and isolation. Health care officials should supply medications, protective masks and necessary human resources in the affected areas", "after": "Thus, if limited resources are available, then investing on the quarantined individuals will be more fruitful in terms of reduction of cases", "start_char_pos": 1473, "end_char_pos": 1904}], "sents_char_pos": [0, 95, 233, 494, 609, 700, 795, 929, 1067, 1198, 1313, 1472, 1657, 1786]} {"doc_id": "2003.08468", "revision_depth": "1", "before_revision": "A graph is fan-crossing free if it admits a drawing in the plane so that each edge can be crossed by independent edges . Then the crossing edges have distinct vertices. In complement, a graph is fan-crossing if each edge can be crossed by edges of a fan. Then the crossing edges are incident to a common vertex . Graphs are k-planar if each edge is crossed by at most k edges, and k-gap-planar if each crossing is assigned to an edge involved in the crossing, so that at most k crossings are assigned to each edge . We use the s-subdivision, path-addition, and node-to-circle expansion operations to show that there are fan-crossing free graphs that are not fan-crossing, k-planar, and k-gap-planar for k >= 1, respectively. A path-addition adds a long path between any two vertices to a graph . An s-subdivision replaces an edge by a path of length s, and a node-to-circle expansion substitutes a vertex by a 3-regular circle, so that each vertex of the circle inherits an edge incident to the original vertex. We introduce universality for an operation and a graph class, so the every graph has an image in the graph class. In particular, we show the fan22 crossing free graphs are universal for 2-subdivision and for node-to-circle 3 expansion . Finally, we show that some graphs have a unique fan-crossing free embedding, that there are maximal fan-crossing free graphs with less edges than the density , and that the recognition problem for fan-crossing free graphs is NP-complete.", "after_revision": "A graph is fan-crossing free if it has a drawing in the plane so that each edge is crossed by independent edges , that is the crossing edges have distinct vertices. On the other hand, it isfan-crossing if the crossing edges have a common vertex , that is they form a fan. Both are prominent examples for beyond-planar graphs. Further well-known beyond-planar classes are the k-planar , k-gap-planar , quasi-planar, and right angle crossing graphs . We use the subdivision, node-to-circle expansion and path-addition operations to distinguish all these graph classes. In particular, we show that the 2-subdivision and the node-to-circle expansion of any graph is fan-crossing free, which does not hold for fan-crossing and k-(gap)-planar graphs, respectively. Thereby, we obtain graphs that are fan-crossing free and neither fan-crossing nor k-(gap)-planar . Finally, we show that some graphs have a unique fan-crossing free embedding, that there are thinned maximal fan-crossing free graphs , and that the recognition problem for fan-crossing free graphs is NP-complete.", "edit_actions": [{"type": "R", "before": "fan-crossing free if it admits", "after": "fan-crossing free", "start_char_pos": 11, "end_char_pos": 41}, {"type": "A", "before": null, "after": "if it has", "start_char_pos": 42, "end_char_pos": 42}, {"type": "R", "before": "can be", "after": "is", "start_char_pos": 84, "end_char_pos": 90}, {"type": "R", "before": ". Then", "after": ", that is", "start_char_pos": 120, "end_char_pos": 126}, {"type": "R", "before": "In complement, a graph is fan-crossing if each edge can be crossed by edges of a fan. Then", "after": "On the other hand, it is", "start_char_pos": 170, "end_char_pos": 260}, {"type": "A", "before": null, "after": "fan-crossing", "start_char_pos": 260, "end_char_pos": 260}, {"type": "A", "before": null, "after": "if", "start_char_pos": 261, "end_char_pos": 261}, {"type": "R", "before": "are incident to", "after": "have", "start_char_pos": 281, "end_char_pos": 296}, {"type": "R", "before": ". Graphs are", "after": ", that is they form a fan. Both are prominent examples for beyond-planar graphs. Further well-known beyond-planar classes are the", "start_char_pos": 313, "end_char_pos": 325}, {"type": "R", "before": "if each edge is crossed by at most k edges, and", "after": ",", "start_char_pos": 335, "end_char_pos": 382}, {"type": "R", "before": "if each crossing is assigned to an edge involved in the crossing, so that at most k crossings are assigned to each edge", "after": ", quasi-planar, and right angle crossing graphs", "start_char_pos": 396, "end_char_pos": 515}, {"type": "R", "before": "s-subdivision, path-addition, and", "after": "subdivision,", "start_char_pos": 529, "end_char_pos": 562}, {"type": "D", "before": "operations to show that there are fan-crossing free graphs that are not fan-crossing, k-planar, and k-gap-planar for k >= 1, respectively. A path-addition adds a long path between any two vertices to a graph . An s-subdivision replaces an edge by a path of length s,", "after": null, "start_char_pos": 588, "end_char_pos": 854}, {"type": "R", "before": "a node-to-circle expansion substitutes a vertex by a 3-regular circle, so that each vertex of the circle inherits an edge incident to the original vertex. We introduce universality for an operation and a graph class, so the every graph has an image in the graph class. In particular, we show the fan22 crossing free graphs are universal for", "after": "path-addition operations to distinguish all these graph classes. In particular, we show that the", "start_char_pos": 859, "end_char_pos": 1199}, {"type": "R", "before": "for", "after": "the", "start_char_pos": 1218, "end_char_pos": 1221}, {"type": "D", "before": "3", "after": null, "start_char_pos": 1237, "end_char_pos": 1238}, {"type": "A", "before": null, "after": "of any graph is fan-crossing free, which does not hold for fan-crossing and k-(gap)-planar graphs, respectively. Thereby, we obtain graphs that are fan-crossing free and neither fan-crossing nor k-(gap)-planar", "start_char_pos": 1249, "end_char_pos": 1249}, {"type": "A", "before": null, "after": "thinned", "start_char_pos": 1344, "end_char_pos": 1344}, {"type": "D", "before": "with less edges than the density", "after": null, "start_char_pos": 1378, "end_char_pos": 1410}], "sents_char_pos": [0, 121, 169, 255, 517, 726, 1013, 1127, 1251]} {"doc_id": "2003.09638", "revision_depth": "1", "before_revision": "Graph Convolutional Network (GCN) has shown strong effectiveness in graph learning tasks. However, GCN faces challenges in flexibility due to the fact of requiring the full graph Laplacian available in the training phase. Moreover, with the depth of layers increases, the computational and memory cost of GCN grows explosively on account of the recursive neighborhood expansion , which leads to a limitation in processing large graphs . To tackle these issues, we take advantage of image processing in agility and present Node2Img , a flexible architecture for large-scale graph learning. Node2Img maps the nodes to \"images\" (i.e. grid-like data in Euclidean space) which can be the inputs of Convolutional Neural Network (CNN) . Instead of leveraging the fixed whole network as a batch to train the model, Node2Img supports a more efficacious framework in practice, where the batch size can be set elastically and the data in the same batch can be calculated parallelly. Specifically, by ranking each node's influence through degree, Node2Img selects the most influential first-order as well as second-order neighbors with central node fusion information to construct the grid-like data. For further improving the efficiency of downstream tasks, a simple CNN-based neural network is employed to capture the significant information from the Euclidean grids. Additionally, the attention mechanism is implemented, which enables implicitly specifying the different weights for neighboring nodes with different influences. Extensive experiments on real graphs' transductive and inductive learning tasks demonstrate the superiority of the proposed Node2Img model against the state-of-the-art GCN-based approaches.", "after_revision": "Graph Convolutional Network (GCN) has been widely used in graph learning tasks. However, GCN-based models (GCNs) is an inherently coupled training framework repetitively conducting the complex neighboring aggregation, which leads to the limitation of flexibility in processing large-scale graph. With the depth of layers increases, the computational and memory cost of GCNs grow explosively due to the recursive neighborhood expansion . To tackle these issues, we present Node2Grids , a flexible uncoupled training framework that leverages the independent mapped data for obtaining the embedding . Instead of directly processing the coupled nodes as GCNs, Node2Grids supports a more efficacious method in practice, mapping the coupled graph data into the independent grid-like data which can be fed into the efficient Convolutional Neural Network (CNN). This simple but valid strategy significantly saves memory and computational resource while achieving comparable results with the leading GCN-based models. Specifically, by ranking each node's influence through degree, Node2Grids selects the most influential first-order as well as second-order neighbors with central node fusion information to construct the grid-like data. For further improving the efficiency of downstream tasks, a simple CNN-based neural network is employed to capture the significant information from the mapped grid-like data. Moreover, the grid-level attention mechanism is implemented, which enables implicitly specifying the different weights for neighboring nodes with different influences. In addition to the typical transductive and inductive learning tasks , we also verify our framework on million-scale graphs to demonstrate the superiority of the proposed Node2Grids model against the state-of-the-art GCN-based approaches.", "edit_actions": [{"type": "R", "before": "shown strong effectiveness", "after": "been widely used", "start_char_pos": 38, "end_char_pos": 64}, {"type": "R", "before": "GCN faces challenges in flexibility due to the fact of requiring the full graph Laplacian available in the training phase. Moreover, with", "after": "GCN-based models (GCNs) is an inherently coupled training framework repetitively conducting the complex neighboring aggregation, which leads to the limitation of flexibility in processing large-scale graph. With", "start_char_pos": 99, "end_char_pos": 236}, {"type": "R", "before": "GCN grows explosively on account of", "after": "GCNs grow explosively due to", "start_char_pos": 305, "end_char_pos": 340}, {"type": "D", "before": ", which leads to a limitation in processing large graphs", "after": null, "start_char_pos": 378, "end_char_pos": 434}, {"type": "R", "before": "take advantage of image processing in agility and present Node2Img", "after": "present Node2Grids", "start_char_pos": 464, "end_char_pos": 530}, {"type": "R", "before": "architecture for large-scale graph learning. Node2Img maps the nodes to \"images\" (i.e. grid-like data in Euclidean space) which can be the inputs of Convolutional Neural Network (CNN)", "after": "uncoupled training framework that leverages the independent mapped data for obtaining the embedding", "start_char_pos": 544, "end_char_pos": 727}, {"type": "R", "before": "leveraging the fixed whole network as a batch to train the model, Node2Img", "after": "directly processing the coupled nodes as GCNs, Node2Grids", "start_char_pos": 741, "end_char_pos": 815}, {"type": "R", "before": "framework", "after": "method", "start_char_pos": 844, "end_char_pos": 853}, {"type": "R", "before": "where the batch size can be set elastically and the data in the same batch can be calculated parallelly.", "after": "mapping the coupled graph data into the independent grid-like data which can be fed into the efficient Convolutional Neural Network (CNN). This simple but valid strategy significantly saves memory and computational resource while achieving comparable results with the leading GCN-based models.", "start_char_pos": 867, "end_char_pos": 971}, {"type": "R", "before": "Node2Img", "after": "Node2Grids", "start_char_pos": 1035, "end_char_pos": 1043}, {"type": "R", "before": "Euclidean grids. Additionally, the", "after": "mapped grid-like data. Moreover, the grid-level", "start_char_pos": 1341, "end_char_pos": 1375}, {"type": "R", "before": "Extensive experiments on real graphs'", "after": "In addition to the typical", "start_char_pos": 1519, "end_char_pos": 1556}, {"type": "A", "before": null, "after": ", we also verify our framework on million-scale graphs to", "start_char_pos": 1599, "end_char_pos": 1599}, {"type": "R", "before": "Node2Img", "after": "Node2Grids", "start_char_pos": 1644, "end_char_pos": 1652}], "sents_char_pos": [0, 89, 221, 436, 588, 971, 1188, 1357, 1518]} {"doc_id": "2003.09895", "revision_depth": "1", "before_revision": "We introduce a new measure for quantifying the amount of information that the nodes in a network need to learn to jointly solve a graph problem. We show that the local information cost presents a natural lower bound on the communication complexity of distributed algorithms. We demonstrate the application of local information cost by deriving a lower bound on the communication complexity of computing a (2t-1)-spanner that consists of at most O(n^{1+ \\frac{1 + \\epsilon}) edges, where \\epsilon = \\Theta %DIFDELCMD < \\left( {%%% 1 / t^2%DIFDELCMD < } \\right)%%% . Our main result is that any O( \\text{poly (n))-time algorithm must send at least \\tilde\\Omega %DIFDELCMD < \\left(1{t^2} %%% n ^{1+ 1 / 2t } %DIFDELCMD < \\right) %%% bits in the CONGEST model under the KT1 assumption , where each node has knowledge of its neighbors' IDs initially . Previously, only a trivial lower bound of \\tilde \\Omega(n) bits was known for this problem ; in fact, our result is the first nontrivial lower bound on the communication complexity of a sparse subgraph problem under the KT1 assumption . A consequence of our lower bound is that achieving both time- and communication-optimality is impossible when designing spanner algorithms for this setting . In light of the work of King, Kutten, and Thorup (PODC 2015), this shows that computing a minimum spanning tree can be done significantly faster than finding a spanner when considering algorithms with \\tilde O(n) communication complexity. Our result also implies time complexity lower bounds for constructing a spanner in the node-congested clique of Augustine et al. (2019) and in the push-pull gossip model with limited bandwidth.", "after_revision": "We introduce a new measure for quantifying the amount of information that the nodes in a network need to learn to jointly solve a graph problem. We show that the local information cost (LIC) presents a natural lower bound on the communication complexity of distributed algorithms. For the synchronous CONGEST-KT1 model, where each node has initial knowledge of its neighbors' IDs, we prove that \\Omega(LIC_\\gamma(P)/ \\log\\tau \\log n) bits are required for solving a graph problem P with a \\tau-round algorithm that errs with probability at most \\gamma. Our result is the first lower bound that yields a general trade-off between communication and time for graph problems in the CONGEST-KT1 model. We demonstrate how to apply the local information cost by deriving a lower bound on the communication complexity of computing a (2t-1)-spanner that consists of at most O(n^{1+ 1/t + \\epsilon}) edges, where \\epsilon = \\Theta %DIFDELCMD < \\left( {%%% ( 1 / %DIFDELCMD < } \\right)%%% t^2) . Our main result is that any O( poly (n))-time algorithm must send at least \\tilde\\Omega %DIFDELCMD < \\left(1{t^2} %%% ((1/t^2) n ^{1+ 1 / 2t } %DIFDELCMD < \\right) %%% ) bits in the CONGEST model under the KT1 assumption . Previously, only a trivial lower bound of \\tilde \\Omega(n) bits was known for this problem . A consequence of our lower bound is that achieving both time- and communication-optimality is impossible when designing a distributed spanner algorithm . In light of the work of King, Kutten, and Thorup (PODC 2015), this shows that computing a minimum spanning tree can be done significantly faster than finding a spanner when considering algorithms with \\tilde O(n) communication complexity. Our result also implies time complexity lower bounds for constructing a spanner in the node-congested clique of Augustine et al. (2019) and in the push-pull gossip model with limited bandwidth.", "edit_actions": [{"type": "A", "before": null, "after": "(", "start_char_pos": 185, "end_char_pos": 185}, {"type": "A", "before": null, "after": "LIC", "start_char_pos": 185, "end_char_pos": 185}, {"type": "A", "before": null, "after": ")", "start_char_pos": 185, "end_char_pos": 185}, {"type": "R", "before": "We demonstrate the application of", "after": "For the synchronous CONGEST-KT1 model, where each node has initial knowledge of its neighbors' IDs, we prove that \\Omega(", "start_char_pos": 276, "end_char_pos": 309}, {"type": "A", "before": null, "after": "LIC", "start_char_pos": 309, "end_char_pos": 309}, {"type": "A", "before": null, "after": "_\\gamma(P)/ \\log\\tau \\log n) bits are required for solving a graph problem P with a \\tau-round algorithm that errs with probability at most \\gamma. Our result is the first lower bound that yields a general trade-off between communication and time for graph problems in the CONGEST-KT1 model. We demonstrate how to apply the", "start_char_pos": 309, "end_char_pos": 309}, {"type": "R", "before": "\\frac{1", "after": "1/t", "start_char_pos": 454, "end_char_pos": 461}, {"type": "A", "before": null, "after": "(", "start_char_pos": 531, "end_char_pos": 531}, {"type": "D", "before": "t^2", "after": null, "start_char_pos": 536, "end_char_pos": 539}, {"type": "A", "before": null, "after": "t^2)", "start_char_pos": 565, "end_char_pos": 565}, {"type": "R", "before": "\\text{poly", "after": "poly", "start_char_pos": 599, "end_char_pos": 609}, {"type": "R", "before": "n", "after": "((1/t^2) n", "start_char_pos": 692, "end_char_pos": 693}, {"type": "A", "before": null, "after": ")", "start_char_pos": 733, "end_char_pos": 733}, {"type": "D", "before": ", where each node has knowledge of its neighbors' IDs initially", "after": null, "start_char_pos": 785, "end_char_pos": 848}, {"type": "D", "before": "; in fact, our result is the first nontrivial lower bound on the communication complexity of a sparse subgraph problem under the KT1 assumption", "after": null, "start_char_pos": 942, "end_char_pos": 1085}, {"type": "R", "before": "spanner algorithms for this setting", "after": "a distributed spanner algorithm", "start_char_pos": 1208, "end_char_pos": 1243}], "sents_char_pos": [0, 144, 275, 474, 943, 1087, 1245, 1484]} {"doc_id": "2003.10069", "revision_depth": "1", "before_revision": "Based on the Kac random walk on the orthogonal group, we present a fast Johnson-Lindenstrauss transform: given a set X of n points in \\mathbb{R^{d} and an error parameter \\epsilon, this is a linear transformation \\Psi: R^{d} }%DIFDELCMD < \\to %%% \\mathbb{R^{O(\\epsilon^{-2}n)} such that \\|\\Psi x\\|_{2} \\in (1- \\epsilon, } 1 +\\epsilon)\\cdot \\|x\\|_{2 for all x\\in X, and such that for each x\\in X, \\Psi x can be computed } ] ] ] in time O(d\\log{d} + \\min\\{d\\log{n, \\epsilon^{-2}\\log^{3}{n}\\log^{3}(\\epsilon^{-1}\\log{n}) \\}) with only a constant amount of memory overhead. In some parameter regimes, our algorithm is best known, and essentially confirms a conjecture of Ailon and Chazelle} ] ] .", "after_revision": "In this work, we analyze dimension reduction algorithms based on the Kac ^{d} and an error parameter \\epsilon, this is a linear transformation \\Psi: R^{d} }%DIFDELCMD < \\to %%% ^{O(\\epsilon^{-2}n)} such that \\|\\Psi x\\|_{2} \\in (1- \\epsilon, } walk and discrete variants. ( 1 for all x\\in X, and such that for each x\\in X, \\Psi x can be computed } ) For n points in \\mathbb{R SODA, 2008], and Bamberger and Krahmer arXiv, 2017]. Our algorithm is memory-optimal, and outperforms existing algorithms in regimes when n is sufficiently large and the distortion parameter is sufficiently small. In particular, this confirms a conjecture of Ailon and Chazelle STOC, 2006] in a stronger form. (2) The same construction gives a simple transform with optimal Restricted Isometry Property (RIP) which can be applied in time O(d\\log{d} , \\epsilon^{-2}\\log^{3}{n}\\log^{3}(\\epsilon^{-1}\\log{n}) \\}) with only a constant amount of memory overhead. In some parameter regimes, our algorithm is best known, and essentially confirms a conjecture of Ailon and Chazelle} ) for essentially the same range of sparsity as in the best-known such transform due to Ailon and Rauhut Discrete Comput. Geom., 2014]. (3) We show that by fixing the angle in the Kac walk to be \\pi/4 throughout, one obtains optimal JL and RIP transforms with almost the same running time, thereby confirming -- up to a \\log\\log{d SIAM J. Sci. Comput., 2010]. Our moment-based analysis of this modification of the Kac walk may also be of independent interest .", "edit_actions": [{"type": "R", "before": "Based", "after": "In this work, we analyze dimension reduction algorithms based", "start_char_pos": 0, "end_char_pos": 5}, {"type": "D", "before": "random walk on the orthogonal group, we present a fast Johnson-Lindenstrauss transform: given a set X of n points in \\mathbb{R", "after": null, "start_char_pos": 17, "end_char_pos": 143}, {"type": "D", "before": "\\mathbb{R", "after": null, "start_char_pos": 247, "end_char_pos": 256}, {"type": "A", "before": null, "after": "walk and discrete variants. (", "start_char_pos": 322, "end_char_pos": 322}, {"type": "D", "before": "+\\epsilon)\\cdot \\|x\\|_{2", "after": null, "start_char_pos": 325, "end_char_pos": 349}, {"type": "A", "before": null, "after": ") For n points in \\mathbb{R", "start_char_pos": 422, "end_char_pos": 422}, {"type": "A", "before": null, "after": "SODA, 2008", "start_char_pos": 423, "end_char_pos": 423}, {"type": "A", "before": null, "after": ", and Bamberger and Krahmer", "start_char_pos": 424, "end_char_pos": 424}, {"type": "A", "before": null, "after": "arXiv, 2017", "start_char_pos": 425, "end_char_pos": 425}, {"type": "A", "before": null, "after": ". Our algorithm is memory-optimal, and outperforms existing algorithms in regimes when n is sufficiently large and the distortion parameter is sufficiently small. In particular, this confirms a conjecture of Ailon and Chazelle", "start_char_pos": 426, "end_char_pos": 426}, {"type": "A", "before": null, "after": "STOC, 2006", "start_char_pos": 427, "end_char_pos": 427}, {"type": "A", "before": null, "after": "in a stronger form. (2) The same construction gives a simple transform with optimal Restricted Isometry Property (RIP) which can be applied", "start_char_pos": 429, "end_char_pos": 429}, {"type": "D", "before": "+ \\min\\{d\\log{n", "after": null, "start_char_pos": 449, "end_char_pos": 464}, {"type": "A", "before": null, "after": ") for essentially the same range of sparsity as in the best-known such transform due to Ailon and Rauhut", "start_char_pos": 690, "end_char_pos": 690}, {"type": "A", "before": null, "after": "Discrete Comput. Geom., 2014", "start_char_pos": 691, "end_char_pos": 691}, {"type": "A", "before": null, "after": ". (3) We show that by fixing the angle in the Kac walk to be \\pi/4 throughout, one obtains optimal JL and RIP transforms with almost the same running time, thereby confirming -- up to a \\log\\log{d", "start_char_pos": 692, "end_char_pos": 692}, {"type": "A", "before": null, "after": "SIAM J. Sci. Comput., 2010", "start_char_pos": 693, "end_char_pos": 693}, {"type": "A", "before": null, "after": ". Our moment-based analysis of this modification of the Kac walk may also be of independent interest", "start_char_pos": 694, "end_char_pos": 694}], "sents_char_pos": [0, 104, 572]} {"doc_id": "2003.10532", "revision_depth": "2", "before_revision": "We develop a simple 3-dimensional iterative map model to forecast the global spread of the coronavirus disease. Our model contains only one fitting parameter , which we determine from the data supplied by the world URLanisation for the total number of cases and new cases each day. We find that our model provides a surprisingly good fit to the currently-available data . It predicts that the disease will run its full course over six to seven months , starting from the date on which the world URLanisation provided the first ' Situation report' (21 January 2020 - day 1). The disease may be expected to infect approximately 24 \\% of the global population, i.e. about 1.83 billion people, taking approximately 86 million lives. Unless drastic new interventions become possible , the global number of new cases is predicted to peak on day 129 (about the middle of May 2020), with an estimated 65 million new cases per day. Since our simple model fits the available global data so well, we suggest that the measures being taken so far to contain the pandemic may be ineffective in curbing the global spread of the virus . As such, the efficacy of these measures should be more carefully weighed against their impact on the world economy.", "after_revision": "We develop a simple 3-dimensional iterative map model to forecast the global spread of the coronavirus disease. Our model contains at most two fitting parameters , which we determine from the data supplied by the world URLanisation for the total number of cases and new cases each day. We find that our model provides a surprisingly good fit to the currently-available data , which exhibits a cross-over from exponential to power-law growth, as lock-down measures begin to take effect. Before these measures, our model predicts exponential growth from day 30 to 69 , starting from the date on which the world URLanisation provided the first ` Situation report' (21 January 2020 - day 1). Based on this initial data the disease may be expected to infect approximately 23 \\% of the global population, i.e. about 1.76 billion people, taking approximately 83 million lives. Under this scenario , the global number of new cases is predicted to peak on day 133 (about the middle of May 2020), with an estimated 60 million new cases per day. If current lock-down measures can be maintained, our model predicts power law growth from day 69 onward. Such growth is comparatively slow and would have to continue for several decades before a sufficient number of people (at least 23\\% of the global population) have developed immunity to the disease through being infected. Lock-down measures appear to be very effective in postponing the unimaginably large peak in the daily number of new cases that would occur in the absence of any interventions. However, should these measure be relaxed, the spread of the disease will most likely revert back to its original exponential growth pattern . As such, the duration and severity of the lock-down measures should be carefully timed against their potentially devastating impact on the world economy.", "edit_actions": [{"type": "R", "before": "only one fitting parameter", "after": "at most two fitting parameters", "start_char_pos": 131, "end_char_pos": 157}, {"type": "R", "before": ". It predicts that the disease will run its full course over six to seven months", "after": ", which exhibits a cross-over from exponential to power-law growth, as lock-down measures begin to take effect. Before these measures, our model predicts exponential growth from day 30 to 69", "start_char_pos": 370, "end_char_pos": 450}, {"type": "R", "before": "'", "after": "`", "start_char_pos": 527, "end_char_pos": 528}, {"type": "R", "before": "The", "after": "Based on this initial data the", "start_char_pos": 574, "end_char_pos": 577}, {"type": "R", "before": "24", "after": "23", "start_char_pos": 626, "end_char_pos": 628}, {"type": "R", "before": "1.83", "after": "1.76", "start_char_pos": 669, "end_char_pos": 673}, {"type": "R", "before": "86", "after": "83", "start_char_pos": 711, "end_char_pos": 713}, {"type": "R", "before": "Unless drastic new interventions become possible", "after": "Under this scenario", "start_char_pos": 729, "end_char_pos": 777}, {"type": "R", "before": "129", "after": "133", "start_char_pos": 839, "end_char_pos": 842}, {"type": "R", "before": "65", "after": "60", "start_char_pos": 893, "end_char_pos": 895}, {"type": "R", "before": "Since our simple model fits the available global data so well, we suggest that the measures being taken so far to contain the pandemic may be ineffective in curbing the", "after": "If current lock-down measures can be maintained, our model predicts power law growth from day 69 onward. Such growth is comparatively slow and would have to continue for several decades before a sufficient number of people (at least 23\\% of the", "start_char_pos": 923, "end_char_pos": 1091}, {"type": "A", "before": null, "after": "population) have developed immunity to the disease through being infected. Lock-down measures appear to be very effective in postponing the unimaginably large peak in the daily number of new cases that would occur in the absence of any interventions. However, should these measure be relaxed, the", "start_char_pos": 1099, "end_char_pos": 1099}, {"type": "R", "before": "virus", "after": "disease will most likely revert back to its original exponential growth pattern", "start_char_pos": 1114, "end_char_pos": 1119}, {"type": "R", "before": "efficacy of these", "after": "duration and severity of the lock-down", "start_char_pos": 1135, "end_char_pos": 1152}, {"type": "R", "before": "more carefully weighed against their", "after": "carefully timed against their potentially devastating", "start_char_pos": 1172, "end_char_pos": 1208}], "sents_char_pos": [0, 111, 281, 371, 573, 728, 922, 1121]} {"doc_id": "2003.13557", "revision_depth": "1", "before_revision": "Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation on P is a full triangulation of some subset P' of P containing all extreme points in P. A bistellar flip on a partial triangulation either flips an edge , removes a non-extreme point of degree 3, or adds a point in P \\setminus P' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices ; a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The goal of this paper is to investigate the structure of this graph , with emphasis on connectivity. For sets P of n points in general position, we show that the bistellar flip graph is ( n-3 )-connected, answering, for sets in general position, an open questions raised in a book (by De Loera, Rambau, and Santos) and a survey (by Lee and Santos). This matches the situation for regular triangulations ( partial triangulations obtained by lifting the points and projecting the lower convex hull ), where (n-3)-connectivity has been known since the 1980s via the secondary polytope ( Gelfand, Kapranov , Zelevinsky ) and Balinski's Theorem. Our methods yield further results for regular triangulations. Among others, we show that there are arbitrarily large sets P with non-regular partial triangulations, while every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular partial triangulations (answering a question by F. Santos in the unexpected direction) .", "after_revision": "Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in P. A bistellar flip on a partial triangulation flips an edge (an edge flip) , removes a non-extreme point of degree 3, or adds a point in P \\ P' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices , and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The edge flip graph is defined with full triangulations as vertices, and edge flips determining the adjacencies. Lawson showed in the early 70s that these graphs are connected. Our goal is to investigate these graphs , with emphasis on vertex connectivity. For sets of n points in the plane in general position, we show that the edge flip graph is ( n/2-2 )-connected, and the bistellar flip graph is (n-3)-connected; both results are tight. The latter bound matches the situation for the subfamily of regular triangulations, ie. partial triangulations obtained by lifting the points to 3-space and projecting back the lower convex hull . Here (n-3)-connectivity has been known since the late 80s via the secondary polytope due to Gelfand, Kapranov Zelevinsky and Balinski's Theorem. For the edge flip-graphs, the vertex connectivity can be shown to be at least as large as (and hence equal to) the minimum degree, provided n is large enough. Our methods yield several other results .", "edit_actions": [{"type": "D", "before": "on P", "after": null, "start_char_pos": 160, "end_char_pos": 164}, {"type": "D", "before": "either", "after": null, "start_char_pos": 292, "end_char_pos": 298}, {"type": "A", "before": null, "after": "(an edge flip)", "start_char_pos": 313, "end_char_pos": 313}, {"type": "R", "before": "\\setminus", "after": "\\", "start_char_pos": 378, "end_char_pos": 387}, {"type": "R", "before": ";", "after": ", and", "start_char_pos": 482, "end_char_pos": 483}, {"type": "R", "before": "goal of this paper", "after": "edge flip graph is defined with full triangulations as vertices, and edge flips determining the adjacencies. Lawson showed in the early 70s that these graphs are connected. Our goal", "start_char_pos": 595, "end_char_pos": 613}, {"type": "R", "before": "the structure of this graph", "after": "these graphs", "start_char_pos": 632, "end_char_pos": 659}, {"type": "A", "before": null, "after": "vertex", "start_char_pos": 679, "end_char_pos": 679}, {"type": "D", "before": "P", "after": null, "start_char_pos": 703, "end_char_pos": 704}, {"type": "A", "before": null, "after": "the plane in", "start_char_pos": 720, "end_char_pos": 720}, {"type": "R", "before": "bistellar", "after": "edge", "start_char_pos": 756, "end_char_pos": 765}, {"type": "R", "before": "n-3", "after": "n/2-2", "start_char_pos": 782, "end_char_pos": 785}, {"type": "R", "before": "answering, for sets in general position, an open questions raised in a book (by De Loera, Rambau, and Santos) and a survey (by Lee and Santos). This", "after": "and the bistellar flip graph is (n-3)-connected; both results are tight. The latter bound", "start_char_pos": 799, "end_char_pos": 947}, {"type": "R", "before": "regular triangulations (", "after": "the subfamily of regular triangulations, ie.", "start_char_pos": 974, "end_char_pos": 998}, {"type": "R", "before": "and projecting", "after": "to 3-space and projecting back", "start_char_pos": 1053, "end_char_pos": 1067}, {"type": "R", "before": "), where", "after": ". Here", "start_char_pos": 1090, "end_char_pos": 1098}, {"type": "R", "before": "1980s", "after": "late 80s", "start_char_pos": 1143, "end_char_pos": 1148}, {"type": "R", "before": "(", "after": "due to", "start_char_pos": 1176, "end_char_pos": 1177}, {"type": "R", "before": ", Zelevinsky )", "after": "Zelevinsky", "start_char_pos": 1196, "end_char_pos": 1210}, {"type": "R", "before": "Our methods yield further results for regular triangulations. Among others, we show that there are arbitrarily large sets P with non-regular partial triangulations, while every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular partial triangulations (answering a question by F. Santos in the unexpected direction)", "after": "For the edge flip-graphs, the vertex connectivity can be shown to be at least as large as (and hence equal to) the minimum degree, provided n is large enough. Our methods yield several other results", "start_char_pos": 1235, "end_char_pos": 1616}], "sents_char_pos": [0, 135, 247, 413, 483, 590, 693, 942, 1234, 1296]} {"doc_id": "2004.00351", "revision_depth": "1", "before_revision": "RNA function crucially depends on its structure. Thermodynamic models that are used for secondary structure prediction report a large number of structures in a limited energy range, often failing in identifying the correct native structure unless complemented by auxiliary experimental data. In this work we build an automatically trainable model that is based on a combination of thermodynamic parameters, chemical probing data ( Selective 2^\\prime Hydroxyl Acylation analyzed via Primer Extension , SHAPE), and co-evolutionary data (Direct Coupling Analysis, DCA) . Perturbations are trained on a suitable set of systems for which the native structure is known . A convolutional window is used to include neighboring reactivities in the SHAPE nodes of the network, and regularization terms limit overfitting improving transferability. The most transferable model is chosen with a cross-validation strategy that allows to automatically optimize the relative importance of heterogenous input datasets. The model architecture enlightens the structural information content of SHAPE reactivities and their dependence on local conformational ensembles. By using the selected model , we obtain enhanced populations for reference native structures and more sensitive and precise predicted structures in an independent validation set not seen during training . The flexibility of the approach allows the model to be easily retrained and adapted to incorporate arbitrary experimental information.", "after_revision": "RNA function crucially depends on its structure. Thermodynamic models currently used for secondary structure prediction rely on computing the partition function of folding ensembles, and can thus estimate minimum free-energy structures and ensemble populations. These models sometimes fail in identifying native structures unless complemented by auxiliary experimental data. Here, we build a set of models that combine thermodynamic parameters, chemical probing data ( DMS , SHAPE), and co-evolutionary data (Direct Coupling Analysis, DCA) through a network that outputs perturbations to the ensemble free energy . Perturbations are trained to increase the ensemble populations of a representative set of known native RNA structures. In the chemical probing nodes of the network, a convolutional window combines neighboring reactivities, enlightening their structural information content and the contribution of local conformational ensembles. Regularization is used to limit overfitting and improve transferability. The most transferable model is selected through a cross-validation strategy that estimates the performance of models on systems on which they are not trained. With the selected model we obtain increased ensemble populations for native structures and more accurate predictions in an independent validation set . The flexibility of the approach allows the model to be easily retrained and adapted to incorporate arbitrary experimental information.", "edit_actions": [{"type": "R", "before": "that are", "after": "currently", "start_char_pos": 70, "end_char_pos": 78}, {"type": "R", "before": "report a large number of", "after": "rely on computing the partition function of folding ensembles, and can thus estimate minimum free-energy structures and ensemble populations. These models sometimes fail in identifying native", "start_char_pos": 119, "end_char_pos": 143}, {"type": "D", "before": "in a limited energy range, often failing in identifying the correct native structure", "after": null, "start_char_pos": 155, "end_char_pos": 239}, {"type": "R", "before": "In this work we build an automatically trainable model that is based on a combination of", "after": "Here, we build a set of models that combine", "start_char_pos": 292, "end_char_pos": 380}, {"type": "R", "before": "Selective 2^\\prime Hydroxyl Acylation analyzed via Primer Extension", "after": "DMS", "start_char_pos": 431, "end_char_pos": 498}, {"type": "A", "before": null, "after": "through a network that outputs perturbations to the ensemble free energy", "start_char_pos": 566, "end_char_pos": 566}, {"type": "R", "before": "on a suitable set of systems for which the native structure is known . A convolutional window is used to include neighboring reactivities in the SHAPE", "after": "to increase the ensemble populations of a representative set of known native RNA structures. In the chemical probing", "start_char_pos": 595, "end_char_pos": 745}, {"type": "R", "before": "and regularization terms limit overfitting improving", "after": "a convolutional window combines neighboring reactivities, enlightening their structural information content and the contribution of local conformational ensembles. Regularization is used to limit overfitting and improve", "start_char_pos": 768, "end_char_pos": 820}, {"type": "R", "before": "chosen with", "after": "selected through", "start_char_pos": 869, "end_char_pos": 880}, {"type": "R", "before": "allows to automatically optimize the relative importance of heterogenous input datasets. The model architecture enlightens the structural information content of SHAPE reactivities and their dependence on local conformational ensembles. By using", "after": "estimates the performance of models on systems on which they are not trained. With", "start_char_pos": 914, "end_char_pos": 1158}, {"type": "R", "before": ", we obtain enhanced populations for reference", "after": "we obtain increased ensemble populations for", "start_char_pos": 1178, "end_char_pos": 1224}, {"type": "R", "before": "sensitive and precise predicted structures", "after": "accurate predictions", "start_char_pos": 1252, "end_char_pos": 1294}, {"type": "D", "before": "not seen during training", "after": null, "start_char_pos": 1328, "end_char_pos": 1352}], "sents_char_pos": [0, 48, 291, 565, 837, 1002, 1149, 1354]} {"doc_id": "2004.00876", "revision_depth": "1", "before_revision": "Mean field models are a popular tool used to analyse load balancing policies. In some exceptional cases the response time distribution of the mean field limit has an explicit form. In most cases it can be computed using either a recursion or a differential equation (for exponential job sizes with mean one). In this paper we study the value of the mean response time E[ R _\\lambda] as the arrival rate \\lambda approaches 1 (i.e. the system gets close to instability). As E[ R _\\lambda] diverges to infinity, we scale with -\\log(1-\\lambda) and present a method to compute the limit \\lambda\\rightarrow 1^--E[ R _\\lambda]/\\log(1-\\lambda). This limit has been previously determined for SQ(d) and LL(d), two well-known policies that assign an incoming job to a server with either the shortest queue or least work left among d randomly selected servers. However, the derivation of the result for SQ(d) relied on the closed form representation of the mean response time and does not seem to generalize well, moreover the proof for LL(d) is incomplete. In contrast, we present a general result that holds for any policy for which the associated recursion or differential equation satisfies a list of criteria. For SQ(d) and LL(d) these criteria are trivially verified. We apply our method to SQ(d,K) resp LL(d,K) with exponential job sizes of mean one. For these policies, jobs arrive in batches of size K and join the K servers with the shortest queue resp least amount of work left. For SQ(d ,K) we obtain \\frac{1{\\log(d/K)} as limiting value, while for LL(d,K) we find the limit to be } equal to \\frac{K}{d-K}. We further analyse a policy where SQ(d_i) resp LL(d_i) is used with probability p_i . For the shortest queue variant, we obtain the limit \\frac{1{\\log\\left(\\sum_{i=1}^np_id_i\\right)}, while for the least loaded variant, we obtain \\frac{1}{\\sum_{i=1}^np_id_i-1}.} {\\sum_ip_id_i-1}. We further indicate that our main result can also be used for load balancers with redundancy or memory. In addition, we propose an alternate scaling -\\log(p_\\lambda) instead of -\\log(1-\\lambda), for which the limit \\lim_{\\lambda\\rightarrow 0^+}-E}[ -E}[ \\log(1-\\lambda) / \\log(p_\\lambda)=1.}", "after_revision": "Mean field models are a popular tool used to analyse load balancing policies. In some cases the waiting time distribution of the mean field limit has an explicit form. In other cases it can be computed as the solution of a set of differential equations. Here we study the limit of the mean waiting time E[ W _\\lambda] as the arrival rate \\lambda approaches 1 for a number of load balancing policies when job sizes are exponential with mean 1 (i.e. the system gets close to instability). As E[ W _\\lambda] diverges to infinity, we scale with -\\log(1-\\lambda) and present a method to compute the limit \\lambda\\rightarrow 1^--E[ W _\\lambda]/\\log(1-\\lambda). This limit has a surprisingly simple form for the load balancing algorithms considered. We present a general result that holds for any policy for which the associated differential equation satisfies a list of assumptions. For the LL(d) policy which assigns an incoming job to a server with the least work left among d randomly selected servers these assumptions are trivially verified. For this policy we prove the limit is given by \\frac{1 LL(d,K) {\\log(d/K)} as limiting value, while for LL(d,K) we find the limit to be } policy, which assigns batches of K jobs to the K least loaded servers among d randomly selected servers, satisfies the assumptions and the limit is equal to \\frac{K}{d-K}. For a policy which applies LL(d_i) with probability p_i {\\log\\left(\\sum_{i=1}^np_id_i\\right)}, while for the least loaded variant, we obtain \\frac{1}{\\sum_{i=1}^np_id_i-1}.} , we show that the limit is given by \\frac{1{\\sum_ip_id_i-1}. We further indicate that our main result can also be used for load balancers with redundancy or memory. In addition, we propose an alternate scaling -\\log(p_\\lambda) instead of -\\log(1-\\lambda), for which the limit \\lim_{\\lambda\\rightarrow 0^+}-E}[W_\\lambda /\\log(p_\\lambda) is well defined and non-zero (contrary to \\lim_{\\lambda\\rightarrow 0^+-E}[W_\\lambda /\\log(1-\\lambda)), while \\lim_{\\lambda\\rightarrow 1^-\\log(1-\\lambda) / \\log(p_\\lambda)=1.}", "edit_actions": [{"type": "R", "before": "exceptional cases the response", "after": "cases the waiting", "start_char_pos": 86, "end_char_pos": 116}, {"type": "R", "before": "most", "after": "other", "start_char_pos": 184, "end_char_pos": 188}, {"type": "R", "before": "using either a recursion or a differential equation (for exponential job sizes with mean one). In this paper", "after": "as the solution of a set of differential equations. Here", "start_char_pos": 214, "end_char_pos": 322}, {"type": "R", "before": "value", "after": "limit", "start_char_pos": 336, "end_char_pos": 341}, {"type": "R", "before": "response", "after": "waiting", "start_char_pos": 354, "end_char_pos": 362}, {"type": "R", "before": "R", "after": "W", "start_char_pos": 371, "end_char_pos": 372}, {"type": "A", "before": null, "after": "for a number of load balancing policies when job sizes are exponential with mean 1", "start_char_pos": 424, "end_char_pos": 424}, {"type": "R", "before": "R", "after": "W", "start_char_pos": 476, "end_char_pos": 477}, {"type": "R", "before": "R", "after": "W", "start_char_pos": 609, "end_char_pos": 610}, {"type": "R", "before": "been previously determined for SQ(d) and LL(d), two well-known policies that assign an incoming job to a server with either the shortest queue or least work left among d randomly selected servers. However, the derivation of the result for SQ(d) relied on the closed form representation of the mean response time and does not seem to generalize well, moreover the proof for LL(d) is incomplete. In contrast, we", "after": "a surprisingly simple form for the load balancing algorithms considered. We", "start_char_pos": 653, "end_char_pos": 1062}, {"type": "D", "before": "recursion or", "after": null, "start_char_pos": 1139, "end_char_pos": 1151}, {"type": "R", "before": "criteria. For SQ(d) and", "after": "assumptions. For the", "start_char_pos": 1194, "end_char_pos": 1217}, {"type": "R", "before": "these criteria", "after": "policy which assigns an incoming job to a server with the least work left among d randomly selected servers these assumptions", "start_char_pos": 1224, "end_char_pos": 1238}, {"type": "R", "before": "We apply our method to SQ(d,K) resp", "after": "For this policy we prove the limit is given by \\frac{1", "start_char_pos": 1263, "end_char_pos": 1298}, {"type": "D", "before": "with exponential job sizes of mean one. For these policies, jobs arrive in batches of size K and join the K servers with the shortest queue resp least amount of work left. For SQ(d ,K) we obtain \\frac{1", "after": null, "start_char_pos": 1307, "end_char_pos": 1509}, {"type": "A", "before": null, "after": "policy, which assigns batches of K jobs to the K least loaded servers among d randomly selected servers, satisfies the assumptions and the limit is", "start_char_pos": 1584, "end_char_pos": 1584}, {"type": "R", "before": "We further analyse a policy where SQ(d_i) resp", "after": "For a policy which applies", "start_char_pos": 1609, "end_char_pos": 1655}, {"type": "D", "before": "is used", "after": null, "start_char_pos": 1664, "end_char_pos": 1671}, {"type": "D", "before": ". For the shortest queue variant, we obtain the limit \\frac{1", "after": null, "start_char_pos": 1693, "end_char_pos": 1754}, {"type": "A", "before": null, "after": ", we show that the limit is given by \\frac{1", "start_char_pos": 1872, "end_char_pos": 1872}, {"type": "A", "before": null, "after": "W_\\lambda", "start_char_pos": 2138, "end_char_pos": 2138}, {"type": "A", "before": null, "after": "/\\log(p_\\lambda) is well defined and non-zero (contrary to \\lim_{\\lambda\\rightarrow 0^+", "start_char_pos": 2139, "end_char_pos": 2139}, {"type": "A", "before": null, "after": "W_\\lambda", "start_char_pos": 2143, "end_char_pos": 2143}, {"type": "A", "before": null, "after": "/\\log(1-\\lambda)), while \\lim_{\\lambda\\rightarrow 1^-", "start_char_pos": 2144, "end_char_pos": 2144}], "sents_char_pos": [0, 77, 180, 308, 469, 637, 849, 1046, 1203, 1262, 1346, 1478, 1608, 1889, 1993]} {"doc_id": "2004.01120", "revision_depth": "2", "before_revision": "A compressed index is a data structure representing a text within compressed space and supporting fast count and locate queries: count/return all positions where a pattern occurs. The first compressed indexes operate within a space bounded by the text's entropy. Entropy, however, is insensitive to long repetitions. For this reason, in recent years more powerful compressed indexes have emerged; these are based on the Lempel-Ziv factorization, the run-length BWT, context-free grammars and, more recently, string attractors. Labeled trees add a whole new dimension to the problem: one needs not only to compress the labels, but also the tree 's topology. On this side, less is known. Jacobson showed how to represent the topology of a tree with n nodes in 2n+o(n) bits of space (succinct) while also supporting constant-time navigation queries. Ferragina et al. presented the first entropy-compressed labeled tree representation (the XBWT) able to count, but not locate , paths labeled with a given pattern. Grammars and the Lempel-Ziv factorization have been extended to trees, but those representations do not support indexing queries. In this paper, we show for the first time how to support the powerful locate queries on compressed trees. We start by proposing suitable generalizations of [ run-length BWT , high-order entropy, and string attractors to cardinal trees (tries) . We show that the number r \\leq n of XBWT-runs upper-bounds the size of the smallest tree attractor and lower-bounds the trie's high-order worst-case entropyH. We finally present the first trie index able to locate in pre-order nodes reached by a path labeled with a given pattern. Our index locates path occurrences in constant time each and takes 2n + o(n) + O(r log n) \\leq 2n + o(n) + O(H log n) bitsof space: the reporting timeis optimal and the locate machinery fits within compressed space on top of the succinct topology .", "after_revision": "In this paper, we consider the problem of compressing a trie while supporting the powerfullocate queries: to return the pre-order identifiers of all nodes reached by a path labeled with a given query pattern. Our result builds on top of the XBWT tree transform of Ferragina et al. FOCS 2005 and generalizes ther-index locate machinery of Gagie et al.[SODA 2018, JACM 2020 based on the run-length encoded Burrows-Wheeler transform (BWT). Our first contribution is to propose a suitable generalization of the run-length BWT to tries . We show that this natural generalization enjoys several of the useful properties of its counterpart on strings: in particular, the transform natively supports counting occurrences of a query pattern on the trie's paths and its size r captures the trie's repetitiveness and lower-bounds a natural notion of trie entropy. Our main contribution is a much deeper insight into the combinatorial structure of this object. In detail, we show that a data structure of O(r \\log n) + 2n + o(n) bits, where n is the number of nodes, allows locating the occ occurrences of a pattern of length m in nearly-optimal O(m\\log\\sigma + occ) time, where \\sigma is the alphabet's size. Our solution consists in sampling O(r) nodes that can be used as \"anchor points\" during the locate process. Once obtained the pre-order identifier of the first pattern occurrence (in co-lexicographic order), we show that a constant number of constant-time jumps between those anchor points lead to the identifier of the next pattern occurrence, thus enabling locating in optimal O(1) time per occurrence .", "edit_actions": [{"type": "R", "before": "A compressed index is a data structure representing a text within compressed space and supporting fast count and locate queries: count/return all positions where a pattern occurs. The first compressed indexes operate within a space bounded by the text's entropy. Entropy, however, is insensitive to long repetitions. For this reason, in recent years more powerful compressed indexes have emerged; these are based on", "after": "In this paper, we consider the problem of compressing a trie while supporting the powerful", "start_char_pos": 0, "end_char_pos": 415}, {"type": "A", "before": null, "after": "locate", "start_char_pos": 415, "end_char_pos": 415}, {"type": "A", "before": null, "after": "queries: to return", "start_char_pos": 416, "end_char_pos": 416}, {"type": "R", "before": "Lempel-Ziv factorization, the run-length BWT, context-free grammars and, more recently, string attractors. Labeled trees add a whole new dimension to the problem: one needs not only to compress the labels, but also the tree 's topology. On this side, less is known. Jacobson showed how to represent the topology of a tree with n nodes in 2n+o(n) bits of space (succinct) while also supporting constant-time navigation queries.", "after": "pre-order identifiers of all nodes reached by a path labeled with a given query pattern. Our result builds on top of the XBWT tree transform of", "start_char_pos": 421, "end_char_pos": 847}, {"type": "R", "before": "presented the first entropy-compressed labeled tree representation (the XBWT) able to count, but not locate , paths labeled with a given pattern. Grammars and the Lempel-Ziv factorization have been extended to trees, but those representations do not support indexing queries. In this paper, we show for the first time how to support the powerful locate queries on compressed trees. We start by proposing suitable generalizations of", "after": "FOCS 2005", "start_char_pos": 865, "end_char_pos": 1296}, {"type": "A", "before": null, "after": "and generalizes the", "start_char_pos": 1297, "end_char_pos": 1297}, {"type": "A", "before": null, "after": "r-index", "start_char_pos": 1297, "end_char_pos": 1297}, {"type": "A", "before": null, "after": "locate machinery of Gagie et al.", "start_char_pos": 1298, "end_char_pos": 1298}, {"type": "A", "before": null, "after": "SODA 2018, JACM 2020", "start_char_pos": 1299, "end_char_pos": 1299}, {"type": "A", "before": null, "after": "based on the", "start_char_pos": 1300, "end_char_pos": 1300}, {"type": "A", "before": null, "after": "encoded Burrows-Wheeler transform (BWT). Our first contribution is to propose a suitable generalization of the run-length", "start_char_pos": 1312, "end_char_pos": 1312}, {"type": "R", "before": ", high-order entropy, and string attractors to cardinal trees (tries)", "after": "to tries", "start_char_pos": 1317, "end_char_pos": 1386}, {"type": "A", "before": null, "after": "this natural generalization enjoys several of the useful properties of its counterpart on strings: in particular, the transform natively supports counting occurrences of a query pattern on the trie's paths and its size r captures", "start_char_pos": 1402, "end_char_pos": 1402}, {"type": "D", "before": "number r \\leq n of XBWT-runs upper-bounds the size of the smallest tree attractor and lower-bounds the", "after": null, "start_char_pos": 1407, "end_char_pos": 1509}, {"type": "R", "before": "high-order worst-case entropyH. We finally present the first trie index able to locate in pre-order nodes reached by a path labeled with a given pattern. Our index locates path occurrences in constant time each and takes 2n + o(n) +", "after": "repetitiveness and lower-bounds a natural notion of trie entropy. Our main contribution is a much deeper insight into the combinatorial structure of this object. In detail, we show that a data structure of", "start_char_pos": 1517, "end_char_pos": 1749}, {"type": "R", "before": "log n) \\leq", "after": "\\log n) +", "start_char_pos": 1754, "end_char_pos": 1765}, {"type": "A", "before": null, "after": "bits, where n is the number of nodes, allows locating the occ occurrences of a pattern of length m in nearly-optimal O(m\\log\\sigma", "start_char_pos": 1776, "end_char_pos": 1776}, {"type": "R", "before": "O(H log n) bitsof space: the reporting timeis optimal and the locate machinery fits within compressed space on top of the succinct topology", "after": "occ) time, where \\sigma is the alphabet's size. Our solution consists in sampling O(r) nodes that can be used as \"anchor points\" during the locate process. Once obtained the pre-order identifier of the first pattern occurrence (in co-lexicographic order), we show that a constant number of constant-time jumps between those anchor points lead to the identifier of the next pattern occurrence, thus enabling locating in optimal O(1) time per occurrence", "start_char_pos": 1779, "end_char_pos": 1918}], "sents_char_pos": [0, 179, 262, 316, 396, 527, 657, 686, 847, 1010, 1140, 1246, 1388, 1548, 1670]} {"doc_id": "2004.01411", "revision_depth": "1", "before_revision": "The random forest regression (RF) has become an extremely popular tool to analyze high-dimensional data. Nonetheless, it has been argued that its benefits are lessened in sparse high-dimensional settingsdue to the presence of weak predictorsand an initial dimension reduction (targeting) step prior to estimation is required. We show theoretically that , in high-dimensional settings with limited signal, proper targeting is an important complement to RF's feature sampling by controlling the probability of placing splits along strong predictors . This is supported by simulations with representable finite samples. Moreover, we quantify the immediate gain from targeting in terms of increased strength of individual trees. Our conclusions are elaborated by a broad set of applications within macroeconomics and finance. These show that the inherent bias-variance trade-off implied by targeting, due to increased tree correlation , is balanced at a medium level , selecting the best 10-30\\\\%DIF < of commonly applied predictors. The applications consolidate that improvements from the targeted RF over the ordinary RF can be significant, particularly in long-horizon forecasting, and both in expansions and recessions.\\end{abstract} %DIF > of commonly applied predictors. Improvements in predictive accuracy of targeted RF relative to ordinary RF are considerable, up to 12-13\\\\%, occurring both in recessions and expansions, particularly at long horizons.", "after_revision": "Random forest regression (RF) is an extremely popular tool for the analysis of high-dimensional data. Nonetheless, its benefits may be lessened in sparse settings, due to weak predictors, and a pre-estimation dimension reduction (targeting) step is required. We show that proper targeting controls the probability of placing splits along strong predictors, thus providing an important complement to RF's feature sampling . This is supported by simulations using representative finite samples. Moreover, we quantify the immediate gain from targeting in terms of increased strength of individual trees. Macroeconomic and financial applications show that the bias-variance tradeoff implied by targeting, due to increased correlation among trees in the forest , is balanced at a medium degree of targeting , selecting the best 10-30\\\\%DIF < of commonly applied predictors. The applications consolidate that improvements from the targeted RF over the ordinary RF can be significant, particularly in long-horizon forecasting, and both in expansions and recessions.\\end{abstract} %DIF > of commonly applied predictors. Improvements in predictive accuracy of targeted RF relative to ordinary RF are considerable, up to 12-13\\\\%, occurring both in recessions and expansions, particularly at long horizons.", "edit_actions": [{"type": "R", "before": "The random", "after": "Random", "start_char_pos": 0, "end_char_pos": 10}, {"type": "R", "before": "has become", "after": "is", "start_char_pos": 34, "end_char_pos": 44}, {"type": "R", "before": "to analyze", "after": "for the analysis of", "start_char_pos": 71, "end_char_pos": 81}, {"type": "R", "before": "it has been argued that its benefits are", "after": "its benefits may be", "start_char_pos": 118, "end_char_pos": 158}, {"type": "R", "before": "high-dimensional settingsdue to the presence of weak predictorsand an initial", "after": "settings, due to weak predictors, and a pre-estimation", "start_char_pos": 178, "end_char_pos": 255}, {"type": "D", "before": "prior to estimation", "after": null, "start_char_pos": 293, "end_char_pos": 312}, {"type": "R", "before": "theoretically that , in high-dimensional settings with limited signal, proper targeting is", "after": "that proper targeting controls the probability of placing splits along strong predictors, thus providing", "start_char_pos": 334, "end_char_pos": 424}, {"type": "D", "before": "by controlling the probability of placing splits along strong predictors", "after": null, "start_char_pos": 474, "end_char_pos": 546}, {"type": "R", "before": "with representable", "after": "using representative", "start_char_pos": 582, "end_char_pos": 600}, {"type": "R", "before": "Our conclusions are elaborated by a broad set of applications within macroeconomics and finance. These", "after": "Macroeconomic and financial applications", "start_char_pos": 725, "end_char_pos": 827}, {"type": "D", "before": "inherent", "after": null, "start_char_pos": 842, "end_char_pos": 850}, {"type": "R", "before": "trade-off", "after": "tradeoff", "start_char_pos": 865, "end_char_pos": 874}, {"type": "R", "before": "tree correlation", "after": "correlation among trees in the forest", "start_char_pos": 914, "end_char_pos": 930}, {"type": "R", "before": "level", "after": "degree of targeting", "start_char_pos": 957, "end_char_pos": 962}], "sents_char_pos": [0, 104, 325, 548, 616, 724, 821, 1029, 1219, 1272]} {"doc_id": "2004.01453", "revision_depth": "1", "before_revision": "Lacking a drug or vaccine, our current strategy to contain the COVID-19 pandemic is by means of social distancing, specifically mobility restrictions and lock-downs. Such measures impose a hurtful toll on the economy, and are difficult to sustain for extended periods. The challenge is that selective isolation of the sick, an often viable and effective strategy, is insufficient against COVID-19 , due to its relatively long incubation period, in which exposed individuals experience no symptoms, but still contribute to the spread. Here we propose an alternating lock-down strategy, in which at every instance, half of the population remains under lock-down while the other half continues to be active, maintaining a routine of weekly succession between activity and lock-down. All symptomatic individuals continue to remain in isolation. Under this regime, if an individual was exposed during their active week, by the time they complete their lock-down they willalready begin to exhibit symptoms. Hence this strategy isolates the majority of exposed individuals during their asymptomatic phase. We find that when complemented with behavioral norms to reduce infection, such as avoiding physical contact or observing personal hygiene, this strategy not only overcomes the pandemic, but also allows for some level of flexibility, withstanding a fraction of defectors or essential workers that remain continuously active . We examine our strategy based on current epidemiological models with parameter relevant for COVID-19. We wish, however, following this communication, to further test and fine-tune our scheme based on real-time human interaction data, and assess its actual effectiveness.%DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% \\\\%DIF > capacity.", "after_revision": "Lacking a drug or vaccine, the current strategy to contain the COVID-19 pandemic is by means of social distancing, specifically mobility restrictions and lock-downs. Such measures impose a hurtful toll on the economy, and are difficult to sustain for extended periods. The challenge is that selective isolation of the symptomatic patients is insufficient to control SARS-CoV-2 , due to its relatively long incubation period, in which individuals experience no symptoms, but may already contribute to the spread. How then do we isolate theseinvisible pre-symptomatic spreaders? Here we propose an alternating quarantine strategy, in which at every instance, half of the population remains under lock-down while the other half continues to be active, maintaining a routine of weekly succession between activity and quarantine. Under this regime, if an individual was exposed during their active week, by the time they complete their quarantine they will, in most cases, begin to exhibit symptoms. Hence this strategy isolates the majority of pre-symptomatic individuals during their %DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% infectious phase, leading to a rapid decline in the viral spread - all while sustaining a continuously active economy at 50\\\\%DIF > capacity.", "edit_actions": [{"type": "R", "before": "our", "after": "the", "start_char_pos": 27, "end_char_pos": 30}, {"type": "R", "before": "sick, an often viable and effective strategy, is insufficient against COVID-19", "after": "symptomatic patients is insufficient to control SARS-CoV-2", "start_char_pos": 318, "end_char_pos": 396}, {"type": "D", "before": "exposed", "after": null, "start_char_pos": 454, "end_char_pos": 461}, {"type": "R", "before": "still", "after": "may already", "start_char_pos": 502, "end_char_pos": 507}, {"type": "A", "before": null, "after": "How then do we isolate these", "start_char_pos": 534, "end_char_pos": 534}, {"type": "A", "before": null, "after": "invisible", "start_char_pos": 534, "end_char_pos": 534}, {"type": "A", "before": null, "after": "pre-symptomatic spreaders?", "start_char_pos": 535, "end_char_pos": 535}, {"type": "R", "before": "lock-down", "after": "quarantine", "start_char_pos": 567, "end_char_pos": 576}, {"type": "R", "before": "lock-down. All symptomatic individuals continue to remain in isolation.", "after": "quarantine.", "start_char_pos": 771, "end_char_pos": 842}, {"type": "R", "before": "lock-down they willalready", "after": "quarantine they will, in most cases,", "start_char_pos": 949, "end_char_pos": 975}, {"type": "R", "before": "exposed", "after": "pre-symptomatic", "start_char_pos": 1048, "end_char_pos": 1055}, {"type": "D", "before": "asymptomatic phase. We find that when complemented with behavioral norms to reduce infection, such as avoiding physical contact or observing personal hygiene, this strategy not only overcomes the pandemic, but also allows for some level of flexibility, withstanding a fraction of defectors or essential workers that remain continuously active . We examine our strategy based on current epidemiological models with parameter relevant for COVID-19. We wish, however, following this communication, to further test and fine-tune our scheme based on real-time human interaction data, and assess its actual effectiveness.", "after": null, "start_char_pos": 1081, "end_char_pos": 1696}, {"type": "A", "before": null, "after": "infectious phase, leading to a rapid decline in the viral spread - all while sustaining a continuously active economy at 50", "start_char_pos": 1741, "end_char_pos": 1741}], "sents_char_pos": [0, 165, 268, 533, 781, 842, 1002, 1100, 1425, 1527, 1696]} {"doc_id": "2004.01865", "revision_depth": "1", "before_revision": "We first revisit the problem of kernel estimation of spot volatility in a general continuous It\\^o semimartingale model in the absence of microstructure noise, and prove a Central Limit Theorem with optimal convergence rate , which is an extension of Figueroa and Li (2020) as we allow for a general two-sided kernel function . Next, to handle the microstructure noise of ultra high-frequency observations, we present a new type of pre-averaging/kernel estimator for spot volatility under the presence of additive microstructure noise . We prove Central Limit Theorems for the estimation error with an optimal rate and study the problems of optimal bandwidth and kernel selection. As in the case of a simple kernel estimator of spot volatility in the absence of microstructure noise, we show that the asymptotic variance of the pre-averaging/kernel estimator is minimal for exponential or Laplace kernels, hence, justifying the need of working with unbounded kernels as proposed in this work. Feasible implementation of the proposed estimators with optimal bandwidth is also developed . Monte Carlo experiments confirm the superior performance of the devised method.", "after_revision": "We first revisit the problem of estimating the spot volatility of an It\\^o semimartingale using a kernel estimator. We prove a Central Limit Theorem with optimal convergence rate for a general two-sided kernel . Next, we introduce a new pre-averaging/kernel estimator for spot volatility to handle the microstructure noise of ultra high-frequency observations . We prove a Central Limit Theorem for the estimation error with an optimal rate and study the optimal selection of the bandwidth and kernel functions. We show that the pre-averaging/kernel estimator 's asymptotic variance is minimal for exponential kernels, hence, justifying the need of working with kernels of unbounded support as proposed in this work. We also develop a feasible implementation of the proposed estimators with optimal bandwidth . Monte Carlo experiments confirm the superior performance of the devised method.", "edit_actions": [{"type": "R", "before": "kernel estimation of spot volatility in a general continuous", "after": "estimating the spot volatility of an", "start_char_pos": 32, "end_char_pos": 92}, {"type": "R", "before": "model in the absence of microstructure noise, and", "after": "using a kernel estimator. We", "start_char_pos": 114, "end_char_pos": 163}, {"type": "D", "before": ", which is an extension of Figueroa and Li (2020) as we allow", "after": null, "start_char_pos": 224, "end_char_pos": 285}, {"type": "D", "before": "function", "after": null, "start_char_pos": 317, "end_char_pos": 325}, {"type": "R", "before": "to handle the microstructure noise of ultra high-frequency observations, we present a new type of", "after": "we introduce a new", "start_char_pos": 334, "end_char_pos": 431}, {"type": "R", "before": "under the presence of additive microstructure noise", "after": "to handle the microstructure noise of ultra high-frequency observations", "start_char_pos": 483, "end_char_pos": 534}, {"type": "R", "before": "Central Limit Theorems", "after": "a Central Limit Theorem", "start_char_pos": 546, "end_char_pos": 568}, {"type": "R", "before": "problems of optimal", "after": "optimal selection of the", "start_char_pos": 629, "end_char_pos": 648}, {"type": "R", "before": "selection. As in the case of a simple kernel estimator of spot volatility in the absence of microstructure noise, we", "after": "functions. We", "start_char_pos": 670, "end_char_pos": 786}, {"type": "D", "before": "asymptotic variance of the", "after": null, "start_char_pos": 801, "end_char_pos": 827}, {"type": "A", "before": null, "after": "'s asymptotic variance", "start_char_pos": 859, "end_char_pos": 859}, {"type": "D", "before": "or Laplace", "after": null, "start_char_pos": 887, "end_char_pos": 897}, {"type": "R", "before": "unbounded kernels", "after": "kernels of unbounded support", "start_char_pos": 950, "end_char_pos": 967}, {"type": "R", "before": "Feasible", "after": "We also develop a feasible", "start_char_pos": 994, "end_char_pos": 1002}, {"type": "D", "before": "is also developed", "after": null, "start_char_pos": 1068, "end_char_pos": 1085}], "sents_char_pos": [0, 273, 536, 680, 993, 1087]} {"doc_id": "2004.03816", "revision_depth": "1", "before_revision": "The graph matching problem aims to find the latent vertex correspondence between two edge-correlated graphs and has many practical applications . In this work , we study a version of the seeded graph matching problem, which assumes that a set of seeds, i.e., pre-mapped vertex-pairs, is given in advance. Specifically, consider two correlated graphs whose edges are sampled independently with probability s from a parent \\ER graph G(n,p). Furthermore, a mapping between the vertices of the two graphs is provided as seeds, of which an unknown \\beta fraction is correct. This problem was first studied in \\mbox{%DIFAUXCMD lubars2018correcting0pt%DIFAUXCMD where an algorithm is proposed and shown to perfectly recover the correct vertex mapping with high probability if \\beta\\geq\\max}%DIFDELCMD < \\left\\{%%% \\frac{8{3}p,16\\log{n}{nps^2}}%DIFDELCMD < \\right\\}%%% . We improve their condition to \\beta\\geq\\max%DIFDELCMD < \\left\\{%%% 30\\sqrt{\\frac{\\log n{n(1-p)^2s^2}},\\frac{45\\log{n}}{np(1-p)^2s^2}}%DIFDELCMD < \\right)%%% . However, when p=O%DIFDELCMD < \\left( %%% \\sqrt{{\\log n/{ns^2}}}%DIFDELCMD < \\right)%%% , our improved condition still requires that \\beta must increase inversely proportional to np. In order to improve the matching performance for sparse graphs, we propose a new algorithm that uses \"witnesses\" in the 2-hop neighborhood, instead of only 1-hop neighborhood as in \\mbox{%DIFAUXCMD \\cite{lubars2018correcting}\\hspace{0pt}%DIFAUXCMD . We show that when np^2\\leq\\frac{1}{135\\log n}, our new algorithm can achieve perfect recovery with high probability if \\beta\\geq\\max}%DIFDELCMD < \\left\\{%%% 900\\sqrt{\\frac{np^3(1-s)\\log n{s}}, 600\\sqrt{\\frac{\\log n}{ns^4}}, \\frac{1200\\log n}{n^2p^2s^4}}%DIFDELCMD < \\right\\} %%% and nps^2\\geq 128\\log n }\\hspace{0pt}%DIFAUXCMD when p}\\ge . For instance, when p is a constant or p=n^{-3/4}, we show that only \\Omega(\\sqrt{n\\log n}) correct seeds suffice for perfect matching, while the previously best-known results demand \\Omega(n) and \\Omega(n^{3/4}\\log n) correct seeds, respectively} . Numerical experiments on both synthetic and real graphs corroborate our theoretical findings and show that our 2-hop algorithm significantly outperforms the 1-hop algorithm when the graphsare relatively sparse .", "after_revision": "Graph matching aims to find the latent vertex correspondence between two edge-correlated graphs and has found numerous applications across different fields . In this paper , we study a seeded graph matching problem, which assumes that a set of seeds, i.e., pre-mapped vertex-pairs, is given in advance. While most previous work requires all seeds to be correct, we focus on the setting where the seeds are partially correct. Specifically, consider two correlated graphs whose edges are sampled independently from a parent \\ER graph G(n,p). A mapping between the vertices of the two graphs is provided as seeds, of which an unknown \\beta fraction is correct. 0pt%DIFAUXCMD where an algorithm is proposed and shown to perfectly recover the correct vertex mapping with high probability if \\beta\\geq\\max}%DIFDELCMD < \\left\\{%%% {3}p,16\\log{n}{nps^2}}%DIFDELCMD < \\right\\}%%% %DIFDELCMD < \\left\\{%%% {n(1-p)^2s^2}},\\frac{45\\log{n}}{np(1-p)^2s^2}}%DIFDELCMD < \\right)%%% %DIFDELCMD < \\left( %%% /{ns^2}}}%DIFDELCMD < \\right)%%% We first analyze a simple algorithm that matches vertices based on the number of common seeds in the 1-hop neighborhoods, and then further propose a new algorithm that uses seeds in the 2-hop neighborhoods. We establish non-asymptotic performance guarantees of perfect matching for both 1-hop }\\hspace{0pt}%DIFAUXCMD . We show that when np^2\\leq\\frac{1}{135\\log n}, our new algorithm can achieve perfect recovery with high probability if \\beta\\geq\\max}%DIFDELCMD < \\left\\{%%% {s}}, 600\\sqrt{\\frac{\\log n}{ns^4}}, \\frac{1200\\log n}{n^2p^2s^4}}%DIFDELCMD < \\right\\} %%% and 2-hop algorithms, showing that our new 2-hop algorithm requires substantially fewer correct seeds than the 1-hop algorithm when graphs are sparse. Moreover, by combining our new performance guarantees for the 1-hop and 2-hop algorithms, we attain the best-known results (in terms of the required fraction of correct seeds) across the entire range of graph sparsity and significantly improve the previous results in \\mbox{%DIFAUXCMD \\cite{10.14778/2794367.2794371,lubars2018correcting }\\hspace{0pt}%DIFAUXCMD when p}\\ge n^{-5/6. For instance, when p is a constant or p=n^{-3/4}, we show that only \\Omega(\\sqrt{n\\log n}) correct seeds suffice for perfect matching, while the previously best-known results demand \\Omega(n) and \\Omega(n^{3/4}\\log n) correct seeds, respectively} . Numerical experiments corroborate our theoretical findings , demonstrating the superiority of our 2-hop algorithm on a variety of synthetic and real graphs .", "edit_actions": [{"type": "R", "before": "The graph matching problem", "after": "Graph matching", "start_char_pos": 0, "end_char_pos": 26}, {"type": "R", "before": "many practical applications", "after": "found numerous applications across different fields", "start_char_pos": 116, "end_char_pos": 143}, {"type": "R", "before": "work", "after": "paper", "start_char_pos": 154, "end_char_pos": 158}, {"type": "D", "before": "version of the", "after": null, "start_char_pos": 172, "end_char_pos": 186}, {"type": "A", "before": null, "after": "While most previous work requires all seeds to be correct, we focus on the setting where the seeds are partially correct.", "start_char_pos": 305, "end_char_pos": 305}, {"type": "D", "before": "with probability s", "after": null, "start_char_pos": 389, "end_char_pos": 407}, {"type": "R", "before": "Furthermore, a", "after": "A", "start_char_pos": 440, "end_char_pos": 454}, {"type": "D", "before": "This problem was first studied in \\mbox{%DIFAUXCMD lubars2018correcting", "after": null, "start_char_pos": 571, "end_char_pos": 642}, {"type": "D", "before": "\\frac{8", "after": null, "start_char_pos": 808, "end_char_pos": 815}, {"type": "D", "before": ". We improve their condition to \\beta\\geq\\max", "after": null, "start_char_pos": 862, "end_char_pos": 907}, {"type": "D", "before": "30\\sqrt{\\frac{\\log n", "after": null, "start_char_pos": 931, "end_char_pos": 951}, {"type": "D", "before": ". However, when p=O", "after": null, "start_char_pos": 1021, "end_char_pos": 1040}, {"type": "D", "before": "\\sqrt{{\\log n", "after": null, "start_char_pos": 1064, "end_char_pos": 1077}, {"type": "R", "before": ", our improved condition still requires that \\beta must increase inversely proportional to np. In order to improve the matching performance for sparse graphs, we", "after": "We first analyze a simple algorithm that matches vertices based on the number of common seeds in the 1-hop neighborhoods, and then further", "start_char_pos": 1110, "end_char_pos": 1271}, {"type": "R", "before": "\"witnesses\"", "after": "seeds", "start_char_pos": 1306, "end_char_pos": 1317}, {"type": "R", "before": "neighborhood, instead of only", "after": "neighborhoods. We establish non-asymptotic performance guarantees of perfect matching for both", "start_char_pos": 1331, "end_char_pos": 1360}, {"type": "D", "before": "neighborhood as in \\mbox{%DIFAUXCMD \\cite{lubars2018correcting", "after": null, "start_char_pos": 1367, "end_char_pos": 1429}, {"type": "D", "before": "900\\sqrt{\\frac{np^3(1-s)\\log n", "after": null, "start_char_pos": 1612, "end_char_pos": 1642}, {"type": "R", "before": "and nps^2\\geq 128\\log n", "after": "and 2-hop algorithms, showing that our new 2-hop algorithm requires substantially fewer correct seeds than the 1-hop algorithm when graphs are sparse. Moreover, by combining our new performance guarantees for the 1-hop and 2-hop algorithms, we attain the best-known results (in terms of the required fraction of correct seeds) across the entire range of graph sparsity and significantly improve the previous results in \\mbox{%DIFAUXCMD \\cite{10.14778/2794367.2794371,lubars2018correcting", "start_char_pos": 1734, "end_char_pos": 1757}, {"type": "A", "before": null, "after": "n^{-5/6", "start_char_pos": 1793, "end_char_pos": 1793}, {"type": "D", "before": "on both synthetic and real graphs", "after": null, "start_char_pos": 2066, "end_char_pos": 2099}, {"type": "R", "before": "and show that", "after": ", demonstrating the superiority of", "start_char_pos": 2137, "end_char_pos": 2150}, {"type": "R", "before": "significantly outperforms the 1-hop algorithm when the graphsare relatively sparse", "after": "on a variety of synthetic and real graphs", "start_char_pos": 2171, "end_char_pos": 2253}], "sents_char_pos": [0, 145, 304, 439, 570, 820, 1204, 1317, 1794]} {"doc_id": "2004.04565", "revision_depth": "1", "before_revision": "With the spiraling pandemic of the Coronavirus Disease 2019 (COVID-19), it has becoming inherently important to disseminate accurate and timely information about the disease . Due to the ubiquity of Internet connectivity and smart devices, social sensing is emerging as a dynamic sensing paradigm to collect real-time observations from online users. In this vision paper we propose CovidSens, the concept of social-sensing-based risk alerting systems to notify the general public about the COVID-19 spread . The CovidSens concept is motivated by two recent observations: 1) people have been actively sharing their state of health and experience of the COVID-19 via online social media, and 2) official warning channels and news agencies are relatively slower than people reporting their observations and experiences about COVID-19 on social media . We anticipate an unprecedented opportunity to leverage the posts generated by the social media users to build a real-time analytic system for gathering and circulating vital information of the COVID-19 propagation . Specifically, the vision of CovidSens attempts to answer the questions of: how to track the spread of the COVID-19? How to distill reliable information about the disease with the coexistence of prevailing rumors and misinformation in the social media ? How to inform the general public about the latest state of the spread timely and effectively and alert them to remain prepared ? In this vision paper, we discuss the roles of CovidSens and identify the potential challenges in implementing reliable social-sensing-based risk alerting systems. We envision that approaches originating from multiple disciplines (e.g. estimation theory, machine learning, constrained optimization) can be effective in addressing the challenges. Finally, we outline a few research directions for future work in CovidSens.", "after_revision": "With the spiraling pandemic of the Coronavirus Disease 2019 (COVID-19), it has becoming inherently important to disseminate accurate and timely information . Due to the ubiquity of Internet connectivity and smart devices, social sensing is emerging as a dynamic AI-driven sensing paradigm to extract real-time observations from online users. In this paper, we propose CovidSens, a vision of social sensing based risk alert systems to spontaneously obtain and analyze social data to infer COVID-19 propagation. CovidSens can actively help to keep the general public informed about the COVID-19 spread and identify risk-prone areas . The CovidSens concept is motivated by three observations: 1) people actively share their experience of COVID-19 via online social media, 2) official warning channels and news agencies are relatively slower than people reporting on social media , and 3) online users are frequently equipped with substantially capable mobile devices that can perform data processing and analytics. We envision unprecedented opportunity to leverage posts generated by ordinary people to build a real-time sensing and analytic system for gathering and circulating COVID-19 propagation data . Specifically, the vision of CovidSens attempts to answer the questions : How to distill reliable information about COVID-19 with prevailing rumors and misinformation ? How to inform the general public about the state of the spread timely and effectively ? How to leverage the computational power on edge devices to construct fully integrated edge-based social sensing platforms ? In this vision paper, we discuss the roles of CovidSens and identify potential challenges in developing reliable social sensing based risk alert systems. We envision that approaches originating from multiple disciplines can be effective in addressing the challenges. Finally, we outline a few research directions for future work in CovidSens.", "edit_actions": [{"type": "D", "before": "about the disease", "after": null, "start_char_pos": 156, "end_char_pos": 173}, {"type": "A", "before": null, "after": "AI-driven", "start_char_pos": 280, "end_char_pos": 280}, {"type": "R", "before": "collect", "after": "extract", "start_char_pos": 301, "end_char_pos": 308}, {"type": "R", "before": "vision paper", "after": "paper,", "start_char_pos": 359, "end_char_pos": 371}, {"type": "R", "before": "the concept of social-sensing-based risk alerting systems to notify", "after": "a vision of social sensing based risk alert systems to spontaneously obtain and analyze social data to infer COVID-19 propagation. CovidSens can actively help to keep", "start_char_pos": 394, "end_char_pos": 461}, {"type": "A", "before": null, "after": "informed", "start_char_pos": 481, "end_char_pos": 481}, {"type": "A", "before": null, "after": "and identify risk-prone areas", "start_char_pos": 508, "end_char_pos": 508}, {"type": "R", "before": "two recent", "after": "three", "start_char_pos": 549, "end_char_pos": 559}, {"type": "R", "before": "have been actively sharing their state of health and experience of the", "after": "actively share their experience of", "start_char_pos": 584, "end_char_pos": 654}, {"type": "D", "before": "and", "after": null, "start_char_pos": 689, "end_char_pos": 692}, {"type": "D", "before": "their observations and experiences about COVID-19", "after": null, "start_char_pos": 784, "end_char_pos": 833}, {"type": "R", "before": ". We anticipate an", "after": ", and 3) online users are frequently equipped with substantially capable mobile devices that can perform data processing and analytics. We envision", "start_char_pos": 850, "end_char_pos": 868}, {"type": "D", "before": "the", "after": null, "start_char_pos": 907, "end_char_pos": 910}, {"type": "R", "before": "the social media users", "after": "ordinary people", "start_char_pos": 930, "end_char_pos": 952}, {"type": "A", "before": null, "after": "sensing and", "start_char_pos": 974, "end_char_pos": 974}, {"type": "D", "before": "vital information of the", "after": null, "start_char_pos": 1021, "end_char_pos": 1045}, {"type": "A", "before": null, "after": "data", "start_char_pos": 1067, "end_char_pos": 1067}, {"type": "R", "before": "of: how to track the spread of the COVID-19?", "after": ":", "start_char_pos": 1141, "end_char_pos": 1185}, {"type": "R", "before": "the disease with the coexistence of", "after": "COVID-19 with", "start_char_pos": 1228, "end_char_pos": 1263}, {"type": "D", "before": "in the social media", "after": null, "start_char_pos": 1301, "end_char_pos": 1320}, {"type": "D", "before": "latest", "after": null, "start_char_pos": 1366, "end_char_pos": 1372}, {"type": "R", "before": "and alert them to remain prepared", "after": "? How to leverage the computational power on edge devices to construct fully integrated edge-based social sensing platforms", "start_char_pos": 1416, "end_char_pos": 1449}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1521, "end_char_pos": 1524}, {"type": "R", "before": "implementing reliable social-sensing-based risk alerting", "after": "developing reliable social sensing based risk alert", "start_char_pos": 1549, "end_char_pos": 1605}, {"type": "D", "before": "(e.g. estimation theory, machine learning, constrained optimization)", "after": null, "start_char_pos": 1681, "end_char_pos": 1749}], "sents_char_pos": [0, 175, 350, 510, 851, 1185, 1322, 1451, 1614, 1796]} {"doc_id": "2004.04608", "revision_depth": "1", "before_revision": "We develop a minimalist compartmental model to analyze policies on mobility restriction in Italy during the Covid-19 outbreak. Our findings show that an early lockdown barely shifts the epidemic in time : moreover , beyond a critical value of the lockdown strength, an epidemic that seems to be quelled fully recovers after lifting the restrictions. We investigate the effects on lockdown scenarios and exit strategies by introducing heterogeneities in the model. In particular, we consider Italian regions as separate administrative entities in which social interactions through different age classes occur. We find that, due to the sparsity of the mobility matrix, epidemics develop independently in different regions once the outbreak starts. Moreover, after the epidemics ha started, the influence of contacts with other regions becomes soon irrelevant. Sparsity might be responsible for the observed delays among different regions. Analogous arguments apply to the world/countries scenario. We also find that disregarding the structure of social contacts could lead to severe underestimation of the post-lockdown effects . Nevertheless, age class based strategies can help to mitigate rebound effectswith milder strategies. Finally, we point out that these results can be generalized beyond this particular model by providing a description of the effects of key parameters on non-medical epidemic mitigation strategies .", "after_revision": "We develop a minimalist compartmental model to analyze the impact of mobility restrictions in Italy during the Covid-19 outbreak. Our findings show that early lockdowns shifts the epidemic in time while , beyond a critical value of the lockdown strength, the epidemic restarts after lifting the restrictions. We investigate the effects of different lockdown scenarios and exit mechanisms by accounting for two fundamental sources of heterogeneity within the model: geography and demography. We consider Italian Regions as separate administrative entities , in which social interactions between age cohorts occur. Due to the sparsity of the mobility matrix, epidemics tend to develop independently in different regions . Finally, we show how disregarding the specific structure of social contacts could lead to severe underestimation of post-lockdown effects , while specific age cohort based measures can sustain the mitigation of rebound effects. Our model is general, and it highlights the effects of key parameters on non-pharmaceutical mitigation mechanisms for epidemics .", "edit_actions": [{"type": "R", "before": "policies on mobility restriction", "after": "the impact of mobility restrictions", "start_char_pos": 55, "end_char_pos": 87}, {"type": "R", "before": "an early lockdown barely", "after": "early lockdowns", "start_char_pos": 150, "end_char_pos": 174}, {"type": "R", "before": ": moreover", "after": "while", "start_char_pos": 203, "end_char_pos": 213}, {"type": "R", "before": "an epidemic that seems to be quelled fully recovers", "after": "the epidemic restarts", "start_char_pos": 266, "end_char_pos": 317}, {"type": "R", "before": "on", "after": "of different", "start_char_pos": 377, "end_char_pos": 379}, {"type": "R", "before": "strategies by introducing heterogeneities in the model. In particular, we consider Italian regions", "after": "mechanisms by accounting for two fundamental sources of heterogeneity within the model: geography and demography. We consider Italian Regions", "start_char_pos": 408, "end_char_pos": 506}, {"type": "A", "before": null, "after": ",", "start_char_pos": 543, "end_char_pos": 543}, {"type": "R", "before": "through different age classes occur. We find that, due", "after": "between age cohorts occur. Due", "start_char_pos": 573, "end_char_pos": 627}, {"type": "A", "before": null, "after": "tend to", "start_char_pos": 678, "end_char_pos": 678}, {"type": "R", "before": "once the outbreak starts. Moreover, after the epidemics ha started, the influence of contacts with other regions becomes soon irrelevant. Sparsity might be responsible for the observed delays among different regions. Analogous arguments apply to the world/countries scenario. We also find that disregarding the", "after": ". Finally, we show how disregarding the specific", "start_char_pos": 722, "end_char_pos": 1032}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1102, "end_char_pos": 1105}, {"type": "R", "before": ". Nevertheless, age class based strategies can help to mitigate rebound effectswith milder strategies. Finally, we point out that these results can be generalized beyond this particular model by providing a description of", "after": ", while specific age cohort based measures can sustain the mitigation of rebound effects. Our model is general, and it highlights", "start_char_pos": 1128, "end_char_pos": 1349}, {"type": "R", "before": "non-medical epidemic mitigation strategies", "after": "non-pharmaceutical mitigation mechanisms for epidemics", "start_char_pos": 1383, "end_char_pos": 1425}], "sents_char_pos": [0, 126, 349, 463, 609, 747, 859, 938, 997, 1129, 1230]} {"doc_id": "2004.04608", "revision_depth": "2", "before_revision": "We develop a minimalist compartmental model to analyze the impact of mobility restrictions in Italy during the Covid-19 outbreak. Our findings show that early lockdowns shifts the epidemic in time while, beyond a critical value of the lockdown strength, the epidemic restarts after lifting the restrictions. We investigate the effects of different lockdown scenarios and exit mechanisms by accounting for two fundamental sources of heterogeneity within the model: geography and demography. We consider Italian Regions as separate administrative entities, in which social interactions between age cohorts occur. Due to the sparsity of the mobility matrix, epidemics tend to develop independently in different regions . Finally , we show how disregarding the specific structure of social contacts could lead to severe underestimation of post-lockdown effects, while specific age cohort based measures can sustain the mitigation of rebound effects. Our model is general, and it highlights the effects of key parameters on non-pharmaceutical mitigation mechanisms for epidemics.", "after_revision": "We develop a minimalist compartmental model to study the impact of mobility restrictions in Italy during the Covid-19 outbreak. We show that an early lockdown shifts the epidemic in time , while that beyond a critical value of the lockdown strength, the epidemic tend to restart after lifting the restrictions. As a consequence, specific mitigation strategies must be introduced. We characterize the relative importance of different broad strategies by accounting for two fundamental sources of heterogeneity , i.e. geography and demography. First, we consider Italian regions as separate administrative entities, in which social interactions between age classs occur. Due to the sparsity of the inter-regional mobility matrix, once started the epidemics tend to develop independently across areas, justifying the adoption of solutions specific to individual regions or to clusters of regions. Second , we show that social contacts between age classes play a fundamental role and that measures which take into account the age structure of the population can provide a significant contribution to mitigate the rebound effects. Our model is general, and while it does not analyze specific mitigation strategies, it highlights the relevance of some key parameters on non-pharmaceutical mitigation mechanisms for the epidemics.", "edit_actions": [{"type": "R", "before": "analyze", "after": "study", "start_char_pos": 47, "end_char_pos": 54}, {"type": "R", "before": "Our findings show that early lockdowns", "after": "We show that an early lockdown", "start_char_pos": 130, "end_char_pos": 168}, {"type": "R", "before": "while,", "after": ", while that", "start_char_pos": 197, "end_char_pos": 203}, {"type": "R", "before": "restarts", "after": "tend to restart", "start_char_pos": 267, "end_char_pos": 275}, {"type": "R", "before": "We investigate the effects of different lockdown scenarios and exit mechanisms", "after": "As a consequence, specific mitigation strategies must be introduced. We characterize the relative importance of different broad strategies", "start_char_pos": 308, "end_char_pos": 386}, {"type": "R", "before": "within the model:", "after": ", i.e.", "start_char_pos": 446, "end_char_pos": 463}, {"type": "R", "before": "We consider Italian Regions", "after": "First, we consider Italian regions", "start_char_pos": 490, "end_char_pos": 517}, {"type": "R", "before": "cohorts", "after": "classs", "start_char_pos": 596, "end_char_pos": 603}, {"type": "A", "before": null, "after": "inter-regional", "start_char_pos": 638, "end_char_pos": 638}, {"type": "A", "before": null, "after": "once started the", "start_char_pos": 656, "end_char_pos": 656}, {"type": "R", "before": "in different regions . Finally", "after": "across areas, justifying the adoption of solutions specific to individual regions or to clusters of regions. Second", "start_char_pos": 697, "end_char_pos": 727}, {"type": "R", "before": "how disregarding the specific structure of social contacts could lead to severe underestimation of post-lockdown effects, while specific age cohort based measures can sustain the mitigation of", "after": "that social contacts between age classes play a fundamental role and that measures which take into account the age structure of the population can provide a significant contribution to mitigate the", "start_char_pos": 738, "end_char_pos": 930}, {"type": "R", "before": "it highlights the effects of", "after": "while it does not analyze specific mitigation strategies, it highlights the relevance of some", "start_char_pos": 974, "end_char_pos": 1002}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1066, "end_char_pos": 1066}], "sents_char_pos": [0, 129, 307, 489, 610, 719, 947]} {"doc_id": "2004.04858", "revision_depth": "1", "before_revision": "We consider the problem of identifying patterns of interest in colored strings. A colored string is a string in which each position is colored with one of a finite set of colors. Our task is to find substrings that always occur followed by the same color at the same distance. The problem is motivated by applications in embedded systems verification, in particular, assertion mining. The goal there is to automatically infer properties of the embedded system from the analysis of its simulation traces. We show that the number of interesting patterns is upper-bounded by O(n^2) where n is the length of the string. We introduce a baseline algorithm with \\mathcal{O}(n^2) running time which identifies all interesting patterns for all colors in the string satisfying certain minimality conditions. When one is interested in patterns related to only one color , we provide an algorithm that identifies patterns in \\mathcal{O}(n^2\\log n) time , but is faster than the first algorithm in practice , both on simulated and on real-world patterns.", "after_revision": "In this paper, we consider the problem of identifying patterns of interest in colored strings. A colored string is a string where each position is assigned one of a finite set of colors. Our task is to find substrings of the colored string that always occur followed by the same color at the same distance. The problem is motivated by applications in embedded systems verification, in particular, assertion mining. The goal there is to automatically find properties of the embedded system from the analysis of its simulation traces. We show that , in our setting, the number of patterns of interest is upper-bounded by O(n^2) , where n is the length of the string. We introduce a baseline algorithm , running in \\mathcal{O}(n^2) time, which identifies all patterns of interest satisfying certain minimality conditions, for all colors in the string . For the case where one is interested in patterns related to one color only, we also provide a second algorithm which runs in \\mathcal{O}(n^2\\log n) time in the worst case but is faster than the baseline algorithm in practice . Both solutions use suffix trees, and the second algorithm also uses an appropriately defined priority queue, which allows us to reduce the number of computations. We performed an experimental evaluation of the proposed approaches over both synthetic and real-world datasets, and found that the second algorithm outperforms the first algorithm on all simulated data, while on the real-world data, the performance varies between a slight slowdown (on half of the datasets) and a speedup by a factor of up to 11.", "edit_actions": [{"type": "R", "before": "We", "after": "In this paper, we", "start_char_pos": 0, "end_char_pos": 2}, {"type": "R", "before": "in which", "after": "where", "start_char_pos": 109, "end_char_pos": 117}, {"type": "R", "before": "colored with", "after": "assigned", "start_char_pos": 135, "end_char_pos": 147}, {"type": "A", "before": null, "after": "of the colored string", "start_char_pos": 210, "end_char_pos": 210}, {"type": "R", "before": "infer", "after": "find", "start_char_pos": 421, "end_char_pos": 426}, {"type": "A", "before": null, "after": ", in our setting,", "start_char_pos": 518, "end_char_pos": 518}, {"type": "R", "before": "interesting patterns", "after": "patterns of interest", "start_char_pos": 533, "end_char_pos": 553}, {"type": "A", "before": null, "after": ",", "start_char_pos": 581, "end_char_pos": 581}, {"type": "R", "before": "with", "after": ", running in", "start_char_pos": 653, "end_char_pos": 657}, {"type": "R", "before": "running time", "after": "time,", "start_char_pos": 675, "end_char_pos": 687}, {"type": "R", "before": "interesting patterns", "after": "patterns of interest satisfying certain minimality conditions,", "start_char_pos": 709, "end_char_pos": 729}, {"type": "R", "before": "satisfying certain minimality conditions. When", "after": ". For the case where", "start_char_pos": 759, "end_char_pos": 805}, {"type": "R", "before": "only one color , we provide an algorithm that identifies patterns", "after": "one color only, we also provide a second algorithm which runs", "start_char_pos": 847, "end_char_pos": 912}, {"type": "R", "before": ",", "after": "in the worst case", "start_char_pos": 944, "end_char_pos": 945}, {"type": "R", "before": "first", "after": "baseline", "start_char_pos": 969, "end_char_pos": 974}, {"type": "R", "before": ", both on simulated and on", "after": ". Both solutions use suffix trees, and the second algorithm also uses an appropriately defined priority queue, which allows us to reduce the number of computations. We performed an experimental evaluation of the proposed approaches over both synthetic and", "start_char_pos": 997, "end_char_pos": 1023}, {"type": "R", "before": "patterns.", "after": "datasets, and found that the second algorithm outperforms the first algorithm on all simulated data, while on the real-world data, the performance varies between a slight slowdown (on half of the datasets) and a speedup by a factor of up to 11.", "start_char_pos": 1035, "end_char_pos": 1044}], "sents_char_pos": [0, 79, 178, 277, 385, 504, 618, 800]} {"doc_id": "2004.06098", "revision_depth": "2", "before_revision": "In March and April 2020, public health authorities in the United States acted to mitigate transmission of COVID-19. These actions were not coordinated at the national level , which creates an opportunity to use spatial and temporal variation to measure their effect with greater accuracy. We combine publicly available data sources on the timing of stay-at-home orders and daily confirmed COVID-19 cases at the county level in the United States (N = 124,027). We then derive from the classic SIR model a two-way fixed-effects model and apply it to the data with controls for unmeasured differences between counties and over time. Mean county-level daily growth in COVID-19 infections peaked at 17.2\\% just before stay-at-home orders were issued. Two way fixed-effects regression estimates suggest that orders were associated with a 3.9 percentage point (95\\% CI 1.2 to 6.6 ) reduction in the growth rate after one week and an 6.9 percentage point (2.4 to 11.5 ) reduction after two weeks . By day 27 the reduction (22.6 percentage points, 14.8 to 30.5) had surpassed the growth at the peak, indicating that growth had turned negative and the number of new daily infections was beginning to decline. A hypothetical national stay-at-home order issued on March 13 , 2020 when a national emergency was declared might have reduced cumulative infections by 63.3\\%, and might have helped to reverse exponential growth in the disease by April 10. The results here suggest that a coordinated nationwide stay-at-home order may have reduced by hundreds of thousands the current number of infections and by tens of thousands the total number of deaths from COVID-19. Future efforts in the United States and elsewhere to control pandemics should coordinate stay-at-home orders at the national level,especially for diseases for which local spread has already occurred and testing availability is delayed .", "after_revision": "Governments issue \"stay at home\" orders to reduce the spread of contagious diseases, but the magnitude of such orders' effectiveness is uncertain. In the United States these orders were not coordinated at the national level during the coronavirus disease 2019 (COVID-19) pandemic , which creates an opportunity to use spatial and temporal variation to measure the policies' effect with greater accuracy. Here, we combine data on the timing of stay-at-home orders with daily confirmed COVID-19 cases and fatalities at the county level in the United States . We estimate the effect of stay-at-home orders using a difference-in-differences design that accounts for unmeasured local variation in factors like health systems and demographics and for unmeasured temporal variation in factors like national mitigation actions and access to tests. Compared to counties that did not implement stay-at-home orders , the results show that the orders are associated with a 30.2 percent (11.0 to 45.2 ) reduction in weekly cases after one week , a 40.0 percent (23.4 to 53.0 ) reduction after two weeks , and a 48.6 percent (31.1 to 61.7) reduction after three weeks. Stay-at-home orders are also associated with a 59.8 percent (18.3 to 80.2) reduction in weekly fatalities after three weeks. These results suggest that stay-at-home orders reduced confirmed cases by 390,000 (170,000 to 680,000) and fatalities by 41,000 (27,000 to 59,000) within the first three weeks in localities where they were implemented .", "edit_actions": [{"type": "R", "before": "In March and April 2020, public health authorities in the United States acted to mitigate transmission of COVID-19. These actions", "after": "Governments issue \"stay at home\" orders to reduce the spread of contagious diseases, but the magnitude of such orders' effectiveness is uncertain. In the United States these orders", "start_char_pos": 0, "end_char_pos": 129}, {"type": "A", "before": null, "after": "during the coronavirus disease 2019 (COVID-19) pandemic", "start_char_pos": 173, "end_char_pos": 173}, {"type": "R", "before": "their", "after": "the policies'", "start_char_pos": 254, "end_char_pos": 259}, {"type": "R", "before": "We combine publicly available data sources", "after": "Here, we combine data", "start_char_pos": 290, "end_char_pos": 332}, {"type": "R", "before": "and", "after": "with", "start_char_pos": 370, "end_char_pos": 373}, {"type": "A", "before": null, "after": "and fatalities", "start_char_pos": 405, "end_char_pos": 405}, {"type": "R", "before": "(N = 124,027). We then derive from the classic SIR model a two-way fixed-effects model and apply it to the data with controls for unmeasured differences between counties and over time. Mean county-level daily growth in COVID-19 infections peaked at 17.2\\% just before", "after": ". We estimate the effect of", "start_char_pos": 447, "end_char_pos": 714}, {"type": "A", "before": null, "after": "orders using a difference-in-differences design that accounts for unmeasured local variation in factors like health systems and demographics and for unmeasured temporal variation in factors like national mitigation actions and access to tests. Compared to counties that did not implement stay-at-home", "start_char_pos": 728, "end_char_pos": 728}, {"type": "R", "before": "were issued. Two way fixed-effects regression estimates suggest that orders were", "after": ", the results show that the orders are", "start_char_pos": 736, "end_char_pos": 816}, {"type": "R", "before": "3.9 percentage point (95\\% CI 1.2 to 6.6", "after": "30.2 percent (11.0 to 45.2", "start_char_pos": 835, "end_char_pos": 875}, {"type": "R", "before": "the growth rate", "after": "weekly cases", "start_char_pos": 891, "end_char_pos": 906}, {"type": "R", "before": "and an 6.9 percentage point (2.4 to 11.5", "after": ", a 40.0 percent (23.4 to 53.0", "start_char_pos": 922, "end_char_pos": 962}, {"type": "D", "before": ". By day 27 the reduction (22.6 percentage points, 14.8 to 30.5) had surpassed the growth at the peak, indicating that growth had turned negative and the number of new daily infections was beginning to decline. A hypothetical national stay-at-home order issued on March 13", "after": null, "start_char_pos": 991, "end_char_pos": 1263}, {"type": "R", "before": "2020 when a national emergency was declared might have reduced cumulative infections by 63.3\\%, and might have helped to reverse exponential growth in the disease by April 10. The results here suggest that a coordinated nationwide", "after": "and a 48.6 percent (31.1 to 61.7) reduction after three weeks. Stay-at-home orders are also associated with a 59.8 percent (18.3 to 80.2) reduction in weekly fatalities after three weeks. These results suggest that", "start_char_pos": 1266, "end_char_pos": 1496}, {"type": "R", "before": "order may have reduced by hundreds of thousands the current number of infections and by tens of thousands the total number of deaths from COVID-19. Future efforts in the United States and elsewhere to control pandemics should coordinate stay-at-home orders at the national level,especially for diseases for which local spread has already occurred and testing availability is delayed", "after": "orders reduced confirmed cases by 390,000 (170,000 to 680,000) and fatalities by 41,000 (27,000 to 59,000) within the first three weeks in localities where they were implemented", "start_char_pos": 1510, "end_char_pos": 1892}], "sents_char_pos": [0, 115, 289, 461, 631, 748, 992, 1201, 1441, 1657]} {"doc_id": "2004.06286", "revision_depth": "1", "before_revision": "A brain-computer interface (BCI) enables a user to communicate directly with a computer using the brain signals. Electroencephalogram (EEG) is the most frequently used input signal in BCIs . However, EEG signals are weak, easily contaminated by interferences and noise, non-stationary for the same subject, and varying among different subjects . So , it is difficult to build a generic pattern recognition model in an EEG-based BCI system that is optimal for different subjects, in different sessions, for different devices and tasks. Usually a calibration session is needed to collect some subject-specific data for a new subject, which is time-consuming and user-unfriendly . Transfer learning (TL), which can utilize data or knowledge from similar or relevant subjects/sessions/devices/tasks to facilitate the learning for a new subject/session/device/task, is frequently used to alleviate this calibration requirement . This paper reviews journal publications on TL approaches in EEG-based BCIs in the last few years, i.e., since 2016. Six paradigms and applications -- motor imagery (MI), event related potentials(ERP) , steady-state visual evoked potentials (SSVEP) , affective BCIs (aBCI) , regression problems, and adversarial attacks -- are considered. For each paradigm/application, we group the TL approaches into cross-subject/session, cross-device, and cross-task settings and review them separately. Observations and conclusions are made at the end of the paper, which may point to future research directions.", "after_revision": "A brain-computer interface (BCI) enables a user to communicate with a computer directly using brain signals. Electroencephalograms (EEGs) used in BCIs are weak, easily contaminated by interference and noise, non-stationary for the same subject, and varying across different subjects and sessions. Therefore , it is difficult to build a generic pattern recognition model in an EEG-based BCI system that is optimal for different subjects, during different sessions, for different devices and tasks. Usually , a calibration session is needed to collect some training data for a new subject, which is time consuming and user unfriendly . Transfer learning (TL), which utilizes data or knowledge from similar or relevant subjects/sessions/devices/tasks to facilitate learning for a new subject/session/device/task, is frequently used to reduce the amount of calibration effort . This paper reviews journal publications on TL approaches in EEG-based BCIs in the last few years, i.e., since 2016. Six paradigms and applications -- motor imagery , event-related potentials, steady-state visual evoked potentials , affective BCIs , regression problems, and adversarial attacks -- are considered. For each paradigm/application, we group the TL approaches into cross-subject/session, cross-device, and cross-task settings and review them separately. Observations and conclusions are made at the end of the paper, which may point to future research directions.", "edit_actions": [{"type": "D", "before": "directly", "after": null, "start_char_pos": 63, "end_char_pos": 71}, {"type": "R", "before": "using the", "after": "directly using", "start_char_pos": 88, "end_char_pos": 97}, {"type": "R", "before": "Electroencephalogram (EEG) is the most frequently used input signal in BCIs . However, EEG signals", "after": "Electroencephalograms (EEGs) used in BCIs", "start_char_pos": 113, "end_char_pos": 211}, {"type": "R", "before": "interferences", "after": "interference", "start_char_pos": 245, "end_char_pos": 258}, {"type": "R", "before": "among different subjects . So", "after": "across different subjects and sessions. Therefore", "start_char_pos": 319, "end_char_pos": 348}, {"type": "R", "before": "in", "after": "during", "start_char_pos": 479, "end_char_pos": 481}, {"type": "A", "before": null, "after": ",", "start_char_pos": 543, "end_char_pos": 543}, {"type": "R", "before": "subject-specific", "after": "training", "start_char_pos": 592, "end_char_pos": 608}, {"type": "R", "before": "time-consuming and user-unfriendly", "after": "time consuming and user unfriendly", "start_char_pos": 642, "end_char_pos": 676}, {"type": "R", "before": "can utilize", "after": "utilizes", "start_char_pos": 709, "end_char_pos": 720}, {"type": "D", "before": "the", "after": null, "start_char_pos": 810, "end_char_pos": 813}, {"type": "R", "before": "alleviate this calibration requirement", "after": "reduce the amount of calibration effort", "start_char_pos": 884, "end_char_pos": 922}, {"type": "D", "before": "(MI), event related potentials(ERP)", "after": null, "start_char_pos": 1089, "end_char_pos": 1124}, {"type": "A", "before": null, "after": "event-related potentials,", "start_char_pos": 1127, "end_char_pos": 1127}, {"type": "D", "before": "(SSVEP)", "after": null, "start_char_pos": 1166, "end_char_pos": 1173}, {"type": "D", "before": "(aBCI)", "after": null, "start_char_pos": 1191, "end_char_pos": 1197}], "sents_char_pos": [0, 112, 345, 534, 678, 924, 1040, 1263, 1415]} {"doc_id": "2004.07224", "revision_depth": "2", "before_revision": "The fatality rate of SARS-Cov-2 escalates with age and is larger in men than women. I show that these variations across age and gender are quantitatively explained by the levels of the ACE2 protein in the lungs . This correlation also rationalizes the association between Covid-19 lethality and hypertension. Surprisingly , despite ACE2 is the viral receptor, higher values of ACE2 lead to lower fatality. This behaviour is consistent with a previous mathematical model that predicts that the speed of the virus in URLanism has a maximum and then declines with receptor level. SARS-Cov-2 degrades ACE2 and thus worsens lung injury, causes vasoconstriction, possible thrombotic problemsand exacerbates the inflammatory responsedue to the cross-talk between ACE2, the prothrombotic state and the immune system. I develop here a mathematical model based on the influence of ACE2 on the speed of viral propagation and on the negative effects of its degradation. The model fits SARS-CoV-2 fatality rate across age and gender with high accuracy (r^2 ~ 0.9). Strikingly, rescaling the fitted models with the binding rates of the spike proteins of SARS and SARS-CoV-2 allow predicting the fatality rate of SARS across age and gender with high accuracy , in particular its higher severity for young patients . The epidemiology of the common-cold coronavirus NL63 is also consistent with the model and existing data on the affinity of its spike protein , thus linking the molecular and epidemiological levels. These results support the suggestion that drugs that act synergistically with ACE2 and enhance its expression , such as ACE inhibitors and angiotensin receptor blockers, may constitute a promising therapy against the most adverse effects of CoViD-19 , including hyperinflammation and thrombotic complications . Furthermore, ACE2 is a candidate prognostic factor for detecting population that needs stronger protection.", "after_revision": "The fatality rate of SARS-Cov-2 escalates with age and is larger in men than women. I show that these variations are strongly correlated with the levels of the ACE2 protein in the lungs but surprisingly , despite ACE2 is the viral receptor, higher levels lead to lower fatality. This behaviour is consistent with a previous mathematical model that predicts that the speed of viral progression in URLanism has a maximum and then declines with the receptor level. SARS-Cov-2 degrades ACE2 and thus worsens lung injury, causes vasoconstriction, thrombotic problems, and exacerbated inflammatory response. I developed a mathematical model based on the influence of ACE2 on viral propagation and on the negative effects of its degradation. The model fits SARS-CoV-2 fatality rate across age and gender with high accuracy (r^2 > 0.9). Rescaling the model parameters with the binding rates of the spike proteins of SARS-CoV and SARS-CoV-2 allows predicting the fatality rate of SARS-CoV across age and gender , in particular its higher severity for young patients , thus linking the molecular and epidemiological levels. These results support the suggestion that drugs that enhance the expression of ACE2 , such as ACE inhibitors and angiotensin receptor blockers, constitute a promising therapy against the most adverse effects of CoViD-19 . Furthermore, ACE2 is a candidate prognostic factor for detecting population that needs stronger protection.", "edit_actions": [{"type": "R", "before": "across age and gender are quantitatively explained by", "after": "are strongly correlated with", "start_char_pos": 113, "end_char_pos": 166}, {"type": "R", "before": ". This correlation also rationalizes the association between Covid-19 lethality and hypertension. Surprisingly", "after": "but surprisingly", "start_char_pos": 211, "end_char_pos": 321}, {"type": "R", "before": "values of ACE2", "after": "levels", "start_char_pos": 367, "end_char_pos": 381}, {"type": "R", "before": "the virus", "after": "viral progression", "start_char_pos": 502, "end_char_pos": 511}, {"type": "A", "before": null, "after": "the", "start_char_pos": 561, "end_char_pos": 561}, {"type": "R", "before": "possible thrombotic problemsand exacerbates the inflammatory responsedue to the cross-talk between ACE2, the prothrombotic state and the immune system. I develop here", "after": "thrombotic problems, and exacerbated inflammatory response. I developed", "start_char_pos": 658, "end_char_pos": 824}, {"type": "D", "before": "the speed of", "after": null, "start_char_pos": 880, "end_char_pos": 892}, {"type": "R", "before": "~", "after": ">", "start_char_pos": 1045, "end_char_pos": 1046}, {"type": "R", "before": "Strikingly, rescaling the fitted models", "after": "Rescaling the model parameters", "start_char_pos": 1053, "end_char_pos": 1092}, {"type": "R", "before": "SARS", "after": "SARS-CoV", "start_char_pos": 1141, "end_char_pos": 1145}, {"type": "R", "before": "allow", "after": "allows", "start_char_pos": 1161, "end_char_pos": 1166}, {"type": "R", "before": "SARS", "after": "SARS-CoV", "start_char_pos": 1199, "end_char_pos": 1203}, {"type": "D", "before": "with high accuracy", "after": null, "start_char_pos": 1226, "end_char_pos": 1244}, {"type": "D", "before": ". The epidemiology of the common-cold coronavirus NL63 is also consistent with the model and existing data on the affinity of its spike protein", "after": null, "start_char_pos": 1300, "end_char_pos": 1443}, {"type": "R", "before": "act synergistically with", "after": "enhance the expression of", "start_char_pos": 1554, "end_char_pos": 1578}, {"type": "D", "before": "and enhance its expression", "after": null, "start_char_pos": 1584, "end_char_pos": 1610}, {"type": "D", "before": "may", "after": null, "start_char_pos": 1671, "end_char_pos": 1674}, {"type": "D", "before": ", including hyperinflammation and thrombotic complications", "after": null, "start_char_pos": 1751, "end_char_pos": 1809}], "sents_char_pos": [0, 83, 212, 308, 405, 577, 809, 958, 1052, 1301, 1500, 1811]} {"doc_id": "2004.09426", "revision_depth": "1", "before_revision": "In this paper, we aim to integrate findings from the fields of machine learning and network science to argue URLanisms can be modeled as hierarchical Bayesian control systems with small world and bottleneck (bow tie ) network structure. The nested URLanization of such networks URLanisms to form increasingly integrated percepts and concepts of their inner and outer context, which can be compared to increasingly encompassing predictive models of the world (goal states), to allow for an optimal controlof actions . We argue that hierarchical Bayesian inference produces a hierarchy of goal states, from which it follows URLanisms must have some form of ` highest goals'. For URLanisms, these predictive models involve interior (self) models, exterior (social) models and overarching (normative) models. We show how such goals are constructed from progressively lesser goal states and that goal hierarchies tend to decompose in a top-down manner under severe and prolonged levels of stress. This loss of high-level control leads to a disinhibition of subordinate hierarchical levels, producing `critical' behavior and tipping points ( a sudden loss of homeostasis). Such phase transitions amount either to disease or the death of URLanism . This model can be used to URLanisms of any type, including humans. In humans, learning higher-level world models corresponds to personality development . A top-down collapse of high-level integrative goal states under stress is identified as a common factor in all forms of mental disease (psychopathology). The paper concludes by discussing ways of testing these hypotheses empirically.", "after_revision": "In this paper, we show URLanisms can be modeled as hierarchical Bayesian control systems with small world and information bottleneck (bow-tie ) network structure. Such systems combine hierarchical perception with hierarchical goal setting and hierarchical action control . We argue that hierarchical Bayesian control systems produce deep hierarchies of goal states, from which it follows URLanisms must have some form of ' highest goals'. For URLanisms, these involve internal (self) models, external (social) models and overarching (normative) models. We show that goal hierarchies tend to decompose in a top-down manner under severe and prolonged levels of stress. This produces behavior that favors short-term and self-referential goals over long term, social and/or normative goals. The collapse of goal hierarchies is universally accompanied by an increase in entropy (disorder) in control systems that can serve as an early warning sign for tipping points ( disease or death of URLanism ). In humans, learning goal hierarchies corresponds to personality development (maturation). The failure of goal hierarchies to mature properly corresponds to personality deficits. A top-down collapse of such hierarchies under stress is identified as a common factor in all forms of episodic mental disorders (psychopathology). The paper concludes by discussing ways of testing these hypotheses empirically.", "edit_actions": [{"type": "R", "before": "aim to integrate findings from the fields of machine learning and network science to argue", "after": "show", "start_char_pos": 18, "end_char_pos": 108}, {"type": "R", "before": "bottleneck (bow tie", "after": "information bottleneck (bow-tie", "start_char_pos": 196, "end_char_pos": 215}, {"type": "R", "before": "The nested URLanization of such networks URLanisms to form increasingly integrated percepts and concepts of their inner and outer context, which can be compared to increasingly encompassing predictive models of the world (goal states), to allow for an optimal controlof actions", "after": "Such systems combine hierarchical perception with hierarchical goal setting and hierarchical action control", "start_char_pos": 237, "end_char_pos": 514}, {"type": "R", "before": "inference produces a hierarchy", "after": "control systems produce deep hierarchies", "start_char_pos": 553, "end_char_pos": 583}, {"type": "R", "before": "`", "after": "'", "start_char_pos": 655, "end_char_pos": 656}, {"type": "R", "before": "predictive models involve interior", "after": "involve internal", "start_char_pos": 694, "end_char_pos": 728}, {"type": "R", "before": "exterior", "after": "external", "start_char_pos": 744, "end_char_pos": 752}, {"type": "D", "before": "how such goals are constructed from progressively lesser goal states and", "after": null, "start_char_pos": 813, "end_char_pos": 885}, {"type": "R", "before": "loss of high-level control leads to a disinhibition of subordinate hierarchical levels, producing `critical' behavior and", "after": "produces behavior that favors short-term and self-referential goals over long term, social and/or normative goals. The collapse of goal hierarchies is universally accompanied by an increase in entropy (disorder) in control systems that can serve as an early warning sign for", "start_char_pos": 997, "end_char_pos": 1118}, {"type": "R", "before": "a sudden loss of homeostasis). Such phase transitions amount either to disease or the", "after": "disease or", "start_char_pos": 1136, "end_char_pos": 1221}, {"type": "R", "before": ". This model can be used to URLanisms of any type, including humans.", "after": ").", "start_char_pos": 1240, "end_char_pos": 1308}, {"type": "R", "before": "higher-level world models", "after": "goal hierarchies", "start_char_pos": 1329, "end_char_pos": 1354}, {"type": "R", "before": ".", "after": "(maturation). The failure of goal hierarchies to mature properly corresponds to personality deficits.", "start_char_pos": 1394, "end_char_pos": 1395}, {"type": "R", "before": "high-level integrative goal states", "after": "such hierarchies", "start_char_pos": 1419, "end_char_pos": 1453}, {"type": "R", "before": "mental disease", "after": "episodic mental disorders", "start_char_pos": 1516, "end_char_pos": 1530}], "sents_char_pos": [0, 236, 516, 672, 804, 991, 1166, 1241, 1308, 1395, 1549]} {"doc_id": "2004.10002", "revision_depth": "1", "before_revision": "Prolonged sedentary behavior is related to a number of risk factors for chronic diseases. Given the high prevalence of sedentary behavior in daily life, light-weight solutions for behavior change are needed to avoid detrimental health effects. The mobile app SedVis was developed based on the Health Action Process Approach . The app provides personal mobility pattern visualization (for both physical activity and sedentary behavior) and action planning for sedentary behavior change. The primary aim of the study was to investigate the effect of mobility visualization on users' action planning for changing their sedentary behavior. The secondary aim was to evaluate user engagement with the visualization and user experience of the app. A three-week pilot studywas conducted with 16 participants who had the motivation to reduce their sedentary behavior. The results showed that the visualizations in SedVis had no statistically significant effect on the participants' action planning . The intervention involving the visualizations and action planning in SedVis had a positive effect on reducing participants' sedentary hours with weak evidence (mean -0.40, SD 0.63), while the active control condition did not decrease sedentary time (mean 0.17, SD 1.65). The results also suggested that the more frequently the users checked the app, the more they might reduce their sedentary behavior ; however, this finding did not reach statistical significance. The visualizations in the app also led to higher user-perceived novelty. No participant complained about the interruption, while some participants commented that making action plans every day was boring. Using a smartphone app to collect mobility data and provide feedback in real-time using visualizations might be a promising method to induce changes in sedentary behavior and might be more effective than action planning alone .", "after_revision": " Given the high prevalence of sedentary behavior in daily life, simple yet practical solutions for behavior change are needed to avoid detrimental health effects. The mobile app SedVis was developed based on the health action process approach . The app provides personal mobility pattern visualization (for both physical activity and sedentary behavior) and action planning for sedentary behavior change. The primary aim of the study is to investigate the effect of mobility pattern visualization on users' action planning for changing their sedentary behavior. The secondary aim is to evaluate user engagement with the visualization and user experience of the app. In a 3-week user study, participants were allocated to either an active control group (n=8) or an intervention group (n=8). In the 1-week baseline period, none of the participants had access to the functions in the app. In the following 2-week intervention period, only the intervention group was given access to the visualizations, whereas both groups were asked to make action plans every day and reduce their sedentary behavior. The results suggested that the visualizations in SedVis had no effect on the participants' action planning according to both the NHST and Bayesian statistics . The intervention involving visualizations and action planning in SedVis had a positive effect on reducing participants' sedentary hours , with weak evidence according to Bayesian statistics, whereas no change in sedentary time was more likely in the active control condition . Furthermore, Bayesian analysis weakly suggested that the more frequently the users checked the app, the more likely they were to reduce their sedentary behavior .", "edit_actions": [{"type": "D", "before": "Prolonged sedentary behavior is related to a number of risk factors for chronic diseases.", "after": null, "start_char_pos": 0, "end_char_pos": 89}, {"type": "R", "before": "light-weight", "after": "simple yet practical", "start_char_pos": 153, "end_char_pos": 165}, {"type": "R", "before": "Health Action Process Approach", "after": "health action process approach", "start_char_pos": 293, "end_char_pos": 323}, {"type": "R", "before": "was", "after": "is", "start_char_pos": 515, "end_char_pos": 518}, {"type": "A", "before": null, "after": "pattern", "start_char_pos": 557, "end_char_pos": 557}, {"type": "R", "before": "was", "after": "is", "start_char_pos": 655, "end_char_pos": 658}, {"type": "R", "before": "A three-week pilot studywas conducted with 16 participants who had the motivation to", "after": "In a 3-week user study, participants were allocated to either an active control group (n=8) or an intervention group (n=8). In the 1-week baseline period, none of the participants had access to the functions in the app. In the following 2-week intervention period, only the intervention group was given access to the visualizations, whereas both groups were asked to make action plans every day and", "start_char_pos": 742, "end_char_pos": 826}, {"type": "R", "before": "showed", "after": "suggested", "start_char_pos": 872, "end_char_pos": 878}, {"type": "D", "before": "statistically significant", "after": null, "start_char_pos": 920, "end_char_pos": 945}, {"type": "A", "before": null, "after": "according to both the NHST and Bayesian statistics", "start_char_pos": 990, "end_char_pos": 990}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1020, "end_char_pos": 1023}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1133, "end_char_pos": 1133}, {"type": "R", "before": "(mean -0.40, SD 0.63), while", "after": "according to Bayesian statistics, whereas no change in sedentary time was more likely in", "start_char_pos": 1153, "end_char_pos": 1181}, {"type": "R", "before": "did not decrease sedentary time (mean 0.17, SD 1.65). The results also", "after": ". Furthermore, Bayesian analysis weakly", "start_char_pos": 1211, "end_char_pos": 1281}, {"type": "R", "before": "they might", "after": "likely they were to", "start_char_pos": 1353, "end_char_pos": 1363}, {"type": "D", "before": "; however, this finding did not reach statistical significance. The visualizations in the app also led to higher user-perceived novelty. No participant complained about the interruption, while some participants commented that making action plans every day was boring. Using a smartphone app to collect mobility data and provide feedback in real-time using visualizations might be a promising method to induce changes in sedentary behavior and might be more effective than action planning alone", "after": null, "start_char_pos": 1396, "end_char_pos": 1889}], "sents_char_pos": [0, 89, 243, 325, 485, 636, 741, 859, 992, 1264, 1397, 1459, 1532, 1663]} {"doc_id": "2004.10117", "revision_depth": "5", "before_revision": "In severe viral pneumonia, including Coronavirus disease 2019 (COVID-19), the viral replication phase is often followed by hyperinflammation ('cytokine storm syndrome') , which can lead to acute respiratory distress syndrome, URLan failure, and death. We previously demonstrated that alpha-1 adrenergic receptor (\\alpha_1-AR) antagonists can prevent cytokine storm syndrome in mice. Here, we conducted retrospective analyses in two cohorts of patients with acute respiratory distress (ARD, n= 19,659 ) and three cohorts with pneumonia (n= 423,897 ). Federated across two ARD cohorts, our main result shows that patients using \\alpha_1-AR antagonists, as compared to nonusers , had a 40 \\% relative risk reduction for ventilation and dying ( p= 0.014 ). We replicated these methods on three pneumonia cohorts, all with similar effects on both outcomes. All results were robust to various sensitivity analyses. These results highlight the urgent need for prospective trials testing whether prophylactic use of \\alpha_1-AR antagonists ameliorates diseases associated with cytokine storm syndrome, such as COVID-19.", "after_revision": "In severe viral pneumonia, including Coronavirus disease 2019 (COVID-19), the viral replication phase is often followed by hyperinflammation , which can lead to acute respiratory distress syndrome, URLan failure, and death. We previously demonstrated that alpha-1 adrenergic receptor (\\alpha_1-AR) antagonists can prevent hyperinflammation ( cytokine storm syndrome ) in mice. Here, we conducted retrospective analyses in two cohorts of patients with acute respiratory distress (ARD, n= 18,547 ) and three cohorts with pneumonia (n= 400,907 ). Federated across two ARD cohorts, we find that patients exposed to \\alpha_1-AR antagonists, as compared to unexposed patients , had a 34 \\% relative risk reduction for mechanical ventilation and death (OR=0.70, p= 0.021 ). We replicated these methods on three pneumonia cohorts, all with similar effects on both outcomes. All results were robust to sensitivity analyses. These results highlight the urgent need for prospective trials testing whether prophylactic use of \\alpha_1-AR antagonists ameliorates lower respiratory tract infection-associated cytokine storm syndrome, as observed in COVID-19.", "edit_actions": [{"type": "D", "before": "('cytokine storm syndrome')", "after": null, "start_char_pos": 141, "end_char_pos": 168}, {"type": "A", "before": null, "after": "hyperinflammation (", "start_char_pos": 350, "end_char_pos": 350}, {"type": "A", "before": null, "after": ")", "start_char_pos": 375, "end_char_pos": 375}, {"type": "R", "before": "19,659", "after": "18,547", "start_char_pos": 495, "end_char_pos": 501}, {"type": "R", "before": "423,897", "after": "400,907", "start_char_pos": 541, "end_char_pos": 548}, {"type": "R", "before": "our main result shows that patients using", "after": "we find that patients exposed to", "start_char_pos": 586, "end_char_pos": 627}, {"type": "R", "before": "nonusers", "after": "unexposed patients", "start_char_pos": 668, "end_char_pos": 676}, {"type": "R", "before": "40", "after": "34", "start_char_pos": 685, "end_char_pos": 687}, {"type": "R", "before": "ventilation and dying (", "after": "mechanical ventilation and death (OR=0.70,", "start_char_pos": 719, "end_char_pos": 742}, {"type": "R", "before": "0.014", "after": "0.021", "start_char_pos": 746, "end_char_pos": 751}, {"type": "D", "before": "various", "after": null, "start_char_pos": 881, "end_char_pos": 888}, {"type": "R", "before": "diseases associated with", "after": "lower respiratory tract infection-associated", "start_char_pos": 1046, "end_char_pos": 1070}, {"type": "R", "before": "such as", "after": "as observed in", "start_char_pos": 1096, "end_char_pos": 1103}], "sents_char_pos": [0, 251, 384, 551, 754, 853, 910]} {"doc_id": "2004.11173", "revision_depth": "1", "before_revision": "We investigate a number of coloring problems restricted to bipartite graphs with bounded diameter. We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \\ge %%% 4 and every d%DIFDELCMD < \\ge %%% 3, and for k=3 and d%DIFDELCMD < \\ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs) for every k \\geq 3. Since k-List Coloring was already known to be NP-complete on complete bipartite graphs, and polynomial for k=2 on general graphs, the only remaining open problems are List 3-Coloring and 3-Precoloring Extension when d=3. We also prove that the Surjective C_6-Homomorphism problem is NP-complete on bipartite graphs with diameter at most 4, answering a question posed by Bodirsky, K\\'ara, and Martin [ Discret. Appl. Math. 2012 . As a byproduct, we get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph is NP-complete. An attempt to prove this result was presented by Fleischner, Mujuni, Paulusma, and Szeider Theor. Comput. Sci. 2009], but we realized that there was an apparently non-fixable flaw in their proof . Finally, we prove that the 3-Fall Coloring problem is NP-complete on bipartite graphs with diameter at most 4, and give a polynomial reduction from 3-Fall Coloring on bipartite graphs with diameter 3 to 3-Precoloring Extension on bipartite graphs with diameter 3. The latter result implies that if 3-Fall Coloring is NP-complete on these graphs, then the complexity gaps mentioned above for List k-Coloring and k-Precoloring Extension would be closed . This would also answer a question posed by Kratochv\\'il, Tuza, and Voigt Proc. of WG 2002].", "after_revision": "We investigate a number of coloring problems restricted to bipartite graphs with bounded diameter. First, we investigate the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems on bipartite graphs with diameter at most d, %DIFDELCMD < \\ge %%% %DIFDELCMD < \\ge %%% %DIFDELCMD < \\ge %%% proving NP-completeness in most cases, and leaving open only the List 3-Coloring and 3-Precoloring Extension problems when d=3. Some of these results are obtained through a proof that the Surjective C_6-Homomorphism problem is NP-complete on bipartite graphs with diameter at most four. Although the latter result has been already proved [ Vikas, 2017 , we present ours as an alternative simpler one. As a byproduct, we also get that 3-Biclique Partition is NP-complete. An attempt to prove this result was presented in Fleischner, Mujuni, Paulusma, and Szeider , 2009], but there was a flaw in their proof , which we identify and discuss here . Finally, we prove that the 3-Fall Coloring problem is NP-complete on bipartite graphs with diameter at most four, and prove that NP-completeness for diameter three would also imply NP-completeness of 3-Precoloring Extension on diameter three, thus closing the previously mentioned open cases . This would also answer a question posed in Kratochv\\'il, Tuza, and Voigt , 2002].", "edit_actions": [{"type": "R", "before": "We prove that", "after": "First, we investigate", "start_char_pos": 99, "end_char_pos": 112}, {"type": "D", "before": "are NP-complete", "after": null, "start_char_pos": 188, "end_char_pos": 203}, {"type": "D", "before": "for every k", "after": null, "start_char_pos": 249, "end_char_pos": 260}, {"type": "D", "before": "4 and every d", "after": null, "start_char_pos": 281, "end_char_pos": 294}, {"type": "D", "before": "3, and for k=3 and d", "after": null, "start_char_pos": 315, "end_char_pos": 335}, {"type": "R", "before": "4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs) for every k \\geq 3. Since k-List Coloring was already known to be NP-complete on complete bipartite graphs, and polynomial for k=2 on general graphs, the only remaining open problems are", "after": "proving NP-completeness in most cases, and leaving open only the", "start_char_pos": 356, "end_char_pos": 630}, {"type": "A", "before": null, "after": "problems", "start_char_pos": 675, "end_char_pos": 675}, {"type": "R", "before": "We also prove", "after": "Some of these results are obtained through a proof", "start_char_pos": 686, "end_char_pos": 699}, {"type": "R", "before": "4, answering a question posed by Bodirsky, K\\'ara, and Martin", "after": "four. Although the latter result has been already proved", "start_char_pos": 802, "end_char_pos": 863}, {"type": "D", "before": "Discret. Appl. Math. 2012", "after": null, "start_char_pos": 866, "end_char_pos": 891}, {"type": "R", "before": ".", "after": "Vikas, 2017", "start_char_pos": 892, "end_char_pos": 893}, {"type": "A", "before": null, "after": ", we present ours as an alternative simpler one.", "start_char_pos": 894, "end_char_pos": 894}, {"type": "R", "before": "get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph", "after": "also get that 3-Biclique Partition", "start_char_pos": 914, "end_char_pos": 1019}, {"type": "R", "before": "by", "after": "in", "start_char_pos": 1082, "end_char_pos": 1084}, {"type": "R", "before": "Theor. Comput. Sci.", "after": ",", "start_char_pos": 1127, "end_char_pos": 1146}, {"type": "R", "before": "we realized that there was an apparently non-fixable", "after": "there was a", "start_char_pos": 1158, "end_char_pos": 1210}, {"type": "A", "before": null, "after": ", which we identify and discuss here", "start_char_pos": 1231, "end_char_pos": 1231}, {"type": "R", "before": "4, and give a polynomial reduction from 3-Fall Coloring on bipartite graphs with diameter 3 to", "after": "four, and prove that NP-completeness for diameter three would also imply NP-completeness of", "start_char_pos": 1342, "end_char_pos": 1436}, {"type": "R", "before": "bipartite graphs with diameter 3. The latter result implies that if 3-Fall Coloring is NP-complete on these graphs, then the complexity gaps mentioned above for List k-Coloring and k-Precoloring Extension would be closed", "after": "diameter three, thus closing the previously mentioned open cases", "start_char_pos": 1464, "end_char_pos": 1684}, {"type": "R", "before": "by", "after": "in", "start_char_pos": 1727, "end_char_pos": 1729}, {"type": "R", "before": "Proc. of WG", "after": ",", "start_char_pos": 1760, "end_char_pos": 1771}], "sents_char_pos": [0, 98, 443, 685, 874, 1035, 1133, 1233, 1497, 1686]} {"doc_id": "2004.11355", "revision_depth": "4", "before_revision": "Official counts of COVID-19 deaths have been criticized for potentially including people who did not die of COVID-19 but merely died with COVID-19. I address that critique by fitting a generalized additive model to weekly counts of all registered deaths in England and Wales during the 2010s. The model produces baseline rates of death registrations expected in the absence of the COVID-19 pandemic, and comparing those baselines to recent counts of registered deaths exposes the emergence of excess deaths late in March 2020. Among\\pm adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \\pm 416 from 21-27 March, 5675%DIFDELCMD < \\pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \\pm %%% 468, 12,712%DIFDELCMD < \\pm %%% 589, and 10,511%DIFDELCMD < \\pm %%% 567 in April's next 3 weeks ). Both the Office for National Statistics's respective count of 26,891 death certificates which mention COVID-19, and the Department of Health and Social Care's hospital-focused count of 21,222 deaths, are appreciably less, implying that their counting methods have underestimated rather than overestimated the pandemic's true death toll. If underreporting rates have held steady , about 45,900 direct and indirect COVID-19 deaths might have been registered by April's end but not yet publicly reported in full.", "after_revision": "Official counts of COVID-19 deaths have been criticized for potentially including people who did not die of COVID-19 but merely died with COVID-19. I address that critique by fitting a generalized additive model to weekly counts of all deaths registered in England and Wales during the 2010s. The model produces baseline rates of death registrations expected without the COVID-19 pandemic, and comparing those baselines to recent counts of registered deaths exposes the emergence of excess deaths late in March 2020. By April's end, England and Wales registered 45,300\\pm 3200 excess deaths of adults aged 45+ . Through 8 May, the last day of available all-deaths data, 50,400 \\pm %DIFDELCMD < \\pm %%% %DIFDELCMD < \\pm %%% %DIFDELCMD < \\pm %%% %DIFDELCMD < \\pm %%% 3600 were registered (about 53\\% of which were of men ). Both the ONS's corresponding count of 36,870 death certificates which mention COVID-19, and the Department of Health and Social Care's hospital-focused count of 29,057 deaths, are appreciably less, implying that their counting methods have underestimated , not overestimated, the pandemic's true death toll. If underreporting rates have held steady during May, about 56,600 direct and indirect COVID-19 deaths might have been registered through 25 May but not yet publicly reported in full.", "edit_actions": [{"type": "R", "before": "registered deaths", "after": "deaths registered", "start_char_pos": 236, "end_char_pos": 253}, {"type": "R", "before": "in the absence of the", "after": "without the", "start_char_pos": 359, "end_char_pos": 380}, {"type": "R", "before": "Among", "after": "By April's end, England and Wales registered 45,300", "start_char_pos": 527, "end_char_pos": 532}, {"type": "A", "before": null, "after": "3200 excess deaths of", "start_char_pos": 536, "end_char_pos": 536}, {"type": "R", "before": ", about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612", "after": ". Through 8 May, the last day of available all-deaths data, 50,400", "start_char_pos": 553, "end_char_pos": 654}, {"type": "D", "before": "416 from 21-27 March, 5675", "after": null, "start_char_pos": 659, "end_char_pos": 685}, {"type": "D", "before": "439 from 28 March through 3 April,then 9183", "after": null, "start_char_pos": 706, "end_char_pos": 749}, {"type": "D", "before": "468, 12,712", "after": null, "start_char_pos": 770, "end_char_pos": 781}, {"type": "D", "before": "589, and 10,511", "after": null, "start_char_pos": 802, "end_char_pos": 817}, {"type": "R", "before": "567 in April's next 3 weeks", "after": "3600 were registered (about 53\\% of which were of men", "start_char_pos": 838, "end_char_pos": 865}, {"type": "R", "before": "Office for National Statistics's respective count of 26,891", "after": "ONS's corresponding count of 36,870", "start_char_pos": 878, "end_char_pos": 937}, {"type": "R", "before": "21,222", "after": "29,057", "start_char_pos": 1054, "end_char_pos": 1060}, {"type": "R", "before": "rather than overestimated", "after": ", not overestimated,", "start_char_pos": 1148, "end_char_pos": 1173}, {"type": "R", "before": ", about 45,900", "after": "during May, about 56,600", "start_char_pos": 1247, "end_char_pos": 1261}, {"type": "R", "before": "by April's end", "after": "through 25 May", "start_char_pos": 1325, "end_char_pos": 1339}], "sents_char_pos": [0, 147, 292, 526, 868, 1205]} {"doc_id": "2004.12224", "revision_depth": "1", "before_revision": "We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint (SMKP) . The input is a set I of items, each associated with a non-negative weight, and a set of bins , each having a capacity . Also, we are given a submodular, monotone and non-negative function f over subsets of the items. The objective is to find a subset of items A \\subseteq I and a packing of the items in the bins , such that f(A) is maximized. SMKP is a natural extension of both Multiple Knapsack and the problem of monotone submodular maximization subject to a knapsack constraint. Our main result is a nearly optimal polynomial time (1-e^{-1}- \\varepsilon \\eps )-approximation algorithm for the problem, for any \\varepsilon \\eps >0. Our algorithm relies on a refined analysis of techniques for constrained submodular optimization combined with sophisticated application of tools used in the development of approximation schemes for packing problems .", "after_revision": "We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint . The input is a set I of items, each has a non-negative weight, and a set of bins of arbitrary capacities . Also, we are given a submodular, monotone and non-negative function f over subsets of the items. The objective is to find a packing of a subset of items A \\subseteq I in the bins such that f(A) is maximized. Our main result is an almost optimal polynomial time (1-e^{-1}- \\eps )-approximation algorithm for the problem, for any \\eps >0. The algorithm relies on a structuring technique which converts a general multiple knapsack constraint to a constraint in which the bins are partitioned into groups of exponentially increasing cardinalities, each consisting of bins of uniform capacity. We derive the result by combining structuring with a refined analysis of techniques for submodular optimization subject to knapsack constraints .", "edit_actions": [{"type": "D", "before": "(SMKP)", "after": null, "start_char_pos": 108, "end_char_pos": 114}, {"type": "R", "before": "associated with", "after": "has", "start_char_pos": 153, "end_char_pos": 168}, {"type": "R", "before": ", each having a capacity", "after": "of arbitrary capacities", "start_char_pos": 210, "end_char_pos": 234}, {"type": "A", "before": null, "after": "packing of a", "start_char_pos": 361, "end_char_pos": 361}, {"type": "D", "before": "and a packing of the items", "after": null, "start_char_pos": 392, "end_char_pos": 418}, {"type": "D", "before": ",", "after": null, "start_char_pos": 431, "end_char_pos": 432}, {"type": "D", "before": "SMKP is a natural extension of both Multiple Knapsack and the problem of monotone submodular maximization subject to a knapsack constraint.", "after": null, "start_char_pos": 462, "end_char_pos": 601}, {"type": "R", "before": "a nearly", "after": "an almost", "start_char_pos": 621, "end_char_pos": 629}, {"type": "D", "before": "\\varepsilon", "after": null, "start_char_pos": 665, "end_char_pos": 676}, {"type": "D", "before": "\\varepsilon", "after": null, "start_char_pos": 733, "end_char_pos": 744}, {"type": "R", "before": "Our", "after": "The", "start_char_pos": 754, "end_char_pos": 757}, {"type": "A", "before": null, "after": "structuring technique which converts a general multiple knapsack constraint to a constraint in which the bins are partitioned into groups of exponentially increasing cardinalities, each consisting of bins of uniform capacity. We derive the result by combining structuring with a", "start_char_pos": 780, "end_char_pos": 780}, {"type": "R", "before": "constrained submodular optimization combined with sophisticated application of tools used in the development of approximation schemes for packing problems", "after": "submodular optimization subject to knapsack constraints", "start_char_pos": 816, "end_char_pos": 970}], "sents_char_pos": [0, 116, 236, 333, 461, 601, 753]} {"doc_id": "2004.12297", "revision_depth": "1", "before_revision": "Many information retrieval and natural language processing problems can be formalized as a semantic matchingtask. However, the existing work in this area has been focused in large part on the matching between short texts like finding answer spans, sentences and passages given a query or a natural language question. Semantic matching between long-form texts like documents, which can be applied to applications such as document clustering, news recommendationand related article recommendation , is relatively less explored and needs more research effort. In recent years, self-attention based models like Transformers and BERT have achieved state-of-the-art performance in several natural language understanding tasks. These kinds of models, however, are still restricted to short text sequences like sentences due to the quadratic computational time and space complexity of self-attention with respect to the input sequence length. In this paper, we address these issues by proposing the Siamese Multi-depth Transformer-based Hierarchical (SMITH) Encoder for document representation learning and matching, which contains several novel design choices to adapt self-attention models for long text inputs. For model pre-training, we propose the masked sentence block language modeling task in addition to the original masked word language modeling task used in BERT, to capture sentence block relations within a document. The experimental results on several benchmark data sets for long-form document matching show that our proposed SMITH model outperforms the previous state-of-the-art Siamese matching models including hierarchical attention, multi-depth attention-based hierarchical recurrent neural network, and BERT for long-form document matching, and increases the maximum input text length from 512 to 2048 when compared with BERT-based baseline methods .", "after_revision": "Many natural language processing and information retrieval problems can be formalized as the task of semantic matching. Existing work in this area has been largely focused on matching between short texts (e.g., question answering), or between a short and a long text (e.g., ad-hoc retrieval). Semantic matching between long-form documents, which has many important applications like news recommendation, related article recommendation and document clustering , is relatively less explored and needs more research effort. In recent years, self-attention based models like Transformers and BERT have achieved state-of-the-art performance in the task of text matching. These models, however, are still limited to short text like a few sentences or one paragraph due to the quadratic computational complexity of self-attention with respect to input text length. In this paper, we address the issue by proposing the Siamese Multi-depth Transformer-based Hierarchical (SMITH) Encoder for long-form document matching. Our model contains several innovations to adapt self-attention models for longer text input. In order to better capture sentence level semantic relations within a document, we pre-train the model with a novel masked sentence block language modeling task in addition to the masked word language modeling task used by BERT. Our experimental results on several benchmark datasets for long-form document matching show that our proposed SMITH model outperforms the previous state-of-the-art models including hierarchical attention, multi-depth attention-based hierarchical recurrent neural network, and BERT . Comparing to BERT based baselines, our model is able to increase maximum input text length from 512 to 2048. We will open source a Wikipedia based benchmark dataset, code and a pre-trained checkpoint to accelerate future research on long-form document matching .", "edit_actions": [{"type": "D", "before": "information retrieval and", "after": null, "start_char_pos": 5, "end_char_pos": 30}, {"type": "A", "before": null, "after": "and information retrieval", "start_char_pos": 59, "end_char_pos": 59}, {"type": "R", "before": "a semantic matchingtask. However, the existing", "after": "the task of semantic matching. Existing", "start_char_pos": 90, "end_char_pos": 136}, {"type": "R", "before": "focused in large part on the", "after": "largely focused on", "start_char_pos": 164, "end_char_pos": 192}, {"type": "R", "before": "like finding answer spans, sentences and passages given a query or a natural language question.", "after": "(e.g., question answering), or between a short and a long text (e.g., ad-hoc retrieval).", "start_char_pos": 222, "end_char_pos": 317}, {"type": "D", "before": "texts like", "after": null, "start_char_pos": 354, "end_char_pos": 364}, {"type": "R", "before": "can be applied to applications such as document clustering, news recommendationand", "after": "has many important applications like news recommendation,", "start_char_pos": 382, "end_char_pos": 464}, {"type": "A", "before": null, "after": "and document clustering", "start_char_pos": 496, "end_char_pos": 496}, {"type": "R", "before": "several natural language understanding tasks. These kinds of", "after": "the task of text matching. These", "start_char_pos": 677, "end_char_pos": 737}, {"type": "R", "before": "restricted", "after": "limited", "start_char_pos": 765, "end_char_pos": 775}, {"type": "R", "before": "sequences like sentences", "after": "like a few sentences or one paragraph", "start_char_pos": 790, "end_char_pos": 814}, {"type": "D", "before": "time and space", "after": null, "start_char_pos": 850, "end_char_pos": 864}, {"type": "R", "before": "the input sequence", "after": "input text", "start_char_pos": 910, "end_char_pos": 928}, {"type": "R", "before": "these issues", "after": "the issue", "start_char_pos": 963, "end_char_pos": 975}, {"type": "R", "before": "document representation learning and matching, which contains several novel design choices", "after": "long-form document matching. Our model contains several innovations", "start_char_pos": 1064, "end_char_pos": 1154}, {"type": "R", "before": "long text inputs. For model pre-training, we propose the", "after": "longer text input. In order to better capture sentence level semantic relations within a document, we pre-train the model with a novel", "start_char_pos": 1190, "end_char_pos": 1246}, {"type": "D", "before": "original", "after": null, "start_char_pos": 1311, "end_char_pos": 1319}, {"type": "R", "before": "in BERT, to capture sentence block relations within a document. The", "after": "by BERT. Our", "start_char_pos": 1360, "end_char_pos": 1427}, {"type": "R", "before": "data sets", "after": "datasets", "start_char_pos": 1470, "end_char_pos": 1479}, {"type": "D", "before": "Siamese matching", "after": null, "start_char_pos": 1589, "end_char_pos": 1605}, {"type": "R", "before": "for long-form document matching, and increases the", "after": ". Comparing to BERT based baselines, our model is able to increase", "start_char_pos": 1723, "end_char_pos": 1773}, {"type": "R", "before": "2048 when compared with BERT-based baseline methods", "after": "2048. We will open source a Wikipedia based benchmark dataset, code and a pre-trained checkpoint to accelerate future research on long-form document matching", "start_char_pos": 1812, "end_char_pos": 1863}], "sents_char_pos": [0, 114, 317, 558, 722, 936, 1207, 1423]} {"doc_id": "2004.12692", "revision_depth": "1", "before_revision": "Let {\\cal G} be a graph class. We say that a graph G is a k-apex of {\\cal G} if G contains a set S of at most k vertices such that G\\setminus S belongs to {\\cal G}. We prove that if {\\cal {\\cal G} is minor-closed, then there is{\\cal {\\cal {\\cal {\\cal {\\cal an algorithm that (k)}\\cdot n^3-time and } either returns a set S certifying that G is a k-apex of {\\cal {\\cal G} or reports that such a set does not exist, in 2^{{\\sf poly(k)}\\cdot n^3 time} \\notin {\\cal {\\cal . Here {\\sf poly} is a polynomial function whose degree depends on the maximum size of a minor-obstruction of {\\cal G} , i. e., the minor-minimal set of graphs not belonging to%DIFDELCMD < {\\cal %%% G . In the special case where {\\cal G} excludes some apex graph as a minor, we give an alternative algorithm running in 2^{{\\sf poly}(k)}\\cdot n^2 time .", "after_revision": "Let {\\cal G} be a minor-closed graph class. We say that a graph G is a k-apex of {\\cal G} if G contains a set S of at most k vertices such that G\\setminus S belongs to {\\cal G}. We denote by {\\cal A _k ({\\cal G} ) the set of all graphs that are k-apices of{\\cal G . In the first paper of this series we obtained upper bounds on the size of the graphs in the minor-obstruction set of{\\cal A _k ({\\cal G ), i.e., the minor-minimal set of graphs not belonging to{\\cal A _k ({\\cal G ). In this article we provide an algorithm that , given a graph G on n vertices, runs in 2^{{\\sf poly(k)}\\cdot n^3-time and } either returns a set S certifying that G \\in {\\cal A _k ({\\cal G} ), or reports that (k)}\\cdot n^3 time} G\\notin {\\cal A _k ({\\cal G ) . Here {\\sf poly} is a polynomial function whose degree depends on the maximum size of a minor-obstruction of {\\cal G} %DIFDELCMD < {\\cal %%% . In the special case where {\\cal G} excludes some apex graph as a minor, we give an alternative algorithm running in 2^{{\\sf poly}(k)}\\cdot n^2 -time .", "edit_actions": [{"type": "A", "before": null, "after": "minor-closed", "start_char_pos": 18, "end_char_pos": 18}, {"type": "R", "before": "prove that if", "after": "denote by", "start_char_pos": 169, "end_char_pos": 182}, {"type": "A", "before": null, "after": "A", "start_char_pos": 189, "end_char_pos": 189}, {"type": "A", "before": null, "after": "_k (", "start_char_pos": 190, "end_char_pos": 190}, {"type": "R", "before": "is minor-closed, then there is", "after": ") the set of all graphs that are k-apices of", "start_char_pos": 199, "end_char_pos": 229}, {"type": "A", "before": null, "after": "G", "start_char_pos": 235, "end_char_pos": 235}, {"type": "A", "before": null, "after": ". In the first paper of this series we obtained upper bounds on the size of the graphs in the minor-obstruction set of", "start_char_pos": 236, "end_char_pos": 236}, {"type": "A", "before": null, "after": "A", "start_char_pos": 242, "end_char_pos": 242}, {"type": "A", "before": null, "after": "_k (", "start_char_pos": 243, "end_char_pos": 243}, {"type": "A", "before": null, "after": "G", "start_char_pos": 249, "end_char_pos": 249}, {"type": "A", "before": null, "after": "), i.e., the minor-minimal set of graphs not belonging to", "start_char_pos": 250, "end_char_pos": 250}, {"type": "A", "before": null, "after": "A", "start_char_pos": 256, "end_char_pos": 256}, {"type": "A", "before": null, "after": "_k (", "start_char_pos": 257, "end_char_pos": 257}, {"type": "A", "before": null, "after": "G", "start_char_pos": 263, "end_char_pos": 263}, {"type": "A", "before": null, "after": "). In this article we provide", "start_char_pos": 264, "end_char_pos": 264}, {"type": "A", "before": null, "after": ", given a graph G on n vertices, runs in 2^{{\\sf poly", "start_char_pos": 283, "end_char_pos": 283}, {"type": "R", "before": "is a k-apex of", "after": "\\in", "start_char_pos": 349, "end_char_pos": 363}, {"type": "A", "before": null, "after": "A", "start_char_pos": 370, "end_char_pos": 370}, {"type": "A", "before": null, "after": "_k (", "start_char_pos": 371, "end_char_pos": 371}, {"type": "A", "before": null, "after": "),", "start_char_pos": 380, "end_char_pos": 380}, {"type": "D", "before": "such a set does not exist, in 2^{{\\sf poly", "after": null, "start_char_pos": 397, "end_char_pos": 439}, {"type": "A", "before": null, "after": "G", "start_char_pos": 459, "end_char_pos": 459}, {"type": "A", "before": null, "after": "A", "start_char_pos": 472, "end_char_pos": 472}, {"type": "A", "before": null, "after": "_k (", "start_char_pos": 473, "end_char_pos": 473}, {"type": "A", "before": null, "after": "G", "start_char_pos": 479, "end_char_pos": 479}, {"type": "A", "before": null, "after": ")", "start_char_pos": 480, "end_char_pos": 480}, {"type": "D", "before": ", i. e., the minor-minimal set of graphs not belonging to", "after": null, "start_char_pos": 600, "end_char_pos": 657}, {"type": "D", "before": "G", "after": null, "start_char_pos": 680, "end_char_pos": 681}, {"type": "R", "before": "time", "after": "-time", "start_char_pos": 827, "end_char_pos": 831}], "sents_char_pos": [0, 31, 165, 482]} {"doc_id": "2004.12765", "revision_depth": "2", "before_revision": "Automatic humor detection has interesting use cases in modern technologies, such as chatbots and virtual assistants. Based on the general linguistic structure of humor, in this paper, we propose a novel approach for detecting humor in short texts by using BERT sentence embedding . Our proposed method uses BERT to generate embeddings for sentences of a given text and uses these embeddings as inputs for parallel lines of hidden layers in a neural network. These lines are finally concatenated to predict the target value. For evaluation purposes, we created a new dataset for humor detection consisting of 200k formal short texts (100k positive and 100k negative). Experimental results show that our proposed method can determine humor in short texts with accuracy and an F1-score of 98.2 percent. Our 8-layer model with 110M parameters outperforms all baseline models with a large margin, showing the importance of utilizing linguistic structure in machine learning models.", "after_revision": "Automatic humor detection has interesting use cases in modern technologies, such as chatbots and virtual assistants. In this paper, we propose a novel approach for detecting humor in short texts based on the general linguistic structure of humor . Our proposed method uses BERT to generate embeddings for sentences of a given text and uses these embeddings as inputs of parallel lines of hidden layers in a neural network. These lines are finally concatenated to predict the target value. For evaluation purposes, we created a new dataset for humor detection consisting of 200k formal short texts (100k positive and 100k negative). Experimental results show that our proposed method can determine humor in short texts with accuracy and an F1-score of 98.2 percent. Our 8-layer model with 110M parameters outperforms the baseline models with a large margin, showing the importance of utilizing linguistic structure of texts in machine learning models.", "edit_actions": [{"type": "R", "before": "Based on the general linguistic structure of humor, in", "after": "In", "start_char_pos": 117, "end_char_pos": 171}, {"type": "R", "before": "by using BERT sentence embedding", "after": "based on the general linguistic structure of humor", "start_char_pos": 247, "end_char_pos": 279}, {"type": "R", "before": "for", "after": "of", "start_char_pos": 401, "end_char_pos": 404}, {"type": "R", "before": "all", "after": "the", "start_char_pos": 851, "end_char_pos": 854}, {"type": "A", "before": null, "after": "of texts", "start_char_pos": 949, "end_char_pos": 949}], "sents_char_pos": [0, 116, 281, 457, 523, 666, 799]} {"doc_id": "2004.12836", "revision_depth": "1", "before_revision": "The total number of COVID-19 infections is critical information for decision makers when assessing the progress of the pandemic, its implications, and policy options . Despite efforts to carefully monitor the COVID-19 pandemic, the reported number of confirmed cases is likely to underestimate the actual number of infections. We aim to estimate the total number of COVID-19 infections in a straightforward manner using a demographic scaling model. This model is broadly applicable as it is based on little input data : deaths attributable to COVID-19 , COVID-19 infection fatality rates , and life tables. As many countries lack reliable estimates of age-specific infection fatality rates, we map them from a reference country onto countries of interest based on remaining life expectancy . This scaling accounts for cross-country differences in the age structure, the health status, and the health care system. We also introduce easy to apply formulas to quantify the bias that would be required in death counts and infection fatality rates in order to reproduce a certain estimate of infections. Across the 10 countries with most COVID-19 deaths as of April 17 , 2020, our estimates suggest that the total number of infected is approximately 4 times the number of ] confirmed cases. The uncertainty, however, is high, as the lower bound of the 95\\% prediction interval suggests on average twice as many infections than confirmed cases, and the upper bound 10 times as many. Comparing our results with findings from local seroprevalence studies and applying our bias formulas shows that some of their infection estimates would only be possible if just a small fraction of COVID-19 related deaths were recorded, indicating that these seroprevalence estimates might not be representative for the total population.", "after_revision": "Understanding how widely COVID-19 has spread is critical for examining the pandemic's progression . Despite efforts to carefully monitor the pandemic, the number of confirmed cases may underestimate the total number of infections. We introduce a demographic scaling model to estimate COVID-19 infections using an broadly applicable approach that is based on minimal data requirements: COVID-19 related deaths, infection fatality rates (IFRs) , and life tables. As many countries lack reliable estimates of age-specific IFRs, we scale IFRs between countries using remaining life expectancy as a marker to account for differences in age structures, health conditions, and medical services. Across 10 countries with most COVID-19 deaths as of May 13 , 2020, the number of infections is estimated to be four 95\\% prediction interval: 2-11] times higher than the number of confirmed cases. Cross-country variation is high. The estimated number of infections is 1.4 million (six times the number of confirmed cases) for Italy; 3.1 million (2.2 times the number of confirmed cases) for the U.S.; and 1.8 times the number of confirmed cases for Germany, where testing has been comparatively extensive. Our prevalence estimates, however, are markedly lower than most others based on local seroprevalence studies . We introduce formulas for quantifying the bias that is required in our data on deaths in order to reproduce estimates published elsewhere. This bias analysis shows that either COVID-19 deaths are severely underestimated, by a factor of two or more; or alternatively, the seroprevalence based results are overestimates and not representative for the total population.", "edit_actions": [{"type": "R", "before": "The total number of", "after": "Understanding how widely", "start_char_pos": 0, "end_char_pos": 19}, {"type": "R", "before": "infections is critical information for decision makers when assessing the progress of the pandemic, its implications, and policy options", "after": "has spread is critical for examining the pandemic's progression", "start_char_pos": 29, "end_char_pos": 165}, {"type": "D", "before": "COVID-19", "after": null, "start_char_pos": 209, "end_char_pos": 217}, {"type": "D", "before": "reported", "after": null, "start_char_pos": 232, "end_char_pos": 240}, {"type": "R", "before": "is likely to underestimate the actual", "after": "may underestimate the total", "start_char_pos": 267, "end_char_pos": 304}, {"type": "R", "before": "aim to estimate the total number of", "after": "introduce a demographic scaling model to estimate", "start_char_pos": 330, "end_char_pos": 365}, {"type": "R", "before": "in a straightforward manner using a demographic scaling model. This model is broadly applicable as it", "after": "using an broadly applicable approach that", "start_char_pos": 386, "end_char_pos": 487}, {"type": "R", "before": "little input data : deaths attributable to", "after": "minimal data requirements:", "start_char_pos": 500, "end_char_pos": 542}, {"type": "R", "before": ", COVID-19", "after": "related deaths,", "start_char_pos": 552, "end_char_pos": 562}, {"type": "A", "before": null, "after": "(IFRs)", "start_char_pos": 588, "end_char_pos": 588}, {"type": "R", "before": "infection fatality rates, we map them from a reference country onto countries of interest based on", "after": "IFRs, we scale IFRs between countries using", "start_char_pos": 666, "end_char_pos": 764}, {"type": "R", "before": ". This scaling accounts for cross-country differences in the age structure, the health status, and the health care system. We also introduce easy to apply formulas to quantify the bias that would be required in death counts and infection fatality rates in order to reproduce a certain estimate of infections. Across the", "after": "as a marker to account for differences in age structures, health conditions, and medical services. Across", "start_char_pos": 791, "end_char_pos": 1110}, {"type": "R", "before": "April 17", "after": "May 13", "start_char_pos": 1156, "end_char_pos": 1164}, {"type": "D", "before": "our estimates suggest that the total number of infected is approximately 4 times", "after": null, "start_char_pos": 1173, "end_char_pos": 1253}, {"type": "A", "before": null, "after": "infections is estimated to be four", "start_char_pos": 1268, "end_char_pos": 1268}, {"type": "A", "before": null, "after": "95\\% prediction interval: 2-11", "start_char_pos": 1269, "end_char_pos": 1269}, {"type": "A", "before": null, "after": "times higher than the number of", "start_char_pos": 1271, "end_char_pos": 1271}, {"type": "R", "before": "The uncertainty, however, is high, as the lower bound of the 95\\% prediction interval suggests on average twice as many infections than confirmed cases, and the upper bound 10 times as many. Comparing our results with findings from", "after": "Cross-country variation is high. The estimated number of infections is 1.4 million (six times the number of confirmed cases) for Italy; 3.1 million (2.2 times the number of confirmed cases) for the U.S.; and 1.8 times the number of confirmed cases for Germany, where testing has been comparatively extensive. Our prevalence estimates, however, are markedly lower than most others based on", "start_char_pos": 1289, "end_char_pos": 1520}, {"type": "R", "before": "and applying our bias formulas shows that some of their infection estimates would only be possible if just a small fraction of", "after": ". We introduce formulas for quantifying the bias that is required in our data on deaths in order to reproduce estimates published elsewhere. This bias analysis shows that either", "start_char_pos": 1550, "end_char_pos": 1676}, {"type": "R", "before": "related deaths were recorded, indicating that these seroprevalence estimates might not be", "after": "deaths are severely underestimated, by a factor of two or more; or alternatively, the seroprevalence based results are overestimates and not", "start_char_pos": 1686, "end_char_pos": 1775}], "sents_char_pos": [0, 326, 448, 607, 792, 913, 1099, 1288, 1479]} {"doc_id": "2004.13216", "revision_depth": "2", "before_revision": "Transmission rates in epidemic outbreaks vary over time depending on the societal and government responseto infections and mortality data, as evidenced in the course of the COVID-19 pandemic. Following a mean field approach that models individuals like molecules in a well-mixed solution, I derive a modified SIR model in which the average daily contacts between susceptible and infected population are reduced based on the known infection levels, capturing the effects of social distancing policies. This approach yields a time-varying reproduction number that is continuously adjusted based on infection information through a negative-feedback term that is equivalent to Holling type II functions in ecology and Hill functions in chemistry and molecular biology. This feedback-adjustment of the transmission rate causes a structural reduction in infection peak, and simulations indicate that such reduction persists even in the presence of information delays. Simulations also show that a distancing policy based on infection data may substantially extend the duration of an epidemic. If the distancing rate is linearly proportional to infections, this model adds a single parameter to the original SIR , making it useful to illustrate the effects of social distancing enforced based on awareness of infections .", "after_revision": "Transmission rates in epidemic outbreaks may vary over time depending on the societal response. Non-pharmacological mitigation strategies such as social distancing and the adoption of protective equipment aim precisely at reducing transmission rates by reducing infectious contacts. To investigate the effects of mitigation strategies on the evolution of epidemics, nonlinear transmission rates that are influenced by the levels of infections, deaths or recoveries have been included in many variants of the classical SIR model. This class of models is particularly relevant to the COVID-19 epidemic, in which the population behavior has been affected by the unprecedented abundance and rapid distribution of global infection and death data through online platforms. This manuscript revisits a SIR model in which the reduction of transmission rate is due to knowledge of infections. Through a mean field approach that assumes individuals behave like molecules in a well-mixed solution, one derives a time-varying reproduction number that depends on infection information through a negative feedback term that is equivalent to Holling type II functions in ecology and Michaelis-Menten functions in chemistry and molecular biology. A step-by-step derivation of the model is provided, together with an overview of methods for its qualitative analysis, showing that negative feedback structurally reduces the peak of infections. At the same time, feedback may substantially extend the duration of an epidemic. Computational simulations agree with the analytical predictions, and further suggest that infection peak reduction persists even in the presence of information delays. If the mitigation strategy is linearly proportional to infections, a single parameter is added to the SIR model , making it useful to illustrate the effects of infection-dependent social distancing .", "edit_actions": [{"type": "A", "before": null, "after": "may", "start_char_pos": 41, "end_char_pos": 41}, {"type": "R", "before": "and government responseto infections and mortality data, as evidenced in", "after": "response. Non-pharmacological mitigation strategies such as social distancing and the adoption of protective equipment aim precisely at reducing transmission rates by reducing infectious contacts. To investigate the effects of mitigation strategies on the evolution of epidemics, nonlinear transmission rates that are influenced by the levels of infections, deaths or recoveries have been included in many variants of the classical SIR model. This class of models is particularly relevant to", "start_char_pos": 83, "end_char_pos": 155}, {"type": "D", "before": "course of the", "after": null, "start_char_pos": 160, "end_char_pos": 173}, {"type": "R", "before": "pandemic. Following a", "after": "epidemic, in which the population behavior has been affected by the unprecedented abundance and rapid distribution of global infection and death data through online platforms. This manuscript revisits a SIR model in which the reduction of transmission rate is due to knowledge of infections. Through a", "start_char_pos": 183, "end_char_pos": 204}, {"type": "R", "before": "models individuals", "after": "assumes individuals behave", "start_char_pos": 230, "end_char_pos": 248}, {"type": "R", "before": "I derive a modified SIR model in which the average daily contacts between susceptible and infected population are reduced based on the known infection levels, capturing the effects of social distancing policies. This approach yields a", "after": "one derives a", "start_char_pos": 290, "end_char_pos": 524}, {"type": "R", "before": "is continuously adjusted based", "after": "depends", "start_char_pos": 563, "end_char_pos": 593}, {"type": "R", "before": "negative-feedback", "after": "negative feedback", "start_char_pos": 629, "end_char_pos": 646}, {"type": "R", "before": "Hill", "after": "Michaelis-Menten", "start_char_pos": 715, "end_char_pos": 719}, {"type": "R", "before": "This feedback-adjustment of the transmission rate causes a structural reduction in infection peak, and simulations indicate that such reduction persists even in the presence of information delays. Simulations also show that a distancing policy based on infection data", "after": "A step-by-step derivation of the model is provided, together with an overview of methods for its qualitative analysis, showing that negative feedback structurally reduces the peak of infections. At the same time, feedback", "start_char_pos": 766, "end_char_pos": 1033}, {"type": "R", "before": "If the distancing rate", "after": "Computational simulations agree with the analytical predictions, and further suggest that infection peak reduction persists even in the presence of information delays. If the mitigation strategy", "start_char_pos": 1088, "end_char_pos": 1110}, {"type": "D", "before": "this model adds", "after": null, "start_char_pos": 1151, "end_char_pos": 1166}, {"type": "R", "before": "to the original SIR", "after": "is added to the SIR model", "start_char_pos": 1186, "end_char_pos": 1205}, {"type": "R", "before": "social distancing enforced based on awareness of infections", "after": "infection-dependent social distancing", "start_char_pos": 1254, "end_char_pos": 1313}], "sents_char_pos": [0, 192, 501, 765, 962, 1087]} {"doc_id": "2004.13614", "revision_depth": "2", "before_revision": "The unprecedented cessation of human activities during the COVID-19 pandemic has affected global energy use and CO2 emissions from fossil fuel use and cement production . Here we show that the decrease in global fossil CO2 emissions during the first quarter of 2020 was of 5.8\\% (542 Mt CO2 with a 20\\% 1- {\\sigma} uncertainty) . Unlike other emerging estimates , ours show the temporal dynamics of emissions based on actual emissions data from power generation (for 29 countries) and industry (for 73 countries), on near real time activity data for road transportation (for 132 countries ), aviation and maritime transportation , and on heating degree days for commercial and residential sectors emissions (for 206 countries). These dynamic estimates cover all of the human induced CO2 emissions from fossil fuel combustion and cement production. The largest share of COVID-related decreases in emissions are due to decreases in industry (157.9 Mt CO2, -7.1\\%compared to 2019), followed by road transportation (145.7 Mt CO2, -8.3\\% ), power generation (131.6 Mt CO2, -3.8 \\%), residential (47.8 Mt CO2, -3.6 \\%), fishing and maritime transport (35.5 Mt CO2, -13.3\\%)and aviation (33.4 Mt CO2, -8.0 \\%). Regionally, decreases in emissions from China were the largest and earliest ( -10.3 \\%), followed by Europe (EU-27 & UK) ( -4.3 \\%) and the U.S. ( -4.2 \\%). Relative decreases of regional CO2 emissions are consistent with regional nitrogen oxides concentrations observed by satellites and ground-based networks . Despite the unprecedented decreases in CO2 emissions and comparable decreases in economic activities, we monitored decreases in the carbon intensity (Emission per unit of GDP) in China (3.5\\%), the U. S. (4.5\\%) and Europe (5.4\\%) over the first quarter, suggesting that carbon-intensive activities have been disproportionally impacted .", "after_revision": "The considerable cessation of human activities during the COVID-19 pandemic has affected global energy use and CO2 emissions . Here we show the unprecedented decrease in global fossil CO2 emissions from January to April 2020 was of 7.8\\% (938 Mt CO2 with a +6.8\\% of 2- {\\sigma} uncertainty) when compared with the period last year. In addition other emerging estimates of COVID impacts based on monthly energy supply or estimated parameters, this study contributes to another step that constructed the near-real-time daily CO2 emission inventories based on activity from power generation (for 29 countries) , industry (for 73 countries), road transportation (for 406 cities ), aviation and maritime transportation and commercial and residential sectors emissions (for 206 countries). The estimates distinguished the decline of CO2 due to COVID-19 from the daily, weekly and seasonal variations as well as the holiday events. The COVID-related decreases in CO2 emissions in road transportation (340.4 Mt CO2, -15.5\\%), power (292.5 Mt CO2, -6.4\\% compared to 2019), industry (136.2 Mt CO2, -4.4 \\%), aviation (92.8 Mt CO2, -28.9 \\%), residential (43.4 Mt CO2, -2.7\\%), and international shipping (35.9 Mt CO2, -15 \\%). Regionally, decreases in China were the largest and earliest ( 234.5 Mt CO2,-6.9 \\%), followed by Europe (EU-27 & UK) ( 138.3 Mt CO2, -12.0 \\%) and the U.S. ( 162.4 Mt CO2, -9.5 \\%). The declines of CO2 are consistent with regional nitrogen oxides concentrations observed by satellites and ground-based networks , but the calculated signal of emissions decreases (about 1Gt CO2) will have little impacts (less than 0.13ppm by April 30, 2020) on the overserved global CO2 concertation. However, with observed fast CO2 recovery in China and partial re-opening globally, our findings suggest the longer-term effects on CO2 emissions are unknown and should be carefully monitored using multiple measures .", "edit_actions": [{"type": "R", "before": "unprecedented", "after": "considerable", "start_char_pos": 4, "end_char_pos": 17}, {"type": "D", "before": "from fossil fuel use and cement production", "after": null, "start_char_pos": 126, "end_char_pos": 168}, {"type": "R", "before": "that the", "after": "the unprecedented", "start_char_pos": 184, "end_char_pos": 192}, {"type": "R", "before": "during the first quarter of", "after": "from January to April", "start_char_pos": 233, "end_char_pos": 260}, {"type": "R", "before": "5.8\\% (542", "after": "7.8\\% (938", "start_char_pos": 273, "end_char_pos": 283}, {"type": "R", "before": "20\\% 1-", "after": "+6.8\\% of 2-", "start_char_pos": 298, "end_char_pos": 305}, {"type": "R", "before": ". Unlike", "after": "when compared with the period last year. In addition", "start_char_pos": 328, "end_char_pos": 336}, {"type": "R", "before": ", ours show the temporal dynamics of emissions based on actual emissions data", "after": "of COVID impacts based on monthly energy supply or estimated parameters, this study contributes to another step that constructed the near-real-time daily CO2 emission inventories based on activity", "start_char_pos": 362, "end_char_pos": 439}, {"type": "R", "before": "and", "after": ",", "start_char_pos": 481, "end_char_pos": 484}, {"type": "D", "before": "on near real time activity data for", "after": null, "start_char_pos": 514, "end_char_pos": 549}, {"type": "R", "before": "132 countries", "after": "406 cities", "start_char_pos": 575, "end_char_pos": 588}, {"type": "R", "before": ", and on heating degree days for", "after": "and", "start_char_pos": 629, "end_char_pos": 661}, {"type": "R", "before": "These dynamic estimates cover all of the human induced", "after": "The estimates distinguished the decline of", "start_char_pos": 728, "end_char_pos": 782}, {"type": "R", "before": "emissions from fossil fuel combustion and cement production. The largest share of", "after": "due to COVID-19 from the daily, weekly and seasonal variations as well as the holiday events. The", "start_char_pos": 787, "end_char_pos": 868}, {"type": "R", "before": "emissions are due to decreases in industry (157.9", "after": "CO2 emissions in road transportation (340.4", "start_char_pos": 896, "end_char_pos": 945}, {"type": "R", "before": "-7.1\\%compared to 2019), followed by road transportation (145.7", "after": "-15.5\\%), power (292.5", "start_char_pos": 954, "end_char_pos": 1017}, {"type": "R", "before": "-8.3\\% ), power generation (131.6", "after": "-6.4\\% compared to 2019), industry (136.2", "start_char_pos": 1026, "end_char_pos": 1059}, {"type": "R", "before": "-3.8", "after": "-4.4", "start_char_pos": 1068, "end_char_pos": 1072}, {"type": "R", "before": "residential (47.8", "after": "aviation (92.8", "start_char_pos": 1078, "end_char_pos": 1095}, {"type": "R", "before": "-3.6", "after": "-28.9", "start_char_pos": 1104, "end_char_pos": 1108}, {"type": "R", "before": "fishing and maritime transport (35.5", "after": "residential (43.4", "start_char_pos": 1114, "end_char_pos": 1150}, {"type": "R", "before": "-13.3\\%)and aviation (33.4", "after": "-2.7\\%), and international shipping (35.9", "start_char_pos": 1159, "end_char_pos": 1185}, {"type": "R", "before": "-8.0", "after": "-15", "start_char_pos": 1194, "end_char_pos": 1198}, {"type": "D", "before": "emissions from", "after": null, "start_char_pos": 1229, "end_char_pos": 1243}, {"type": "R", "before": "-10.3", "after": "234.5 Mt CO2,-6.9", "start_char_pos": 1282, "end_char_pos": 1287}, {"type": "R", "before": "-4.3", "after": "138.3 Mt CO2, -12.0", "start_char_pos": 1327, "end_char_pos": 1331}, {"type": "R", "before": "-4.2", "after": "162.4 Mt CO2, -9.5", "start_char_pos": 1351, "end_char_pos": 1355}, {"type": "R", "before": "Relative decreases of regional", "after": "The declines of", "start_char_pos": 1361, "end_char_pos": 1391}, {"type": "D", "before": "emissions", "after": null, "start_char_pos": 1396, "end_char_pos": 1405}, {"type": "R", "before": ". Despite the unprecedented decreases in CO2 emissions and comparable decreases in economic activities, we monitored decreases in the carbon intensity (Emission per unit of GDP) in China (3.5\\%), the U. S. (4.5\\%) and Europe (5.4\\%) over the first quarter, suggesting that carbon-intensive activities have been disproportionally impacted", "after": ", but the calculated signal of emissions decreases (about 1Gt CO2) will have little impacts (less than 0.13ppm by April 30, 2020) on the overserved global CO2 concertation. However, with observed fast CO2 recovery in China and partial re-opening globally, our findings suggest the longer-term effects on CO2 emissions are unknown and should be carefully monitored using multiple measures", "start_char_pos": 1515, "end_char_pos": 1852}], "sents_char_pos": [0, 170, 329, 727, 847, 1203, 1360, 1516]} {"doc_id": "2004.14331", "revision_depth": "1", "before_revision": " In the absence of a vaccine or effective treatment for COVID-19, countries have adopted Non-Pharmaceutical Interventions (NPIs) such as social distancing and full lockdown. An objective and quantitative means of monitoring the impact of, and compliance with, these interventions at a local level is urgently required. Here we explore the utility of the recently developed open-source mobile health platform RADAR-base as a toolbox to test the effect and response to NPIs aimed at limiting the spread of COVID- 19. We included 1062 participants recruited in Italy, Spain, Denmark, the UK and the Netherlands. We analysed phone GPS, phone usage data and Fitbit activity, heart rate, sleep, which were collected and managed by the RADAR-base platform. Daily features were derived reflecting mobility, functional measures, and phone usage . We visualised data using time series plots and performed statistical tests to assess differences in behaviour during baseline, pre- and post-lockdown periods. We found significant changes in behaviours between baseline/pre-lockdown and post- lockdown for all features except total sleep duration. In general, participants spent more time at home and travelled much less and were more active on their phones, interacting with others by using social apps. Nevertheless, the level of compliance across nations differed with Denmark showing attenuated changes in behaviour. Differences in the extracted features by country may reflect cultural differences as well as variations in communication and implementation of different NPIs . We have demonstrated that generalised open-source mobile health monitoring platforms such as RADAR-base which leverages data from wearables and mobile technologies are valuable tools for helping understand the behavioural impact of public health interventions implemented in response to infectious outbreaks such as COVID-19.", "after_revision": "Background In the absence of a vaccine or effective treatment for COVID-19, countries have adopted Non-Pharmaceutical Interventions (NPIs) such as social distancing and full lockdown. An objective and quantitative means of monitoring the impact and response of these interventions at a local level is urgently required. Here we explore the utility of the recently developed open-source mobile health platform RADAR-base as a toolbox to test the effect and response to NPIs aimed at limiting the spread of COVID-19. Methods We included 1062 participants recruited in Italy, Spain, Denmark, the UK , and the Netherlands. We derived features from the phone and wearable device for length of time spent at home, distance travelled from home, heart rate, sleep, and patterns of phone use . We visualised data using time series plots and performed statistical tests to assess differences in behaviour during baseline, pre- , and post-lockdown periods. Findings We found significant changes in behaviours between baseline/pre-lockdown and post-lockdown for all features except total sleep duration. In general, participants spent more time at home , travelled much less , and were more active on their phones, interacting with others by using social apps. Nevertheless, the response across nations differed with Denmark showing attenuated changes in behaviour. Interpretation Differences in the extracted features by country may reflect variations in communication and implementation of different NPIs as well as cultural differences . We have demonstrated that generalised open-source mobile health monitoring platforms such as RADAR-base which leverages data from wearables and mobile technologies are valuable tools for helping understand the behavioural impact of public health interventions implemented in response to infectious outbreaks such as COVID-19.", "edit_actions": [{"type": "A", "before": null, "after": "Background", "start_char_pos": 0, "end_char_pos": 0}, {"type": "R", "before": "of, and compliance with,", "after": "and response of", "start_char_pos": 235, "end_char_pos": 259}, {"type": "R", "before": "COVID- 19.", "after": "COVID-19. Methods", "start_char_pos": 504, "end_char_pos": 514}, {"type": "A", "before": null, "after": ",", "start_char_pos": 588, "end_char_pos": 588}, {"type": "R", "before": "analysed phone GPS, phone usage data and Fitbit activity,", "after": "derived features from the phone and wearable device for length of time spent at home, distance travelled from home,", "start_char_pos": 613, "end_char_pos": 670}, {"type": "R", "before": "which were collected and managed by the RADAR-base platform. Daily features were derived reflecting mobility, functional measures, and phone usage", "after": "and patterns of phone use", "start_char_pos": 690, "end_char_pos": 836}, {"type": "A", "before": null, "after": ",", "start_char_pos": 971, "end_char_pos": 971}, {"type": "A", "before": null, "after": "Findings", "start_char_pos": 999, "end_char_pos": 999}, {"type": "R", "before": "post- lockdown", "after": "post-lockdown", "start_char_pos": 1077, "end_char_pos": 1091}, {"type": "R", "before": "and", "after": ",", "start_char_pos": 1187, "end_char_pos": 1190}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1211, "end_char_pos": 1211}, {"type": "R", "before": "level of compliance", "after": "response", "start_char_pos": 1314, "end_char_pos": 1333}, {"type": "A", "before": null, "after": "Interpretation", "start_char_pos": 1412, "end_char_pos": 1412}, {"type": "D", "before": "cultural differences as well as", "after": null, "start_char_pos": 1474, "end_char_pos": 1505}, {"type": "A", "before": null, "after": "as well as cultural differences", "start_char_pos": 1571, "end_char_pos": 1571}], "sents_char_pos": [0, 173, 318, 514, 609, 750, 838, 998, 1137, 1295, 1411, 1573]} {"doc_id": "2004.14550", "revision_depth": "1", "before_revision": "The challenges of building knowledge-grounded retrieval-based chatbots lie in how to ground a conversation on the background knowledge and how to perform their matching with the response . This paper proposes a method named Filtering before Iteratively REferring (FIRE) for presenting the background knowledge of dialogue agents in retrieval-based chatbots. We first propose a pre-filter, which is composed of a context filter and a knowledge filter . This pre-filter grounds the conversation on the knowledge and comprehends the knowledge according to the conversation by collecting the matching information between them bidirectionally, and then recognizing the important information in them accordingly . After that, iteratively referring is performed between the context and the response , as well as between the knowledge and the response , in order to collect the deep and wide matching information . Experimental results show that the FIRE model outperforms previous methods by margins larger than 2.8\\% on original personas and 4.1\\% on revised personas on the PERSONA-CHAT dataset , as well as 3.1\\% on the CMU_DoG dataset in terms of top-1 accuracy .", "after_revision": "The challenges of building knowledge-grounded retrieval-based chatbots lie in how to ground a conversation on its background knowledge and how to match response candidates with both context and knowledge simultaneously . This paper proposes a method named Filtering before Iteratively REferring (FIRE) for this task. In this method, a context filter and a knowledge filter are first built, which derive knowledge-aware context representations and context-aware knowledge representations respectively by global and bidirectional attention. Besides, the entries irrelevant to the conversation are discarded by the knowledge filter . After that, iteratively referring is performed between context and response representations as well as between knowledge and response representations , in order to collect deep matching features for scoring response candidates . Experimental results show that FIRE outperforms previous methods by margins larger than 2.8\\% and 4.1\\% on the PERSONA-CHAT dataset with original and revised personas respectively, and margins larger than 3.1\\% on the CMU_DoG dataset in terms of top-1 accuracy . We also show that FIRE is more interpretable by visualizing the knowledge grounding process .", "edit_actions": [{"type": "R", "before": "the", "after": "its", "start_char_pos": 110, "end_char_pos": 113}, {"type": "R", "before": "perform their matching with the response", "after": "match response candidates with both context and knowledge simultaneously", "start_char_pos": 146, "end_char_pos": 186}, {"type": "R", "before": "presenting the background knowledge of dialogue agents in retrieval-based chatbots. We first propose a pre-filter, which is composed of", "after": "this task. In this method,", "start_char_pos": 274, "end_char_pos": 409}, {"type": "R", "before": ". This pre-filter grounds the conversation on the knowledge and comprehends the knowledge according", "after": "are first built, which derive knowledge-aware context representations and context-aware knowledge representations respectively by global and bidirectional attention. Besides, the entries irrelevant", "start_char_pos": 450, "end_char_pos": 549}, {"type": "R", "before": "by collecting the matching information between them bidirectionally, and then recognizing the important information in them accordingly", "after": "are discarded by the knowledge filter", "start_char_pos": 570, "end_char_pos": 705}, {"type": "R", "before": "the context and the response ,", "after": "context and response representations", "start_char_pos": 763, "end_char_pos": 793}, {"type": "R", "before": "the knowledge and the response", "after": "knowledge and response representations", "start_char_pos": 813, "end_char_pos": 843}, {"type": "R", "before": "the deep and wide matching information", "after": "deep matching features for scoring response candidates", "start_char_pos": 866, "end_char_pos": 904}, {"type": "R", "before": "the FIRE model", "after": "FIRE", "start_char_pos": 938, "end_char_pos": 952}, {"type": "D", "before": "on original personas", "after": null, "start_char_pos": 1011, "end_char_pos": 1031}, {"type": "D", "before": "revised personas on", "after": null, "start_char_pos": 1045, "end_char_pos": 1064}, {"type": "R", "before": ", as well as", "after": "with original and revised personas respectively, and margins larger than", "start_char_pos": 1090, "end_char_pos": 1102}, {"type": "A", "before": null, "after": ". We also show that FIRE is more interpretable by visualizing the knowledge grounding process", "start_char_pos": 1159, "end_char_pos": 1159}], "sents_char_pos": [0, 188, 357, 451, 707]} {"doc_id": "2004.14564", "revision_depth": "1", "before_revision": "We propose the use of a sequence-to-sequence paraphraser for automatic machine translation evaluation . The paraphrasertakes a human reference as input and then force-decodes and scores an MT system output . We propose training the aforementioned paraphraser as a multilingual NMT system, treating paraphrasing as a zero-shot \"language pair\" (e.g., Russian to Russian). We denote our paraphraser \"unbiased\" because the mode of our model 's output probability is centered around a copy of the input sequence, which in our case represent the best case scenario where the MT system output matches a human reference. Our method is simple and intuitive, and our single model (trained in 39 languages) outperforms or statistically ties with all prior metrics on the WMT19 segment-level shared metrics task in all languages , excluding Gujarati where the model had no training data . We also explore using our model conditioned on the source instead of the reference, and find that it outperforms every quality estimation as a metric system from the WMT19 shared task on quality estimation by a statistically significant margin in every language pair.", "after_revision": "We frame the task of machine translation evaluation as one of scoring machine translation output with a sequence-to-sequence paraphraser, conditioned on a human reference . We propose training the paraphraser as a multilingual NMT system, treating paraphrasing as a zero-shot translation task (e.g., Czech to Czech). This results in the paraphraser 's output mode being centered around a copy of the input sequence, which represents the best case scenario where the MT system output matches a human reference. Our method is simple and intuitive, and does not require human judgements for training. Our single model (trained in 39 languages) outperforms or statistically ties with all prior metrics on the WMT 2019 segment-level shared metrics task in all languages ( excluding Gujarati where the model had no training data ) . We also explore using our model for the task of quality estimation as a metric--conditioning on the source instead of the reference--and find that it significantly outperforms every submission to the WMT 2019 shared task on quality estimation in every language pair.", "edit_actions": [{"type": "R", "before": "propose the use of a sequence-to-sequence paraphraser for automatic", "after": "frame the task of", "start_char_pos": 3, "end_char_pos": 70}, {"type": "R", "before": ". The paraphrasertakes", "after": "as one of scoring machine translation output with a sequence-to-sequence paraphraser, conditioned on", "start_char_pos": 102, "end_char_pos": 124}, {"type": "D", "before": "as input and then force-decodes and scores an MT system output", "after": null, "start_char_pos": 143, "end_char_pos": 205}, {"type": "D", "before": "aforementioned", "after": null, "start_char_pos": 232, "end_char_pos": 246}, {"type": "R", "before": "\"language pair\"", "after": "translation task", "start_char_pos": 326, "end_char_pos": 341}, {"type": "R", "before": "Russian to Russian). We denote our paraphraser \"unbiased\" because the mode of our model", "after": "Czech to Czech). This results in the paraphraser", "start_char_pos": 349, "end_char_pos": 436}, {"type": "R", "before": "probability is", "after": "mode being", "start_char_pos": 447, "end_char_pos": 461}, {"type": "R", "before": "in our case represent", "after": "represents", "start_char_pos": 514, "end_char_pos": 535}, {"type": "R", "before": "our", "after": "does not require human judgements for training. Our", "start_char_pos": 653, "end_char_pos": 656}, {"type": "R", "before": "WMT19", "after": "WMT 2019", "start_char_pos": 760, "end_char_pos": 765}, {"type": "R", "before": ",", "after": "(", "start_char_pos": 817, "end_char_pos": 818}, {"type": "A", "before": null, "after": ")", "start_char_pos": 875, "end_char_pos": 875}, {"type": "R", "before": "conditioned", "after": "for the task of quality estimation as a metric--conditioning", "start_char_pos": 910, "end_char_pos": 921}, {"type": "R", "before": "reference, and", "after": "reference--and", "start_char_pos": 951, "end_char_pos": 965}, {"type": "R", "before": "outperforms every quality estimation as a metric system from the WMT19", "after": "significantly outperforms every submission to the WMT 2019", "start_char_pos": 979, "end_char_pos": 1049}, {"type": "D", "before": "by a statistically significant margin", "after": null, "start_char_pos": 1084, "end_char_pos": 1121}], "sents_char_pos": [0, 103, 207, 369, 612, 877]} {"doc_id": "2004.14623", "revision_depth": "1", "before_revision": "In adversarial (challenge) testing, we pose hard generalization tasks in order to gain insights into the solutions found by our models. What properties must a system have in order to succeed at these hard tasks? In this paper, we argue that an essential factor is the ability to form modular representations . Our central contribution is a definition of what it means for a representation to be modular and an experimental method for assessing the extent to which a system's solution is modular in this general sense . Our work is grounded empirically in a new challenge Natural Language Inference dataset designed to assess systems on their ability to reason about entailment and negation. We find that a BERT model with fine-tuning is strikingly successful at the hard generalization tasks we pose using this dataset, and our active manipulations help us to understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations.", "after_revision": "In adversarial testing, we pose hard generalization tasks in order to gain insights into the solutions found by our models. What properties must a system have in order to succeed at these hard behavioral tasks? We argue that an essential factor is modular internal structure . Our central contribution is a new experimental method called 'interchange interventions', in which systematic manipulations of model-internal states are related to causal effects on their outputs, thereby allowing us to identify modular structure . Our work is grounded empirically in a new challenge Natural Language Inference dataset designed to assess systems on their ability to reason about entailment and negation. We find that a BERT model is strikingly successful at the systematic generalization task we pose using this dataset, and our active manipulations of model-internal vectors help us understand why: despite the densely interconnected nature of the BERT architecture, the learned model embeds modular, general theories of lexical entailment relations.", "edit_actions": [{"type": "D", "before": "(challenge)", "after": null, "start_char_pos": 15, "end_char_pos": 26}, {"type": "R", "before": "tasks? In this paper, we", "after": "behavioral tasks? We", "start_char_pos": 205, "end_char_pos": 229}, {"type": "R", "before": "the ability to form modular representations", "after": "modular internal structure", "start_char_pos": 264, "end_char_pos": 307}, {"type": "R", "before": "definition of what it means for a representation to be modular and an experimental method for assessing the extent to which a system's solution is modular in this general sense", "after": "new experimental method called 'interchange interventions', in which systematic manipulations of model-internal states are related to causal effects on their outputs, thereby allowing us to identify modular structure", "start_char_pos": 340, "end_char_pos": 516}, {"type": "D", "before": "with fine-tuning", "after": null, "start_char_pos": 717, "end_char_pos": 733}, {"type": "R", "before": "hard generalization tasks", "after": "systematic generalization task", "start_char_pos": 766, "end_char_pos": 791}, {"type": "R", "before": "help us to", "after": "of model-internal vectors help us", "start_char_pos": 849, "end_char_pos": 859}], "sents_char_pos": [0, 135, 211, 309, 518, 690]} {"doc_id": "2004.15016", "revision_depth": "1", "before_revision": "In this paper, we present WiC-TSV (Target Sense Verification for Words in Context ) , a new multi-domain evaluation benchmark for Word Sense Disambiguation (WSD) and Entity Linking (EL). Our benchmark is different from conventional WSD and EL benchmarks for it being independent of a general sense inventory, making it highly flexible for the evaluation of a diverse set of models and systems in different domains. WiC-TSV is split into three tasks (systems get hypernymy or definitional or both hypernymy and definitional information about the target sense). Test data is available in four domains: general (WordNet), computer science, cocktails and medical concepts. Results show that existing state-of-the-art language models such as BERT can achieve a high performancein both in-domain data and out-of-domain data, but they still have room for improvement . WiC-TSV task data is available at URL/competitions/ 23683 .", "after_revision": "We present WiC-TSV , a new multi-domain evaluation benchmark for Target Sense Verification of Words in Context. The benchmark is a new framework for evaluating Word Sense Disambiguation and Entity Linking , which is different from conventional benchmarks for it covering various domains, while being independent of external sense inventories. This makes the dataset highly flexible for the evaluation of a diverse set of models and systems in and across domains. WiC-TSV provides three different evaluation settings, depending on the input signals provided to the model. We set baseline performance on the dataset using state-of-the-art language models. Experimental results show that even though these models can perform decently on the task, there remains a gap between machine and human performance, especially in out-of-domain settings . WiC-TSV data is available at URL/competitions/ 23683.", "edit_actions": [{"type": "R", "before": "In this paper, we", "after": "We", "start_char_pos": 0, "end_char_pos": 17}, {"type": "D", "before": "(", "after": null, "start_char_pos": 34, "end_char_pos": 35}, {"type": "D", "before": "Target Sense Verification for Words in Context", "after": null, "start_char_pos": 35, "end_char_pos": 81}, {"type": "D", "before": ")", "after": null, "start_char_pos": 82, "end_char_pos": 83}, {"type": "A", "before": null, "after": "Target Sense Verification of Words in Context. The benchmark is a new framework for evaluating", "start_char_pos": 130, "end_char_pos": 130}, {"type": "D", "before": "(WSD)", "after": null, "start_char_pos": 157, "end_char_pos": 162}, {"type": "R", "before": "(EL). Our benchmark", "after": ", which", "start_char_pos": 182, "end_char_pos": 201}, {"type": "D", "before": "WSD and EL", "after": null, "start_char_pos": 233, "end_char_pos": 243}, {"type": "A", "before": null, "after": "covering various domains, while", "start_char_pos": 262, "end_char_pos": 262}, {"type": "R", "before": "a general sense inventory, making it", "after": "external sense inventories. This makes the dataset", "start_char_pos": 284, "end_char_pos": 320}, {"type": "R", "before": "different", "after": "and across", "start_char_pos": 398, "end_char_pos": 407}, {"type": "R", "before": "is split into three tasks (systems get hypernymy or definitional or both hypernymy and definitional information about the target sense). Test data is available in four domains: general (WordNet), computer science, cocktails and medical concepts. Results show that existing", "after": "provides three different evaluation settings, depending on the input signals provided to the model. We set baseline performance on the dataset using", "start_char_pos": 425, "end_char_pos": 697}, {"type": "R", "before": "language models such as BERT can achieve a high performancein both in-domain data and", "after": "language models. Experimental results show that even though these models can perform decently on the task, there remains a gap between machine and human performance, especially in", "start_char_pos": 715, "end_char_pos": 800}, {"type": "R", "before": "data, but they still have room for improvement", "after": "settings", "start_char_pos": 815, "end_char_pos": 861}, {"type": "D", "before": "task", "after": null, "start_char_pos": 872, "end_char_pos": 876}, {"type": "D", "before": "23683", "after": null, "start_char_pos": 916, "end_char_pos": 921}, {"type": "R", "before": ".", "after": "23683.", "start_char_pos": 922, "end_char_pos": 923}], "sents_char_pos": [0, 187, 416, 561, 670, 863]} {"doc_id": "2005.00192", "revision_depth": "1", "before_revision": "For the automatic evaluation of Generative Question Answering (genQA ) systems, it is essential to assess the correctness of the generated answers . However, n-gram similarity metrics, which are widely used to compare generated texts and references, are prone to misjudge fact-based assessments . Moreover, there is a lack of benchmark datasets to measure the quality of metrics in terms of the correctness. To study a better metric for genQA, we collect high-quality human judgments of correctness on two standard genQA datasets. Using our human-evaluation datasets, we show that existing metrics based on n-gram similarity do not correlate with human judgments. To alleviate this problem, we propose a new metric for evaluating the correctness of genQA . Specifically, the new metric assigns different weights on each token via keyphrase prediction, thereby judging whether a predicted answer sentence captures the key meaning of the human judge's ground-truth . Our proposed metric shows a significantly higher correlation with human judgment than widely used existing metrics .", "after_revision": "In the automatic evaluation of generative question answering (GenQA ) systems, it is difficult to assess the correctness of generated answers due to the free-form of the answer . Moreover, there is a lack of benchmark datasets to evaluate the suitability of existing metrics in terms of correctness. To study a better metric for GenQA, we first create high-quality human judgments of correctness on two standard GenQA datasets. Using our human-evaluation datasets, we show that widely used n-gram similarity metrics do not correlate with human judgments. To alleviate this problem, we propose a new metric for evaluating the correctness of GenQA . Specifically, our new metric assigns different weights to each token via keyphrase prediction, thereby judging whether a generated answer sentence captures the key meaning of the reference answer . Our proposed metric shows a significantly higher correlation with human judgments than existing metrics in various datasets .", "edit_actions": [{"type": "R", "before": "For", "after": "In", "start_char_pos": 0, "end_char_pos": 3}, {"type": "R", "before": "Generative Question Answering (genQA", "after": "generative question answering (GenQA", "start_char_pos": 32, "end_char_pos": 68}, {"type": "R", "before": "essential", "after": "difficult", "start_char_pos": 86, "end_char_pos": 95}, {"type": "R", "before": "the generated answers . However, n-gram similarity metrics, which are widely used to compare generated texts and references, are prone to misjudge fact-based assessments", "after": "generated answers due to the free-form of the answer", "start_char_pos": 125, "end_char_pos": 294}, {"type": "R", "before": "measure the quality of", "after": "evaluate the suitability of existing", "start_char_pos": 348, "end_char_pos": 370}, {"type": "D", "before": "the", "after": null, "start_char_pos": 391, "end_char_pos": 394}, {"type": "R", "before": "genQA, we collect", "after": "GenQA, we first create", "start_char_pos": 437, "end_char_pos": 454}, {"type": "R", "before": "genQA", "after": "GenQA", "start_char_pos": 515, "end_char_pos": 520}, {"type": "R", "before": "existing metrics based on", "after": "widely used", "start_char_pos": 581, "end_char_pos": 606}, {"type": "A", "before": null, "after": "metrics", "start_char_pos": 625, "end_char_pos": 625}, {"type": "R", "before": "genQA", "after": "GenQA", "start_char_pos": 750, "end_char_pos": 755}, {"type": "R", "before": "the", "after": "our", "start_char_pos": 772, "end_char_pos": 775}, {"type": "R", "before": "on", "after": "to", "start_char_pos": 813, "end_char_pos": 815}, {"type": "R", "before": "predicted", "after": "generated", "start_char_pos": 879, "end_char_pos": 888}, {"type": "R", "before": "human judge's ground-truth", "after": "reference answer", "start_char_pos": 937, "end_char_pos": 963}, {"type": "R", "before": "judgment than widely used existing metrics", "after": "judgments than existing metrics in various datasets", "start_char_pos": 1038, "end_char_pos": 1080}], "sents_char_pos": [0, 148, 296, 407, 530, 664, 965]} {"doc_id": "2005.00619", "revision_depth": "1", "before_revision": "Vision, as a central component of human perception, plays a fundamental role in shaping natural language . To better understand how text models are connected to our visual perceptions , we propose a method for examining the similarities between neural representations extracted from words in text and objects in images . Our approach uses a lightweight probing model that learns to map language representations of concrete words to the visual domain . We find that representations from models trained on purely textual data, such as BERT, can be nontrivially mapped to those of a vision model. Such mappings generalize to object categories that were never seen by the probe during training, unlike mappings learned from permuted or random representations . Moreover, we find that the context surrounding objects in sentences greatly impacts performance. Finally, we show that humans significantly outperform all examined models , suggesting considerable room for improvement in representation learning and grounding .", "after_revision": "While large-scale language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. In this work , we propose a method for characterizing how language representations of concrete nouns relate to the physical appearance of the objects they refer to . Our approach uses a probing model that examines how useful language representations are in discerning between different visual representations. We show evidence of a surprising common ground with the visual domain , finding representations of many language models to be useful in retrieving semantically aligned image patches. In control experiments where language and visual representations are intentionally mismatched, we observe much weaker results. Furthermore, we examine the impact of textual context in our experiments, finding, for instance, that nouns accompanied by adjectives lead to more accurate retrieval . Finally, we show that the examined models substantially under-perform humans in retrieval. Altogether, our findings shed new empirical insights on language grounding, suggesting that some physical properties are being captured by trained language models, and highlighting large room for future progress .", "edit_actions": [{"type": "R", "before": "Vision, as a central component of human perception, plays a fundamental role in shaping natural language . To better understand how text models are connected to our visual perceptions", "after": "While large-scale language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. In this work", "start_char_pos": 0, "end_char_pos": 183}, {"type": "R", "before": "examining the similarities between neural representations extracted from words in text and objects in images", "after": "characterizing how language representations of concrete nouns relate to the physical appearance of the objects they refer to", "start_char_pos": 210, "end_char_pos": 318}, {"type": "D", "before": "lightweight", "after": null, "start_char_pos": 341, "end_char_pos": 352}, {"type": "R", "before": "learns to map language representations of concrete words to", "after": "examines how useful language representations are in discerning between different visual representations. We show evidence of a surprising common ground with", "start_char_pos": 372, "end_char_pos": 431}, {"type": "R", "before": ". We find that representations from models trained on purely textual data, such as BERT, can be nontrivially mapped to those of a vision model. Such mappings generalize to object categories that were never seen by the probe during training, unlike mappings learned from permuted or random representations", "after": ", finding representations of many language models to be useful in retrieving semantically aligned image patches. In control experiments where language and visual representations are intentionally mismatched, we observe much weaker results. Furthermore, we examine the impact of textual context in our experiments, finding, for instance, that nouns accompanied by adjectives lead to more accurate retrieval", "start_char_pos": 450, "end_char_pos": 754}, {"type": "D", "before": "Moreover, we find that the context surrounding objects in sentences greatly impacts performance.", "after": null, "start_char_pos": 757, "end_char_pos": 853}, {"type": "R", "before": "humans significantly outperform all examined models , suggesting considerable room for improvement in representation learning and grounding", "after": "the examined models substantially under-perform humans in retrieval. Altogether, our findings shed new empirical insights on language grounding, suggesting that some physical properties are being captured by trained language models, and highlighting large room for future progress", "start_char_pos": 876, "end_char_pos": 1015}], "sents_char_pos": [0, 106, 320, 451, 593, 756, 853]} {"doc_id": "2005.00619", "revision_depth": "2", "before_revision": "While large-scale language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. In this work, we propose a method for characterizing how language representations of concrete nouns relate to the physical appearance of the objects they refer to. Our approach uses a probing model that examines how useful language representations are in discerning between different visual representations. We show evidence of a surprising common ground with the visual domain, finding representations of many language models to be useful in retrieving semantically aligned image patches . In control experiments where language and visual representations are intentionally mismatched, we observe much weaker results. Furthermore, we examine the impact of textual context in our experiments, finding, for instance, that nouns accompanied by adjectives lead to more accurate retrieval. Finally, we show that the examined models substantially under-perform humans in retrieval . Altogether, our findings shed new empirical insights on language grounding , suggesting that some physical properties are being captured by trained language models, and highlighting large room for future progress .", "after_revision": "While large-scale contextual language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. In this work, we characterize how contextual representations of concrete nouns extracted by trained language models relate to the physical properties of the objects they refer to. Our approach uses a probing model that examines how effective these language representations are in discerning between different visual representations. We show that many recent language models yield representations that are useful in retrieving semantically aligned image patches , and explore the role of context in this process. Much weaker results are found in control experiments, attesting the selectivity of the probe. All examined models greatly under-perform humans in retrieval , highlighting substantial room for future progress . Altogether, our findings shed new empirical insights on language grounding and its materialization in contextual language models .", "edit_actions": [{"type": "A", "before": null, "after": "contextual", "start_char_pos": 18, "end_char_pos": 18}, {"type": "R", "before": "propose a method for characterizing how language", "after": "characterize how contextual", "start_char_pos": 167, "end_char_pos": 215}, {"type": "A", "before": null, "after": "extracted by trained language models", "start_char_pos": 250, "end_char_pos": 250}, {"type": "R", "before": "appearance", "after": "properties", "start_char_pos": 274, "end_char_pos": 284}, {"type": "R", "before": "useful", "after": "effective these", "start_char_pos": 367, "end_char_pos": 373}, {"type": "R", "before": "evidence of a surprising common ground with the visual domain, finding representations of many language models to be", "after": "that many recent language models yield representations that are", "start_char_pos": 467, "end_char_pos": 583}, {"type": "R", "before": ". In control experiments where language and visual representations are intentionally mismatched, we observe much weaker results. Furthermore, we examine the impact of textual context in our experiments, finding, for instance, that nouns accompanied by adjectives lead to more accurate retrieval. Finally, we show that the examined models substantially", "after": ", and explore the role of context in this process. Much weaker results are found in control experiments, attesting the selectivity of the probe. All examined models greatly", "start_char_pos": 640, "end_char_pos": 991}, {"type": "A", "before": null, "after": ", highlighting substantial room for future progress", "start_char_pos": 1026, "end_char_pos": 1026}, {"type": "R", "before": ", suggesting that some physical properties are being captured by trained language models, and highlighting large room for future progress", "after": "and its materialization in contextual language models", "start_char_pos": 1104, "end_char_pos": 1241}], "sents_char_pos": [0, 149, 314, 458, 641, 768, 935, 1028]} {"doc_id": "2005.00619", "revision_depth": "3", "before_revision": "While large-scale contextual language models have enjoyed great success recently, much remains to be understood about what is encoded in their representations. In this work, we characterize how contextual representations of concrete nouns extracted by trained language models relate to the physical properties of the objects they refer to. Our approach uses a probing model that examines how effective these language representations are in discerning between different visual representations. We show that many recent language models yield representations that are useful in retrieving semantically aligned image patches , and explore the role of context in this process. Much weaker results are found in control experiments, attesting the selectivity of the probe. All examined models greatly under-perform humans in retrieval, highlighting substantial room for future progress. Altogether, our findings shed new empirical insights on language grounding and its materialization in contextual language models.", "after_revision": "The success of large-scale contextual language models has attracted great interest in probing what is encoded in their representations. In this work, we consider a new question: to what extent contextual representations of concrete nouns are aligned with corresponding visual representations? We design a probing model that evaluates how effective are text-only representations in distinguishing between matching and non-matching visual representations. Our findings show that language representations alone provide a strong signal for retrieving image patches from the correct object categories. Moreover, they are effective in retrieving specific instances of image patches; textual context plays an important role in this process. Visually grounded language models slightly outperform text-only language models in instance retrieval, but greatly under-perform humans . We hope our analyses inspire future research in understanding and improving the visual capabilities of language models.", "edit_actions": [{"type": "R", "before": "While", "after": "The success of", "start_char_pos": 0, "end_char_pos": 5}, {"type": "R", "before": "have enjoyed great success recently, much remains to be understood about", "after": "has attracted great interest in probing", "start_char_pos": 45, "end_char_pos": 117}, {"type": "R", "before": "characterize how", "after": "consider a new question: to what extent", "start_char_pos": 177, "end_char_pos": 193}, {"type": "R", "before": "extracted by trained language models relate to the physical properties of the objects they refer to. Our approach uses", "after": "are aligned with corresponding visual representations? We design", "start_char_pos": 239, "end_char_pos": 357}, {"type": "R", "before": "examines how effective these language representations are in discerning between different", "after": "evaluates how effective are text-only representations in distinguishing between matching and non-matching", "start_char_pos": 379, "end_char_pos": 468}, {"type": "R", "before": "We show that many recent language models yield representations that are useful in retrieving semantically aligned image patches , and explore the role of context", "after": "Our findings show that language representations alone provide a strong signal for retrieving image patches from the correct object categories. Moreover, they are effective in retrieving specific instances of image patches; textual context plays an important role", "start_char_pos": 493, "end_char_pos": 654}, {"type": "R", "before": "Much weaker results are found in control experiments, attesting the selectivity of the probe. All examined models", "after": "Visually grounded language models slightly outperform text-only language models in instance retrieval, but", "start_char_pos": 672, "end_char_pos": 785}, {"type": "R", "before": "in retrieval, highlighting substantial room for future progress. Altogether, our findings shed new empirical insights on language grounding and its materialization in contextual", "after": ". We hope our analyses inspire future research in understanding and improving the visual capabilities of", "start_char_pos": 815, "end_char_pos": 992}], "sents_char_pos": [0, 159, 339, 492, 671, 765, 879]} {"doc_id": "2005.00882", "revision_depth": "1", "before_revision": "Most studies on abstractive summarization re-port ROUGE scores between system and ref-erence summaries. However, we have a con-cern about thetruthfulnessof generated sum-maries : whether all facts of a generated sum-mary are mentioned in the source text. Thispaper explores improving the truthfulness inheadline generation on two popular datasets. Analyzing headlines generated by the state-of-the-art encoder-decoder model, we showthat the model sometimes generates untruthfulheadlines . We conjecture that one of the rea-sons lies in untruthful supervision data usedfor training the model. In order to quantifythe truthfulness of article-headline pairs, weconsider the textual entailment of whether anarticle entails its headline. After confirmingquite a few untruthful instances in the datasets, this study hypothesizes that removing untruth-ful instances from the supervision data mayremedy the problem of the untruthful behav-iors of the model. Building a binary classifierthat predicts an entailment relation between anarticle and its headline, we filter out untruth-ful instances from the supervision data. Exper-imental results demonstrate that the headlinegeneration model trained on filtered supervi-sion data shows no clear difference in ROUGEscores but remarkable improvements in auto-matic and manual evaluations of the generatedheadlines .", "after_revision": "Most studies on abstractive summarization report ROUGE scores between system and reference summaries. However, we have a concern about the truthfulness of generated summaries : whether all facts of a generated summary are mentioned in the source text. This paper explores improving the truthfulness in headline generation on two popular datasets. Analyzing headlines generated by the state-of-the-art encoder-decoder model, we show that the model sometimes generates untruthful headlines . We conjecture that one of the reasons lies in untruthful supervision data used for training the model. In order to quantify the truthfulness of article-headline pairs, we consider the textual entailment of whether an article entails its headline. After confirming quite a few untruthful instances in the datasets, this study hypothesizes that removing untruthful instances from the supervision data may remedy the problem of the untruthful behaviors of the model. Building a binary classifier that predicts an entailment relation between an article and its headline, we filter out untruthful instances from the supervision data. Experimental results demonstrate that the headline generation model trained on filtered supervision data shows no clear difference in ROUGE scores but remarkable improvements in automatic and manual evaluations of the generated headlines .", "edit_actions": [{"type": "R", "before": "re-port", "after": "report", "start_char_pos": 42, "end_char_pos": 49}, {"type": "R", "before": "ref-erence", "after": "reference", "start_char_pos": 82, "end_char_pos": 92}, {"type": "R", "before": "con-cern about thetruthfulnessof generated sum-maries", "after": "concern about the truthfulness of generated summaries", "start_char_pos": 123, "end_char_pos": 176}, {"type": "R", "before": "sum-mary", "after": "summary", "start_char_pos": 212, "end_char_pos": 220}, {"type": "R", "before": "Thispaper", "after": "This paper", "start_char_pos": 255, "end_char_pos": 264}, {"type": "R", "before": "inheadline", "after": "in headline", "start_char_pos": 301, "end_char_pos": 311}, {"type": "R", "before": "showthat", "after": "show that", "start_char_pos": 428, "end_char_pos": 436}, {"type": "R", "before": "untruthfulheadlines", "after": "untruthful headlines", "start_char_pos": 467, "end_char_pos": 486}, {"type": "R", "before": "rea-sons", "after": "reasons", "start_char_pos": 519, "end_char_pos": 527}, {"type": "R", "before": "usedfor", "after": "used for", "start_char_pos": 564, "end_char_pos": 571}, {"type": "R", "before": "quantifythe", "after": "quantify the", "start_char_pos": 604, "end_char_pos": 615}, {"type": "R", "before": "weconsider", "after": "we consider", "start_char_pos": 656, "end_char_pos": 666}, {"type": "R", "before": "anarticle", "after": "an article", "start_char_pos": 701, "end_char_pos": 710}, {"type": "R", "before": "confirmingquite", "after": "confirming quite", "start_char_pos": 739, "end_char_pos": 754}, {"type": "R", "before": "untruth-ful", "after": "untruthful", "start_char_pos": 837, "end_char_pos": 848}, {"type": "R", "before": "mayremedy", "after": "may remedy", "start_char_pos": 885, "end_char_pos": 894}, {"type": "R", "before": "behav-iors", "after": "behaviors", "start_char_pos": 925, "end_char_pos": 935}, {"type": "R", "before": "classifierthat", "after": "classifier that", "start_char_pos": 968, "end_char_pos": 982}, {"type": "R", "before": "anarticle", "after": "an article", "start_char_pos": 1023, "end_char_pos": 1032}, {"type": "R", "before": "untruth-ful", "after": "untruthful", "start_char_pos": 1065, "end_char_pos": 1076}, {"type": "R", "before": "Exper-imental", "after": "Experimental", "start_char_pos": 1114, "end_char_pos": 1127}, {"type": "R", "before": "headlinegeneration", "after": "headline generation", "start_char_pos": 1157, "end_char_pos": 1175}, {"type": "R", "before": "supervi-sion", "after": "supervision", "start_char_pos": 1202, "end_char_pos": 1214}, {"type": "R", "before": "ROUGEscores", "after": "ROUGE scores", "start_char_pos": 1249, "end_char_pos": 1260}, {"type": "R", "before": "auto-matic", "after": "automatic", "start_char_pos": 1292, "end_char_pos": 1302}, {"type": "R", "before": "generatedheadlines", "after": "generated headlines", "start_char_pos": 1333, "end_char_pos": 1351}], "sents_char_pos": [0, 103, 254, 347, 488, 591, 732, 949, 1113]} {"doc_id": "2005.02950", "revision_depth": "1", "before_revision": "We analyze dependence, tail behavior and multimodality of the conditional distribution of a loss random vector given that the aggregate loss equals an exogenously provided capital. This conditional distribution is a building block for calculating risk allocations such as the Euler capital allocation of Value-at-Risk. A level set of this conditional distribution can be interpreted as a set of severe and plausible stress scenarios the given capital is supposed to cover. We show that various distributional properties of this conditional distribution are inherited from those of the underlying joint loss distribution. Among these properties, we find that multimodality of the conditional distribution is an important feature related to the number of risky scenarios likely to occur in a stressed situation. Moreover, Euler allocation becomes less sound under multimodality than under unimodality. To overcome this issue, we propose a novel risk allocation called the maximum likelihood allocation (MLA), defined as the mode of the conditional distribution given the total capital. The process of estimating MLA turns out to be beneficial for detecting multimodality, evaluating the soundness of risk allocations , and constructing more flexible risk allocations based on multiple risky scenarios . Properties of the conditional distribution and MLA are demonstrated in numerical experiments. In particular, we observe that negative dependence among losses typically leads to multimodality, and thus to multiple risky scenarios and less sound risk allocations .", "after_revision": "We study the variability of a risk from the statistical viewpoint of multimodality of the conditional loss distribution given that the aggregate loss equals an exogenously provided capital. This conditional distribution serves as a building block for calculating risk allocations such as the Euler capital allocation of Value-at-Risk. A superlevel set of this conditional distribution can be interpreted as a set of severe and plausible stress scenarios the given capital is supposed to cover. We show that various distributional properties of this conditional distribution , such as modality, dependence and tail behavior, are inherited from those of the underlying joint loss distribution. Among these properties, we find that modality of the conditional distribution is an important feature in risk assessment related to the variety of risky scenarios likely to occur in a stressed situation. Under unimodality, we introduce a novel risk allocation method called maximum likelihood allocation (MLA), defined as the mode of the conditional distribution given the total capital. Under multimodality, a single vector of allocations can be less sound. To overcome this issue, we investigate the so-called multimodalty adjustment to increase the soundness of risk allocations . Properties of the conditional distribution , MLA and multimodality adjustment are demonstrated in numerical experiments. In particular, we observe that negative dependence among losses typically leads to multimodality, and thus a higher multimodality adjustment can be required .", "edit_actions": [{"type": "R", "before": "analyze dependence, tail behavior and", "after": "study the variability of a risk from the statistical viewpoint of", "start_char_pos": 3, "end_char_pos": 40}, {"type": "R", "before": "distribution of a loss random vector", "after": "loss distribution", "start_char_pos": 74, "end_char_pos": 110}, {"type": "R", "before": "is", "after": "serves as", "start_char_pos": 211, "end_char_pos": 213}, {"type": "R", "before": "level", "after": "superlevel", "start_char_pos": 321, "end_char_pos": 326}, {"type": "A", "before": null, "after": ", such as modality, dependence and tail behavior,", "start_char_pos": 553, "end_char_pos": 553}, {"type": "R", "before": "multimodality", "after": "modality", "start_char_pos": 659, "end_char_pos": 672}, {"type": "A", "before": null, "after": "in risk assessment", "start_char_pos": 729, "end_char_pos": 729}, {"type": "R", "before": "number", "after": "variety", "start_char_pos": 745, "end_char_pos": 751}, {"type": "R", "before": "Moreover, Euler allocation becomes less sound under multimodality than under unimodality. To overcome this issue, we propose", "after": "Under unimodality, we introduce", "start_char_pos": 812, "end_char_pos": 936}, {"type": "R", "before": "called the", "after": "method called", "start_char_pos": 961, "end_char_pos": 971}, {"type": "R", "before": "The process of estimating MLA turns out to be beneficial for detecting multimodality, evaluating the", "after": "Under multimodality, a single vector of allocations can be less sound. To overcome this issue, we investigate the so-called multimodalty adjustment to increase the", "start_char_pos": 1086, "end_char_pos": 1186}, {"type": "D", "before": ", and constructing more flexible risk allocations based on multiple risky scenarios", "after": null, "start_char_pos": 1217, "end_char_pos": 1300}, {"type": "R", "before": "and MLA", "after": ", MLA and multimodality adjustment", "start_char_pos": 1346, "end_char_pos": 1353}, {"type": "R", "before": "to multiple risky scenarios and less sound risk allocations", "after": "a higher multimodality adjustment can be required", "start_char_pos": 1504, "end_char_pos": 1563}], "sents_char_pos": [0, 180, 318, 472, 621, 811, 901, 1085, 1396]} {"doc_id": "2005.03496", "revision_depth": "1", "before_revision": "In this paper , we propose a new procedure to build a structural-factor model for a vector unit-root time series . For a p-dimensional unit-root process , we assume that each component consists of a set of common factors, which may be unit-root non-stationary, and a set of stationary components, which contain the cointegrations among the unit-root processes. To further reduce the dimensionality, we also postulate that the stationary part of the series is a nonsingular linear transformation of certain common factors and idiosyncratic white noise components as in Gao and Tsay (2019a, b) . The estimation of linear loading spaces of the unit-root factors and the stationary components is achieved by an eigenanalysis of some nonnegative definite matrix , and the separation between the stationary factors and the white noises is based on an eigenanalysis and a projected principal component analysis . Asymptotic properties of the proposed method are established for both fixed p and diverging p as the sample size n tends to infinity. Both simulated and real examples are used to demonstrate the performance of the proposed method in finite samples .", "after_revision": "This paper proposes a new procedure to build factor models for high-dimensional unit-root time series by postulating that a p-dimensional unit-root process is a nonsingular linear transformation of a set of unit-root processes, a set of stationary common factors, which are dynamically dependent, and some idiosyncratic white noise components. For the stationary components, we assume that the factor process captures the temporal-dependence and the idiosyncratic white noise series explains, jointly with the factors, the cross-sectional dependence . The estimation of nonsingular linear loading spaces is carried out in two steps. First, we use an eigenanalysis of a nonnegative definite matrix of the data to separate the unit-root processes from the stationary ones and a modified method to specify the number of unit roots. We then employ another eigenanalysis and a projected principal component analysis to identify the stationary common factors and the white noise series. We propose a new procedure to specify the number of white noise series and, hence, the number of stationary common factors, establish asymptotic properties of the proposed method for both fixed and diverging p as the sample size n increases, and use simulation and a real example to demonstrate the performance of the proposed method in finite samples . We also compare our method with some commonly used ones in the literature regarding the forecast ability of the extracted factors and find that the proposed method performs well in out-of-sample forecasting of a 508-dimensional PM_{2.5 .", "edit_actions": [{"type": "R", "before": "In this paper , we propose", "after": "This paper proposes", "start_char_pos": 0, "end_char_pos": 26}, {"type": "R", "before": "a structural-factor model for a vector", "after": "factor models for high-dimensional", "start_char_pos": 52, "end_char_pos": 90}, {"type": "R", "before": ". For", "after": "by postulating that", "start_char_pos": 113, "end_char_pos": 118}, {"type": "R", "before": ", we assume that each component consists", "after": "is a nonsingular linear transformation", "start_char_pos": 153, "end_char_pos": 193}, {"type": "D", "before": "common factors, which may be", "after": null, "start_char_pos": 206, "end_char_pos": 234}, {"type": "R", "before": "non-stationary, and", "after": "processes,", "start_char_pos": 245, "end_char_pos": 264}, {"type": "R", "before": "components, which contain the cointegrations among the unit-root processes. To further reduce the dimensionality, we also postulate that the stationary part of the series is a nonsingular linear transformation of certain common factors and", "after": "common factors, which are dynamically dependent, and some idiosyncratic white noise components. For the stationary components, we assume that the factor process captures the temporal-dependence and the", "start_char_pos": 285, "end_char_pos": 524}, {"type": "R", "before": "components as in Gao and Tsay (2019a, b)", "after": "series explains, jointly with the factors, the cross-sectional dependence", "start_char_pos": 551, "end_char_pos": 591}, {"type": "A", "before": null, "after": "nonsingular", "start_char_pos": 612, "end_char_pos": 612}, {"type": "R", "before": "of the unit-root factors and the stationary components is achieved by", "after": "is carried out in two steps. First, we use", "start_char_pos": 635, "end_char_pos": 704}, {"type": "R", "before": "some", "after": "a", "start_char_pos": 725, "end_char_pos": 729}, {"type": "R", "before": ", and the separation between the stationary factors and the white noises is based on an", "after": "of the data to separate the unit-root processes from the stationary ones and a modified method to specify the number of unit roots. We then employ another", "start_char_pos": 758, "end_char_pos": 845}, {"type": "R", "before": ". Asymptotic", "after": "to identify the stationary common factors and the white noise series. We propose a new procedure to specify the number of white noise series and, hence, the number of stationary common factors, establish asymptotic", "start_char_pos": 905, "end_char_pos": 917}, {"type": "D", "before": "are established", "after": null, "start_char_pos": 952, "end_char_pos": 967}, {"type": "D", "before": "p", "after": null, "start_char_pos": 983, "end_char_pos": 984}, {"type": "R", "before": "tends to infinity. Both simulated and real examples are used", "after": "increases, and use simulation and a real example", "start_char_pos": 1022, "end_char_pos": 1082}, {"type": "A", "before": null, "after": ". We also compare our method with some commonly used ones in the literature regarding the forecast ability of the extracted factors and find that the proposed method performs well in out-of-sample forecasting of a 508-dimensional PM_{2.5", "start_char_pos": 1155, "end_char_pos": 1155}], "sents_char_pos": [0, 114, 360, 591, 1040]} {"doc_id": "2005.03554", "revision_depth": "1", "before_revision": "We analyze recently proposed mortgage contracts which aim to eliminate selective borrower default when the loan balance exceeds the house price (the \"underwater\" effect). We show that contracts which automatically reduce the outstanding balance in the event of local house price decline remove the default incentive, but may induce prepayment in low price states. However, low state prepayments vanish if borrower utility from home ownership , or outside options such as rental costs, are too high. We also show that capital gain sharing features, through prepayment penalties in high house price states, are ineffective , as they virtually eliminate prepayment in such states. For typical foreclosure costs, we find that contracts with automatic balance adjustments become preferable to the traditional fixed rate mortgage at contract rate spreads of approximately 50-100 basis points , depending on how far prices must fall before adjustments are made. Furthermore, these spreads rapidly decrease with the borrower utility from home ownership. Our results are obtained using American options pricing methods , in a model with diffusive home prices , and either diffusive or constant interest rates. We determine the contract, default and prepayment option values with optimal decision rules . We provide explicit solutions in the perpetual case with constant interest rates; and numerically compute the prepayment and default boundaries in the general case .", "after_revision": "We analyze recently proposed mortgage contracts which aim to eliminate selective borrower default when the loan balance exceeds the house price (the \"underwater\" effect). We show that contracts which automatically reduce the outstanding balance in the event of house price decline remove the default incentive, but may induce prepayment in low price states. However, low state prepayments vanish if the benefit from home ownership is sufficiently high. We also show that capital gain sharing features, such as prepayment penalties in high house price states, are ineffective as they virtually eliminate prepayment . For observed foreclosure costs, we find that contracts with automatic balance adjustments become preferable to the traditional fixed rate contracts at mortgage rate spreads between 50-100 basis points . Results are obtained using American options pricing method , in a continuous time model with diffusive home prices . Here, we associate the contracts' values and optimal decision rules with free boundary problems . We provide explicit solutions in the long contract maturity limit .", "edit_actions": [{"type": "D", "before": "local", "after": null, "start_char_pos": 261, "end_char_pos": 266}, {"type": "R", "before": "borrower utility", "after": "the benefit", "start_char_pos": 405, "end_char_pos": 421}, {"type": "R", "before": ", or outside options such as rental costs, are too", "after": "is sufficiently", "start_char_pos": 442, "end_char_pos": 492}, {"type": "R", "before": "through", "after": "such as", "start_char_pos": 548, "end_char_pos": 555}, {"type": "D", "before": ",", "after": null, "start_char_pos": 621, "end_char_pos": 622}, {"type": "R", "before": "in such states. For typical", "after": ". For observed", "start_char_pos": 662, "end_char_pos": 689}, {"type": "R", "before": "mortgage at contract rate spreads of approximately", "after": "contracts at mortgage rate spreads between", "start_char_pos": 815, "end_char_pos": 865}, {"type": "R", "before": ", depending on how far prices must fall before adjustments are made. Furthermore, these spreads rapidly decrease with the borrower utility from home ownership. Our results", "after": ". Results", "start_char_pos": 886, "end_char_pos": 1057}, {"type": "R", "before": "methods", "after": "method", "start_char_pos": 1102, "end_char_pos": 1109}, {"type": "A", "before": null, "after": "continuous time", "start_char_pos": 1117, "end_char_pos": 1117}, {"type": "R", "before": ", and either diffusive or constant interest rates. We determine the contract, default and prepayment option values with", "after": ". Here, we associate the contracts' values and", "start_char_pos": 1151, "end_char_pos": 1270}, {"type": "A", "before": null, "after": "with free boundary problems", "start_char_pos": 1294, "end_char_pos": 1294}, {"type": "R", "before": "perpetual case with constant interest rates; and numerically compute the prepayment and default boundaries in the general case", "after": "long contract maturity limit", "start_char_pos": 1334, "end_char_pos": 1460}], "sents_char_pos": [0, 170, 363, 498, 677, 954, 1045, 1201, 1296, 1378]} {"doc_id": "2005.03954", "revision_depth": "2", "before_revision": "We focus on the study of conversational recommendation in the context of multi-type dialogs, where the bots can proactively and naturally lead a conversation from a non-recommendation dialog (e.g., QA) to a recommendation dialog, taking into account user's interests and feedback. To facilitate the study of this task, we create a human-to-human Chinese dialog dataset DuRecDial (about 10k dialogs, 156k utterances), which contains multiple sequential dialogs for every pair of a recommendation seeker (user) and a recommender (bot). In each dialog, the recommender proactively leads a multi-type dialog to approach recommendation targets and then makes multiple recommendations with rich interaction behavior. This dataset allows us to systematically investigate different parts of the overall problem, e.g., how to naturally lead a dialog, how to interact with users for recommendation. Finally we establish baseline results on DuRecDial for future studies. Dataset and codes are publicly available at URL", "after_revision": "We propose a new task of conversational recommendation over multi-type dialogs, where the bots can proactively and naturally lead a conversation from a non-recommendation dialog (e.g., QA) to a recommendation dialog, taking into account user's interests and feedback. To facilitate the study of this task, we create a human-to-human Chinese dialog dataset DuRecDial (about 10k dialogs, 156k utterances), which contains multiple sequential dialogs for every pair of a recommendation seeker (user) and a recommender (bot). In each dialog, the recommender proactively leads a multi-type dialog to approach recommendation targets and then makes multiple recommendations with rich interaction behavior. This dataset allows us to systematically investigate different parts of the overall problem, e.g., how to naturally lead a dialog, how to interact with users for recommendation. Finally we establish baseline results on DuRecDial for future studies. Dataset and codes are publicly available at URL", "edit_actions": [{"type": "R", "before": "focus on the study", "after": "propose a new task", "start_char_pos": 3, "end_char_pos": 21}, {"type": "R", "before": "in the context of", "after": "over", "start_char_pos": 55, "end_char_pos": 72}, {"type": "R", "before": "DuRecDial", "after": "DuRecDial", "start_char_pos": 369, "end_char_pos": 378}], "sents_char_pos": [0, 280, 533, 710, 888, 959]} {"doc_id": "2005.03969", "revision_depth": "2", "before_revision": "The outbreak of the novel coronavirus (COVID-19) is considered an exogenous risk, which has caused unprecedented disruptions to financial and economic markets around the globe, leading to one of the fastest U.S. stock market declines in history. However, in the pastwe have seen the market recover and we can expect the market to recover again, and on this basis we assume the Standard and Poor's 500 (S P500) index will reach a minimum before rising again in the not-too-distant future. Here we present four forecast models of the S P500 based on COVID-19 projections of deaths released on 02/04/2020 by the University of Washington and the 2-months consideration since the first confirmed case occured in USA. The decline and recovery in the index is estimated for the following three months . The forecast is a projection of a prediction with fluctuations described by q-gaussian distributions . Our forecast was made on the premise that : (a ) The prediction is based on a deterministic trend that follows the data available since the initial outbreak of COVID-19, and (b) fluctuations derived from the S P500 over the last 24 years. %DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% \\\\%DIF > of accuracy.", "after_revision": "Markets are subjected to both endogenous and exogenous risks that have caused disruptions to financial and economic markets around the globe, leading eventually to fast stock market declines . In the past, markets have recovered after any economic disruption. On this basis, we focus on the outbreak of COVID-19 as a case study of an exogenous risk and analyze its impact on the Standard and Poor's 500 (S \\& P500) index . We assumed that the S\\&P500 index reaches a minimum before rising again in the not-too-distant future. Here we present two cases to forecast the S\\& P500 index. The first case uses an estimation of expected deaths released on 02/04/2020 by the University of Washington . For the second case, it is assumed that the peak number of deaths will occur 2-months since the first confirmed case occurred in the USA. The decline and recovery in the index were estimated for the following three months after the initial point of the predicted trend . The forecast is a projection of a prediction with stochastic fluctuations described by q-gaussian diffusion process with three spatio-temporal regimes . Our forecast was made on the premise that any market response can be decomposed into an overall deterministic trend and a stochastic term. The prediction was based on the deterministic part and for this case study is approximated by the extrapolation of the S\\&P500 data trend in the initial stages of the outbreak. The stochastic fluctuations have the same structure as the one derived from the past 24 years. %DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% A reasonable forecast was achieved with 85\\\\%DIF > of accuracy.", "edit_actions": [{"type": "R", "before": "The outbreak of the novel coronavirus (COVID-19) is considered an exogenous risk, which has caused unprecedented", "after": "Markets are subjected to both endogenous and exogenous risks that have caused", "start_char_pos": 0, "end_char_pos": 112}, {"type": "R", "before": "to one of the fastest U.S.", "after": "eventually to fast", "start_char_pos": 185, "end_char_pos": 211}, {"type": "R", "before": "in history. However, in the pastwe have seen the market recover and we can expect the market to recover again, and on this basis we assume", "after": ". In the past, markets have recovered after any economic disruption. On this basis, we focus on the outbreak of COVID-19 as a case study of an exogenous risk and analyze its impact on", "start_char_pos": 234, "end_char_pos": 372}, {"type": "A", "before": null, "after": "\\&", "start_char_pos": 404, "end_char_pos": 404}, {"type": "R", "before": "will reach", "after": ". We assumed that the S\\&P500 index reaches", "start_char_pos": 417, "end_char_pos": 427}, {"type": "R", "before": "four forecast models of the S", "after": "two cases to forecast the S\\&", "start_char_pos": 505, "end_char_pos": 534}, {"type": "R", "before": "based on COVID-19 projections of", "after": "index. The first case uses an estimation of expected", "start_char_pos": 540, "end_char_pos": 572}, {"type": "R", "before": "and the", "after": ". For the second case, it is assumed that the peak number of deaths will occur", "start_char_pos": 635, "end_char_pos": 642}, {"type": "D", "before": "consideration", "after": null, "start_char_pos": 652, "end_char_pos": 665}, {"type": "R", "before": "occured in", "after": "occurred in the", "start_char_pos": 697, "end_char_pos": 707}, {"type": "R", "before": "is", "after": "were", "start_char_pos": 751, "end_char_pos": 753}, {"type": "A", "before": null, "after": "after the initial point of the predicted trend", "start_char_pos": 795, "end_char_pos": 795}, {"type": "A", "before": null, "after": "stochastic", "start_char_pos": 848, "end_char_pos": 848}, {"type": "R", "before": "distributions", "after": "diffusion process with three spatio-temporal regimes", "start_char_pos": 886, "end_char_pos": 899}, {"type": "R", "before": ": (a ) The prediction is based on a deterministic trend that follows the data available since the initial outbreak of COVID-19, and (b) fluctuations", "after": "any market response can be decomposed into an overall deterministic trend and a stochastic term. The prediction was based on the deterministic part and for this case study is approximated by the extrapolation of the S\\&P500 data trend in the initial stages of the outbreak. The stochastic fluctuations have the same structure as the one", "start_char_pos": 944, "end_char_pos": 1092}, {"type": "D", "before": "S", "after": null, "start_char_pos": 1110, "end_char_pos": 1111}, {"type": "R", "before": "P500 over the last", "after": "past", "start_char_pos": 1112, "end_char_pos": 1130}, {"type": "A", "before": null, "after": "A reasonable forecast was achieved with 85", "start_char_pos": 1186, "end_char_pos": 1186}], "sents_char_pos": [0, 245, 488, 712, 797, 901]} {"doc_id": "2005.05480", "revision_depth": "1", "before_revision": "Neural network based approaches to natural language generation (NLG) have gained popularity in recent years . The goal of the task is to generate a natural language string to realize an input meaning representation , hence large datasets of paired utterances and their meaning representations are used for training the network . However, dataset creation for language generation is an arduous task , and popular datasets designed for training these generators mostly consist of simple meaning representations composed of slot and value tokens to be realized. These simple meaning representations do not include any contextual information that may be helpful for training an NLG system to generalize, such as domain information and descriptions of slots and values. In this paper, we present the novel task of Schema-Guided Natural Language Generation , in which we repurpose an existing dataset for another task: dialog state tracking . Dialog state tracking data includes a large and rich schema spanning multiple different attributes, including information about the domain, user intent, and slot descriptions. We train different state-of-the-art models for neural natural language generation on this data and show that inclusion of the rich schema allows our models to produce higher quality outputs both in terms of semantics and diversity. We also conduct experiments comparing model performance on seen versus unseen domains . Finally, we present human evaluation results and analysis demonstrating high ratings for overall output quality.", "after_revision": "Neural network based approaches to data-to-text natural language generation (NLG) have gained popularity in recent years , with the goal of generating a natural language prompt that accurately realizes an input meaning representation . To facilitate the training of neural network models, researchers created large datasets of paired utterances and their meaning representations . However, the creation of such datasets is an arduous task and they mostly consist of simple meaning representations composed of slot and value tokens to be realized. These representations do not include any contextual information that an NLG system can use when trying to generalize, such as domain information and descriptions of slots and values. In this paper, we present the novel task of Schema-Guided Natural Language Generation (SG-NLG). Here, the goal is still to generate a natural language prompt, but in SG-NLG, the input MRs are paired with rich schemata providing contextual information. To generate a dataset for SG-NLG we re-purpose an existing dataset for another task: dialog state tracking , which includes a large and rich schema spanning multiple different attributes, including information about the domain, user intent, and slot descriptions. We train different state-of-the-art models for neural natural language generation on this dataset and show that in many cases, including rich schema information allows our models to produce higher quality outputs both in terms of semantics and diversity. We also conduct experiments comparing model performance on seen versus unseen domains , and present a human evaluation demonstrating high ratings for overall output quality.", "edit_actions": [{"type": "A", "before": null, "after": "data-to-text", "start_char_pos": 35, "end_char_pos": 35}, {"type": "R", "before": ". The goal of the task is to generate", "after": ", with the goal of generating", "start_char_pos": 109, "end_char_pos": 146}, {"type": "R", "before": "string to realize", "after": "prompt that accurately realizes", "start_char_pos": 166, "end_char_pos": 183}, {"type": "R", "before": ", hence", "after": ". To facilitate the training of neural network models, researchers created", "start_char_pos": 216, "end_char_pos": 223}, {"type": "D", "before": "are used for training the network", "after": null, "start_char_pos": 294, "end_char_pos": 327}, {"type": "R", "before": "dataset creation for language generation", "after": "the creation of such datasets", "start_char_pos": 339, "end_char_pos": 379}, {"type": "R", "before": ", and popular datasets designed for training these generators", "after": "and they", "start_char_pos": 399, "end_char_pos": 460}, {"type": "D", "before": "simple meaning", "after": null, "start_char_pos": 566, "end_char_pos": 580}, {"type": "D", "before": "may be helpful for training", "after": null, "start_char_pos": 644, "end_char_pos": 671}, {"type": "A", "before": null, "after": "can use when trying", "start_char_pos": 686, "end_char_pos": 686}, {"type": "R", "before": ", in which we repurpose", "after": "(SG-NLG). Here, the goal is still to generate a natural language prompt, but in SG-NLG, the input MRs are paired with rich schemata providing contextual information. To generate a dataset for SG-NLG we re-purpose", "start_char_pos": 853, "end_char_pos": 876}, {"type": "R", "before": ". Dialog state tracking data", "after": ", which", "start_char_pos": 937, "end_char_pos": 965}, {"type": "R", "before": "data", "after": "dataset", "start_char_pos": 1205, "end_char_pos": 1209}, {"type": "R", "before": "inclusion of the rich schema", "after": "in many cases, including rich schema information", "start_char_pos": 1224, "end_char_pos": 1252}, {"type": "R", "before": ". Finally, we present human evaluation results and analysis", "after": ", and present a human evaluation", "start_char_pos": 1433, "end_char_pos": 1492}], "sents_char_pos": [0, 110, 329, 559, 766, 1114, 1346, 1434]} {"doc_id": "2005.06552", "revision_depth": "2", "before_revision": "The SIR evolutionary model predicts too sharp a decrease of the fractions of people infected with COVID-19 in France after the start of the national lockdown, compared to what is observed. I introduce three extensions to these models to fit the daily arrivals in French hospitals, as well in critical care , releases and deaths . These models involve ratios of evolutionary timescales to branching fractions, assumed uniform throughout a country, and the basic reproduction number, R_0, before and during the national lockdown, for each region of France. The hospital data are well fit by the models with the exception of the arrivals in critical care, which are found to decrease in time faster than predicted by all models. This suggests that hospitals have learnt over timeto better treat COVID-19 patients without resorting to critical care. The basic reproductive factor, averaged over France, was R_0= 3.4\\pm0.1 before the lockdown and 0.65\\pm0.04 (90\\% c.l.) during it, both with small regional variations. On 11 May 2020, the Infection Fatality Rate in France is 4 \\pm1\\% (90\\% c.l.) and constant , while the Feverish vastly outnumber the Asymptomatic, contrary to the early phases. Without the lockdown nor social distancing, over 2 million deaths from COVID-19 would have occurred throughout France . The fraction of immunized people reached a plateau below 1\\% throughout France (3\\% in Paris) by late April 2020 (95\\% c.l.), suggesting a lack of herd immunity and that a second wave of the pandemic is possible during the partial lifting of the national lockdown. After the partial lifting of the lockdown, if R_0 is as high as 1.5, then a second wave will lead to 60 thousand deaths by mid-July and over a million by October , while if R_0 is 1.2 or lower, the pandemic is delayed with deaths rising as late as August, allowing for timely governmental response .", "after_revision": "The SIR evolutionary model predicts too sharp a decrease of the fractions of people infected with COVID-19 in France after the start of the national lockdown, compared to what is observed. I fit the daily hospital data: arrivals in regular and critical care units , releases and deaths , using extended SEIR models. These involve ratios of evolutionary timescales to branching fractions, assumed uniform throughout a country, and the basic reproduction number, R_0, before and during the national lockdown, for each region of France. The joint-region Bayesian analysis allows precise evaluations of the time/fraction ratios and pre-hospitalized fractions. The hospital data are well fit by the models , except the arrivals in critical care, which decrease faster than predicted , indicating better treatment over time. Averaged over France, the analysis yields R_0= 3.4\\pm0.1 before the lockdown and 0.65\\pm0.04 (90\\% c.l.) during the lockdown, with small regional variations. On 11 May 2020, the Infection Fatality Rate in France was 4 \\pm1\\% (90\\% c.l.) , while the Feverish vastly outnumber the Asymptomatic, contrary to the early phases. Without the lockdown nor social distancing, over 2 million deaths from COVID-19 would have occurred throughout France , while a lockdown that would have been enforced 10 days earlier would have led to less than 1000 deaths . The fraction of immunized people reached a plateau below 1\\% throughout France (3\\% in Paris) by late April 2020 (95\\% c.l.), suggesting a lack of herd immunity . The widespread availability of face masks on 11 May, when the lockdown was partially lifted, should keep R_0 below unity if at least 46\\% of the population wear them outside their home. Otherwise, without enhanced other social distancing, a second wave is inevitable and cause the number of deaths to triple between early May and October ( if R_0 = 1.2 ) or even late June (if R_0=2) .", "edit_actions": [{"type": "D", "before": "introduce three extensions to these models to", "after": null, "start_char_pos": 191, "end_char_pos": 236}, {"type": "R", "before": "arrivals in French hospitals, as well in critical care", "after": "hospital data: arrivals in regular and critical care units", "start_char_pos": 251, "end_char_pos": 305}, {"type": "R", "before": ". These models", "after": ", using extended SEIR models. These", "start_char_pos": 328, "end_char_pos": 342}, {"type": "A", "before": null, "after": "joint-region Bayesian analysis allows precise evaluations of the time/fraction ratios and pre-hospitalized fractions. The", "start_char_pos": 559, "end_char_pos": 559}, {"type": "R", "before": "with the exception of the", "after": ", except the", "start_char_pos": 601, "end_char_pos": 626}, {"type": "R", "before": "are found to decrease in time", "after": "decrease", "start_char_pos": 660, "end_char_pos": 689}, {"type": "R", "before": "by all models. This suggests that hospitals have learnt over timeto better treat COVID-19 patients without resorting to critical care. The basic reproductive factor, averaged", "after": ", indicating better treatment over time. Averaged", "start_char_pos": 712, "end_char_pos": 886}, {"type": "R", "before": "was", "after": "the analysis yields", "start_char_pos": 900, "end_char_pos": 903}, {"type": "R", "before": "it, both", "after": "the lockdown,", "start_char_pos": 974, "end_char_pos": 982}, {"type": "R", "before": "is", "after": "was", "start_char_pos": 1069, "end_char_pos": 1071}, {"type": "D", "before": "and constant", "after": null, "start_char_pos": 1093, "end_char_pos": 1105}, {"type": "A", "before": null, "after": ", while a lockdown that would have been enforced 10 days earlier would have led to less than 1000 deaths", "start_char_pos": 1310, "end_char_pos": 1310}, {"type": "R", "before": "and that a second wave of the pandemic is possible during the partial lifting of the national lockdown. After the partial lifting of the lockdown, if R_0 is as high as 1.5, then", "after": ". The widespread availability of face masks on 11 May, when the lockdown was partially lifted, should keep R_0 below unity if at least 46\\% of the population wear them outside their home. Otherwise, without enhanced other social distancing,", "start_char_pos": 1474, "end_char_pos": 1651}, {"type": "R", "before": "will lead to 60 thousand deaths by mid-July and over a million by October , while", "after": "is inevitable and cause the number of deaths to triple between early May and October (", "start_char_pos": 1666, "end_char_pos": 1747}, {"type": "R", "before": "is", "after": "=", "start_char_pos": 1755, "end_char_pos": 1757}, {"type": "R", "before": "or lower, the pandemic is delayed with deaths rising as late as August, allowing for timely governmental response", "after": ") or even late June (if R_0=2)", "start_char_pos": 1762, "end_char_pos": 1875}], "sents_char_pos": [0, 188, 329, 554, 726, 846, 1014, 1191, 1312, 1577]} {"doc_id": "2005.06636", "revision_depth": "1", "before_revision": "A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In \"bidding games\",{\\em in each turn, we hold an 'auction' (bidding) to determine which player moves the token . The players simultaneously submit bids and the higher bidder moves the token. Several different payment schemeshave been considered. In \"{\\em first-price \" bidding , only the higher bidder pays his bid , while in \"{\\em all-pay \" bidding, both players pay their bids. Bidding games were largely studied with variants of first-price bidding. In this work, we study , for the first time, infinite-duration all-pay bidding games , and show that they exhibit the elegant{\\em mathematical properties of their first-price counterparts . This is in stark contrast with reachability games, which are known to be much more complicated under{\\em all-pay bidding than first-price bidding. Another orthogonal distinction between the bidding rules is in the recipient of the payments: in \"Richman\" bidding, the bids are paid to the other player , and in \"poorman\" bidding, the bids are paid to the 'bank'. We focus on strongly-connected games with \"mean-payoff\" and \"parity\" objectives. We completely solve all-pay Richman games: a simple argument shows that deterministic strategies cannot guarantee anything in this model, and it is technically much more challenging to find optimal probabilistic strategies that achieve the same expected guarantees in a game as can be obtained with deterministic strategies under first-price bidding. Under poorman all-pay bidding , in contrast to Richman bidding, deterministic strategies are useful and guarantee a payoff that is only slightly lower than the optimal payoff under first-price poorman bidding. Our proofs are constructive and based on new and significantly simpler constructions for first-price bidding.", "after_revision": "In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In{\\em bidding games , however, the players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token : both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of{\\em first-price bidding in which only the higher bidder pays his bid . We focus on{\\em all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games . Our most interesting results are for{\\em mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal sure and almost-sure (with probability 1) payoffs that the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts ; namely, an equivalence with{\\em random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding.", "edit_actions": [{"type": "R", "before": "A graph game is", "after": "In", "start_char_pos": 0, "end_char_pos": 15}, {"type": "R", "before": "game in which", "after": "graph game", "start_char_pos": 38, "end_char_pos": 51}, {"type": "R", "before": "In \"bidding games\",", "after": "Traditionally, the players alternate turns in moving the token. In", "start_char_pos": 176, "end_char_pos": 195}, {"type": "A", "before": null, "after": "bidding games", "start_char_pos": 200, "end_char_pos": 200}, {"type": "A", "before": null, "after": ", however, the players have budgets, and", "start_char_pos": 201, "end_char_pos": 201}, {"type": "R", "before": "'auction'", "after": "\"auction\"", "start_char_pos": 227, "end_char_pos": 236}, {"type": "R", "before": ". The", "after": ": both", "start_char_pos": 289, "end_char_pos": 294}, {"type": "R", "before": "Several different payment schemeshave been considered. In \"", "after": "The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of", "start_char_pos": 369, "end_char_pos": 428}, {"type": "R", "before": "\" bidding ,", "after": "bidding in which", "start_char_pos": 445, "end_char_pos": 456}, {"type": "R", "before": ", while in \"", "after": ". We focus on", "start_char_pos": 493, "end_char_pos": 505}, {"type": "R", "before": "\" bidding,", "after": "bidding, where", "start_char_pos": 518, "end_char_pos": 528}, {"type": "R", "before": "Bidding games were largely studied with variants of", "after": "Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their", "start_char_pos": 558, "end_char_pos": 609}, {"type": "R", "before": "bidding. In this work, we study ,", "after": "counterparts. We study", "start_char_pos": 622, "end_char_pos": 655}, {"type": "R", "before": ", and show that they exhibit the elegant", "after": ". Our most interesting results are for", "start_char_pos": 716, "end_char_pos": 756}, {"type": "A", "before": null, "after": "mean-payoff", "start_char_pos": 761, "end_char_pos": 761}, {"type": "A", "before": null, "after": "objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal sure and almost-sure (with probability 1) payoffs that the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing", "start_char_pos": 762, "end_char_pos": 762}, {"type": "R", "before": ". This is in stark contrast with reachability games, which are known to be much more complicated under", "after": "; namely, an equivalence with", "start_char_pos": 821, "end_char_pos": 923}, {"type": "A", "before": null, "after": "random-turn games", "start_char_pos": 928, "end_char_pos": 928}, {"type": "A", "before": null, "after": "in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for", "start_char_pos": 929, "end_char_pos": 929}, {"type": "D", "before": "bidding than first-price bidding. Another orthogonal distinction between the bidding rules is in the recipient of the payments: in \"Richman\" bidding, the bids are paid to the other player , and in \"poorman\" bidding, the bids are paid to the 'bank'. We focus on strongly-connected games with \"mean-payoff\" and \"parity\" objectives. We completely solve all-pay Richman games: a simple argument shows that deterministic strategies cannot guarantee anything in this model, and it is technically much more challenging to find optimal probabilistic strategies that achieve the same expected guarantees in a game as can be obtained with deterministic strategies under first-price bidding. Under poorman all-pay", "after": null, "start_char_pos": 938, "end_char_pos": 1640}, {"type": "R", "before": ", in contrast to Richman bidding, deterministic strategies are useful and guarantee a payoff that is only slightly lower than the optimal payoff under first-price poorman bidding. Our proofs are constructive and based on new and significantly simpler constructions", "after": "are more intricate and unexpected than", "start_char_pos": 1649, "end_char_pos": 1913}], "sents_char_pos": [0, 175, 290, 368, 423, 557, 630, 822, 971, 1186, 1267, 1618, 1828]} {"doc_id": "2005.07115", "revision_depth": "1", "before_revision": "In this work, we are interested in the large graph similarity computation problem , which is one of the most important graph-based problems. Traditional techniques to compute the exact or approximate values of Graph Edit Distance (GED) and Maximum Common Subgraph (MCS) require at least polynomial time complexity over node numbers thus are not able to handle this problem when the numbers of nodes are large . Recently the develop of deep learning techniques provide a promising solution for this problem by training a network which is able to encode graphs to feature vectors and then compute similarity based on feature vectors. However, when we look into these techniques and classify them to embedding models and matching models , problems arise . Embedding models can be quite fast but perform poorly due to the lack of interaction across graphswhile matching models involve this for much better performance but satisfy far more on time consumption . Similar to the process of large biological molecular identification , where we first maps the whole molecular to molecular groups and then identify them based on the \"abstracted smaller molecular\", the feature aggregation across two whole graphs is always redundant, especially when the number of nodes is large. Thus we here present a novel framework for large graph similarity computation problem. We first embed and coarsen the large graphs to \"abstracted smaller graphs \" with denser local topology , similar to molecular groups in biological concept. Then we aggregate both the internal features in \"abstracted smaller graphs \" and external features across \"abstracted smaller graph pair\", leading to feature vectors for each graph, with which we calculate the final similarity score. Experiments demonstrate that our proposed framework outperforms state-of-the-art methods in graph similarity computation tasks and has significant improvement in time efficiency .", "after_revision": "In this work, we focus on large graph similarity computation problem and propose a novel ``embedding-coarsening-matching'' learning framework, which outperforms state-of-the-art methods in this task and has significant improvement in time efficiency. Graph similarity computation for metrics such as Graph Edit Distance (GED) is typically NP-hard, and existing heuristics-based algorithms usually achieves a unsatisfactory trade-off between accuracy and efficiency . Recently the development of deep learning techniques provides a promising solution for this problem by a data-driven approach which trains a network to encode graphs to their own feature vectors and computes similarity based on feature vectors. These deep-learning methods can be classified to two categories, embedding models and matching models . Embedding models such as GCN-Mean and GCN-Max, which directly map graphs to respective feature vectors, run faster but the performance is usually poor due to the lack of interactions across graphs. Matching models such as GMN, whose encoding process involves interaction across the two graphs, are more accurate but interaction between whole graphs brings a significant increase in time consumption (at least quadratic time complexity over number of nodes). Inspired by large biological molecular identification where the whole molecular is first mapped to functional groups and then identified based on these functional groups, our ``embedding-coarsening-matching'' learning framework first embeds and coarsens large graphs to coarsened graphs with denser local topology and then matching mechanism is deployed on the coarsened graphs for the final similarity scores. Detailed experiments have been conducted and the results demonstrate the efficiency and effectiveness of our proposed framework .", "edit_actions": [{"type": "R", "before": "are interested in the", "after": "focus on", "start_char_pos": 17, "end_char_pos": 38}, {"type": "R", "before": ", which is one of the most important graph-based problems. Traditional techniques to compute the exact or approximate values of Graph", "after": "and propose a novel ``embedding-coarsening-matching'' learning framework, which outperforms state-of-the-art methods in this task and has significant improvement in time efficiency. Graph similarity computation for metrics such as Graph", "start_char_pos": 82, "end_char_pos": 215}, {"type": "R", "before": "and Maximum Common Subgraph (MCS) require at least polynomial time complexity over node numbers thus are not able to handle this problem when the numbers of nodes are large", "after": "is typically NP-hard, and existing heuristics-based algorithms usually achieves a unsatisfactory trade-off between accuracy and efficiency", "start_char_pos": 236, "end_char_pos": 408}, {"type": "R", "before": "develop", "after": "development", "start_char_pos": 424, "end_char_pos": 431}, {"type": "R", "before": "provide", "after": "provides", "start_char_pos": 460, "end_char_pos": 467}, {"type": "R", "before": "training a network which is able", "after": "a data-driven approach which trains a network", "start_char_pos": 509, "end_char_pos": 541}, {"type": "A", "before": null, "after": "their own", "start_char_pos": 562, "end_char_pos": 562}, {"type": "R", "before": "then compute", "after": "computes", "start_char_pos": 583, "end_char_pos": 595}, {"type": "R", "before": "However, when we look into these techniques and classify them to", "after": "These deep-learning methods can be classified to two categories,", "start_char_pos": 633, "end_char_pos": 697}, {"type": "D", "before": ", problems arise", "after": null, "start_char_pos": 735, "end_char_pos": 751}, {"type": "R", "before": "can be quite fast but perform poorly", "after": "such as GCN-Mean and GCN-Max, which directly map graphs to respective feature vectors, run faster but the performance is usually poor", "start_char_pos": 771, "end_char_pos": 807}, {"type": "R", "before": "interaction across graphswhile matching models involve this for much better performance but satisfy far more on time consumption . Similar to the process of", "after": "interactions across graphs. Matching models such as GMN, whose encoding process involves interaction across the two graphs, are more accurate but interaction between whole graphs brings a significant increase in time consumption (at least quadratic time complexity over number of nodes). Inspired by", "start_char_pos": 827, "end_char_pos": 983}, {"type": "R", "before": ", where we first maps", "after": "where", "start_char_pos": 1026, "end_char_pos": 1047}, {"type": "R", "before": "to molecular", "after": "is first mapped to functional", "start_char_pos": 1068, "end_char_pos": 1080}, {"type": "R", "before": "identify them based on the \"abstracted smaller molecular\", the feature aggregation across two whole graphs is always redundant, especially when the number of nodes is large. Thus we here present a novel framework for large graph similarity computation problem. We first embed and coarsen the", "after": "identified based on these functional groups, our ``embedding-coarsening-matching'' learning framework first embeds and coarsens", "start_char_pos": 1097, "end_char_pos": 1388}, {"type": "R", "before": "\"abstracted smaller graphs \"", "after": "coarsened graphs", "start_char_pos": 1405, "end_char_pos": 1433}, {"type": "R", "before": ", similar to molecular groups in biological concept. Then we aggregate both the internal features in \"abstracted smaller graphs \" and external features across \"abstracted smaller graph pair\", leading to feature vectors for each graph, with which we calculate", "after": "and then matching mechanism is deployed on the coarsened graphs for", "start_char_pos": 1461, "end_char_pos": 1719}, {"type": "R", "before": "score. Experiments demonstrate that", "after": "scores. Detailed experiments have been conducted and the results demonstrate the efficiency and effectiveness of", "start_char_pos": 1741, "end_char_pos": 1776}, {"type": "D", "before": "outperforms state-of-the-art methods in graph similarity computation tasks and has significant improvement in time efficiency", "after": null, "start_char_pos": 1800, "end_char_pos": 1925}], "sents_char_pos": [0, 140, 410, 632, 736, 1027, 1270, 1357, 1513, 1747]} {"doc_id": "2005.07202", "revision_depth": "1", "before_revision": "Bidirectional Encoder Representations from Transformers (BERT) models for biomedical specialties such as BioBERT and clinicalBERT have significantly improved in biomedical text-mining tasks and enabled us to extract valuable information from biomedical literature . However, we benefitted only in English because of the significant scarcity of high-quality medical documents, such as PubMed, in each language. Therefore, we propose a method that realizes a high-performance BERT model by using a small corpus. We introduce the method to train a BERT model on a small medical corpus both in English and Japanese, respectively, and then we evaluate each of them in terms of the biomedical language understanding evaluation (BLUE) benchmark and the medical-document-classification task in Japanese, respectively. After confirming their satisfactory performances, we apply our method to develop a model that outperforms the pre-existing models. Bidirectional Encoder Representations from Transformers for Biomedical Text Mining by Osaka University (ouBioBERT) achieves the best scores on 7 of the 10 datasets in terms of the BLUE benchmark. The total score is 1.0 points above that of BioBERT .", "after_revision": "Bidirectional Encoder Representations from Transformers (BERT) models for medical specialties, such as BioBERT and clinicalBERT , have significantly improved in performing biomedical text mining tasks and have enabled extracting valuable information from biomedical literature ; however, only English speakers benefit due to the significant scarcity of high-quality medical documents, such as PubMed, in each language. Therefore, we propose a method to train a high-performance BERT model using a small corpus. We introduce the method to train a BERT model on a small medical corpus both in English and in Japanese, and we present the evaluation of each model in terms of the biomedical language understanding evaluation (BLUE) benchmark and the medical document classification task in Japanese, respectively. After confirming their satisfactory performances, we applied our method to develop a model comparable to the publicly available models. OuBioBERT, short for Bidirectional Encoder Representations from Transformers for Biomedical Text Mining by Osaka University , achieved the best score in terms of the BLUE benchmark. The total score is 1.1 points above that of BioBERT and 0.3 points above that of the ablated model trained without our proposed method. This proposed technique is an effective approach to develop localized medical BERT models and to enhance domain-specific models in the biomedical domain .", "edit_actions": [{"type": "R", "before": "biomedical specialties", "after": "medical specialties,", "start_char_pos": 74, "end_char_pos": 96}, {"type": "A", "before": null, "after": ",", "start_char_pos": 130, "end_char_pos": 130}, {"type": "R", "before": "biomedical text-mining tasks and enabled us to extract", "after": "performing biomedical text mining tasks and have enabled extracting", "start_char_pos": 162, "end_char_pos": 216}, {"type": "R", "before": ". However, we benefitted only in English because of", "after": "; however, only English speakers benefit due to", "start_char_pos": 265, "end_char_pos": 316}, {"type": "R", "before": "that realizes", "after": "to train", "start_char_pos": 442, "end_char_pos": 455}, {"type": "D", "before": "by", "after": null, "start_char_pos": 486, "end_char_pos": 488}, {"type": "R", "before": "Japanese, respectively, and then we evaluate each of them", "after": "in Japanese, and we present the evaluation of each model", "start_char_pos": 603, "end_char_pos": 660}, {"type": "R", "before": "medical-document-classification", "after": "medical document classification", "start_char_pos": 747, "end_char_pos": 778}, {"type": "R", "before": "apply", "after": "applied", "start_char_pos": 864, "end_char_pos": 869}, {"type": "R", "before": "that outperforms the pre-existing models.", "after": "comparable to the publicly available models. OuBioBERT, short for", "start_char_pos": 900, "end_char_pos": 941}, {"type": "R", "before": "(ouBioBERT) achieves the best scores on 7 of the 10 datasets", "after": ", achieved the best score", "start_char_pos": 1045, "end_char_pos": 1105}, {"type": "R", "before": "1.0", "after": "1.1", "start_char_pos": 1157, "end_char_pos": 1160}, {"type": "A", "before": null, "after": "and 0.3 points above that of the ablated model trained without our proposed method. This proposed technique is an effective approach to develop localized medical BERT models and to enhance domain-specific models in the biomedical domain", "start_char_pos": 1190, "end_char_pos": 1190}], "sents_char_pos": [0, 266, 410, 510, 810, 941, 1137]} {"doc_id": "2005.08008", "revision_depth": "1", "before_revision": "Graph similarity computation aims to predict a similarity score between one pair of graphs so as to facilitate downstream applications, such as finding the chemical compounds that are most similar to a query compound or Fewshot 3D Action Recognition ,etc . Recently, some graph similarity computation models based on neural networks have been proposed, which are either based on graph-level interaction or node-level comparison. However, when the number of nodes in the graph increases, it will inevitably bring about the problem of reduced representation ability or excessive time complexity . Motivated by this observation, we propose a graph partitioning and graph neural network based model, called PSimGNN, to effectively resolve this issue. Specifically, each of the input graphs is partitioned into a set of subgraphs to directly extract the local structural features firstly . Next, a learnable embedding function is used to map each subgraph into an embedding vector. Then, some of these subgraph pairs are selected for node-level comparison to supplement the subgraph-level embedding with fine-grained information. Finally, coarse-grained interaction information among subgraphs and fine-grained comparison information among nodes in different subgraphs are integrated to predict the final similarity score. Using approximate Graph Edit Distance (GED) as graph similarity metric, experimental results on graph data sets of different graph size demonstrate PSimGNN outperforms state-of-the-art methods in graph similarity computation tasks . The codes will release when this paper is published .", "after_revision": "Graph similarity computation aims to predict a similarity score between one pair of graphs to facilitate downstream applications, such as finding the most similar chemical compounds similar to a query compound or Fewshot 3D Action Recognition . Recently, some graph similarity computation models based on neural networks have been proposed, which are either based on graph-level interaction or node-level comparison. However, when the number of nodes in the graph increases, it will inevitably bring about reduced representation ability or high computation cost . Motivated by this observation, we propose a graph partitioning and graph neural network-based model, called PSimGNN, to effectively resolve this issue. Specifically, each of the input graphs is partitioned into a set of subgraphs to extract the local structural features directly . Next, a novel graph neural network with an attention mechanism is designed to map each subgraph into an embedding vector. Some of these subgraph pairs are automatically selected for node-level comparison to supplement the subgraph-level embedding with fine-grained information. Finally, coarse-grained interaction information among subgraphs and fine-grained comparison information among nodes in different subgraphs are integrated to predict the final similarity score. Experimental results on graph datasets with different graph sizes demonstrate that PSimGNN outperforms state-of-the-art methods in graph similarity computation tasks using approximate Graph Edit Distance (GED) as the graph similarity metric .", "edit_actions": [{"type": "D", "before": "so as", "after": null, "start_char_pos": 91, "end_char_pos": 96}, {"type": "R", "before": "chemical compounds that are most", "after": "most similar chemical compounds", "start_char_pos": 156, "end_char_pos": 188}, {"type": "D", "before": ",", "after": null, "start_char_pos": 250, "end_char_pos": 251}, {"type": "D", "before": "etc", "after": null, "start_char_pos": 251, "end_char_pos": 254}, {"type": "D", "before": "the problem of", "after": null, "start_char_pos": 518, "end_char_pos": 532}, {"type": "R", "before": "excessive time complexity", "after": "high computation cost", "start_char_pos": 567, "end_char_pos": 592}, {"type": "R", "before": "network based", "after": "network-based", "start_char_pos": 675, "end_char_pos": 688}, {"type": "D", "before": "directly", "after": null, "start_char_pos": 828, "end_char_pos": 836}, {"type": "R", "before": "firstly", "after": "directly", "start_char_pos": 875, "end_char_pos": 882}, {"type": "R", "before": "learnable embedding function is used", "after": "novel graph neural network with an attention mechanism is designed", "start_char_pos": 893, "end_char_pos": 929}, {"type": "R", "before": "Then, some", "after": "Some", "start_char_pos": 977, "end_char_pos": 987}, {"type": "A", "before": null, "after": "automatically", "start_char_pos": 1016, "end_char_pos": 1016}, {"type": "R", "before": "Using approximate Graph Edit Distance (GED) as graph similarity metric, experimental", "after": "Experimental", "start_char_pos": 1319, "end_char_pos": 1403}, {"type": "R", "before": "data sets of different graph size demonstrate", "after": "datasets with different graph sizes demonstrate that", "start_char_pos": 1421, "end_char_pos": 1466}, {"type": "R", "before": ". The codes will release when this paper is published", "after": "using approximate Graph Edit Distance (GED) as the graph similarity metric", "start_char_pos": 1550, "end_char_pos": 1603}], "sents_char_pos": [0, 428, 594, 746, 976, 1125, 1318, 1551]} {"doc_id": "2005.08081", "revision_depth": "1", "before_revision": "In sequence-to-sequence learning, the attention mechanism has been a great success in bridging the information between the encoder and the decoder. However, it is often overlooked that the decoder only has a single view of the source sequences, that is , the representations generated by the last encoder layer , which is supposed to be a global view of source sequences . Such implementation hinders the decoder from concrete, fine-grained , local source information . In this work, we explore to reuse the representations from different encoder layers for layer-wise cross-view decoding , that is, different views of the source sequences are presented to different decoder layers . We investigate multiple , representative strategies for cross-view coding, of which the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on neural machine translation task . Especially, GCA surpasses the previous state-of-the-art architecture on three machine translation datasets.", "after_revision": "In sequence-to-sequence learning, the attention mechanism has been a great success in bridging the information between the encoder and the decoder. However, it is often overlooked that the decoder obtains only a single view of the source sequences, i.e. , the representations generated by the last encoder layer . Although those representations are supposed to be a comprehensive, global view of source sequences , such practice keeps the decoders from concrete, fine-grained source information generated by other encoder layers . In this work, we propose to encourage the decoder to take the full advantage of the multi-level source representations for layer-wise cross-view decoding . Concretely, different views of the source sequences are presented to different decoder layers and multiple strategies are explored to route the source representations. In particular, the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on the neural machine translation task , surpassing the previous state-of-the-art architecture on three benchmark datasets.", "edit_actions": [{"type": "R", "before": "only has", "after": "obtains only", "start_char_pos": 197, "end_char_pos": 205}, {"type": "R", "before": "that is", "after": "i.e.", "start_char_pos": 245, "end_char_pos": 252}, {"type": "R", "before": ", which is", "after": ". Although those representations are", "start_char_pos": 311, "end_char_pos": 321}, {"type": "A", "before": null, "after": "comprehensive,", "start_char_pos": 339, "end_char_pos": 339}, {"type": "R", "before": ". Such implementation hinders the decoder", "after": ", such practice keeps the decoders", "start_char_pos": 372, "end_char_pos": 413}, {"type": "R", "before": ", local source information", "after": "source information generated by other encoder layers", "start_char_pos": 442, "end_char_pos": 468}, {"type": "R", "before": "explore to reuse the representations from different encoder layers", "after": "propose to encourage the decoder to take the full advantage of the multi-level source representations", "start_char_pos": 488, "end_char_pos": 554}, {"type": "R", "before": ", that is,", "after": ". Concretely,", "start_char_pos": 590, "end_char_pos": 600}, {"type": "R", "before": ". We investigate multiple , representative strategies for cross-view coding, of which", "after": "and multiple strategies are explored to route the source representations. In particular,", "start_char_pos": 683, "end_char_pos": 768}, {"type": "A", "before": null, "after": "the", "start_char_pos": 883, "end_char_pos": 883}, {"type": "R", "before": ". Especially, GCA surpasses", "after": ", surpassing", "start_char_pos": 916, "end_char_pos": 943}, {"type": "R", "before": "machine translation", "after": "benchmark", "start_char_pos": 996, "end_char_pos": 1015}], "sents_char_pos": [0, 147, 373, 470, 684]} {"doc_id": "2005.08081", "revision_depth": "2", "before_revision": "In sequence-to-sequence learning, the attention mechanism has been a great success in bridging the information between the encoderand the decoder. However, it is often overlooked that the decoder obtains only a single view of the source sequences, i.e., the representations generated by the last encoder layer . Although those representations are supposed to be a comprehensive, global view of source sequences, such practice keeps the decoders from concrete, fine-grained source information generated by other encoder layers . In this work, we propose to encourage the decoder to take the full advantage of the multi-level source representations for layer-wise cross-view decoding . Concretely, different views of the source sequences are presented to different decoder layers and multiple strategies are explored to route the source representations. In particular, the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on the neural machine translation task, surpassing the previous state-of-the-art architecture on three benchmark datasets .", "after_revision": "In sequence-to-sequence learning, the decoder relies on the attention mechanism to efficiently extract information from the encoder. While it is common practice to draw information from only the last encoder layer, recent work has proposed to use representations from different encoder layers for diversified levels of information. Nonetheless, the decoder still obtains only a single view of the source sequences, which might lead to insufficient training of the encoder layer stack due to the hierarchy bypassing problem . In this work, we propose layer-wise cross-view decoding , where for each decoder layer, together with the representations from the last encoder layer, which serve as a global view, those from other encoder layers are supplemented for a stereoscopic view of the source sequences. Systematic experiments show that we successfully address the hierarchy bypassing problem and substantially improve the performance of sequence-to-sequence learning with deep representations on diverse tasks .", "edit_actions": [{"type": "R", "before": "attention mechanism has been a great success in bridging the information between the encoderand the decoder. However, it is often overlooked that the decoder", "after": "decoder relies on the attention mechanism to efficiently extract information from the encoder. While it is common practice to draw information from only the last encoder layer, recent work has proposed to use representations from different encoder layers for diversified levels of information. Nonetheless, the decoder still", "start_char_pos": 38, "end_char_pos": 195}, {"type": "R", "before": "i.e., the representations generated by the last encoder layer . Although those representations are supposed to be a comprehensive, global view of source sequences, such practice keeps the decoders from concrete, fine-grained source information generated by other encoder layers", "after": "which might lead to insufficient training of the encoder layer stack due to the hierarchy bypassing problem", "start_char_pos": 248, "end_char_pos": 525}, {"type": "D", "before": "to encourage the decoder to take the full advantage of the multi-level source representations for", "after": null, "start_char_pos": 553, "end_char_pos": 650}, {"type": "R", "before": ". Concretely, different views of the source sequences are presented to different decoder layers and multiple strategies are explored to route the source representations. In particular, the granularity consistent attention (GCA) strategy proves the most efficient and effective in the experiments on the neural machine translation task, surpassing the previous state-of-the-art architecture on three benchmark datasets", "after": ", where for each decoder layer, together with the representations from the last encoder layer, which serve as a global view, those from other encoder layers are supplemented for a stereoscopic view of the source sequences. Systematic experiments show that we successfully address the hierarchy bypassing problem and substantially improve the performance of sequence-to-sequence learning with deep representations on diverse tasks", "start_char_pos": 682, "end_char_pos": 1099}], "sents_char_pos": [0, 146, 311, 527, 851]} {"doc_id": "2005.08081", "revision_depth": "3", "before_revision": "In sequence-to-sequence learning, the decoder relies on the attention mechanism to efficiently extract information from the encoder. While it is common practice to draw information from only the last encoder layer, recent work has proposed to use representations from different encoder layers for diversified levels of information. Nonetheless, the decoder still obtains only a single view of the source sequences, which might lead to insufficient training of the encoder layer stack due to the hierarchy bypassing problem. In this work, we propose layer-wise cross-view decoding, where for each decoder layer, together with the representations from the last encoder layer, which serve as a global view, those from other encoder layers are supplemented for a stereoscopic view of the source sequences. Systematic experiments show that we successfully address the hierarchy bypassing problem and substantially improve the performance of sequence-to-sequence learning with deep representations on diverse tasks .", "after_revision": "In sequence-to-sequence learning, e.g., natural language generation, the decoder relies on the attention mechanism to efficiently extract information from the encoder. While it is common practice to draw information from only the last encoder layer, recent work has proposed to use representations from different encoder layers for diversified levels of information. Nonetheless, the decoder still obtains only a single view of the source sequences, which might lead to insufficient training of the encoder layer stack due to the hierarchy bypassing problem. In this work, we propose layer-wise multi-view decoding, where for each decoder layer, together with the representations from the last encoder layer, which serve as a global view, those from other encoder layers are supplemented for a stereoscopic view of the source sequences. Systematic experiments and analyses show that we successfully address the hierarchy bypassing problem and substantially improve the performance of sequence-to-sequence learning with deep representations on diverse tasks , i.e., machine translation, abstractive summarization and image captioning. In particular, our approach surpasses the previous state-of-the-art models on three benchmark machine translation datasets .", "edit_actions": [{"type": "A", "before": null, "after": "e.g., natural language generation,", "start_char_pos": 34, "end_char_pos": 34}, {"type": "R", "before": "cross-view", "after": "multi-view", "start_char_pos": 561, "end_char_pos": 571}, {"type": "A", "before": null, "after": "and analyses", "start_char_pos": 826, "end_char_pos": 826}, {"type": "A", "before": null, "after": ", i.e., machine translation, abstractive summarization and image captioning. In particular, our approach surpasses the previous state-of-the-art models on three benchmark machine translation datasets", "start_char_pos": 1011, "end_char_pos": 1011}], "sents_char_pos": [0, 133, 332, 524, 802]} {"doc_id": "2005.08090", "revision_depth": "1", "before_revision": "Tractography from high-dimensional diffusion magnetic resonance imaging (dMRI) data allows brain's structural connectivity analysis. Recent dMRI studies aim to compare connectivity patterns across thousands of subjects to understand subtle abnormalities in brain's white matter connectivity across disease populations. Besides connectivity differences, researchers are also interested in investigating distributions of biologically sensitive dMRI derived metrics across subject groups . Existing software products focus solely on the anatomy or are not intuitive and restrict the comparison of multiple subjects. In this paper, we present the design and implementation of FiberStars, a visual analysis tool for tractography data that allows the interactive and scalable visualization of brain fiber clusters in 2D and 3D . With FiberStars, researchers can analyze and compare multiple subjects in large collections of brain fibers . To evaluate the usability of our software, we performed a quantitative user study. We asked non-experts to find patterns in a large tractography dataset with either FiberStars or AFQ-Browser, an existing dMRI exploration tool. Our results show that participants using FiberStars can navigate extensive collections of tractography faster and more accurately . We discuss our findings and provide an analysis of the requirements for comparative visualizations of tractography data . All our research, software, and results are available openly.", "after_revision": "Tractography from high-dimensional diffusion magnetic resonance imaging (dMRI) data allows brain's structural connectivity analysis. Recent dMRI studies aim to compare connectivity patterns across subject groups and disease populations to understand subtle abnormalities in the brain's white matter connectivity and distributions of biologically sensitive dMRI derived metrics . Existing software products focus solely on the anatomy , are not intuitive or restrict the comparison of multiple subjects. In this paper, we present the design and implementation of FiberStars, a visual analysis tool for tractography data that allows the interactive visualization of brain fiber clusters combining existing 3D anatomy with compact 2D visualizations . With FiberStars, researchers can analyze and compare multiple subjects in large collections of brain fibers using different views . To evaluate the usability of our software, we performed a quantitative user study. We asked domain experts and non-experts to find patterns in a tractography dataset with either FiberStars or an existing dMRI exploration tool. Our results show that participants using FiberStars can navigate extensive collections of tractography faster and more accurately . All our research, software, and results are available openly.", "edit_actions": [{"type": "R", "before": "thousands of subjects", "after": "subject groups and disease populations", "start_char_pos": 197, "end_char_pos": 218}, {"type": "A", "before": null, "after": "the", "start_char_pos": 257, "end_char_pos": 257}, {"type": "R", "before": "across disease populations. Besides connectivity differences, researchers are also interested in investigating", "after": "and", "start_char_pos": 292, "end_char_pos": 402}, {"type": "D", "before": "across subject groups", "after": null, "start_char_pos": 464, "end_char_pos": 485}, {"type": "R", "before": "or", "after": ",", "start_char_pos": 543, "end_char_pos": 545}, {"type": "R", "before": "and", "after": "or", "start_char_pos": 564, "end_char_pos": 567}, {"type": "D", "before": "and scalable", "after": null, "start_char_pos": 758, "end_char_pos": 770}, {"type": "R", "before": "in 2D and", "after": "combining existing", "start_char_pos": 809, "end_char_pos": 818}, {"type": "A", "before": null, "after": "anatomy with compact 2D visualizations", "start_char_pos": 822, "end_char_pos": 822}, {"type": "A", "before": null, "after": "using different views", "start_char_pos": 933, "end_char_pos": 933}, {"type": "A", "before": null, "after": "domain experts and", "start_char_pos": 1028, "end_char_pos": 1028}, {"type": "D", "before": "large", "after": null, "start_char_pos": 1063, "end_char_pos": 1068}, {"type": "D", "before": "AFQ-Browser,", "after": null, "start_char_pos": 1116, "end_char_pos": 1128}, {"type": "D", "before": ". We discuss our findings and provide an analysis of the requirements for comparative visualizations of tractography data", "after": null, "start_char_pos": 1294, "end_char_pos": 1415}], "sents_char_pos": [0, 132, 319, 613, 935, 1018, 1163, 1295, 1417]} {"doc_id": "2005.11079", "revision_depth": "1", "before_revision": "Graph neural networks (GNNs) have generalized deep learning methods into graph-structured data with promising performance on graph mining tasks . However, existing GNNs often meet complex graph structures with scarce labeled nodes and suffer from the limitations of non-robustness, over-smoothing, and overfitting. To address these issues , we propose a simple yet effective GNN framework---Graph Random Neural Network (Grand). Different from the deterministic propagation in existing GNNs, Grand adopts a random propagation strategy to enhance model robustness. This strategy also naturally enables Grand to decouple the propagation from feature transformation, reducing the risks of over-smoothing and overfitting. Moreover, random propagation acts as an efficient method for graph data augmentation. Based on this, we propose the consistency regularization for Grand by leveraging the distributional consistency of unlabeled nodes in multiple augmentations, improving the generalization capacity of the model . Extensive experiments on graph benchmark datasets suggest that Grand significantly outperforms state-of-the-art GNN baselines on semi-supervised graph learning tasks . Finally, we show that Grand mitigates the issues of over-smoothing and overfitting, and its performance is married with robustness.", "after_revision": "We study the problem of semi-supervised learning on graphs, for which graph neural networks (GNNs) have been extensively explored . However, most existing GNNs inherently suffer from the limitations of over-smoothing, non-robustness, and weak-generalization when labeled nodes are scarce. In this paper , we propose a simple yet effective framework---GRAPH RANDOM NEURAL NETWORKS (GRAND)---to address these issues. In GRAND, we first design a random propagation strategy to perform graph data augmentation. Then we leverage consistency regularization to optimize the prediction consistency of unlabeled nodes across different data augmentations . Extensive experiments on graph benchmark datasets suggest that GRAND significantly outperforms state-of-the-art GNN baselines on semi-supervised node classification . Finally, we show that GRAND mitigates the issues of over-smoothing and non-robustness, exhibiting better generalization behavior than existing GNNs. The source code of GRAND is publicly available at URL", "edit_actions": [{"type": "R", "before": "Graph", "after": "We study the problem of semi-supervised learning on graphs, for which graph", "start_char_pos": 0, "end_char_pos": 5}, {"type": "R", "before": "generalized deep learning methods into graph-structured data with promising performance on graph mining tasks", "after": "been extensively explored", "start_char_pos": 34, "end_char_pos": 143}, {"type": "R", "before": "existing GNNs often meet complex graph structures with scarce labeled nodes and", "after": "most existing GNNs inherently", "start_char_pos": 155, "end_char_pos": 234}, {"type": "D", "before": "non-robustness,", "after": null, "start_char_pos": 266, "end_char_pos": 281}, {"type": "R", "before": "and overfitting. To address these issues", "after": "non-robustness, and weak-generalization when labeled nodes are scarce. In this paper", "start_char_pos": 298, "end_char_pos": 338}, {"type": "R", "before": "GNN framework---Graph Random Neural Network (Grand). Different from the deterministic propagation in existing GNNs, Grand adopts", "after": "framework---GRAPH RANDOM NEURAL NETWORKS (GRAND)---to address these issues. In GRAND, we first design", "start_char_pos": 375, "end_char_pos": 503}, {"type": "R", "before": "enhance model robustness. This strategy also naturally enables Grand to decouple the propagation from feature transformation, reducing the risks of over-smoothing and overfitting. Moreover, random propagation acts as an efficient method for", "after": "perform", "start_char_pos": 537, "end_char_pos": 777}, {"type": "R", "before": "Based on this, we propose the consistency regularization for Grand by leveraging the distributional", "after": "Then we leverage consistency regularization to optimize the prediction", "start_char_pos": 803, "end_char_pos": 902}, {"type": "R", "before": "in multiple augmentations, improving the generalization capacity of the model", "after": "across different data augmentations", "start_char_pos": 934, "end_char_pos": 1011}, {"type": "R", "before": "Grand", "after": "GRAND", "start_char_pos": 1077, "end_char_pos": 1082}, {"type": "R", "before": "graph learning tasks", "after": "node classification", "start_char_pos": 1159, "end_char_pos": 1179}, {"type": "R", "before": "Grand", "after": "GRAND", "start_char_pos": 1204, "end_char_pos": 1209}, {"type": "R", "before": "overfitting, and its performance is married with robustness.", "after": "non-robustness, exhibiting better generalization behavior than existing GNNs. The source code of GRAND is publicly available at URL", "start_char_pos": 1253, "end_char_pos": 1313}], "sents_char_pos": [0, 145, 314, 427, 562, 716, 802, 1181]} {"doc_id": "2005.11248", "revision_depth": "1", "before_revision": "De novo therapeutic design is challenged by a vast chemical repertoire and multiple constraints such as high broad-spectrum potency and low toxicity. We propose CLaSS (Controlled Latent attribute Space Sampling) - a novel and efficient computational method for attribute-controlled generation of molecules, which leverages guidance from classifiers trained on an informative latent space of molecules modeled using a deep generative autoencoder. We further screen the generated molecules by using a set of deep learning classifiers in conjunction with novel physicochemical features derived from high-throughput molecular simulations. The proposed approach is employed for designing non-toxic antimicrobial peptides (AMPs) with strong broad-spectrum potency, which are emerging drug candidates for tackling antibiotic resistance. Synthesis and wet lab testing of only twenty designed sequences identified two novel and minimalist AMPs with high potency against diverse Gram-positive and Gram-negative pathogens, including the hard-to-treat multidrug-resistant K. pneumoniae, as well as low in vitro and in vivo toxicity . The proposed approach thus presents a viable path for faster discovery of potent and selective broad-spectrum antimicrobials with a higher success rate than state-of-the-art methods .", "after_revision": "De novo therapeutic design is challenged by a vast chemical repertoire and multiple constraints , e.g., high broad-spectrum potency and low toxicity. We propose CLaSS (Controlled Latent attribute Space Sampling) - an efficient computational method for attribute-controlled generation of molecules, which leverages guidance from classifiers trained on an informative latent space of molecules modeled using a deep generative autoencoder. We screen the generated molecules for additional key attributes by using deep learning classifiers in conjunction with novel features derived from atomistic simulations. The proposed approach is demonstrated for designing non-toxic antimicrobial peptides (AMPs) with strong broad-spectrum potency, which are emerging drug candidates for tackling antibiotic resistance. Synthesis and testing of only twenty designed sequences identified two novel and minimalist AMPs with high potency against diverse Gram-positive and Gram-negative pathogens, including one multidrug-resistant and one antibiotic-resistant K. pneumoniae, via membrane pore formation. Both antimicrobials exhibit low in vitro and in vivo toxicity and mitigate the onset of drug resistance . The proposed approach thus presents a viable path for faster and efficient discovery of potent and selective broad-spectrum antimicrobials .", "edit_actions": [{"type": "R", "before": "such as", "after": ", e.g.,", "start_char_pos": 96, "end_char_pos": 103}, {"type": "R", "before": "a novel and", "after": "an", "start_char_pos": 214, "end_char_pos": 225}, {"type": "D", "before": "further", "after": null, "start_char_pos": 449, "end_char_pos": 456}, {"type": "R", "before": "by using a set of", "after": "for additional key attributes by using", "start_char_pos": 488, "end_char_pos": 505}, {"type": "D", "before": "physicochemical", "after": null, "start_char_pos": 558, "end_char_pos": 573}, {"type": "R", "before": "high-throughput molecular", "after": "atomistic", "start_char_pos": 596, "end_char_pos": 621}, {"type": "R", "before": "employed", "after": "demonstrated", "start_char_pos": 660, "end_char_pos": 668}, {"type": "D", "before": "wet lab", "after": null, "start_char_pos": 844, "end_char_pos": 851}, {"type": "R", "before": "the hard-to-treat", "after": "one", "start_char_pos": 1022, "end_char_pos": 1039}, {"type": "A", "before": null, "after": "and one antibiotic-resistant", "start_char_pos": 1060, "end_char_pos": 1060}, {"type": "R", "before": "as well as", "after": "via membrane pore formation. Both antimicrobials exhibit", "start_char_pos": 1076, "end_char_pos": 1086}, {"type": "A", "before": null, "after": "and mitigate the onset of drug resistance", "start_char_pos": 1121, "end_char_pos": 1121}, {"type": "A", "before": null, "after": "and efficient", "start_char_pos": 1185, "end_char_pos": 1185}, {"type": "D", "before": "with a higher success rate than state-of-the-art methods", "after": null, "start_char_pos": 1250, "end_char_pos": 1306}], "sents_char_pos": [0, 149, 445, 634, 829, 1123]} {"doc_id": "2005.12787", "revision_depth": "1", "before_revision": "We work on dynamic problems with collected data\\subsetR^p based on collected sample points } \\{x_i\\} that distributed on a manifold \\mathcal{M\\subsetR^p} ^n \\subset M that probe the unknown manifold M} . Through the diffusion map, we first learn the reaction coordinates \\{y_i\\} \\subset \\mathcal{N^n\\subset N corresponding to \\{x_i\\}_{i=1}^n, } where N is a manifold isometrically embedded into an Euclidean space \\mathbb{R^\\ell for } and isometrically embedded in \\mathbb{R}^\\ell with } \\ell \\ll p. The reaction coordinates enable us to obtain an efficient approximation for the dynamics described by a Fokker-Planck equation on the manifold \\mathcal{N} . By using the reaction coordinates , we propose an implementable, unconditionally stable, data-driven upwind scheme which automatically incorporates the manifold structure of \\mathcal{N}. Furthermore, we provide a weighted L^2 convergence analysis of the upwind scheme to the Fokker-Planck equation . The proposed upwind scheme leads to a Markov chain with transition probability_i\\}_{i=1}^n with an approximated transition probability and jump rate } between the nearest neighbor points. We can benefit from such property to directly conduct manifold-related computations such as finding the optimal coarse-grained network and the minimal energy path that represents chemical reactions or conformational changes. To establish the Fokker-Planck equation, we need to acquire information about the equilibrium potential of the physical system on \\mathcal{N. Hence, we apply a Gaussian Process regression algorithm to generate equilibrium potential for a new physical system with new parameters. Combining with the proposed upwind scheme, we can calculate the trajectory of the Fokker-Planck equation on \\mathcal{N} based on the generated equilibrium potential. Finally, we develop an algorithm to pullback the trajectory to the original high dimensional space as a generative data for the new physical system} .", "after_revision": "We study the Langevin dynamics of a physical system with manifold structure \\mathcal{M\\subsetR^p based on collected sample points } \\{x_i\\} \\subsetR^p} _{i=1^n \\subset M that probe the unknown manifold M} . Through the diffusion map, we first learn the reaction coordinates \\{y_i\\} _{i=1^n\\subset N corresponding to \\{x_i\\}_{i=1}^n, } where N is a manifold ^\\ell for } diffeomorphic to \\mathcal{M and isometrically embedded in \\mathbb{R}^\\ell with } \\ell \\ll p. The induced Langevin dynamics on \\mathcal{N approximation for the Langevin dynamics on \\mathcal{N Fokker-Planck equation on the manifold \\mathcal{N} in terms of the reaction coordinates \\mathsf{y propose an implementable, unconditionally stable, data-driven finite volume scheme for this Fokker-Planck equation, which automatically incorporates the manifold structure of \\mathcal{N}. Furthermore, we provide a weighted L^2 convergence analysis of the finite volume scheme to the Fokker-Planck equation on \\mathcal{N . The proposed finite volume scheme leads to a Markov chain on \\{\\mathsf{y_i\\}_{i=1}^n with an approximated transition probability and jump rate } between the nearest neighbor points. . Hence, we apply a Gaussian Process regression algorithm to generate equilibrium potential for a new physical system with new parameters. Combining with the proposed upwind scheme, we can calculate the trajectory of the Fokker-Planck equation on \\mathcal{N} based on the generated equilibrium potential. Finally, we develop an algorithm to pullback the trajectory to the original high dimensional space as a generative data for the new physical system} After an unconditionally stable explicit time discretization, the data-driven finite volume scheme gives an approximated Markov process for the Langevin dynamics on \\mathcal{N .", "edit_actions": [{"type": "R", "before": "work on dynamic problems with collected data", "after": "study the Langevin dynamics of a physical system with manifold structure \\mathcal{M", "start_char_pos": 3, "end_char_pos": 47}, {"type": "D", "before": "that distributed on a manifold \\mathcal{M", "after": null, "start_char_pos": 101, "end_char_pos": 142}, {"type": "A", "before": null, "after": "_{i=1", "start_char_pos": 154, "end_char_pos": 154}, {"type": "R", "before": "\\subset \\mathcal{N", "after": "_{i=1", "start_char_pos": 279, "end_char_pos": 297}, {"type": "D", "before": "isometrically embedded into an Euclidean space \\mathbb{R", "after": null, "start_char_pos": 367, "end_char_pos": 423}, {"type": "A", "before": null, "after": "diffeomorphic to \\mathcal{M", "start_char_pos": 435, "end_char_pos": 435}, {"type": "R", "before": "reaction coordinates enable us to obtain an efficient", "after": "induced Langevin dynamics on \\mathcal{N", "start_char_pos": 505, "end_char_pos": 558}, {"type": "R", "before": "dynamics described by a", "after": "Langevin dynamics on \\mathcal{N", "start_char_pos": 581, "end_char_pos": 604}, {"type": "R", "before": ". By using", "after": "in terms of", "start_char_pos": 656, "end_char_pos": 666}, {"type": "R", "before": ", we", "after": "\\mathsf{y", "start_char_pos": 692, "end_char_pos": 696}, {"type": "R", "before": "upwind scheme", "after": "finite volume scheme for this Fokker-Planck equation,", "start_char_pos": 759, "end_char_pos": 772}, {"type": "R", "before": "upwind", "after": "finite volume", "start_char_pos": 912, "end_char_pos": 918}, {"type": "A", "before": null, "after": "on \\mathcal{N", "start_char_pos": 956, "end_char_pos": 956}, {"type": "R", "before": "upwind", "after": "finite volume", "start_char_pos": 972, "end_char_pos": 978}, {"type": "R", "before": "with transition probability", "after": "on \\{\\mathsf{y", "start_char_pos": 1010, "end_char_pos": 1037}, {"type": "D", "before": "We can benefit from such property to directly conduct manifold-related computations such as finding the optimal coarse-grained network and the minimal energy path that represents chemical reactions or conformational changes. To establish the Fokker-Planck equation, we need to acquire information about the equilibrium potential of the physical system on \\mathcal{N", "after": null, "start_char_pos": 1147, "end_char_pos": 1512}, {"type": "A", "before": null, "after": "After an unconditionally stable explicit time discretization, the data-driven finite volume scheme gives an approximated Markov process for the Langevin dynamics on \\mathcal{N", "start_char_pos": 1966, "end_char_pos": 1966}], "sents_char_pos": [0, 500, 844, 958, 1146, 1371, 1513, 1650, 1816]} {"doc_id": "2005.13183", "revision_depth": "1", "before_revision": "Graph Convolutional Network (GCN) has achieved extraordinary success in learning effective high-level representations of nodes in graphs. However, the study regarding Heterogeneous Information Network (HIN) is still limited, because the existing HIN-oriented GCN methods suffer from two deficiencies: (1) they cannot flexibly exploit all possible meta-paths , and some even require the user to specify useful ones ; (2) they often need to first transform an HIN into meta-path based graphs by computing commuting matrices, which has a high time complexity, resulting in poor scalability . To address the above issues, we propose interpretable and efficient Heterogeneous Graph Convolutional Network (ie-HGCN) to learn representations of nodes in HINs. It automatically extracts useful meta-paths for each node from all possible meta-paths (within a length limit determined by the model depth ), which brings good model interpretability. It directly takes the entire HIN as input and avoids intermediate HIN transformation . The carefully designed hierarchical aggregation architecture avoids computationally inefficient neighborhood attention. Thus, it is much more efficient than previous methods. We formally prove ie-HGCN evaluates the usefulness of all possible meta-paths within a length limit (model depth), show it intrinsically performs spectral graph convolution on HINs, and analyze the time complexity to verify its quasi-linear scalability. Extensive experimental results on three real-world networks demonstrate the superiority of ie-HGCN over state-of-the-art methods.", "after_revision": "Graph Convolutional Network (GCN) has achieved extraordinary success in learning effective task-specific representations of nodes in graphs. However, regarding Heterogeneous Information Network (HIN) , existing HIN-oriented GCN methods still suffer from two deficiencies: (1) they cannot flexibly explore all possible meta-paths and extract the most useful ones for a target object, which hinders both effectiveness and interpretability ; (2) they often need to generate intermediate meta-path based dense graphs, which leads to high computational complexity . To address the above issues, we propose an interpretable and efficient Heterogeneous Graph Convolutional Network (ie-HGCN) to learn the representations of objects in HINs. It is designed as a hierarchical aggregation architecture, i.e., object-level aggregation first, followed by type-level aggregation. The novel architecture can automatically extract useful meta-paths for each object from all possible meta-paths (within a length limit ), which brings good model interpretability. It can also reduce the computational cost by avoiding intermediate HIN transformation and neighborhood attention. We provide theoretical analysis about the proposed ie-HGCN in terms of evaluating the usefulness of all possible meta-paths , its connection to the spectral graph convolution on HINs, and its quasi-linear time complexity. Extensive experiments on three real network datasets demonstrate the superiority of ie-HGCN over the state-of-the-art methods.", "edit_actions": [{"type": "R", "before": "high-level", "after": "task-specific", "start_char_pos": 91, "end_char_pos": 101}, {"type": "D", "before": "the study", "after": null, "start_char_pos": 147, "end_char_pos": 156}, {"type": "R", "before": "is still limited, because the", "after": ",", "start_char_pos": 207, "end_char_pos": 236}, {"type": "A", "before": null, "after": "still", "start_char_pos": 271, "end_char_pos": 271}, {"type": "R", "before": "exploit", "after": "explore", "start_char_pos": 327, "end_char_pos": 334}, {"type": "R", "before": ", and some even require the user to specify useful ones", "after": "and extract the most useful ones for a target object, which hinders both effectiveness and interpretability", "start_char_pos": 359, "end_char_pos": 414}, {"type": "R", "before": "first transform an HIN into", "after": "generate intermediate", "start_char_pos": 440, "end_char_pos": 467}, {"type": "R", "before": "graphs by computing commuting matrices, which has a high time complexity, resulting in poor scalability", "after": "dense graphs, which leads to high computational complexity", "start_char_pos": 484, "end_char_pos": 587}, {"type": "A", "before": null, "after": "an", "start_char_pos": 630, "end_char_pos": 630}, {"type": "R", "before": "representations of nodes", "after": "the representations of objects", "start_char_pos": 720, "end_char_pos": 744}, {"type": "R", "before": "automatically extracts", "after": "is designed as a hierarchical aggregation architecture, i.e., object-level aggregation first, followed by type-level aggregation. The novel architecture can automatically extract", "start_char_pos": 757, "end_char_pos": 779}, {"type": "R", "before": "node", "after": "object", "start_char_pos": 807, "end_char_pos": 811}, {"type": "D", "before": "determined by the model depth", "after": null, "start_char_pos": 864, "end_char_pos": 893}, {"type": "R", "before": "directly takes the entire HIN as input and avoids", "after": "can also reduce the computational cost by avoiding", "start_char_pos": 942, "end_char_pos": 991}, {"type": "R", "before": ". The carefully designed hierarchical aggregation architecture avoids computationally inefficient", "after": "and", "start_char_pos": 1024, "end_char_pos": 1121}, {"type": "R", "before": "Thus, it is much more efficient than previous methods. We formally prove", "after": "We provide theoretical analysis about the proposed", "start_char_pos": 1146, "end_char_pos": 1218}, {"type": "R", "before": "evaluates", "after": "in terms of evaluating", "start_char_pos": 1227, "end_char_pos": 1236}, {"type": "R", "before": "within a length limit (model depth), show it intrinsically performs", "after": ", its connection to the", "start_char_pos": 1279, "end_char_pos": 1346}, {"type": "D", "before": "analyze the time complexity to verify", "after": null, "start_char_pos": 1387, "end_char_pos": 1424}, {"type": "R", "before": "scalability. Extensive experimental results on three real-world networks", "after": "time complexity. Extensive experiments on three real network datasets", "start_char_pos": 1442, "end_char_pos": 1514}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1559, "end_char_pos": 1559}], "sents_char_pos": [0, 137, 416, 589, 753, 938, 1025, 1145, 1200, 1454]} {"doc_id": "2005.14108", "revision_depth": "1", "before_revision": "Deep leaning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis and many others. However, in recent years it has been shown that these models possess weakness to noises which forces the model to misclassify. This issue has been studied profoundly in image and audio domain. Very little has been studied on this issue with respect to textual data. Even less survey on this topic has been performed to understand different types of attacks and defense techniques. In this manuscript we accumulated and analyzed different attacking techniques , various defense models on how to overcome this issue in order to provide a more comprehensive idea. Later we point out some of the interesting findings of all papers and challenges that need to be overcome in order to move forward in this field.", "after_revision": "Deep learning models have been used widely for various purposes in recent years in object recognition, self-driving cars, face recognition, speech recognition, sentiment analysis , and many others. However, in recent years it has been shown that these models possess weakness to noises which force the model to misclassify. This issue has been studied profoundly in the image and audio domain. Very little has been studied on this issue concerning textual data. Even less survey on this topic has been performed to understand different types of attacks and defense techniques. In this manuscript , we accumulated and analyzed different attacking techniques and various defense models to provide a more comprehensive idea. Later we point out some of the interesting findings of all papers and challenges that need to be overcome to move forward in this field.", "edit_actions": [{"type": "R", "before": "leaning", "after": "learning", "start_char_pos": 5, "end_char_pos": 12}, {"type": "A", "before": null, "after": ",", "start_char_pos": 178, "end_char_pos": 178}, {"type": "R", "before": "forces", "after": "force", "start_char_pos": 290, "end_char_pos": 296}, {"type": "A", "before": null, "after": "the", "start_char_pos": 365, "end_char_pos": 365}, {"type": "R", "before": "with respect to", "after": "concerning", "start_char_pos": 433, "end_char_pos": 448}, {"type": "A", "before": null, "after": ",", "start_char_pos": 597, "end_char_pos": 597}, {"type": "R", "before": ",", "after": "and", "start_char_pos": 657, "end_char_pos": 658}, {"type": "R", "before": "on how to overcome this issue in order to", "after": "to", "start_char_pos": 682, "end_char_pos": 723}, {"type": "D", "before": "in order", "after": null, "start_char_pos": 865, "end_char_pos": 873}], "sents_char_pos": [0, 195, 322, 389, 462, 577, 758]} {"doc_id": "2006.00632", "revision_depth": "1", "before_revision": "Deep neural networks excel at learning from labeled data and achieve state-of-the-art results on a wide array of Natural Language Processing tasks. In contrast, learning from unlabeled data, especially under domain shift, remains a challenge. Motivated by the latest advances, in this survey we review neural unsupervised domain adaptation techniques which do not require labeled target domain data. This is a more challenging yet a more widely applicable setup. We outline methods, from early approaches in traditional non-neural methods to pre-trained model transfer. We also revisit the notion of domain, and we uncover a bias in the type of Natural Language Processing tasks which received most attention. Lastly, we outline future directions, particularly the broader need for out-of-distribution generalization of future intelligent NLP.", "after_revision": "Deep neural networks excel at learning from labeled data and achieve state-of-the-art resultson a wide array of Natural Language Processing tasks. In contrast, learning from unlabeled data, especially under domain shift, remains a challenge. Motivated by the latest advances, in this survey we review neural unsupervised domain adaptation techniques which do not require labeled target domain data. This is a more challenging yet a more widely applicable setup. We outline methods, from early traditional non-neural methods to pre-trained model transfer. We also revisit the notion of domain, and we uncover a bias in the type of Natural Language Processing tasks which received most attention. Lastly, we outline future directions, particularly the broader need for out-of-distribution generalization of future NLP.", "edit_actions": [{"type": "R", "before": "results on", "after": "resultson", "start_char_pos": 86, "end_char_pos": 96}, {"type": "D", "before": "approaches in", "after": null, "start_char_pos": 494, "end_char_pos": 507}, {"type": "D", "before": "intelligent", "after": null, "start_char_pos": 827, "end_char_pos": 838}], "sents_char_pos": [0, 147, 242, 399, 462, 569, 709]} {"doc_id": "2006.00659", "revision_depth": "1", "before_revision": "We introduce a deterministic model that partitions the total population into the susceptible, infected, quarantined, and those traced after exposure, recovered and the deceased. We introduce the concept of 'accessible population for transmission of the disease' , which can be a small fraction of the total population, for instance when interventions are in force. This assumption , together with the structure of the set of coupled nonlinear ordinary differential equations for the populations, allows us to decouple the equations into just two equations. This further reduces to a logistic type of equation for the total infected population. The equation can be solved analytically and therefore allows for a clear interpretation of the growth and inhibiting factors in terms of the parameters in the full model. The validity of the 'accessible population' assumption and the efficacy of the reduced logistic model is demonstrated by the ease of fitting the United Kingdom data for the total number of infected cases. The approach further helps us to analyze the original model equations. We show that the original model equations provide a very good fit with the United Kingdom data for the cumulative number of infections . The active infected population of the model is seen to exhibit a turning point around mid-May, suggesting the beginning of a slow-down in the spread of infections. However, the rate of slowing down beyond the turning point is small and therefore the cumulative number of infections is likely to saturate to about 3.52 \\times 10^5 around early or mid July, provided the lock-down conditions continue to prevail . Noting that the fits obtained from the reduced logistic equation and the full model equations are equally good. The model and the procedure adopted here are expected to be useful in fitting the data for other countries and forecasting the progression of the disease .", "after_revision": "We introduce a deterministic model that partitions the total population into the susceptible, infected, quarantined, and those traced after exposure, the recovered and the deceased. We hypothesize 'accessible population for transmission of the disease' to be a small fraction of the total population, for instance when interventions are in force. This hypothesis , together with the structure of the set of coupled nonlinear ordinary differential equations for the populations, allows us to decouple the equations into just two equations. This further reduces to a logistic type of equation for the total infected population. The equation can be solved analytically and therefore allows for a clear interpretation of the growth and inhibiting factors in terms of the parameters in the full model. The validity of the 'accessible population' hypothesis and the efficacy of the reduced logistic model is demonstrated by the ease of fitting the United Kingdom data for the cumulative infected and daily new infected cases. The model can also be used to forecast further progression of the disease. In an effort to find optimized parameter values compatible with the United Kingdom coronavirus data, we first determine the relative importance of the various transition rates participating in the original model. Using this we show that the original model equations provide a very good fit with the United Kingdom data for the cumulative number of infections and the daily new cases. The fact that the model calculated daily new cases exhibits a turning point , suggests the beginning of a slow-down in the spread of infections. However, since the rate of slowing down beyond the turning point is small , the cumulative number of infections is likely to saturate to about 3.52 \\times 10^5 around late July, provided the lock-down conditions continue to prevail .", "edit_actions": [{"type": "A", "before": null, "after": "the", "start_char_pos": 150, "end_char_pos": 150}, {"type": "R", "before": "introduce the concept of", "after": "hypothesize", "start_char_pos": 182, "end_char_pos": 206}, {"type": "R", "before": ", which can", "after": "to", "start_char_pos": 263, "end_char_pos": 274}, {"type": "R", "before": "assumption", "after": "hypothesis", "start_char_pos": 371, "end_char_pos": 381}, {"type": "R", "before": "assumption", "after": "hypothesis", "start_char_pos": 860, "end_char_pos": 870}, {"type": "R", "before": "total number of infected", "after": "cumulative infected and daily new infected", "start_char_pos": 989, "end_char_pos": 1013}, {"type": "R", "before": "approach further helps us to analyze the original model equations. We", "after": "model can also be used to forecast further progression of the disease. In an effort to find optimized parameter values compatible with the United Kingdom coronavirus data, we first determine the relative importance of the various transition rates participating in the original model. Using this we", "start_char_pos": 1025, "end_char_pos": 1094}, {"type": "R", "before": ". The active infected population of the model is seen to exhibit", "after": "and the daily new cases. The fact that the model calculated daily new cases exhibits", "start_char_pos": 1227, "end_char_pos": 1291}, {"type": "R", "before": "around mid-May, suggesting", "after": ", suggests", "start_char_pos": 1308, "end_char_pos": 1334}, {"type": "A", "before": null, "after": "since", "start_char_pos": 1402, "end_char_pos": 1402}, {"type": "R", "before": "and therefore", "after": ",", "start_char_pos": 1462, "end_char_pos": 1475}, {"type": "R", "before": "early or mid", "after": "late", "start_char_pos": 1567, "end_char_pos": 1579}, {"type": "D", "before": ". Noting that the fits obtained from the reduced logistic equation and the full model equations are equally good. The model and the procedure adopted here are expected to be useful in fitting the data for other countries and forecasting the progression of the disease", "after": null, "start_char_pos": 1640, "end_char_pos": 1907}], "sents_char_pos": [0, 178, 365, 557, 644, 815, 1020, 1091, 1228, 1392, 1641, 1753]} {"doc_id": "2006.01212", "revision_depth": "1", "before_revision": "Many key variablesin finance, economics and risk management, including financial returns and foreign exchange rates , exhibit nonlinear dependence, heterogeneity and heavy-tailedness of some usually largely unknown type. The presence of non-linear dependence (usually modelled using GARCH-type dynamics) and heavy-tailedness may make problematic the analysis of (non-)efficiency , volatility clustering and predictive regressions in economic and financial markets using traditional approaches that appeal to asymptotic normality of sample autocorrelation functions (ACFs) of returns and their squares. The paper presents several new approaches to deal with the above problems. We provide the results that motivate the use of measures of market (non-)efficiency , volatility clustering and nonlinear dependence based on (small) powers of absolute returns and their signed versions. The paper provides asymptotic theory for sample analogues of the above measures in the case of general time series, including GARCH-type processes. It further develops new approaches to robust inference on them in the case of general GARCH-type processes exhibiting heavy-tailedness properties . The approaches are based on robust inference methods exploiting conservativeness properties of t-statistics Ibragimov and Muller (2010,2016) and several new results on their applicability in the settings considered . In the approaches, estimates of parameters of interest are computed for groups of data and the inference is based on t-statistics in resulting group estimates. This results in valid robust inference under a wide range of heterogeneity and dependence assumptions satisfied in financial and economic markets. Numerical results and empirical applications confirm advantages of the new approaches over existing ones and their wide applicability .", "after_revision": "Many financial and economic variables, including financial returns , exhibit nonlinear dependence, heterogeneity and heavy-tailedness . These properties may make problematic the analysis of (non-)efficiency and volatility clustering in economic and financial markets using traditional approaches that appeal to asymptotic normality of sample autocorrelation functions of returns and their squares. This paper presents new approaches to deal with the above problems. We provide the results that motivate the use of measures of market (non-)efficiency and volatility clustering based on (small) powers of absolute returns and their signed versions. We further provide new approaches to robust inference on the measures in the case of general time series, including GARCH-type processes . The approaches are based on robust t-statistics tests and new results on their applicability are presented . In the approaches, parameter estimates (e.g., estimates of measures of nonlinear dependence) are computed for groups of data , and the inference is based on t-statistics in the resulting group estimates. This results in valid robust inference under heterogeneity and dependence assumptions satisfied in real-world financial markets. Numerical results and empirical applications confirm the advantages and wide applicability of the proposed approaches .", "edit_actions": [{"type": "R", "before": "key variablesin finance, economics and risk management,", "after": "financial and economic variables,", "start_char_pos": 5, "end_char_pos": 60}, {"type": "D", "before": "and foreign exchange rates", "after": null, "start_char_pos": 89, "end_char_pos": 115}, {"type": "R", "before": "of some usually largely unknown type. The presence of non-linear dependence (usually modelled using GARCH-type dynamics) and heavy-tailedness", "after": ". These properties", "start_char_pos": 183, "end_char_pos": 324}, {"type": "R", "before": ", volatility clustering and predictive regressions", "after": "and volatility clustering", "start_char_pos": 379, "end_char_pos": 429}, {"type": "D", "before": "(ACFs)", "after": null, "start_char_pos": 565, "end_char_pos": 571}, {"type": "R", "before": "The paper presents several", "after": "This paper presents", "start_char_pos": 602, "end_char_pos": 628}, {"type": "R", "before": ", volatility clustering and nonlinear dependence", "after": "and volatility clustering", "start_char_pos": 761, "end_char_pos": 809}, {"type": "R", "before": "The paper provides asymptotic theory for sample analogues of the above measures in the case of general time series, including GARCH-type processes. It further develops", "after": "We further provide", "start_char_pos": 881, "end_char_pos": 1048}, {"type": "R", "before": "them", "after": "the measures", "start_char_pos": 1087, "end_char_pos": 1091}, {"type": "A", "before": null, "after": "time series, including", "start_char_pos": 1115, "end_char_pos": 1115}, {"type": "D", "before": "exhibiting heavy-tailedness properties", "after": null, "start_char_pos": 1137, "end_char_pos": 1175}, {"type": "D", "before": "inference methods exploiting conservativeness properties of", "after": null, "start_char_pos": 1213, "end_char_pos": 1272}, {"type": "R", "before": "Ibragimov and Muller (2010,2016) and several", "after": "tests and", "start_char_pos": 1286, "end_char_pos": 1330}, {"type": "R", "before": "in the settings considered", "after": "are presented", "start_char_pos": 1366, "end_char_pos": 1392}, {"type": "R", "before": "estimates of parameters of interest", "after": "parameter estimates (e.g., estimates of measures of nonlinear dependence)", "start_char_pos": 1414, "end_char_pos": 1449}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1482, "end_char_pos": 1482}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1529, "end_char_pos": 1529}, {"type": "D", "before": "a wide range of", "after": null, "start_char_pos": 1602, "end_char_pos": 1617}, {"type": "R", "before": "financial and economic", "after": "real-world financial", "start_char_pos": 1672, "end_char_pos": 1694}, {"type": "R", "before": "advantages of the new approaches over existing ones and their wide applicability", "after": "the advantages and wide applicability of the proposed approaches", "start_char_pos": 1757, "end_char_pos": 1837}], "sents_char_pos": [0, 220, 601, 676, 880, 1028, 1177, 1394, 1556, 1703]} {"doc_id": "2006.01241", "revision_depth": "2", "before_revision": "This paper describes and develops a fast and accurate algorithm that computes the field of values boundary curve for every conceivable complex square matrix A , i. e., for all matrices, those with or without repeated eigenvalues and with or without Jordan block structures, with ill-conditioned eigenvalues or ill-conditioned ones and so forth. It relies on a matrix flow decomposition method that finds a block-diagonal flow representation for the hermitean matrix flow H\\!K {\\cal _A(t) = \\cos(t) H + \\sin(t) K if this is possible. Here H\\!K{\\cal _A(t) is a 1-parameter varying linear combination of the real and skew part matrices H = (A+A^*)/2 and K = (A-A^*)/(2i) of A. For decomposing flows H\\!K {\\cal _A(t), the algorithm decomposes the given dense general matrix A unitarily into U^*AU = \\text { diag} (A_j) with diagonal blocks A_j that conform in size with those of H\\!K_A . It then computes the field of values boundaries separately for each diagonal block A_j using the path following ZNN eigenvalue method. The convex hull of all sub field of values boundary points then determines the field of values boundary curve correctly for decomposing and non-decomposing matrices A. The algorithm removes standard restrictions for path following FoV methods that generally cannot deal with decomposing matrices A due to possible eigencurve crossings of H\\!K {\\cal _A(t). Tests and numerical comparisons are included. Our ZNN based method is coded for sequential and parallel computations and both versions run very accurately and very fast when compared with Johnson's global QR eigenvalue and Bedixon rectangle based method that computes complete eigenanalyses of H\\!K {\\cal _A(t_k) for every chosen t_k \\in {[} 0,2\\pi{]} .", "after_revision": "This paper describes and develops a fast and accurate path following algorithm that computes the field of values boundary curve for every conceivable complex or real square matrix A . It relies on a matrix flow decomposition method that finds a proper block-diagonal flow representation for the associated hermitean matrix flow {\\cal F _A(t) = \\cos(t) H + \\sin(t) K . Here{\\cal F _A(t) is a 1-parameter-varying linear combination of the real and skew part matrices H = (A+A^*)/2 and K = (A-A^*)/(2i) of A. For decomposing flows {\\cal F _A(t), the algorithm decomposes a given dense general matrix A unitarily into block-diagonal form U^*AU = \\text { diag} (A_j) with j > 1 diagonal blocks A_j whose individual sizes add up to the size of A . It then computes the field of values boundaries separately for each diagonal block A_j using the path following ZNN eigenvalue method. The convex hull of all sub-fields of values boundary points then determines the field of values boundary curve correctly for decomposing and non-decomposing matrices A. The algorithm removes standard restrictions for path following FoV methods that generally cannot deal with decomposing matrices A due to possible eigencurve crossings of {\\cal F _A(t). Tests and numerical comparisons are included. Our ZNN based method is coded for sequential and parallel computations and both versions run very accurately and very fast when compared with Johnson's Francis QR eigenvalue and Bendixon rectangle based method that computes complete eigenanalyses of {\\cal F _A(t_k) for every chosen t_k \\in {[} 0,2\\pi{]} more slowly .", "edit_actions": [{"type": "A", "before": null, "after": "path following", "start_char_pos": 54, "end_char_pos": 54}, {"type": "A", "before": null, "after": "or real", "start_char_pos": 144, "end_char_pos": 144}, {"type": "R", "before": ", i. e., for all matrices, those with or without repeated eigenvalues and with or without Jordan block structures, with ill-conditioned eigenvalues or ill-conditioned ones and so forth.", "after": ".", "start_char_pos": 161, "end_char_pos": 346}, {"type": "A", "before": null, "after": "proper", "start_char_pos": 408, "end_char_pos": 408}, {"type": "A", "before": null, "after": "associated", "start_char_pos": 452, "end_char_pos": 452}, {"type": "D", "before": "H\\!K", "after": null, "start_char_pos": 475, "end_char_pos": 479}, {"type": "A", "before": null, "after": "F", "start_char_pos": 486, "end_char_pos": 486}, {"type": "R", "before": "if this is possible. Here H\\!K", "after": ". Here", "start_char_pos": 517, "end_char_pos": 547}, {"type": "A", "before": null, "after": "F", "start_char_pos": 553, "end_char_pos": 553}, {"type": "R", "before": "1-parameter varying", "after": "1-parameter-varying", "start_char_pos": 565, "end_char_pos": 584}, {"type": "D", "before": "H\\!K", "after": null, "start_char_pos": 702, "end_char_pos": 706}, {"type": "A", "before": null, "after": "F", "start_char_pos": 713, "end_char_pos": 713}, {"type": "R", "before": "the", "after": "a", "start_char_pos": 746, "end_char_pos": 749}, {"type": "A", "before": null, "after": "block-diagonal form", "start_char_pos": 794, "end_char_pos": 794}, {"type": "A", "before": null, "after": "j > 1", "start_char_pos": 828, "end_char_pos": 828}, {"type": "R", "before": "that conform in size with those of H\\!K_A", "after": "whose individual sizes add up to the size of A", "start_char_pos": 849, "end_char_pos": 890}, {"type": "R", "before": "sub field", "after": "sub-fields", "start_char_pos": 1051, "end_char_pos": 1060}, {"type": "D", "before": "H\\!K", "after": null, "start_char_pos": 1366, "end_char_pos": 1370}, {"type": "A", "before": null, "after": "F", "start_char_pos": 1377, "end_char_pos": 1377}, {"type": "R", "before": "global", "after": "Francis", "start_char_pos": 1583, "end_char_pos": 1589}, {"type": "R", "before": "Bedixon", "after": "Bendixon", "start_char_pos": 1608, "end_char_pos": 1615}, {"type": "D", "before": "H\\!K", "after": null, "start_char_pos": 1679, "end_char_pos": 1683}, {"type": "A", "before": null, "after": "F", "start_char_pos": 1690, "end_char_pos": 1690}, {"type": "A", "before": null, "after": "more slowly", "start_char_pos": 1738, "end_char_pos": 1738}], "sents_char_pos": [0, 346, 537, 679, 892, 1027, 1195, 1384, 1430]} {"doc_id": "2006.01512", "revision_depth": "1", "before_revision": "We recall that if A is an invertible and symmetric real m\\times m matrix, then it is diagonalisable. Therefore, if we denote by \\mathcal{E^{+}(A)\\subset R^m (respectively E^{-}(A)\\subset R^m) to be the vector subspace generated by eigenvectors with positive eigenvalues of A (correspondingly the vector subspace generated by eigenvectors with negative eigenvalues of A), then we have an orthogonal decomposition R^m=E^{+}(A)\\oplus E^{-}(A). Hence, every x\\in R^m can be written uniquely as x=pr_{A,+}(x)+pr_{A,-}(x) with pr_{A,+}(x)\\in E^{+}(A) and pr_{A,-}(x)\\in E^{-}(A). We propose the following simple new modification of quasi-Newton's methods. }%DIFDELCMD < {\\bf %%% New Q-Newton's method. Let \\Delta = \\{\\delta _0,\\delta _1,\\delta _2,\\ldots \\} be a countable set of real numbers which has at least m+1 elements. Let f:R^m\\rightarrow R be a C^2 function. Let \\alpha >0. For each x\\in \\mathbb{R^m such that \\nabla f(x)}%DIFDELCMD < \\not%%% = 0, let \\delta (x) = \\delta _j, where j is the smallest number so that \\nabla ^2f(x)+\\delta _j||\\nabla f(x)||^{1+\\alphaId is invertible. (If \\nabla f(x)=0, then we choose \\delta (x)=\\delta _0.) Let x_0\\in \\mathbb{R}^m be an initial point. We define a sequence of x_n\\in \\mathbb{R}^m and invertible and symmetric m\\times m matrices A_nas follows: A_n=} \\nabla ^2f(x_n)+\\delta (x_n) ||\\nabla f(x_n)|| ^{1+\\alpha = x_n-w_n, where w_n=pr_{A_n,+ A_n^{-1} \\nabla f(x_n). The main result of this paper roughly says that if f is C^3 and a sequence \\{x_n\\}, constructed by the New Q-Newton's method from a random initial point x_0, {\\bf converges}, then the limit point is not a saddle point, and the convergence rate is the same as that of Newton's method .", "after_revision": "We ^{+}(A)\\subset R^m (respectively E^{-}(A)\\subset R^m) to be the vector subspace generated by eigenvectors with positive eigenvalues of A (correspondingly the vector subspace generated by eigenvectors with negative eigenvalues of A), then we have an orthogonal decomposition R^m=E^{+}(A)\\oplus E^{-}(A). Hence, every x\\in R^m can be written uniquely as x=pr_{A,+}(x)+pr_{A,-}(x) with pr_{A,+}(x)\\in E^{+}(A) and pr_{A,-}(x)\\in E^{-}(A). We propose the following simple new modification of quasi-Newton's methods. }%DIFDELCMD < {\\bf %%% propose in this paper New Q-Newton's method. The update rule for the simplest version is x_{n+1 = ^m such that \\nabla f(x)}%DIFDELCMD < \\not%%% x_n-w_n where w_n = pr_{A_n,+ = Id is invertible. (If \\nabla f(x)=0, then we choose \\delta (x)=\\delta _0.) Let x_0\\in \\mathbb{R}^m be an initial point. We define a sequence of x_n\\in \\mathbb{R}^m and invertible and symmetric m\\times m matrices A_nas follows: A_n=} \\nabla ^2f(x_n)+\\delta _n ||\\nabla f(x_n)|| ^2 .Id and v_n = A_n^{-1} . \\nabla f(x_n). Here \\delta _n is an appropriate real number so that A_n is invertible, and pr_{A_n,\\pm The main result of this paper roughly says that if f is C^3 and a sequence \\{x_n\\}, constructed by the New Q-Newton's method from a random initial point x_0, {\\bf converges}, then the limit point is a critical point and is not a saddle point, and the convergence rate is the same as that of Newton's method . At the end of the paper, we present some issues (saddle points and convergence) one faces when implementing Newton's method and modifications into Deep Neural Networks. In the appendix, we test the good performance of New Q-Newton's method on various benchmark test functions such as Rastrigin, Askley, Rosenbroch and many other, against algorithms such as Newton's method, BFGS, Adaptive Cubic Regularization, Random damping Newton's method and Inertial Newton's method, as well as Unbounded Two-way Backtracking Gradient Descent. The experiments demonstrate in particular that the assumption that f is C^3 is necessary for some conclusions in the main theoretical results .", "edit_actions": [{"type": "D", "before": "recall that if A is an invertible and symmetric real m\\times m matrix, then it is diagonalisable. Therefore, if we denote by \\mathcal{E", "after": null, "start_char_pos": 3, "end_char_pos": 138}, {"type": "A", "before": null, "after": "propose in this paper", "start_char_pos": 673, "end_char_pos": 673}, {"type": "R", "before": "Let \\Delta", "after": "The update rule for the simplest version is x_{n+1", "start_char_pos": 697, "end_char_pos": 707}, {"type": "D", "before": "\\{\\delta _0,\\delta _1,\\delta _2,\\ldots \\} be a countable set of real numbers which has at least m+1 elements. Let f:R^m\\rightarrow R be a C^2 function. Let \\alpha >0. For each x\\in \\mathbb{R", "after": null, "start_char_pos": 710, "end_char_pos": 900}, {"type": "A", "before": null, "after": "x_n-w_n where w_n", "start_char_pos": 946, "end_char_pos": 946}, {"type": "R", "before": "0, let \\delta (x)", "after": "pr_{A_n,+", "start_char_pos": 949, "end_char_pos": 966}, {"type": "D", "before": "\\delta _j, where j is the smallest number so that \\nabla ^2f(x)+\\delta _j||\\nabla f(x)||^{1+\\alpha", "after": null, "start_char_pos": 969, "end_char_pos": 1067}, {"type": "R", "before": "(x_n)", "after": "_n", "start_char_pos": 1323, "end_char_pos": 1328}, {"type": "R", "before": "^{1+\\alpha", "after": "^2 .Id and v_n", "start_char_pos": 1347, "end_char_pos": 1357}, {"type": "D", "before": "x_n-w_n, where w_n=pr_{A_n,+", "after": null, "start_char_pos": 1360, "end_char_pos": 1388}, {"type": "A", "before": null, "after": ".", "start_char_pos": 1398, "end_char_pos": 1398}, {"type": "A", "before": null, "after": "Here \\delta _n is an appropriate real number so that A_n is invertible, and pr_{A_n,\\pm", "start_char_pos": 1414, "end_char_pos": 1414}, {"type": "A", "before": null, "after": "a critical point and is", "start_char_pos": 1614, "end_char_pos": 1614}, {"type": "A", "before": null, "after": ". At the end of the paper, we present some issues (saddle points and convergence) one faces when implementing Newton's method and modifications into Deep Neural Networks. In the appendix, we test the good performance of New Q-Newton's method on various benchmark test functions such as Rastrigin, Askley, Rosenbroch and many other, against algorithms such as Newton's method, BFGS, Adaptive Cubic Regularization, Random damping Newton's method and Inertial Newton's method, as well as Unbounded Two-way Backtracking Gradient Descent. The experiments demonstrate in particular that the assumption that f is C^3 is necessary for some conclusions in the main theoretical results", "start_char_pos": 1699, "end_char_pos": 1699}], "sents_char_pos": [0, 100, 440, 573, 649, 696, 819, 861, 876, 1084, 1186, 1413]} {"doc_id": "2006.02985", "revision_depth": "1", "before_revision": "This tutorial shows how to build, fit, and criticize disease transmission models in Stan, and should be useful to researchers interested in modeling the COVID-19 outbreak and doing Bayesian inference . Bayesian modeling provides a principled way to quantify uncertainty and incorporate prior knowledge into the model . What is more, Stan 's main inference engine, Hamiltonian Monte Carlo sampling, is amiable to diagnostics, which means we can verify whether our inference is reliable. Stan is an expressive probabilistic programing language that abstracts the inference and allows users to focus on the modeling. The resulting code is readable and easily extensible, which makes the modeler's work more transparent and flexible. In this tutorial, we demonstrate with a simple Susceptible-Infected-Recovered (SIR) model how to formulate, fit, and diagnose a compartmental model in Stan . We also introduce more advanced topics which can help practitioners fit sophisticated models; notably, how to use simulations to probe our model and our priors, and computational techniques to scale ODE-based models .", "after_revision": "This tutorial shows how to build, fit, and criticize disease transmission models in Stan, and should be useful to researchers interested in modeling the SARS-CoV-2 pandemic and other infectious diseases in a Bayesian framework . Bayesian modeling provides a principled way to quantify uncertainty and incorporate both data and prior knowledge into the model estimates. Stan is an expressive probabilistic programming language that abstracts the inference and allows users to focus on the modeling. As a result, Stan code is readable and easily extensible, which makes the modeler's work more transparent . Furthermore, Stan's main inference engine, Hamiltonian Monte Carlo sampling, is amiable to diagnostics, which means the user can verify whether the obtained inference is reliable. In this tutorial, we demonstrate how to formulate, fit, and diagnose a compartmental transmission model in Stan , first with a simple Susceptible-Infected-Recovered (SIR) model, then with a more elaborate transmission model used during the SARS-CoV-2 pandemic . We also cover advanced topics which can further help practitioners fit sophisticated models; notably, how to use simulations to probe the model and priors, and computational techniques to scale-up models based on ordinary differential equations .", "edit_actions": [{"type": "R", "before": "COVID-19 outbreak and doing Bayesian inference", "after": "SARS-CoV-2 pandemic and other infectious diseases in a Bayesian framework", "start_char_pos": 153, "end_char_pos": 199}, {"type": "A", "before": null, "after": "both data and", "start_char_pos": 286, "end_char_pos": 286}, {"type": "R", "before": ". What is more, Stan 's main inference engine, Hamiltonian Monte Carlo sampling, is amiable to diagnostics, which means we can verify whether our inference is reliable. Stan is", "after": "estimates. Stan is", "start_char_pos": 318, "end_char_pos": 494}, {"type": "R", "before": "programing", "after": "programming", "start_char_pos": 523, "end_char_pos": 533}, {"type": "R", "before": "The resulting", "after": "As a result, Stan", "start_char_pos": 615, "end_char_pos": 628}, {"type": "R", "before": "and flexible.", "after": ". Furthermore, Stan's main inference engine, Hamiltonian Monte Carlo sampling, is amiable to diagnostics, which means the user can verify whether the obtained inference is reliable.", "start_char_pos": 717, "end_char_pos": 730}, {"type": "D", "before": "with a simple Susceptible-Infected-Recovered (SIR) model", "after": null, "start_char_pos": 764, "end_char_pos": 820}, {"type": "A", "before": null, "after": "transmission", "start_char_pos": 873, "end_char_pos": 873}, {"type": "A", "before": null, "after": ", first with a simple Susceptible-Infected-Recovered (SIR) model, then with a more elaborate transmission model used during the SARS-CoV-2 pandemic", "start_char_pos": 888, "end_char_pos": 888}, {"type": "R", "before": "introduce more", "after": "cover", "start_char_pos": 899, "end_char_pos": 913}, {"type": "A", "before": null, "after": "further", "start_char_pos": 940, "end_char_pos": 940}, {"type": "R", "before": "our model and our", "after": "the model and", "start_char_pos": 1027, "end_char_pos": 1044}, {"type": "R", "before": "scale ODE-based models", "after": "scale-up models based on ordinary differential equations", "start_char_pos": 1085, "end_char_pos": 1107}], "sents_char_pos": [0, 319, 486, 614, 730, 890, 985]} {"doc_id": "2006.03044", "revision_depth": "1", "before_revision": "Difficulty algorithms are a fundamental component of Proof-of-Work blockchains, aimed at maintaining stable block production times by dynamically adjusting the network difficulty in response to the miners' constantly changing computational power. Targeting stable block times is critical, as this ensures consistent transaction throughput. Some blockchains need difficulty algorithms that react quickly to severe hash rate fluctuations . However, without careful design this could create vulnerabilities that incentivize miners to engage in coin-hopping strategies which yield an unreliable system due to unstable processing of transactions. We provide an empirical analysis of how Bitcoin Cash exhibits cyclicality in block solve times as a consequence of a positive feedback loop in its difficulty algorithm design. Additionally, we examine the extent to which miners' behavior contributes towards this phenomenon over time. In response, we mathematically derive a difficulty algorithm based on a negative exponential filter that prohibits the formation of positive feedback loops and exhibits additional desirable properties, such as history agnosticism. We compare the described algorithm to that of Bitcoin Cash in a simulated mining environment and verify that the former would eliminate the severe oscillations in block solve times. Lastly, we outline how this model can more generally replace difficulty algorithms in other Proof-of-Work blockchains .", "after_revision": "In Proof-of-Work blockchains, difficulty algorithms serve the crucial purpose of maintaining a stable transaction throughput by dynamically adjusting the block difficulty in response to the miners' constantly changing computational power. Blockchains that may experience severe hash rate fluctuations need difficulty algorithms that quickly adapt the mining difficulty . However, without careful design , the system could be gamed by miners using coin-hopping strategies to manipulate the block difficulty for profit. Such miner behavior results in an unreliable system due to the unstable processing of transactions. We provide an empirical analysis of how Bitcoin Cash 's difficulty algorithm design leads to cyclicality in block solve times as a consequence of a positive feedback loop . In response, we mathematically derive a difficulty algorithm using a negative exponential filter which prohibits the formation of positive feedback and exhibits additional desirable properties, such as history agnosticism. We compare the described algorithm to that of Bitcoin Cash in a simulated mining environment and verify that the former would eliminate the severe oscillations in transaction throughput .", "edit_actions": [{"type": "R", "before": "Difficulty algorithms are a fundamental component of", "after": "In", "start_char_pos": 0, "end_char_pos": 52}, {"type": "R", "before": "aimed at maintaining stable block production times", "after": "difficulty algorithms serve the crucial purpose of maintaining a stable transaction throughput", "start_char_pos": 80, "end_char_pos": 130}, {"type": "R", "before": "network", "after": "block", "start_char_pos": 160, "end_char_pos": 167}, {"type": "R", "before": "Targeting stable block times is critical, as this ensures consistent transaction throughput. Some blockchains need difficulty algorithms that react quickly to", "after": "Blockchains that may experience", "start_char_pos": 247, "end_char_pos": 405}, {"type": "A", "before": null, "after": "need difficulty algorithms that quickly adapt the mining difficulty", "start_char_pos": 436, "end_char_pos": 436}, {"type": "R", "before": "this could create vulnerabilities that incentivize miners to engage in", "after": ", the system could be gamed by miners using", "start_char_pos": 471, "end_char_pos": 541}, {"type": "R", "before": "which yield", "after": "to manipulate the block difficulty for profit. Such miner behavior results in", "start_char_pos": 566, "end_char_pos": 577}, {"type": "A", "before": null, "after": "the", "start_char_pos": 606, "end_char_pos": 606}, {"type": "R", "before": "exhibits", "after": "'s difficulty algorithm design leads to", "start_char_pos": 697, "end_char_pos": 705}, {"type": "R", "before": "in its difficulty algorithm design. Additionally, we examine the extent to which miners' behavior contributes towards this phenomenon over time.", "after": ".", "start_char_pos": 784, "end_char_pos": 928}, {"type": "R", "before": "based on", "after": "using", "start_char_pos": 990, "end_char_pos": 998}, {"type": "R", "before": "that", "after": "which", "start_char_pos": 1029, "end_char_pos": 1033}, {"type": "D", "before": "loops", "after": null, "start_char_pos": 1079, "end_char_pos": 1084}, {"type": "R", "before": "block solve times. Lastly, we outline how this model can more generally replace difficulty algorithms in other Proof-of-Work blockchains", "after": "transaction throughput", "start_char_pos": 1323, "end_char_pos": 1459}], "sents_char_pos": [0, 246, 339, 438, 643, 819, 928, 1159, 1341]} {"doc_id": "2006.03226", "revision_depth": "1", "before_revision": "The combination of neuroscience-oriented and computer-science-oriented approaches is the most promising method to develop artificial general intelligence (AGI) that can learn general tasks similar to humans. Currently, two main routes of learning exist, including neuroscience-inspired methods , represented by local synaptic plasticity, and machine-learning methods, represented by backpropagation . Both have advantages and complement each other , but neither can solve all learning problems well. Integrating these two methods into one network may provide better learning abilities for general tasks. Here, we report a hybrid spiking neural network model that integrates the two approaches by introducing a meta-local module and a two-phase causality modellingmethod. The model can not only optimize local plasticityrules, but also receive top-down supervision information . In addition to flexibly supporting multiple spike-based coding schemes, we demonstrate that this model facilitates learning of many general tasks, including fault-tolerance learning, few-shot learning and multiple-task learning , and show its efficiency on the Tianjic neuromorphic platform . This work provides a new route for brain-inspired computing and facilitates AGI development .", "after_revision": "Two main routes of learning methods exist at present including neuroscience-inspired methods and machine learning methods . Both have own advantages , but neither currently can solve all learning problems well. Integrating them into one network may provide better learning abilities for general tasks. On the other hand, spiking neural network embodies \"computation\" in spatiotemporal domain with unique features of rich coding scheme and threshold switching, which is very suitable for low power and high parallel neuromorphic computing. Here, we report a spike-based general learning model that integrates two learning routes by introducing a brain-inspired meta-local module and a two-phase parametric modelling. The hybrid model can meta-learn general local plasticity, and receive top-down supervision information for multi-scale learning. We demonstrate that this hybrid model facilitates learning of many general tasks, including fault-tolerance learning, few-shot learning and multiple-task learning . Furthermore, the implementation of the hybrid model on the Tianjic neuromorphic platform proves that it can fully utilize the advantages of neuromorphic hardware architecture and promote energy-efficient on-chip applications .", "edit_actions": [{"type": "R", "before": "The combination of neuroscience-oriented and computer-science-oriented approaches is the most promising method to develop artificial general intelligence (AGI) that can learn general tasks similar to humans. Currently, two", "after": "Two", "start_char_pos": 0, "end_char_pos": 222}, {"type": "R", "before": "exist,", "after": "methods exist at present", "start_char_pos": 247, "end_char_pos": 253}, {"type": "R", "before": ", represented by local synaptic plasticity, and machine-learning methods, represented by backpropagation", "after": "and machine learning methods", "start_char_pos": 294, "end_char_pos": 398}, {"type": "R", "before": "advantages and complement each other", "after": "own advantages", "start_char_pos": 411, "end_char_pos": 447}, {"type": "A", "before": null, "after": "currently", "start_char_pos": 462, "end_char_pos": 462}, {"type": "R", "before": "these two methods", "after": "them", "start_char_pos": 513, "end_char_pos": 530}, {"type": "A", "before": null, "after": "On the other hand, spiking neural network embodies \"computation\" in spatiotemporal domain with unique features of rich coding scheme and threshold switching, which is very suitable for low power and high parallel neuromorphic computing.", "start_char_pos": 605, "end_char_pos": 605}, {"type": "R", "before": "hybrid spiking neural network", "after": "spike-based general learning", "start_char_pos": 624, "end_char_pos": 653}, {"type": "R", "before": "the two approaches", "after": "two learning routes", "start_char_pos": 676, "end_char_pos": 694}, {"type": "A", "before": null, "after": "brain-inspired", "start_char_pos": 712, "end_char_pos": 712}, {"type": "R", "before": "causality modellingmethod. The model can not only optimize local plasticityrules, but also", "after": "parametric modelling. The hybrid model can meta-learn general local plasticity, and", "start_char_pos": 747, "end_char_pos": 837}, {"type": "R", "before": ". In addition to flexibly supporting multiple spike-based coding schemes, we", "after": "for multi-scale learning. We", "start_char_pos": 879, "end_char_pos": 955}, {"type": "A", "before": null, "after": "hybrid", "start_char_pos": 978, "end_char_pos": 978}, {"type": "R", "before": ", and show its efficiency", "after": ". Furthermore, the implementation of the hybrid model", "start_char_pos": 1110, "end_char_pos": 1135}, {"type": "R", "before": ". This work provides a new route for brain-inspired computing and facilitates AGI development", "after": "proves that it can fully utilize the advantages of neuromorphic hardware architecture and promote energy-efficient on-chip applications", "start_char_pos": 1173, "end_char_pos": 1266}], "sents_char_pos": [0, 207, 400, 500, 604, 773, 880, 1174]} {"doc_id": "2006.04002", "revision_depth": "1", "before_revision": "In this paper, we extend the class of kernel methods, the so-called diffusion maps (DM), and its local kernel variants, to approximate second-order differential operators defined on smooth manifolds with boundary that naturally arise in elliptic PDE models. To achieve this goal, we introduce the Ghost Point Diffusion Maps (GPDM) estimator on an extended manifold, identified by the set of point clouds on the unknown original manifold together with a set of ghost points specified along the tangential direction at the boundary of the original manifold . The resulting GPDM estimator restricts the standard DM matrix to a set of extrapolation equations that estimates the function values on the ghost points. This adjustment is analogous to the usual correction on the matrix components near the boundary in classical finite-difference methods . As opposed to the classical DM which diverges near the boundary, the proposed GPDM estimator converges pointwise even near the boundary , assuming that the extended manifold is smooth . Applying the consistent GPDM estimator to solve the well-posed elliptic PDEs with classical boundary conditions (Dirichlet, Neumann, and Robin), we establish the convergence of the approximate solution under appropriate smoothness assumptions. We validate the proposed mesh-free PDE solver with supporting numerical examples on various problems , defined on simple manifolds embedded in 2D to 5D Euclidean spaces as well as on an unknown manifold. Numerically, we also find that the GPDM is more accurate compared to DM in solving eigenvalue problems associated with the second-order differential operators on bounded smooth manifolds.", "after_revision": "In this paper, we extend the class of kernel methods, the so-called diffusion maps (DM), and its local kernel variants, to approximate second-order differential operators defined on smooth manifolds with boundaries that naturally arise in elliptic PDE models. To achieve this goal, we introduce the Ghost Point Diffusion Maps (GPDM) estimator on an extended manifold, identified by the set of point clouds on the unknown original manifold together with a set of ghost points , specified along the estimated tangential direction at the sampled points at the boundary . The resulting GPDM estimator restricts the standard DM matrix to a set of extrapolation equations that estimates the function values at the ghost points. This adjustment is analogous to the classical ghost point method in finite-difference scheme for solving PDEs on flat domain . As opposed to the classical DM which diverges near the boundary, the proposed GPDM estimator converges pointwise even near the boundary . Applying the consistent GPDM estimator to solve the well-posed elliptic PDEs with classical boundary conditions (Dirichlet, Neumann, and Robin), we establish the convergence of the approximate solution under appropriate smoothness assumptions. We numerically validate the proposed mesh-free PDE solver on various problems defined on simple sub-manifolds embedded in Euclidean spaces as well as on an unknown manifold. Numerically, we also found that the GPDM is more accurate compared to DM in solving elliptic eigenvalue problems on bounded smooth manifolds.", "edit_actions": [{"type": "R", "before": "boundary", "after": "boundaries", "start_char_pos": 204, "end_char_pos": 212}, {"type": "A", "before": null, "after": ",", "start_char_pos": 473, "end_char_pos": 473}, {"type": "A", "before": null, "after": "estimated", "start_char_pos": 494, "end_char_pos": 494}, {"type": "R", "before": "boundary of the original manifold", "after": "sampled points at the boundary", "start_char_pos": 523, "end_char_pos": 556}, {"type": "R", "before": "on", "after": "at", "start_char_pos": 692, "end_char_pos": 694}, {"type": "R", "before": "usual correction on the matrix components near the boundary in classical", "after": "classical ghost point method in", "start_char_pos": 749, "end_char_pos": 821}, {"type": "R", "before": "methods", "after": "scheme for solving PDEs on flat domain", "start_char_pos": 840, "end_char_pos": 847}, {"type": "D", "before": ", assuming that the extended manifold is smooth", "after": null, "start_char_pos": 986, "end_char_pos": 1033}, {"type": "A", "before": null, "after": "numerically", "start_char_pos": 1283, "end_char_pos": 1283}, {"type": "D", "before": "with supporting numerical examples", "after": null, "start_char_pos": 1327, "end_char_pos": 1361}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1382, "end_char_pos": 1383}, {"type": "R", "before": "manifolds embedded in 2D to 5D", "after": "sub-manifolds embedded in", "start_char_pos": 1402, "end_char_pos": 1432}, {"type": "R", "before": "find", "after": "found", "start_char_pos": 1506, "end_char_pos": 1510}, {"type": "R", "before": "eigenvalue problems associated with the second-order differential operators", "after": "elliptic eigenvalue problems", "start_char_pos": 1568, "end_char_pos": 1643}], "sents_char_pos": [0, 257, 558, 712, 849, 1279, 1484]} {"doc_id": "2006.05955", "revision_depth": "1", "before_revision": "A compartmental epidemic model is proposed to predict the Covid-19 virus spread. It considers: both detected and undetected infected populations, medical quarantine and social sequestration, plus possible reinfection. The coefficients in the model are evaluated by fitting to empirical data for six US states: California, Louisiana, New Jersey, New York State, Texas, and Washington State . The evolution of Covid-19 is fairly similar among the states: contact and detection rates remain below 5\\%; however, variations are larger in death rate, recovery rate, and stay-at-home effect . The results reveal that outbreaks may have been well underway in several states before first detected and that some western states might have seen more than one influx of the pandemic. For the majority of states the model's effective reproduction number is slightly above the critical value of one, indicating that Covid-19 will become endemic, spreading for more than two years. Should stay-at-home orders be revoked , most states may experience oscillating yearly infections. Even if additional lockdowns are applied in Texas, and then released according to White House guidelines of 14 days of decreasing cases, a similar endemic situation may occur. Additionally, if lockdowns had been instituted one to three weeks sooner , the number of Covid-19 deaths in New York could have been significantly reduced, but surprisingly not in Texas (perhaps due to aversion to lockdown and absence of a decree).", "after_revision": "A compartmental epidemic model is proposed to predict the Covid-19 virus spread. It considers: both detected and undetected infected populations, medical quarantine and social sequestration, release from sequestration, plus possible reinfection. The coefficients in the model are evaluated by fitting to empirical data for eight US states: Arizona, California, Florida, Illinois, Louisiana, New Jersey, New York State, and Texas. Together these states make up 43\\% of the US population; some of these states appear to have handled their initial outbreaks well, while others appear to be emerging hotspots . The evolution of Covid-19 is fairly similar among the states: variations in contact and recovery rates remain below 5\\%; however, not surprisingly, variations are larger in death rate, reinfection rate, stay-at-home effect , and release rate from sequestration . The results reveal that outbreaks may have been well underway in several states before first detected and that California might have seen more than one influx of the pandemic. Our projections based on the current situation indicate that Covid-19 will become endemic, spreading for more than two years. Should states fully relax stay-at-home orders , most states may experience a secondary peak in 2021. If lockdowns had been kept in place , the number of Covid-19 deaths so far could have been significantly lower in most states that opened up. Additionally, our model predicts that decreasing contact rate by 10\\%, or increasing testing by approximately 15\\%, or doubling lockdown compliance (from the current \\sim 15\\% to \\sim 30\\%) will eradicate infections in the state of Texas within a year. Extending our fits for all of the US states, we predict about 11 million total infections (including undetected), 8 million cumulative confirmed cases, and 630,000 cumulative deaths by November 1, 2020.", "edit_actions": [{"type": "A", "before": null, "after": "release from sequestration,", "start_char_pos": 191, "end_char_pos": 191}, {"type": "R", "before": "six", "after": "eight", "start_char_pos": 296, "end_char_pos": 299}, {"type": "R", "before": "California,", "after": "Arizona, California, Florida, Illinois,", "start_char_pos": 311, "end_char_pos": 322}, {"type": "R", "before": "Texas, and Washington State", "after": "and Texas. Together these states make up 43\\% of the US population; some of these states appear to have handled their initial outbreaks well, while others appear to be emerging hotspots", "start_char_pos": 362, "end_char_pos": 389}, {"type": "R", "before": "contact and detection", "after": "variations in contact and recovery", "start_char_pos": 454, "end_char_pos": 475}, {"type": "A", "before": null, "after": "not surprisingly,", "start_char_pos": 509, "end_char_pos": 509}, {"type": "R", "before": "recovery rate, and", "after": "reinfection rate,", "start_char_pos": 547, "end_char_pos": 565}, {"type": "A", "before": null, "after": ", and release rate from sequestration", "start_char_pos": 586, "end_char_pos": 586}, {"type": "R", "before": "some western states", "after": "California", "start_char_pos": 700, "end_char_pos": 719}, {"type": "R", "before": "For the majority of states the model's effective reproduction number is slightly above the critical value of one, indicating", "after": "Our projections based on the current situation indicate", "start_char_pos": 774, "end_char_pos": 898}, {"type": "A", "before": null, "after": "states fully relax", "start_char_pos": 976, "end_char_pos": 976}, {"type": "D", "before": "be revoked", "after": null, "start_char_pos": 997, "end_char_pos": 1007}, {"type": "R", "before": "oscillating yearly infections. Even if additional lockdowns are applied in Texas, and then released according to White House guidelines of 14 days of decreasing cases, a similar endemic situation may occur. Additionally, if", "after": "a secondary peak in 2021. If", "start_char_pos": 1037, "end_char_pos": 1260}, {"type": "R", "before": "instituted one to three weeks sooner", "after": "kept in place", "start_char_pos": 1280, "end_char_pos": 1316}, {"type": "R", "before": "in New York", "after": "so far", "start_char_pos": 1349, "end_char_pos": 1360}, {"type": "R", "before": "reduced, but surprisingly not in Texas (perhaps due to aversion to lockdown and absence of a decree).", "after": "lower in most states that opened up. Additionally, our model predicts that decreasing contact rate by 10\\%, or increasing testing by approximately 15\\%, or doubling lockdown compliance (from the current \\sim 15\\% to \\sim 30\\%) will eradicate infections in the state of Texas within a year. Extending our fits for all of the US states, we predict about 11 million total infections (including undetected), 8 million cumulative confirmed cases, and 630,000 cumulative deaths by November 1, 2020.", "start_char_pos": 1391, "end_char_pos": 1492}], "sents_char_pos": [0, 80, 218, 391, 499, 588, 773, 968, 1067, 1243]} {"doc_id": "2006.05993", "revision_depth": "1", "before_revision": "Controller area networks (CANs ) are a broadcast protocol for real-time communication of critical vehicle subsystems. Manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary per make, model, and year. Without these mappings, the wealth of real-time vehicle information hidden in CAN packets is uninterpretable-- severely impeding vehicle-related research including CAN cybersecurity, after-market tuning, efficiency and performance monitoring, and fault diagnosis . Guided by the four-part CAN signal definition, we present CAN-D ( CAN Decoder ), a modular, four-step pipeline for identifying each signal's boundaries (start bit and length), endianness (byte ordering ), signedness (bit-to-integer encoding), and meaningful, physical interpretation (label, unit, scaling factors). En route to CAN-D, we provide a comprehensive review of the CAN signal reverse engineering research. All previous methods ignore endianness and signedness, rendering them simply incapable of decoding many standard CAN signal definitions. We formulate and provide an efficient solution to an optimization problem, allowing identification of the optimal set of signal boundaries and byte orderings. In addition, we provide two novel, state-of-the-art signal boundary classifiers (both superior to previous approaches in precision and recall ) and the first signedness classification algorithm , which exhibits >97 \\% F-score. Overall, CAN-D is the only solution with the potential to extract any CAN signal and is the state of the art. In evaluation on ten vehicles of different makes, CAN-D's average \\ell^1 error is 5 times better than all preceding methods and exhibits lower average error even when considering only signals that meet prior methods' assumptions. Finally, CAN-D is implemented in lightweight hardware allowing OBD-II plugin for real-time in-vehicle CAN decoding.%DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% \\\\%DIF > F-score. CAN-D is the only solution with the potential to extract any CAN signal. In evaluation on 10 vehicles, CAN-D's average \\ell^1 error is 5x better than all previous methods and exhibits lower ave. error, even when considering only signals that meet prior methods' assumptions. CAN-D is implemented in lightweight hardware, allowing for an OBD-II plugin for real-time in-vehicle CAN decoding.", "after_revision": "CANs are a broadcast protocol for real-time communication of critical vehicle subsystems. Original equipment manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary according to make, model, and year. Without these mappings, the wealth of real-time vehicle information hidden in the CAN packets is uninterpretable, impeding vehicle-related research . Guided by the 4-part CAN signal definition, we present CAN-D ( CAN-Decoder ), a modular, 4-step pipeline for identifying each signal's boundaries (start bit , length), endianness (byte order ), signedness (bit-to-integer encoding), and by leveraging diagnostic standards, augmenting a subset of the extracted signals with physical interpretation. We provide a comprehensive review of the CAN signal reverse engineering research. Previous methods ignore endianness and signedness, rendering them incapable of decoding many standard CAN signal definitions. Incorporating endianness grows the search space from 128 to 4.72E21 signal tokenizations and introduces a web of changing dependencies. We formulate, formally analyze, and provide an efficient solution to an optimization problem, allowing identification of the optimal set of signal boundaries and byte orderings. We provide two novel, state-of-the-art signal boundary classifiers-both superior to previous approaches in precision and recall in three different test scenarios-and the first signedness classification algorithm which exhibits a >97 %DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% \\\\%DIF > F-score. CAN-D is the only solution with the potential to extract any CAN signal. In evaluation on 10 vehicles, CAN-D's average \\ell^1 error is 5x better than all previous methods and exhibits lower ave. error, even when considering only signals that meet prior methods' assumptions. CAN-D is implemented in lightweight hardware, allowing for an OBD-II plugin for real-time in-vehicle CAN decoding.", "edit_actions": [{"type": "R", "before": "Controller area networks (CANs )", "after": "CANs", "start_char_pos": 0, "end_char_pos": 32}, {"type": "R", "before": "Manufacturers", "after": "Original equipment manufacturers", "start_char_pos": 118, "end_char_pos": 131}, {"type": "R", "before": "per", "after": "according to", "start_char_pos": 240, "end_char_pos": 243}, {"type": "A", "before": null, "after": "the", "start_char_pos": 345, "end_char_pos": 345}, {"type": "R", "before": "uninterpretable-- severely", "after": "uninterpretable,", "start_char_pos": 361, "end_char_pos": 387}, {"type": "D", "before": "including CAN cybersecurity, after-market tuning, efficiency and performance monitoring, and fault diagnosis", "after": null, "start_char_pos": 422, "end_char_pos": 530}, {"type": "R", "before": "four-part", "after": "4-part", "start_char_pos": 547, "end_char_pos": 556}, {"type": "R", "before": "CAN Decoder", "after": "CAN-Decoder", "start_char_pos": 599, "end_char_pos": 610}, {"type": "R", "before": "four-step", "after": "4-step", "start_char_pos": 625, "end_char_pos": 634}, {"type": "R", "before": "and", "after": ",", "start_char_pos": 696, "end_char_pos": 699}, {"type": "R", "before": "ordering", "after": "order", "start_char_pos": 726, "end_char_pos": 734}, {"type": "R", "before": "meaningful, physical interpretation (label, unit, scaling factors). En route to CAN-D, we", "after": "by leveraging diagnostic standards, augmenting a subset of the extracted signals with physical interpretation. We", "start_char_pos": 780, "end_char_pos": 869}, {"type": "R", "before": "All previous", "after": "Previous", "start_char_pos": 949, "end_char_pos": 961}, {"type": "D", "before": "simply", "after": null, "start_char_pos": 1019, "end_char_pos": 1025}, {"type": "R", "before": "We formulate", "after": "Incorporating endianness grows the search space from 128 to 4.72E21 signal tokenizations and introduces a web of changing dependencies. We formulate, formally analyze,", "start_char_pos": 1086, "end_char_pos": 1098}, {"type": "R", "before": "In addition, we", "after": "We", "start_char_pos": 1245, "end_char_pos": 1260}, {"type": "R", "before": "classifiers (both", "after": "classifiers-both", "start_char_pos": 1313, "end_char_pos": 1330}, {"type": "R", "before": ") and", "after": "in three different test scenarios-and", "start_char_pos": 1387, "end_char_pos": 1392}, {"type": "R", "before": ", which exhibits", "after": "which exhibits a", "start_char_pos": 1439, "end_char_pos": 1455}, {"type": "D", "before": "\\% F-score. Overall, CAN-D is the only solution with the potential to extract any CAN signal and is the state of the art. In evaluation on ten vehicles of different makes, CAN-D's average \\ell^1 error is 5 times better than all preceding methods and exhibits lower average error even when considering only signals that meet prior methods' assumptions. Finally, CAN-D is implemented in lightweight hardware allowing OBD-II plugin for real-time in-vehicle CAN decoding.", "after": null, "start_char_pos": 1460, "end_char_pos": 1927}], "sents_char_pos": [0, 117, 266, 290, 450, 847, 948, 1085, 1244, 1471, 1581, 1811, 1927, 1989, 2062, 2264]} {"doc_id": "2006.06052", "revision_depth": "1", "before_revision": "Ability to solve large sparse linear systems of equations is very important in modern numerical methods. Creating a solver with a user-friendly interface that can work in many specific scenarios is a challenging task . We describe the C++ programming techniques that can help in creating flexible and extensible programming interfaces for linear solvers . The approach is based on policy-based design and partial template specialization, and is implemented in the open source AMGCL library. Convenience for the user and efficiency is demonstrated on the example of accelerating a large-scale Stokes problemsolution with a Schur pressure correction preconditioner. The user may select algorithmic components of the solver by adjusting template parameters without any change to the codebase. It is also possible to switch to block values, or use mixed precision solution, which results in up to 4 times speedup, and reduces the memory footprint of the algorithm by about 50\\%.%DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% \\\\%DIF > . We evaluate both monolithic and composite preconditioning strategies for the 3 benchmark problems. The performance of the proposed solution is compared with a multithreaded direct Pardiso solver and a parallel iterative PETSc solver.", "after_revision": "The efficient solution of large sparse saddle point systems is very important in computational fluid mechanics. The discontinuous Galerkin finite element methods have become increasingly popular for incompressible flow problems but their application is limited due to high computational cost . We describe the C++ programming techniques that may help to accelerate linear solvers for such problems . The approach is based on the policy-based design pattern and partial template specialization, and is implemented in the open source AMGCL library. The efficiency is demonstrated with the example of accelerating an iterative solver of a discontinuous Galerkin finite element method for the Stokes problem. The implementation allows selecting algorithmic components of the solver by adjusting template parameters without any changes to the codebase. It is possible to switch to block values, or use a mixed precision solution, which results in up to 4 times speedup, and reduces the memory footprint of the algorithm by about %DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% 40\\\\%DIF > . We evaluate both monolithic and composite preconditioning strategies for the 3 benchmark problems. The performance of the proposed solution is compared with a multithreaded direct Pardiso solver and a parallel iterative PETSc solver.", "edit_actions": [{"type": "R", "before": "Ability to solve large sparse linear systems of equations", "after": "The efficient solution of large sparse saddle point systems", "start_char_pos": 0, "end_char_pos": 57}, {"type": "R", "before": "modern numerical methods. Creating a solver with a user-friendly interface that can work in many specific scenarios is a challenging task", "after": "computational fluid mechanics. The discontinuous Galerkin finite element methods have become increasingly popular for incompressible flow problems but their application is limited due to high computational cost", "start_char_pos": 79, "end_char_pos": 216}, {"type": "R", "before": "can help in creating flexible and extensible programming interfaces for linear solvers", "after": "may help to accelerate linear solvers for such problems", "start_char_pos": 267, "end_char_pos": 353}, {"type": "A", "before": null, "after": "the", "start_char_pos": 381, "end_char_pos": 381}, {"type": "A", "before": null, "after": "pattern", "start_char_pos": 402, "end_char_pos": 402}, {"type": "R", "before": "Convenience for the user and", "after": "The", "start_char_pos": 493, "end_char_pos": 521}, {"type": "R", "before": "on", "after": "with", "start_char_pos": 549, "end_char_pos": 551}, {"type": "R", "before": "a large-scale Stokes problemsolution with a Schur pressure correction preconditioner. The user may select", "after": "an iterative solver of a discontinuous Galerkin finite element method for the Stokes problem. The implementation allows selecting", "start_char_pos": 580, "end_char_pos": 685}, {"type": "R", "before": "change", "after": "changes", "start_char_pos": 768, "end_char_pos": 774}, {"type": "D", "before": "also", "after": null, "start_char_pos": 798, "end_char_pos": 802}, {"type": "A", "before": null, "after": "a", "start_char_pos": 846, "end_char_pos": 846}, {"type": "D", "before": "50\\%.", "after": null, "start_char_pos": 972, "end_char_pos": 977}, {"type": "A", "before": null, "after": "40", "start_char_pos": 1022, "end_char_pos": 1022}], "sents_char_pos": [0, 104, 218, 355, 492, 665, 791, 977, 1131]} {"doc_id": "2006.06321", "revision_depth": "1", "before_revision": "Intuitive user interfaces are indispensable to interact with human centric smart environments. In this paper, we propose a unified framework that recognizes both static and dynamic gestures, using simple RGB vision (without depth sensing). This feature makes it suitable for inexpensive human-machine interaction (HMI). We rely on a spatial attention-based strategy, which employs SaDNet, our proposed Static and Dynamic gestures Network . From the image of the human upper body, we estimate his/her depth, along with the region-of-interest around his/her hands. The Convolutional Neural Networks in SaDNet are fine-tuned on a background-substituted hand gestures dataset. They are utilized to detect 10 static gestures for each hand and to obtain hand image-embeddings from the last Fully Connected layer, which are subsequently fused with the augmented pose vector and then passed to stacked Long Short-Term Memory blocks. Thus, human-centered frame-wise information from the augmented pose vector and left/right hands image-embeddings are aggregated in time to predict the dynamic gestures of the performing person. In a number of experiments we show that the proposed approach surpasses the state-of-the-art results on large-scale Chalearn 2016 dataset. Moreover, we also transfer the knowledge learned through the proposed methodology to the Praxis gestures dataset, and the obtained results also outscore the state-of-the-art on this dataset.", "after_revision": "Intuitive user interfaces are indispensable to interact with the human centric smart environments. In this paper, we propose a unified framework that recognizes both static and dynamic gestures, using simple RGB vision (without depth sensing). This feature makes it suitable for inexpensive human-robot interaction in social or industrial settings. We employ a pose-driven spatial attention strategy, which guides our proposed Static and Dynamic gestures Network - StaDNet . From the image of the human upper body, we estimate his/her depth, along with the region-of-interest around his/her hands. The Convolutional Neural Network in StaDNet is fine-tuned on a background-substituted hand gestures dataset. It is utilized to detect 10 static gestures for each hand as well as to obtain the hand image-embeddings . These are subsequently fused with the augmented pose vector and then passed to the stacked Long Short-Term Memory blocks. Thus, human-centred frame-wise information from the augmented pose vector and from the left/right hands image-embeddings are aggregated in time to predict the dynamic gestures of the performing person. In a number of experiments , we show that the proposed approach surpasses the state-of-the-art results on the large-scale Chalearn 2016 dataset. Moreover, we transfer the knowledge learned through the proposed methodology to the Praxis gestures dataset, and the obtained results also outscore the state-of-the-art on this dataset.", "edit_actions": [{"type": "A", "before": null, "after": "the", "start_char_pos": 61, "end_char_pos": 61}, {"type": "R", "before": "human-machine interaction (HMI). We rely on a spatial attention-based", "after": "human-robot interaction in social or industrial settings. We employ a pose-driven spatial attention", "start_char_pos": 288, "end_char_pos": 357}, {"type": "R", "before": "employs SaDNet,", "after": "guides", "start_char_pos": 374, "end_char_pos": 389}, {"type": "A", "before": null, "after": "- StaDNet", "start_char_pos": 439, "end_char_pos": 439}, {"type": "R", "before": "Networks in SaDNet are", "after": "Network in StaDNet is", "start_char_pos": 590, "end_char_pos": 612}, {"type": "R", "before": "They are", "after": "It is", "start_char_pos": 675, "end_char_pos": 683}, {"type": "R", "before": "and to obtain", "after": "as well as to obtain the", "start_char_pos": 736, "end_char_pos": 749}, {"type": "R", "before": "from the last Fully Connected layer, which", "after": ". These", "start_char_pos": 772, "end_char_pos": 814}, {"type": "A", "before": null, "after": "the", "start_char_pos": 888, "end_char_pos": 888}, {"type": "R", "before": "human-centered", "after": "human-centred", "start_char_pos": 934, "end_char_pos": 948}, {"type": "A", "before": null, "after": "from the", "start_char_pos": 1007, "end_char_pos": 1007}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1150, "end_char_pos": 1150}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1228, "end_char_pos": 1228}, {"type": "D", "before": "also", "after": null, "start_char_pos": 1277, "end_char_pos": 1281}], "sents_char_pos": [0, 95, 240, 320, 441, 564, 674, 927, 1122, 1263]} {"doc_id": "2006.06435", "revision_depth": "1", "before_revision": "Medicine is moving from reacting to a disease to prepare personalised and precision paths to well being . The complex and multi level pathophysiological patterns of most diseases require a systemic medicine approach and are challenging current medical therapies. Computational medicine is a vibrant interdisciplinary field that could help moving from URLan-centered to a process-oriented or systemic medicine data analysis. The resulting Computational patient may require an international interdisciplinary effort, probably of larger scientific and technological interdisciplinarity than the human genome sequencing . When deployed, it will have a profound impact on how healthcare is delivered to patients. Here we present a Computational patient model that integrates, refine and extend recent specific mechanistic or phenomenological models of cardiovascular, RAS and diabetic processes. Our aim is twofold: analyse the modularity and composability of the models-building blocks of the Computational patient and to study the dynamical properties of well-being and disease states in a broader functional context. We present results from a number of experiments among which we characterise the dynamical impact of covid-19 and T2D diabetes on cardiovascular and inflammation conditions. We tested these experiments under exercise and meals and drug regimen . We report results showing the striking importance of transient dynamical responses to acute state conditions and we provide guidelines for system design principle of the inter-relationship between modules and components for systemic medicine. Finally this initial Computational Patient can be used as a toolbox for further modifications and extensions.", "after_revision": "Medicine is moving from a curative discipline to a preventative discipline relying on personalised and precise treatment plans . The complex and multi level pathophysiological patterns of most diseases require a systemic medicine approach and are challenging current medical therapies. On the other hand, computational medicine is a vibrant interdisciplinary field that could help move from URLan-centered approach to a process-oriented approach. The ideal computational patient would require an international interdisciplinary effort, of larger scientific and technological interdisciplinarity than the Human Genome Project . When deployed, such a patient would have a profound impact on how healthcare is delivered to patients. Here we present a computational patient model that integrates, refines and extends recent mechanistic or phenomenological models of cardiovascular, RAS and diabetic processes. Our aim is twofold: analyse the modularity and composability of the model-building blocks of the computational patient and to study the dynamical properties of well-being and disease states in a broader functional context. We present results from a number of experiments among which we characterise the dynamic impact of COVID-19 and type-2 diabetes (T2D) on cardiovascular and inflammation conditions. We tested these experiments under different exercise, meal and drug regimens . We report results showing the striking importance of transient dynamical responses to acute state conditions and we provide guidelines for system design principles for the inter-relationship between modules and components in systemic medicine. Finally this initial computational Patient can be used as a toolbox for further modifications and extensions.", "edit_actions": [{"type": "R", "before": "reacting to a disease to prepare personalised and precision paths to well being", "after": "a curative discipline to a preventative discipline relying on personalised and precise treatment plans", "start_char_pos": 24, "end_char_pos": 103}, {"type": "R", "before": "Computational", "after": "On the other hand, computational", "start_char_pos": 263, "end_char_pos": 276}, {"type": "R", "before": "moving", "after": "move", "start_char_pos": 339, "end_char_pos": 345}, {"type": "A", "before": null, "after": "approach", "start_char_pos": 366, "end_char_pos": 366}, {"type": "R", "before": "or systemic medicine data analysis. The resulting Computational patient may", "after": "approach. The ideal computational patient would", "start_char_pos": 389, "end_char_pos": 464}, {"type": "D", "before": "probably", "after": null, "start_char_pos": 516, "end_char_pos": 524}, {"type": "R", "before": "human genome sequencing", "after": "Human Genome Project", "start_char_pos": 593, "end_char_pos": 616}, {"type": "R", "before": "it will", "after": "such a patient would", "start_char_pos": 634, "end_char_pos": 641}, {"type": "R", "before": "Computational", "after": "computational", "start_char_pos": 727, "end_char_pos": 740}, {"type": "R", "before": "refine and extend recent specific", "after": "refines and extends recent", "start_char_pos": 772, "end_char_pos": 805}, {"type": "R", "before": "models-building", "after": "model-building", "start_char_pos": 960, "end_char_pos": 975}, {"type": "R", "before": "Computational", "after": "computational", "start_char_pos": 990, "end_char_pos": 1003}, {"type": "R", "before": "dynamical impact of covid-19 and T2D diabetes", "after": "dynamic impact of COVID-19 and type-2 diabetes (T2D)", "start_char_pos": 1196, "end_char_pos": 1241}, {"type": "R", "before": "exercise and meals and drug regimen", "after": "different exercise, meal and drug regimens", "start_char_pos": 1323, "end_char_pos": 1358}, {"type": "R", "before": "principle of", "after": "principles for", "start_char_pos": 1514, "end_char_pos": 1526}, {"type": "R", "before": "for", "after": "in", "start_char_pos": 1581, "end_char_pos": 1584}, {"type": "R", "before": "Computational", "after": "computational", "start_char_pos": 1625, "end_char_pos": 1638}], "sents_char_pos": [0, 105, 262, 424, 618, 708, 891, 1115, 1288, 1360, 1603]} {"doc_id": "2006.07568", "revision_depth": "1", "before_revision": "In this article, we consider the path-following method based on the perturbed Newton flow with the new trust-region time-stepping scheme for the standard linear programming problem. For the problem with deficient rank matrix and the noise right-hand-side vector , we also give the pre-processing method based on the singular value decomposition . Then, we analyze the global convergence of the new method when the initial point is strictly primal-dual feasible. Finally, we test the new method for some problems with deficient rank matrices, and compare it with other popular interior-point methods such as the path-following method (the subroutine pathfollow.m coded by M.~C. Ferris \\mbox{%DIFAUXCMD \\cite{Gonzaga1992,FMW2007}\\hspace{0pt}%DIFAUXCMD ) and Mehrotra's predictor-corrector algorithm (} the built-in subroutine linprog.m of the MATLAB environment , which was implemented by S. Mehrotra and Y. Zhang \\mbox{%DIFAUXCMD \\cite{MATLAB,Mehrotra1992,Zhang1998}\\hspace{0pt}%DIFAUXCMD ). } Numerical results show that the new method is more robust than those methods for the large-scale deficient-rank problems without sacrificing its computational efficiency .", "after_revision": "In this article, we consider the primal-dual path-following method and the trust-region strategy for the standard linear programming problem. For the deficient rank problem with the small noisy data , we also give the pre-processing method based on the QR decomposition with column pivoting . Then, we prove the global convergence of the new method when the initial point is strictly primal-dual feasible. Finally, for some deficient rank problems with or without the small noisy data from the NETLIB collection, we compare it with other two popular interior-point methods , i.e. the subroutine pathfollow.m }\\hspace{0pt}%DIFAUXCMD ) and Mehrotra's predictor-corrector algorithm (} and the built-in subroutine linprog.m of the MATLAB environment }\\hspace{0pt}%DIFAUXCMD ). } . Numerical results show that the new method is more robust than the other two methods for the deficient rank problem with the small noise data .", "edit_actions": [{"type": "A", "before": null, "after": "primal-dual", "start_char_pos": 33, "end_char_pos": 33}, {"type": "R", "before": "based on the perturbed Newton flow with the new", "after": "and the", "start_char_pos": 56, "end_char_pos": 103}, {"type": "R", "before": "time-stepping scheme", "after": "strategy", "start_char_pos": 117, "end_char_pos": 137}, {"type": "R", "before": "problem with deficient rank matrix and the noise right-hand-side vector", "after": "deficient rank problem with the small noisy data", "start_char_pos": 191, "end_char_pos": 262}, {"type": "R", "before": "singular value decomposition", "after": "QR decomposition with column pivoting", "start_char_pos": 317, "end_char_pos": 345}, {"type": "R", "before": "analyze", "after": "prove", "start_char_pos": 357, "end_char_pos": 364}, {"type": "R", "before": "we test the new method for some problems with deficient rank matrices, and", "after": "for some deficient rank problems with or without the small noisy data from the NETLIB collection, we", "start_char_pos": 472, "end_char_pos": 546}, {"type": "A", "before": null, "after": "two", "start_char_pos": 569, "end_char_pos": 569}, {"type": "R", "before": "such as the path-following method (the", "after": ", i.e. the", "start_char_pos": 601, "end_char_pos": 639}, {"type": "D", "before": "coded by M.~C. Ferris \\mbox{%DIFAUXCMD \\cite{Gonzaga1992,FMW2007", "after": null, "start_char_pos": 664, "end_char_pos": 728}, {"type": "A", "before": null, "after": "and", "start_char_pos": 802, "end_char_pos": 802}, {"type": "D", "before": ", which was implemented by S. Mehrotra and Y. Zhang \\mbox{%DIFAUXCMD \\cite{MATLAB,Mehrotra1992,Zhang1998", "after": null, "start_char_pos": 863, "end_char_pos": 967}, {"type": "A", "before": null, "after": ".", "start_char_pos": 996, "end_char_pos": 996}, {"type": "R", "before": "those", "after": "the other two", "start_char_pos": 1060, "end_char_pos": 1065}, {"type": "R", "before": "large-scale deficient-rank problems without sacrificing its computational efficiency", "after": "deficient rank problem with the small noise data", "start_char_pos": 1082, "end_char_pos": 1166}], "sents_char_pos": [0, 182, 347, 462, 678]} {"doc_id": "2006.07906", "revision_depth": "1", "before_revision": "Several social interventions (e.g., suicide and HIV prevention ) leverage social network information to maximize outreach. Algorithmic influence maximization techniques have been proposed to aid with the choice of influencers (or peer leaders) in such interventions. Traditional algorithms for influence maximization have not been designed with social interventions in mind. As a result, they may disproportionately exclude minority communities from the benefits of the intervention. This has motivated research on fair influence maximization. Existing techniques require committing to a single domain-specific fairness measure. This makes it hard for a decision maker to meaningfully compare these notions and their resulting trade-offs across different applications. We address these shortcomings by extending the principles of cardinal welfare to the influence maximization setting, which is underlain by complex connections between members of different communities. We generalize the theory regarding these principles and show under what circumstances these principles can be satisfied by a welfare function. We then propose a family of welfare functions that are governed by a single inequity aversion parameter which allows a decision maker to study task-dependent trade-offs between fairness and total influence and effectively trade off quantities like influence gap by varying this parameter. We use these welfare functions as a fairness notion to rule out undesirable allocations. We show that the resulting optimization problem is monotone and submodular and can be solved with optimality guarantees. Finally, we carry out a detailed experimental analysis on synthetic and real social networks and should that high welfare can be achieved without sacrificing the total influence significantly. Interestingly we can show there exists welfare functions that empirically satisfy all of the principles .", "after_revision": "Several behavioral, social, and public health interventions, such as suicide/HIV prevention or community preparedness against natural disasters, leverage social network information to maximize outreach. Algorithmic influence maximization techniques have been proposed to aid with the choice of \"peer leaders\" or \"influencers\" in such interventions. Yet, traditional algorithms for influence maximization have not been designed with these interventions in mind. As a result, they may disproportionately exclude minority communities from the benefits of the intervention. This has motivated research on fair influence maximization. Existing techniques come with two major drawbacks. First, they require committing to a single fairness measure. Second, these measures are typically imposed as strict constraints leading to undesirable properties such as wastage of resources. To address these shortcomings , we provide a principled characterization of the properties that a fair influence maximization algorithm should satisfy. In particular, we propose a framework based on social welfare theory, wherein the cardinal utilities derived by each community are aggregated using the isoelastic social welfare functions. Under this framework, the trade-off between fairness and efficiency can be controlled by a single inequality aversion design parameter. We then show under what circumstances our proposed principles can be satisfied by a welfare function. The resulting optimization problem is monotone and submodular and can be solved efficiently with optimality guarantees. Our framework encompasses as special cases leximin and proportional fairness. Extensive experiments on synthetic and real world datasets including a case study on landslide risk management demonstrate the efficacy of the proposed framework .", "edit_actions": [{"type": "R", "before": "social interventions (e.g., suicide and HIV prevention )", "after": "behavioral, social, and public health interventions, such as suicide/HIV prevention or community preparedness against natural disasters,", "start_char_pos": 8, "end_char_pos": 64}, {"type": "R", "before": "influencers (or peer leaders)", "after": "\"peer leaders\" or \"influencers\"", "start_char_pos": 214, "end_char_pos": 243}, {"type": "R", "before": "Traditional", "after": "Yet, traditional", "start_char_pos": 267, "end_char_pos": 278}, {"type": "R", "before": "social", "after": "these", "start_char_pos": 345, "end_char_pos": 351}, {"type": "A", "before": null, "after": "come with two major drawbacks. First, they", "start_char_pos": 564, "end_char_pos": 564}, {"type": "D", "before": "domain-specific", "after": null, "start_char_pos": 596, "end_char_pos": 611}, {"type": "R", "before": "This makes it hard for a decision maker to meaningfully compare these notions and their resulting trade-offs across different applications. We", "after": "Second, these measures are typically imposed as strict constraints leading to undesirable properties such as wastage of resources. To", "start_char_pos": 630, "end_char_pos": 772}, {"type": "R", "before": "by extending the principles of cardinal welfare to the influence maximization setting, which is underlain by complex connections between members of different communities. We generalize the theory regarding these principles and", "after": ", we provide a principled characterization of the properties that a fair influence maximization algorithm should satisfy. In particular, we propose a framework based on social welfare theory, wherein the cardinal utilities derived by each community are aggregated using the isoelastic social welfare functions. Under this framework, the trade-off between fairness and efficiency can be controlled by a single inequality aversion design parameter. We then", "start_char_pos": 800, "end_char_pos": 1026}, {"type": "R", "before": "these", "after": "our proposed", "start_char_pos": 1057, "end_char_pos": 1062}, {"type": "R", "before": "We then propose a family of welfare functions that are governed by a single inequity aversion parameter which allows a decision maker to study task-dependent trade-offs between fairness and total influence and effectively trade off quantities like influence gap by varying this parameter. We use these welfare functions as a fairness notion to rule out undesirable allocations. We show that the", "after": "The", "start_char_pos": 1114, "end_char_pos": 1508}, {"type": "A", "before": null, "after": "efficiently", "start_char_pos": 1585, "end_char_pos": 1585}, {"type": "R", "before": "Finally, we carry out a detailed experimental analysis", "after": "Our framework encompasses as special cases leximin and proportional fairness. Extensive experiments", "start_char_pos": 1614, "end_char_pos": 1668}, {"type": "R", "before": "social networks and should that high welfare can be achieved without sacrificing the total influence significantly. Interestingly we can show there exists welfare functions that empirically satisfy all of the principles", "after": "world datasets including a case study on landslide risk management demonstrate the efficacy of the proposed framework", "start_char_pos": 1691, "end_char_pos": 1910}], "sents_char_pos": [0, 122, 266, 374, 483, 543, 629, 769, 970, 1113, 1402, 1491, 1613, 1806]} {"doc_id": "2006.09542", "revision_depth": "1", "before_revision": "Groups of enterprises can guarantee each other and form complex networks to obtain loans from commercial banks. During economic slowdown period, the corporate default may spread like a virus and lead to large-scale defaults or even systemic financial crises. To help the financial regulatory authorities and banks manage the risk brought by the networked loans, we identified the default contagion risk as a pivotal issue to take preventive measures, and develop iConVis, an interactive visual analysis tool , to facilitate the closed-loop analysis process. A novel financial metric - contagion effectis formulated to quantify the infectious consequence of the guarantee chains in the network. Based on the metric, we design and implement a serial of novel and coordinated views to address the analysis the financial problem . Experts evaluated the system using real-world financial data. The proposed approach grants them the ability to overturn the previous ad hoc analysis methodology and extends the coverage of the conventional Capital Accord in the banking industry.", "after_revision": "Groups of enterprises can serve as guarantees for one another and form complex networks when obtaining loans from commercial banks. During economic slowdowns, corporate default may spread like a virus and lead to large-scale defaults or even systemic financial crises. To help financial regulatory authorities and banks manage the risk associated with networked loans, we identified the default contagion risk , a pivotal issue in developing preventive measures, and established iConVis, an interactive visual analysis tool that facilitates the closed-loop analysis process. A novel financial metric , the contagion effect, was formulated to quantify the infectious consequences of guarantee chains in this type of network. Based on this metric, we designed and implement a series of novel and coordinated views that address the analysis of financial problems . Experts evaluated the system using real-world financial data. The proposed approach grants practitioners the ability to avoid previous ad hoc analysis methodologies and extend coverage of the conventional Capital Accord to the banking industry.", "edit_actions": [{"type": "R", "before": "guarantee each other", "after": "serve as guarantees for one another", "start_char_pos": 26, "end_char_pos": 46}, {"type": "R", "before": "to obtain", "after": "when obtaining", "start_char_pos": 73, "end_char_pos": 82}, {"type": "R", "before": "slowdown period, the", "after": "slowdowns,", "start_char_pos": 128, "end_char_pos": 148}, {"type": "D", "before": "the", "after": null, "start_char_pos": 267, "end_char_pos": 270}, {"type": "R", "before": "brought by the", "after": "associated with", "start_char_pos": 330, "end_char_pos": 344}, {"type": "R", "before": "as", "after": ",", "start_char_pos": 403, "end_char_pos": 405}, {"type": "R", "before": "to take", "after": "in developing", "start_char_pos": 422, "end_char_pos": 429}, {"type": "R", "before": "develop", "after": "established", "start_char_pos": 455, "end_char_pos": 462}, {"type": "R", "before": ", to facilitate", "after": "that facilitates", "start_char_pos": 508, "end_char_pos": 523}, {"type": "R", "before": "- contagion effectis", "after": ", the contagion effect, was", "start_char_pos": 583, "end_char_pos": 603}, {"type": "R", "before": "consequence of the", "after": "consequences of", "start_char_pos": 642, "end_char_pos": 660}, {"type": "R", "before": "the", "after": "this type of", "start_char_pos": 681, "end_char_pos": 684}, {"type": "R", "before": "the", "after": "this", "start_char_pos": 703, "end_char_pos": 706}, {"type": "R", "before": "design", "after": "designed", "start_char_pos": 718, "end_char_pos": 724}, {"type": "R", "before": "serial", "after": "series", "start_char_pos": 741, "end_char_pos": 747}, {"type": "R", "before": "to", "after": "that", "start_char_pos": 779, "end_char_pos": 781}, {"type": "R", "before": "the financial problem", "after": "of financial problems", "start_char_pos": 803, "end_char_pos": 824}, {"type": "R", "before": "them", "after": "practitioners", "start_char_pos": 918, "end_char_pos": 922}, {"type": "R", "before": "overturn the", "after": "avoid", "start_char_pos": 938, "end_char_pos": 950}, {"type": "R", "before": "methodology and extends the", "after": "methodologies and extend", "start_char_pos": 976, "end_char_pos": 1003}, {"type": "R", "before": "in", "after": "to", "start_char_pos": 1048, "end_char_pos": 1050}], "sents_char_pos": [0, 111, 258, 557, 693, 888]} {"doc_id": "2006.09627", "revision_depth": "1", "before_revision": "In low-resource natural language processing (NLP), the key problem is a lack of training data in the target language . Cross-lingual methods have had notable success in addressing this concern , but in certain common circumstances, such as insufficient pre-training corpora or languages far from the source language, their performance suffers. In this work we propose an alternative approach to building low-resource Named Entity Recognition (NER) models using \" non-speaker \" (NS) annotations, provided by annotators with no prior experience in the target language. We recruit 30 participants to annotate unfamiliar languages in a carefully controlled annotation experiment , using Indonesian, Russian, and Hindi as target languages. Our results show that use of non-speaker annotators produces results that approach or match performance of fluent speakers. NS results are also consistently on par or better than cross-lingual methods built on modern contextual representations, and have the potential to further outperform with additional effort. We conclude with observations of common annotation practices and recommendations for maximizing non-speaker annotator performance.", "after_revision": "In low-resource natural language processing (NLP), the key problems are a lack of target language training data, and a lack of native speakers to create it . Cross-lingual methods have had notable success in addressing these concerns , but in certain common circumstances, such as insufficient pre-training corpora or languages far from the source language, their performance suffers. In this work we propose a complementary approach to building low-resource Named Entity Recognition (NER) models using `` non-speaker '' (NS) annotations, provided by annotators with no prior experience in the target language. We recruit 30 participants in a carefully controlled annotation experiment with Indonesian, Russian, and Hindi . We show that use of NS annotators produces results that are consistently on par or better than cross-lingual methods built on modern contextual representations, and have the potential to outperform with additional effort. We conclude with observations of common annotation patterns and recommended implementation practices, and motivate how NS annotations can be used in addition to prior methods for improved performance. For more details, URL/page/publication_view/941", "edit_actions": [{"type": "R", "before": "problem is", "after": "problems are", "start_char_pos": 59, "end_char_pos": 69}, {"type": "R", "before": "training data in the target language", "after": "target language training data, and a lack of native speakers to create it", "start_char_pos": 80, "end_char_pos": 116}, {"type": "R", "before": "this concern", "after": "these concerns", "start_char_pos": 180, "end_char_pos": 192}, {"type": "R", "before": "an alternative", "after": "a complementary", "start_char_pos": 368, "end_char_pos": 382}, {"type": "R", "before": "\"", "after": "``", "start_char_pos": 461, "end_char_pos": 462}, {"type": "R", "before": "\"", "after": "''", "start_char_pos": 475, "end_char_pos": 476}, {"type": "D", "before": "to annotate unfamiliar languages", "after": null, "start_char_pos": 594, "end_char_pos": 626}, {"type": "R", "before": ", using", "after": "with", "start_char_pos": 675, "end_char_pos": 682}, {"type": "R", "before": "as target languages. Our results", "after": ". We", "start_char_pos": 714, "end_char_pos": 746}, {"type": "R", "before": "non-speaker", "after": "NS", "start_char_pos": 764, "end_char_pos": 775}, {"type": "R", "before": "approach or match performance of fluent speakers. NS results are also", "after": "are", "start_char_pos": 809, "end_char_pos": 878}, {"type": "D", "before": "further", "after": null, "start_char_pos": 1006, "end_char_pos": 1013}, {"type": "R", "before": "practices and recommendations for maximizing non-speaker annotator performance.", "after": "patterns and recommended implementation practices, and motivate how NS annotations can be used in addition to prior methods for improved performance. For more details, URL/page/publication_view/941", "start_char_pos": 1100, "end_char_pos": 1179}], "sents_char_pos": [0, 118, 343, 566, 734, 858, 1048]} {"doc_id": "2006.12212", "revision_depth": "2", "before_revision": "Recent work showed that the initial COVID-19 data from China followed a subexponential power-law increase in the number of confirmed cases. This was attributed to a combination of effective containment and mitigation measures employed as well as behaviorial changes by the population. In view of this , we performed a Monte Carlo random walk study to better understand proximity-based infectious disease spread, particularly under restrictions. Our model is found to be rather robust and reproduces the observed power-law growth without relying on any external parameters. Three\\langle \\rangle growth regimes (quadratic, power-law and exponential) emerge naturally from our simulations. These\\langle \\rangle\\lesssim \\langle \\rangle results suggest that the early containment of the disease within China was close to optimal and could not have been significantly improved upon . We show that reasonable agreement with other data can be attained by incorporating small-world-like connections in the simulations. The prescribed model and its generalizations might be useful for future strategies in the midst of the present pandemic .", "after_revision": "Recent analysis of COVID-19 data from China showed that the number of confirmed cases followed a subexponential power-law increase , with a growth exponent of around 2.2. The power-law behavior was attributed to a combination of effective containment and mitigation measures employed as well as behavioral changes by the population. In this work, we report a random walk Monte Carlo simulation study of proximity-based infection spread. Social distancing is incorporated in the simulations through a single parameter, the size of each step in the random walk process. The step size l is taken to be a multiple of\\langle r\\rangle, which is the average separation between individuals. Three temporal growth regimes (quadratic, intermediate power-law and exponential) are shown to emerge naturally from our simulations. For l =\\langle r\\rangle, we get intermediate power-law growth exponents that are in general agreement with available data from China. On the other hand, we obtain a quadratic growth for smaller step sizes l\\lesssim \\langle r\\rangle/2 , while for large l the growth is found to be exponential. Together with available data, these results suggest that the early containment of the disease within China was close to optimal . We further performed a comparative case study of data from three other countries, India, Brazil and South Africa . We show that reasonable agreement with these data can be obtained by incorporating small-world-like connections in our simulations .", "edit_actions": [{"type": "R", "before": "work showed that the initial", "after": "analysis of", "start_char_pos": 7, "end_char_pos": 35}, {"type": "A", "before": null, "after": "showed that the number of confirmed cases", "start_char_pos": 61, "end_char_pos": 61}, {"type": "R", "before": "in the number of confirmed cases. This", "after": ", with a growth exponent of around 2.2. The power-law behavior", "start_char_pos": 107, "end_char_pos": 145}, {"type": "R", "before": "behaviorial", "after": "behavioral", "start_char_pos": 247, "end_char_pos": 258}, {"type": "R", "before": "view of this , we performed a Monte Carlo random walk study to better understand", "after": "this work, we report a random walk Monte Carlo simulation study of", "start_char_pos": 289, "end_char_pos": 369}, {"type": "R", "before": "infectious disease spread, particularly under restrictions. Our model is found to be rather robust and reproduces the observed power-law growth without relying on any external parameters. Three", "after": "infection spread. Social distancing is incorporated in the simulations through a single parameter, the size of each step in the random walk process. The step size l is taken to be a multiple of", "start_char_pos": 386, "end_char_pos": 579}, {"type": "A", "before": null, "after": "r", "start_char_pos": 587, "end_char_pos": 587}, {"type": "A", "before": null, "after": ", which is the average separation between individuals. Three temporal", "start_char_pos": 594, "end_char_pos": 594}, {"type": "A", "before": null, "after": "intermediate", "start_char_pos": 622, "end_char_pos": 622}, {"type": "A", "before": null, "after": "are shown to", "start_char_pos": 650, "end_char_pos": 650}, {"type": "R", "before": "These", "after": "For l =", "start_char_pos": 690, "end_char_pos": 695}, {"type": "A", "before": null, "after": "r", "start_char_pos": 703, "end_char_pos": 703}, {"type": "A", "before": null, "after": ", we get intermediate power-law growth exponents that are in general agreement with available data from China. On the other hand, we obtain a quadratic growth for smaller step sizes l", "start_char_pos": 710, "end_char_pos": 710}, {"type": "A", "before": null, "after": "r", "start_char_pos": 727, "end_char_pos": 727}, {"type": "A", "before": null, "after": "/2 , while for large l the growth is found to be exponential. Together with available data, these", "start_char_pos": 734, "end_char_pos": 734}, {"type": "R", "before": "and could not have been significantly improved upon", "after": ". We further performed a comparative case study of data from three other countries, India, Brazil and South Africa", "start_char_pos": 827, "end_char_pos": 878}, {"type": "R", "before": "other", "after": "these", "start_char_pos": 920, "end_char_pos": 925}, {"type": "R", "before": "attained", "after": "obtained", "start_char_pos": 938, "end_char_pos": 946}, {"type": "R", "before": "the simulations. The prescribed model and its generalizations might be useful for future strategies in the midst of the present pandemic", "after": "our simulations", "start_char_pos": 996, "end_char_pos": 1132}], "sents_char_pos": [0, 140, 285, 445, 573, 689, 880, 1012]} {"doc_id": "2006.12231", "revision_depth": "1", "before_revision": "A new network with super approximation power is introduced. This network is built with Floor (\\lfloor x\\rfloor) and ReLU (\\max\\{0,x\\}) activation functions and hence we call such networks as Floor-ReLU networks. It is shown by construction^+ and L\\inN^+,}} that Floor-ReLU networks with width \\max\\{d,\\, 5N+13\\} and depth 64dL+3 can pointwise approximate a Lipschitz continuous } function f on [0,1]^d with an exponential approximation rate 3 \\mu\\sqrt{d\\,N} ^{- \\sqrt{L}}, where \\mu is the Lipschitz constantof f. { More generally for an arbitrary continuous function f on [0,1]^d with a modulus of continuity \\omega_f(\\cdot), the constructive approximation rate is \\omega_f(\\sqrt{d}\\,N^{-\\sqrt{L}})+2\\omega_f(\\sqrt{d}){N^{-\\sqrt{L}}}. As a consequence, this new network overcomes the curse of dimensionality in approximation power since this approximation order is\\le } essentially \\sqrt{d} times a function of N and L independent of d .", "after_revision": "A new network with super approximation power is introduced. This network is built with Floor (\\lfloor x\\rfloor) or ReLU (\\max\\{0,x\\}) activation function in each neuron and hence we call such networks as Floor-ReLU networks. For any hyper-parameters N\\in\\mathbb{N^+ and L\\inN^+,}} it is shown that Floor-ReLU networks with width \\max\\{d,\\, 5N+13\\} and depth 64dL+3 can uniformly approximate a H \\\"o}lder function f on [0,1]^d with an approximation rate 3 \\,N} \\lambda d^{\\alpha/2 ^{- \\alpha \\sqrt{L}}, where \\alpha \\in(0,1 and \\lambda are the H{\\\"o lder order and constant, respectively. More generally for an arbitrary continuous function f on [0,1]^d with a modulus of continuity \\omega_f(\\cdot), the constructive approximation rate is \\omega_f(\\sqrt{d}\\,N^{-\\sqrt{L}})+2\\omega_f(\\sqrt{d}){N^{-\\sqrt{L}}}. As a consequence, this new class of networks overcome the curse of dimensionality in approximation power when the variation of \\omega_f(r) as r\\rightarrow 0 is moderate (e.g., \\omega_f(r)\\le r^\\alpha for H \\\"o}lder continuous functions), since the major term to be concerned in our approximation rate is essentially \\sqrt{d} times a function of N and L independent of d within the modulus of continuity.", "edit_actions": [{"type": "R", "before": "and", "after": "or", "start_char_pos": 112, "end_char_pos": 115}, {"type": "R", "before": "functions", "after": "function in each neuron", "start_char_pos": 146, "end_char_pos": 155}, {"type": "R", "before": "It is shown by construction", "after": "For any hyper-parameters N\\in\\mathbb{N", "start_char_pos": 212, "end_char_pos": 239}, {"type": "A", "before": null, "after": "it is shown", "start_char_pos": 257, "end_char_pos": 257}, {"type": "R", "before": "pointwise approximate a Lipschitz continuous", "after": "uniformly approximate a H", "start_char_pos": 334, "end_char_pos": 378}, {"type": "A", "before": null, "after": "\\\"o", "start_char_pos": 379, "end_char_pos": 379}, {"type": "A", "before": null, "after": "lder", "start_char_pos": 380, "end_char_pos": 380}, {"type": "D", "before": "exponential", "after": null, "start_char_pos": 411, "end_char_pos": 422}, {"type": "D", "before": "\\mu\\sqrt{d", "after": null, "start_char_pos": 444, "end_char_pos": 454}, {"type": "A", "before": null, "after": "\\lambda d^{\\alpha/2", "start_char_pos": 459, "end_char_pos": 459}, {"type": "A", "before": null, "after": "\\alpha", "start_char_pos": 464, "end_char_pos": 464}, {"type": "R", "before": "\\mu is the Lipschitz constantof f.", "after": "\\alpha \\in(0,1", "start_char_pos": 482, "end_char_pos": 516}, {"type": "A", "before": null, "after": "and \\lambda are the H", "start_char_pos": 517, "end_char_pos": 517}, {"type": "A", "before": null, "after": "\\\"o", "start_char_pos": 518, "end_char_pos": 518}, {"type": "A", "before": null, "after": "lder order and constant, respectively.", "start_char_pos": 519, "end_char_pos": 519}, {"type": "R", "before": "network overcomes", "after": "class of networks", "start_char_pos": 767, "end_char_pos": 784}, {"type": "A", "before": null, "after": "overcome", "start_char_pos": 785, "end_char_pos": 785}, {"type": "R", "before": "since this approximation order is", "after": "when the variation of \\omega_f(r) as r\\rightarrow 0 is moderate (e.g., \\omega_f(r)", "start_char_pos": 837, "end_char_pos": 870}, {"type": "A", "before": null, "after": "r^\\alpha for H", "start_char_pos": 874, "end_char_pos": 874}, {"type": "A", "before": null, "after": "\\\"o", "start_char_pos": 875, "end_char_pos": 875}, {"type": "A", "before": null, "after": "lder continuous functions), since the major term to be concerned in our approximation rate is", "start_char_pos": 876, "end_char_pos": 876}, {"type": "R", "before": ".", "after": "within the modulus of continuity.", "start_char_pos": 943, "end_char_pos": 944}], "sents_char_pos": [0, 59, 211, 254, 739]} {"doc_id": "2006.13844", "revision_depth": "1", "before_revision": "In this paper, we focus on structure-preserving model order reduction (SPMOR) of the second-order system using the Iterative Rational Krylov Algorithm (IRKA). In general, the standard IRKA can be used to the second-order structure system by converting the system into an equivalent first-order form . In this case, the reduced model can not preserve the structure of the second-order form which is however necessary for further manipulation. Here we develop IRKA based algorithm which enables us to generate a reduced second-order system without explicitly converting the system into a first-order form. A challenging task in IRKA is to select a set of better interpolation points and the tangential directions . To overcome these problems, this paper discusses how to select a set of good interpolation points and the tangential directions by an internal formulation. Also, this paper talks out the \\mathcal{H system. The theoretical results are experimented by applying them to several sets of data of large-scale dynamical systems. Numerical results are discussed to show the applicability and efficiency of the proposed techniques .", "after_revision": "In this paper, we focus on the efficient techniques to estimate the \\mathcal{H (SPMOR) of the second-order systems using the Iterative Rational Krylov Algorithm (IRKA). In general, the classical IRKA can be applied to the second-order system by converting it into an equivalent first-order form and get the reduced model in a first-order form . In this case, the reduced model can not preserve the structure of the second-order system which is however necessary for further manipulation. Here we develop IRKA based algorithms that enable us to generate approximate reduced second-order systems without explicitly converting the systems into a first-order form. On the other hand, there are very challenging tasks to find reduced-order form of a large-scale system with a minimized \\mathcal{H . To overcome these problems, this paper discusses competent techniques to determine the optimal \\mathcal{H system. The efficiency and applicability of the proposed techniques are validated by applying them to several large-scale dynamical systems. The computation is done numerically and the achieved results are discussed in both tabular and graphical approaches .", "edit_actions": [{"type": "R", "before": "structure-preserving model order reduction", "after": "the efficient techniques to estimate the \\mathcal{H", "start_char_pos": 27, "end_char_pos": 69}, {"type": "R", "before": "system", "after": "systems", "start_char_pos": 98, "end_char_pos": 104}, {"type": "R", "before": "standard", "after": "classical", "start_char_pos": 175, "end_char_pos": 183}, {"type": "R", "before": "used", "after": "applied", "start_char_pos": 196, "end_char_pos": 200}, {"type": "D", "before": "structure", "after": null, "start_char_pos": 221, "end_char_pos": 230}, {"type": "R", "before": "the system", "after": "it", "start_char_pos": 252, "end_char_pos": 262}, {"type": "A", "before": null, "after": "and get the reduced model in a first-order form", "start_char_pos": 299, "end_char_pos": 299}, {"type": "R", "before": "form", "after": "system", "start_char_pos": 385, "end_char_pos": 389}, {"type": "R", "before": "algorithm which enables", "after": "algorithms that enable", "start_char_pos": 470, "end_char_pos": 493}, {"type": "R", "before": "a", "after": "approximate", "start_char_pos": 509, "end_char_pos": 510}, {"type": "R", "before": "system", "after": "systems", "start_char_pos": 532, "end_char_pos": 538}, {"type": "R", "before": "system", "after": "systems", "start_char_pos": 573, "end_char_pos": 579}, {"type": "R", "before": "A challenging task in IRKA is to select a set of better interpolation points and the tangential directions", "after": "On the other hand, there are very challenging tasks to find reduced-order form of a large-scale system with a minimized \\mathcal{H", "start_char_pos": 605, "end_char_pos": 711}, {"type": "R", "before": "how to select a set of good interpolation points and the tangential directions by an internal formulation. Also, this paper talks out the \\mathcal{H", "after": "competent techniques to determine the optimal \\mathcal{H", "start_char_pos": 763, "end_char_pos": 911}, {"type": "R", "before": "theoretical results are experimented", "after": "efficiency and applicability of the proposed techniques are validated", "start_char_pos": 924, "end_char_pos": 960}, {"type": "D", "before": "sets of data of", "after": null, "start_char_pos": 989, "end_char_pos": 1004}, {"type": "R", "before": "Numerical", "after": "The computation is done numerically and the achieved", "start_char_pos": 1036, "end_char_pos": 1045}, {"type": "R", "before": "to show the applicability and efficiency of the proposed techniques", "after": "in both tabular and graphical approaches", "start_char_pos": 1068, "end_char_pos": 1135}], "sents_char_pos": [0, 158, 301, 442, 604, 713, 869, 919, 1035]} {"doc_id": "2006.13844", "revision_depth": "2", "before_revision": "In this paper , we focus on the efficient techniques to estimate the H_2 optimal Structure-Preserving Model Order Reduction (SPMOR) of the second-order systems using the Iterative Rational Krylov Algorithm (IRKA). In general , the classical IRKA can be applied to the second-order system by converting it into an equivalent first-order form and get the reduced model in a first-order form. In this case, the reduced model can not preserve the structure of the second-order system which is however necessary for further manipulation. Here we develop IRKA based algorithms that enable us to generate approximate reduced second-order systems without explicitly converting the systems into a first-order form . On the other hand, there are very challenging tasks to find reduced-order form of a large-scale system with a minimized \\mathcal{H}_2 error norm and attain the rapid rate of convergence. To overcome these problems, this paper discusses competent techniques to determine the optimal \\mathcal{H}_2 error norm efficiently for the second-order system. The efficiency and applicability of the proposed techniques are validated by applying them to several large-scale dynamical systems . The computation is done numerically and the achieved results are discussed in both tabular and graphical approaches.", "after_revision": "This paper focuses on exploring efficient ways to find H_2 optimal Structure-Preserving Model Order Reduction (SPMOR) of the second-order systems via interpolatory projection-based method Iterative Rational Krylov Algorithm (IRKA). To get the reduced models of the second-order systems , the classical IRKA deals with the equivalent first-order converted forms and estimates the first-order reduced models. The drawbacks of that of the technique are failure of structure preservation and abolishing the properties of the original models, which are the key factors for some of the physical applications. To surpass those issues, we introduce IRKA based techniques that enable us to approximate the second-order systems through the reduced models implicitly without forming the first-order forms . On the other hand, there are very challenging tasks to the Model Order Reduction (MOR) of the large-scale second-order systems with the optimal \\mathcal{H}_2 error norm and attain the rapid rate of convergence. For the convenient computations, we discuss competent techniques to determine the optimal \\mathcal{H}_2 error norms efficiently for the second-order systems. The applicability and efficiency of the proposed techniques are validated by applying them to some large-scale systems extracted form engineering applications. The computations are done numerically using MATLAB simulation and the achieved results are discussed in both tabular and graphical approaches.", "edit_actions": [{"type": "R", "before": "In this paper , we focus on the efficient techniques to estimate the", "after": "This paper focuses on exploring efficient ways to find", "start_char_pos": 0, "end_char_pos": 68}, {"type": "R", "before": "using the", "after": "via interpolatory projection-based method", "start_char_pos": 160, "end_char_pos": 169}, {"type": "R", "before": "In general", "after": "To get the reduced models of the second-order systems", "start_char_pos": 214, "end_char_pos": 224}, {"type": "R", "before": "can be applied to the second-order system by converting it into an", "after": "deals with the", "start_char_pos": 246, "end_char_pos": 312}, {"type": "R", "before": "form and get the reduced model in a", "after": "converted forms and estimates the", "start_char_pos": 336, "end_char_pos": 371}, {"type": "R", "before": "form. In this case, the reduced model can not preserve the structure of the second-order system which is however necessary for further manipulation. Here we develop IRKA based algorithms", "after": "reduced models. The drawbacks of that of the technique are failure of structure preservation and abolishing the properties of the original models, which are the key factors for some of the physical applications. To surpass those issues, we introduce IRKA based techniques", "start_char_pos": 384, "end_char_pos": 570}, {"type": "R", "before": "generate approximate reduced", "after": "approximate the", "start_char_pos": 589, "end_char_pos": 617}, {"type": "R", "before": "without explicitly converting the systems into a", "after": "through the reduced models implicitly without forming the", "start_char_pos": 639, "end_char_pos": 687}, {"type": "R", "before": "form", "after": "forms", "start_char_pos": 700, "end_char_pos": 704}, {"type": "R", "before": "find reduced-order form of a", "after": "the Model Order Reduction (MOR) of the", "start_char_pos": 762, "end_char_pos": 790}, {"type": "R", "before": "system with a minimized", "after": "second-order systems with the optimal", "start_char_pos": 803, "end_char_pos": 826}, {"type": "R", "before": "To overcome these problems, this paper discusses", "after": "For the convenient computations, we discuss", "start_char_pos": 894, "end_char_pos": 942}, {"type": "R", "before": "norm", "after": "norms", "start_char_pos": 1009, "end_char_pos": 1013}, {"type": "R", "before": "system. The efficiency and applicability", "after": "systems. The applicability and efficiency", "start_char_pos": 1047, "end_char_pos": 1087}, {"type": "R", "before": "several", "after": "some", "start_char_pos": 1149, "end_char_pos": 1156}, {"type": "R", "before": "dynamical systems . The computation is done numerically", "after": "systems extracted form engineering applications. The computations are done numerically using MATLAB simulation", "start_char_pos": 1169, "end_char_pos": 1224}], "sents_char_pos": [0, 213, 389, 532, 706, 893, 1054, 1188]} {"doc_id": "2006.14499", "revision_depth": "1", "before_revision": "The relationship between a pandemic and the concurrent economy is quite comparable to the relation observed among health and wealth in general. Since 25th March 2020, India has been under a nation-wide lockdown . This work attempts to examine the effect of COVID-19 on the foreign exchange rates and stock market performances of India using secondary data over a span of 48 days . The study explores whether the causal relationships among the growth rate of confirmed cases ( GrowthC ), exchange rate (GEX) and SENSEX value (GSENSEX) are remaining the same across different pre and post-lockdown phases, attempting to capture any potential changes over time via the Vector Auto Regressive (VAR) models. A positive correlation is found between the growth rate of confirmed cases and the growth rate of exchange rate, and a negative correlation between the growth rate of confirmed cases and the growth rate of SENSEX value. A naive interpretation from this could be that with the rising growth rate of the number of confirmed cases, the economy took a toll, reflected by the Indian currency being depreciated while the stock exchange index suffered from a fall. However, on applying a VAR model, it is observed that an increase in the confirmed COVID-19 cases causes no significant change in the values of the exchange rate and SENSEX index. The result varies if the analysis is split across different time periods - before lockdown, first phase of lockdownand extension of lockdown. To compare the three periods, we had undertaken five rounds of analyses . Nuanced and sensible interpretations of the numeric results indicate significant variability across time in terms of the relation between the variables of interest. This detailed knowledge about the varying patterns of dependence could potentially help the policy makers and investors of India in order to develop their policies to cope up the situation.", "after_revision": "Since March 25, 2020, India had been under a nation-wide lockdown announced as a response to the spread of SARS-CoV-2 and COVID-19 and has resorted to a process of 'unlocking' the lockdown over the past couple of months . This work attempts to examine the effect of novel coronavirus 2019 ( COVID-19 ) and its resulting disease, the COVID-19, on the foreign exchange rates and stock market performances of India using secondary data over a span of 112 days spanning between March 11 and June 30, 2020. The study explores whether the causal relationships and directions among the growth rate of confirmed cases ( GROWTHC ), exchange rate (GEX) and SENSEX value (GSENSEX) are remaining the same across different pre and post-lockdown phases, attempting to capture any potential changes over time via the vector autoregressive (VAR) models. A positive correlation is found between the growth rate of confirmed cases and the growth rate of exchange rate, and a negative correlation between the growth rate of confirmed cases and the growth rate of SENSEX value. However, on applying a vector autoregressive (VAR) model, it is observed that an increase in the confirmed COVID-19 cases causes no significant change in the values of the exchange rate and SENSEX index. The result varies if the analysis is split across different time periods - before lockdown, the four phases of lockdown, and the first phase of unlock . Nuanced and sensible interpretations of the numeric results indicate significant variability across time in terms of the relation between the variables of interest. The detailed knowledge about the varying patterns of dependence could potentially help the policy makers and investors of India in order to develop their strategies to cope up with the situation.", "edit_actions": [{"type": "R", "before": "The relationship between a pandemic and the concurrent economy is quite comparable to the relation observed among health and wealth in general. Since 25th March", "after": "Since March 25,", "start_char_pos": 0, "end_char_pos": 160}, {"type": "R", "before": "has", "after": "had", "start_char_pos": 173, "end_char_pos": 176}, {"type": "A", "before": null, "after": "announced as a response to the spread of SARS-CoV-2 and COVID-19 and has resorted to a process of 'unlocking' the lockdown over the past couple of months", "start_char_pos": 211, "end_char_pos": 211}, {"type": "A", "before": null, "after": "novel coronavirus 2019 (", "start_char_pos": 258, "end_char_pos": 258}, {"type": "A", "before": null, "after": ") and its resulting disease, the COVID-19,", "start_char_pos": 268, "end_char_pos": 268}, {"type": "R", "before": "48 days .", "after": "112 days spanning between March 11 and June 30, 2020.", "start_char_pos": 374, "end_char_pos": 383}, {"type": "A", "before": null, "after": "and directions", "start_char_pos": 436, "end_char_pos": 436}, {"type": "R", "before": "GrowthC", "after": "GROWTHC", "start_char_pos": 480, "end_char_pos": 487}, {"type": "R", "before": "Vector Auto Regressive", "after": "vector autoregressive", "start_char_pos": 670, "end_char_pos": 692}, {"type": "D", "before": "A naive interpretation from this could be that with the rising growth rate of the number of confirmed cases, the economy took a toll, reflected by the Indian currency being depreciated while the stock exchange index suffered from a fall.", "after": null, "start_char_pos": 927, "end_char_pos": 1164}, {"type": "R", "before": "VAR", "after": "vector autoregressive (VAR)", "start_char_pos": 1188, "end_char_pos": 1191}, {"type": "R", "before": "first phase of lockdownand extension of lockdown. To compare the three periods, we had undertaken five rounds of analyses", "after": "the four phases of lockdown, and the first phase of unlock", "start_char_pos": 1437, "end_char_pos": 1558}, {"type": "R", "before": "This", "after": "The", "start_char_pos": 1726, "end_char_pos": 1730}, {"type": "R", "before": "policies", "after": "strategies", "start_char_pos": 1881, "end_char_pos": 1889}, {"type": "A", "before": null, "after": "with", "start_char_pos": 1901, "end_char_pos": 1901}], "sents_char_pos": [0, 143, 213, 383, 706, 926, 1164, 1344, 1486, 1725]} {"doc_id": "2006.14779", "revision_depth": "1", "before_revision": "URLanizations are pairing humans with AI systems to improve decision-making and reducing costs. Proponents of human-centered AI argue that team performance can even further improve when the AI model explains its recommendations. However, a careful analysis of existing literature reveals that prior studies observed improvements due to explanations only when the AI, alone, outperformed both the human and the best human-AI team. This raises an important question: can explanations lead to complementary performance, i.e., with accuracy higher than both the human and the AI working alone? We address this question by devising comprehensive studies on human-AI teaming, where participants solve a task with help from an AI system without explanations and from one with varying types of AI explanation support. We carefully controlled to ensure comparable human and AI accuracy across experiments on three NLP datasets (two for sentiment analysis and one for question answering ). While we found complementary improvements from AI augmentation, they were not increased by state-of-the-art explanationscompared to simpler strategies, such as displaying the AI's confidence. We show that explanations increase the chance that humans will accept the AI's recommendation regardless of whether the AI is correct. While this clarifies the gains in team performance from explanations in prior work, it poses new challenges for human-centered AI: how can we best design systems to produce complementary performance? Can we develop explanatory approaches that help humans decide whether and when to trust AI input ?", "after_revision": "Many researchers motivate explainable AI with studies showing that human-AI team performance on decision-making tasks improves when the AI explains its recommendations. However, prior studies observed improvements from explanations only when the AI, alone, outperformed both the human and the best team. Can explanations help lead to complementary performance, where team accuracy is higher than either the human or the AI working solo? We conduct mixed-method user studies on three datasets, where an AI with accuracy comparable to humans helps participants solve a task (explaining itself in some conditions ). While we observed complementary improvements from AI augmentation, they were not increased by explanations. Rather, explanations increased the chance that humans will accept the AI's recommendation , regardless of its correctness. Our result poses new challenges for human-centered AI: Can we develop explanatory approaches that encourage appropriate trust in AI, and therefore help generate (or improve) complementary performance ?", "edit_actions": [{"type": "R", "before": "URLanizations are pairing humans with AI systems to improve", "after": "Many researchers motivate explainable AI with studies showing that human-AI team performance on", "start_char_pos": 0, "end_char_pos": 59}, {"type": "R", "before": "and reducing costs. Proponents of human-centered AI argue that team performance can even further improve", "after": "tasks improves", "start_char_pos": 76, "end_char_pos": 180}, {"type": "D", "before": "model", "after": null, "start_char_pos": 193, "end_char_pos": 198}, {"type": "D", "before": "a careful analysis of existing literature reveals that", "after": null, "start_char_pos": 238, "end_char_pos": 292}, {"type": "R", "before": "due to", "after": "from", "start_char_pos": 329, "end_char_pos": 335}, {"type": "R", "before": "human-AI team. This raises an important question: can explanations", "after": "team. Can explanations help", "start_char_pos": 415, "end_char_pos": 481}, {"type": "R", "before": "i.e., with accuracy higher than both the human and", "after": "where team accuracy is higher than either the human or", "start_char_pos": 517, "end_char_pos": 567}, {"type": "R", "before": "alone? We address this question by devising comprehensive studies on human-AI teaming, where participants solve a task with help from an AI system without explanations and from one with varying types of AI explanation support. We carefully controlled to ensure comparable human and AI accuracy across experiments on three NLP datasets (two for sentiment analysis and one for question answering", "after": "solo? We conduct mixed-method user studies on three datasets, where an AI with accuracy comparable to humans helps participants solve a task (explaining itself in some conditions", "start_char_pos": 583, "end_char_pos": 976}, {"type": "R", "before": "found", "after": "observed", "start_char_pos": 989, "end_char_pos": 994}, {"type": "R", "before": "state-of-the-art explanationscompared to simpler strategies, such as displaying the AI's confidence. We show that explanations increase", "after": "explanations. Rather, explanations increased", "start_char_pos": 1071, "end_char_pos": 1206}, {"type": "R", "before": "regardless of whether the AI is correct. While this clarifies the gains in team performance from explanations in prior work, it", "after": ", regardless of its correctness. Our result", "start_char_pos": 1266, "end_char_pos": 1393}, {"type": "D", "before": "how can we best design systems to produce complementary performance?", "after": null, "start_char_pos": 1438, "end_char_pos": 1506}, {"type": "R", "before": "help humans decide whether and when to trust AI input", "after": "encourage appropriate trust in AI, and therefore help generate (or improve) complementary performance", "start_char_pos": 1550, "end_char_pos": 1603}], "sents_char_pos": [0, 95, 228, 429, 589, 809, 979, 1171, 1306, 1506]} {"doc_id": "2006.15583", "revision_depth": "1", "before_revision": "We discuss a stochastic model to assess cumulative excess deaths during Covid-19-like epidemics for various non-pharmaceutic interventions. The model simulates three interrelated stochastic processes: epidemic spreading, availability of respiratory ventilators and changes in death statistics. Epidemic may spread either locally or globally. The local mode simulates virus transmission through contacts in the vicinity of the place of residence while the global mode simulates virus transmission through social mixing in public places , sport arenas, airports, etc , where many people meet, who live in remote geographic locations. Epidemic is modelled as a discrete time stochastic process on random geometric networks. In the simulations we assume that the basic reproduction number is R_0= 2.5 and the infectious period lasts ca. ten days. We also assume that the virus leads to severe acute respiratory syndrome in about one percent of cases, which in turn almost surely lead to respiratory default and death, unless the patient receives an appropriate medical treatment supported by respiratory ventilation. For other parameters , like mortality rate or the number of respiratory ventilators per million of inhabitants, we take values typical for developed countries. We simulate populations of 10^5-10^6 people. We compare different strategies: do-nothing , social distancing , reduction of social mixingand lockdown, assuming that there is no vaccine and no efficient medicine . The results of the simulations show that strategies that slow down the spread of epidemic too much are inefficient in reducing the cumulative excess of deaths . A hybrid strategy in which lockdown is in place for some time and is then completely released is inefficient as well .", "after_revision": "We develop an agent-based model to assess the cumulative number of deaths during hypothetical Covid-19-like epidemics for various non-pharmaceutical intervention strategies. We consider local and non-local modes of disease transmission. The first simulates transmission through social contacts in the vicinity of the place of residence while the second through social contacts in public places : schools, hospitals , airports, etc . , where many people meet, who live in remote geographic locations. Epidemic spreading is modeled as a discrete-time stochastic process on random geometric networks. We use the Monte-Carlo method in the simulations. The~following assumptions are made. The basic reproduction number is 2.5 and the infectious period lasts approximately ten days. Infections lead to SARS in about one percent of cases, which are likely to lead to respiratory default and death, unless the patient receives an appropriate medical treatment . The~healthcare system capacity is simulated by the availability of respiratory ventilators or intensive care beds. Some parameters of the model , like mortality rates or the number of respiratory ventilators per 100000 inhabitants, are chosen to simulate the real values for the USA and Poland. In the simulations we compare ` do-nothing ' strategy with mitigation strategies based on social distancing and reducing social mixing. We study epidemics in the pre-vaccine era, where immunity is obtained only by infection. The model applies only to epidemics for which reinfections are rare and can be neglected . The results of the simulations show that strategies that slow the development of an epidemic too much in the early stages do not significantly reduce the overall number of deaths in the long term, but increase the duration of the epidemic. In particular, a~hybrid strategy where lockdown is held for some time and is then completely released , is inefficient .", "edit_actions": [{"type": "R", "before": "discuss a stochastic", "after": "develop an agent-based", "start_char_pos": 3, "end_char_pos": 23}, {"type": "R", "before": "cumulative excess deaths during", "after": "the cumulative number of deaths during hypothetical", "start_char_pos": 40, "end_char_pos": 71}, {"type": "R", "before": "non-pharmaceutic interventions. The model simulates three interrelated stochastic processes: epidemic spreading, availability of respiratory ventilators and changes in death statistics. Epidemic may spread either locally or globally. The local mode simulates virus transmission through", "after": "non-pharmaceutical intervention strategies. We consider local and non-local modes of disease transmission. The first simulates transmission through social", "start_char_pos": 108, "end_char_pos": 393}, {"type": "R", "before": "global mode simulates virus transmission through social mixing", "after": "second through social contacts", "start_char_pos": 455, "end_char_pos": 517}, {"type": "A", "before": null, "after": ": schools, hospitals", "start_char_pos": 535, "end_char_pos": 535}, {"type": "D", "before": "sport arenas,", "after": null, "start_char_pos": 538, "end_char_pos": 551}, {"type": "A", "before": null, "after": ".", "start_char_pos": 566, "end_char_pos": 566}, {"type": "R", "before": "is modelled as a discrete time", "after": "spreading is modeled as a discrete-time", "start_char_pos": 643, "end_char_pos": 673}, {"type": "R", "before": "In the simulations we assume that the", "after": "We use the Monte-Carlo method in the simulations. The~following assumptions are made. The", "start_char_pos": 723, "end_char_pos": 760}, {"type": "D", "before": "R_0=", "after": null, "start_char_pos": 790, "end_char_pos": 794}, {"type": "R", "before": "ca.", "after": "approximately", "start_char_pos": 831, "end_char_pos": 834}, {"type": "R", "before": "We also assume that the virus leads to severe acute respiratory syndrome", "after": "Infections lead to SARS", "start_char_pos": 845, "end_char_pos": 917}, {"type": "R", "before": "in turn almost surely", "after": "are likely to", "start_char_pos": 955, "end_char_pos": 976}, {"type": "R", "before": "supported by respiratory ventilation. For other parameters", "after": ". The~healthcare system capacity is simulated by the availability of respiratory ventilators or intensive care beds. Some parameters of the model", "start_char_pos": 1077, "end_char_pos": 1135}, {"type": "R", "before": "rate", "after": "rates", "start_char_pos": 1153, "end_char_pos": 1157}, {"type": "R", "before": "million of inhabitants, we take values typical for developed countries. We simulate populations of 10^5-10^6 people. We compare different strategies:", "after": "100000 inhabitants, are chosen to simulate the real values for the USA and Poland. In the simulations we compare `", "start_char_pos": 1203, "end_char_pos": 1352}, {"type": "R", "before": ", social distancing , reduction of social mixingand lockdown, assuming that there is no vaccine and no efficient medicine", "after": "' strategy with mitigation strategies based on social distancing and reducing social mixing. We study epidemics in the pre-vaccine era, where immunity is obtained only by infection. The model applies only to epidemics for which reinfections are rare and can be neglected", "start_char_pos": 1364, "end_char_pos": 1485}, {"type": "R", "before": "down the spread of", "after": "the development of an", "start_char_pos": 1550, "end_char_pos": 1568}, {"type": "R", "before": "are inefficient in reducing the cumulative excess of deaths . A hybrid strategy in which lockdown is in place", "after": "in the early stages do not significantly reduce the overall number of deaths in the long term, but increase the duration of the epidemic. In particular, a~hybrid strategy where lockdown is held", "start_char_pos": 1587, "end_char_pos": 1696}, {"type": "R", "before": "is inefficient as well", "after": ", is inefficient", "start_char_pos": 1743, "end_char_pos": 1765}], "sents_char_pos": [0, 139, 293, 341, 633, 722, 844, 1114, 1274, 1319, 1487, 1648]} {"doc_id": "2006.15595", "revision_depth": "2", "before_revision": "How to explicitly encode positional information into neural networks is important in learning the representation of natural languages, such as BERT. Based on the Transformer architecture, the positional information is simply encoded as embedding vectors, which are used in the input layer, or encoded as a bias term in the self-attention module. In this work, we investigate the problems in the previous formulations and propose a new positional encoding method for BERT called Transformer with Untied Positional Encoding (TUPE). Different from all other works, TUPE only uses the word embedding as input. In the self-attention module, the word contextual correlation and positional correlation are computed separately with different parameterizations and then added together. This design removes the addition over heterogeneous embeddings in the input, which may potentially bring randomness, and gives more expressiveness to characterize the relationship between words/positions by using different projection matrices. Furthermore, TUPE unties the CLS \\texttt{[ symbol from other positions to provide it with a more specific role to capture the global representation of the sentence . Extensive experiments and ablation studies on GLUE benchmark demonstrate the effectiveness and efficiency of the proposed method : TUPE outperforms several baselines on almost all tasks by a large margin. In particular, it can achieve a higher score than baselines while only using 30\\% pre-training computational costs. We release our code at URL", "after_revision": "In this work, we investigate the positional encoding methods used in language pre-training (e.g., BERT) and identify several problems in the existing formulations. First, we show that in the absolute positional encoding, the addition operation applied on positional embeddings and word embeddings brings mixed correlations between the two heterogeneous information resources. It may bring unnecessary randomness in the attention and further limit the expressiveness of the model. Second, we question whether treating the position of the symbol CLS] the same as other words is a reasonable design, considering its special role (the representation of the entire sentence) in the downstream tasks. Motivated from above analysis, we propose a new positional encoding method calledTransformer withUntiedPositionalEncoding (TUPE). In the self-attention module, TUPE computes the word contextual correlation and positional correlation separately with different parameterizations and then adds them together. This design removes the mixed and noisy correlations over heterogeneous embeddings and offers more expressiveness by using different projection matrices. Furthermore, TUPE unties the \\texttt{[CLS symbol from other positions , making it easier to capture information from all positions . Extensive experiments and ablation studies on GLUE benchmark demonstrate the effectiveness of the proposed method . Codes and models are released at URL", "edit_actions": [{"type": "R", "before": "How to explicitly encode positional information into neural networks is important in learning the representation of natural languages, such as BERT. Based on the Transformer architecture, the positional information is simply encoded as embedding vectors, which are used in the input layer, or encoded as a bias term in the self-attention module. In this work, we investigate the problems in the previous formulations and", "after": "In this work, we investigate the positional encoding methods used in language pre-training (e.g., BERT) and identify several problems in the existing formulations. First, we show that in the absolute positional encoding, the addition operation applied on positional embeddings and word embeddings brings mixed correlations between the two heterogeneous information resources. It may bring unnecessary randomness in the attention and further limit the expressiveness of the model. Second, we question whether treating the position of the symbol", "start_char_pos": 0, "end_char_pos": 420}, {"type": "A", "before": null, "after": "CLS]", "start_char_pos": 421, "end_char_pos": 421}, {"type": "A", "before": null, "after": "the same as other words is a reasonable design, considering its special role (the representation of the entire sentence) in the downstream tasks. Motivated from above analysis, we", "start_char_pos": 422, "end_char_pos": 422}, {"type": "R", "before": "for BERT called Transformer with Untied Positional Encoding", "after": "called", "start_char_pos": 464, "end_char_pos": 523}, {"type": "A", "before": null, "after": "T", "start_char_pos": 523, "end_char_pos": 523}, {"type": "A", "before": null, "after": "ransformer with", "start_char_pos": 523, "end_char_pos": 523}, {"type": "A", "before": null, "after": "U", "start_char_pos": 523, "end_char_pos": 523}, {"type": "A", "before": null, "after": "ntied", "start_char_pos": 523, "end_char_pos": 523}, {"type": "A", "before": null, "after": "P", "start_char_pos": 523, "end_char_pos": 523}, {"type": "A", "before": null, "after": "ositional", "start_char_pos": 523, "end_char_pos": 523}, {"type": "A", "before": null, "after": "E", "start_char_pos": 523, "end_char_pos": 523}, {"type": "A", "before": null, "after": "ncoding", "start_char_pos": 523, "end_char_pos": 523}, {"type": "D", "before": "Different from all other works, TUPE only uses the word embedding as input.", "after": null, "start_char_pos": 532, "end_char_pos": 607}, {"type": "A", "before": null, "after": "TUPE computes", "start_char_pos": 638, "end_char_pos": 638}, {"type": "D", "before": "are computed", "after": null, "start_char_pos": 698, "end_char_pos": 710}, {"type": "R", "before": "added", "after": "adds them", "start_char_pos": 764, "end_char_pos": 769}, {"type": "R", "before": "addition", "after": "mixed and noisy correlations", "start_char_pos": 804, "end_char_pos": 812}, {"type": "R", "before": "in the input, which may potentially bring randomness, and gives more expressiveness to characterize the relationship between words/positions", "after": "and offers more expressiveness", "start_char_pos": 843, "end_char_pos": 983}, {"type": "D", "before": "CLS", "after": null, "start_char_pos": 1053, "end_char_pos": 1056}, {"type": "A", "before": null, "after": "CLS", "start_char_pos": 1066, "end_char_pos": 1066}, {"type": "R", "before": "to provide it with a more specific role to capture the global representation of the sentence", "after": ", making it easier to capture information from all positions", "start_char_pos": 1095, "end_char_pos": 1187}, {"type": "D", "before": "and efficiency", "after": null, "start_char_pos": 1281, "end_char_pos": 1295}, {"type": "R", "before": ": TUPE outperforms several baselines on almost all tasks by a large margin. In particular, it can achieve a higher score than baselines while only using 30\\% pre-training computational costs. We release our code", "after": ". Codes and models are released", "start_char_pos": 1319, "end_char_pos": 1530}], "sents_char_pos": [0, 148, 345, 531, 607, 779, 1023, 1394, 1510]} {"doc_id": "2006.15969", "revision_depth": "1", "before_revision": "Deep learning shows high potential for many medical image analysis tasks. Neural networks work with full-size data without extensive preprocessing and feature generation and, thus, information loss. Recent work has shown that morphological difference between specific brain regions can be found on MRI with deep learning techniques. We consider the pattern recognition task based on a large open-access dataset of healthy subjects - an exploration of brain differences between men and women . However, interpretation of the lately proposed models is based on a region of interest and can not be extended to pixel or voxel-wise image interpretation , which is considered to be more informative . In this paper, we confirm the previous findings in sex differences from diffusion-tensor imaging on T1 weighted brain MRI scans. We compare the results of three voxel-based 3D CNN interpretation methods: Meaningful Perturbations, GradCam and Guided Backpropagation and provide the open-source code .", "after_revision": "Deep learning shows high potential for many medical image analysis tasks. Neural networks can work with full-size data without extensive preprocessing and feature generation and, thus, information loss. Recent work has shown that the morphological difference in specific brain regions can be found on MRI with the means of Convolution Neural Networks (CNN) . However, interpretation of the existing models is based on a region of interest and can not be extended to voxel-wise image interpretation on a whole image. In the current work, we consider the classification task on a large-scale open-source dataset of young healthy subjects -- an exploration of brain differences between men and women . In this paper, we extend the previous findings in gender differences from diffusion-tensor imaging on T1 brain MRI scans. We provide the voxel-wise 3D CNN interpretation comparing the results of three interpretation methods: Meaningful Perturbations, Grad CAM and Guided Backpropagation , and contribute with the open-source library .", "edit_actions": [{"type": "A", "before": null, "after": "can", "start_char_pos": 90, "end_char_pos": 90}, {"type": "R", "before": "morphological difference between", "after": "the morphological difference in", "start_char_pos": 227, "end_char_pos": 259}, {"type": "R", "before": "deep learning techniques. We consider the pattern recognition task based on a large open-access dataset of healthy subjects - an exploration of brain differences between men and women", "after": "the means of Convolution Neural Networks (CNN)", "start_char_pos": 308, "end_char_pos": 491}, {"type": "R", "before": "lately proposed", "after": "existing", "start_char_pos": 525, "end_char_pos": 540}, {"type": "D", "before": "pixel or", "after": null, "start_char_pos": 608, "end_char_pos": 616}, {"type": "R", "before": ", which is considered to be more informative", "after": "on a whole image. In the current work, we consider the classification task on a large-scale open-source dataset of young healthy subjects -- an exploration of brain differences between men and women", "start_char_pos": 649, "end_char_pos": 693}, {"type": "R", "before": "confirm", "after": "extend", "start_char_pos": 714, "end_char_pos": 721}, {"type": "R", "before": "sex", "after": "gender", "start_char_pos": 747, "end_char_pos": 750}, {"type": "D", "before": "weighted", "after": null, "start_char_pos": 799, "end_char_pos": 807}, {"type": "R", "before": "compare the", "after": "provide the voxel-wise 3D CNN interpretation comparing the", "start_char_pos": 828, "end_char_pos": 839}, {"type": "D", "before": "voxel-based 3D CNN", "after": null, "start_char_pos": 857, "end_char_pos": 875}, {"type": "R", "before": "GradCam", "after": "Grad CAM", "start_char_pos": 926, "end_char_pos": 933}, {"type": "R", "before": "and provide", "after": ", and contribute with", "start_char_pos": 961, "end_char_pos": 972}, {"type": "R", "before": "code", "after": "library", "start_char_pos": 989, "end_char_pos": 993}], "sents_char_pos": [0, 73, 199, 333, 493, 695, 824]} {"doc_id": "2006.16651", "revision_depth": "1", "before_revision": "Given an orthogonal polygon with orthogonal holes, we devise a dynamic algorithm for guarding with vertex guards\\cal \\cal , i.e., whenever orthogonal polygon is modified,\\cal \\cal algorithm updates the set of vertex guards and their positions for guarding the modified orthogonal polygon\\cal \\cal . Our algorithm modifies the guard placement locally while ensuring the updated orthogonal polygon with h holes and n vertices , is guarded using at most \\lfloor (n+2h)/4 \\rfloor vertex guards. The algorithm to update vertex guards after any modification to the polygon takes O(k \\lg{(n+ n') time. Here, n' and n are the number of vertices of the orthogonal polygon before and after the update, respectively; and, k is the sum of the number of vertices added to or removed from the orthogonal polygon, the number of cuts in the L-shaped partitioning of the free space of the orthogonal polygon that got affected due to the update, and the number of channels affected due to the update. For the special case of the initial orthogonal polygon being hole-free, and each update resulting in a hole-free orthogonal polygon, our dynamic guard updating algorithmtakes O(k\\lg{(n+n')) worst-case time. Initially, we preprocess the input orthogonal polygon with q vertices in O(q \\lg{q}) time to construct data structures of size O(q\\frac{\\lg{q}}{\\lg\\lg{q}})} .", "after_revision": "We devise an algorithm for surveying a dynamic orthogonal polygonal domain\\cal P by placing one guard at each vertex in a subset of vertices of\\cal P , i.e., whenever an orthogonal polygon domain\\cal P' is modified to result in another orthogonal polygonal domain\\cal P, our algorithm updates the set of (vertex) guards surveying\\cal P' so that the updated guard set surveys\\cal P . Our algorithm modifies the guard placement in O(k \\lg{(n+n') while ensuring the updated orthogonal polygon with h holes and n vertices is guarded using at most \\lfloor (n+2h)/4 \\rfloor vertex guards. For the special case of the initial orthogonal polygon being hole-free and each update resulting in a hole-free orthogonal polygon, our guard updation algorithm takes O(k \\lg{(n+n') time. Here, n' and n are the number of vertices of the orthogonal polygon before and after the update, respectively; and, k is the sum of |n - n'| and the number of ) worst-case time. Initially, we preprocess the input orthogonal polygon with q vertices in O(q \\lg{q}) time to construct data structures of size O(q\\frac{\\lg{q}}{\\lg\\lg{q}})} updates in a few structures maintained by our algorithm .", "edit_actions": [{"type": "R", "before": "Given an orthogonal polygon with orthogonal holes, we devise a dynamic algorithm for guarding with vertex guards", "after": "We devise an algorithm for surveying a dynamic orthogonal polygonal domain", "start_char_pos": 0, "end_char_pos": 112}, {"type": "A", "before": null, "after": "P by placing one guard at each vertex in a subset of vertices of", "start_char_pos": 117, "end_char_pos": 117}, {"type": "A", "before": null, "after": "P", "start_char_pos": 122, "end_char_pos": 122}, {"type": "R", "before": "orthogonal polygon is modified,", "after": "an orthogonal polygon domain", "start_char_pos": 140, "end_char_pos": 171}, {"type": "A", "before": null, "after": "P' is modified to result in another orthogonal polygonal domain", "start_char_pos": 176, "end_char_pos": 176}, {"type": "A", "before": null, "after": "P, our", "start_char_pos": 181, "end_char_pos": 181}, {"type": "R", "before": "vertex guards and their positions for guarding the modified orthogonal polygon", "after": "(vertex) guards surveying", "start_char_pos": 211, "end_char_pos": 289}, {"type": "A", "before": null, "after": "P' so that the updated guard set surveys", "start_char_pos": 294, "end_char_pos": 294}, {"type": "A", "before": null, "after": "P", "start_char_pos": 299, "end_char_pos": 299}, {"type": "R", "before": "locally", "after": "in O(k \\lg{(n+n')", "start_char_pos": 345, "end_char_pos": 352}, {"type": "D", "before": ",", "after": null, "start_char_pos": 427, "end_char_pos": 428}, {"type": "R", "before": "The algorithm to update vertex guards after any modification to the polygon", "after": "For the special case of the initial orthogonal polygon being hole-free and each update resulting in a hole-free orthogonal polygon, our guard updation algorithm", "start_char_pos": 494, "end_char_pos": 569}, {"type": "R", "before": "\\lg{(n+ n')", "after": "\\lg{(n+n')", "start_char_pos": 580, "end_char_pos": 591}, {"type": "R", "before": "the number of vertices added to or removed from the orthogonal polygon, the number of cuts in the L-shaped partitioning of the free space of the orthogonal polygon that got affected due to the update,", "after": "|n - n'|", "start_char_pos": 730, "end_char_pos": 930}, {"type": "D", "before": "channels affected due to the update. For the special case of the initial orthogonal polygon being hole-free, and each update resulting in a hole-free orthogonal polygon, our dynamic guard updating algorithmtakes O(k\\lg{(n+n')", "after": null, "start_char_pos": 949, "end_char_pos": 1174}, {"type": "A", "before": null, "after": "updates in a few structures maintained by our algorithm", "start_char_pos": 1350, "end_char_pos": 1350}], "sents_char_pos": [0, 301, 493, 597, 708, 985, 1192]} {"doc_id": "2007.00217", "revision_depth": "1", "before_revision": "Biomedical question answering (QA) is a challenging problem due to the scarcity of data and the requirement of domain expertise. Growing interests of using pre-trained language models with transfer learning address the issue to some extent . Recently, learning linguistic knowledge of entailment in sentence pairs enhances the performance in general domain QAby leveraging such transferability between the two tasks . In this paper, we focus on facilitating the transferability by unifying the experimental setup from natural language inference (NLI) to biomedical QA. We observe that transferring from entailment data shows effective performance on Yes/No (+5.59\\%), Factoid (+0.53\\%), List (+13.58\\%) type questions compared to previous challenge reports (BioASQ 7B Phase B). We also observe that our method generally performs well in the 8th BioASQ Challenge (Phase B). For sequential transfer learning, the order of how tasks are fine-tuned is important. In factoid- and list-type questions, we thoroughly analyze an intrinsic limitation of the extractive QA setting when these questions are converted to the same format of the Stanford Question Answering Dataset (SQuAD).", "after_revision": "Biomedical question answering (QA) is a challenging task due to the scarcity of data and the requirement of domain expertise. Pre-trained language models have been used to address these issues . Recently, learning relationships between sentence pairs has been proved to improve performance in general QA . In this paper, we focus on applying BioBERT to transfer the knowledge of natural language inference (NLI) to biomedical QA. We observe that BioBERT trained on the NLI dataset obtains better performance on Yes/No (+5.59\\%), Factoid (+0.53\\%), List type (+13.58\\%) questions compared to performance obtained in a previous challenge (BioASQ 7B Phase B). We present a sequential transfer learning method that significantly performed well in the 8th BioASQ Challenge (Phase B). In sequential transfer learning, the order in which tasks are fine-tuned is important. We measure an unanswerable rate of the extractive QA setting when the formats of factoid and list type questions are converted to the format of the Stanford Question Answering Dataset (SQuAD).", "edit_actions": [{"type": "R", "before": "problem", "after": "task", "start_char_pos": 52, "end_char_pos": 59}, {"type": "R", "before": "Growing interests of using pre-trained language models with transfer learning address the issue to some extent", "after": "Pre-trained language models have been used to address these issues", "start_char_pos": 129, "end_char_pos": 239}, {"type": "R", "before": "linguistic knowledge of entailment in sentence pairs enhances the", "after": "relationships between sentence pairs has been proved to improve", "start_char_pos": 261, "end_char_pos": 326}, {"type": "R", "before": "domain QAby leveraging such transferability between the two tasks", "after": "QA", "start_char_pos": 350, "end_char_pos": 415}, {"type": "R", "before": "facilitating the transferability by unifying the experimental setup from", "after": "applying BioBERT to transfer the knowledge of", "start_char_pos": 445, "end_char_pos": 517}, {"type": "R", "before": "transferring from entailment data shows effective", "after": "BioBERT trained on the NLI dataset obtains better", "start_char_pos": 585, "end_char_pos": 634}, {"type": "A", "before": null, "after": "type", "start_char_pos": 692, "end_char_pos": 692}, {"type": "D", "before": "type", "after": null, "start_char_pos": 704, "end_char_pos": 708}, {"type": "R", "before": "previous challenge reports", "after": "performance obtained in a previous challenge", "start_char_pos": 731, "end_char_pos": 757}, {"type": "R", "before": "also observe that our method generally performs", "after": "present a sequential transfer learning method that significantly performed", "start_char_pos": 782, "end_char_pos": 829}, {"type": "R", "before": "For", "after": "In", "start_char_pos": 874, "end_char_pos": 877}, {"type": "R", "before": "of how", "after": "in which", "start_char_pos": 918, "end_char_pos": 924}, {"type": "R", "before": "In factoid- and list-type questions, we thoroughly analyze an intrinsic limitation", "after": "We measure an unanswerable rate", "start_char_pos": 960, "end_char_pos": 1042}, {"type": "R", "before": "these", "after": "the formats of factoid and list type", "start_char_pos": 1077, "end_char_pos": 1082}, {"type": "D", "before": "same", "after": null, "start_char_pos": 1114, "end_char_pos": 1118}], "sents_char_pos": [0, 128, 417, 568, 778, 873, 959]} {"doc_id": "2007.01363", "revision_depth": "1", "before_revision": "The adaptive immune system in vertebrates consists of highly diverse immune receptors to mount specific responses against a multitude of pathogens. A central feature of the adaptive immune system is the ability to form a memory to act more efficiently in future encounters with similar pathogens . However, memory formation especially in B-cells is one of the least understood cell fate decisions in the immune system . Here, we present a framework to characterize optimal strategies to store memory in order to maximize the utility of immune response to counter evolving pathogens throughout URLanism's lifetime. To do so, we have incorporated the kinetics and energetics of memory response as ingredients of non-equilibrium decision-making between an adaptive exploration to mount a specific and novel response or exploitation of existing memory that can be activated rapidly yet with a reduced specificity against evolved pathogens. To achieve a long-term benefit for the host, we show that memory generation should be actively regulated and dependent on immune receptors ' affinity, with a preference for cross-reactive receptors with a moderate affinity against pathogens as opposed to high affinity receptors -- a recipe that is consistent with recent experimental findings 1,2 . Moreover, we show that the specificity of memory should depend on URLanism's lifespan, and URLanisms with fewer pathogenic encounters throughout their lifetime should store more cross-reactive memory. Overall, our framework provides a baseline to gauge the efficacy of immune memory formation in light of URLanism's coevolutionary history with pathogens.", "after_revision": "The adaptive immune system provides a diverse set of molecules that can mount specific responses against a multitude of pathogens. Memory is a key feature of adaptive immunity, which URLanisms to respond more readily upon re-infections . However, differentiation of memory cells is still one of the least understood cell fate decisions . Here, we introduce a mathematical framework to characterize optimal strategies to store memory to maximize the utility of immune response over URLanism's lifetime. We show that memory production should be actively regulated to balance between affinity and cross-reactivity of immune receptors for an effective protection against evolving pathogens . Moreover, we predict that specificity of memory should depend on URLanism's lifespan, and URLanisms with fewer pathogenic encounters should store more cross-reactive memory. Our framework provides a baseline to gauge the efficacy of immune memory in light of URLanism's coevolutionary history with pathogens.", "edit_actions": [{"type": "R", "before": "in vertebrates consists of highly diverse immune receptors to", "after": "provides a diverse set of molecules that can", "start_char_pos": 27, "end_char_pos": 88}, {"type": "R", "before": "A central feature of the adaptive immune system is the ability to form a memory to act more efficiently in future encounters with similar pathogens", "after": "Memory is a key feature of adaptive immunity, which URLanisms to respond more readily upon re-infections", "start_char_pos": 148, "end_char_pos": 295}, {"type": "R", "before": "memory formation especially in B-cells is", "after": "differentiation of memory cells is still", "start_char_pos": 307, "end_char_pos": 348}, {"type": "D", "before": "in the immune system", "after": null, "start_char_pos": 397, "end_char_pos": 417}, {"type": "R", "before": "present a", "after": "introduce a mathematical", "start_char_pos": 429, "end_char_pos": 438}, {"type": "D", "before": "in order", "after": null, "start_char_pos": 500, "end_char_pos": 508}, {"type": "R", "before": "to counter evolving pathogens throughout", "after": "over", "start_char_pos": 552, "end_char_pos": 592}, {"type": "R", "before": "To do so, we have incorporated the kinetics and energetics of memory response as ingredients of non-equilibrium decision-making between an adaptive exploration to mount a specific and novel response or exploitation of existing memory that can be activated rapidly yet with a reduced specificity against evolved pathogens. To achieve a long-term benefit for the host, we", "after": "We", "start_char_pos": 614, "end_char_pos": 983}, {"type": "R", "before": "generation", "after": "production", "start_char_pos": 1001, "end_char_pos": 1011}, {"type": "D", "before": "and dependent on immune receptors ' affinity, with a preference for cross-reactive receptors with a moderate affinity against pathogens as opposed to high affinity receptors -- a recipe that is consistent with recent experimental findings", "after": null, "start_char_pos": 1041, "end_char_pos": 1279}, {"type": "R", "before": "1,2", "after": "to balance between affinity and cross-reactivity of immune receptors for an effective protection against evolving pathogens", "start_char_pos": 1280, "end_char_pos": 1283}, {"type": "R", "before": "show that the", "after": "predict that", "start_char_pos": 1299, "end_char_pos": 1312}, {"type": "D", "before": "throughout their lifetime", "after": null, "start_char_pos": 1420, "end_char_pos": 1445}, {"type": "R", "before": "Overall, our", "after": "Our", "start_char_pos": 1487, "end_char_pos": 1499}, {"type": "D", "before": "formation", "after": null, "start_char_pos": 1569, "end_char_pos": 1578}], "sents_char_pos": [0, 147, 297, 419, 613, 935, 1216, 1486]} {"doc_id": "2007.05348", "revision_depth": "1", "before_revision": "Homeostasis occurs when an observable of a system (such as inner body temperature) remains approximately constant over a range of an external parameter (such as ambient temperature). More precisely, homeostasis refers to a phenomenon whereby the output x_o of a system is approximately constant on variation of an input I. Homeostatic phenomena are ubiquitous in biochemical networks of differential equations and these networks can be abstracted as digraphs G with a fixed input node \\iota and a different fixed output node o . We assume that only the input node depends explicitly on \\mathcal{I x_o(I) . We then study infinitesimal homeostasis : points \\mathcal{I_0 where dx_o{d\\mathcal{I}}(\\mathcal{I}} _0. Stability implies that there is a stable equilibrium X(\\mathcal{I}) for each \\mathcal{I} near \\mathcal{I}_0 and infinitesimal homeostasis occurs at \\mathcal{I}_0 when (dx_o/d\\mathcal{I})(\\mathcal{I}} _0) = 0 by showing that there is a square homeostasis matrix H associated to \\mathcal{G) for which dx_o/d\\mathcal{I} = 0 if and only if } \\det(H) = 0. Applying combinatorial matrix theory and graph theory to H allows us to classify types of homeostasis. We prove that the homeostasis types correspond to a set of irreducible blocks in H each associated with a subnetwork and these subnetworks. Specifically, we prove that each factor corresponds to a subnetwork of \\mathcal{G}. The factors } divide into two classes: structural and appendage. For example, a feedforward loop motif is a structural type whereas a negative feedback loop motif is an appendage type. We give two algorithms for determining a menu of homeostasis types that are possible in \\mathcal{G: one algorithm enumerates the structural types and one enumerates the appendage types. These subnetworks can be read directly from \\mathcal{G} without performing calculations } on model equations .", "after_revision": "Homeostasis refers to a phenomenon whereby the output x_o of a system is approximately constant on variation of an input I. Homeostasis occurs frequently in biochemical networks and in other networks of interacting elements where mathematical models are based on differential equations associated to the network. These networks can be abstracted as digraphs G with a distinguished input node \\iota , a different distinguished output node o , and a number of regulatory nodes \\rho_1,\\ldots,\\rho_n. In these models the input-output map x_o(I) _0 where dx_o{d\\mathcal{I}}(\\mathcal{I}} is defined by a stable equilibrium X_0 at \\mathcal{I_0. Stability implies that there is a stable equilibrium X(\\mathcal{I}) for each \\mathcal{I} near \\mathcal{I}_0 and infinitesimal homeostasis occurs at \\mathcal{I}_0 when (dx_o/d\\mathcal{I})(\\mathcal{I}} _0) = 0. We show that there is an (n+1)\\times(n+1) homeostasis matrix H (\\mathcal{I) for which dx_o/d\\mathcal{I} = 0 if and only if } \\det(H) = 0. We use combinatorial matrix theory to factor the polynomial \\det(H) and thereby determine a menu of different types of possible homeostasis associated with each digraph \\mathcal{G. Specifically, we prove that each factor corresponds to a subnetwork of \\mathcal{G}. The factors } divide into two combinatorially defined classes: structural and appendage. : one algorithm enumerates the structural types and one enumerates the appendage types. These subnetworks can be read directly from \\mathcal{G} without performing calculations } Structural factors correspond to feedforward motifs and appendage factors correspond to feedback motifs. Finally, we discover an algorithm for determining the homeostatic subnetwork motif corresponding to each factor of \\det(H) without performing numerical simulations on model equations . The algorithm allows us to classify low degree factors. There are two types of degree 1 homeostasis (negative feedback loops and kinetic or Haldane motifs) and there are two types of degree 2 homeostasis (feedforward loops and a degree two appendage motif) .", "edit_actions": [{"type": "D", "before": "occurs when an observable of a system (such as inner body temperature) remains approximately constant over a range of an external parameter (such as ambient temperature). More precisely, homeostasis", "after": null, "start_char_pos": 12, "end_char_pos": 210}, {"type": "R", "before": "Homeostatic phenomena are ubiquitous", "after": "Homeostasis occurs frequently", "start_char_pos": 323, "end_char_pos": 359}, {"type": "R", "before": "of differential equations and these", "after": "and in other networks of interacting elements where mathematical models are based on differential equations associated to the network. These", "start_char_pos": 384, "end_char_pos": 419}, {"type": "R", "before": "fixed", "after": "distinguished", "start_char_pos": 468, "end_char_pos": 473}, {"type": "R", "before": "and a different fixed", "after": ", a different distinguished", "start_char_pos": 491, "end_char_pos": 512}, {"type": "R", "before": ". We assume that only the input node depends explicitly on \\mathcal{I", "after": ", and a number of regulatory nodes \\rho_1,\\ldots,\\rho_n. In these models the input-output map", "start_char_pos": 527, "end_char_pos": 596}, {"type": "D", "before": ". We then study infinitesimal homeostasis : points \\mathcal{I", "after": null, "start_char_pos": 604, "end_char_pos": 665}, {"type": "A", "before": null, "after": "is defined by a stable equilibrium X_0 at \\mathcal{I", "start_char_pos": 706, "end_char_pos": 706}, {"type": "R", "before": "0 by showing", "after": "0. We show", "start_char_pos": 916, "end_char_pos": 928}, {"type": "R", "before": "a square", "after": "an (n+1)\\times(n+1)", "start_char_pos": 943, "end_char_pos": 951}, {"type": "R", "before": "associated to \\mathcal{G", "after": "(\\mathcal{I", "start_char_pos": 973, "end_char_pos": 997}, {"type": "R", "before": "Applying", "after": "We use", "start_char_pos": 1061, "end_char_pos": 1069}, {"type": "R", "before": "and graph theory to H allows us to classify types of homeostasis. We prove that the homeostasis types correspond to a set of irreducible blocks in H each associated with a subnetwork and these subnetworks", "after": "to factor the polynomial \\det(H) and thereby determine a menu of different types of possible homeostasis associated with each digraph \\mathcal{G", "start_char_pos": 1098, "end_char_pos": 1302}, {"type": "A", "before": null, "after": "combinatorially defined", "start_char_pos": 1418, "end_char_pos": 1418}, {"type": "D", "before": "For example, a feedforward loop motif is a structural type whereas a negative feedback loop motif is an appendage type. We give two algorithms for determining a menu of homeostasis types that are possible in \\mathcal{G", "after": null, "start_char_pos": 1454, "end_char_pos": 1672}, {"type": "A", "before": null, "after": "Structural factors correspond to feedforward motifs and appendage factors correspond to feedback motifs. Finally, we discover an algorithm for determining the homeostatic subnetwork motif corresponding to each factor of \\det(H) without performing numerical simulations", "start_char_pos": 1850, "end_char_pos": 1850}, {"type": "A", "before": null, "after": ". The algorithm allows us to classify low degree factors. There are two types of degree 1 homeostasis (negative feedback loops and kinetic or Haldane motifs) and there are two types of degree 2 homeostasis (feedforward loops and a degree two appendage motif)", "start_char_pos": 1870, "end_char_pos": 1870}], "sents_char_pos": [0, 182, 647, 777, 1163, 1303, 1387, 1453, 1573, 1759]} {"doc_id": "2007.06225", "revision_depth": "2", "before_revision": "Computational biology and bioinformatics provide vast data gold-mines from protein sequences, ideal for Language Models (LMs) taken from Natural Language Processing (NLP) . These LMs reach for new prediction frontiers at low inference costs. Here, we trained two auto-regressive language models (Transformer-XL, XLNet) and two auto-encoder models ( Bert, Albert ) on data from UniRef and BFD containing up to 393 billion amino acids (words) from 2.1 billion protein sequences (22- and 112-times the entire English Wikipedia) . The LMs were trained on the Summit supercomputer at Oak Ridge National Laboratory (ORNL), using 936 nodes (total 5616 GPUs ) and one TPU Pod (V3-512 or V3-1024). We validated the advantage of up-scaling LMs to larger models supported by bigger data by predicting secondary structure ( 3-states: Q3= 76-84, 8-states: Q8=65-73), sub-cellular localization for 10 cellular compartments ( Q10= 74) and whether a protein is membrane-bound or water-soluble ( Q2= 89). Dimensionality reduction revealed that the LM-embeddings from unlabeled data (only protein sequences) captured important biophysical properties governing protein shape. This implied learning some of the grammar of the language of life realized in protein sequences. The successful up-scaling of protein LMs through HPC to larger data sets slightly reduced the gap between models trained on evolutionary information and LMs. The official GitHub repository: URL", "after_revision": "Computational biology and bioinformatics provide vast data gold-mines from protein sequences, ideal for Language Models taken from NLP . These LMs reach for new prediction frontiers at low inference costs. Here, we trained two auto-regressive models (Transformer-XL, XLNet) and four auto-encoder models ( BERT, Albert, Electra, T5 ) on data from UniRef and BFD containing up to 393 billion amino acids . The LMs were trained on the Summit supercomputer using 5616 GPUs and TPU Pod up-to 1024 cores. Dimensionality reduction revealed that the raw protein LM-embeddings from unlabeled data captured some biophysical features of protein sequences. We validated the advantage of using the embeddings as exclusive input for several subsequent tasks. The first was a per-residue prediction of protein secondary structure ( 3-state accuracy Q3= 81\\%-87\\%); the second were per-protein predictions of protein sub-cellular localization (ten-state accuracy: Q10= 81\\%) and membrane vs. water-soluble ( 2-state accuracy Q2= 91\\%). For the per-residue predictions the transfer of the most informative embeddings (ProtT5) for the first time outperformed the state-of-the-art without using evolutionary information thereby bypassing expensive database searches. Taken together, the results implied that protein LMs learned some of the grammar of the language of life . To facilitate future work, we released our models at URL", "edit_actions": [{"type": "R", "before": "(LMs) taken from Natural Language Processing (NLP)", "after": "taken from NLP", "start_char_pos": 120, "end_char_pos": 170}, {"type": "D", "before": "language", "after": null, "start_char_pos": 279, "end_char_pos": 287}, {"type": "R", "before": "two", "after": "four", "start_char_pos": 323, "end_char_pos": 326}, {"type": "R", "before": "Bert, Albert", "after": "BERT, Albert, Electra, T5", "start_char_pos": 349, "end_char_pos": 361}, {"type": "D", "before": "(words) from 2.1 billion protein sequences (22- and 112-times the entire English Wikipedia)", "after": null, "start_char_pos": 433, "end_char_pos": 524}, {"type": "R", "before": "at Oak Ridge National Laboratory (ORNL), using 936 nodes (total", "after": "using", "start_char_pos": 576, "end_char_pos": 639}, {"type": "R", "before": ") and one TPU Pod (V3-512 or V3-1024).", "after": "and TPU Pod up-to 1024 cores. Dimensionality reduction revealed that the raw protein LM-embeddings from unlabeled data captured some biophysical features of protein sequences.", "start_char_pos": 650, "end_char_pos": 688}, {"type": "R", "before": "up-scaling LMs to larger models supported by bigger data by predicting", "after": "using the embeddings as exclusive input for several subsequent tasks. The first was a per-residue prediction of protein", "start_char_pos": 719, "end_char_pos": 789}, {"type": "R", "before": "3-states:", "after": "3-state accuracy", "start_char_pos": 812, "end_char_pos": 821}, {"type": "R", "before": "76-84, 8-states: Q8=65-73),", "after": "81\\%-87\\%); the second were per-protein predictions of protein", "start_char_pos": 826, "end_char_pos": 853}, {"type": "R", "before": "for 10 cellular compartments (", "after": "(ten-state accuracy:", "start_char_pos": 880, "end_char_pos": 910}, {"type": "R", "before": "74) and whether a protein is membrane-bound or", "after": "81\\%) and membrane vs.", "start_char_pos": 916, "end_char_pos": 962}, {"type": "A", "before": null, "after": "2-state accuracy", "start_char_pos": 979, "end_char_pos": 979}, {"type": "R", "before": "89). Dimensionality reduction revealed that the LM-embeddings from unlabeled data (only protein sequences) captured important biophysical properties governing protein shape. This implied learning", "after": "91\\%). For the per-residue predictions the transfer of the most informative embeddings (ProtT5) for the first time outperformed the state-of-the-art without using evolutionary information thereby bypassing expensive database searches. Taken together, the results implied that protein LMs learned", "start_char_pos": 984, "end_char_pos": 1179}, {"type": "R", "before": "realized in protein sequences. The successful up-scaling of protein LMs through HPC to larger data sets slightly reduced the gap between models trained on evolutionary information and LMs. The official GitHub repository:", "after": ". To facilitate future work, we released our models at", "start_char_pos": 1224, "end_char_pos": 1444}], "sents_char_pos": [0, 172, 241, 526, 688, 988, 1157, 1254, 1412]} {"doc_id": "2007.06296", "revision_depth": "1", "before_revision": "Among the many aspects that characterize the COVID-19 pandemic, two seem particularly challenging to understand: i), the great geographical differences in the degree of virus contagiousness and lethality which were found in the different phases of the epidemic progression, and , ii) , the potential role of the infected people's blood type in both the virus infectivity and the progression of the disease. Recently, Breiman et al. (2020) presented a hypothesis that could shed some light on i) and ii), specifically, it has been proposed that during the subject-to-subject transfer SARS-CoV-2 conserves on its capsid the erythrocytes' antigens of the source subject , causing a potential immune reaction in a receiving subject which has previously acquired specific antibodies to the source subject antigens. This implies a blood type-dependent infection rate. The strong geographical dependence of the blood type distribution could be, therefore, one of the factors at the origin of i). Here we present an epidemiological deterministic model where the infection rules hypothesized in Breiman et al. (2020) are taken into account . The comparison of the model outcome with exiting worldwide infection progression data seems to support the Breiman et al. (2020) hypothesis .", "after_revision": "Among the many aspects that characterize the COVID-19 pandemic, two seem particularly challenging to understand: (i) the great geographical differences in the degree of virus contagiousness and lethality which were found in the different phases of the epidemic progression, and (ii) the potential role of the infected people's blood type in both the virus infectivity and the progression of the disease. A recent hypothesis could shed some light on both aspects. Specifically, it has been proposed that in the subject-to-subject transfer SARS-CoV-2 conserves on its capsid the erythrocytes' antigens of the source subject . Thus these conserved antigens can potentially cause an immune reaction in a receiving subject that has previously acquired specific antibodies for the source subject antigens. This hypothesis implies a blood type-dependent infection rate. The strong geographical dependence of the blood type distribution could be, therefore, one of the factors at the origin of the observed heterogeneity in the epidemics spread. Here, we present an epidemiological deterministic model where the infection rules based on blood types are taken into account and compare our model outcomes with the exiting worldwide infection progression data . We found an overall good agreement, which strengthens the hypothesis that blood types do play a role in the COVID-19 infection .", "edit_actions": [{"type": "R", "before": "i),", "after": "(i)", "start_char_pos": 113, "end_char_pos": 116}, {"type": "R", "before": ", ii) ,", "after": "(ii)", "start_char_pos": 278, "end_char_pos": 285}, {"type": "R", "before": "Recently, Breiman et al. (2020) presented a hypothesis that", "after": "A recent hypothesis", "start_char_pos": 407, "end_char_pos": 466}, {"type": "R", "before": "i) and ii), specifically,", "after": "both aspects. Specifically,", "start_char_pos": 492, "end_char_pos": 517}, {"type": "R", "before": "during", "after": "in", "start_char_pos": 544, "end_char_pos": 550}, {"type": "R", "before": ", causing a potential", "after": ". Thus these conserved antigens can potentially cause an", "start_char_pos": 667, "end_char_pos": 688}, {"type": "R", "before": "which", "after": "that", "start_char_pos": 728, "end_char_pos": 733}, {"type": "R", "before": "to", "after": "for", "start_char_pos": 778, "end_char_pos": 780}, {"type": "A", "before": null, "after": "hypothesis", "start_char_pos": 815, "end_char_pos": 815}, {"type": "R", "before": "i). Here", "after": "the observed heterogeneity in the epidemics spread. Here,", "start_char_pos": 986, "end_char_pos": 994}, {"type": "R", "before": "hypothesized in Breiman et al. (2020)", "after": "based on blood types", "start_char_pos": 1071, "end_char_pos": 1108}, {"type": "R", "before": ". The comparison of the model outcome with", "after": "and compare our model outcomes with the", "start_char_pos": 1132, "end_char_pos": 1174}, {"type": "R", "before": "seems to support the Breiman et al. (2020) hypothesis", "after": ". We found an overall good agreement, which strengthens the hypothesis that blood types do play a role in the COVID-19 infection", "start_char_pos": 1220, "end_char_pos": 1273}], "sents_char_pos": [0, 406, 809, 862, 989, 1133]} {"doc_id": "2007.06954", "revision_depth": "2", "before_revision": "This paper describes a large dataset covering over 63 million coronavirus-related Twitter posts from more than 13 million unique users since 28 January to 1 July 2020. As strong concerns and emotions are expressed in the tweets, we analysed the tweets content using natural language processing techniques and machine-learning based algorithms, and inferred seventeen latent semantic attributes associated with each tweet, including 1) ten attributes indicating the tweet's relevance to ten detected topics, 2) five quantitative attributes indicating the degree of intensity in the valence (i.e., unpleasantness/pleasantness)and emotional intensities across four primary emotions of fear , anger, sadness and joy, and 3) two qualitative attributes indicating the sentiment category and the most dominant emotion category, respectively. To illustrate how the dataset can be used, we present descriptive statistics around the topics, sentiments and emotions attributes and their temporal distributions, and discuss possible usage in communication, psychology, public health, economics and epidemiology research.", "after_revision": "This paper presents a large annotated dataset on public expressions related to the COVID-19 pandemic. Through Twitter's standard search application programming interface, we retrieved over 63 million coronavirus-related public posts from more than 13 million unique users since 28 January to 1 July 2020. Using natural language processing techniques and machine learning based algorithms, we annotated each public tweet with seventeen latent semantic attributes , including: 1) ten binary attributes indicating the tweet's relevance or irrelevance to ten detected topics, 2) five quantitative attributes indicating the degree of intensity of the valence or sentiment (from extremely negative to extremely positive), and the degree of intensity of fear, of anger, of sadness and of joy emotions (from extremely low intensity to extremely high intensity) , and 3) two qualitative attributes indicating the sentiment category and the dominant emotion category, respectively. We report basic descriptive statistics around the topics, sentiments and emotions attributes and their temporal distributions, and discuss its possible usage in communication, psychology, public health, economics and epidemiology research.", "edit_actions": [{"type": "R", "before": "describes a large dataset covering", "after": "presents a large annotated dataset on public expressions related to the COVID-19 pandemic. Through Twitter's standard search application programming interface, we retrieved", "start_char_pos": 11, "end_char_pos": 45}, {"type": "R", "before": "Twitter", "after": "public", "start_char_pos": 82, "end_char_pos": 89}, {"type": "R", "before": "As strong concerns and emotions are expressed in the tweets, we analysed the tweets content using", "after": "Using", "start_char_pos": 168, "end_char_pos": 265}, {"type": "R", "before": "machine-learning", "after": "machine learning", "start_char_pos": 309, "end_char_pos": 325}, {"type": "R", "before": "and inferred", "after": "we annotated each public tweet with", "start_char_pos": 344, "end_char_pos": 356}, {"type": "R", "before": "associated with each tweet, including", "after": ", including:", "start_char_pos": 394, "end_char_pos": 431}, {"type": "A", "before": null, "after": "binary", "start_char_pos": 439, "end_char_pos": 439}, {"type": "A", "before": null, "after": "or irrelevance", "start_char_pos": 484, "end_char_pos": 484}, {"type": "R", "before": "in the valence (i.e., unpleasantness/pleasantness)and emotional intensities across four primary emotions of fear", "after": "of the valence or sentiment (from extremely negative to extremely positive), and the degree of intensity of fear, of anger, of sadness and of joy emotions (from extremely low intensity to extremely high intensity)", "start_char_pos": 576, "end_char_pos": 688}, {"type": "D", "before": "anger, sadness", "after": null, "start_char_pos": 691, "end_char_pos": 705}, {"type": "D", "before": "joy, and", "after": null, "start_char_pos": 710, "end_char_pos": 718}, {"type": "D", "before": "most", "after": null, "start_char_pos": 791, "end_char_pos": 795}, {"type": "R", "before": "To illustrate how the dataset can be used, we present", "after": "We report basic", "start_char_pos": 837, "end_char_pos": 890}, {"type": "A", "before": null, "after": "its", "start_char_pos": 1014, "end_char_pos": 1014}], "sents_char_pos": [0, 167, 434, 836]} {"doc_id": "2007.06954", "revision_depth": "3", "before_revision": "This paper presents a large annotated dataset on public expressions related to the COVID-19 pandemic . Through Twitter 's standard search application programming interface , we retrieved over 63 million coronavirus-related public posts from more than 13 million unique users since 28 January to 1 July 2020. Using natural language processing techniques and machine learning based algorithms, we annotated each public tweet with seventeen latent semantic attributes, including : 1 ) ten binary attributes indicating the tweet's relevance or irrelevance to ten detected topics, 2 ) five quantitative attributes indicating the degree of intensity of the valence or sentiment (from extremely negative to extremely positive), and the degree of intensity of fear, of anger, of sadness and of joy emotions (from extremely low intensity to extremely high intensity), and 3 ) two qualitative attributes indicating the sentiment category and the dominant emotion category , respectively . We report basic descriptive statistics around the topics, sentiments and emotions attributes and their temporal distributions, and discuss its possible usage in communication, psychology, public health, economics and epidemiology research.", "after_revision": "This paper presents a large , labelled dataset on people's responses and expressions related to the COVID-19 pandemic over the Twitter platform. From 28 January 2020 to 1 Jan 2021 , we retrieved over 132 million public Twitter posts (i.e., tweets) from more than 20 million unique users using four keywords: \"corona\", \"wuhan\", \"nCov\" and \"covid\". Leveraging natural language processing techniques and pre-trained machine learning-based emotion analytic algorithms, we labelled each tweet with seventeen latent semantic attributes, including a ) ten binary attributes indicating the tweet's relevance or irrelevance to the top ten detected topics, b ) five quantitative emotion intensity attributes indicating the degree of intensity of the valence or sentiment (from extremely negative to extremely positive), and the degree of intensity of fear, of anger, of sadness and of joy emotions (from barely noticeable to extremely high intensity), and c ) two qualitative attributes indicating the sentiment category and the dominant emotion category the tweet is mainly expressing . We report the descriptive statistics around the topic, sentiment and emotion attributes, and their temporal distributions, and discuss the dataset's possible usage in communication, psychology, public health, economics , and epidemiology research.", "edit_actions": [{"type": "R", "before": "annotated dataset on public", "after": ", labelled dataset on people's responses and", "start_char_pos": 28, "end_char_pos": 55}, {"type": "R", "before": ". Through Twitter 's standard search application programming interface", "after": "over the Twitter platform. From 28 January 2020 to 1 Jan 2021", "start_char_pos": 101, "end_char_pos": 171}, {"type": "R", "before": "63 million coronavirus-related public posts", "after": "132 million public Twitter posts (i.e., tweets)", "start_char_pos": 192, "end_char_pos": 235}, {"type": "R", "before": "13", "after": "20", "start_char_pos": 251, "end_char_pos": 253}, {"type": "R", "before": "since 28 January to 1 July 2020. Using", "after": "using four keywords: \"corona\", \"wuhan\", \"nCov\" and \"covid\". Leveraging", "start_char_pos": 275, "end_char_pos": 313}, {"type": "R", "before": "machine learning based", "after": "pre-trained machine learning-based emotion analytic", "start_char_pos": 357, "end_char_pos": 379}, {"type": "R", "before": "annotated each public", "after": "labelled each", "start_char_pos": 395, "end_char_pos": 416}, {"type": "R", "before": ": 1", "after": "a", "start_char_pos": 476, "end_char_pos": 479}, {"type": "A", "before": null, "after": "the top", "start_char_pos": 555, "end_char_pos": 555}, {"type": "R", "before": "2", "after": "b", "start_char_pos": 577, "end_char_pos": 578}, {"type": "A", "before": null, "after": "emotion intensity", "start_char_pos": 599, "end_char_pos": 599}, {"type": "R", "before": "extremely low intensity", "after": "barely noticeable", "start_char_pos": 807, "end_char_pos": 830}, {"type": "R", "before": "3", "after": "c", "start_char_pos": 865, "end_char_pos": 866}, {"type": "R", "before": ", respectively", "after": "the tweet is mainly expressing", "start_char_pos": 964, "end_char_pos": 978}, {"type": "R", "before": "basic", "after": "the", "start_char_pos": 991, "end_char_pos": 996}, {"type": "R", "before": "topics, sentiments and emotions attributes", "after": "topic, sentiment and emotion attributes,", "start_char_pos": 1031, "end_char_pos": 1073}, {"type": "R", "before": "its", "after": "the dataset's", "start_char_pos": 1120, "end_char_pos": 1123}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1194, "end_char_pos": 1194}], "sents_char_pos": [0, 102, 307, 477, 576, 980]} {"doc_id": "2007.08051", "revision_depth": "1", "before_revision": " In this paper we study the intrinsic tradeoff between the space complexity of the sketch and its estimation error in the Random Oracle model. We define a new measure of efficiency for cardinality estimators called the Fisher-Shannon ( \\mathsf{Fish ) number H/I. It captures the tension between the limiting Shannon entropy (H) of the sketch and its normalized Fisher information (I), which characterizes (asymptotically) the variance of a statistically efficient estimator. We prove that many variants of the \\mathsf{PCSA Flajolet and Martin have \\mathsf{Fish H_0/I_0 , where H_0,I_0 are two precisely-defined constants, and that all base-q generalizations of (\\textsf{Hyper )\\textsf{LogLog are strictly worse than H_0/I_0, but tend to H_0/I_0 in the limit as q %DIFDELCMD < \\to%%% \\infty. All other known sketches have even worse \\mathsf{Fish-numbers. We introduce a new sketch called \\mathsf{Fishmonger} } that is based on a smoothed, compressed version of \\mathsf{PCSA with a different estimation function. \\mathsf{Fishmonger has \\mathsf{Fish} number H_0/I_0 \\approx 1.98. It stores } ] O(\\log^2\\log U) + ( H_0/I_0)b \\approx 1.98b bits , and estimates cardinalities of multisets of U%DIFDELCMD < ] %%% with a standard error of ( 1 +o(1)) /\\sqrt{b}. \\mathsf{Fishmonger's space-error tradeoff improves on state-of-the-art sketches like }\\textsf{HyperLogLog , or even compressed representations of it. \\mathsf{Fishmonger can be used in a distributed environment (where substreams are sketched separately and composed later). We conjecture that the \\mathsf{Fish}-number } H_0/I_0 is a universal lower bound for any such composable sketch .", "after_revision": "Estimating the cardinality (number of distinct elements) of a large multiset is a classic problem in streaming and sketching, dating back to Flajolet and Martin's classic Probabilistic Counting (PCSA) algorithm from 1983. In this paper we study the intrinsic tradeoff between the space complexity of the sketch and its estimation error in the random oracle model. We define a new measure of efficiency for cardinality estimators called the Fisher-Shannon ( Fish ) number H/I. It captures the tension between the limiting Shannon entropy (H) of the sketch and its normalized Fisher information (I), which characterizes the variance of a statistically efficient , asymptotically unbiased estimator. Our results are as follows. We prove that all base-q variants of Flajolet and Martin 's PCSA sketch have Fish-number H_0/I_0 \\approx 1.98016 and that every base-q \\textsf{ \\textsf{ variant of (Hyper)LogLog has Fish-number worse than H_0/I_0, but that they tend to H_0/I_0 in the limit as q %DIFDELCMD < \\to%%% -numbers. We introduce a new sketch called \\mathsf{Fishmonger} } \\rightarrow \\infty. Here H_0,I_0 are precisely defined constants. We describe a sketch called Fishmonger that is based on a smoothed, entropy-compressed variant of PCSA with a different has \\mathsf{Fish} number H_0/I_0 \\approx 1.98. It stores } estimator function. It is proved that with high probability, Fishmonger processes a multiset of U] such that at all times, its space is O(\\log^2\\log U) + ( 1+o(1))( H_0/I_0)b \\approx 1.98b bits %DIFDELCMD < ] %%% and its standard error is 1 /\\sqrt{b}. 's space-error tradeoff improves on state-of-the-art sketches like }\\textsf{ can be used in a distributed environment (where substreams are sketched separately and composed later). We conjecture that the \\mathsf{Fish}-number } We give circumstantial evidence that H_0/I_0 is the optimum Fish-number of mergeable sketches for Cardinality Estimation. We define a class of linearizable sketches and prove that no member of this class can beat H_0/I_0 . The popular mergeable sketches are, in fact, also linearizable .", "edit_actions": [{"type": "A", "before": null, "after": "Estimating the cardinality (number of distinct elements) of a large multiset is a classic problem in streaming and sketching, dating back to Flajolet and Martin's classic Probabilistic Counting (PCSA) algorithm from 1983.", "start_char_pos": 0, "end_char_pos": 0}, {"type": "R", "before": "Random Oracle", "after": "random oracle", "start_char_pos": 122, "end_char_pos": 135}, {"type": "R", "before": "\\mathsf{Fish", "after": "Fish", "start_char_pos": 236, "end_char_pos": 248}, {"type": "D", "before": "(asymptotically)", "after": null, "start_char_pos": 405, "end_char_pos": 421}, {"type": "R", "before": "estimator.", "after": ", asymptotically unbiased estimator. Our results are as follows.", "start_char_pos": 464, "end_char_pos": 474}, {"type": "R", "before": "many variants of the \\mathsf{PCSA", "after": "all base-q variants of", "start_char_pos": 489, "end_char_pos": 522}, {"type": "R", "before": "have \\mathsf{Fish", "after": "'s PCSA sketch have Fish-number", "start_char_pos": 543, "end_char_pos": 560}, {"type": "R", "before": ", where H_0,I_0 are two precisely-defined constants, and that all", "after": "\\approx 1.98016 and that every", "start_char_pos": 569, "end_char_pos": 634}, {"type": "D", "before": "generalizations of (", "after": null, "start_char_pos": 642, "end_char_pos": 662}, {"type": "D", "before": "Hyper", "after": null, "start_char_pos": 670, "end_char_pos": 675}, {"type": "D", "before": ")", "after": null, "start_char_pos": 676, "end_char_pos": 677}, {"type": "D", "before": "LogLog", "after": null, "start_char_pos": 685, "end_char_pos": 691}, {"type": "R", "before": "are strictly", "after": "variant of (Hyper)LogLog has Fish-number", "start_char_pos": 692, "end_char_pos": 704}, {"type": "A", "before": null, "after": "that they", "start_char_pos": 729, "end_char_pos": 729}, {"type": "D", "before": "\\infty. All other known sketches have even worse \\mathsf{Fish", "after": null, "start_char_pos": 784, "end_char_pos": 845}, {"type": "A", "before": null, "after": "\\rightarrow \\infty. Here H_0,I_0 are precisely defined constants. We describe a sketch called Fishmonger", "start_char_pos": 910, "end_char_pos": 910}, {"type": "R", "before": "compressed version of \\mathsf{PCSA", "after": "entropy-compressed variant of PCSA", "start_char_pos": 940, "end_char_pos": 974}, {"type": "D", "before": "estimation function. \\mathsf{Fishmonger", "after": null, "start_char_pos": 992, "end_char_pos": 1031}, {"type": "A", "before": null, "after": "estimator function. It is proved that with high probability, Fishmonger processes a multiset of", "start_char_pos": 1091, "end_char_pos": 1091}, {"type": "A", "before": null, "after": "U", "start_char_pos": 1092, "end_char_pos": 1092}, {"type": "A", "before": null, "after": "such that at all times, its space is", "start_char_pos": 1094, "end_char_pos": 1094}, {"type": "A", "before": null, "after": "1+o(1))(", "start_char_pos": 1115, "end_char_pos": 1115}, {"type": "D", "before": ", and estimates cardinalities of multisets of", "after": null, "start_char_pos": 1145, "end_char_pos": 1190}, {"type": "D", "before": "U", "after": null, "start_char_pos": 1191, "end_char_pos": 1192}, {"type": "R", "before": "with a standard error of (", "after": "and its standard error is", "start_char_pos": 1211, "end_char_pos": 1237}, {"type": "D", "before": "+o(1))", "after": null, "start_char_pos": 1240, "end_char_pos": 1246}, {"type": "D", "before": "\\mathsf{Fishmonger", "after": null, "start_char_pos": 1258, "end_char_pos": 1276}, {"type": "D", "before": "HyperLogLog", "after": null, "start_char_pos": 1352, "end_char_pos": 1363}, {"type": "D", "before": ", or even compressed representations of it. \\mathsf{Fishmonger", "after": null, "start_char_pos": 1364, "end_char_pos": 1426}, {"type": "A", "before": null, "after": "We give circumstantial evidence that H_0/I_0 is the optimum Fish-number of mergeable sketches for Cardinality Estimation. We define a class of linearizable sketches and prove that no member of this class can beat", "start_char_pos": 1577, "end_char_pos": 1577}, {"type": "R", "before": "is a universal lower bound for any such composable sketch", "after": ". The popular mergeable sketches are, in fact, also linearizable", "start_char_pos": 1586, "end_char_pos": 1643}], "sents_char_pos": [0, 142, 262, 474, 791, 854, 1012, 1078, 1257, 1407, 1530]} {"doc_id": "2007.09895", "revision_depth": "1", "before_revision": "Recently, there has been significant work studying distribution testing under the Conditional Sampling model. In this model, a query involves specifying a subset S of the domain, and the output received is a sample drawn from the distribution conditioned on being in S. In this paper, we primarily study thetolerant versions of the classicuniformity andidentity testing problems, providing improved query complexity bounds in the conditional sampling model. In this paper , we prove that tolerant uniformity testing in the conditional sampling model can be solved using O(\\varepsilon^{-2}) queries, which is known to be optimal and improves upon the O(\\varepsilon^{-20})-query algorithm of [CRS15]. Our bound even holds under the Pair Conditional Sampling model, a restricted version of the conditional sampling model where every queried subset S either must have exactly 2 elements, or must be the entire domain of the distribution. We also prove that tolerant identity testing in the conditional sampling model can be solved in \\tilde{O}(\\varepsilon^{-4}) queries, which is the first known bound independent of the support size of the distribution for this problem. \\tilde{O})-query algorithm for monotonicity testing in the conditional sampling model, improving on the }\\tilde{O} ] Finally, we study (non-tolerant) identity testing under the pair conditional sampling model, and provide a tight bound of \\tilde{\\Theta}( \\sqrt{\\log n \\cdot \\varepsilon^{-2}) for the query complexity, improving upon both the known upper and lower bounds in [CRS15].", "after_revision": "Recently, there has been significant work studying distribution testing under the Conditional Sampling model. In this model, a query specifies a subset S of the domain, and the output received is a sample drawn from the distribution conditioned on being in S. In this paper, we improve query complexity bounds for several classic distribution testing problems in this model. First , we prove that tolerant uniformity testing in the conditional sampling model can be solved using O(\\varepsilon^{-2}) queries, which is optimal and improves upon the O(\\varepsilon^{-20})-query algorithm of Canonne et al. [CRS15]. This bound even holds under a restricted version of the conditional sampling model called the Pair Conditional Sampling model. Next, we prove that tolerant identity testing in the conditional sampling model can be solved in \\tilde{O}(\\varepsilon^{-4}) queries, which is the first known bound independent of the support size of the distribution for this problem. Next, we use our algorithm for tolerant uniformity testing to get an\\tilde{O}(\\varepsilon^{-4)-query algorithm for monotonicity testing in the conditional sampling model, improving on the }\\tilde{O}(\\varepsilon^{-22 Can15]. Finally, we study (non-tolerant) identity testing under the pair conditional sampling model, and provide a tight bound of \\tilde{\\Theta}( \\sqrt{\\log N \\cdot \\varepsilon^{-2}) for the query complexity, where the domain of the distribution has size N. This improves upon both the known upper and lower bounds in [CRS15].", "edit_actions": [{"type": "R", "before": "involves specifying", "after": "specifies", "start_char_pos": 133, "end_char_pos": 152}, {"type": "D", "before": "primarily study the", "after": null, "start_char_pos": 288, "end_char_pos": 307}, {"type": "D", "before": "tolerant", "after": null, "start_char_pos": 307, "end_char_pos": 315}, {"type": "D", "before": "versions of the classic", "after": null, "start_char_pos": 316, "end_char_pos": 339}, {"type": "D", "before": "uniformity", "after": null, "start_char_pos": 339, "end_char_pos": 349}, {"type": "D", "before": "and", "after": null, "start_char_pos": 350, "end_char_pos": 353}, {"type": "D", "before": "identity", "after": null, "start_char_pos": 353, "end_char_pos": 361}, {"type": "R", "before": "testing problems, providing improved", "after": "improve", "start_char_pos": 362, "end_char_pos": 398}, {"type": "R", "before": "in the conditional sampling model. In this paper", "after": "for several classic distribution testing problems in this model. First", "start_char_pos": 423, "end_char_pos": 471}, {"type": "D", "before": "known to be", "after": null, "start_char_pos": 608, "end_char_pos": 619}, {"type": "A", "before": null, "after": "Canonne et al.", "start_char_pos": 690, "end_char_pos": 690}, {"type": "R", "before": "Our", "after": "This", "start_char_pos": 700, "end_char_pos": 703}, {"type": "D", "before": "the Pair Conditional Sampling model,", "after": null, "start_char_pos": 727, "end_char_pos": 763}, {"type": "R", "before": "where every queried subset S either must have exactly 2 elements, or must be the entire domain of the distribution. We also", "after": "called the Pair Conditional Sampling model. Next, we", "start_char_pos": 819, "end_char_pos": 942}, {"type": "A", "before": null, "after": "Next, we use our algorithm for tolerant uniformity testing to get an", "start_char_pos": 1169, "end_char_pos": 1169}, {"type": "A", "before": null, "after": "(\\varepsilon^{-4", "start_char_pos": 1178, "end_char_pos": 1178}, {"type": "A", "before": null, "after": "(\\varepsilon^{-22", "start_char_pos": 1283, "end_char_pos": 1283}, {"type": "A", "before": null, "after": "Can15", "start_char_pos": 1284, "end_char_pos": 1284}, {"type": "A", "before": null, "after": ".", "start_char_pos": 1285, "end_char_pos": 1285}, {"type": "R", "before": "\\sqrt{\\log n", "after": "\\sqrt{\\log N", "start_char_pos": 1424, "end_char_pos": 1436}, {"type": "R", "before": "improving", "after": "where the domain of the distribution has size N. This improves", "start_char_pos": 1487, "end_char_pos": 1496}], "sents_char_pos": [0, 109, 269, 457, 699, 934, 1168]} {"doc_id": "2007.09999", "revision_depth": "1", "before_revision": "We establish a novel characterization of totally positive matrices via a sign non-reversal property. In this we are inspired by the analogous results for ] P-matrices (matrices with all principal minors positive) . Next, the interval hull ] of two m \\times n matrices A=(a_{ij}) and B = (b_{ij}) , denoted by \\mathbb{I is the collection of all matrices C such that c_{ij=t_{ij}a_{ij} +(1-t_{ij})b_{ij}for all i,j, where t_{ij} \\in }%DIFDELCMD < [%%% 0,1^{m \\times n} such that each c_{ij} is between a_{ij} and b_{ij}} . Using the sign non-reversal property, we identify a finite subset of \\mathbb{I}(A,B) that detects the total positivity of all of \\mathbb{I}(A,B) . This provides a test for an entire class of matrices simultaneously to be totally positive. We also establish analogous results for other classes of matrices: almost P-matrices, N-matrices and (minimally) semipositive matrices.", "after_revision": "A matrix A is totally positive (or non-negative) of order k, denoted TP_k (or TN_k), if all minors of size \\leq k are positive (or non-negative). It is well-known that such matrices are characterized by the variation diminishing property together with the sign non-reversal property. We do away with the former, and show that A is TP_k if and only if every contiguous submatrix of size \\leq k has the sign non-reversal property. In fact this can be strengthened to only consider test vectors in \\mathbb{R Compos. Math. 1937] and P-matrices by Gale-Nikaido Math. Ann. 1965]. As an application, we study the interval hull \\mathbb{I of two m \\times n matrices A=(a_{ij}) and B = (b_{ij}) . This is the collection of =t_{ij}a_{ij} +(1-t_{ij})b_{ij}for all i,j, where t_{ij} \\in }%DIFDELCMD < [%%% C \\in \\mathbb{R^{m \\times n} such that each c_{ij} is between a_{ij} and b_{ij}} . Using the sign non-reversal property, we identify a two-element subset of \\mathbb{I}(A,B) that detects the TP_k property for all of \\mathbb{I}(A,B) for arbitrary k \\geq 1. In particular, this provides a test for total positivity (of any order), simultaneously for an entire class of rectangular matrices.", "edit_actions": [{"type": "R", "before": "We establish a novel characterization of totally positive matrices via a", "after": "A matrix A is totally positive (or non-negative) of order k, denoted TP_k (or TN_k), if all minors of size \\leq k are positive (or non-negative). It is well-known that such matrices are characterized by the variation diminishing property together with the", "start_char_pos": 0, "end_char_pos": 72}, {"type": "R", "before": "In this we are inspired by the analogous results for", "after": "We do away with the former, and show that A is TP_k if and only if every contiguous submatrix of size \\leq k has the sign non-reversal property. In fact this can be strengthened to only consider test vectors in \\mathbb{R", "start_char_pos": 101, "end_char_pos": 153}, {"type": "A", "before": null, "after": "Compos. Math. 1937", "start_char_pos": 154, "end_char_pos": 154}, {"type": "A", "before": null, "after": "and", "start_char_pos": 156, "end_char_pos": 156}, {"type": "R", "before": "(matrices with all principal minors positive) . Next, the interval hull", "after": "by Gale-Nikaido", "start_char_pos": 168, "end_char_pos": 239}, {"type": "A", "before": null, "after": "Math. Ann. 1965", "start_char_pos": 240, "end_char_pos": 240}, {"type": "A", "before": null, "after": ". As an application, we study the interval hull \\mathbb{I", "start_char_pos": 241, "end_char_pos": 241}, {"type": "R", "before": ", denoted by \\mathbb{I", "after": ". This", "start_char_pos": 297, "end_char_pos": 319}, {"type": "D", "before": "all matrices C such that c_{ij", "after": null, "start_char_pos": 341, "end_char_pos": 371}, {"type": "R", "before": "0,1", "after": "C \\in \\mathbb{R", "start_char_pos": 451, "end_char_pos": 454}, {"type": "R", "before": "finite", "after": "two-element", "start_char_pos": 574, "end_char_pos": 580}, {"type": "R", "before": "total positivity of", "after": "TP_k property for", "start_char_pos": 624, "end_char_pos": 643}, {"type": "R", "before": ". This", "after": "for arbitrary k \\geq 1. In particular, this", "start_char_pos": 667, "end_char_pos": 673}, {"type": "A", "before": null, "after": "total positivity (of any order), simultaneously for", "start_char_pos": 694, "end_char_pos": 694}, {"type": "R", "before": "matrices simultaneously to be totally positive. We also establish analogous results for other classes of matrices: almost P-matrices, N-matrices and (minimally) semipositive", "after": "rectangular", "start_char_pos": 714, "end_char_pos": 887}], "sents_char_pos": [0, 100, 215, 279, 761]} {"doc_id": "2007.11151", "revision_depth": "1", "before_revision": "Mean-modulated flicker -- wherein luminance increments and decrements of equal magnitude are applied, over time, to a test field -- is commonly used in both clinical assessment of vision and experimental studies of visual systems. However, presenting mean-modulated flicker on computer-controlled displays is problematic; displays typically introduce luminance artifacts to flickering stimuli, especially at high flicker frequency or contrast, potentially interfering with the validity of findings. Here, we present a battery of tests that we used to judge the suitability of displays for presenting mean-modulated flicker. These tests revealed marked differences between a new high-performance liquid-crystal display (LCD; EIZO ColorEdge CG247X) and a new consumer-grade LCD (Dell U2415b), despite the displays' vendor-supplied specifications being almost identical. We measured displayed luminance using a spot meter , and a linearized photodiode device to record displayed luminance waveforms . We derived spatial uniformity, response times, Fourier amplitude spectra, cycle-averaged luminance , and root-mean-squared luminance . We presented paired luminance pulses to quantify the displays' nonlinear dynamics. The CG247X showed relatively good spatial uniformity . Fourier transformation of nominally static test patches revealed spectra free of artifacts, with the exception of a frame response (artifactual flicker related to the display refresh) . The CG247X's response times depended on both source and destination luminance . Despite this nonlinear behaviour, we were able to define a contrast and frequency range wherein the CG247X was artifact-free , that is, the relationship between nominal luminance and displayed luminance was accurately modelled using a causal, linear time-invariant system. This range included contrasts up to 80\\%, and flicker frequencies up to 30 Hz.", "after_revision": "Achromatic, mean-modulated flicker ( wherein luminance increments and decrements of equal magnitude are applied, over time, to a test field ) is commonly used in both clinical assessment of vision and experimental studies of visual systems. However, presenting flicker on computer-controlled displays is problematic; displays typically introduce luminance artifacts at high flicker frequency or contrast, potentially interfering with the validity of findings. Here, we present a battery of tests used to weigh the relative merits of two displays for presenting achromatic, mean-modulated flicker. These tests revealed marked differences between a new high-performance liquid-crystal display (LCD; EIZO ColorEdge CG247X) and a new consumer-grade LCD (Dell U2415b), despite displays' vendor-supplied specifications being almost identical. We measured displayed luminance using a spot meter and a linearized photodiode . We derived several measures, including spatial uniformity, the effect of viewing angle, response times, Fourier amplitude spectra, and cycle-averaged luminance . We presented paired luminance pulses to quantify the displays' nonlinear dynamics. The CG247X showed relatively good spatial uniformity (e.g., at moderate luminance, standard deviation 2.8\\% versus U2415b's 5.3\\%). Fourier transformation of nominally static test patches revealed spectra free of artifacts, with the exception of a frame response . The CG247X's rise and fall times depended on both the luminance from which, and to which, it responded, as is to be generally expected from LCDs . Despite this nonlinear behaviour, we were able to define a contrast and frequency range wherein the CG247X appeared largely artifact-free ; the relationship between nominal luminance and displayed luminance was accurately modelled using a causal, linear time-invariant system. This range included contrasts up to 80\\%, and flicker frequencies up to 30 Hz.", "edit_actions": [{"type": "R", "before": "Mean-modulated flicker --", "after": "Achromatic, mean-modulated flicker (", "start_char_pos": 0, "end_char_pos": 25}, {"type": "R", "before": "--", "after": ")", "start_char_pos": 129, "end_char_pos": 131}, {"type": "D", "before": "mean-modulated", "after": null, "start_char_pos": 251, "end_char_pos": 265}, {"type": "D", "before": "to flickering stimuli, especially", "after": null, "start_char_pos": 371, "end_char_pos": 404}, {"type": "R", "before": "that we used to judge the suitability of", "after": "used to weigh the relative merits of two", "start_char_pos": 535, "end_char_pos": 575}, {"type": "A", "before": null, "after": "achromatic,", "start_char_pos": 600, "end_char_pos": 600}, {"type": "D", "before": "the", "after": null, "start_char_pos": 800, "end_char_pos": 803}, {"type": "D", "before": ",", "after": null, "start_char_pos": 920, "end_char_pos": 921}, {"type": "D", "before": "device to record displayed luminance waveforms", "after": null, "start_char_pos": 950, "end_char_pos": 996}, {"type": "A", "before": null, "after": "several measures, including", "start_char_pos": 1010, "end_char_pos": 1010}, {"type": "A", "before": null, "after": "the effect of viewing angle,", "start_char_pos": 1031, "end_char_pos": 1031}, {"type": "A", "before": null, "after": "and", "start_char_pos": 1075, "end_char_pos": 1075}, {"type": "D", "before": ", and root-mean-squared luminance", "after": null, "start_char_pos": 1101, "end_char_pos": 1134}, {"type": "R", "before": ".", "after": "(e.g., at moderate luminance, standard deviation 2.8\\% versus U2415b's 5.3\\%).", "start_char_pos": 1273, "end_char_pos": 1274}, {"type": "D", "before": "(artifactual flicker related to the display refresh)", "after": null, "start_char_pos": 1406, "end_char_pos": 1458}, {"type": "R", "before": "response", "after": "rise and fall", "start_char_pos": 1474, "end_char_pos": 1482}, {"type": "R", "before": "source and destination luminance", "after": "the luminance from which, and to which, it responded, as is to be generally expected from LCDs", "start_char_pos": 1506, "end_char_pos": 1538}, {"type": "R", "before": "was", "after": "appeared largely", "start_char_pos": 1648, "end_char_pos": 1651}, {"type": "R", "before": ", that is,", "after": ";", "start_char_pos": 1666, "end_char_pos": 1676}], "sents_char_pos": [0, 230, 321, 498, 624, 724, 868, 998, 1136, 1219, 1274, 1460, 1813]} {"doc_id": "2007.11189", "revision_depth": "1", "before_revision": "Voluntary employee turnover incurs significant direct and indirect financial costs URLanizations of all sizes. A large proportion of voluntary turnover includes people who frequently move from job to job, known as job-hopping. The ability to discover an applicant's likelihood towards job-hopping can URLanizations make informed hiring decisions benefiting both parties. In this work , we show that the language one uses when responding to interview questions related to situational judgment and past behaviour is predictive of their likelihood to job hop. We used responses from over 45,000 job applicants who completed an online chat interview and also self-rated themselves on a job-hopping motive scale to analyse the correlation between the two. We evaluated five different methods of text representation , namely four open-vocabulary approaches (TF-IDF, LDA, Glove word embeddings and Doc2Vec document embeddings) and one closed-vocabulary approach (LIWC). The Glove embeddings provided the best results with a positive correlation of r = 0.35 between sequences of words used and the job-hopping likelihood. With further analysis , we also found that there is a positive correlation of r = 0.25 between job-hopping likelihood and the HEXACO personality trait Openness to experience . In other words, the more open a candidate is to new experiences, the more likely they are to job hop. The ability to objectively infer a candidate's likelihood towards job hopping presents significant opportunities, especially when assessing candidates with no prior work history. On the other hand, experienced candidates who come across as job hoppers, based purely on their resume, get an opportunity to indicate otherwise .", "after_revision": "A significant proportion of voluntary employee turnover includes people who frequently move from job to job, known as job-hopping. Our work shows that language used in responding to interview questions on past behaviour and situational judgement is predictive of job-hopping motive as measured by the Job-Hopping Motives (JHM) Scale. The study is based on responses from over 45,000 job applicants who completed an online chat interview and self-rated themselves on JHM Scale. Five different methods of text representation were evaluated , namely four open-vocabulary approaches (TF-IDF, LDA, Glove word embeddings and Doc2Vec document embeddings) and one closed-vocabulary approach (LIWC). The Glove embeddings provided the best results with a correlation of r = 0.35 between sequences of words used and the JHM Scale. Further analysis also showed a correlation of r = 0.25 between language-based job-hopping motive and the personality trait Openness to experience and a correlation of r = -0.09 with the trait Agreeableness .", "edit_actions": [{"type": "R", "before": "Voluntary employee turnover incurs significant direct and indirect financial costs URLanizations of all sizes. A large", "after": "A significant", "start_char_pos": 0, "end_char_pos": 118}, {"type": "A", "before": null, "after": "employee", "start_char_pos": 143, "end_char_pos": 143}, {"type": "R", "before": "The ability to discover an applicant's likelihood towards job-hopping can URLanizations make informed hiring decisions benefiting both parties. In this work , we show that the language one uses when", "after": "Our work shows that language used in", "start_char_pos": 228, "end_char_pos": 426}, {"type": "R", "before": "related to situational judgment and past behaviour", "after": "on past behaviour and situational judgement", "start_char_pos": 461, "end_char_pos": 511}, {"type": "R", "before": "their likelihood to job hop. We used", "after": "job-hopping motive as measured by the Job-Hopping Motives (JHM) Scale. The study is based on", "start_char_pos": 529, "end_char_pos": 565}, {"type": "D", "before": "also", "after": null, "start_char_pos": 651, "end_char_pos": 655}, {"type": "R", "before": "a job-hopping motive scale to analyse the correlation between the two. We evaluated five", "after": "JHM Scale. Five", "start_char_pos": 681, "end_char_pos": 769}, {"type": "A", "before": null, "after": "were evaluated", "start_char_pos": 811, "end_char_pos": 811}, {"type": "D", "before": "positive", "after": null, "start_char_pos": 1019, "end_char_pos": 1027}, {"type": "R", "before": "job-hopping likelihood. With further analysis , we also found that there is a positive", "after": "JHM Scale. Further analysis also showed a", "start_char_pos": 1092, "end_char_pos": 1178}, {"type": "A", "before": null, "after": "language-based", "start_char_pos": 1211, "end_char_pos": 1211}, {"type": "R", "before": "likelihood and the HEXACO", "after": "motive and the", "start_char_pos": 1224, "end_char_pos": 1249}, {"type": "R", "before": ". In other words, the more open a candidate is to new experiences, the more likely they are to job hop. The ability to objectively infer a candidate's likelihood towards job hopping presents significant opportunities, especially when assessing candidates with no prior work history. On the other hand, experienced candidates who come across as job hoppers, based purely on their resume, get an opportunity to indicate otherwise", "after": "and a correlation of r = -0.09 with the trait Agreeableness", "start_char_pos": 1291, "end_char_pos": 1718}], "sents_char_pos": [0, 110, 227, 371, 557, 751, 964, 1115, 1292, 1394, 1573]} {"doc_id": "2007.11410", "revision_depth": "1", "before_revision": "We prove three decomposition results for sparse positive ( semi- )definite polynomial matrices . First, we show that a polynomial matrix P(x) with chordal sparsity is positive semidefinite for all x\\in R^n if and only if there exists a sum-of-squares (SOS) polynomial \\sigma(x) such that \\sigma (x)P (x) can be decomposed into a sum of sparse SOS matrices , each of which is zero outside a small principal submatrix . Second, we establish that setting \\sigma(x)=(x_1^2 + \\cdots + x_n^2)^\\nu for some integer \\nu suffices if P (x) is even, homogeneous , and positive definite . Third, we prove a sparse-matrix version of Putinar's Positivstellensatz: if P (x) has chordal sparsity and is positive definite on a compact semialgebraic set \\mathcal{K}=\\{x:g_1(x)\\geq 0,\\ldots,g_m(x)\\geq 0\\} satisfying the Archimedean condition, then P(x) = S_0(x) + g_1(x)S_1(x) + \\cdots + g_m(x)S_m(x) for matrices S_i(x) that are sums of sparse SOS matrices , each of which is zero outside a small principal submatrix is not compact or does not satisfy the Archimedean condition, we obtain a similar decomposition for (x_1^2 + \\ldots + x_n^2)^\\nu P(x) with some integer \\nu\\geq 0 when P and g_1,\\ldots,g_m are homogeneous of even degree} . Using these decomposition results, we obtain sparse SOS representation theorems for polynomials that are quadratic and correlatively sparse in a subset of variables . We also obtain new convergent hierarchies of sparsity-exploiting SOS reformulations to convex optimization problems with large and sparse polynomial matrix inequalities. Analytical examples illustrate all our decomposition results, while large-scale numerical examples demonstrate that the corresponding sparsity-exploiting SOS hierarchies have significantly lower computational complexity than traditional ones.", "after_revision": "We prove decomposition theorems for sparse positive ( semi )definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\\\"atze . First, we establish that a polynomial matrix P(x) with chordal sparsity is positive semidefinite for all x\\in R^n if and only if there exists a sum-of-squares (SOS) polynomial \\sigma(x) such that \\sigma P is a sum of sparse SOS matrices . Second, we show that setting \\sigma(x)=(x_1^2 + \\cdots + x_n^2)^\\nu for some integer \\nu suffices if P is homogeneous and positive definite globally . Third, we prove that if P is positive definite on a compact semialgebraic set \\mathcal{K}=\\{x:g_1(x)\\geq 0,\\ldots,g_m(x)\\geq 0\\} satisfying the Archimedean condition, then P(x) = S_0(x) + g_1(x)S_1(x) + \\cdots + g_m(x)S_m(x) for matrices S_i(x) that are sums of sparse SOS matrices . Finally, if \\mathcal{K is not compact or does not satisfy the Archimedean condition, we obtain a similar decomposition for (x_1^2 + \\ldots + x_n^2)^\\nu P(x) with some integer \\nu\\geq 0 when P and g_1,\\ldots,g_m are homogeneous of even degree} . Using these results, we find sparse SOS representation theorems for polynomials that are quadratic and correlatively sparse in a subset of variables , and we construct new convergent hierarchies of sparsity-exploiting SOS reformulations for convex optimization problems with large and sparse polynomial matrix inequalities. Numerical examples demonstrate that these hierarchies can have a significantly lower computational complexity than traditional ones.", "edit_actions": [{"type": "R", "before": "three decomposition results", "after": "decomposition theorems", "start_char_pos": 9, "end_char_pos": 36}, {"type": "R", "before": "semi-", "after": "semi", "start_char_pos": 59, "end_char_pos": 64}, {"type": "A", "before": null, "after": "that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\\\"atze", "start_char_pos": 95, "end_char_pos": 95}, {"type": "R", "before": "show", "after": "establish", "start_char_pos": 108, "end_char_pos": 112}, {"type": "R", "before": "(x)P (x) can be decomposed into", "after": "P is", "start_char_pos": 296, "end_char_pos": 327}, {"type": "D", "before": ", each of which is zero outside a small principal submatrix", "after": null, "start_char_pos": 357, "end_char_pos": 416}, {"type": "R", "before": "establish", "after": "show", "start_char_pos": 430, "end_char_pos": 439}, {"type": "R", "before": "(x) is even, homogeneous ,", "after": "is homogeneous", "start_char_pos": 527, "end_char_pos": 553}, {"type": "A", "before": null, "after": "globally", "start_char_pos": 576, "end_char_pos": 576}, {"type": "R", "before": "a sparse-matrix version of Putinar's Positivstellensatz: if P (x) has chordal sparsity and", "after": "that if P", "start_char_pos": 595, "end_char_pos": 685}, {"type": "R", "before": ", each of which is zero outside a small principal submatrix", "after": ". Finally, if \\mathcal{K", "start_char_pos": 942, "end_char_pos": 1001}, {"type": "D", "before": "decomposition", "after": null, "start_char_pos": 1236, "end_char_pos": 1249}, {"type": "R", "before": "obtain", "after": "find", "start_char_pos": 1262, "end_char_pos": 1268}, {"type": "R", "before": ". We also obtain", "after": ", and we construct", "start_char_pos": 1389, "end_char_pos": 1405}, {"type": "R", "before": "to", "after": "for", "start_char_pos": 1475, "end_char_pos": 1477}, {"type": "R", "before": "Analytical examples illustrate all our decomposition results, while large-scale numerical examples demonstrate that the corresponding sparsity-exploiting SOS hierarchies have", "after": "Numerical examples demonstrate that these hierarchies can have a", "start_char_pos": 1561, "end_char_pos": 1735}], "sents_char_pos": [0, 97, 418, 578, 651, 754, 836, 860, 884, 904, 1390, 1560]} {"doc_id": "2007.13596", "revision_depth": "1", "before_revision": "In this work, different transmission modes of the SARS-CoV-2 virus and their role in determining the evolution of the Covid-19 pandemic are analyzed . Probability of infection caused by inhaling infectious droplets (initial, ejection diameters between 0.5-750\\mu m) and probability of infection by the corresponding desiccated nuclei that mostly encapsulate the virions post droplet evaporation, are calculated. At typical, air-conditioned yet quiescent , large indoor space, for the average viral loading, and at early times, cough droplets of initial diameter between 10 \\mu m and 50 \\mu m have the highest infection probability. However, by the time they are to be inhaled, the diameters are most likely 5-6 times smaller with respect to their initial diameters. While the initially near unity infection probability due to droplets (airborne/ballistic) rapidly decays within the first 25s, the small yet persistent infection probability of airborne desiccated nuclei decays appreciably only by 1000s . Combined with molecular collision theory adapted to calculate frequency of contact between the susceptible population and the droplet/nuclei cloud, infection probabilities are used to define infection rate constants , ab-initio, leading to a SEIR model . Assuming the virus sustains equally well within the dried droplet nuclei as in the droplets, the floating nuclei leads to a stronger contribution to the corresponding rate constants with respect to the droplets, in the above-mentioned conditions. Combining both pathways, the basic reproduction number \\mathcal{R Viral load, minimum infectious dose, sensitivity of the virus half-life to the phase of its vector , extent of dilution of the respiratory jet/puff by the entraining air are the important factors that determine specific physical modes of transmission and the pandemic evolution .", "after_revision": "Identifying the relative importance of the different transmission routes of the SARS-CoV-2 virus is an urgent research priority. To that end, the different transmission routes, and their role in determining the evolution of the Covid-19 pandemic are analyzed in this work . Probability of infection caused by inhaling virus-laden droplets (initial, ejection diameters between 0.5-750\\mu m) and the corresponding desiccated nuclei that mostly encapsulate the virions post droplet evaporation, are individually calculated. At typical, air-conditioned yet quiescent indoor space, for average viral loading, cough droplets of initial diameter between 10-50 \\mu m have the highest infection probability. However, by the time they are inhaled, the diameters reduce to about 1/6^{th their initial diameters. While the initially near unity infection probability due to droplets rapidly decays within the first 25s, the small yet persistent infection probability of desiccated nuclei decays appreciably only by \\mathcal{O 1000s ), assuming the virus sustains equally well within the dried droplet nuclei as in the droplets . Combined with molecular collision theory adapted to calculate frequency of contact between the susceptible population and the droplet/nuclei cloud, infection rate constants are derived ab-initio, leading to a SEIR model applicable for any respiratory event - vector combination. Viral load, minimum infectious dose, sensitivity of the virus half-life to the phase of its vector and dilution of the respiratory jet/puff by the entraining air are shown to mechanistically determine specific physical modes of transmission and variation in the basic reproduction number \\mathcal{R .", "edit_actions": [{"type": "R", "before": "In this work, different transmission modes", "after": "Identifying the relative importance of the different transmission routes", "start_char_pos": 0, "end_char_pos": 42}, {"type": "A", "before": null, "after": "is an urgent research priority. To that end, the different transmission routes,", "start_char_pos": 67, "end_char_pos": 67}, {"type": "A", "before": null, "after": "in this work", "start_char_pos": 150, "end_char_pos": 150}, {"type": "R", "before": "infectious", "after": "virus-laden", "start_char_pos": 197, "end_char_pos": 207}, {"type": "D", "before": "probability of infection by", "after": null, "start_char_pos": 272, "end_char_pos": 299}, {"type": "A", "before": null, "after": "individually", "start_char_pos": 402, "end_char_pos": 402}, {"type": "D", "before": ", large", "after": null, "start_char_pos": 457, "end_char_pos": 464}, {"type": "D", "before": "the", "after": null, "start_char_pos": 483, "end_char_pos": 486}, {"type": "D", "before": "and at early times,", "after": null, "start_char_pos": 510, "end_char_pos": 529}, {"type": "R", "before": "10 \\mu m and 50 \\mu m", "after": "10-50 \\mu m", "start_char_pos": 573, "end_char_pos": 594}, {"type": "D", "before": "to be", "after": null, "start_char_pos": 665, "end_char_pos": 670}, {"type": "R", "before": "are most likely 5-6 times smaller with respect to", "after": "reduce to about 1/6^{th", "start_char_pos": 694, "end_char_pos": 743}, {"type": "D", "before": "(airborne/ballistic)", "after": null, "start_char_pos": 838, "end_char_pos": 858}, {"type": "D", "before": "airborne", "after": null, "start_char_pos": 946, "end_char_pos": 954}, {"type": "A", "before": null, "after": "\\mathcal{O", "start_char_pos": 1000, "end_char_pos": 1000}, {"type": "A", "before": null, "after": "), assuming the virus sustains equally well within the dried droplet nuclei as in the droplets", "start_char_pos": 1007, "end_char_pos": 1007}, {"type": "R", "before": "probabilities are used to define infection rate constants ,", "after": "rate constants are derived", "start_char_pos": 1168, "end_char_pos": 1227}, {"type": "R", "before": ". Assuming the virus sustains equally well within the dried droplet nuclei as in the droplets, the floating nuclei leads to a stronger contribution to the corresponding rate constants with respect to the droplets, in the above-mentioned conditions. Combining both pathways, the basic reproduction number \\mathcal{R", "after": "applicable for any respiratory event - vector combination.", "start_char_pos": 1263, "end_char_pos": 1577}, {"type": "R", "before": ", extent of", "after": "and", "start_char_pos": 1677, "end_char_pos": 1688}, {"type": "R", "before": "the important factors that", "after": "shown to mechanistically", "start_char_pos": 1752, "end_char_pos": 1778}, {"type": "R", "before": "the pandemic evolution", "after": "variation in the basic reproduction number \\mathcal{R", "start_char_pos": 1833, "end_char_pos": 1855}], "sents_char_pos": [0, 414, 634, 768, 1264, 1511]} {"doc_id": "2007.14059", "revision_depth": "1", "before_revision": "Fake news becomes a palpable potential risk to society because of the growing use of mobile devices and the immense increase in Internet access across the world . It is essential to develop a simple mathematical model to understand the mechanism of the online dissemination of fake news. In this paper , we propose a point process model for predicting the spreading of the fake news on Twitter. This model describes the cascade as a two-stage process: initially, a cascade spreads as an ordinary newsstory; a second cascade thenemerges through attempts to disclose and rectify the falsity of the news story. We validate this model through the collection of two datasets of fake news cascades from Twitter. We show that the proposed model is superior to the current state-of-the-art methods in accurately predicting the evolution of the fake news cascades . Moreover, the proposed model can appropriately infer the correction time when some users realize the falsity of the news . The proposed model contributes to understand the dynamics of fake news spread in social mediaand is potentially advantageous in extracting a compact representation of the temporal information of the cascades .", "after_revision": "Fake news can have a significant negative impact on society because of the growing use of mobile devices and the worldwide increase in Internet access . It is therefore essential to develop a simple mathematical model to understand the online dissemination of fake news. In this study , we propose a point process model of the spread of fake news on Twitter. The proposed model describes the spread of a fake news item as a two-stage process: initially, fake news spreads as a piece of ordinary news; then, when most users start recognizing the falsity of the news item, that itself spreads as another news story. We validate this model using two datasets of fake news items spread on Twitter. We show that the proposed model is superior to the current state-of-the-art methods in accurately predicting the evolution of the spread of a fake news item . Moreover, a text analysis suggests that our model appropriately infers the correction time , i.e., the moment when Twitter users start realizing the falsity of the news item . The proposed model contributes to understanding the dynamics of the spread of fake news on social media. Its ability to extract a compact representation of the spreading pattern could be useful in the detection and mitigation of fake news .", "edit_actions": [{"type": "R", "before": "becomes a palpable potential risk to", "after": "can have a significant negative impact on", "start_char_pos": 10, "end_char_pos": 46}, {"type": "R", "before": "immense", "after": "worldwide", "start_char_pos": 108, "end_char_pos": 115}, {"type": "D", "before": "across the world", "after": null, "start_char_pos": 144, "end_char_pos": 160}, {"type": "A", "before": null, "after": "therefore", "start_char_pos": 169, "end_char_pos": 169}, {"type": "D", "before": "mechanism of the", "after": null, "start_char_pos": 237, "end_char_pos": 253}, {"type": "R", "before": "paper", "after": "study", "start_char_pos": 297, "end_char_pos": 302}, {"type": "R", "before": "for predicting the spreading of the", "after": "of the spread of", "start_char_pos": 338, "end_char_pos": 373}, {"type": "R", "before": "This", "after": "The proposed", "start_char_pos": 396, "end_char_pos": 400}, {"type": "R", "before": "cascade", "after": "spread of a fake news item", "start_char_pos": 421, "end_char_pos": 428}, {"type": "R", "before": "a cascade spreads as an ordinary newsstory; a second cascade thenemerges through attempts to disclose and rectify", "after": "fake news spreads as a piece of ordinary news; then, when most users start recognizing", "start_char_pos": 464, "end_char_pos": 577}, {"type": "A", "before": null, "after": "item, that itself spreads as another news", "start_char_pos": 602, "end_char_pos": 602}, {"type": "R", "before": "through the collection of", "after": "using", "start_char_pos": 633, "end_char_pos": 658}, {"type": "R", "before": "cascades from", "after": "items spread on", "start_char_pos": 685, "end_char_pos": 698}, {"type": "R", "before": "fake news cascades", "after": "spread of a fake news item", "start_char_pos": 838, "end_char_pos": 856}, {"type": "R", "before": "the proposed model can appropriately infer", "after": "a text analysis suggests that our model appropriately infers", "start_char_pos": 869, "end_char_pos": 911}, {"type": "R", "before": "when some users realize", "after": ", i.e., the moment when Twitter users start realizing", "start_char_pos": 932, "end_char_pos": 955}, {"type": "A", "before": null, "after": "item", "start_char_pos": 980, "end_char_pos": 980}, {"type": "R", "before": "understand", "after": "understanding", "start_char_pos": 1017, "end_char_pos": 1027}, {"type": "R", "before": "fake news spread in social mediaand is potentially advantageous in extracting", "after": "the spread of fake news on social media. Its ability to extract", "start_char_pos": 1044, "end_char_pos": 1121}, {"type": "R", "before": "temporal information of the cascades", "after": "spreading pattern could be useful in the detection and mitigation of fake news", "start_char_pos": 1154, "end_char_pos": 1190}], "sents_char_pos": [0, 162, 288, 395, 507, 609, 707, 982]} {"doc_id": "2007.14747", "revision_depth": "1", "before_revision": "By performing a large number of spatial measurements , high spatial resolution photoacoustic imaging can be achieved without specific prior information. However, the acquisition of spatial measurements is time consuming, costly and technically challenging. By exploiting non-linear prior information, compressed sensing techniques in combination with sophisticate reconstruction algorithms allow a reduction of number of measurements while maintaining a high spatial resolution. For this purpose , in this paper, we propose a multiscale factorization for the wave equation , which separates the data into a low frequency factor and sparse high frequency factors. By extending the acoustic reciprocal principle, we transfer sparsity in measurements domain to spatial sparsity of the initial pressure, which allows the use of sparse reconstruction techniques. Numerical results are presented which demonstrate the feasibility of the proposed framework.", "after_revision": "Performing a large number of spatial measurements enables high-resolution photoacoustic imaging without specific prior information. However, the acquisition of spatial measurements is time-consuming, costly, and technically challenging. By exploiting nonlinear prior information, compressed sensing techniques in combination with sophisticated reconstruction algorithms allow reducing the number of measurements while maintaining high spatial resolution. To this end , in this work we propose a multiscale factorization for the wave equation that decomposes the measured data into a low-frequency factor and sparse high-frequency factors. By extending the acoustic reciprocity principle, we transfer sparsity in the measurement domain into spatial sparsity of the initial pressure, which allows the use of sparse reconstruction techniques. Numerical results are presented that demonstrate the feasibility of the proposed framework.", "edit_actions": [{"type": "R", "before": "By performing", "after": "Performing", "start_char_pos": 0, "end_char_pos": 13}, {"type": "R", "before": ", high spatial resolution photoacoustic imaging can be achieved", "after": "enables high-resolution photoacoustic imaging", "start_char_pos": 53, "end_char_pos": 116}, {"type": "R", "before": "time consuming, costly", "after": "time-consuming, costly,", "start_char_pos": 205, "end_char_pos": 227}, {"type": "R", "before": "non-linear", "after": "nonlinear", "start_char_pos": 271, "end_char_pos": 281}, {"type": "R", "before": "sophisticate", "after": "sophisticated", "start_char_pos": 351, "end_char_pos": 363}, {"type": "R", "before": "a reduction of", "after": "reducing the", "start_char_pos": 396, "end_char_pos": 410}, {"type": "D", "before": "a", "after": null, "start_char_pos": 452, "end_char_pos": 453}, {"type": "R", "before": "For this purpose", "after": "To this end", "start_char_pos": 479, "end_char_pos": 495}, {"type": "R", "before": "paper,", "after": "work", "start_char_pos": 506, "end_char_pos": 512}, {"type": "R", "before": ", which separates the", "after": "that decomposes the measured", "start_char_pos": 573, "end_char_pos": 594}, {"type": "R", "before": "low frequency", "after": "low-frequency", "start_char_pos": 607, "end_char_pos": 620}, {"type": "R", "before": "high frequency", "after": "high-frequency", "start_char_pos": 639, "end_char_pos": 653}, {"type": "R", "before": "reciprocal", "after": "reciprocity", "start_char_pos": 689, "end_char_pos": 699}, {"type": "R", "before": "measurements domain to", "after": "the measurement domain into", "start_char_pos": 735, "end_char_pos": 757}, {"type": "R", "before": "which", "after": "that", "start_char_pos": 890, "end_char_pos": 895}], "sents_char_pos": [0, 152, 256, 478, 662, 857]} {"doc_id": "2007.14823", "revision_depth": "1", "before_revision": "RNNs are popular dynamical models, used for processing sequential data . Prior theoretical work in understanding the properties of RNNs has focused on models with additive interactions , where the input to a unit is a weighted sum of the output of the remaining units in network . However, there is ample evidence that neurons can have gating - i.e. multiplicative - interactions. Such gating interactions have significant effects on the collective dynamics of the network. Furthermore, the best performing RNNs in machine learning have gating interactions. Thus, gating interactions are beneficial for information processing and learning tasks. We develop a dynamical mean-field theory (DMFT) of gating to understand the dynamical regimes produced by gating . Our gated RNN reduces to the classical RNNs in certain limits and is closely related to popular gated models in machine learning . We use random matrix theory (RMT) to analytically characterize the spectrum of the Jacobian and show how gating produces slow modes and marginal stability . Thus, gating is a potential mechanism to implement computations involving line attractor dynamics . The long-time behavior of the gated network is studied using its Lyapunov spectrum, and the DMFT is used to provide an analytical prediction for the maximum Lyapunov exponent . We also show that gating gives rise to a novel, discontinuous transition to chaos, where the proliferation of critical points is decoupled with the appearance of chaotic dynamics ; the nature of this chaotic state is characterized in detail. Using the DMFT and RMT, we produce phase diagramsfor gated RNN . Finally, we address the gradients by leveraging the adjoint sensitivity framework to develop a DMFT for the gradients. The theory developed here sheds light on the rich dynamical behaviour produced by gating interactions and has implications for architectural choices and learning dynamics .", "after_revision": "Recurrent neural networks (RNNs) are powerful dynamical models, widely used in machine learning (ML) for processing sequential data , and also in neuroscience, to understand the emergent properties of networks of real neurons . Prior theoretical work in understanding the properties of RNNs has focused on models with additive interactions . However, real neurons can have gating -- i.e. multiplicative -- interactions, and gating is also a central feature of the best performing RNNs in machine learning . Here, we develop a dynamical mean-field theory (DMFT) to study the consequences of gating in RNNs . We use random matrix theory to show how gating robustly produces marginal stability and line attractors -- important mechanisms for biologically-relevant computations requiring long memory . The long-time behavior of the gated network is studied using its Lyapunov spectrum, and the DMFT is used to provide a novel analytical expression for the maximum Lyapunov exponent demonstrating its close relation to relaxation time of the dynamics. Gating is also shown to give rise to a novel, discontinuous transition to chaos, where the proliferation of critical points (topological complexity) is decoupled from the appearance of chaotic dynamics (dynamical complexity), contrary to a seminal result for additive RNNs. Critical surfaces and regions of marginal stability in the parameter space are indicated in phase diagrams, thus providing a map for principled parameter choices for ML practitioners . Finally, we develop a field-theory for gradients that arise in training, by incorporating the adjoint sensitivity framework from control theory in the DMFT. This paves the way for the use of powerful field-theoretic techniques to study training/gradients in large RNNs .", "edit_actions": [{"type": "R", "before": "RNNs are popular", "after": "Recurrent neural networks (RNNs) are powerful", "start_char_pos": 0, "end_char_pos": 16}, {"type": "R", "before": "used", "after": "widely used in machine learning (ML)", "start_char_pos": 35, "end_char_pos": 39}, {"type": "A", "before": null, "after": ", and also in neuroscience, to understand the emergent properties of networks of real neurons", "start_char_pos": 71, "end_char_pos": 71}, {"type": "D", "before": ", where the input to a unit is a weighted sum of the output of the remaining units in network", "after": null, "start_char_pos": 186, "end_char_pos": 279}, {"type": "R", "before": "there is ample evidence that", "after": "real", "start_char_pos": 291, "end_char_pos": 319}, {"type": "R", "before": "-", "after": "--", "start_char_pos": 344, "end_char_pos": 345}, {"type": "R", "before": "- interactions. Such gating interactions have significant effects on the collective dynamics of the network. Furthermore, the", "after": "-- interactions, and gating is also a central feature of the", "start_char_pos": 366, "end_char_pos": 491}, {"type": "R", "before": "have gating interactions. Thus, gating interactions are beneficial for information processing and learning tasks. We", "after": ". Here, we", "start_char_pos": 533, "end_char_pos": 649}, {"type": "R", "before": "of gating to understand the dynamical regimes produced by gating . Our gated RNN reduces to the classical RNNs in certain limits and is closely related to popular gated models in machine learning", "after": "to study the consequences of gating in RNNs", "start_char_pos": 695, "end_char_pos": 890}, {"type": "R", "before": "(RMT) to analytically characterize the spectrum of the Jacobian and", "after": "to", "start_char_pos": 921, "end_char_pos": 988}, {"type": "R", "before": "produces slow modes and marginal stability . Thus, gating is a potential mechanism to implement computations involving line attractor dynamics", "after": "robustly produces marginal stability and line attractors -- important mechanisms for biologically-relevant computations requiring long memory", "start_char_pos": 1005, "end_char_pos": 1147}, {"type": "R", "before": "an analytical prediction", "after": "a novel analytical expression", "start_char_pos": 1266, "end_char_pos": 1290}, {"type": "R", "before": ". We also show that gating gives", "after": "demonstrating its close relation to relaxation time of the dynamics. Gating is also shown to give", "start_char_pos": 1325, "end_char_pos": 1357}, {"type": "R", "before": "is decoupled with", "after": "(topological complexity) is decoupled from", "start_char_pos": 1453, "end_char_pos": 1470}, {"type": "R", "before": "; the nature of this chaotic state is characterized in detail. Using the DMFT and RMT, we produce phase diagramsfor gated RNN", "after": "(dynamical complexity), contrary to a seminal result for additive RNNs. Critical surfaces and regions of marginal stability in the parameter space are indicated in phase diagrams, thus providing a map for principled parameter choices for ML practitioners", "start_char_pos": 1506, "end_char_pos": 1631}, {"type": "R", "before": "address the gradients by leveraging", "after": "develop a field-theory for gradients that arise in training, by incorporating", "start_char_pos": 1646, "end_char_pos": 1681}, {"type": "R", "before": "to develop a DMFT for the gradients. The theory developed here sheds light on the rich dynamical behaviour produced by gating interactions and has implications for architectural choices and learning dynamics", "after": "from control theory in the DMFT. This paves the way for the use of powerful field-theoretic techniques to study training/gradients in large RNNs", "start_char_pos": 1716, "end_char_pos": 1923}], "sents_char_pos": [0, 281, 381, 474, 558, 646, 761, 892, 1049, 1149, 1326, 1507, 1568, 1752]} {"doc_id": "2007.14823", "revision_depth": "2", "before_revision": "Recurrent neural networks (RNNs) are powerful dynamical models, widely used in machine learning (ML) for processing sequential data, and also in neuroscience, to understand the emergent properties of networks of real neurons. Prior theoretical work in understanding the properties of RNNs has focused on models with additive interactions. However, real neurons can have gating -- i.e. multiplicative -- interactions , and gating is also a central feature of the best performing RNNs in machine learning . Here, we develop a dynamical mean-field theory (DMFT) to study the consequences of gating in RNNs. We use random matrix theory to show how gating robustly produces marginal stability and line attractors -- important mechanisms for biologically-relevant computations requiring long memory. The long-time behavior of the gated network is studied using its Lyapunov spectrum, and the DMFT is used to provide a novel analytical expression for the maximum Lyapunov exponent demonstrating its close relation to relaxation time of the dynamics. Gating is also shown to give rise to a novel, discontinuous transition to chaos, where the proliferation of critical points (topological complexity) is decoupled from the appearance of chaotic dynamics (dynamical complexity), contrary to a seminal result for additive RNNs. Critical surfaces and regions of marginal stability in the parameter space are indicated in phase diagrams, thus providing a map for principled parameter choices for ML practitioners. Finally, we develop a field-theory for gradients that arise in training, by incorporating the adjoint sensitivity framework from control theory in the DMFT . This paves the way for the use of powerful field-theoretic techniques to study training / gradients in large RNNs.", "after_revision": "Recurrent neural networks (RNNs) are powerful dynamical models, widely used in machine learning (ML) for processing sequential data, and in neuroscience, to understand the emergent properties of networks of real neurons. Prior theoretical work in understanding the properties of RNNs has focused on networks with additive interactions. However, gating -- i.e. multiplicative -- interactions are ubiquitous in real neurons , and gating is also the central feature of the best-performing RNNs in ML . Here, we study the consequences of gating for the dynamical behavior of RNNs. We show that gating leads to slow modes and a novel, marginally-stable state. The network in this marginally-stable state can function as a robust integrator, and unlike previous approaches, gating permits this function without parameter fine-tuning or special symmetries. We study the long-time behavior of the gated network using its Lyapunov spectrum, and provide a novel relation between the maximum Lyapunov exponent and the relaxation time of the dynamics. Gating is also shown to give rise to a novel, discontinuous transition to chaos, where the proliferation of critical points (topological complexity) is decoupled from the appearance of chaotic dynamics (dynamical complexity), in contrast to a seminal result for additive RNNs. The rich dynamical behavior is summarized in a phase diagram indicating critical surfaces and regions of marginal stability -- thus, providing a map for principled parameter choices to ML practitioners. Finally, we develop a field theory for gradients that arise in training, by combining the adjoint formalism from control theory with the dynamical mean-field theory . This paves the way for the use of powerful field theoretic techniques to study training and gradients in large RNNs.", "edit_actions": [{"type": "D", "before": "also", "after": null, "start_char_pos": 137, "end_char_pos": 141}, {"type": "R", "before": "models", "after": "networks", "start_char_pos": 304, "end_char_pos": 310}, {"type": "D", "before": "real neurons can have", "after": null, "start_char_pos": 348, "end_char_pos": 369}, {"type": "A", "before": null, "after": "are ubiquitous in real neurons", "start_char_pos": 416, "end_char_pos": 416}, {"type": "R", "before": "a", "after": "the", "start_char_pos": 438, "end_char_pos": 439}, {"type": "R", "before": "best performing RNNs in machine learning", "after": "best-performing RNNs in ML", "start_char_pos": 463, "end_char_pos": 503}, {"type": "D", "before": "develop a dynamical mean-field theory (DMFT) to", "after": null, "start_char_pos": 515, "end_char_pos": 562}, {"type": "R", "before": "in", "after": "for the dynamical behavior of", "start_char_pos": 596, "end_char_pos": 598}, {"type": "R", "before": "use random matrix theory to show how gating robustly produces marginal stability and line attractors -- important mechanisms for biologically-relevant computations requiring long memory. The", "after": "show that gating leads to slow modes and a novel, marginally-stable state. The network in this marginally-stable state can function as a robust integrator, and unlike previous approaches, gating permits this function without parameter fine-tuning or special symmetries. We study the", "start_char_pos": 608, "end_char_pos": 798}, {"type": "D", "before": "is studied", "after": null, "start_char_pos": 839, "end_char_pos": 849}, {"type": "D", "before": "the DMFT is used to", "after": null, "start_char_pos": 883, "end_char_pos": 902}, {"type": "R", "before": "analytical expression for", "after": "relation between", "start_char_pos": 919, "end_char_pos": 944}, {"type": "R", "before": "demonstrating its close relation to", "after": "and the", "start_char_pos": 975, "end_char_pos": 1010}, {"type": "R", "before": "contrary", "after": "in contrast", "start_char_pos": 1270, "end_char_pos": 1278}, {"type": "R", "before": "Critical", "after": "The rich dynamical behavior is summarized in a phase diagram indicating critical", "start_char_pos": 1318, "end_char_pos": 1326}, {"type": "R", "before": "in the parameter space are indicated in phase diagrams, thus", "after": "-- thus,", "start_char_pos": 1370, "end_char_pos": 1430}, {"type": "R", "before": "for", "after": "to", "start_char_pos": 1480, "end_char_pos": 1483}, {"type": "R", "before": "field-theory", "after": "field theory", "start_char_pos": 1524, "end_char_pos": 1536}, {"type": "R", "before": "incorporating the adjoint sensitivity framework", "after": "combining the adjoint formalism", "start_char_pos": 1578, "end_char_pos": 1625}, {"type": "R", "before": "in the DMFT", "after": "with the dynamical mean-field theory", "start_char_pos": 1646, "end_char_pos": 1657}, {"type": "R", "before": "field-theoretic", "after": "field theoretic", "start_char_pos": 1703, "end_char_pos": 1718}, {"type": "R", "before": "/", "after": "and", "start_char_pos": 1748, "end_char_pos": 1749}], "sents_char_pos": [0, 225, 338, 505, 604, 794, 1043, 1501]} {"doc_id": "2008.03248", "revision_depth": "1", "before_revision": "This work constructs, analyzes, and simulates a new SEIR-type model for the dynamics and potential control of the current coronavirus ( COVID-19 ) pandemic. It has a compartmental structure and a differential inclusion for a variable infection rate. The novelty in this work is three-fold . First, the population is separated, according to compliance with the disease control directives ( shelter-in-place, masks/face coverings, physical distancing, etc.) , into those who fully follow the directives and those who only partially comply with the directives or are necessarily mobile . This allows the assessment of the overall effectiveness of the control measures and the impact of their relaxing or tightening on the disease spread. Second, the model treats the infection rate as an unknown and keeps track of how it changes , due to virus mutations and saturation effects, via a differential inclusion. Third, by introducing randomness to some of the system coefficients, we study the model's sensitivity to these parameters and provide bounds and intervals of confidence for the model simulations . As a case study, the pandemic outbreak in South Korea is simulated. The model parameters were found by minimizing the deviation of the model prediction from the reported data .The simulations show that the model captures the pandemic dynamics in South Korea accurately , which provides confidence in the model predictions and its future use .", "after_revision": "This work constructs, analyzes, and simulates a new compartmental SEIR-type model for the dynamics and potential control of the current COVID-19 pandemic. The novelty in this work is two-fold . First, the population is divided according to its compliance with disease control directives ( lockdown, shelter-in-place, masks/face coverings, physical distancing, etc.) into those who fully comply and those who follow the directives partially, or are necessarily mobile (such as medical staff). This split, indirectly, reflects on the quality and consistency of these measures. This allows the assessment of the overall effectiveness of the control measures and the impact of their relaxing or tightening on the disease spread. Second, the adequate contact rate, which directly affects the infection rate , is one of the model unknowns, as it keeps track of the changes in the population behavior and the effectiveness of various disease treatment modalities via a differential inclusion. Existence, uniqueness and positivity results are proved using a nonstandard convex analysis-based approach . As a case study, the pandemic outbreak in the Republic of Korea (South Korea) is simulated. The model parameters were found by minimizing the deviation of the model prediction from the reported data over the first 100 days of the pandemic in South Korea .The simulations show that the model captures accurately the pandemic dynamics in the subsequent 75 days , which provides confidence in the model predictions and its future use . In particular, the model predicts that about 40\\% of the infections were not documented, which implies that asymptomatic infections contribute silently but substantially to the spread of the disease indicating that more widespread asymptomatic testing is necessary .", "edit_actions": [{"type": "A", "before": null, "after": "compartmental", "start_char_pos": 52, "end_char_pos": 52}, {"type": "D", "before": "coronavirus (", "after": null, "start_char_pos": 123, "end_char_pos": 136}, {"type": "R", "before": ") pandemic. It has a compartmental structure and a differential inclusion for a variable infection rate.", "after": "pandemic.", "start_char_pos": 146, "end_char_pos": 250}, {"type": "R", "before": "three-fold", "after": "two-fold", "start_char_pos": 279, "end_char_pos": 289}, {"type": "R", "before": "separated, according to compliance with the", "after": "divided according to its compliance with", "start_char_pos": 317, "end_char_pos": 360}, {"type": "A", "before": null, "after": "lockdown,", "start_char_pos": 390, "end_char_pos": 390}, {"type": "D", "before": ",", "after": null, "start_char_pos": 458, "end_char_pos": 459}, {"type": "R", "before": "follow the directives", "after": "comply", "start_char_pos": 481, "end_char_pos": 502}, {"type": "R", "before": "only partially comply with the directives", "after": "follow the directives partially,", "start_char_pos": 517, "end_char_pos": 558}, {"type": "R", "before": ". This", "after": "(such as medical staff). This split, indirectly, reflects on the quality and consistency of these measures. This", "start_char_pos": 585, "end_char_pos": 591}, {"type": "R", "before": "model treats", "after": "adequate contact rate, which directly affects", "start_char_pos": 749, "end_char_pos": 761}, {"type": "R", "before": "as an unknown and", "after": ", is one of the model unknowns, as it", "start_char_pos": 781, "end_char_pos": 798}, {"type": "R", "before": "how it changes , due to virus mutations and saturation effects,", "after": "the changes in the population behavior and the effectiveness of various disease treatment modalities", "start_char_pos": 814, "end_char_pos": 877}, {"type": "R", "before": "Third, by introducing randomness to some of the system coefficients, we study the model's sensitivity to these parameters and provide bounds and intervals of confidence for the model simulations", "after": "Existence, uniqueness and positivity results are proved using a nonstandard convex analysis-based approach", "start_char_pos": 908, "end_char_pos": 1102}, {"type": "R", "before": "South Korea", "after": "the Republic of Korea (South Korea)", "start_char_pos": 1147, "end_char_pos": 1158}, {"type": "A", "before": null, "after": "over the first 100 days of the pandemic in South Korea", "start_char_pos": 1280, "end_char_pos": 1280}, {"type": "A", "before": null, "after": "accurately", "start_char_pos": 1327, "end_char_pos": 1327}, {"type": "R", "before": "South Korea accurately", "after": "the subsequent 75 days", "start_char_pos": 1353, "end_char_pos": 1375}, {"type": "A", "before": null, "after": ". In particular, the model predicts that about 40\\% of the infections were not documented, which implies that asymptomatic infections contribute silently but substantially to the spread of the disease indicating that more widespread asymptomatic testing is necessary", "start_char_pos": 1448, "end_char_pos": 1448}], "sents_char_pos": [0, 157, 250, 291, 586, 736, 907, 1104, 1172, 1282]} {"doc_id": "2008.04418", "revision_depth": "1", "before_revision": "COVID-19 was first detected in Hubei province of China and has had severe impact on the life in the country since then. We investigate how this epidemic has influenced attention dynamics on the biggest Chinese microblogging website Sina Weibo in the period December 16, 2019 - April 17, 2020. We focus on the real-time Hot Search List (HSL), which provides the ranking of the most popular 50 hashtags based on the amount of Sina Weibo searches on them . We show , how the specific events, measures and developments during the epidemic affected the emergence of new hashtags and the ranking on the HSL. A significant increase of COVID-19 related hashtags started to occur on HSL around January 20, 2020, when the transmission of the disease between humans was announced. Then very rapidly a situation was reached , where the participation of the COVID-related hashtags occupied 30-70\\% of the HSL, however, with changing content. We give an analysis of how the hashtag topics changed during the investigated time span and conclude that there are three periods separated by February 12 and March 12. In period 1, we see strong topical correlations and clustering of hashtags; in period 2, the correlations are weakened, without clustering pattern; in period 3, we see potential of clustering while not as strong as in period 1. To quantify the dynamics of HSL we measured the lifetimes of hashtags on the list and the rank diversity at given ranks. Our observations indicate attention diversification since the COVID-19 outbreak in Mainland China and a higher rank diversity at the top 15 ranks on HSL due to the COVID-19 related hashtags, a drastic attention decay shortly after the outburst and a slower decay for a longer period .", "after_revision": "Understanding attention dynamics on social media during pandemics could help governments minimize the effects. We focus on how COVID-19 has influenced the attention dynamics on the biggest Chinese microblogging website Sina Weibo during the first four months of the pandemic. We study the real-time Hot Search List (HSL), which provides the ranking of the most popular 50 hashtags based on the amount of Sina Weibo searches . We show how the specific events, measures and developments during the epidemic affected the emergence of different kinds of hashtags and the ranking on the HSL. A significant increase of COVID-19 related hashtags started to occur on HSL around January 20, 2020, when the transmission of the disease between humans was announced. Then very rapidly a situation was reached where COVID-related hashtags occupied 30-70\\% of the HSL, however, with changing content. We give an analysis of how the hashtag topics changed during the investigated time span and conclude that there are three periods separated by February 12 and March 12. In period 1, we see strong topical correlations and clustering of hashtags; in period 2, the correlations are weakened, without clustering pattern; in period 3, we see a potential of clustering while not as strong as in period 1. We further explore the dynamics of HSL by measuring the ranking dynamics and the lifetimes of hashtags on the list . This way we can obtain information about the decay of attention, which is important for decisions about the temporal placement of governmental measures to achieve permanent awareness. Furthermore, our observations indicate abnormally higher rank diversity in the top 15 ranks on HSL due to the COVID-19 related hashtags, revealing the possibility of algorithmic intervention from the platform provider .", "edit_actions": [{"type": "R", "before": "COVID-19 was first detected in Hubei province of China and has had severe impact on", "after": "Understanding attention dynamics on social media during pandemics could help governments minimize the effects. We focus on how COVID-19 has influenced", "start_char_pos": 0, "end_char_pos": 83}, {"type": "D", "before": "life in the country since then. We investigate how this epidemic has influenced", "after": null, "start_char_pos": 88, "end_char_pos": 167}, {"type": "R", "before": "in the period December 16, 2019 - April 17, 2020. We focus on", "after": "during the first four months of the pandemic. We study", "start_char_pos": 243, "end_char_pos": 304}, {"type": "D", "before": "on them", "after": null, "start_char_pos": 444, "end_char_pos": 451}, {"type": "D", "before": ",", "after": null, "start_char_pos": 462, "end_char_pos": 463}, {"type": "R", "before": "new", "after": "different kinds of", "start_char_pos": 561, "end_char_pos": 564}, {"type": "R", "before": ", where the participation of the", "after": "where", "start_char_pos": 812, "end_char_pos": 844}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1266, "end_char_pos": 1266}, {"type": "R", "before": "To quantify", "after": "We further explore", "start_char_pos": 1327, "end_char_pos": 1338}, {"type": "R", "before": "we measured the", "after": "by measuring the ranking dynamics and the", "start_char_pos": 1359, "end_char_pos": 1374}, {"type": "R", "before": "and the rank diversity at given ranks. Our observations indicate attention diversification since the COVID-19 outbreak in Mainland China and a", "after": ". This way we can obtain information about the decay of attention, which is important for decisions about the temporal placement of governmental measures to achieve permanent awareness. Furthermore, our observations indicate abnormally", "start_char_pos": 1409, "end_char_pos": 1551}, {"type": "R", "before": "at", "after": "in", "start_char_pos": 1574, "end_char_pos": 1576}, {"type": "R", "before": "a drastic attention decay shortly after the outburst and a slower decay for a longer period", "after": "revealing the possibility of algorithmic intervention from the platform provider", "start_char_pos": 1639, "end_char_pos": 1730}], "sents_char_pos": [0, 119, 292, 453, 769, 928, 1097, 1173, 1245, 1326, 1447]} {"doc_id": "2008.05816", "revision_depth": "1", "before_revision": "This paper improves guaranteed error control for the Stokes problem with a focus on pressure-robustness, i.e. for discretisations that compute a discrete velocity that is independent of the exact pressure. A Prager-Synge type result relates the errors of divergence-free primal and H( )-conforming dual mixed methods ( for the velocity gradient) with an equilibration constraint that needs special care when discretised. To relax the constraints on the primal and dual method , a more general result is derived that enables the use of a recently developed mass conserving mixed stress discretisation to design equilibrated fluxes that yield pressure-independent guaranteed upper bounds for any pressure-robust ( but not necessarily divergence-free) primal discretisation. Moreover, a provably efficient local design of the equilibrated fluxes is presented that reduces the numerical costsof the error estimator. All theoretical findings are verified by numerical examples which also show that the efficiency indices of our novel guaranteed upper bounds for the velocity error are close to 1.", "after_revision": "This paper aims to improve guaranteed error control for the Stokes problem with a focus on pressure-robustness, i.e. for discretisations that compute a discrete velocity that is independent of the exact pressure. A Prager--Synge type result relates the velocity errors of divergence-free primal and perfectly equilibrated dual mixed methods for the velocity stress. The first main result of the paper is a framework with relaxed constraints on the primal and dual method . This enables to use a recently developed mass conserving mixed stress discretisation for the design of equilibrated fluxes and to obtain pressure-independent guaranteed upper bounds for any pressure-robust ( not necessarily divergence-free) primal discretisation. The second main result is a provably efficient local design of the equilibrated fluxes with comparably low numerical costs. Numerical examples verify the theoretical findings and show that efficiency indices of our novel guaranteed upper bounds are close to one.", "edit_actions": [{"type": "R", "before": "improves", "after": "aims to improve", "start_char_pos": 11, "end_char_pos": 19}, {"type": "R", "before": "Prager-Synge", "after": "Prager--Synge", "start_char_pos": 208, "end_char_pos": 220}, {"type": "A", "before": null, "after": "velocity", "start_char_pos": 245, "end_char_pos": 245}, {"type": "D", "before": "H(", "after": null, "start_char_pos": 283, "end_char_pos": 285}, {"type": "R", "before": ")-conforming", "after": "perfectly equilibrated", "start_char_pos": 286, "end_char_pos": 298}, {"type": "D", "before": "(", "after": null, "start_char_pos": 318, "end_char_pos": 319}, {"type": "R", "before": "gradient) with an equilibration constraint that needs special care when discretised. To relax the", "after": "stress. The first main result of the paper is a framework with relaxed", "start_char_pos": 337, "end_char_pos": 434}, {"type": "R", "before": ", a more general result is derived that enables the use of", "after": ". This enables to use", "start_char_pos": 477, "end_char_pos": 535}, {"type": "R", "before": "to design equilibrated fluxes that yield", "after": "for the design of equilibrated fluxes and to obtain", "start_char_pos": 601, "end_char_pos": 641}, {"type": "D", "before": "but", "after": null, "start_char_pos": 713, "end_char_pos": 716}, {"type": "R", "before": "Moreover,", "after": "The second main result is", "start_char_pos": 773, "end_char_pos": 782}, {"type": "R", "before": "is presented that reduces the numerical costsof the error estimator. All theoretical findings are verified by numerical examples which also show that the", "after": "with comparably low numerical costs. Numerical examples verify the theoretical findings and show that", "start_char_pos": 844, "end_char_pos": 997}, {"type": "D", "before": "for the velocity error", "after": null, "start_char_pos": 1054, "end_char_pos": 1076}, {"type": "R", "before": "1.", "after": "one.", "start_char_pos": 1090, "end_char_pos": 1092}], "sents_char_pos": [0, 205, 421, 772, 912]} {"doc_id": "2008.06909", "revision_depth": "1", "before_revision": "Minimal paths are considered as a powerful and efficient tool for boundary detection and image segmentation due to its global optimality and well-established numerical solutions such as fast marching algorithm . In this paper, we introduce a flexible interactive image segmentation model based on the minimal geodesic framework in conjunction with region-based homogeneity enhancement. A key ingredient in our model is the construction of Finsler geodesic metrics, which are capable of integrating anisotropic and asymmetric edge features, region-based homogeneity and/or curvature regularization. This is done by exploiting an implicit method to incorporate the region-based homogeneity information to the metrics used . Moreover, we also introduce a way to build objective simple closed contours , each of which is treated as the concatenation of two disjoint open paths . Experimental results prove that the proposed model indeed outperforms state-of-the-art minimal paths-based image segmentation approaches.", "after_revision": "Minimal paths are regarded as a powerful and efficient tool for boundary detection and image segmentation due to its global optimality and the well-established numerical solutions such as fast marching method . In this paper, we introduce a flexible interactive image segmentation model based on the Eikonal partial differential equation (PDE) framework in conjunction with region-based homogeneity enhancement. A key ingredient in the introduced model is the construction of local geodesic metrics, which are capable of integrating anisotropic and asymmetric edge features, implicit region-based homogeneity features and/or curvature regularization. The incorporation of the region-based homogeneity features into the metrics considered relies on an implicit representation of these features, which is one of the contributions of this work . Moreover, we also introduce a way to build simple closed contours as the concatenation of two disjoint open curves . Experimental results prove that the proposed model indeed outperforms state-of-the-art minimal paths-based image segmentation approaches.", "edit_actions": [{"type": "R", "before": "considered", "after": "regarded", "start_char_pos": 18, "end_char_pos": 28}, {"type": "A", "before": null, "after": "the", "start_char_pos": 141, "end_char_pos": 141}, {"type": "R", "before": "algorithm", "after": "method", "start_char_pos": 201, "end_char_pos": 210}, {"type": "R", "before": "minimal geodesic", "after": "Eikonal partial differential equation (PDE)", "start_char_pos": 302, "end_char_pos": 318}, {"type": "R", "before": "our", "after": "the introduced", "start_char_pos": 407, "end_char_pos": 410}, {"type": "R", "before": "Finsler", "after": "local", "start_char_pos": 440, "end_char_pos": 447}, {"type": "A", "before": null, "after": "implicit", "start_char_pos": 541, "end_char_pos": 541}, {"type": "A", "before": null, "after": "features", "start_char_pos": 567, "end_char_pos": 567}, {"type": "R", "before": "This is done by exploiting an implicit method to incorporate", "after": "The incorporation of", "start_char_pos": 601, "end_char_pos": 661}, {"type": "R", "before": "information to the metrics used", "after": "features into the metrics considered relies on an implicit representation of these features, which is one of the contributions of this work", "start_char_pos": 691, "end_char_pos": 722}, {"type": "D", "before": "objective", "after": null, "start_char_pos": 768, "end_char_pos": 777}, {"type": "D", "before": ", each of which is treated", "after": null, "start_char_pos": 801, "end_char_pos": 827}, {"type": "R", "before": "paths", "after": "curves", "start_char_pos": 870, "end_char_pos": 875}], "sents_char_pos": [0, 212, 386, 600, 724]} {"doc_id": "2008.07008", "revision_depth": "1", "before_revision": "Moving object segmentation is a crucial task for autonomous vehicles as it can be used to segment objects in a class agnostic manner based on its motion cues. It will enable the detection of objects unseen during training (e.g., moose or a construction truck) generically based on their motion. Although pixel-wise motion segmentation has been studied in the literature, it is not dealt with at instance level, which would help separate connected segments of moving objects leading to better trajectory planning. In this paper, we proposed a motion-based instance segmentation task and created a new annotated dataset based on KITTI , which will be released publicly. We make use of the YOLACT model to solve the instance motion segmentationnetwork by feeding inflow and image as input and instance motion masks as output. We extend it to a multi-task model that learns semantic and motion instance segmentation in a computationally efficient manner. Our model is based on sharing a prototype generation network between the two tasks and learning separate prototype coefficients per task . To obtain real-time performance, we study different efficient encoders and obtain 39 fps on a Titan Xp GPU using MobileNetV2 with an improvement of 10\\% mAP relative to the baseline. A video demonstration of our work is available in URL", "after_revision": "Moving object segmentation is a crucial task for autonomous vehicles as it can be used to segment objects in a class agnostic manner based on their motion cues. It enables the detection of unknown objects during training (e.g., moose or a construction truck) based on their motion. Although pixel-wise motion segmentation has been studied in autonomous driving literature, it is not dealt with on the instance level, which would help separate connected segments of moving objects leading to better trajectory planning. Other generic video object segmentation tasks have dealt with instance-wise motion segmentation but on much simpler setting and have not dealt with the multi-task learning problem for both semantic and class agnostic instance segmentation. In this paper, we propose a motion-based instance segmentation task and provide a new annotated dataset based on KITTIMoSeg , which will be released publicly. Our dataset provide extra class annotations which is crucial for studying class agnostic segmentation. We further propose an efficient multi-task learning approach that learns an extra class agnostic instance segmentation head through sharing the prototype generation network with the semantic head. The model then learns separate prototype coefficients within the class agnostic and semantic heads . To obtain real-time performance, we study different efficient encoders and obtain 39 fps on a Titan Xp GPU using MobileNetV2 with an improvement of 10\\% mAP relative to the baseline. Our model outperforms state of the art motion segmentation methods with 3.3\\% improvement. We summarize our work in a short video with qualitative results at URL", "edit_actions": [{"type": "R", "before": "its", "after": "their", "start_char_pos": 142, "end_char_pos": 145}, {"type": "R", "before": "will enable", "after": "enables", "start_char_pos": 162, "end_char_pos": 173}, {"type": "R", "before": "objects unseen", "after": "unknown objects", "start_char_pos": 191, "end_char_pos": 205}, {"type": "D", "before": "generically", "after": null, "start_char_pos": 260, "end_char_pos": 271}, {"type": "R", "before": "the", "after": "autonomous driving", "start_char_pos": 355, "end_char_pos": 358}, {"type": "R", "before": "at", "after": "on the", "start_char_pos": 392, "end_char_pos": 394}, {"type": "A", "before": null, "after": "Other generic video object segmentation tasks have dealt with instance-wise motion segmentation but on much simpler setting and have not dealt with the multi-task learning problem for both semantic and class agnostic instance segmentation.", "start_char_pos": 513, "end_char_pos": 513}, {"type": "R", "before": "proposed", "after": "propose", "start_char_pos": 532, "end_char_pos": 540}, {"type": "R", "before": "created", "after": "provide", "start_char_pos": 587, "end_char_pos": 594}, {"type": "R", "before": "KITTI", "after": "KITTIMoSeg", "start_char_pos": 628, "end_char_pos": 633}, {"type": "R", "before": "We make use of the YOLACT model to solve the instance motion segmentationnetwork by feeding inflow and image as input and instance motion masks as output. We extend it to a", "after": "Our dataset provide extra class annotations which is crucial for studying class agnostic segmentation. We further propose an efficient", "start_char_pos": 669, "end_char_pos": 841}, {"type": "R", "before": "model that learns semantic and motion instance segmentation in a computationally efficient manner. Our model is based on sharing a", "after": "learning approach that learns an extra class agnostic instance segmentation head through sharing the", "start_char_pos": 853, "end_char_pos": 983}, {"type": "R", "before": "between the two tasks and learning", "after": "with the semantic head. The model then learns", "start_char_pos": 1013, "end_char_pos": 1047}, {"type": "R", "before": "per task", "after": "within the class agnostic and semantic heads", "start_char_pos": 1080, "end_char_pos": 1088}, {"type": "R", "before": "A video demonstration of our work is available in", "after": "Our model outperforms state of the art motion segmentation methods with 3.3\\% improvement. We summarize our work in a short video with qualitative results at", "start_char_pos": 1274, "end_char_pos": 1323}], "sents_char_pos": [0, 158, 294, 512, 668, 823, 951, 1090, 1273]} {"doc_id": "2008.08759", "revision_depth": "1", "before_revision": "The issue in solving social problems is how to respect minority opinions , which are often ignored in general majority rules. To build consensus on pluralistic values and make social choices in consideration of minority opinions, we propose aggregation methods that give weighting to the minority's positionality on cardinal cumulative voting. Based on quadratic and linear voting, we formulated three weighted aggregation methods that differ in the ratio of votes to cumulative points and the weighting of the minority to all members, and calculated the frequency distributions of the aggregation results, assuming that the distributions of votes follow normal distributions . From these calculation results, we found that minority opinions are likely to be reflected as weighting increases proportionally in two of the above three methods. This means that Sen and Gotoh's idea of considering the social position of unfortunate people on ordinal ranking , that welfare economicsconsiders under an axiomatic approach, was shown by weighting the minority's positionality on cardinal voting. In addition, we can know the contents such as the number and positionality of the minority from the analysis of the aggregation results. It will be useful for promoting mutual understanding between the majority and minority by visualizing the contents of the proposed aggregation methods interactively in the consensus-building process. With the further development of information technology, the consensus building on cardinal choices based on big data will be necessary. We would like to use the proposed aggregation methods for making social choices for pluralistic values such as social, environmental, and economic.", "after_revision": "Respecting minority opinions is vital in solving social problems . However, minority opinions are often ignored in general majority rules. To build consensus on pluralistic values and make social choices that consider minority opinions, we propose aggregation methods that give weighting to the minority's positionality on cardinal cumulative voting. Based on quadratic and linear voting, we formulated three weighted aggregation methods that differ in the ratio of votes to cumulative points and the weighting of the minority to all members, and assuming that the distributions of votes follow normal distributions , we calculated the frequency distributions of the aggregation results. We found that minority opinions are more likely to be reflected proportionately to the average of the distribution in two of the above three methods. This implies that Sen and Gotoh's idea of considering the social position of unfortunate people on ordinal ranking in the welfare economics, was illustrated by weighting the minority's positionality on cardinal voting. In addition, it is possible to visualize the number and positionality of the minority from the analysis of the aggregation results. These results will be useful to promote mutual understanding between the majority and minority by interactively visualizing the contents of the proposed aggregation methods in the consensus-building process. With the further development of information technology, the consensus building based on big data will be necessary. We recommend the use of our proposed aggregation methods to make social choices for pluralistic values such as social, environmental, and economic.", "edit_actions": [{"type": "R", "before": "The issue", "after": "Respecting minority opinions is vital", "start_char_pos": 0, "end_char_pos": 9}, {"type": "R", "before": "is how to respect minority opinions , which", "after": ". However, minority opinions", "start_char_pos": 37, "end_char_pos": 80}, {"type": "R", "before": "in consideration of", "after": "that consider", "start_char_pos": 191, "end_char_pos": 210}, {"type": "D", "before": "calculated the frequency distributions of the aggregation results,", "after": null, "start_char_pos": 540, "end_char_pos": 606}, {"type": "R", "before": ". From these calculation results, we", "after": ", we calculated the frequency distributions of the aggregation results. We", "start_char_pos": 676, "end_char_pos": 712}, {"type": "A", "before": null, "after": "more", "start_char_pos": 746, "end_char_pos": 746}, {"type": "R", "before": "as weighting increases proportionally", "after": "proportionately to the average of the distribution", "start_char_pos": 770, "end_char_pos": 807}, {"type": "R", "before": "means", "after": "implies", "start_char_pos": 848, "end_char_pos": 853}, {"type": "R", "before": ", that welfare economicsconsiders under an axiomatic approach, was shown", "after": "in the welfare economics, was illustrated", "start_char_pos": 956, "end_char_pos": 1028}, {"type": "R", "before": "we can know the contents such as the", "after": "it is possible to visualize the", "start_char_pos": 1104, "end_char_pos": 1140}, {"type": "R", "before": "It", "after": "These results", "start_char_pos": 1228, "end_char_pos": 1230}, {"type": "R", "before": "for promoting", "after": "to promote", "start_char_pos": 1246, "end_char_pos": 1259}, {"type": "A", "before": null, "after": "interactively", "start_char_pos": 1318, "end_char_pos": 1318}, {"type": "D", "before": "interactively", "after": null, "start_char_pos": 1380, "end_char_pos": 1393}, {"type": "D", "before": "on cardinal choices", "after": null, "start_char_pos": 1508, "end_char_pos": 1527}, {"type": "R", "before": "would like to use the", "after": "recommend the use of our", "start_char_pos": 1568, "end_char_pos": 1589}, {"type": "R", "before": "for making", "after": "to make", "start_char_pos": 1619, "end_char_pos": 1629}], "sents_char_pos": [0, 125, 343, 677, 842, 1090, 1227, 1428, 1564]} {"doc_id": "2008.08896", "revision_depth": "1", "before_revision": "Systems that generate sentences from (abstract ) meaning representations (AMRs) are typically evaluated using automatic surface matching metrics that compare the generated texts to the texts that were originally given to human annotators to construct AMR meaning representations . However, besides well-known issues from which such metrics suffer (Callison-Burch et al., 2006; Novikova et al., 2017), we show that an additional problem arises when applied for AMR-to-text evaluation because mapping from the more abstract domain of AMR to the more concrete domain of sentences allows for manifold sentence realizations. In this work we aim to alleviate these issues and propose MF_\\beta, an automatic metric that builds on two pillars. The first pillar is the principle of meaning preservation \\mathcal{M}: it measures to what extent the original AMR graph can be reconstructed from the generated sentence . We implement this principle by i) automatically constructing an AMR from the generated sentence using state-of-the-art AMR parsers and ii) apply fine-grained principled AMR metrics to measure the distance between the original and the reconstructed AMR. The second pillar builds on a principle of (grammatical) form \\mathcal{F} , which measures the linguistic quality of the generated sentences , which we implement using SOTA language models. We show - theoretically and experimentally - that fulfillment of both principles offers several benefits for evaluation of AMR-to-text systems, including the explainability of scores \\mathcal{F}_\\beta does not necessarily rely on gold AMRs, it may extend to other text generation tasks} .", "after_revision": "Systems that generate natural language text from abstract meaning representations such as AMR are typically evaluated using automatic surface matching metrics that compare the generated texts to reference texts from which the input meaning representations were constructed. We show that besides well-known issues from which such metrics suffer , an additional problem arises when applying these metrics for AMR-to-text evaluation , since an abstract meaning representation allows for numerous surface realizations. In this work we aim to alleviate these issues by proposing MF_\\beta, a decomposable metric that builds on two pillars. The first is the principle of meaning preservation \\mathcal{M}: it measures to what extent a given AMR can be reconstructed from the generated sentence using SOTA AMR parsers and applying ( fine-grained ) AMR evaluation metrics to measure the distance between the original and the reconstructed AMR. The second pillar builds on a principle of (grammatical) form \\mathcal{F} that measures the linguistic quality of the generated text , which we implement using SOTA language models. In two extensive pilot studies we show that fulfillment of both principles offers benefits for AMR-to-text evaluation, including explainability of scores . Since \\mathcal{M\\mathcal{F}_\\beta does not necessarily rely on gold AMRs, it may extend to other text generation tasks} .", "edit_actions": [{"type": "R", "before": "sentences from (abstract ) meaning representations (AMRs)", "after": "natural language text from abstract meaning representations such as AMR", "start_char_pos": 22, "end_char_pos": 79}, {"type": "R", "before": "the texts that were originally given to human annotators to construct AMR meaning representations . However,", "after": "reference texts from which the input meaning representations were constructed. We show that", "start_char_pos": 181, "end_char_pos": 289}, {"type": "R", "before": "(Callison-Burch et al., 2006; Novikova et al., 2017), we show that", "after": ",", "start_char_pos": 347, "end_char_pos": 413}, {"type": "R", "before": "applied", "after": "applying these metrics", "start_char_pos": 448, "end_char_pos": 455}, {"type": "R", "before": "because mapping from the more abstract domain of AMR to the more concrete domain of sentences allows for manifold sentence", "after": ", since an abstract meaning representation allows for numerous surface", "start_char_pos": 483, "end_char_pos": 605}, {"type": "R", "before": "and propose", "after": "by proposing", "start_char_pos": 666, "end_char_pos": 677}, {"type": "R", "before": "an automatic", "after": "a decomposable", "start_char_pos": 688, "end_char_pos": 700}, {"type": "D", "before": "pillar", "after": null, "start_char_pos": 746, "end_char_pos": 752}, {"type": "R", "before": "the original AMR graph", "after": "a given AMR", "start_char_pos": 834, "end_char_pos": 856}, {"type": "R", "before": ". We implement this principle by i) automatically constructing an AMR from the generated sentence using state-of-the-art", "after": "using SOTA", "start_char_pos": 906, "end_char_pos": 1026}, {"type": "R", "before": "ii) apply", "after": "applying (", "start_char_pos": 1043, "end_char_pos": 1052}, {"type": "R", "before": "principled AMR", "after": ") AMR evaluation", "start_char_pos": 1066, "end_char_pos": 1080}, {"type": "R", "before": ", which", "after": "that", "start_char_pos": 1235, "end_char_pos": 1242}, {"type": "R", "before": "sentences", "after": "text", "start_char_pos": 1292, "end_char_pos": 1301}, {"type": "R", "before": "We show - theoretically and experimentally -", "after": "In two extensive pilot studies we show", "start_char_pos": 1351, "end_char_pos": 1395}, {"type": "R", "before": "several benefits for evaluation of", "after": "benefits for", "start_char_pos": 1439, "end_char_pos": 1473}, {"type": "R", "before": "systems, including the", "after": "evaluation, including", "start_char_pos": 1486, "end_char_pos": 1508}, {"type": "A", "before": null, "after": ". Since \\mathcal{M", "start_char_pos": 1534, "end_char_pos": 1534}], "sents_char_pos": [0, 280, 376, 619, 735, 907, 1350]} {"doc_id": "2008.09657", "revision_depth": "2", "before_revision": "Learning feature space node embeddings that encode the position of a node within the context of a graph is useful in several graph prediction tasks. Majority of the existing graph neural networks (GNN) learn node embeddings that encode their local neighborhoods but not their positions. Consequently, two nodes that are vastly distant but located in similar local neighborhoods would map to similar embeddings . This limitation may prevent accurate performance in predictive tasks that rely on position information. In this paper,we address this gap by developing GraphReach, a position-aware , inductive GNN . GraphReach captures the global positions of nodes though reachability estimations with respect to a set of nodes called anchors. The reachability estimations compute the frequency with which a node may visit an anchor through any possible path. The anchors are strategically selected so that the reachability estimations across all nodes are maximized. We show that this combinatorial anchor selection problem is NP-hard and consequently, develop a greedy (1-1/e) approximation . An extensive experimental evaluation covering six datasets and five state-of-the-art GNN architectures reveal that GraphReach is consistently superior and provides up to 40\\% relative improvement in the predictive tasks of link prediction and pairwise node classification . In addition, GraphReach is more robust against adversarial attacks.", "after_revision": " Majority of the existing graph neural networks (GNN) learn node embeddings that encode their local neighborhoods but not their positions. Consequently, two nodes that are vastly distant but located in similar local neighborhoods map to similar embeddings in those networks . This limitation prevents accurate performance in predictive tasks that rely on position information. In this paper,we develop GraphReach, a position-aware inductive GNN that captures the global positions of nodes through reachability estimations with respect to a set of anchor nodes. The anchors are strategically selected so that reachability estimations across all the nodes are maximized. We show that this combinatorial anchor selection problem is NP-hard and , consequently, develop a greedy (1-1/e) approximation heuristic. Empirical evaluation against state-of-the-art GNN architectures reveal that GraphReach provides up to 40\\% relative improvement in accuracy . In addition, it is more robust to adversarial attacks.", "edit_actions": [{"type": "D", "before": "Learning feature space node embeddings that encode the position of a node within the context of a graph is useful in several graph prediction tasks.", "after": null, "start_char_pos": 0, "end_char_pos": 148}, {"type": "D", "before": "would", "after": null, "start_char_pos": 378, "end_char_pos": 383}, {"type": "A", "before": null, "after": "in those networks", "start_char_pos": 410, "end_char_pos": 410}, {"type": "R", "before": "may prevent", "after": "prevents", "start_char_pos": 429, "end_char_pos": 440}, {"type": "R", "before": "address this gap by developing", "after": "develop", "start_char_pos": 534, "end_char_pos": 564}, {"type": "R", "before": ", inductive GNN . GraphReach", "after": "inductive GNN that", "start_char_pos": 594, "end_char_pos": 622}, {"type": "R", "before": "though", "after": "through", "start_char_pos": 662, "end_char_pos": 668}, {"type": "R", "before": "nodes called anchors. The reachability estimations compute the frequency with which a node may visit an anchor through any possible path. The", "after": "anchor nodes. The", "start_char_pos": 719, "end_char_pos": 860}, {"type": "D", "before": "the", "after": null, "start_char_pos": 904, "end_char_pos": 907}, {"type": "A", "before": null, "after": "the", "start_char_pos": 944, "end_char_pos": 944}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1038, "end_char_pos": 1038}, {"type": "R", "before": ". An extensive experimental evaluation covering six datasets and five", "after": "heuristic. Empirical evaluation against", "start_char_pos": 1092, "end_char_pos": 1161}, {"type": "D", "before": "is consistently superior and", "after": null, "start_char_pos": 1220, "end_char_pos": 1248}, {"type": "R", "before": "the predictive tasks of link prediction and pairwise node classification", "after": "accuracy", "start_char_pos": 1293, "end_char_pos": 1365}, {"type": "R", "before": "GraphReach", "after": "it", "start_char_pos": 1381, "end_char_pos": 1391}, {"type": "R", "before": "against", "after": "to", "start_char_pos": 1407, "end_char_pos": 1414}], "sents_char_pos": [0, 148, 286, 412, 516, 740, 856, 965, 1093, 1367]} {"doc_id": "2008.12988", "revision_depth": "1", "before_revision": "We give a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. These algorithms are easy to implement, given the prevalence of automatic differentiation software. We motivate the development of our framework with several cautionary tales of previous re-search , which has developed numerous less-than-optimal algorithms for computing expectations and their gradients. We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria. As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence. In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reducesthe runtime complexity by a factor (or two) of the sentence length. We validate the implementation of our framework through runtime experiments. We find our algorithms are upto 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively.", "after_revision": "We give a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. These algorithms are easy to implement, given the prevalence of automatic differentiation software. We motivate the development of our framework with several cautionary tales of previous research , which has developed numerous less-than-optimal algorithms for computing expectations and their gradients. We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria. As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence. In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor (or two) of the sentence length. We validate the implementation of our framework through runtime experiments. We find our algorithms are up to 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively.", "edit_actions": [{"type": "R", "before": "re-search", "after": "research", "start_char_pos": 553, "end_char_pos": 562}, {"type": "R", "before": "reducesthe", "after": "reduces the", "start_char_pos": 1062, "end_char_pos": 1072}, {"type": "R", "before": "upto", "after": "up to", "start_char_pos": 1241, "end_char_pos": 1245}], "sents_char_pos": [0, 66, 233, 365, 465, 670, 854, 965, 1136, 1213]} {"doc_id": "2008.12988", "revision_depth": "2", "before_revision": "We give a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. These algorithms are easy to implement, given the prevalence of automatic differentiation software. We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous less-than-optimal algorithms for computing expectations and their gradients. We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria . As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence . In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor (or two) of the sentence length. We validate the implementation of our framework through runtime experiments. We find our algorithms are up to 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively .", "after_revision": "We propose a general framework for computing expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous inefficient algorithms for computing expectations and their gradients. We demonstrate how our framework efficiently computes several quantities with known algorithms, including the Shannon entropy, the expected attachment score, and the generalized expectation criterion . As a bonus, we give algorithms for quantities that are missing in the literature, including the gradient of entropy, the KL divergence, and the gradient of the KL divergence . In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor of the sentence length. We validate our framework through rigorous proofs of correctness and efficiency .", "edit_actions": [{"type": "R", "before": "give", "after": "propose", "start_char_pos": 3, "end_char_pos": 7}, {"type": "R", "before": "inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations", "after": "computing expectations", "start_char_pos": 32, "end_char_pos": 178}, {"type": "D", "before": "These algorithms are easy to implement, given the prevalence of automatic differentiation software.", "after": null, "start_char_pos": 366, "end_char_pos": 465}, {"type": "R", "before": "cautionary tales", "after": "cautionary tales", "start_char_pos": 524, "end_char_pos": 540}, {"type": "R", "before": "less-than-optimal", "after": "inefficient", "start_char_pos": 592, "end_char_pos": 609}, {"type": "A", "before": null, "after": "Shannon entropy, the", "start_char_pos": 779, "end_char_pos": 779}, {"type": "R", "before": "entropy, and generalized expectation criteria", "after": "and the generalized expectation criterion", "start_char_pos": 807, "end_char_pos": 852}, {"type": "R", "before": "KL divergence", "after": "gradient of entropy, the KL divergence, and the gradient of the KL divergence", "start_char_pos": 951, "end_char_pos": 964}, {"type": "D", "before": "(or two)", "after": null, "start_char_pos": 1106, "end_char_pos": 1114}, {"type": "D", "before": "the implementation of", "after": null, "start_char_pos": 1151, "end_char_pos": 1172}, {"type": "R", "before": "runtime experiments. We find our algorithms are up to 12 and 26 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively", "after": "rigorous proofs of correctness and efficiency", "start_char_pos": 1195, "end_char_pos": 1402}], "sents_char_pos": [0, 66, 233, 365, 465, 668, 854, 966, 1138, 1215]} {"doc_id": "2008.12988", "revision_depth": "3", "before_revision": "We propose a general framework for computing expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous inefficient algorithms for computing expectations and their gradients. We demonstrate how our framework efficiently computes several quantities with known algorithms, including the Shannon entropy, the expected attachment score, and the generalized expectation criterion . As a bonus, we give algorithms for quantities that are missing in the literature, including the gradient of entropy, the KL divergence, and the gradient of the KL divergence . In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor of the sentence length. We validate our framework through rigorous proofs of correctness and efficiency .", "after_revision": "We give a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models. Our algorithms exploit a fundamental connection between gradients and expectations, which allows us to derive efficient algorithms. These algorithms are easy to implement with or without automatic differentiation software. We motivate the development of our framework with several cautionary tales of previous research, which has developed numerous inefficient algorithms for computing expectations and their gradients. We demonstrate how our framework efficiently computes several quantities with known algorithms, including the expected attachment score, entropy, and generalized expectation criteria . As a bonus, we give algorithms for quantities that are missing in the literature, including the KL divergence . In all cases, our approach matches the efficiency of existing algorithms and, in several cases, reduces the runtime complexity by a factor of the sentence length. We validate the implementation of our framework through runtime experiments. We find our algorithms are up to 15 and 9 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively .", "edit_actions": [{"type": "R", "before": "propose", "after": "give", "start_char_pos": 3, "end_char_pos": 10}, {"type": "R", "before": "computing expectations", "after": "inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations", "start_char_pos": 35, "end_char_pos": 57}, {"type": "A", "before": null, "after": "These algorithms are easy to implement with or without automatic differentiation software.", "start_char_pos": 245, "end_char_pos": 245}, {"type": "D", "before": "Shannon entropy, the", "after": null, "start_char_pos": 553, "end_char_pos": 573}, {"type": "R", "before": "and the generalized expectation criterion", "after": "entropy, and generalized expectation criteria", "start_char_pos": 601, "end_char_pos": 642}, {"type": "R", "before": "gradient of entropy, the KL divergence, and the gradient of the KL divergence", "after": "KL divergence", "start_char_pos": 741, "end_char_pos": 818}, {"type": "A", "before": null, "after": "the implementation of", "start_char_pos": 996, "end_char_pos": 996}, {"type": "R", "before": "rigorous proofs of correctness and efficiency", "after": "runtime experiments. We find our algorithms are up to 15 and 9 times faster than previous algorithms for computing the Shannon entropy and the gradient of the generalized expectation objective, respectively", "start_char_pos": 1019, "end_char_pos": 1064}], "sents_char_pos": [0, 112, 244, 442, 644, 820, 983]} {"doc_id": "2009.00029", "revision_depth": "1", "before_revision": "Semantic segmentation of neuronal structures in 3D high-resolution fluorescence microscopy imaging of the human brain cortexcan take advantage of bidimensional CNNs, which yield good resultsin neuron localization but lead to inaccurate surface reconstruction. 3DCNNs on the other hand would require manually annotated volumet-ric data on a large scale , and hence considerable human effort. Semi-supervised alternative strategies which make use only of sparse anno-tations suffer from longer training times and achieved models tend tohave increased capacity compared to 2D CNNs, needing more groundtruth data to attain similar results. To overcome these issues we proposea two-phase strategy for training native 3D CNN models on sparse 2Dannotations where missing labels are inferred by a 2D CNN model andcombined with manual annotations in a weighted manner during losscalculation .", "after_revision": "Semantic segmentation of neuronal structures in 3D high-resolution fluorescence microscopy imaging of the human brain cortex can take advantage of bidimensional CNNs, which yield good results in neuron localization but lead to inaccurate surface reconstruction. 3D CNNs, on the other hand , would require manually annotated volumetric data on a large scale and hence considerable human effort. Semi-supervised alternative strategies which make use only of sparse annotations suffer from longer training times and achieved models tend to have increased capacity compared to 2D CNNs, needing more ground truth data to attain similar results. To overcome these issues we propose a two-phase strategy for training native 3D CNN models on sparse 2D annotations where missing labels are inferred by a 2D CNN model and combined with manual annotations in a weighted manner during loss calculation .", "edit_actions": [{"type": "R", "before": "cortexcan", "after": "cortex can", "start_char_pos": 118, "end_char_pos": 127}, {"type": "R", "before": "resultsin", "after": "results in", "start_char_pos": 183, "end_char_pos": 192}, {"type": "R", "before": "3DCNNs", "after": "3D CNNs,", "start_char_pos": 260, "end_char_pos": 266}, {"type": "A", "before": null, "after": ",", "start_char_pos": 285, "end_char_pos": 285}, {"type": "R", "before": "volumet-ric", "after": "volumetric", "start_char_pos": 319, "end_char_pos": 330}, {"type": "D", "before": ",", "after": null, "start_char_pos": 353, "end_char_pos": 354}, {"type": "R", "before": "anno-tations", "after": "annotations", "start_char_pos": 461, "end_char_pos": 473}, {"type": "R", "before": "tohave", "after": "to have", "start_char_pos": 533, "end_char_pos": 539}, {"type": "R", "before": "groundtruth", "after": "ground truth", "start_char_pos": 593, "end_char_pos": 604}, {"type": "R", "before": "proposea", "after": "propose a", "start_char_pos": 665, "end_char_pos": 673}, {"type": "R", "before": "2Dannotations", "after": "2D annotations", "start_char_pos": 737, "end_char_pos": 750}, {"type": "R", "before": "andcombined", "after": "and combined", "start_char_pos": 803, "end_char_pos": 814}, {"type": "R", "before": "losscalculation", "after": "loss calculation", "start_char_pos": 867, "end_char_pos": 882}], "sents_char_pos": [0, 259, 391, 636]} {"doc_id": "2009.00805", "revision_depth": "1", "before_revision": "Motivation Machine learning methods for predicting compounds protein interactions (CPIs) are crucial for the in-silico screening step of drug discovery. In recent years , many end-to-end representation learning methods using deep neural networks have achieved significantly better performance than traditional machine learning algorithms. Much effort has been paid on improving the capability of the model by taking advantage of neural attention mechanism , either in learning compound representation, or learning the interaction between protein representation and compound representation . However, seldom has been done to improve the protein representation learning, while current approaches have manifest flaw of lacking the ability of learning amino acids long-distance interactions , which are essential for determine the proteins properties due to protein folding. Results The authors propose a novel approach for incorporating self-attention in the protein representation learning module of CPI models, providing the module with the capability of capturing long-distance interaction information within proteins. And such approach can be universally applied to nearly any deep learning models or submodels for protein representationlearning. By applying such approach on an existing CPI model, the modified version, with our proposed Protein Transformer as its protein learning module, has a significant improvement in the prediction performance . Practical tips for training Protein Transformer are also provided .", "after_revision": "The prediction of protein interactions (CPIs) is crucial for the in-silico screening step in drug discovery. Recently , many end-to-end representation learning methods using deep neural networks have achieved significantly better performance than traditional machine learning algorithms. Much effort has focused on the compound representation or the information extraction from the compound-protein interaction to improve the model capability by taking the advantage of the neural attention mechanism . However, previous studies have paid little attention to representing the protein sequences, in which the long-range interactions of residue pairs are essential for characterizing the structural properties arising from the protein folding. We incorporate the self-attention mechanism into the protein representation module for CPI modeling, which aims at capturing the long-range interaction information within proteins. The proposed module concerning protein representation, called Protein Transformer, with an integration with an existing CPI model, has shown a significant improvement in the prediction performance when compared with several existing CPI models .", "edit_actions": [{"type": "R", "before": "Motivation Machine learning methods for predicting compounds", "after": "The prediction of", "start_char_pos": 0, "end_char_pos": 60}, {"type": "R", "before": "are", "after": "is", "start_char_pos": 89, "end_char_pos": 92}, {"type": "R", "before": "of", "after": "in", "start_char_pos": 134, "end_char_pos": 136}, {"type": "R", "before": "In recent years", "after": "Recently", "start_char_pos": 153, "end_char_pos": 168}, {"type": "R", "before": "been paid on improving the capability of the model by taking advantage of", "after": "focused on the compound representation or the information extraction from the compound-protein interaction to improve the model capability by taking the advantage of the", "start_char_pos": 355, "end_char_pos": 428}, {"type": "D", "before": ", either in learning compound representation, or learning the interaction between protein representation and compound representation", "after": null, "start_char_pos": 456, "end_char_pos": 588}, {"type": "R", "before": "seldom has been done to improve the protein representation learning, while current approaches have manifest flaw of lacking the ability of learning amino acids long-distance interactions , which", "after": "previous studies have paid little attention to representing the protein sequences, in which the long-range interactions of residue pairs", "start_char_pos": 600, "end_char_pos": 794}, {"type": "R", "before": "determine the proteins properties due to", "after": "characterizing the structural properties arising from the", "start_char_pos": 813, "end_char_pos": 853}, {"type": "R", "before": "Results The authors propose a novel approach for incorporating", "after": "We incorporate the", "start_char_pos": 871, "end_char_pos": 933}, {"type": "R", "before": "in", "after": "mechanism into", "start_char_pos": 949, "end_char_pos": 951}, {"type": "R", "before": "learning module of CPI models, providing the module with the capability of capturing long-distance", "after": "module for CPI modeling, which aims at capturing the long-range", "start_char_pos": 979, "end_char_pos": 1077}, {"type": "R", "before": "And such approach can be universally applied to nearly any deep learning models or submodels for protein representationlearning. By applying such approach on an", "after": "The proposed module concerning protein representation, called Protein Transformer, with an integration with an", "start_char_pos": 1119, "end_char_pos": 1279}, {"type": "R", "before": "the modified version, with our proposed Protein Transformer as its protein learning module, has", "after": "has shown", "start_char_pos": 1300, "end_char_pos": 1395}, {"type": "R", "before": ". Practical tips for training Protein Transformer are also provided", "after": "when compared with several existing CPI models", "start_char_pos": 1452, "end_char_pos": 1519}], "sents_char_pos": [0, 152, 338, 590, 870, 1118, 1247]} {"doc_id": "2009.01012", "revision_depth": "1", "before_revision": "Data dependent triangulations are triangulations of point sets in the plane that are computed under consideration not only of the points' x- and y-coordinates but also of additional data (e.g. , elevation ). In particular, min-error criteria have been suggested to compute triangulations that approximate a given surface. In this article, we show how data dependent triangulations with min-error criteria can be used to reconstruct a dynamic surface over a longer time period if height values are continuously monitored at a sparse set of stations and, additionally for few epochs or a single one an accurate reference surface is given. The basic idea is to learn an height-optimal triangulation based on the available reference data and to use the learned triangulation to compute piece-wise linear surface models for epochs in which only the observations of the monitoring stations are given. In addition, we combine our approach of height-optimal triangulation with k-order Delaunay triangulation to stabilize the triangles geometrically. We consider these approaches particularly useful for reconstructing the historical evolution of a sea surface by combining tide-gauge measurements with data of modern satellite altimetry. We show how to learn a height-optimal triangulation and a k-order height-optimal triangulation using an exact algorithm based on integer linear programming and evaluate our approaches both with respect to its running times and the quality of the reconstructions in contrast to a solution by a Delaunay triangulationwhich has earlier been used for sea-surface modeling. For existing data of the North Sea we show that we can better reconstruct the dynamic sea surface for about 156 months back in time using the height-optimal triangulation than the Delaunay triangulation and even for about 180 months using the k-order height-optimal triangulation for k=2.", "after_revision": "Reconstructions of sea level prior to the satellite altimeter era are usually derived from tide gauge records; however most algorithms for this assume that modes of sea level variability are stationary which is not true over several decades. Here we suggest a method that is based on optimized data-dependent triangulations of the network of gauge stations. Data-dependent triangulations are triangulations of point sets that rely not only on 2D point positions but also on additional data (e.g. elevation, anomalies ). In this article, we show how data-dependent triangulations with min-error criteria can be used to reconstruct 2D maps of the sea surface anomaly over a longer time period , assuming that height anomalies are continuously monitored at a sparse set of stations and, in addition, observations of a reference surface is provided over a shorter time period. At the heart of our method is the idea to learn a min-error triangulation based on the available reference data , and to use the learned triangulation subsequently to compute piece-wise linear surface models for epochs in which only observations from monitoring stations are given. We combine our approach of min-error triangulation with k-order Delaunay triangulation to stabilize the triangles geometrically. We show that this approach is advantageous for the reconstruction of the sea surface by combining tide gauge measurements with data of modern satellite altimetry. We show how to learn a min-error triangulation and a min-error k-order Delaunay triangulation using integer linear programming . We confront our reconstructions against the Delaunay triangulation. With real data for the North Sea we show that the min-error triangulation outperforms the Delaunay method significantly for reconstructions back in time up to 18 years, and the k-order Delaunay min-error triangulation even up to 21 years for k=2.", "edit_actions": [{"type": "R", "before": "Data dependent triangulations", "after": "Reconstructions of sea level prior to the satellite altimeter era are usually derived from tide gauge records; however most algorithms for this assume that modes of sea level variability are stationary which is not true over several decades. Here we suggest a method that is based on optimized data-dependent triangulations of the network of gauge stations. Data-dependent triangulations", "start_char_pos": 0, "end_char_pos": 29}, {"type": "R", "before": "in the plane that are computed under consideration not only of the points' x- and y-coordinates but also of", "after": "that rely not only on 2D point positions but also on", "start_char_pos": 63, "end_char_pos": 170}, {"type": "R", "before": ", elevation", "after": "elevation, anomalies", "start_char_pos": 193, "end_char_pos": 204}, {"type": "D", "before": "particular, min-error criteria have been suggested to compute triangulations that approximate a given surface. In", "after": null, "start_char_pos": 211, "end_char_pos": 324}, {"type": "R", "before": "data dependent", "after": "data-dependent", "start_char_pos": 351, "end_char_pos": 365}, {"type": "R", "before": "a dynamic surface", "after": "2D maps of the sea surface anomaly", "start_char_pos": 432, "end_char_pos": 449}, {"type": "R", "before": "if height values", "after": ", assuming that height anomalies", "start_char_pos": 476, "end_char_pos": 492}, {"type": "R", "before": "additionally for few epochs or a single one an accurate", "after": "in addition, observations of a", "start_char_pos": 553, "end_char_pos": 608}, {"type": "R", "before": "given. The basic idea is to learn an height-optimal", "after": "provided over a shorter time period. At the heart of our method is the idea to learn a min-error", "start_char_pos": 630, "end_char_pos": 681}, {"type": "A", "before": null, "after": ",", "start_char_pos": 734, "end_char_pos": 734}, {"type": "A", "before": null, "after": "subsequently", "start_char_pos": 772, "end_char_pos": 772}, {"type": "R", "before": "the observations of the", "after": "observations from", "start_char_pos": 842, "end_char_pos": 865}, {"type": "R", "before": "In addition, we", "after": "We", "start_char_pos": 897, "end_char_pos": 912}, {"type": "R", "before": "height-optimal", "after": "min-error", "start_char_pos": 937, "end_char_pos": 951}, {"type": "R", "before": "consider these approaches particularly useful for reconstructing the historical evolution of a", "after": "show that this approach is advantageous for the reconstruction of the", "start_char_pos": 1047, "end_char_pos": 1141}, {"type": "R", "before": "tide-gauge", "after": "tide gauge", "start_char_pos": 1167, "end_char_pos": 1177}, {"type": "R", "before": "height-optimal", "after": "min-error", "start_char_pos": 1255, "end_char_pos": 1269}, {"type": "A", "before": null, "after": "min-error", "start_char_pos": 1290, "end_char_pos": 1290}, {"type": "R", "before": "height-optimal triangulation using an exact algorithm based on", "after": "Delaunay triangulation using", "start_char_pos": 1299, "end_char_pos": 1361}, {"type": "R", "before": "and evaluate our approaches both with respect to its running times and the quality of the reconstructions in contrast to a solution by a Delaunay triangulationwhich has earlier been used for sea-surface modeling. For existing data of", "after": ". We confront our reconstructions against the Delaunay triangulation. With real data for", "start_char_pos": 1389, "end_char_pos": 1622}, {"type": "R", "before": "we can better reconstruct the dynamic sea surface for about 156 months", "after": "the min-error triangulation outperforms the Delaunay method significantly for reconstructions", "start_char_pos": 1650, "end_char_pos": 1720}, {"type": "R", "before": "using the height-optimal triangulation than the Delaunay triangulation and even for about 180 months using", "after": "up to 18 years, and", "start_char_pos": 1734, "end_char_pos": 1840}, {"type": "R", "before": "height-optimal triangulation", "after": "Delaunay min-error triangulation even up to 21 years", "start_char_pos": 1853, "end_char_pos": 1881}], "sents_char_pos": [0, 207, 321, 636, 896, 1043, 1231, 1601]} {"doc_id": "2009.02467", "revision_depth": "1", "before_revision": "We propose a new binary classification model in Machine Learning, called Phase Separation Binary Classifier (PSBC). It consists of a discretization of a nonlinear reaction-diffusion equation (the Allen-Cahn equation), coupled with an ODE . Unlike many feedforward networks that are said to mimic brain or cortical cells functioning, the PSBC is inspired by fluid behavior, namely, on how binary fluids phase separate. Thus, (hyper)parameters have physical meaning, whose effects are carefully studied in several different scenarios : for instance, diffusion introduces interaction among features, whereas reaction plays an active role in classification . PSBC's coefficients are trainable weights, chosen according to a minimization problem using Gradient Descent; optimization relies on a classical Backpropagation Algorithm using weight sharing. Moreover, the model can be seen under the framework of feedforward networks, and is endowed with a nonlinear activation function that is linear in trainable weights but polynomial in other variables . In view of the model's connection with ODEs and parabolic PDEs, forward propagation amounts to an initial value problem. Thus, stability conditions are established through meshgrid constraints, discrete maximum principles, and, overall, exploiting the concept of Invariant regions , as developed in the work of Chueh, Conway, Smoller, and particularly in the application of their theory to finite-difference methods in the work of Hoff. The PSBC also has interesting model compression properties which are thoroughly discussed. We apply the model to the subset of numbers \"0\" and \"1\" of the classical MNIST database, where we are able to discern individuals from both classes with more than 94\\\\%DIF < accuracy, sometimes using less than 80 variables, a feature that is out of reach of Artificial Neural Networks without weight sharing or feature engineering.\\end{abstract} %DIF > accuracy, sometimes using less only about 10\\\\% of variables.", "after_revision": "We propose a new binary classification model called Phase Separation Binary Classifier (PSBC). It consists of a discretization of a nonlinear reaction-diffusion equation coupled with an ODE , and is inspired by fluid behavior, namely, on how binary fluids phase separate. Hence, parameters and hyperparameters have physical meaning, whose effects are carefully studied in several different scenarios . PSBC's coefficients are trainable weights, chosen according to a minimization problem using Gradient Descent; optimization relies on a classical Backpropagation with weight sharing. The model can be seen under the framework of feedforward networks, and is endowed with a nonlinear activation function that is linear in trainable weights but polynomial in other variables , yielding a cost function that is also polynomial . In view of the model's connection with ODEs and parabolic PDEs, forward propagation amounts to an initial value problem. Thus, stability conditions are established using the concept of Invariant regions . Interesting model compression properties are thoroughly discussed. We illustrate the classifier's qualities by applying it to the subset of numbers \"0\" and \"1\" of the classical MNIST database, where we are able to discern individuals with more than 94\\\\%DIF < accuracy, sometimes using less than 80 variables, a feature that is out of reach of Artificial Neural Networks without weight sharing or feature engineering.\\end{abstract} %DIF > accuracy, sometimes using less only about 10\\\\% of variables.", "edit_actions": [{"type": "D", "before": "in Machine Learning,", "after": null, "start_char_pos": 45, "end_char_pos": 65}, {"type": "D", "before": "(the Allen-Cahn equation),", "after": null, "start_char_pos": 191, "end_char_pos": 217}, {"type": "R", "before": ". Unlike many feedforward networks that are said to mimic brain or cortical cells functioning, the PSBC", "after": ", and", "start_char_pos": 238, "end_char_pos": 341}, {"type": "R", "before": "Thus, (hyper)parameters", "after": "Hence, parameters and hyperparameters", "start_char_pos": 418, "end_char_pos": 441}, {"type": "D", "before": ": for instance, diffusion introduces interaction among features, whereas reaction plays an active role in classification", "after": null, "start_char_pos": 532, "end_char_pos": 652}, {"type": "R", "before": "Algorithm using", "after": "with", "start_char_pos": 816, "end_char_pos": 831}, {"type": "R", "before": "Moreover, the", "after": "The", "start_char_pos": 848, "end_char_pos": 861}, {"type": "A", "before": null, "after": ", yielding a cost function that is also polynomial", "start_char_pos": 1047, "end_char_pos": 1047}, {"type": "R", "before": "through meshgrid constraints, discrete maximum principles, and, overall, exploiting", "after": "using", "start_char_pos": 1214, "end_char_pos": 1297}, {"type": "R", "before": ", as developed in the work of Chueh, Conway, Smoller, and particularly in the application of their theory to finite-difference methods in the work of Hoff. The PSBC also has interesting", "after": ". Interesting", "start_char_pos": 1331, "end_char_pos": 1516}, {"type": "D", "before": "which", "after": null, "start_char_pos": 1546, "end_char_pos": 1551}, {"type": "R", "before": "apply the model", "after": "illustrate the classifier's qualities by applying it", "start_char_pos": 1581, "end_char_pos": 1596}, {"type": "D", "before": "from both classes", "after": null, "start_char_pos": 1708, "end_char_pos": 1725}], "sents_char_pos": [0, 115, 239, 417, 764, 847, 1049, 1170, 1486, 1577, 1909]} {"doc_id": "2009.04216", "revision_depth": "1", "before_revision": "Emotions are a central key for understanding human beings and of fun-damental importance regarding their impact in human and animal behaviors. They have been for a long time a subject of study for various scholars includ-ing in particular philosophers and mystics 29, 5, 7, 36, 35, 22, 27, 31 . Inmodern science, the emotional phenomenon has attracted for a few decadesan increasing number of studies, notably in the fields of Psychology, Psy-chiatry , Neuroscience and Biochemistry 1, 3, 2, 9, 11, 17, 16, 19, 20, 23,24, 25, 26, 32, 34 . However, since our perception of emotions is not, sofar , directly detectable nor recordable by our measure instruments, Physicsand Mathematics have not been so far used academically to provide a pre-cise description of the phenomenon of feeling an emotion. Relying upon theworks of O. Elahi 10, 14 and on the hypothesis that the human soul and itspsyche may manifest in ourselves (in both conscious and unconscious man-ner ) in an analog way as electromagnetic waves 13 , we propose here a fewmathematical descriptions consistent with the human personal experience, of the feeling and cognition of emotions. As far as we know, such a mathe-matical description has never been provided before. It allows a quantitative (intensity) and qualitative (nature of feelings/frequency) of the emotionalphenomenon which provides a novel scientific approach of the nature of the mind, complementary to the on going research of physiological manifesta-tion of emotions. We anticipate such an approach and the associated math-ematical modeling to become an important tool to describe emotions andtheir subsequent behavior. In complement of the modeling of oscillationsand brain dynamics 4, 8 , 28 , it provides a fruitful direction of research withpotentially broad and deep impacts in both applied mathematics, physics, cognitive and behavioral sciences.", "after_revision": "Emotions are a central key for understanding human beings and of fundamental importance regarding their impact in human and animal behaviors. They have been for a long time a subject of study for various scholars including in particular philosophers and mystics . In modern science, the emotional phenomenon has attracted for a few decades an increasing number of studies, notably in the fields of Psychology, Psychiatry , Neuroscience and Biochemistry . However, since our perception of emotions is not, so far , directly detectable nor recordable by our measure instruments, Physics and Mathematics have not been so far used academically to provide a precise description of the phenomenon of feeling an emotion. Relying upon the works of O. Elahi and on the hypothesis that the human soul and its psyche may manifest in ourselves (in both conscious and unconscious manner ) in an analog way as electromagnetic waves , we propose here a few mathematical descriptions consistent with the human personal experience, of the feeling and cognition of emotions. As far as we know, such a mathematical description has never been provided before. It allows a quantitative (intensity) and qualitative (nature of feelings/frequency) of the emotional phenomenon which provides a novel scientific approach of the nature of the mind, complementary to the on going research of physiological manifestation of emotions. We anticipate such an approach and the associated mathematical modeling to become an important tool to describe emotions and their subsequent behavior. In complement of the modeling of oscillations and brain dynamics , it provides a fruitful direction of research with potentially broad and deep impacts in both applied mathematics, physics, cognitive and behavioral sciences.", "edit_actions": [{"type": "R", "before": "fun-damental", "after": "fundamental", "start_char_pos": 65, "end_char_pos": 77}, {"type": "R", "before": "includ-ing", "after": "including", "start_char_pos": 214, "end_char_pos": 224}, {"type": "D", "before": "29, 5, 7, 36, 35, 22, 27, 31", "after": null, "start_char_pos": 264, "end_char_pos": 292}, {"type": "R", "before": ". Inmodern", "after": ". In modern", "start_char_pos": 293, "end_char_pos": 303}, {"type": "R", "before": "decadesan", "after": "decades an", "start_char_pos": 362, "end_char_pos": 371}, {"type": "R", "before": "Psy-chiatry", "after": "Psychiatry", "start_char_pos": 439, "end_char_pos": 450}, {"type": "D", "before": "1, 3, 2, 9, 11, 17, 16, 19, 20, 23,24, 25, 26, 32, 34", "after": null, "start_char_pos": 483, "end_char_pos": 536}, {"type": "R", "before": "sofar", "after": "so far", "start_char_pos": 589, "end_char_pos": 594}, {"type": "R", "before": "Physicsand", "after": "Physics and", "start_char_pos": 660, "end_char_pos": 670}, {"type": "R", "before": "pre-cise", "after": "precise", "start_char_pos": 735, "end_char_pos": 743}, {"type": "R", "before": "theworks", "after": "the works", "start_char_pos": 810, "end_char_pos": 818}, {"type": "D", "before": "10, 14", "after": null, "start_char_pos": 831, "end_char_pos": 837}, {"type": "R", "before": "itspsyche", "after": "its psyche", "start_char_pos": 884, "end_char_pos": 893}, {"type": "R", "before": "man-ner", "after": "manner", "start_char_pos": 955, "end_char_pos": 962}, {"type": "D", "before": "13", "after": null, "start_char_pos": 1007, "end_char_pos": 1009}, {"type": "R", "before": "fewmathematical", "after": "few mathematical", "start_char_pos": 1030, "end_char_pos": 1045}, {"type": "R", "before": "mathe-matical", "after": "mathematical", "start_char_pos": 1174, "end_char_pos": 1187}, {"type": "R", "before": "emotionalphenomenon", "after": "emotional phenomenon", "start_char_pos": 1323, "end_char_pos": 1342}, {"type": "R", "before": "manifesta-tion", "after": "manifestation", "start_char_pos": 1469, "end_char_pos": 1483}, {"type": "R", "before": "math-ematical", "after": "mathematical", "start_char_pos": 1547, "end_char_pos": 1560}, {"type": "R", "before": "andtheir", "after": "and their", "start_char_pos": 1619, "end_char_pos": 1627}, {"type": "D", "before": "oscillationsand brain dynamics", "after": null, "start_char_pos": 1682, "end_char_pos": 1712}, {"type": "R", "before": "4, 8", "after": "oscillations and brain dynamics", "start_char_pos": 1713, "end_char_pos": 1717}, {"type": "D", "before": "28", "after": null, "start_char_pos": 1720, "end_char_pos": 1722}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1723, "end_char_pos": 1724}, {"type": "R", "before": "withpotentially", "after": "with potentially", "start_char_pos": 1770, "end_char_pos": 1785}], "sents_char_pos": [0, 142, 267, 281, 312, 796, 1147, 1231, 1496, 1648]} {"doc_id": "2009.05169", "revision_depth": "2", "before_revision": "We propose a novel method to sparsify attention in the Transformer model by learning to select the most-informative token representations during the training process, thus focusing on task-specific parts of the input. A reduction of quadratic time and memory complexity to sublinear was achieved due to a robust differentiable top-k operator. For example, our experiments on a challenging summarization task of long documents show that our method is much faster and up to 16 times more memory efficient while significantly outperforming both dense and state-of-the-art sparse transformer models. The method can be effortlessly applied to many models used in NLP and CV, simultaneously with other improvements since representation pooling addresses a different aspect of the attention's complexity problem .", "after_revision": "We propose a novel method to sparsify attention in the Transformer model by learning to select the most-informative token representations during the training process, thus focusing on task-specific parts of the input. A reduction of quadratic time and memory complexity to sublinear was achieved due to a robust trainable top-k operator. For example, our experiments on a challenging summarization task of long documents show that our method is over 3 times faster and up to 16 times more memory efficient while significantly outperforming both dense and state-of-the-art sparse transformer models. The method can be effortlessly applied to many models used in NLP and CV, simultaneously with other improvements .", "edit_actions": [{"type": "R", "before": "differentiable", "after": "trainable", "start_char_pos": 312, "end_char_pos": 326}, {"type": "R", "before": "much", "after": "over 3 times", "start_char_pos": 450, "end_char_pos": 454}, {"type": "D", "before": "since representation pooling addresses a different aspect of the attention's complexity problem", "after": null, "start_char_pos": 709, "end_char_pos": 804}], "sents_char_pos": [0, 217, 342, 595]} {"doc_id": "2009.05306", "revision_depth": "1", "before_revision": "Generalized Plane Waves (GPWs) were introduced to take advantage of Trefftz methods for problems modeled by variable coefficient equations. Despite the fact that GPWs do not satisfy the Trefftz property, i.e. they are not exact solutions to the governing equation, they instead satisfy a quasi-Trefftz property: they are only approximate solutions. They have been proved to lead to high order numerical methods, and the quasi-Trefftz property is critical for the numerical analysisof these methods . The present work introduces a new family of GPWs . The motivation to introduce these new GPWs, amplitude-based, lies in the poor behavior of the phase-based GPWs in the pre-asymptotic regime, which will be addressed by avoiding high degree polynomials within an exponential. The new ansatz is still based on a plane wave function, but it introduces higher order terms in the amplitude rather than the phase of the plane wave as was initially proposed. The new functions' construction and study of their interpolation properties follow the roadmap proposed in a previous work . For the sake of clarity, the first focus is on the two-dimensional Helmholtz equation with spatially varying wavenumber, and follows the extension to a range of operators allowing for anisotropy in the first and second order terms . Numerical simulations illustrate the theoretical study of the new quasi-Trefftz functions.", "after_revision": "Generalized Plane Waves (GPWs) were introduced to take advantage of Trefftz methods for problems modeled by variable coefficient equations. Despite the fact that GPWs do not satisfy the Trefftz property, i.e. they are not exact solutions to the governing equation, they instead satisfy a quasi-Trefftz property: they are only approximate solutions. They lead to high order numerical methods, and this quasi-Trefftz property is critical for their numerical analysis . The present work introduces a new family of GPWs , amplitude-based . The motivation lies in the poor behavior of the phase-based GPW approximations in the pre-asymptotic regime, which will be tamed by avoiding high degree polynomials within an exponential. The new ansatz is introduces higher order terms in the amplitude rather than the phase of a plane wave as was initially proposed. The new functions' construction and the study of their interpolation properties are guided by the roadmap proposed in 16 . For the sake of clarity, the first focus is on the two-dimensional Helmholtz equation with spatially-varying wavenumber. The extension to a range of operators allowing for anisotropy in the first and second order terms follows . Numerical simulations illustrate the theoretical study of the new quasi-Trefftz functions.", "edit_actions": [{"type": "D", "before": "have been proved to", "after": null, "start_char_pos": 354, "end_char_pos": 373}, {"type": "R", "before": "the", "after": "this", "start_char_pos": 416, "end_char_pos": 419}, {"type": "R", "before": "the numerical analysisof these methods", "after": "their numerical analysis", "start_char_pos": 459, "end_char_pos": 497}, {"type": "A", "before": null, "after": ", amplitude-based", "start_char_pos": 549, "end_char_pos": 549}, {"type": "D", "before": "to introduce these new GPWs, amplitude-based,", "after": null, "start_char_pos": 567, "end_char_pos": 612}, {"type": "R", "before": "GPWs", "after": "GPW approximations", "start_char_pos": 658, "end_char_pos": 662}, {"type": "R", "before": "addressed", "after": "tamed", "start_char_pos": 707, "end_char_pos": 716}, {"type": "D", "before": "still based on a plane wave function, but it", "after": null, "start_char_pos": 794, "end_char_pos": 838}, {"type": "R", "before": "the", "after": "a", "start_char_pos": 911, "end_char_pos": 914}, {"type": "A", "before": null, "after": "the", "start_char_pos": 989, "end_char_pos": 989}, {"type": "R", "before": "follow", "after": "are guided by", "start_char_pos": 1030, "end_char_pos": 1036}, {"type": "R", "before": "a previous work", "after": "16", "start_char_pos": 1061, "end_char_pos": 1076}, {"type": "R", "before": "spatially varying wavenumber, and follows the", "after": "spatially-varying wavenumber. The", "start_char_pos": 1170, "end_char_pos": 1215}, {"type": "A", "before": null, "after": "follows", "start_char_pos": 1310, "end_char_pos": 1310}], "sents_char_pos": [0, 139, 348, 499, 551, 775, 952, 1078]} {"doc_id": "2009.05732", "revision_depth": "1", "before_revision": "Without a cure, vaccine, or proven long-term immunity against SARS-CoV-2, test-trace-and-isolate (TTI) strategies present a promising tool to contain the viral spread. For any TTI strategy, however, a major challenge arises from pre- and asymptomatic transmission as well as TTI-avoiders, which contribute to hidden , unnoticed infection chains. In our semi-analytical model, we identified two distinct tipping points between controlled and uncontrolled spreading: one, at which the behavior-driven reproduction number of the hidden infections becomes too large to be compensated by the available TTI capabilities, and one at which the number of new infections starts to exceed the tracing capacity , causing a self-accelerating spread. We investigated how these tipping points depend on realistic limitations like limited cooperativity , missing contacts, and imperfect isolation , finding that TTI is likely not sufficient to contain the natural spread of SARS-CoV-2 . Therefore, complementary measures like reduced physical contacts and improved hygiene probably remain necessary.", "after_revision": "Without a cure, vaccine, or proven long-term immunity against SARS-CoV-2, test-trace-and-isolate (TTI) strategies present a promising tool to contain its spread. For any TTI strategy, however, mitigation is challenged by pre- and asymptomatic transmission , TTI-avoiders, and undetected spreaders, who strongly contribute to hidden infection chains. Here, we studied a semi-analytical model and identified two tipping points between controlled and uncontrolled spread: (1) the behavior-driven reproduction number of the hidden chains becomes too large to be compensated by the TTI capabilities, and (2) the number of new infections exceeds the tracing capacity . Both trigger a self-accelerating spread. We investigated how these tipping points depend on challenges like limited cooperation , missing contacts, and imperfect isolation . Our model results suggest that TTI alone is insufficient to contain an otherwise unhindered spread of SARS-CoV-2 , implying that complementary measures like social distancing and improved hygiene remain necessary.", "edit_actions": [{"type": "R", "before": "the viral", "after": "its", "start_char_pos": 150, "end_char_pos": 159}, {"type": "R", "before": "a major challenge arises from", "after": "mitigation is challenged by", "start_char_pos": 199, "end_char_pos": 228}, {"type": "R", "before": "as well as", "after": ",", "start_char_pos": 264, "end_char_pos": 274}, {"type": "R", "before": "which", "after": "and undetected spreaders, who strongly", "start_char_pos": 289, "end_char_pos": 294}, {"type": "D", "before": ", unnoticed", "after": null, "start_char_pos": 316, "end_char_pos": 327}, {"type": "R", "before": "In our", "after": "Here, we studied a", "start_char_pos": 346, "end_char_pos": 352}, {"type": "R", "before": "model, we identified two distinct", "after": "model and identified two", "start_char_pos": 369, "end_char_pos": 402}, {"type": "R", "before": "spreading: one, at which", "after": "spread: (1)", "start_char_pos": 454, "end_char_pos": 478}, {"type": "R", "before": "infections", "after": "chains", "start_char_pos": 533, "end_char_pos": 543}, {"type": "D", "before": "available", "after": null, "start_char_pos": 587, "end_char_pos": 596}, {"type": "R", "before": "one at which", "after": "(2)", "start_char_pos": 619, "end_char_pos": 631}, {"type": "R", "before": "starts to exceed", "after": "exceeds", "start_char_pos": 661, "end_char_pos": 677}, {"type": "R", "before": ", causing", "after": ". Both trigger", "start_char_pos": 699, "end_char_pos": 708}, {"type": "R", "before": "realistic limitations like limited cooperativity", "after": "challenges like limited cooperation", "start_char_pos": 788, "end_char_pos": 836}, {"type": "R", "before": ", finding that TTI is likely not sufficient to contain the natural", "after": ". Our model results suggest that TTI alone is insufficient to contain an otherwise unhindered", "start_char_pos": 881, "end_char_pos": 947}, {"type": "R", "before": ". Therefore,", "after": ", implying that", "start_char_pos": 969, "end_char_pos": 981}, {"type": "R", "before": "reduced physical contacts", "after": "social distancing", "start_char_pos": 1010, "end_char_pos": 1035}, {"type": "D", "before": "probably", "after": null, "start_char_pos": 1057, "end_char_pos": 1065}], "sents_char_pos": [0, 167, 345, 736]} {"doc_id": "2009.06375", "revision_depth": "1", "before_revision": "Twitter has become an important communication channel in times of emergency. The ubiquitousness of smartphones enables people to announce an emergency they're observing in real-time. Because of this , more agencies are interested in programatically monitoring Twitter (disaster URLanizations and news agencies) and therefore recognizing the informativeness of a tweet can help filter noise from large volumes of data . In this paper, we present our submission for WNUT-2020 Task 2: Identification of informative COVID-19 English Tweets. Our most successful model is an ensemble of transformers including RoBERTa, XLNet, and BERTweet trained in a semi-supervised experimental setting. The proposed system achieves a F1 score of 0.9011 on the test set (ranking 7th on the leaderboard) , and shows significant gains in performance compared to a baseline system using fasttext embeddings.", "after_revision": "Twitter and, in general, social media has become an indispensable communication channel in times of emergency. The ubiquitousness of smartphone gadgets enables people to declare an emergency observed in real-time. As a result , more agencies are interested in programmatically monitoring Twitter (disaster URLanizations and news agencies) . Therefore, recognizing the informativeness of a Tweet can help filter noise from the large volumes of Tweets . In this paper, we present our submission for WNUT-2020 Task 2: Identification of informative COVID-19 English Tweets. Our most successful model is an ensemble of transformers , including RoBERTa, XLNet, and BERTweet trained in a Semi-Supervised Learning (SSL) setting. The proposed system achieves an F1 score of 0.9011 on the test set (ranking 7th on the leaderboard) and shows significant gains in performance compared to a baseline system using FastText embeddings.", "edit_actions": [{"type": "A", "before": null, "after": "and, in general, social media", "start_char_pos": 8, "end_char_pos": 8}, {"type": "R", "before": "important", "after": "indispensable", "start_char_pos": 23, "end_char_pos": 32}, {"type": "R", "before": "smartphones", "after": "smartphone gadgets", "start_char_pos": 100, "end_char_pos": 111}, {"type": "R", "before": "announce an emergency they're observing", "after": "declare an emergency observed", "start_char_pos": 130, "end_char_pos": 169}, {"type": "R", "before": "Because of this", "after": "As a result", "start_char_pos": 184, "end_char_pos": 199}, {"type": "R", "before": "programatically", "after": "programmatically", "start_char_pos": 234, "end_char_pos": 249}, {"type": "R", "before": "and therefore", "after": ". Therefore,", "start_char_pos": 312, "end_char_pos": 325}, {"type": "R", "before": "tweet", "after": "Tweet", "start_char_pos": 363, "end_char_pos": 368}, {"type": "A", "before": null, "after": "the", "start_char_pos": 396, "end_char_pos": 396}, {"type": "R", "before": "data", "after": "Tweets", "start_char_pos": 414, "end_char_pos": 418}, {"type": "A", "before": null, "after": ",", "start_char_pos": 596, "end_char_pos": 596}, {"type": "R", "before": "semi-supervised experimental", "after": "Semi-Supervised Learning (SSL)", "start_char_pos": 649, "end_char_pos": 677}, {"type": "R", "before": "a", "after": "an", "start_char_pos": 716, "end_char_pos": 717}, {"type": "D", "before": ",", "after": null, "start_char_pos": 786, "end_char_pos": 787}, {"type": "R", "before": "fasttext", "after": "FastText", "start_char_pos": 867, "end_char_pos": 875}], "sents_char_pos": [0, 77, 183, 420, 538, 686]} {"doc_id": "2009.06383", "revision_depth": "1", "before_revision": "Models that are robust to aberrant choice behaviourhave received limited attention in discrete choice analysis . In this paper, we analyse two robust alternatives to the multinomial probit (MNP) model. Both alternative models belong to the family of robit models , whose kernel error distributions are heavy-tailed t-distributions . The first model is the multinomial robit (MNR) model in which a generic degrees of freedom parameter controls the heavy-tailedness of the kernel error distribution. The second alternative , the generalised multinomial robit (Gen-MNR) model, has not been studied in the literature before and is more flexible than MNR, as it allows for alternative-specific marginal heavy-tailedness of the kernel error distribution. For both models, we devise scalable and gradient-free Bayes estimators. We compare MNP, MNR and Gen-MNR in a simulation study and a case study on transport mode choice behaviour . We find that both MNR and Gen-MNR deliver significantly better in-sample fit and out-of-sample predictive accuracy than MNP. Gen-MNR outperforms MNR due to its more flexible kernel error distribution. Also, Gen-MNR gives more reasonable elasticity estimates than MNP and MNR , in particular regarding the demand for under-represented alternatives in a class-imbalanced dataset .", "after_revision": "Inferences of robust behavioural and statistical models are insensitive to outlying observations resulting from aberrant behaviour, misreporting and misclassification. Standard discrete choice models such as logit and probit lack robustness to outliers due to their rigid kernel error distributions . In this paper, we analyse two robust alternatives to the multinomial probit (MNP) model. The two models belong to the family of robit models whose kernel error distributions are heavy-tailed t-distributions which moderate the influence of outlying observations . The first model is the multinomial robit (MNR) model , in which a generic degrees of freedom parameter controls the heavy-tailedness of the kernel error distribution. The second model , the generalised multinomial robit (Gen-MNR) model, is more flexible than MNR, as it allows for distinct heavy-tailedness in each dimension of the kernel error distribution. For both models, we derive efficient Gibbs sampling schemes, which also allow for a straightforward inclusion of random parameters. In a simulation study, we illustrate the excellent finite sample properties of the proposed Bayes estimators and show that MNR and Gen-MNR produce more exact elasticity estimates if the choice data contain outliers through the lens of the non-robust MNP model. In a case study on transport mode choice behaviour , MNR and Gen-MNR outperform MNP by substantial margins in terms of in-sample fit and out-of-sample predictive accuracy . We also find that the benefits of the more flexible kernel error distributions underlying MNR and Gen-MNR are maintained in the presence of random heterogeneity .", "edit_actions": [{"type": "R", "before": "Models that are robust to aberrant choice behaviourhave received limited attention in discrete choice analysis", "after": "Inferences of robust behavioural and statistical models are insensitive to outlying observations resulting from aberrant behaviour, misreporting and misclassification. Standard discrete choice models such as logit and probit lack robustness to outliers due to their rigid kernel error distributions", "start_char_pos": 0, "end_char_pos": 110}, {"type": "R", "before": "Both alternative", "after": "The two", "start_char_pos": 202, "end_char_pos": 218}, {"type": "D", "before": ",", "after": null, "start_char_pos": 263, "end_char_pos": 264}, {"type": "A", "before": null, "after": "which moderate the influence of outlying observations", "start_char_pos": 331, "end_char_pos": 331}, {"type": "A", "before": null, "after": ",", "start_char_pos": 387, "end_char_pos": 387}, {"type": "R", "before": "alternative", "after": "model", "start_char_pos": 511, "end_char_pos": 522}, {"type": "D", "before": "has not been studied in the literature before and", "after": null, "start_char_pos": 576, "end_char_pos": 625}, {"type": "R", "before": "alternative-specific marginal", "after": "distinct", "start_char_pos": 670, "end_char_pos": 699}, {"type": "A", "before": null, "after": "in each dimension", "start_char_pos": 717, "end_char_pos": 717}, {"type": "R", "before": "devise scalable and gradient-free Bayes estimators. We compare MNP,", "after": "derive efficient Gibbs sampling schemes, which also allow for a straightforward inclusion of random parameters. In a simulation study, we illustrate the excellent finite sample properties of the proposed Bayes estimators and show that", "start_char_pos": 772, "end_char_pos": 839}, {"type": "R", "before": "in a simulation study and a", "after": "produce more exact elasticity estimates if the choice data contain outliers through the lens of the non-robust MNP model. In a", "start_char_pos": 856, "end_char_pos": 883}, {"type": "R", "before": ". We find that both", "after": ",", "start_char_pos": 930, "end_char_pos": 949}, {"type": "R", "before": "deliver significantly better", "after": "outperform MNP by substantial margins in terms of", "start_char_pos": 966, "end_char_pos": 994}, {"type": "R", "before": "than MNP. Gen-MNR outperforms MNR due to its", "after": ". We also find that the benefits of the", "start_char_pos": 1047, "end_char_pos": 1091}, {"type": "R", "before": "distribution. Also,", "after": "distributions underlying MNR and", "start_char_pos": 1119, "end_char_pos": 1138}, {"type": "R", "before": "gives more reasonable elasticity estimates than MNP and MNR , in particular regarding the demand for under-represented alternatives in a class-imbalanced dataset", "after": "are maintained in the presence of random heterogeneity", "start_char_pos": 1147, "end_char_pos": 1308}], "sents_char_pos": [0, 112, 201, 333, 499, 751, 823, 931, 1132]} {"doc_id": "2009.06401", "revision_depth": "1", "before_revision": "Recently, novel multi-hop models and datasets have been introduced to achieve more complex natural language reasoning with neural networks . One notable task that requires multi-hop reasoning is fact checking, where a chain of connected evidence pieces leads to the final verdict of a claim. However, existing datasets do not provide annotations for the gold evidence pieces, which is a critical aspect for improving the explainability of fact checking systems. The only exception is the FEVER dataset , which is artificially constructed based on Wikipedia and does not use naturally occurring political claims and evidence pages, which is more challenging. Most claims in FEVER only have one evidence sentence associated with them and require no reasoning to make label predictions -- the small number of instances with two evidence sentences only require simple reasoning . In this paper , we study how to perform more complex claim verification on naturally occurring claims with multiple hops over evidence chunks. We first construct a small annotated dataset, PolitiHop, of reasoning chains for claim verification . We then compare the dataset to other existing multi-hop datasets and study how to transfer knowledge from more extensive in- and out-of-domain resources to PolitiHop. We find that the task is complex , and achieve the best performance using an architecture that specifically models reasoning over evidence chains in combination with in-domain transfer learning.", "after_revision": "Recent work has proposed multi-hop models and datasets for studying complex natural language reasoning . One notable task requiring multi-hop reasoning is fact checking, where a set of connected evidence pieces leads to the final verdict of a claim. However, existing datasets either do not provide annotations for gold evidence pages, or the only dataset which does (FEVER) mostly consists of claims which can be fact-checked with simple reasoning and is constructed artificially. Here , we study more complex claim verification of naturally occurring claims with multiple hops over interconnected evidence chunks. We : 1) construct a small annotated dataset, PolitiHop, of evidence sentences for claim verification ; 2) compare it to existing multi-hop datasets ; and 3) study how to transfer knowledge from more extensive in- and out-of-domain resources to PolitiHop. We find that the task is complex and achieve the best performance with an architecture that specifically models reasoning over evidence pieces in combination with in-domain transfer learning.", "edit_actions": [{"type": "R", "before": "Recently, novel", "after": "Recent work has proposed", "start_char_pos": 0, "end_char_pos": 15}, {"type": "R", "before": "have been introduced to achieve more", "after": "for studying", "start_char_pos": 46, "end_char_pos": 82}, {"type": "D", "before": "with neural networks", "after": null, "start_char_pos": 118, "end_char_pos": 138}, {"type": "R", "before": "that requires", "after": "requiring", "start_char_pos": 158, "end_char_pos": 171}, {"type": "R", "before": "chain", "after": "set", "start_char_pos": 218, "end_char_pos": 223}, {"type": "A", "before": null, "after": "either", "start_char_pos": 319, "end_char_pos": 319}, {"type": "R", "before": "the gold evidence pieces, which is a critical aspect for improving the explainability of fact checking systems. The only exception is the FEVER dataset , which is artificially constructed based on Wikipedia and does not use naturally occurring political claims and evidence pages, which is more challenging. Most claims in FEVER only have one evidence sentence associated with them and require no reasoning to make label predictions -- the small number of instances with two evidence sentences only require simple reasoning . In this paper", "after": "gold evidence pages, or the only dataset which does (FEVER) mostly consists of claims which can be fact-checked with simple reasoning and is constructed artificially. Here", "start_char_pos": 351, "end_char_pos": 890}, {"type": "D", "before": "how to perform", "after": null, "start_char_pos": 902, "end_char_pos": 916}, {"type": "R", "before": "on", "after": "of", "start_char_pos": 949, "end_char_pos": 951}, {"type": "A", "before": null, "after": "interconnected", "start_char_pos": 1003, "end_char_pos": 1003}, {"type": "R", "before": "first", "after": ": 1)", "start_char_pos": 1024, "end_char_pos": 1029}, {"type": "R", "before": "reasoning chains", "after": "evidence sentences", "start_char_pos": 1081, "end_char_pos": 1097}, {"type": "R", "before": ". We then compare the dataset to other", "after": "; 2) compare it to", "start_char_pos": 1121, "end_char_pos": 1159}, {"type": "R", "before": "and", "after": "; and 3)", "start_char_pos": 1188, "end_char_pos": 1191}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1323, "end_char_pos": 1324}, {"type": "R", "before": "using", "after": "with", "start_char_pos": 1358, "end_char_pos": 1363}, {"type": "R", "before": "chains", "after": "pieces", "start_char_pos": 1429, "end_char_pos": 1435}], "sents_char_pos": [0, 140, 291, 462, 658, 876, 1020, 1122, 1289]} {"doc_id": "2009.06891", "revision_depth": "1", "before_revision": "Inspired by Google's Neural Machine Translation (NMT) \\mbox{%DIFAUXCMD Wu2016Google that models the one-to-one alignment in translation tasks with an optimal uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source paragraphs/sentences with the optimal coverage. Unlike NMT, the attention-aware inference of NAS requires the prediction of the optimal attention distribution. Therefore, an attention-prediction model is constructed to learn the dependency between attention weights and sources. To apply the attention-aware inference on multi-document summarization, a Hierarchical Transformer (HT) is developed to accept lengthy inputs at the same time project cross-document information. Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating By refining the regular beam search with the attention-aware inference , significant improvements on the quality of summaries could be further observed. Last but not the least, the attention-aware inference could be adopted to single-document summarization with straightforward modifications according to the model architecture .", "after_revision": "Inspired by Google's Neural Machine Translation (NMT) that models the one-to-one alignment in translation tasks with an uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source contents with the optimal coverage. Unlike NMT, NAS is not based on one-to-one transformation. Instead, its attention distribution for the input should be irregular and depend on the content layout of the source documents. To address this matter, we construct an attention-prediction model to learn the dependency between the optimal attention distribution and the source. By refining the vanilla beam search with the attention-aware mechanism , significant improvements on the quality of summaries could be observed. Last but not the least, the attention-aware inference has strong universality that can be easily adopted to different hierarchical summarization models to promote the models' performance .", "edit_actions": [{"type": "D", "before": "\\mbox{%DIFAUXCMD Wu2016Google", "after": null, "start_char_pos": 54, "end_char_pos": 83}, {"type": "D", "before": "optimal", "after": null, "start_char_pos": 150, "end_char_pos": 157}, {"type": "R", "before": "paragraphs/sentences", "after": "contents", "start_char_pos": 365, "end_char_pos": 385}, {"type": "R", "before": "the attention-aware inference of NAS requires the prediction of the optimal attention distribution. Therefore,", "after": "NAS is not based on one-to-one transformation. Instead, its attention distribution for the input should be irregular and depend on the content layout of the source documents. To address this matter, we construct", "start_char_pos": 425, "end_char_pos": 535}, {"type": "D", "before": "is constructed", "after": null, "start_char_pos": 566, "end_char_pos": 580}, {"type": "R", "before": "attention weights and sources. To apply the attention-aware inference on multi-document summarization, a Hierarchical Transformer (HT) is developed to accept lengthy inputs at the same time project cross-document information. Experiments on WikiSum \\mbox{%DIFAUXCMD liu2018generating", "after": "the optimal attention distribution and the source.", "start_char_pos": 613, "end_char_pos": 896}, {"type": "R", "before": "regular", "after": "vanilla", "start_char_pos": 913, "end_char_pos": 920}, {"type": "R", "before": "inference", "after": "mechanism", "start_char_pos": 958, "end_char_pos": 967}, {"type": "D", "before": "further", "after": null, "start_char_pos": 1032, "end_char_pos": 1039}, {"type": "R", "before": "could be adopted to single-document summarization with straightforward modifications according to the model architecture", "after": "has strong universality that can be easily adopted to different hierarchical summarization models to promote the models' performance", "start_char_pos": 1104, "end_char_pos": 1224}], "sents_char_pos": [0, 412, 524, 643, 838, 1049]} {"doc_id": "2009.06891", "revision_depth": "2", "before_revision": "Inspired by Google's Neural Machine Translation (NMT) that models the one-to-one alignment in translation tasks with an uniform attention distribution during the inference, this study proposes an attention-aware inference algorithm for Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source contents with the optimal coverage. Unlike NMT, NAS is not based on one-to-one transformation. Instead, its attention distribution for the input should be irregular and depend on the content layout of the source documents. To address this matter, we construct an attention-prediction model to learn the dependency between the optimal attention distribution and the source . By refining the vanilla beam searchwith the attention-aware mechanism, significant improvements on the quality of summaries could be observed. Last but not the least, the attention-aware inference has strong universality that can be easily adopted to different hierarchical summarization models to promote the models' performance .", "after_revision": "This paper proposes a novel inference algorithm for seq-to-seq models. It corrects beam search step-by-step via the optimal attention distribution to make the generated text attend to source tokens in a controlled way. Experiments show the proposed attention-aware inference produces summaries rather differently from the beam search, and achieves promising improvements of higher scores and greater conciseness. The algorithm is also proven robust as it remains to outperform beam search significantly even with corrupted attention distributions .", "edit_actions": [{"type": "R", "before": "Inspired by Google's Neural Machine Translation (NMT) that models the one-to-one alignment in translation tasks with an uniform attention distribution during the inference, this study proposes an attention-aware", "after": "This paper proposes a novel", "start_char_pos": 0, "end_char_pos": 211}, {"type": "R", "before": "Neural Abstractive Summarization (NAS) to regulate generated summaries to attend to source contents with the optimal coverage. Unlike NMT, NAS is not based on one-to-one transformation. Instead, its attention distribution for the input should be irregular and depend on the content layout of the source documents. To address this matter, we construct an attention-prediction model to learn the dependency between the optimal attention distribution and the source . By refining the vanilla beam searchwith the", "after": "seq-to-seq models. It corrects beam search step-by-step via the optimal attention distribution to make the generated text attend to source tokens in a controlled way. Experiments show the proposed", "start_char_pos": 236, "end_char_pos": 744}, {"type": "R", "before": "mechanism, significant improvements on the quality of summaries could be observed. Last but not the least, the attention-aware inference has strong universality that can be easily adopted to different hierarchical summarization models to promote the models' performance", "after": "inference produces summaries rather differently from the beam search, and achieves promising improvements of higher scores and greater conciseness. The algorithm is also proven robust as it remains to outperform beam search significantly even with corrupted attention distributions", "start_char_pos": 761, "end_char_pos": 1030}], "sents_char_pos": [0, 362, 421, 549, 700, 843]} {"doc_id": "2009.06891", "revision_depth": "3", "before_revision": "This paper proposes a novel inference algorithm for seq-to-seq models. It corrects beam search step-by-step via the optimal attention distribution to make the generated text attend to source tokens in a controlled way. Experiments show the proposed attention-aware inferenceproduces summaries rather differently from the beam search , and achieves promising improvements of higher scores and greater conciseness. The algorithm is also proven robust as it remains to outperform beam search significantly even with corrupted attention distributions .", "after_revision": "This study develops a calibrated beam-based algorithm with global awareness for neural abstractive summarization, aiming to improve the local optimality problem of the original beam search in a rigorous way. Specifically, a novel global protocol is proposed based on the attention distribution to stipulate how a global optimal hypothesis should attend to the source. A global scoring function is then developed to regulate beam search to generate summaries in a more near-global optimal fashion. This novel design enjoys a distinctive property, i.e. the global attention distribution could be predicted before inference, enabling stepwise improvements on the beam search through the global scoring function. Extensive experiments on 9 datasets show that the global-aware inference significantly improves state-of-the-art summarization models even using empirical hyper-parameters. The algorithm is also proven robust as it remains to generate meaningful texts with corrupted attention distributions . The codes and a comprehensive set of examples are available .", "edit_actions": [{"type": "R", "before": "paper proposes a novel inference algorithm for seq-to-seq models. It corrects beam search step-by-step via the optimal", "after": "study develops a calibrated beam-based algorithm with global awareness for neural abstractive summarization, aiming to improve the local optimality problem of the original beam search in a rigorous way. Specifically, a novel global protocol is proposed based on the", "start_char_pos": 5, "end_char_pos": 123}, {"type": "R", "before": "make the generated text attend to source tokens in a controlled way. Experiments show the proposed attention-aware inferenceproduces summaries rather differently from", "after": "stipulate how a global optimal hypothesis should attend to the source. A global scoring function is then developed to regulate beam search to generate summaries in a more near-global optimal fashion. This novel design enjoys a distinctive property, i.e. the global attention distribution could be predicted before inference, enabling stepwise improvements on", "start_char_pos": 150, "end_char_pos": 316}, {"type": "R", "before": ", and achieves promising improvements of higher scores and greater conciseness.", "after": "through the global scoring function. Extensive experiments on 9 datasets show that the global-aware inference significantly improves state-of-the-art summarization models even using empirical hyper-parameters.", "start_char_pos": 333, "end_char_pos": 412}, {"type": "R", "before": "outperform beam search significantly even", "after": "generate meaningful texts", "start_char_pos": 466, "end_char_pos": 507}, {"type": "A", "before": null, "after": ". The codes and a comprehensive set of examples are available", "start_char_pos": 547, "end_char_pos": 547}], "sents_char_pos": [0, 70, 218, 412]} {"doc_id": "2009.06960", "revision_depth": "1", "before_revision": "To prevent the outbreak of the Coronavirus disease (COVID-19), numerous countries around the world went into lockdown and imposed unprecedented containment measures. These restrictions progressively produced changes to social behavior and global mobility patterns, evidently disrupting social and economic activities. Here, using maritime traffic data , collected via a global network of Automatic Identification System (AIS ) receivers, we analyze the effects that the COVID-19 pandemic and the containment measures had on the shipping industry, which accounts alone for more than 80\\% of the world trade. We introduce the notion of a \"maritime mobility index,\" a synthetic composite index, to quantitatively assess ship mobility in a given unit of time. The mobility index calculation used in this study, has a worldwide extent and is based on the computation of cumulative navigated miles (CNM ) of all ships reporting their position and navigational status via AIS . We compare 2020 mobility levels to those of previous years assuming that an unchanged growth rate would have been achieved, if not for COVID-19. Following the outbreak, we find an unprecedented drop in maritime mobility, across all categories of commercial shipping. The reduced activity is observable from March to June, when the most severe restrictions were in force , producing a variation of mobility quantified between -5.62\\% and -13.77\\% for container ships, between +2.28\\% and -3.32\\% for dry bulk, between -0.22\\% and -9.27\\% for wet bulk, and between -19.57\\% and -42.77\\% for passenger shipping. The presented study is unprecedented for the uniqueness and completeness of the employed AIS dataset, which comprises a trillion AIS messages broadcast worldwide by 50000 ships, a figure that closely parallels the documented size of the world merchant fleet.", "after_revision": "To prevent the outbreak of the Coronavirus disease (COVID-19), many countries around the world went into lockdown and imposed unprecedented containment measures. These restrictions progressively produced changes to social behavior and global mobility patterns, evidently disrupting social and economic activities. Here, using maritime traffic data collected via a global network of AIS receivers, we analyze the effects that the COVID-19 pandemic and containment measures had on the shipping industry, which accounts alone for more than 80\\% of the world trade. We rely on multiple data-driven maritime mobility indexes to quantitatively assess ship mobility in a given unit of time. The mobility analysis here presented has a worldwide extent and is based on the computation of : CNM of all ships reporting their position and navigational status via AIS , number of active and idle ships, and fleet average speed. To highlight significant changes in shipping routes and operational patterns, we also compute and compare global and local density maps. We compare 2020 mobility levels to those of previous years assuming that an unchanged growth rate would have been achieved, if not for COVID-19. Following the outbreak, we find an unprecedented drop in maritime mobility, across all categories of commercial shipping. With few exceptions, a generally reduced activity is observable from March to June, when the most severe restrictions were in force . We quantify a variation of mobility between -5.62\\% and -13.77\\% for container ships, between +2.28\\% and -3.32\\% for dry bulk, between -0.22\\% and -9.27\\% for wet bulk, and between -19.57\\% and -42.77\\% for passenger traffic. This study is unprecedented for the uniqueness and completeness of the employed dataset, which comprises a trillion AIS messages broadcast worldwide by 50000 ships, a figure that closely parallels the documented size of the world merchant fleet.", "edit_actions": [{"type": "R", "before": "numerous", "after": "many", "start_char_pos": 63, "end_char_pos": 71}, {"type": "D", "before": ",", "after": null, "start_char_pos": 352, "end_char_pos": 353}, {"type": "R", "before": "Automatic Identification System (AIS )", "after": "AIS", "start_char_pos": 388, "end_char_pos": 426}, {"type": "D", "before": "the", "after": null, "start_char_pos": 492, "end_char_pos": 495}, {"type": "R", "before": "introduce the notion of a \"maritime mobility index,\" a synthetic composite index,", "after": "rely on multiple data-driven maritime mobility indexes", "start_char_pos": 610, "end_char_pos": 691}, {"type": "R", "before": "index calculation used in this study,", "after": "analysis here presented", "start_char_pos": 769, "end_char_pos": 806}, {"type": "R", "before": "cumulative navigated miles (CNM )", "after": ": CNM", "start_char_pos": 865, "end_char_pos": 898}, {"type": "R", "before": ".", "after": ", number of active and idle ships, and fleet average speed. To highlight significant changes in shipping routes and operational patterns, we also compute and compare global and local density maps.", "start_char_pos": 969, "end_char_pos": 970}, {"type": "R", "before": "The", "after": "With few exceptions, a generally", "start_char_pos": 1238, "end_char_pos": 1241}, {"type": "R", "before": ", producing", "after": ". We quantify", "start_char_pos": 1341, "end_char_pos": 1352}, {"type": "D", "before": "quantified", "after": null, "start_char_pos": 1377, "end_char_pos": 1387}, {"type": "R", "before": "shipping. The presented", "after": "traffic. This", "start_char_pos": 1570, "end_char_pos": 1593}, {"type": "D", "before": "AIS", "after": null, "start_char_pos": 1669, "end_char_pos": 1672}], "sents_char_pos": [0, 165, 317, 606, 755, 1115, 1237, 1579]} {"doc_id": "2009.08456", "revision_depth": "1", "before_revision": "Obtaining quantitative survey responses that are both accurate and informative is crucial to a wide range of fields (e. g. perceptual and categorical judgement, expert risk assessment, attitudinal measurement, consumer and public opinion research). Traditional and ubiquitous response formats such as Likert and Visual Analogue Scales require condensation of responses into discrete or point values-but sometimes a range of options may better represent the correct answer. In this paper, we propose an efficient interval-valued response mode, whereby responses are made by marking an ellipse along a continuous scale. We discuss its potential in the context of survey research, describing how this approach can capture and quantify valuable information arising from multiple sources of response uncertainty-which would be lost using conventional approaches--while preserving a high degree of response-efficiency. We then report a validation study, which utilizes our recently introduced open-source software (DECSYS) to administer an electronic interval-valued survey. This is designed to explore how interval-values reflect experimental manipulations of response (un)certainty across multiple contexts. Results consistently indicated that respondents used interval widths effectively-to communicate uncertainty (e.g. lack of available information), ambiguity (e.g. lack of clarity in question phrasing), and inherent variability in their responses. Subjective participant feedback was also positive. We present this as initial empirical evidence for the efficacy and value of interval-valued response capture. Interestingly, intervals also provided insight into respondents' reasoning about different types of uncertainties, suggesting a tendency to underestimate lack of available information relative to observable variability when making a stimulus judgement .", "after_revision": "Obtaining quantitative survey responses that are both accurate and informative is crucial to a wide range of fields . Traditional and ubiquitous response formats such as Likert and Visual Analogue Scales require condensation of responses into discrete point values - but sometimes a range of options may better represent the correct answer. In this paper, we propose an efficient interval-valued response mode, whereby responses are made by marking an ellipse along a continuous scale. We discuss its potential to capture and quantify valuable information that would be lost using conventional approaches, while preserving a high degree of response-efficiency. The information captured by the response interval may represent a possible response range - i.e., a conjunctive set, such as the real numbers between three and six. Alternatively, it may reflect uncertainty in respect to a distinct response - i.e., a disjunctive set, such as a confidence interval. We then report a validation study, utilizing our recently introduced open-source software (DECSYS) to explore how interval-valued survey responses reflect experimental manipulations of several factors hypothesised to influence interval width, across multiple contexts. Results consistently indicate that respondents used interval widths effectively, and subjective participant feedback was also positive. We present this as initial empirical evidence for the efficacy and value of interval-valued response capture. Interestingly, our results also provide insight into respondents' reasoning about the different aforementioned types of intervals - we replicate a tendency towards overconfidence for those representing epistemic uncertainty (i.e., disjunctive sets), but find intervals representing inherent range (i.e., conjunctive sets) to be well-calibrated .", "edit_actions": [{"type": "R", "before": "(e. g. perceptual and categorical judgement, expert risk assessment, attitudinal measurement, consumer and public opinion research).", "after": ".", "start_char_pos": 116, "end_char_pos": 248}, {"type": "R", "before": "or point values-but", "after": "point values - but", "start_char_pos": 383, "end_char_pos": 402}, {"type": "R", "before": "in the context of survey research, describing how this approach can", "after": "to", "start_char_pos": 643, "end_char_pos": 710}, {"type": "R", "before": "arising from multiple sources of response uncertainty-which", "after": "that", "start_char_pos": 753, "end_char_pos": 812}, {"type": "R", "before": "approaches--while", "after": "approaches, while", "start_char_pos": 846, "end_char_pos": 863}, {"type": "A", "before": null, "after": "The information captured by the response interval may represent a possible response range - i.e., a conjunctive set, such as the real numbers between three and six. Alternatively, it may reflect uncertainty in respect to a distinct response - i.e., a disjunctive set, such as a confidence interval.", "start_char_pos": 913, "end_char_pos": 913}, {"type": "R", "before": "which utilizes", "after": "utilizing", "start_char_pos": 949, "end_char_pos": 963}, {"type": "R", "before": "administer an electronic", "after": "explore how", "start_char_pos": 1021, "end_char_pos": 1045}, {"type": "R", "before": "survey. This is designed to explore how interval-values", "after": "survey responses", "start_char_pos": 1062, "end_char_pos": 1117}, {"type": "R", "before": "response (un)certainty", "after": "several factors hypothesised to influence interval width,", "start_char_pos": 1156, "end_char_pos": 1178}, {"type": "R", "before": "indicated", "after": "indicate", "start_char_pos": 1226, "end_char_pos": 1235}, {"type": "R", "before": "effectively-to communicate uncertainty (e.g. lack of available information), ambiguity (e.g. lack of clarity in question phrasing), and inherent variability in their responses. Subjective", "after": "effectively, and subjective", "start_char_pos": 1274, "end_char_pos": 1461}, {"type": "R", "before": "intervals also provided", "after": "our results also provide", "start_char_pos": 1627, "end_char_pos": 1650}, {"type": "R", "before": "different types of uncertainties, suggesting a tendency to underestimate lack of available information relative to observable variability when making a stimulus judgement", "after": "the different aforementioned types of intervals - we replicate a tendency towards overconfidence for those representing epistemic uncertainty (i.e., disjunctive sets), but find intervals representing inherent range (i.e., conjunctive sets) to be well-calibrated", "start_char_pos": 1693, "end_char_pos": 1863}], "sents_char_pos": [0, 248, 472, 617, 912, 1069, 1204, 1450, 1501, 1611]} {"doc_id": "2009.08553", "revision_depth": "2", "before_revision": "Conventional sparse retrieval methods such as TF-IDF and BM25 are simple and efficient, but solely rely on lexical overlap without semantic matching. Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation . We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \\mbox{%DIFAUXCMD karpukhin2020dense . We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance. Furthermore, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets under the extractive setting when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used.", "after_revision": "We propose Generation-Augmented Retrieval (GAR) for answering open-domain questions, which augments a query through text generation of heuristically discovered relevant contexts without external resources as supervision . We demonstrate that the generated contexts substantially enrich the semantics of the queries and GAR with sparse representations (BM25) achieves comparable or better performance than state-of-the-art dense retrieval methods such as DPR . We show that generating diverse contexts for a query is beneficial as fusing their results consistently yields better retrieval accuracy. Moreover, as sparse and dense representations are often complementary, GAR can be easily combined with DPR to achieve even better performance. GAR achieves state-of-the-art performance on Natural Questions and TriviaQA datasets under the extractive QA setup when equipped with an extractive reader, and consistently outperforms other retrieval methods when the same generative reader is used.", "edit_actions": [{"type": "R", "before": "Conventional sparse retrieval methods such as TF-IDF and BM25 are simple and efficient, but solely rely on lexical overlap without semantic matching. Recent dense retrieval methods learn latent representations to tackle the lexical mismatch problem, while being more computationally expensive and insufficient for exact matching as they embed the text sequence into a single vector with limited capacity. In this paper, we present", "after": "We propose", "start_char_pos": 0, "end_char_pos": 430}, {"type": "R", "before": ", a query expansion method that", "after": "for answering open-domain questions, which", "start_char_pos": 468, "end_char_pos": 499}, {"type": "D", "before": "with relevant contexts", "after": null, "start_char_pos": 517, "end_char_pos": 539}, {"type": "A", "before": null, "after": "of heuristically discovered relevant contexts without external resources as supervision", "start_char_pos": 564, "end_char_pos": 564}, {"type": "D", "before": "on open-domain question answering", "after": null, "start_char_pos": 582, "end_char_pos": 615}, {"type": "R", "before": "significantly", "after": "substantially", "start_char_pos": 644, "end_char_pos": 657}, {"type": "D", "before": "thus", "after": null, "start_char_pos": 698, "end_char_pos": 702}, {"type": "D", "before": "the", "after": null, "start_char_pos": 789, "end_char_pos": 792}, {"type": "A", "before": null, "after": "retrieval", "start_char_pos": 816, "end_char_pos": 816}, {"type": "D", "before": "\\mbox{%DIFAUXCMD karpukhin2020dense", "after": null, "start_char_pos": 837, "end_char_pos": 872}, {"type": "R", "before": "various contexts of", "after": "diverse contexts for", "start_char_pos": 899, "end_char_pos": 918}, {"type": "R", "before": "Furthermore, GAR achieves the", "after": "GAR achieves", "start_char_pos": 1155, "end_char_pos": 1184}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1217, "end_char_pos": 1220}, {"type": "R", "before": "setting", "after": "QA setup", "start_char_pos": 1282, "end_char_pos": 1289}], "sents_char_pos": [0, 149, 404, 566, 874, 1011, 1154]} {"doc_id": "2009.12068", "revision_depth": "1", "before_revision": " To improve the efficiency of deep reinforcement learning (DRL) based methods for robot manipulator trajectory planning in random working environment. Different from the traditional sparse reward function , we present three dense reward functions in this paper. Firstly, posture reward function is proposed to accelerate the learning process with a more reasonable trajectory by modeling the distance and direction constraints, which can reduce the blindness of exploration. Secondly, to improve the stability, a reward function at stride reward is proposed by modeling the distance and movement distance of joints constraints, it can make the learning process more stable. In order to further improve learning efficiency, we are inspired by the cognitive process of human behavior and propose a stage incentive mechanism, including hard stage incentive reward function and soft stage incentive reward function. Extensive experiments show that the soft stage incentive reward function proposed is able to improve convergence rate by up to 46.9\\% with the state-of-the-art DRL methods. The percentage increase in convergence mean reward is 4.4 \\%~15.5\\% and the percentage decreases with respect to standard deviation by 21.9 \\%~63.2\\% . In the evaluation , the success rate of trajectory planning for robot manipulator is up to 99.6\\%.", "after_revision": "(This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.) To improve the efficiency of deep reinforcement learning (DRL) -based methods for robot manipulator trajectory planning in random working environments , we present three dense reward functions . These rewards differ from the traditional sparse reward. First, a posture reward function is proposed to speed up the learning process with a more reasonable trajectory by modeling the distance and direction constraints, which can reduce the blindness of exploration. Second, a stride reward function is proposed to improve the stability of the learning process by modeling the distance and movement distance of joint constraints. Finally, in order to further improve learning efficiency, we are inspired by the cognitive process of human behavior and propose a stage incentive mechanism, including a hard stage incentive reward function and a soft stage incentive reward function. Extensive experiments show that the soft stage incentive reward function is able to improve the convergence rate by up to 46.9\\% with the state-of-the-art DRL methods. The percentage increase in the convergence mean reward was 4.4 -15.5\\% and the percentage decreases with respect to standard deviation were 21.9 -63.2\\% . In the evaluation experiments , the success rate of trajectory planning for a robot manipulator reached 99.6\\%.", "edit_actions": [{"type": "A", "before": null, "after": "(This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.)", "start_char_pos": 0, "end_char_pos": 0}, {"type": "R", "before": "based", "after": "-based", "start_char_pos": 64, "end_char_pos": 69}, {"type": "R", "before": "environment. Different from the traditional sparse reward function", "after": "environments", "start_char_pos": 138, "end_char_pos": 204}, {"type": "R", "before": "in this paper. Firstly,", "after": ". These rewards differ from the traditional sparse reward. First, a", "start_char_pos": 247, "end_char_pos": 270}, {"type": "R", "before": "accelerate", "after": "speed up", "start_char_pos": 310, "end_char_pos": 320}, {"type": "R", "before": "Secondly, to improve the stability, a reward function at stride reward is proposed", "after": "Second, a stride reward function is proposed to improve the stability of the learning process", "start_char_pos": 475, "end_char_pos": 557}, {"type": "R", "before": "joints constraints, it can make the learning process more stable. In", "after": "joint constraints. Finally, in", "start_char_pos": 608, "end_char_pos": 676}, {"type": "A", "before": null, "after": "a", "start_char_pos": 833, "end_char_pos": 833}, {"type": "A", "before": null, "after": "a", "start_char_pos": 875, "end_char_pos": 875}, {"type": "D", "before": "proposed", "after": null, "start_char_pos": 987, "end_char_pos": 995}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1015, "end_char_pos": 1015}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1115, "end_char_pos": 1115}, {"type": "R", "before": "is", "after": "was", "start_char_pos": 1140, "end_char_pos": 1142}, {"type": "R", "before": "\\%~15.5\\%", "after": "-15.5\\%", "start_char_pos": 1147, "end_char_pos": 1156}, {"type": "R", "before": "by", "after": "were", "start_char_pos": 1221, "end_char_pos": 1223}, {"type": "R", "before": "\\%~63.2\\%", "after": "-63.2\\%", "start_char_pos": 1229, "end_char_pos": 1238}, {"type": "A", "before": null, "after": "experiments", "start_char_pos": 1259, "end_char_pos": 1259}, {"type": "R", "before": "robot manipulator is up to", "after": "a robot manipulator reached", "start_char_pos": 1306, "end_char_pos": 1332}], "sents_char_pos": [0, 150, 261, 474, 673, 913, 1087]} {"doc_id": "2009.13076", "revision_depth": "1", "before_revision": "The emergence of the COVID-19 pandemic, a new and novel risk factors , leads to the stock price crash due to a rapid and synchronous sell-off by the investors . However, within a short period, the quality sectors start recovering from the bottom. A model of the stock price movement has been developed to explain such phenomena based on the Institutional fund flow and financial antifragility , which represents the financial indicator of a company. The assumes that during the crash, the stock does not depend on the financial antifragility of a company . We study the effects of shock lengths and antifragility parameter on the stock price during the crises period using the synthetic and real fund flow data. We observed that the possibility of recovery of a quality stock decreases with an increase in shock-length beyond a specific period. On the other hand, a quality stock with higher antifragility shows V-shape recovery and outperform others. The shock lengths and recovery length of quality stock are almost equal that is seen in the Indian market. Financially stressed stocks, i.e., the stock with negative antifragility, showed L-shape recovery during the pandemic. The results show that the investors, in the uncertainty like COVID-19, restructure their portfolio to de-risk the investment towards quality stocks . The study may help the investors to make the right investment decision during a crisis.", "after_revision": "The emergence of the COVID-19 pandemic, a new and novel risk factor , leads to the stock price crash due to the investors' rapid and synchronous sell-off . However, within a short period, the quality sectors start recovering from the bottom. A stock price model has been developed during such crises based on the net-fund-flow (\\Psi_t) due to institutional investors, and financial antifragility (\\phi) of a company. We assume that during the crash, the stock price fall is independent of the \\phi . We study the effects of shock lengths and \\phi on the stock price during the crises period using the \\Psi_t obtained from synthetic and real fund flow data. We observed that the possibility of recovery of stock with \\phi>0, termed as quality stock, decreases with an increase in shock-length beyond a specific period. A quality stock with higher \\phi shows V-shape recovery and outperform others. The shock length and recovery period of quality stock are almost equal that is seen in the Indian market. Financially stressed stocks, i.e., the stocks with \\phi<0, show L-shape recovery during the pandemic. The stock data and model analysis shows that the investors, in the uncertainty like COVID-19, invest in the quality stocks to restructure their portfolio to reduce the risk . The study may help the investors to make the right investment decision during a crisis.", "edit_actions": [{"type": "R", "before": "factors", "after": "factor", "start_char_pos": 61, "end_char_pos": 68}, {"type": "R", "before": "a", "after": "the investors'", "start_char_pos": 109, "end_char_pos": 110}, {"type": "D", "before": "by the investors", "after": null, "start_char_pos": 142, "end_char_pos": 158}, {"type": "R", "before": "model of the stock price movement", "after": "stock price model", "start_char_pos": 249, "end_char_pos": 282}, {"type": "R", "before": "to explain such phenomena", "after": "during such crises", "start_char_pos": 302, "end_char_pos": 327}, {"type": "R", "before": "Institutional fund flow", "after": "net-fund-flow (\\Psi_t) due to institutional investors,", "start_char_pos": 341, "end_char_pos": 364}, {"type": "R", "before": ", which represents the financial indicator", "after": "(\\phi)", "start_char_pos": 393, "end_char_pos": 435}, {"type": "R", "before": "The assumes", "after": "We assume", "start_char_pos": 450, "end_char_pos": 461}, {"type": "R", "before": "does not depend on the financial antifragility of a company", "after": "price fall is independent of the \\phi", "start_char_pos": 495, "end_char_pos": 554}, {"type": "R", "before": "antifragility parameter", "after": "\\phi", "start_char_pos": 599, "end_char_pos": 622}, {"type": "A", "before": null, "after": "\\Psi_t obtained from", "start_char_pos": 677, "end_char_pos": 677}, {"type": "R", "before": "a quality stock", "after": "stock with \\phi>0, termed as quality stock,", "start_char_pos": 761, "end_char_pos": 776}, {"type": "R", "before": "On the other hand, a", "after": "A", "start_char_pos": 846, "end_char_pos": 866}, {"type": "R", "before": "antifragility", "after": "\\phi", "start_char_pos": 893, "end_char_pos": 906}, {"type": "R", "before": "lengths and recovery length", "after": "length and recovery period", "start_char_pos": 963, "end_char_pos": 990}, {"type": "R", "before": "stock with negative antifragility, showed", "after": "stocks with \\phi<0, show", "start_char_pos": 1099, "end_char_pos": 1140}, {"type": "R", "before": "results show", "after": "stock data and model analysis shows", "start_char_pos": 1183, "end_char_pos": 1195}, {"type": "A", "before": null, "after": "invest in the quality stocks to", "start_char_pos": 1250, "end_char_pos": 1250}, {"type": "R", "before": "de-risk the investment towards quality stocks", "after": "reduce the risk", "start_char_pos": 1282, "end_char_pos": 1327}], "sents_char_pos": [0, 160, 246, 449, 556, 712, 845, 952, 1059, 1178, 1329]} {"doc_id": "2009.13620", "revision_depth": "1", "before_revision": "The growth of science and technology is primarily a recombinative process, wherein new discoveries and inventions are generally built from prior knowledge. While the recent past has seen rapid growth in scientific and technological knowledge, relatively little is known about the manner in which science and technology develop and coalesce knowledge into larger structures that enable or constrain future breakthroughs. Network science has recently emerged as a framework for measuring the structure and dynamics of knowledge. While helpful, these existing approaches struggle to capture the global structural properties of the underlying networks, leading to conflicting observations about the nature of scientific and technological progress. We bridge this methodological gap using tools from algebraic topology to characterize the higher-order structure of knowledge networks in science and technology across scale. We observe rapid and varied growth in the high-dimensional structure in many fields of science and technology, and find this high-dimensional growth coincides with decline in lower-dimensional structure. This higher-order growth in knowledge networks has historically far outpaced the growth in scientific and technological collaboration networks. We also characterize the relationship between higher-order structure and the nature of the science and technology produced within these structural environments and find a positive relationship between the abstractness of language used within fields and increasing high-dimensional structure. We also find a robust relationship between high-dimensional structure and number of metrics for publication success, implying this high-dimensional structure may be linked to discovery and invention .", "after_revision": "The growth of science and technology is a recombinative process, wherein new discoveries and inventions are built from prior knowledge. Yet relatively little is known about the manner in which scientific and technological knowledge develop and coalesce into larger structures that enable or constrain future breakthroughs. Network science has recently emerged as a framework for measuring the structure and dynamics of knowledge. While helpful, existing approaches struggle to capture the global properties of the underlying networks, leading to conflicting observations about the nature of scientific and technological progress. We bridge this methodological gap using tools from algebraic topology to characterize the higher-order structure of knowledge networks in science and technology across scale. We observe rapid growth in the higher-order structure of knowledge in many scientific and technological fields. This growth is not observable using traditional network measures. We further demonstrate that the emergence of higher-order structure coincides with decline in lower-order structure, and has historically far outpaced the corresponding emergence of higher-order structure in scientific and technological collaboration networks. Up to a point, increases in higher-order structure are associated with better outcomes, as measured by the novelty and impact of papers and patents. However, the nature of science and technology produced under higher-order regimes also appears to be qualitatively different from that produced under lower-order ones, with the former exhibiting greater linguistic abstractness and greater tendencies for building upon prior streams of knowledge .", "edit_actions": [{"type": "D", "before": "primarily", "after": null, "start_char_pos": 40, "end_char_pos": 49}, {"type": "D", "before": "generally", "after": null, "start_char_pos": 118, "end_char_pos": 127}, {"type": "R", "before": "While the recent past has seen rapid growth in scientific and technological knowledge,", "after": "Yet", "start_char_pos": 156, "end_char_pos": 242}, {"type": "R", "before": "science and technology", "after": "scientific and technological knowledge", "start_char_pos": 296, "end_char_pos": 318}, {"type": "D", "before": "knowledge", "after": null, "start_char_pos": 340, "end_char_pos": 349}, {"type": "D", "before": "these", "after": null, "start_char_pos": 542, "end_char_pos": 547}, {"type": "D", "before": "structural", "after": null, "start_char_pos": 599, "end_char_pos": 609}, {"type": "D", "before": "and varied", "after": null, "start_char_pos": 936, "end_char_pos": 946}, {"type": "R", "before": "high-dimensional structure in many fields of science and technology, and find this high-dimensional growth", "after": "higher-order structure of knowledge in many scientific and technological fields. This growth is not observable using traditional network measures. We further demonstrate that the emergence of higher-order structure", "start_char_pos": 961, "end_char_pos": 1067}, {"type": "R", "before": "lower-dimensional structure. This higher-order growth in knowledge networks", "after": "lower-order structure, and", "start_char_pos": 1094, "end_char_pos": 1169}, {"type": "R", "before": "growth", "after": "corresponding emergence of higher-order structure", "start_char_pos": 1204, "end_char_pos": 1210}, {"type": "R", "before": "We also characterize the relationship between", "after": "Up to a point, increases in", "start_char_pos": 1267, "end_char_pos": 1312}, {"type": "R", "before": "and", "after": "are associated with better outcomes, as measured by the novelty and impact of papers and patents. However,", "start_char_pos": 1336, "end_char_pos": 1339}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1354, "end_char_pos": 1357}, {"type": "R", "before": "within these structural environments and find a positive relationship between the abstractness of language used within fields and increasing high-dimensional structure. We also find a robust relationship between high-dimensional structure and number of metrics for publication success, implying this high-dimensional structure may be linked to discovery and invention", "after": "under higher-order regimes also appears to be qualitatively different from that produced under lower-order ones, with the former exhibiting greater linguistic abstractness and greater tendencies for building upon prior streams of knowledge", "start_char_pos": 1390, "end_char_pos": 1757}], "sents_char_pos": [0, 155, 419, 526, 743, 918, 1122, 1266, 1558]} {"doc_id": "2009.13734", "revision_depth": "1", "before_revision": "The nodes of a graph existing in a specific cluster are more likely to connect to each other than with other nodes in the graph. Then revealing some information about the nodes, the structure of the graph ( the graph edges) provides this opportunity to know more information about the other nodes. From this perspective, this paper revisits the node classification task in a semi-supervised scenario by graph convolutional neural network . The goal is to benefit from the flow of information that circulates around the revealed node labels. For this aim , this paper provides a new graph convolutional neural network architecture. This architecture benefits efficiently from the revealed training nodes, the node features, and the graph structure. On the other hand, in many applications, non-graph observations ( side information) exist beside a given graph realization . The non-graph observations are usually independent of the graph structure. This paper shows that the proposed architecture is also powerful in combining a graph realization and independent non-graph observations. For both cases, the experiments on the synthetic and real-world datasets demonstrate that our proposed architecture achieves a higher prediction accuracy in comparison to the existing state-of-the-art methods for the node classification task.", "after_revision": "The nodes of a graph existing in a cluster are more likely to connect to each other than with other nodes in the graph. Then revealing some information about some nodes, the structure of the graph ( graph edges) provides this opportunity to know more information about other nodes. From this perspective, this paper revisits the node classification task in a semi-supervised scenario by graph convolutional networks (GCNs) . The goal is to benefit from the flow of information that circulates around the revealed node labels. The contribution of this paper is twofold. First , this paper provides a method for extracting side information from a graph realization. Then a new GCN architecture is presented that combines the output of traditional GCN and the extracted side information. Another contribution of this paper is relevant to non-graph observations ( independent side information) that exists beside a graph realization in many applications. Indeed, the extracted side information can be replaced by a sequence of side information that is independent of the graph structure. For both cases, the experiments on synthetic and real-world datasets demonstrate that the proposed model achieves a higher prediction accuracy in comparison to the existing state-of-the-art methods for the node classification task.", "edit_actions": [{"type": "D", "before": "specific", "after": null, "start_char_pos": 35, "end_char_pos": 43}, {"type": "R", "before": "the", "after": "some", "start_char_pos": 167, "end_char_pos": 170}, {"type": "D", "before": "the", "after": null, "start_char_pos": 207, "end_char_pos": 210}, {"type": "D", "before": "the", "after": null, "start_char_pos": 281, "end_char_pos": 284}, {"type": "R", "before": "neural network", "after": "networks (GCNs)", "start_char_pos": 423, "end_char_pos": 437}, {"type": "R", "before": "For this aim", "after": "The contribution of this paper is twofold. First", "start_char_pos": 541, "end_char_pos": 553}, {"type": "R", "before": "new graph convolutional neural network architecture. This architecture benefits efficiently from the revealed training nodes, the node features, and the graph structure. On the other hand, in many applications,", "after": "method for extracting side information from a graph realization. Then a new GCN architecture is presented that combines the output of traditional GCN and the extracted side information. Another contribution of this paper is relevant to", "start_char_pos": 578, "end_char_pos": 788}, {"type": "A", "before": null, "after": "independent", "start_char_pos": 814, "end_char_pos": 814}, {"type": "R", "before": "exist beside a given graph realization . The non-graph observations are usually", "after": "that exists beside a graph realization in many applications. Indeed, the extracted side information can be replaced by a sequence of side information that is", "start_char_pos": 833, "end_char_pos": 912}, {"type": "D", "before": "This paper shows that the proposed architecture is also powerful in combining a graph realization and independent non-graph observations.", "after": null, "start_char_pos": 949, "end_char_pos": 1086}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1122, "end_char_pos": 1125}, {"type": "R", "before": "our proposed architecture", "after": "the proposed model", "start_char_pos": 1177, "end_char_pos": 1202}], "sents_char_pos": [0, 128, 297, 439, 540, 630, 747, 873, 948, 1086]} {"doc_id": "2009.14043", "revision_depth": "1", "before_revision": "In the Online Simple Knapsack Problem we are given a knapsack of unit size 1. Items of size smaller or equal to 1 are presented in an iterative fashion and an algorithm has to decide whether to permanently include or reject each item into the knapsack without any knowledge about the rest of the instance. The goal is then to pack the knapsack as full as possible. In this work , we introduce a third option additional to those of packing and rejecting an item, namely that of reserving an item for the cost of a fixed fraction \\alpha of its size. An algorithm may pay this fraction in order to postpone its decision on whether to include or reject the item until after the last item of the instance was presented. While the classical Online Simple Knapsack Problem does not admit any constantly bounded competitive ratio in the deterministic setting, we find that adding the possibility of reservation makes the problem constantly competitive , with varying competitive ratios depending on the value of \\alpha. We give upper and lower bounds for the whole range of reservation costs, with tight bounds for costs up to 1/ 6---an area that is strictly 2-competitive---and for costs between 2-1 and 0.5---an area that is (2+\\alpha)-competitive . With our analysis, we find a counterintuitive characteristic of the problem: Intuitively, one would expect that the possibility of rejecting items becomes more and more helpful for an online algorithm with growing reservation costs. However, for higher reservation costs between \\sqrt{2}-1 and 0.5 , an algorithm that is unable to reject any items tightly matches the lower bound and is thus the best possible. On the other hand, for any positive reservation cost smaller than 1/6, any algorithm that is unable to reject any items performs considerably worse than one that is able to reject.", "after_revision": "In the Online Simple Knapsack Problem we are given a knapsack of unit size 1. Items of size smaller or equal to 1 are presented in an iterative way and an algorithm has to decide whether to permanently include or reject each item into the knapsack without any knowledge about the rest of the instance. The goal is then to pack the knapsack as full as possible. In this work we introduce a third option additional to those of packing and rejecting an item, namely that of reserving an item for the cost of a fixed fraction \\alpha of its size. An algorithm may pay this fraction in order to postpone its decision on whether to include or reject the item until after the last item of the instance was presented. We find that adding the possibility of reservation makes the problem constantly competitive with varying competitive ratios depending on the value of \\alpha. We give upper and lower bounds for the whole range of reservation costs, with tight bounds for costs up to 1/ 6 -- an area that is strictly 2-competitive, for costs between 2-1 and 1 -- an area that is strictly (2+\\alpha)-competitive up to \\phi -1, and strictly 1/(1-\\alpha)-competitive above \\phi-1, where \\phi is the golden ratio. We find a counterintuitive characteristic of the problem: Intuitively, one may expect that the possibility of rejecting items becomes more helpful for an online algorithm with growing reservation costs. However, for higher reservation costs above \\sqrt{2}-1 , an algorithm that is unable to reject any items tightly matches the lower bound and is thus the best possible. On the other hand, for any positive reservation cost smaller than 1/6, any algorithm that is unable to reject items performs considerably worse than one that is able to reject.", "edit_actions": [{"type": "R", "before": "fashion", "after": "way", "start_char_pos": 144, "end_char_pos": 151}, {"type": "D", "before": ",", "after": null, "start_char_pos": 378, "end_char_pos": 379}, {"type": "R", "before": "While the classical Online Simple Knapsack Problem does not admit any constantly bounded competitive ratio in the deterministic setting, we", "after": "We", "start_char_pos": 715, "end_char_pos": 854}, {"type": "D", "before": ",", "after": null, "start_char_pos": 944, "end_char_pos": 945}, {"type": "R", "before": "6---an", "after": "6 -- an", "start_char_pos": 1122, "end_char_pos": 1128}, {"type": "R", "before": "2-competitive---and", "after": "2-competitive,", "start_char_pos": 1151, "end_char_pos": 1170}, {"type": "R", "before": "0.5---an", "after": "1 -- an", "start_char_pos": 1197, "end_char_pos": 1205}, {"type": "A", "before": null, "after": "strictly", "start_char_pos": 1219, "end_char_pos": 1219}, {"type": "R", "before": ". With our analysis, we", "after": "up to \\phi -1, and strictly 1/(1-\\alpha)-competitive above \\phi-1, where \\phi is the golden ratio. We", "start_char_pos": 1243, "end_char_pos": 1266}, {"type": "R", "before": "would", "after": "may", "start_char_pos": 1339, "end_char_pos": 1344}, {"type": "D", "before": "and more", "after": null, "start_char_pos": 1405, "end_char_pos": 1413}, {"type": "R", "before": "between", "after": "above", "start_char_pos": 1516, "end_char_pos": 1523}, {"type": "D", "before": "and 0.5", "after": null, "start_char_pos": 1535, "end_char_pos": 1542}, {"type": "D", "before": "any", "after": null, "start_char_pos": 1766, "end_char_pos": 1769}], "sents_char_pos": [0, 77, 305, 364, 547, 714, 1011, 1244, 1477, 1655]} {"doc_id": "2010.00948", "revision_depth": "1", "before_revision": "Identifying causal relationships is a challenging yet a crucial problem in many fields of science like epidemiology, climatology, ecology, genomics, economics and neuroscience, to mention only a few. Recent studies have demonstrated that ordinal partition transition networks (OPTNs) allow to infer the coupling direction between two dynamical systems. In this work, we generalize this concept to the interaction between multiple dynamical systems and propose a new method to detect causality in multivariate observational data. We demonstrate that our approach can reliably identify the direction of interaction and the corresponding delays with numerical simulations using linear stochastic systems as well as nonlinear dynamical systems such as a network of neural mass models . Finally, we apply our method to real-world observational microelectrode array data from rodent brain slices to study the causal effect networks underlying epileptic activity. Our results from simulations as well as real-world data suggest that OPTNs can provide a complementary approach to reliably infer causal effect networks from multivariate observational data.", "after_revision": "Identifying causal relationships is a challenging yet crucial problem in many fields of science like epidemiology, climatology, ecology, genomics, economics and neuroscience, to mention only a few. Recent studies have demonstrated that ordinal partition transition networks (OPTNs) allow inferring the coupling direction between two dynamical systems. In this work, we generalize this concept to the study of the interactions among multiple dynamical systems and we propose a new method to detect causality in multivariate observational data. By applying this method to numerical simulations of coupled linear stochastic processes as well as two examples of interacting nonlinear dynamical systems (coupled Lorenz systems and a network of neural mass models ), we demonstrate that our approach can reliably identify the direction of interactions and the associated coupling delays . Finally, we study real-world observational microelectrode array electrophysiology data from rodent brain slices to identify the causal coupling structures underlying epileptiform activity. Our results , both from simulations and real-world data , suggest that OPTNs can provide a complementary and robust approach to infer causal effect networks from multivariate observational data.", "edit_actions": [{"type": "D", "before": "a", "after": null, "start_char_pos": 54, "end_char_pos": 55}, {"type": "R", "before": "to infer", "after": "inferring", "start_char_pos": 290, "end_char_pos": 298}, {"type": "R", "before": "interaction between", "after": "study of the interactions among", "start_char_pos": 401, "end_char_pos": 420}, {"type": "A", "before": null, "after": "we", "start_char_pos": 452, "end_char_pos": 452}, {"type": "R", "before": "We demonstrate that our approach can reliably identify the direction of interaction and the corresponding delays with numerical simulations using linear stochastic systems", "after": "By applying this method to numerical simulations of coupled linear stochastic processes", "start_char_pos": 530, "end_char_pos": 701}, {"type": "A", "before": null, "after": "two examples of interacting", "start_char_pos": 713, "end_char_pos": 713}, {"type": "R", "before": "such as", "after": "(coupled Lorenz systems and", "start_char_pos": 742, "end_char_pos": 749}, {"type": "A", "before": null, "after": "), we demonstrate that our approach can reliably identify the direction of interactions and the associated coupling delays", "start_char_pos": 782, "end_char_pos": 782}, {"type": "R", "before": "apply our method to", "after": "study", "start_char_pos": 797, "end_char_pos": 816}, {"type": "A", "before": null, "after": "electrophysiology", "start_char_pos": 863, "end_char_pos": 863}, {"type": "R", "before": "study the causal effect networks underlying epileptic", "after": "identify the causal coupling structures underlying epileptiform", "start_char_pos": 897, "end_char_pos": 950}, {"type": "R", "before": "from simulations as well as", "after": ", both from simulations and", "start_char_pos": 973, "end_char_pos": 1000}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1017, "end_char_pos": 1017}, {"type": "R", "before": "approach to reliably", "after": "and robust approach to", "start_char_pos": 1065, "end_char_pos": 1085}], "sents_char_pos": [0, 199, 352, 529, 960]} {"doc_id": "2010.01033", "revision_depth": "1", "before_revision": "The growth of model-based control strategies for robotics platforms has led to the need for additional rigid-body-dynamics algorithms to support their operation. Toward addressing this need, this article summarizes efficient numerical methods to compute the Coriolis matrix and underlying Christoffel Symbols (of the first kind) for tree-structure rigid-body systems. The resulting algorithms can be executed purely numerically, without requiring any partial derivatives that would be required in symbolic techniques that do not scale. Properties of the presented algorithms share recursive structure in common with classical methods such as the Composite-Rigid-Body Algorithm . The algorithms presented are of the lowest possible order: O(Nd) for the Coriolis Matrix and O(Nd^2) for the Christoffel symbols, where N is the number of bodies and d is the depth of the kinematic tree. A method of order O(Nd) is also provided to compute the time derivative of the mass matrix. A numerical implementation of these algorithms in C/C++ is benchmarked showing computation times on the order of 10-20 \\mus for the computation of the Coriolis matrix and 40-120 \\mus for the computation of the Christoffel symbols for systems with 20 degrees of freedom. These results demonstrate feasibility for the adoption of these numerical methods within control loops that need to operate at 1kHz rates or higher, as is commonly required for model-based control applications.", "after_revision": "This article presents methods to efficiently compute the Coriolis matrix and underlying Christoffel symbols (of the first kind) for tree-structure rigid-body systems. The algorithms can be executed purely numerically, without requiring partial derivatives as in unscalable symbolic techniques. The computations share a recursive structure in common with classical methods such as the Composite-Rigid-Body Algorithm and are of the lowest possible order: O(Nd) for the Coriolis matrix and O(Nd^2) for the Christoffel symbols, where N is the number of bodies and d is the depth of the kinematic tree. Implementation in C/C++ shows computation times on the order of 10-20 \\mus for the Coriolis matrix and 40-120 \\mus for the Christoffel symbols on systems with 20 degrees of freedom. The results demonstrate feasibility for the adoption of these algorithms within high-rate (> 1kHz ) loops for model-based control applications.", "edit_actions": [{"type": "R", "before": "The growth of model-based control strategies for robotics platforms has led to the need for additional rigid-body-dynamics algorithms to support their operation. Toward addressing this need, this article summarizes efficient numerical methods to", "after": "This article presents methods to efficiently", "start_char_pos": 0, "end_char_pos": 245}, {"type": "R", "before": "Symbols", "after": "symbols", "start_char_pos": 301, "end_char_pos": 308}, {"type": "D", "before": "resulting", "after": null, "start_char_pos": 372, "end_char_pos": 381}, {"type": "R", "before": "any partial derivatives that would be required in symbolic techniques that do not scale. Properties of the presented algorithms share", "after": "partial derivatives as in unscalable symbolic techniques. The computations share a", "start_char_pos": 447, "end_char_pos": 580}, {"type": "R", "before": ". The algorithms presented", "after": "and", "start_char_pos": 677, "end_char_pos": 703}, {"type": "R", "before": "Matrix", "after": "matrix", "start_char_pos": 761, "end_char_pos": 767}, {"type": "R", "before": "A method of order O(Nd) is also provided to compute the time derivative of the mass matrix. A numerical implementation of these algorithms", "after": "Implementation", "start_char_pos": 883, "end_char_pos": 1021}, {"type": "R", "before": "is benchmarked showing", "after": "shows", "start_char_pos": 1031, "end_char_pos": 1053}, {"type": "D", "before": "computation of the", "after": null, "start_char_pos": 1107, "end_char_pos": 1125}, {"type": "R", "before": "computation of the Christoffel symbols for", "after": "Christoffel symbols on", "start_char_pos": 1166, "end_char_pos": 1208}, {"type": "R", "before": "These", "after": "The", "start_char_pos": 1245, "end_char_pos": 1250}, {"type": "R", "before": "numerical methods within control loops that need to operate at", "after": "algorithms within high-rate (>", "start_char_pos": 1309, "end_char_pos": 1371}, {"type": "R", "before": "rates or higher, as is commonly required", "after": ") loops", "start_char_pos": 1377, "end_char_pos": 1417}], "sents_char_pos": [0, 161, 367, 535, 678, 882, 974, 1244]} {"doc_id": "2010.02180", "revision_depth": "1", "before_revision": "The question of how to probe contextual word representations in a way that is principled and useful has seen significant recent attention . In our contribution to this discussion, we argue , first, for a probe metric that reflects the trade-off between probe complexity and performance: the Pareto hypervolume. To measure complexity, we present a number of parametric and non-parametric metrics. Our experiments with such metrics show that probe's performance curves often fail to align with widely accepted rankings between language representations (with, e .g., non-contextual representations outperforming contextual ones). These results lead us to argue, second, that commonsimplistic probe taskssuch as POS labeling and dependency arc labeling, are inadequate to evaluate the properties encoded in contextual word representations. We propose full dependency parsing as an example probe task, and demonstrate it with the Pareto hypervolume . In support of our arguments, the results of this illustrative experiment conform closer to accepted rankings among contextual word representations.", "after_revision": "The question of how to probe contextual word representations for linguistic structure in a way that is both principled and useful has seen significant attention recently in the NLP literature . In our contribution to this discussion, we argue for a probe metric that reflects the fundamental trade-off between probe complexity and performance: the Pareto hypervolume. To measure complexity, we present a number of parametric and non-parametric metrics. Our experiments using Pareto hypervolume as an evaluation metric show that probes often do not conform to our expectations---e .g., why should the non-contextual fastText representations encode more morpho-syntactic information than the contextual BERT representations? These results suggest that common, simplistic probing tasks, such as part-of-speech labeling and dependency arc labeling, are inadequate to evaluate the linguistic structure encoded in contextual word representations. This leads us to propose full dependency parsing as a probing task . In support of our suggestion that harder probing tasks are necessary, our experiments with dependency parsing reveal a wide gap in syntactic knowledge between contextual and non-contextual representations.", "edit_actions": [{"type": "A", "before": null, "after": "for linguistic structure", "start_char_pos": 61, "end_char_pos": 61}, {"type": "A", "before": null, "after": "both", "start_char_pos": 79, "end_char_pos": 79}, {"type": "R", "before": "recent attention", "after": "attention recently in the NLP literature", "start_char_pos": 123, "end_char_pos": 139}, {"type": "D", "before": ", first,", "after": null, "start_char_pos": 191, "end_char_pos": 199}, {"type": "A", "before": null, "after": "fundamental", "start_char_pos": 237, "end_char_pos": 237}, {"type": "R", "before": "with such metrics show that probe's performance curves often fail to align with widely accepted rankings between language representations (with, e", "after": "using Pareto hypervolume as an evaluation metric show that probes often do not conform to our expectations---e", "start_char_pos": 415, "end_char_pos": 561}, {"type": "A", "before": null, "after": "why should the", "start_char_pos": 567, "end_char_pos": 567}, {"type": "R", "before": "representations outperforming contextual ones). These results lead us to argue, second, that commonsimplistic probe taskssuch as POS", "after": "fastText representations encode more morpho-syntactic information than the contextual BERT representations? These results suggest that common, simplistic probing tasks, such as part-of-speech", "start_char_pos": 583, "end_char_pos": 715}, {"type": "R", "before": "properties", "after": "linguistic structure", "start_char_pos": 785, "end_char_pos": 795}, {"type": "R", "before": "We", "after": "This leads us to", "start_char_pos": 840, "end_char_pos": 842}, {"type": "R", "before": "an example probe task, and demonstrate it with the Pareto hypervolume", "after": "a probing task", "start_char_pos": 878, "end_char_pos": 947}, {"type": "R", "before": "arguments, the results of this illustrative experiment conform closer to accepted rankings among contextual word", "after": "suggestion that harder probing tasks are necessary, our experiments with dependency parsing reveal a wide gap in syntactic knowledge between contextual and non-contextual", "start_char_pos": 968, "end_char_pos": 1080}], "sents_char_pos": [0, 141, 313, 398, 630, 839, 949]} {"doc_id": "2010.03025", "revision_depth": "1", "before_revision": "This paper considers a linear Fisher market with n buyers and a continuum of items. In order to compute market equilibria, we introduce (infinite-dimensional) convex programs over Banach spaces, thereby generalizing the Eisenberg-Gale convex program and its dual . Regarding the new convex programs, we establish existence of optimal solutions, the existence of KKT-type conditions , as well as strong duality . All these properties are established via non-standard arguments, which circumvent the limitations of duality theory in optimization over infinite-dimensional vector spaces. Furthermore, we show that there exists a pure equilibrium allocation, i.e., a division of the item space. Similar to the finite-dimensional case, a market equilibrium under the infinite-dimensional Fisher market is Pareto optimal, envy-free and proportional. We also show how to obtain the (a.e. unique) equilibrium price vector and a pure equilibrium allocation from the (unique) n-dimensional equilibrium bang-per-buck vector. When the item space is the unit interval 0,1 and buyers have piecewise linear utilities , we show that \\epsilon-approximate equilibrium prices can be computed in time polynomial in the market size and \\log \\frac{1{\\epsilon}. This is achieved by solving } a finite-dimensional convex program using the ellipsoid method. To this end, we give nontrivial and efficient subgradient and separation oracles. For general buyer valuations , we propose computing market equilibrium using stochastic dual averaging, which finds an approximate equilibrium price vector with high probability .", "after_revision": "Linear Fisher markets are a fundamental economic model with applications in fair division as well as large-scale Internet markets. In the finite-dimensional case of n buyers and m items, a market equilibrium can be computed using the Eisenberg-Gale convex program. Motivated by large-scale Internet advertising and fair division applications, this paper considers a generalization of linear Fisher market where there is a finite set of buyers and a continuum of items. We introduce generalizations of the Eisenberg-Gale convex program and its dual to this infinite-dimensional setting, which leads to Banach-space optimization problems. We establish existence of optimal solutions, strong duality , as well as necessity and sufficiency of KKT-type conditions . All these properties are established via non-standard arguments, which circumvent the limitations of duality theory in optimization over infinite-dimensional Banach spaces. Furthermore, we show that there exists a pure equilibrium allocation, i.e., a division of the item space. When the item space is a closed interval and buyers have piecewise linear valuations , we show that {\\epsilon}. This is achieved by solving } the Eisenberg-Gale-type convex program over the infinite-dimensional allocations can be reformulated as a finite-dimensional convex conic program, which can be solved efficiently using off-the-shelf optimization software based on primal-dual interior-point methods. For general buyer valuations or a very large number of buyers , we propose computing market equilibrium using stochastic dual averaging, which finds an approximate equilibrium price vector with high probability . Numerical experiments illustrate the efficiency and stability of the approaches .", "edit_actions": [{"type": "R", "before": "This", "after": "Linear Fisher markets are a fundamental economic model with applications in fair division as well as large-scale Internet markets. In the finite-dimensional case of n buyers and m items, a market equilibrium can be computed using the Eisenberg-Gale convex program. Motivated by large-scale Internet advertising and fair division applications, this", "start_char_pos": 0, "end_char_pos": 4}, {"type": "A", "before": null, "after": "generalization of", "start_char_pos": 23, "end_char_pos": 23}, {"type": "R", "before": "with n", "after": "where there is a finite set of", "start_char_pos": 45, "end_char_pos": 51}, {"type": "R", "before": "In order to compute market equilibria, we introduce (infinite-dimensional) convex programs over Banach spaces, thereby generalizing", "after": "We introduce generalizations of", "start_char_pos": 85, "end_char_pos": 216}, {"type": "R", "before": ". Regarding the new convex programs, we", "after": "to this infinite-dimensional setting, which leads to Banach-space optimization problems. We", "start_char_pos": 264, "end_char_pos": 303}, {"type": "R", "before": "the existence of KKT-type conditions", "after": "strong duality", "start_char_pos": 346, "end_char_pos": 382}, {"type": "R", "before": "strong duality", "after": "necessity and sufficiency of KKT-type conditions", "start_char_pos": 396, "end_char_pos": 410}, {"type": "R", "before": "vector", "after": "Banach", "start_char_pos": 571, "end_char_pos": 577}, {"type": "D", "before": "Similar to the finite-dimensional case, a market equilibrium under the infinite-dimensional Fisher market is Pareto optimal, envy-free and proportional. We also show how to obtain the (a.e. unique) equilibrium price vector and a pure equilibrium allocation from the (unique) n-dimensional equilibrium bang-per-buck vector.", "after": null, "start_char_pos": 692, "end_char_pos": 1014}, {"type": "D", "before": "the unit interval", "after": null, "start_char_pos": 1038, "end_char_pos": 1055}, {"type": "R", "before": "0,1", "after": "a closed interval", "start_char_pos": 1056, "end_char_pos": 1059}, {"type": "R", "before": "utilities", "after": "valuations", "start_char_pos": 1093, "end_char_pos": 1102}, {"type": "D", "before": "\\epsilon-approximate equilibrium prices can be computed in time polynomial in the market size and \\log \\frac{1", "after": null, "start_char_pos": 1118, "end_char_pos": 1228}, {"type": "A", "before": null, "after": "the Eisenberg-Gale-type convex program over the infinite-dimensional allocations can be reformulated as", "start_char_pos": 1270, "end_char_pos": 1270}, {"type": "R", "before": "program using the ellipsoid method. To this end, we give nontrivial and efficient subgradient and separation oracles.", "after": "conic program, which can be solved efficiently using off-the-shelf optimization software based on primal-dual interior-point methods.", "start_char_pos": 1299, "end_char_pos": 1416}, {"type": "A", "before": null, "after": "or a very large number of buyers", "start_char_pos": 1446, "end_char_pos": 1446}, {"type": "A", "before": null, "after": ". Numerical experiments illustrate the efficiency and stability of the approaches", "start_char_pos": 1596, "end_char_pos": 1596}], "sents_char_pos": [0, 84, 412, 585, 691, 844, 1014, 1239, 1334, 1416]} {"doc_id": "2010.03110", "revision_depth": "1", "before_revision": "Humans show an innate ability to learn the regularities of the world through interaction. By performing experiments in our environment, we are able to discern the causal factors of variation and infer how they affect the dynamics of our world. Analogously, here we attempt to equip reinforcement learning agents with the ability to perform experiments that facilitate a categorization of the rolled-out trajectories, and to subsequently infer the causal factors of the environment in a hierarchical manner. We introduce {\\em a novel intrinsic reward, called causal curiosity, and show that it allows our agents to learn optimal sequences of actions , and to discover causal factors in the dynamics . The learned behavior allows the agent to infer a binary quantized representation for the ground-truth causal factors in every environment. Additionally, we find that these experimental behaviors are semantically meaningful (e.g., to differentiate between heavy and light blocks, our agents learn to lift them ), and are learnt in a self-supervised manner with approximately 2.5 times less data than conventional supervised planners. We show that these behaviors can be re-purposed and fine-tuned (e.g., from lifting to pushing or other downstream tasks). Finally, we show that the knowledge of causal factor representations aids zero-shot learning for more complex tasks .", "after_revision": "Animals exhibit an innate ability to learn regularities of the world through interaction. By performing experiments in their environment, they are able to discern the causal factors of variation and infer how they affect the world's dynamics. Inspired by this, we attempt to equip reinforcement learning agents with the ability to perform experiments that facilitate a categorization of the rolled-out trajectories, and to subsequently infer the causal factors of the environment in a hierarchical manner. We introduce {\\em causal curiosity , a novel intrinsic reward, and show that it allows our agents to learn optimal sequences of actions and discover causal factors in the dynamics of the environment . The learned behavior allows the agents to infer a binary quantized representation for the ground-truth causal factors in every environment. Additionally, we find that these experimental behaviors are semantically meaningful (e.g., our agents learn to lift blocks to categorize them by weight ), and are learnt in a self-supervised manner with approximately 2.5 times less data than conventional supervised planners. We show that these behaviors can be re-purposed and fine-tuned (e.g., from lifting to pushing or other downstream tasks). Finally, we show that the knowledge of causal factor representations aids zero-shot learning for more complex tasks . Visit URL for website .", "edit_actions": [{"type": "R", "before": "Humans show", "after": "Animals exhibit", "start_char_pos": 0, "end_char_pos": 11}, {"type": "D", "before": "the", "after": null, "start_char_pos": 39, "end_char_pos": 42}, {"type": "R", "before": "our environment, we", "after": "their environment, they", "start_char_pos": 119, "end_char_pos": 138}, {"type": "R", "before": "dynamics of our world. Analogously, here", "after": "world's dynamics. Inspired by this,", "start_char_pos": 221, "end_char_pos": 261}, {"type": "A", "before": null, "after": "causal curiosity", "start_char_pos": 525, "end_char_pos": 525}, {"type": "A", "before": null, "after": ",", "start_char_pos": 526, "end_char_pos": 526}, {"type": "D", "before": "called causal curiosity,", "after": null, "start_char_pos": 553, "end_char_pos": 577}, {"type": "R", "before": ", and to", "after": "and", "start_char_pos": 651, "end_char_pos": 659}, {"type": "A", "before": null, "after": "of the environment", "start_char_pos": 700, "end_char_pos": 700}, {"type": "R", "before": "agent", "after": "agents", "start_char_pos": 735, "end_char_pos": 740}, {"type": "D", "before": "to differentiate between heavy and light blocks,", "after": null, "start_char_pos": 933, "end_char_pos": 981}, {"type": "R", "before": "them", "after": "blocks to categorize them by weight", "start_char_pos": 1007, "end_char_pos": 1011}, {"type": "A", "before": null, "after": ". Visit URL for website", "start_char_pos": 1374, "end_char_pos": 1374}], "sents_char_pos": [0, 89, 243, 506, 702, 841, 1135, 1257]} {"doc_id": "2010.03118", "revision_depth": "1", "before_revision": "Human driving behavior modeling is of great importance for designing safe, smart, smooth as well as personalized autonomous driving systems. In this paper, an internal reward function-based driving model that emulates the human's internal decision-making mechanism is proposed. Besides, a sampling-based inverse reinforcement learning (IRL) algorithm that learns the reward function from human naturalistic driving data is also developed. A polynomial trajectory sampler is adopted to generate feasible trajectories and approximate the partition function in the maximum entropy IRL framework, and a dynamic and interactive environment is built upon the static driving dataset to estimate the generated trajectories considering the mutual dependency of agents' actions . The proposed method is applied to learn personalized reward functions for individual human drivers from the NGSIM dataset. The qualitative results demonstrate that the learned reward function is able to interpret their decisions. The quantitative results also reveal that the personalized modeling method significantly outperforms the general modeling approach, reducing the errors in human likeness by 24 \\%, and the proposed reward-function-based method delivers better results compared to other baseline methods . Moreover, it is found that estimating the response actions of surrounding vehicles plays an integral role in estimating the trajectory accurately and achieving a better generalization ability .", "after_revision": "Driving behavior modeling is of great importance for designing safe, smart, and personalized autonomous driving systems. In this paper, an internal reward function-based driving model that emulates the human's internal decision-making mechanism is utilized. To infer the reward function from naturalistic human driving data, we propose a structural assumption about human driving behavior that focuses on discrete latent driving intentions. It converts the continuous behavior modeling problem to a discrete setting and thus makes maximum entropy inverse reinforcement learning (IRL) tractable to learn reward functions. Specifically, a polynomial trajectory sampler is adopted to generate candidate trajectories considering high-level intentions and approximate the partition function in the maximum entropy IRL framework, and an environment model considering interactive behaviors among the ego and surrounding vehicles is built to better estimate the generated trajectories . The proposed method is applied to learn personalized reward functions for individual human drivers from the NGSIM highway dataset. The qualitative results demonstrate that the learned reward function is able to explicitly express the preferences of different drivers and interpret their decisions. The quantitative results reveal that the learned reward function is robust, which is manifested by only a marginal decline in proximity to the human driving trajectories when applying the reward function in the testing conditions. For the testing performance, the personalized modeling method outperforms the general modeling approach, reducing the modeling errors in human likeness (a custom metric to gauge accuracy) by 23 \\%, and these two methods deliver better results compared to other baseline methods .", "edit_actions": [{"type": "R", "before": "Human driving", "after": "Driving", "start_char_pos": 0, "end_char_pos": 13}, {"type": "R", "before": "smooth as well as", "after": "and", "start_char_pos": 82, "end_char_pos": 99}, {"type": "R", "before": "proposed. Besides, a sampling-based", "after": "utilized. To infer the reward function from naturalistic human driving data, we propose a structural assumption about human driving behavior that focuses on discrete latent driving intentions. It converts the continuous behavior modeling problem to a discrete setting and thus makes maximum entropy", "start_char_pos": 268, "end_char_pos": 303}, {"type": "R", "before": "algorithm that learns the reward function from human naturalistic driving data is also developed. A", "after": "tractable to learn reward functions. Specifically, a", "start_char_pos": 341, "end_char_pos": 440}, {"type": "R", "before": "feasible trajectories", "after": "candidate trajectories considering high-level intentions", "start_char_pos": 494, "end_char_pos": 515}, {"type": "R", "before": "a dynamic and interactive environment is built upon the static driving dataset to", "after": "an environment model considering interactive behaviors among the ego and surrounding vehicles is built to better", "start_char_pos": 597, "end_char_pos": 678}, {"type": "D", "before": "considering the mutual dependency of agents' actions", "after": null, "start_char_pos": 715, "end_char_pos": 767}, {"type": "A", "before": null, "after": "highway", "start_char_pos": 884, "end_char_pos": 884}, {"type": "A", "before": null, "after": "explicitly express the preferences of different drivers and", "start_char_pos": 974, "end_char_pos": 974}, {"type": "D", "before": "also", "after": null, "start_char_pos": 1027, "end_char_pos": 1031}, {"type": "A", "before": null, "after": "learned reward function is robust, which is manifested by only a marginal decline in proximity to the human driving trajectories when applying the reward function in the testing conditions. For the testing performance, the", "start_char_pos": 1048, "end_char_pos": 1048}, {"type": "D", "before": "significantly", "after": null, "start_char_pos": 1078, "end_char_pos": 1091}, {"type": "A", "before": null, "after": "modeling", "start_char_pos": 1148, "end_char_pos": 1148}, {"type": "R", "before": "by 24", "after": "(a custom metric to gauge accuracy) by 23", "start_char_pos": 1174, "end_char_pos": 1179}, {"type": "R", "before": "the proposed reward-function-based method delivers", "after": "these two methods deliver", "start_char_pos": 1188, "end_char_pos": 1238}, {"type": "D", "before": ". Moreover, it is found that estimating the response actions of surrounding vehicles plays an integral role in estimating the trajectory accurately and achieving a better generalization ability", "after": null, "start_char_pos": 1289, "end_char_pos": 1482}], "sents_char_pos": [0, 140, 277, 438, 769, 893, 1001, 1290]} {"doc_id": "2010.03792", "revision_depth": "3", "before_revision": "A doubly robust (DR) estimator is crucial in causal inference , which consists of two nuisance parameters : the conditional mean outcome and logging policy ( probability of choosing an action) . This paper provides a DR estimator for dependent samples obtained in adaptive experimentsand introduces two related topics. First, we propose adaptive-fitting as a variant of sample-splitting for showing an asymptotically normal semiparametric estimator from dependent samples without non-Donsker nuisance estimators . Second, we report an empirical paradox that a DR estimator shows better performances than other estimators using the true logging policy instead of its estimator . While a similar phenomenon is also known for estimators with i.i.d. samples, we hypothesize that traditional explanations based on asymptotic efficiency cannot elucidate our case with dependent samples. We confirm this hypothesis through simulation studies.", "after_revision": "The doubly robust (DR) estimator , which consists of two nuisance parameters , the conditional mean outcome and the logging policy ( the probability of choosing an action) , is crucial in causal inference . This paper proposes a DR estimator for dependent samples obtained from adaptive experiments. To obtain an asymptotically normal semiparametric estimator from dependent samples with non-Donsker nuisance estimators , we propose adaptive-fitting as a variant of sample-splitting. We also report an empirical paradox that our proposed DR estimator tends to show better performances compared to other estimators utilizing the true logging policy . While a similar phenomenon is known for estimators with i.i.d. samples, traditional explanations based on asymptotic efficiency cannot elucidate our case with dependent samples. We confirm this hypothesis through simulation studies.", "edit_actions": [{"type": "R", "before": "A", "after": "The", "start_char_pos": 0, "end_char_pos": 1}, {"type": "D", "before": "is crucial in causal inference", "after": null, "start_char_pos": 31, "end_char_pos": 61}, {"type": "R", "before": ":", "after": ",", "start_char_pos": 106, "end_char_pos": 107}, {"type": "A", "before": null, "after": "the", "start_char_pos": 141, "end_char_pos": 141}, {"type": "A", "before": null, "after": "the", "start_char_pos": 159, "end_char_pos": 159}, {"type": "A", "before": null, "after": ", is crucial in causal inference", "start_char_pos": 195, "end_char_pos": 195}, {"type": "R", "before": "provides", "after": "proposes", "start_char_pos": 209, "end_char_pos": 217}, {"type": "R", "before": "in adaptive experimentsand introduces two related topics. First, we propose adaptive-fitting as a variant of sample-splitting for showing", "after": "from adaptive experiments. To obtain", "start_char_pos": 264, "end_char_pos": 401}, {"type": "R", "before": "without", "after": "with", "start_char_pos": 475, "end_char_pos": 482}, {"type": "R", "before": ". Second, we", "after": ", we propose adaptive-fitting as a variant of sample-splitting. We also", "start_char_pos": 515, "end_char_pos": 527}, {"type": "R", "before": "a DR estimator shows better performances than other estimators using", "after": "our proposed DR estimator tends to show better performances compared to other estimators utilizing", "start_char_pos": 561, "end_char_pos": 629}, {"type": "D", "before": "instead of its estimator", "after": null, "start_char_pos": 654, "end_char_pos": 678}, {"type": "D", "before": "also", "after": null, "start_char_pos": 711, "end_char_pos": 715}, {"type": "D", "before": "we hypothesize that", "after": null, "start_char_pos": 758, "end_char_pos": 777}], "sents_char_pos": [0, 197, 321, 680, 883]} {"doc_id": "2010.04855", "revision_depth": "1", "before_revision": "We propose a novel framework for non-parametric policy evaluationin static and dynamic settings. Under the assumption of selection on observables, we consider treatment effects of the population, of sub-populations , and of alternative populations that may have alternative covariate distributions. We further consider the decomposition of a total effect into a direct effect and an indirect effect ( as mediated by a particular mechanism) . Under the assumption of sequential selection on observables, we consider the effects of sequences of treatments. Across settings, we allow for treatments that may be discrete , continuous, or even text. Across settings, we allow for estimation of not only counterfactual mean outcomes but also counterfactual distributions of outcomes. We unify analyses across settings by showing that all of these causal learning problems reduce to the re-weighting of a prediction, i.e. causal adjustment. We implement the re-weighting as an inner product in a function space called a reproducing kernel Hilbert space (RKHS), with a closed form solution that can be computed in one line of code. We prove uniform consistency and provide finite sample rates of convergence. We evaluate our estimators in simulations devised by other authors. We use our new estimators to evaluate continuousand heterogeneous treatment effects of the US Jobs Corps training program for disadvantaged youth.", "after_revision": "We propose a family of reproducing kernel ridge estimators for nonparametric and semiparametric policy evaluation. The framework includes (i) treatment effects of the population, of subpopulations , and of alternative populations ; (ii) the decomposition of a total effect into a direct effect and an indirect effect ( mediated by a particular mechanism) ; and (iii) effects of sequences of treatments. Treatment and covariates may be discrete or continuous, and low, high, or infinite dimensional. We consider estimation of means, increments, and distributions of counterfactual outcomes. Each estimator is an inner product in a reproducing kernel Hilbert space (RKHS), with a one line, closed form solution . For the nonparametric case, we prove uniform consistency and provide finite sample rates of convergence. For the semiparametric case, we prove root n consistency, Gaussian approximation, and semiparametric efficiency by finite sample arguments. We evaluate our estimators in simulations then estimate continuous, heterogeneous, incremental, and mediated treatment effects of the US Jobs Corps training program for disadvantaged youth.", "edit_actions": [{"type": "R", "before": "novel framework for non-parametric policy evaluationin static and dynamic settings. Under the assumption of selection on observables, we consider", "after": "family of reproducing kernel ridge estimators for nonparametric and semiparametric policy evaluation. The framework includes (i)", "start_char_pos": 13, "end_char_pos": 158}, {"type": "R", "before": "sub-populations", "after": "subpopulations", "start_char_pos": 199, "end_char_pos": 214}, {"type": "R", "before": "that may have alternative covariate distributions. We further consider", "after": "; (ii)", "start_char_pos": 248, "end_char_pos": 318}, {"type": "D", "before": "as", "after": null, "start_char_pos": 401, "end_char_pos": 403}, {"type": "R", "before": ". Under the assumption of sequential selection on observables, we consider the", "after": "; and (iii)", "start_char_pos": 440, "end_char_pos": 518}, {"type": "R", "before": "Across settings, we allow for treatments that", "after": "Treatment and covariates", "start_char_pos": 555, "end_char_pos": 600}, {"type": "R", "before": ", continuous, or even text. Across settings, we allow for estimation of not only counterfactual mean outcomes but also counterfactual distributions of outcomes. We unify analyses across settings by showing that all of these causal learning problems reduce to the re-weighting of a prediction, i.e. causal adjustment. We implement the re-weighting as", "after": "or continuous, and low, high, or infinite dimensional. We consider estimation of means, increments, and distributions of counterfactual outcomes. Each estimator is", "start_char_pos": 617, "end_char_pos": 966}, {"type": "D", "before": "function space called a", "after": null, "start_char_pos": 989, "end_char_pos": 1012}, {"type": "A", "before": null, "after": "one line,", "start_char_pos": 1061, "end_char_pos": 1061}, {"type": "R", "before": "that can be computed in one line of code. We", "after": ". For the nonparametric case, we", "start_char_pos": 1083, "end_char_pos": 1127}, {"type": "A", "before": null, "after": "For the semiparametric case, we prove root n consistency, Gaussian approximation, and semiparametric efficiency by finite sample arguments.", "start_char_pos": 1202, "end_char_pos": 1202}, {"type": "R", "before": "devised by other authors. We use our new estimators to evaluate continuousand heterogeneous", "after": "then estimate continuous, heterogeneous, incremental, and mediated", "start_char_pos": 1245, "end_char_pos": 1336}], "sents_char_pos": [0, 96, 298, 441, 554, 644, 777, 933, 1124, 1201, 1270]} {"doc_id": "2010.05310", "revision_depth": "1", "before_revision": "We study the chase-escape percolation model on the 2D square lattice . In this model, prey particles spread to neighboring empty sites at rate p, and predator particles spread only to neighboring sites occupied by prey particles at rate 1, killing the prey particle present at that site. It is found that prey can survive for p>p_c with p_c<1. We estimate the value of p_c to be 0.4943 \\pm 0.0005 and the critical exponent for the divergence of the correlation length \\nu to be consistent with the 2D isotropic percolation value 4/3. We further show Chase-Escape percolation cannot fully be in the 2D isotropic percolationuniversality class as for p < p_c on a D-dimensional hypercubical lattice, the probability that the number of predators in the absorbing configuration is greater than s is bounded from below by \\exp(-Kp^{-1 in contrast to the exponentially decaying cluster size distribution of isotropic percolation . We then study the problem starting from an initial condition with predator particles on all lattice points of the line y=0 and prey particles on the line y=1. In this case, for p_c
p_c with p_c<1. Using Monte Carlo simulations on the square lattice, we estimate the value of p_c = 0.49451 \\pm 0.00001, and the critical exponents are consistent with the undirected percolation universality class. We define a discrete-time parallel-update version of the model, which brings out the relation between chase-escape and undirected bond percolation. For all p < p_c in D-dimensions, the number of predators in the absorbing configuration has a stretched-exponential distribution in contrast to the exponential distribution in the standard percolation theory. We also study the problem starting from the line initial condition with predator particles on all lattice points of the line y=0 and prey particles on the line y=1. In this case, for p_c
1.", "edit_actions": [{"type": "R", "before": "Harish-Chandra--Itzykson--Zuber", "after": "Harish-Chandra-Itzykson-Zuber", "start_char_pos": 59, "end_char_pos": 90}, {"type": "R", "before": "density", "after": "distribution", "start_char_pos": 98, "end_char_pos": 105}, {"type": "R", "before": "\\mathrm{U", "after": "\\text{U", "start_char_pos": 127, "end_char_pos": 136}, {"type": "R", "before": "\\mathrm{Tr", "after": "\\text{tr", "start_char_pos": 148, "end_char_pos": 158}, {"type": "A", "before": null, "after": ",", "start_char_pos": 183, "end_char_pos": 183}, {"type": "R", "before": "\\mathrm{U", "after": "\\text{U", "start_char_pos": 217, "end_char_pos": 226}, {"type": "A", "before": null, "after": "The density e^{\\text{tr", "start_char_pos": 232, "end_char_pos": 232}, {"type": "R", "before": "how to sample efficiently", "after": "efficient sampling", "start_char_pos": 449, "end_char_pos": 474}, {"type": "R", "before": "density", "after": "distribution", "start_char_pos": 489, "end_char_pos": 496}, {"type": "R", "before": "The main contribution of this paper is an algorithm to sample a matrix from a distribution that is \\varepsilon-close to the given HCIZ density and whose running time depends polylogarithmically", "after": "We present two efficient algorithms to sample matrices from distributions that are close to the HCIZ distribution. The first algorithm outputs samples that are \\xi-close in total variation distance and requires polynomially many arithmetic operations in \\log 1/\\xi and the number of bits needed to encode Y and \\Lambda. The second algorithm comes with a stronger guarantee that the samples are \\xi-close in infinity divergence, but the number of arithmetic operations depends polynomially", "start_char_pos": 516, "end_char_pos": 709}, {"type": "R", "before": "\\varepsilon. Interestingly,", "after": "\\xi, the number of bits needed to encode Y and \\Lambda, and the differences of the largest and the smallest eigenvalues of Y and \\Lambda.", "start_char_pos": 716, "end_char_pos": 743}, {"type": "R", "before": "\\mathrm{U", "after": "\\text{U", "start_char_pos": 806, "end_char_pos": 815}, {"type": "R", "before": "in this setting, they have been widely studied . Thus, our result has several direct applications, including polynomial-time algorithms", "after": "these densities have been studied in statistics, machine learning, and theoretical computer science. Thus our results have the following applications:", "start_char_pos": 832, "end_char_pos": 967}, {"type": "A", "before": null, "after": "an efficient algorithm", "start_char_pos": 971, "end_char_pos": 971}, {"type": "A", "before": null, "after": "complex versions of", "start_char_pos": 987, "end_char_pos": 987}, {"type": "A", "before": null, "after": "an efficient algorithm", "start_char_pos": 1044, "end_char_pos": 1044}, {"type": "R", "before": "maximum entropy distributions with applications to quantum inference", "after": "max-entropy distributions on unitary orbits, which implies an efficient algorithm to sample a pure quantum state from the entropy-maximizing ensemble representing a given density matrix", "start_char_pos": 1071, "end_char_pos": 1139}, {"type": "A", "before": null, "after": "an efficient algorithm", "start_char_pos": 1149, "end_char_pos": 1149}, {"type": "D", "before": "low-rank approximation. The key obstacle in sampling from an HCIZ density is that the domain is an algebraic manifold and the entries of the sample matrix are highly correlated. To overcome this, we consider a mapping that sends each Hermitian matrix X to a natural ordering of the eigenvalues of all leading principal minors of X. The image of each \\mathrm{U", "after": null, "start_char_pos": 1177, "end_char_pos": 1536}, {"type": "A", "before": null, "after": "rank-k approximation, with improved utility bounds for k>1.", "start_char_pos": 1946, "end_char_pos": 1946}], "sents_char_pos": [0, 278, 417, 515, 728, 880, 1200, 1354, 1508, 1653, 1809]} {"doc_id": "2011.05755", "revision_depth": "1", "before_revision": "With the enhancement of algorithms, cryo-EM has become the most efficient technique to solve structures of molecules . Take a recent event for example, after the outbreak of COVID-19 in January, the first structure of 2019-nCoV Spike trimer was published in Marchusing cryo-EM, which has provided crucial medical insight for developing vaccines. The enabler behind this efficiency is the GPU-accelerated computation which shortens the whole analysis process to 12 days. However, the data characteristics include strong noise, huge dimension, large sample size and high heterogeneity with unknown orientations have made analysis very challenging. Though, the popular GPU-accelerated Bayesian approach has been shown to be successful in 3D refinement. It is noted that the traditional method based on multireference alignment may better differentiate subtle structure differences under low signal to noise ratio (SNR). However, a modular GPU-acceleration package for multireference alignment is still lacking in the field. In this work, a modular GPU-accelerated alignment library called Cryo-RALib is proposed. The library contains both reference-free alignment and multireference alignment that can be widely used to accelerate state-of-the-art classification algorithms. In addition, we connect the cryo-EM image analysis with the python data science stack which enables users to perform data analysis , visualization and inference more easily. Benchmark on the TaiWan Computing Cloud container, our implementation can accelerate the computation by one order of magnitude. The library has been made publicly available at URL", "after_revision": "Thanks to automated cryo-EM and GPU-accelerated processing, single-particle cryo-EM has become a rapid structure determination method that permits capture of dynamical structures of molecules in solution, which has been recently demonstrated by the determination of COVID-19 spike protein in March, shortly after its breakout in late January 2020. This rapidity is critical for vaccine development in response to emerging pandemic. This explains why a 2D classification approach based on multi-reference alignment (MRA) is not as popular as the Bayesian-based approach despite that the former has advantage in differentiating subtle structural variations under low signal-to-noise ratio (SNR). This is perhaps because that MRA is a time-consuming process and a modular GPU-acceleration package for MRA is still lacking . Here, we introduced a library called Cryo-RALib that contains GPU-accelerated modular routines for accelerating MRA-based classification algorithms. In addition, we connect the cryo-EM image analysis with the python data science stack so as to make it easier for users to perform data analysis and visualization. Benchmarking on the TaiWan Computing Cloud (TWCC) container shows that our implementation can accelerate the computation by one order of magnitude. The library has been made publicly available at URL", "edit_actions": [{"type": "R", "before": "With the enhancement of algorithms,", "after": "Thanks to automated", "start_char_pos": 0, "end_char_pos": 35}, {"type": "A", "before": null, "after": "and GPU-accelerated processing, single-particle cryo-EM", "start_char_pos": 44, "end_char_pos": 44}, {"type": "R", "before": "the most efficient technique to solve", "after": "a rapid structure determination method that permits capture of dynamical", "start_char_pos": 56, "end_char_pos": 93}, {"type": "R", "before": ". Take a recent event for example, after the outbreak", "after": "in solution, which has been recently demonstrated by the determination", "start_char_pos": 118, "end_char_pos": 171}, {"type": "R", "before": "in January, the first structure of 2019-nCoV Spike trimer was published in Marchusing cryo-EM, which has provided crucial medical insight for developing vaccines. The enabler behind this efficiency is the GPU-accelerated computation which shortens the whole analysis process to 12 days. However, the data characteristics include strong noise, huge dimension, large sample size and high heterogeneity with unknown orientations have made analysis very challenging. Though, the popular GPU-accelerated Bayesian approach has been shown to be successful in 3D refinement. It is noted that the traditional method based on multireference alignment may better differentiate subtle structure differences under low signal to noise", "after": "spike protein in March, shortly after its breakout in late January 2020. This rapidity is critical for vaccine development in response to emerging pandemic. This explains why a 2D classification approach based on multi-reference alignment (MRA) is not as popular as the Bayesian-based approach despite that the former has advantage in differentiating subtle structural variations under low signal-to-noise", "start_char_pos": 184, "end_char_pos": 904}, {"type": "R", "before": "However, a", "after": "This is perhaps because that MRA is a time-consuming process and a", "start_char_pos": 918, "end_char_pos": 928}, {"type": "R", "before": "multireference alignment", "after": "MRA", "start_char_pos": 966, "end_char_pos": 990}, {"type": "R", "before": "in the field. In this work, a modular GPU-accelerated alignment", "after": ". Here, we introduced a", "start_char_pos": 1008, "end_char_pos": 1071}, {"type": "R", "before": "is proposed. The library contains both reference-free alignment and multireference alignment that can be widely used to accelerate state-of-the-art", "after": "that contains GPU-accelerated modular routines for accelerating MRA-based", "start_char_pos": 1098, "end_char_pos": 1245}, {"type": "R", "before": "which enables", "after": "so as to make it easier for", "start_char_pos": 1359, "end_char_pos": 1372}, {"type": "R", "before": ", visualization and inference more easily. Benchmark", "after": "and visualization. Benchmarking", "start_char_pos": 1404, "end_char_pos": 1456}, {"type": "R", "before": "container,", "after": "(TWCC) container shows that", "start_char_pos": 1487, "end_char_pos": 1497}], "sents_char_pos": [0, 119, 346, 470, 646, 750, 917, 1021, 1110, 1272, 1446, 1574]} {"doc_id": "2011.06748", "revision_depth": "1", "before_revision": "Control Barrier Functions (CBF) are widely used to enforce the safety-critical constraints on nonlinear systems. Recently, these functions are being incorporated into a path planning framework to design a safety-critical path planner . However, these methods fall short of providing a realistic path considering both run-time complexity and safety-critical constraints. This paper proposes a novel motion planning approach using Rapidly exploring Random Trees (RRT) algorithm to enforce the robust CBF and kinodynamic constraints to generate a safety-critical path that is free of any obstacles while taking into account the model uncertainty from robot dynamics as well as perception. Result analysis indicates that the proposed method outperforms various conventional RRT based path planners, guaranteeing a safety-critical path with reduced computational overhead. We present numerical validation of the algorithm on the Hamster V7 robot car, a micro autonomous Unmanned Ground Vehicle , where it performs dynamic navigation on an obstacle-ridden path with various uncertainties in perception noises , and robot dynamics.", "after_revision": "Control Barrier Functions (CBF) are widely used to enforce the safety-critical constraints on nonlinear systems. Recently, these functions are being incorporated into a path planning framework to design safety-critical path planners . However, these methods fall short of providing a realistic path considering both the algorithm's run-time complexity and enforcement of the safety-critical constraints. This paper proposes a novel motion planning approach using the well-known Rapidly Exploring Random Trees (RRT) algorithm that enforces both CBF and the robot Kinodynamic constraints to generate a safety-critical path . The proposed algorithm also outputs the corresponding control signals that resulted in the obstacle-free path. The approach also allows considering model uncertainties by incorporating the robust CBF constraints into the proposed framework. Thus, the resulting path is free of any obstacles and accounts for the model uncertainty from robot dynamics and perception. Result analysis indicates that the proposed method outperforms various conventional RRT-based path planners, guaranteeing a safety-critical path with minimal computational overhead. We present numerical validation of the algorithm on the Hamster V7 robot car, a micro autonomous Unmanned Ground Vehicle that performs dynamic navigation on an obstacle-ridden path with various uncertainties in perception noises and robot dynamics.", "edit_actions": [{"type": "D", "before": "a", "after": null, "start_char_pos": 203, "end_char_pos": 204}, {"type": "R", "before": "planner", "after": "planners", "start_char_pos": 226, "end_char_pos": 233}, {"type": "A", "before": null, "after": "the algorithm's", "start_char_pos": 317, "end_char_pos": 317}, {"type": "A", "before": null, "after": "enforcement of the", "start_char_pos": 342, "end_char_pos": 342}, {"type": "R", "before": "Rapidly exploring", "after": "the well-known Rapidly Exploring", "start_char_pos": 431, "end_char_pos": 448}, {"type": "R", "before": "to enforce the robust CBF and kinodynamic", "after": "that enforces both CBF and the robot Kinodynamic", "start_char_pos": 478, "end_char_pos": 519}, {"type": "R", "before": "that", "after": ". The proposed algorithm also outputs the corresponding control signals that resulted in the obstacle-free path. The approach also allows considering model uncertainties by incorporating the robust CBF constraints into the proposed framework. Thus, the resulting path", "start_char_pos": 567, "end_char_pos": 571}, {"type": "R", "before": "while taking into account", "after": "and accounts for", "start_char_pos": 597, "end_char_pos": 622}, {"type": "R", "before": "as well as", "after": "and", "start_char_pos": 665, "end_char_pos": 675}, {"type": "R", "before": "RRT based", "after": "RRT-based", "start_char_pos": 772, "end_char_pos": 781}, {"type": "R", "before": "reduced", "after": "minimal", "start_char_pos": 838, "end_char_pos": 845}, {"type": "R", "before": ", where it", "after": "that", "start_char_pos": 991, "end_char_pos": 1001}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1105, "end_char_pos": 1106}], "sents_char_pos": [0, 112, 235, 371, 687, 869]} {"doc_id": "2011.07403", "revision_depth": "1", "before_revision": "Many language pairs are low resource - the amount and/or quality of parallel data is not sufficient to train a neural machine translation (NMT) model which can reach an acceptable standard of accuracy. Many works have explored the use of the easier-to-get monolingual data to improve the performance of translation models in this category of languages - and even high resource languages. The most successful of such works is the back-translation - using the translations of the target language monolingual data to increase the amount of the training data. The quality of the backward model - trained on the available parallel data - has been shown to determine the performance of the back-translation approach. Many approaches have been explored to improve the performance of thismodel especially in low resource languages where the amount of parallel data is not sufficient to train an acceptable backward model . Among such works are the use of self-learning and the iterative back-translation. These methods were shown to perform better than the standard back-translation. This work presents the iterative self-training approach as an improvement over the self-learning approach to further enhance the performance of the backward model. Over several iterations, the synthetic datagenerated by the backward model is used to improve its performance through forward translation. Experiments have shown that the method outperforms both the standard back-translation and self-learning approach on IWSLT'14 English German low resource NMT. While the method also outperforms the iterative back-translation , though slightly, the number of models required to be trained is reduced exactly by the number of iterations .", "after_revision": "Many language pairs are low resource , meaning the amount and/or quality of available parallel data is not sufficient to train a neural machine translation (NMT) model which can reach an acceptable standard of accuracy. Many works have explored using the readily available monolingual data in either or both of the languages to improve the standard of translation models in low, and even high , resource languages. One of the most successful of such works is the back-translation that utilizes the translations of the target language monolingual data to increase the amount of the training data. The quality of the backward model which is trained on the available parallel data has been shown to determine the performance of the back-translation approach. Despite this, only the forward model is improved on the monolingual target data in standard back-translation. A previous study proposed an iterative back-translation approach for improving both models over several iterations. But unlike in the traditional back-translation, it relied on both the target and source monolingual data. This work, therefore, proposes a novel approach that enables both the backward and forward models to benefit from the monolingual target data through a hybrid of self-learning and back-translation respectively. Experimental results have shown the superiority of the proposed approach over the traditional back-translation method on English-German low resource neural machine translation. We also proposed an iterative self-learning approach that outperforms the iterative back-translation while also relying only on the monolingual target data and require the training of less models .", "edit_actions": [{"type": "R", "before": "-", "after": ", meaning", "start_char_pos": 37, "end_char_pos": 38}, {"type": "A", "before": null, "after": "available", "start_char_pos": 68, "end_char_pos": 68}, {"type": "R", "before": "the use of the easier-to-get monolingual data", "after": "using the readily available monolingual data in either or both of the languages", "start_char_pos": 228, "end_char_pos": 273}, {"type": "R", "before": "performance", "after": "standard", "start_char_pos": 289, "end_char_pos": 300}, {"type": "R", "before": "this category of languages -", "after": "low,", "start_char_pos": 326, "end_char_pos": 354}, {"type": "A", "before": null, "after": ",", "start_char_pos": 369, "end_char_pos": 369}, {"type": "R", "before": "The", "after": "One of the", "start_char_pos": 390, "end_char_pos": 393}, {"type": "R", "before": "- using", "after": "that utilizes", "start_char_pos": 448, "end_char_pos": 455}, {"type": "R", "before": "-", "after": "which is", "start_char_pos": 592, "end_char_pos": 593}, {"type": "D", "before": "-", "after": null, "start_char_pos": 633, "end_char_pos": 634}, {"type": "R", "before": "Many approaches have been explored to improve the performance of thismodel especially in low resource languages where the amount of parallel data is not sufficient to train an acceptable backward model . Among such works are the use of self-learning and the iterative back-translation. These methods were shown to perform better than the", "after": "Despite this, only the forward model is improved on the monolingual target data in", "start_char_pos": 713, "end_char_pos": 1050}, {"type": "R", "before": "This work presents the iterative self-training approach as an improvement over the", "after": "A previous study proposed an iterative back-translation approach for improving both models over several iterations. But unlike in the traditional back-translation, it relied on both the target and source monolingual data. This work, therefore, proposes a novel approach that enables both the backward and forward models to benefit from the monolingual target data through a hybrid of", "start_char_pos": 1078, "end_char_pos": 1160}, {"type": "R", "before": "approach to further enhance the performance of the backward model. Over several iterations,", "after": "and back-translation respectively. Experimental results have shown", "start_char_pos": 1175, "end_char_pos": 1266}, {"type": "R", "before": "synthetic datagenerated by the backward model is used to improve its performance through forward translation. Experiments have shown that the method outperforms both the standard", "after": "superiority of the proposed approach over the traditional", "start_char_pos": 1271, "end_char_pos": 1449}, {"type": "R", "before": "and self-learning approach on IWSLT'14 English German low resource NMT. While the method also", "after": "method on English-German low resource neural machine translation. We also proposed an iterative self-learning approach that", "start_char_pos": 1467, "end_char_pos": 1560}, {"type": "R", "before": ", though slightly, the number of models required to be trained is reduced exactly by the number of iterations", "after": "while also relying only on the monolingual target data and require the training of less models", "start_char_pos": 1604, "end_char_pos": 1713}], "sents_char_pos": [0, 202, 389, 557, 712, 998, 1077, 1241, 1380]} {"doc_id": "2011.07494", "revision_depth": "2", "before_revision": "The SIR(D) epidemiological model is defined through transcendental equations not solvable by elementary functions. In the present paper , those equations are successfully replaced by approximate ones, whose solutions are given explicitly in terms of elementary functions, namely , piece-wisely, generalized logistic functions: they {\\em unveil a useful feature, that in fact is also owned by the (numerical) solutions of the exact equations {\\em {\\em .", "after_revision": "The SIR(D) epidemiological model is defined through a system of transcendental equations, not solvable by elementary functions. In the present paper those equations are successfully replaced by approximate ones, whose solutions are given explicitly in terms of elementary functions, originating , piece-wisely, from generalized logistic functions: they ensure{\\em exact (in the numerical sense) asymptotic values, besides to be quite practical to use, for example with fit to data algorithms; moreover they unveil a useful feature, that in fact , at least with very strict approximation, is also owned by the (numerical) solutions of the {\\em exact equations. The novelties in the work are: the way the approximate equations are obtained, using simple, analytic geometry considerations; the easy and practical formulation of the final approximate solutions; the mentioned useful feature, never disclosed before. The work's method and result prove to be robust over a range of values of the well known non-dimensional parameter called{\\em basic reproduction ratio , that covers at least all the known epidemic cases, from influenza to measles: this is a point which doesn't appear much discussed in analogous works .", "edit_actions": [{"type": "R", "before": "transcendental equations", "after": "a system of transcendental equations,", "start_char_pos": 52, "end_char_pos": 76}, {"type": "D", "before": ",", "after": null, "start_char_pos": 136, "end_char_pos": 137}, {"type": "R", "before": "namely", "after": "originating", "start_char_pos": 272, "end_char_pos": 278}, {"type": "A", "before": null, "after": "from", "start_char_pos": 295, "end_char_pos": 295}, {"type": "A", "before": null, "after": "ensure", "start_char_pos": 333, "end_char_pos": 333}, {"type": "A", "before": null, "after": "exact", "start_char_pos": 338, "end_char_pos": 338}, {"type": "A", "before": null, "after": "(in the numerical sense) asymptotic values, besides to be quite practical to use, for example with fit to data algorithms; moreover they", "start_char_pos": 339, "end_char_pos": 339}, {"type": "A", "before": null, "after": ", at least with very strict approximation,", "start_char_pos": 378, "end_char_pos": 378}, {"type": "D", "before": "exact equations", "after": null, "start_char_pos": 429, "end_char_pos": 444}, {"type": "A", "before": null, "after": "exact", "start_char_pos": 450, "end_char_pos": 450}, {"type": "A", "before": null, "after": "equations. The novelties in the work are: the way the approximate equations are obtained, using simple, analytic geometry considerations; the easy and practical formulation of the final approximate solutions; the mentioned useful feature, never disclosed before. The work's method and result prove to be robust over a range of values of the well known non-dimensional parameter called", "start_char_pos": 451, "end_char_pos": 451}, {"type": "A", "before": null, "after": "basic reproduction ratio", "start_char_pos": 456, "end_char_pos": 456}, {"type": "A", "before": null, "after": ", that covers at least all the known epidemic cases, from influenza to measles: this is a point which doesn't appear much discussed in analogous works", "start_char_pos": 457, "end_char_pos": 457}], "sents_char_pos": [0, 114]} {"doc_id": "2011.09137", "revision_depth": "1", "before_revision": "The credit rating is an evaluation of the credit risk of a company that values the ability to pay back the debt and predict the likelihood of the debtor defaulting. There are various features influencing credit rating. Therefore it is very important to select substantive features to explore the main reason for credit rating change. To address this issue, this paper exploits Principal Component Analysis and Factor Analysis as feature selection algorithms to select important features, summarise the similar features together and obtain a minimum set of features for four sectors, Financial Sector, Energy Sector, Health Care Sector, Consumer Discretionary Sector. This paper uses two data sets, Financial Ratio and Balance Sheet, with two mappings, Detailed Mapping and Coarse Mapping, converting the target variable(credit rating) into categorical variable. To test the accuracy of credit rating prediction, Random Forest Classifier is used to test and train feature sets. The results show that the accuracy of Financial Ratio feature sets are higher than that of Balance Sheet feature sets. What is more , Factor Analysis can reduce significantly the number of features to obtain almost the same accuracy that can decrease dramatically the time spent on analyzing data .In addition, we summarise seven dominant factors and ten dominant factors having effect on credit rating change in Financial Ratio and Balance Sheet respectively by utilizing Factor Analysis which can explain the reason of credit rating change better.", "after_revision": "The credit rating is an evaluation of a company's credit risk that values the ability to pay back the debt and predict the likelihood of the debtor defaulting. There are various features influencing credit rating. Therefore , it is essential to select substantive features to explore the main reason for credit rating change. To address this issue, this paper exploited Principal Component Analysis and Factor Analysis as feature selection algorithms to select important features, summarized the similar features together , and obtained a minimum set of features for four sectors, Financial Sector, Energy Sector, Health Care Sector, Consumer Discretionary Sector. This paper used two data sets, Financial Ratio and Balance Sheet, with two mappings, Detailed Mapping , and Coarse Mapping, converting the target variable(credit rating) into categorical variable. To test the accuracy of credit rating prediction, Random Forest Classifier was used to test and train feature sets. The results showed that the accuracy of Financial Ratio feature sets was higher than that of Balance Sheet feature sets. In addition , Factor Analysis can reduce the number of features significantly to obtain almost the same accuracy that can decrease dramatically the time spent on analyzing data ; we also summarized seven dominant factors and ten dominant factors affecting credit rating change in Financial Ratio and Balance Sheet by utilizing Factor Analysis , respectively, which can explain the reason of credit rating change better.", "edit_actions": [{"type": "R", "before": "the credit risk of a company", "after": "a company's credit risk", "start_char_pos": 38, "end_char_pos": 66}, {"type": "R", "before": "it is very important", "after": ", it is essential", "start_char_pos": 229, "end_char_pos": 249}, {"type": "R", "before": "exploits", "after": "exploited", "start_char_pos": 368, "end_char_pos": 376}, {"type": "R", "before": "summarise", "after": "summarized", "start_char_pos": 488, "end_char_pos": 497}, {"type": "R", "before": "and obtain", "after": ", and obtained", "start_char_pos": 528, "end_char_pos": 538}, {"type": "R", "before": "uses", "after": "used", "start_char_pos": 678, "end_char_pos": 682}, {"type": "A", "before": null, "after": ",", "start_char_pos": 769, "end_char_pos": 769}, {"type": "R", "before": "is", "after": "was", "start_char_pos": 938, "end_char_pos": 940}, {"type": "R", "before": "show", "after": "showed", "start_char_pos": 990, "end_char_pos": 994}, {"type": "R", "before": "are", "after": "was", "start_char_pos": 1045, "end_char_pos": 1048}, {"type": "R", "before": "What is more", "after": "In addition", "start_char_pos": 1097, "end_char_pos": 1109}, {"type": "D", "before": "significantly", "after": null, "start_char_pos": 1139, "end_char_pos": 1152}, {"type": "A", "before": null, "after": "significantly", "start_char_pos": 1176, "end_char_pos": 1176}, {"type": "R", "before": ".In addition, we summarise", "after": "; we also summarized", "start_char_pos": 1276, "end_char_pos": 1302}, {"type": "R", "before": "having effect on", "after": "affecting", "start_char_pos": 1351, "end_char_pos": 1367}, {"type": "D", "before": "respectively", "after": null, "start_char_pos": 1426, "end_char_pos": 1438}, {"type": "A", "before": null, "after": ", respectively,", "start_char_pos": 1468, "end_char_pos": 1468}], "sents_char_pos": [0, 164, 218, 333, 666, 862, 977, 1096, 1277]} {"doc_id": "2011.09756", "revision_depth": "1", "before_revision": "This paper presents how the hybrid combination of behavior trees and the neuroscientific principle of active inference can be used for action planning and execution for reactive robot behaviors in dynamic environments. We show how complex robotic tasks can be formulated as a free-energy minimisation problem, and how state estimation and symbolic decision making are handled within the same framework. The general behavior is specified offline through behavior trees, where the leaf nodes represent desired states, not actions as in classical behavior trees . The decision of which action to execute to reach a state is left to the online active inference routine, in order to resolve unexpected contingencies. This hybrid combination improves the robustness of plans specified through behavior trees, while allowing to cope with the curse of dimensionality in active inference . The properties of the proposed algorithmare analysed in terms of robustness and convergence , and the theoretical results are validated using a mobile manipulator in a retail environment.", "after_revision": "We propose a hybrid combination of active inference and behavior trees (BTs) for reactive action planning and execution in dynamic environments. We show how robotic tasks can be formulated as a free-energy minimization problem, bringing the neuroscientific theory of active inference on a mobile manipulator. In this framework, the general nominal behavior is specified offline through BTs. A new type of leaf node, theprior node, is introduced to specify the desired state to be achieved rather than an action to be executed as in classical BTs . The decision of which action to execute to reach the desired state is performed online through active inference. The resulting hybrid combination improves the robustness of plans against unexpected contingencies while considerably reducing the number of nodes in a BT . The properties of our algorithm, such as the convergence and robustness, are thoroughly analyzed and outperform classical BT solutions. The theoretical results are validated using a mobile manipulator in a retail environment.", "edit_actions": [{"type": "R", "before": "This paper presents how the", "after": "We propose a", "start_char_pos": 0, "end_char_pos": 27}, {"type": "R", "before": "behavior trees and the neuroscientific principle of active inference can be used for", "after": "active inference and behavior trees (BTs) for reactive", "start_char_pos": 50, "end_char_pos": 134}, {"type": "D", "before": "for reactive robot behaviors", "after": null, "start_char_pos": 165, "end_char_pos": 193}, {"type": "D", "before": "complex", "after": null, "start_char_pos": 231, "end_char_pos": 238}, {"type": "R", "before": "minimisation problem, and how state estimation and symbolic decision making are handled within the same framework. The general", "after": "minimization problem, bringing the neuroscientific theory of active inference on a mobile manipulator. In this framework, the general nominal", "start_char_pos": 288, "end_char_pos": 414}, {"type": "R", "before": "behavior trees, where the leaf nodes represent desired states, not actions", "after": "BTs. A new type of leaf node, the", "start_char_pos": 453, "end_char_pos": 527}, {"type": "A", "before": null, "after": "prior", "start_char_pos": 527, "end_char_pos": 527}, {"type": "A", "before": null, "after": "node, is introduced to specify the desired state to be achieved rather than an action to be executed", "start_char_pos": 528, "end_char_pos": 528}, {"type": "R", "before": "behavior trees", "after": "BTs", "start_char_pos": 545, "end_char_pos": 559}, {"type": "R", "before": "a state is left to the online active inference routine, in order to resolve unexpected contingencies. This", "after": "the desired state is performed online through active inference. The resulting", "start_char_pos": 611, "end_char_pos": 717}, {"type": "R", "before": "specified through behavior trees, while allowing to cope with the curse of dimensionality in active inference", "after": "against unexpected contingencies while considerably reducing the number of nodes in a BT", "start_char_pos": 770, "end_char_pos": 879}, {"type": "R", "before": "the proposed algorithmare analysed in terms of robustness and convergence , and the", "after": "our algorithm, such as the convergence and robustness, are thoroughly analyzed and outperform classical BT solutions. The", "start_char_pos": 900, "end_char_pos": 983}], "sents_char_pos": [0, 218, 402, 561, 712, 881]} {"doc_id": "2011.10126", "revision_depth": "1", "before_revision": "The spread of African swine fever (ASF) poses a grave threat to the global swine industry. Understanding transmission dynamics, such as through mechanistic modeling, is critical for designing effective control strategies. Articles were examined across multiple epidemiological and model characteristics. Model filiation was determined through creation of a neighbor-joined tree using phylogenetic software. Of 24 articles qualifying for inclusion, four main objectives were identified: estimating transmission parameters ( 9 studies), assessing determinants of transmission ( 4 ), examining consequences of hypothetical outbreaks ( 3 ), and assessing alternative control strategies ( 8). Population-based ( 11) , metapopulation (5), and individual-based (8) model frameworks were represented. The majority of models (18) were parameterized to the genotype II isolates currently circulating in Europe and Asia. Estimated transmission parameters varied widely as did parameter assumptions between models. Uncertainties on epidemiological and ecological parameters were usually accounted for to assess the impact on the modeled infection trajectory. Almost half of the studies stem from one of two models . We call for a diversification of modeling approaches through developing additional frameworks. All models but one are host specific to either domestic pigs or wild boar , despite the fact that spillover events between the domestic and wild compartments can play an important role in outbreaks. The development of models incorporating this transmission is crucial. All compared control strategies were defined a priori, and future models should be built to identify optimal contributions across many control methods. Further, control strategies were examined in competition, opposed to how they would be synergistically implemented. For ASF models to effectively support decision-making , these limitations need to be addressed.", "after_revision": "The spread of African swine fever (ASF) poses a grave threat to the global swine industry. Understanding transmission dynamics, such as through mechanistic modeling, is critical for designing effective control strategies. Articles were examined across multiple epidemiological and model characteristics. Model filiation was determined through creation of a neighbor-joined tree using phylogenetic software. Of 34 four articles qualifying for inclusion, four main modelling objectives were identified: estimating transmission parameters ( 11 studies), assessing determinants of transmission ( 7 ), examining consequences of hypothetical outbreaks ( 5 ), and assessing alternative control strategies ( 11) . Estimated transmission parameters varied widely as did parameter assumptions between models. Uncertainties on epidemiological and ecological parameters were usually accounted for to assess the impact on the modeled infection trajectory. Almost all models are host specific , being developed for either domestic pigs or wild boar despite the fact that spillover events between domestic pigs and wild boar are evidenced to play an important role in ASF outbreaks. The development of models incorporating such transmission routes is crucial. All compared control strategies were defined a priori, and future models should be built to identify optimal contributions across many control methods. Further, control strategies were examined in competition, opposed to how they would be synergistically implemented. While comparing strategies is beneficial for identifying a rank-order efficacy of control methods, this structure does not necessarily determine the most effective combination of all available strategies. In order for ASFV models to effectively support decision-making in controlling ASFV globally, these modelling limitations need to be addressed.", "edit_actions": [{"type": "R", "before": "24", "after": "34 four", "start_char_pos": 410, "end_char_pos": 412}, {"type": "A", "before": null, "after": "modelling", "start_char_pos": 458, "end_char_pos": 458}, {"type": "R", "before": "9", "after": "11", "start_char_pos": 524, "end_char_pos": 525}, {"type": "R", "before": "4", "after": "7", "start_char_pos": 577, "end_char_pos": 578}, {"type": "R", "before": "3", "after": "5", "start_char_pos": 633, "end_char_pos": 634}, {"type": "D", "before": "8). Population-based (", "after": null, "start_char_pos": 685, "end_char_pos": 707}, {"type": "R", "before": ", metapopulation (5), and individual-based (8) model frameworks were represented. The majority of models (18) were parameterized to the genotype II isolates currently circulating in Europe and Asia.", "after": ".", "start_char_pos": 712, "end_char_pos": 910}, {"type": "R", "before": "half of the studies stem from one of two models . We call for a diversification of modeling approaches through developing additional frameworks. All models but one", "after": "all models", "start_char_pos": 1155, "end_char_pos": 1318}, {"type": "R", "before": "to", "after": ", being developed for", "start_char_pos": 1337, "end_char_pos": 1339}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1374, "end_char_pos": 1375}, {"type": "R", "before": "the domestic and wild compartments can", "after": "domestic pigs and wild boar are evidenced to", "start_char_pos": 1423, "end_char_pos": 1461}, {"type": "A", "before": null, "after": "ASF", "start_char_pos": 1488, "end_char_pos": 1488}, {"type": "R", "before": "this transmission", "after": "such transmission routes", "start_char_pos": 1540, "end_char_pos": 1557}, {"type": "R", "before": "For ASF", "after": "While comparing strategies is beneficial for identifying a rank-order efficacy of control methods, this structure does not necessarily determine the most effective combination of all available strategies. In order for ASFV", "start_char_pos": 1838, "end_char_pos": 1845}, {"type": "R", "before": ", these", "after": "in controlling ASFV globally, these modelling", "start_char_pos": 1892, "end_char_pos": 1899}], "sents_char_pos": [0, 90, 221, 303, 406, 793, 910, 1003, 1147, 1204, 1299, 1499, 1569, 1721, 1837]} {"doc_id": "2011.10896", "revision_depth": "2", "before_revision": "Hardware-agnostic programming with high performance portability will be the bedrock for realizing the ubiquitous adoption of emerging accelerator technologies in future heterogeneous high-performance computing (HPC) systems, which is the key to achieving the next level of HPC performance on an expanding accelerator landscape. In this paper , we present HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles and a novel compute-centric message passing interface (C^2MPI) specification for enabling the portable and performance-optimized execution of hardware-agnostic application host codes across heterogeneous accelerator resources . The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 v4 CPUs, Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for the host program to run across all the computing devices with a consistently maximum performance portability score of 1.0 , which is 2x-861,883x higher than the OpenCL-based solution that suffers from an unstably low performance portability score. of the documentation of their work .", "after_revision": "This paper presents HALO 1.0, an open-ended extensible multi-agent software framework that implements a set of proposed hardware-agnostic accelerator orchestration (HALO) principles . HALO implements a novel compute-centric message passing interface (C^2MPI) specification for enabling the performance-portable execution of a hardware-agnostic host application across heterogeneous accelerators . The experiment results of evaluating eight widely used HPC subroutines based on Intel Xeon E5-2620 CPUs, Intel Arria 10 GX FPGAs, and NVIDIA GeForce RTX 2080 Ti GPUs show that HALO 1.0 allows for a unified control flow for host programs to run across all the computing devices with a consistently top performance portability score , which is up to five orders of magnitude higher than the OpenCL-based solution .", "edit_actions": [{"type": "R", "before": "Hardware-agnostic programming with high performance portability will be the bedrock for realizing the ubiquitous adoption of emerging accelerator technologies in future heterogeneous high-performance computing (HPC) systems, which is the key to achieving the next level of HPC performance on an expanding accelerator landscape. In this paper , we present", "after": "This paper presents", "start_char_pos": 0, "end_char_pos": 354}, {"type": "R", "before": "and", "after": ". HALO implements", "start_char_pos": 517, "end_char_pos": 520}, {"type": "R", "before": "portable and performance-optimized execution of", "after": "performance-portable execution of a", "start_char_pos": 611, "end_char_pos": 658}, {"type": "R", "before": "application host codes across heterogeneous accelerator resources", "after": "host application across heterogeneous accelerators", "start_char_pos": 677, "end_char_pos": 742}, {"type": "D", "before": "v4", "after": null, "start_char_pos": 844, "end_char_pos": 846}, {"type": "R", "before": "the host program", "after": "host programs", "start_char_pos": 971, "end_char_pos": 987}, {"type": "R", "before": "maximum", "after": "top", "start_char_pos": 1048, "end_char_pos": 1055}, {"type": "D", "before": "of 1.0", "after": null, "start_char_pos": 1086, "end_char_pos": 1092}, {"type": "R", "before": "2x-861,883x", "after": "up to five orders of magnitude", "start_char_pos": 1104, "end_char_pos": 1115}, {"type": "D", "before": "that suffers from an unstably low performance portability score. of the documentation of their work", "after": null, "start_char_pos": 1154, "end_char_pos": 1253}], "sents_char_pos": [0, 327, 744, 852]} {"doc_id": "2011.11259", "revision_depth": "1", "before_revision": "Pairwise Potts models (PM) provide accurate statistical models of families of evolutionarily related protein sequences. Their parameters are the local fields, which describe site-specific patterns of amino-acid conservation, and the two-site couplings, which mirror the coevolution between pairs of distinct sites. This coevolution reflects structural and functional constraints acting on protein sequences during evolution , and couplings can a priori connect any pairs of sites, even those being distant along the protein chain, or distant in the three-dimensional protein fold . The most conservative choice to describe all of the coevolution signal is to include all possible two-site couplings into the PM. This choice, typically made by what is known as Direct Coupling Analysis, has been highly successful in using sequences for predicting residue contacts in the three-dimensional structure, mutational effects, and in generating new functional sequences. However, the resulting PM suffers from important over-fitting effects: many couplings are small, noisy and hardly interpretable , and the PM is close to a critical point, meaning that it is highly sensitive to small parameter perturbations. In this work, we introduce a parameter-reduction procedure via iterative decimation of the less statistically significant couplings . We propose an information-based criterion that identifies couplings that are either weak , or statistically unsupported . We show that our procedure allows one to remove more than 90 \\% of the PM couplings, while preserving the predictive and generative properties of the original dense PM. The resulting model is far away from criticality, meaning that it is more robust to noise, and its couplings are more easily interpretable.%DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% \\\\%DIF > of the PM couplings, while preserving the predictive and generative properties of the original dense PM, and the resulting model is far away from criticality, hence more robust to noise.", "after_revision": "Boltzmann machines (BM) are widely used as generative models. For example, pairwise Potts models (PM) , which are instances of the BM class, provide accurate statistical models of families of evolutionarily related protein sequences. Their parameters are the local fields, which describe site-specific patterns of amino-acid conservation, and the two-site couplings, which mirror the coevolution between pairs of sites. This coevolution reflects structural and functional constraints acting on protein sequences during evolution . The most conservative choice to describe the coevolution signal is to include all possible two-site couplings into the PM. This choice, typical of what is known as Direct Coupling Analysis, has been successful for predicting residue contacts in the three-dimensional structure, mutational effects, and in generating new functional sequences. However, the resulting PM suffers from important over-fitting effects: many couplings are small, noisy and hardly interpretable ; the PM is close to a critical point, meaning that it is highly sensitive to small parameter perturbations. In this work, we introduce a general parameter-reduction procedure for BMs, via a controlled iterative decimation of the less statistically significant couplings , identified by an information-based criterion that selects either weak or statistically unsupported couplings. For several protein families, our procedure allows one to remove more than 90 %DIFDELCMD < \\end{abstract} %DIFDELCMD < %%% \\\\%DIF > of the PM couplings, while preserving the predictive and generative properties of the original dense PM, and the resulting model is far away from criticality, hence more robust to noise.", "edit_actions": [{"type": "R", "before": "Pairwise", "after": "Boltzmann machines (BM) are widely used as generative models. For example, pairwise", "start_char_pos": 0, "end_char_pos": 8}, {"type": "A", "before": null, "after": ", which are instances of the BM class,", "start_char_pos": 27, "end_char_pos": 27}, {"type": "D", "before": "distinct", "after": null, "start_char_pos": 300, "end_char_pos": 308}, {"type": "D", "before": ", and couplings can a priori connect any pairs of sites, even those being distant along the protein chain, or distant in the three-dimensional protein fold", "after": null, "start_char_pos": 425, "end_char_pos": 580}, {"type": "D", "before": "all of", "after": null, "start_char_pos": 624, "end_char_pos": 630}, {"type": "R", "before": "typically made by", "after": "typical of", "start_char_pos": 726, "end_char_pos": 743}, {"type": "R", "before": "highly successful in using sequences", "after": "successful", "start_char_pos": 796, "end_char_pos": 832}, {"type": "R", "before": ", and", "after": ";", "start_char_pos": 1093, "end_char_pos": 1098}, {"type": "A", "before": null, "after": "general", "start_char_pos": 1235, "end_char_pos": 1235}, {"type": "R", "before": "via", "after": "for BMs, via a controlled", "start_char_pos": 1266, "end_char_pos": 1269}, {"type": "R", "before": ". We propose", "after": ", identified by", "start_char_pos": 1339, "end_char_pos": 1351}, {"type": "R", "before": "identifies couplings that are either weak ,", "after": "selects either weak", "start_char_pos": 1388, "end_char_pos": 1431}, {"type": "R", "before": ". We show that", "after": "couplings. For several protein families,", "start_char_pos": 1461, "end_char_pos": 1475}, {"type": "D", "before": "\\% of the PM couplings, while preserving the predictive and generative properties of the original dense PM. The resulting model is far away from criticality, meaning that it is more robust to noise, and its couplings are more easily interpretable.", "after": null, "start_char_pos": 1524, "end_char_pos": 1771}], "sents_char_pos": [0, 120, 315, 582, 712, 964, 1205, 1340, 1462, 1631, 1771]} {"doc_id": "2011.11500", "revision_depth": "1", "before_revision": "Recovery a planted signal perturbed by noise is a fundamental problem in machine learning. In this work, we consider the problem of recovery a planted k-densest sub-hypergraph on h-uniform hypergraphsover n nodes . This fundamental problem appears in different contexts, e.g., community detection, average case complexity, and neuroscience applications . We first observe that it can be viewed as a structural variant of tensor PCA in which the hypergraph parameters k and h determine the structure of the signal to be recovered when the observations are contaminated by Gaussian noise. In this work, we provide tight information-theoretic upper and lower bounds for the recovery problem , as well as the first non-trivial algorithmic bounds based on approximate message passing algorithms. The problem exhibits a typical information-to-computational-gap observed in analogous settings, that widens with increasing sparsity of the problem. Interestingly, the bounds show that the structure of the signal does have an impact on the existing bounds of tensor PCA that the unstructured planted signal does not capture .", "after_revision": " In this work, we consider the problem of recovery a planted k-densest sub-hypergraph on d-uniform hypergraphs . This fundamental problem appears in different contexts, e.g., community detection, average-case complexity, and neuroscience applications as a structural variant of tensor-PCA problem. We provide tightinformation-theoretic upper and lower bounds for the exact recovery threshold by the maximum-likelihood estimator , as well as algorithmic bounds based on approximate message passing algorithms. The problem exhibits a typical statistical-to-computational gap observed in analogous sparse settings that widen with increasing sparsity of the problem. The bounds show that the signal structure impacts the location of the statistical and computational phase transition that the known existing bounds for the tensor-PCA model do not capture. This effect is due to the generic planted signal prior that this latter model addresses .", "edit_actions": [{"type": "D", "before": "Recovery a planted signal perturbed by noise is a fundamental problem in machine learning.", "after": null, "start_char_pos": 0, "end_char_pos": 90}, {"type": "R", "before": "h-uniform hypergraphsover n nodes", "after": "d-uniform hypergraphs", "start_char_pos": 179, "end_char_pos": 212}, {"type": "R", "before": "average case", "after": "average-case", "start_char_pos": 298, "end_char_pos": 310}, {"type": "D", "before": ". We first observe that it can be viewed", "after": null, "start_char_pos": 353, "end_char_pos": 393}, {"type": "R", "before": "tensor PCA in which the hypergraph parameters k and h determine the structure of the signal to be recovered when the observations are contaminated by Gaussian noise. In this work, we provide tight information-theoretic", "after": "tensor-PCA problem. We provide tight", "start_char_pos": 421, "end_char_pos": 639}, {"type": "A", "before": null, "after": "information-theoretic", "start_char_pos": 639, "end_char_pos": 639}, {"type": "R", "before": "recovery problem", "after": "exact recovery threshold by the maximum-likelihood estimator", "start_char_pos": 671, "end_char_pos": 687}, {"type": "R", "before": "the first non-trivial algorithmic", "after": "algorithmic", "start_char_pos": 701, "end_char_pos": 734}, {"type": "R", "before": "information-to-computational-gap", "after": "statistical-to-computational gap", "start_char_pos": 822, "end_char_pos": 854}, {"type": "R", "before": "settings, that widens", "after": "sparse settings that widen", "start_char_pos": 877, "end_char_pos": 898}, {"type": "R", "before": "Interestingly, the", "after": "The", "start_char_pos": 940, "end_char_pos": 958}, {"type": "R", "before": "structure of the signal does have an impact on the existing bounds of tensor PCA that the unstructured planted signal does not capture", "after": "signal structure impacts the location of the statistical and computational phase transition that the known existing bounds for the tensor-PCA model do not capture. This effect is due to the generic planted signal prior that this latter model addresses", "start_char_pos": 980, "end_char_pos": 1114}], "sents_char_pos": [0, 90, 214, 354, 586, 790, 939]} {"doc_id": "2011.14203", "revision_depth": "1", "before_revision": "Transformer-based language models such as BERT provide significant accuracy improvement to a multitude of natural language processing (NLP) tasks. However, their hefty computational and memory demands make them challenging to deploy to resource-constrained edge platforms with strict latency requirements. We present EdgeBERT an in-depth and principled algorithm and hardware design methodology to achieve minimal latency and energy consumption on multi-task NLP inference. Compared to the ALBERT baseline, we achieve up to 2.4x and 13.4x inference latencyand memory savings, respectively, with less than 1\\%-pt drop in accuracy on several GLUE benchmarks by employing a calibrated combination of 1) entropy-based early stopping, 2) adaptive attention span, 3) movement and magnitude pruning, and 4) floating-point quantization. Furthermore, in order to maximize the benefits of these algorithms in always-on and intermediate edge computing settings, we specialize a scalable hardware architecture wherein floating-point bit encodings of the shareable multi-task embedding parameters are stored in high-density non-volatile memory . Altogether, EdgeBERT enables fully on-chip inference acceleration of NLP workloads with 5.2 x, and 157x lower energy than that of an un-optimized accelerator and CUDA adaptations on an Nvidia Jetson Tegra X2 mobile GPU, respectively.", "after_revision": "Transformer-based language models such as BERT provide significant accuracy improvement for a multitude of natural language processing (NLP) tasks. However, their hefty computational and memory demands make them challenging to deploy to resource-constrained edge platforms with strict latency requirements. We present EdgeBERT , an in-depth algorithm-hardware co-design for latency-aware energy optimization for multi-task NLP . EdgeBERT employs entropy-based early exit predication in order to perform dynamic voltage-frequency scaling (DVFS), at a sentence granularity, for minimal energy consumption while adhering to a prescribed target latency. Computation and memory footprint overheads are further alleviated by employing a calibrated combination of adaptive attention span, selective network pruning, and floating-point quantization. Furthermore, in order to maximize the synergistic benefits of these algorithms in always-on and intermediate edge computing settings, we specialize a 12nm scalable hardware accelerator system, integrating a fast-switching low-dropout voltage regulator (LDO), an all-digital phase-locked loop (ADPLL), as well as, high-density embedded non-volatile memories (eNVMs) wherein the sparse floating-point bit encodings of the shared multi-task parameters are carefully stored . Altogether, latency-aware multi-task NLP inference acceleration on the EdgeBERT hardware system generates up to 7x, 2.5 x, and 53x lower energy compared to the conventional inference without early stopping, the latency-unbounded early exit approach, and CUDA adaptations on an Nvidia Jetson Tegra X2 mobile GPU, respectively.", "edit_actions": [{"type": "R", "before": "to", "after": "for", "start_char_pos": 88, "end_char_pos": 90}, {"type": "A", "before": null, "after": ",", "start_char_pos": 326, "end_char_pos": 326}, {"type": "R", "before": "and principled algorithm and hardware design methodology to achieve minimal latency and energy consumption on", "after": "algorithm-hardware co-design for latency-aware energy optimization for", "start_char_pos": 339, "end_char_pos": 448}, {"type": "R", "before": "inference. Compared to the ALBERT baseline, we achieve up to 2.4x and 13.4x inference latencyand memory savings, respectively, with less than 1\\%-pt drop in accuracy on several GLUE benchmarks", "after": ". EdgeBERT employs entropy-based early exit predication in order to perform dynamic voltage-frequency scaling (DVFS), at a sentence granularity, for minimal energy consumption while adhering to a prescribed target latency. Computation and memory footprint overheads are further alleviated", "start_char_pos": 464, "end_char_pos": 656}, {"type": "D", "before": "1) entropy-based early stopping, 2)", "after": null, "start_char_pos": 698, "end_char_pos": 733}, {"type": "R", "before": "3) movement and magnitude", "after": "selective network", "start_char_pos": 759, "end_char_pos": 784}, {"type": "D", "before": "4)", "after": null, "start_char_pos": 798, "end_char_pos": 800}, {"type": "A", "before": null, "after": "synergistic", "start_char_pos": 868, "end_char_pos": 868}, {"type": "R", "before": "scalable hardware architecture wherein", "after": "12nm scalable hardware accelerator system, integrating a fast-switching low-dropout voltage regulator (LDO), an all-digital phase-locked loop (ADPLL), as well as, high-density embedded non-volatile memories (eNVMs) wherein the sparse", "start_char_pos": 969, "end_char_pos": 1007}, {"type": "R", "before": "shareable", "after": "shared", "start_char_pos": 1044, "end_char_pos": 1053}, {"type": "R", "before": "embedding parameters are stored in high-density non-volatile memory", "after": "parameters are carefully stored", "start_char_pos": 1065, "end_char_pos": 1132}, {"type": "R", "before": "EdgeBERT enables fully on-chip inference acceleration of NLP workloads with 5.2", "after": "latency-aware multi-task NLP inference acceleration on the EdgeBERT hardware system generates up to 7x, 2.5", "start_char_pos": 1147, "end_char_pos": 1226}, {"type": "R", "before": "157x lower energy than that of an un-optimized accelerator", "after": "53x lower energy compared to the conventional inference without early stopping, the latency-unbounded early exit approach,", "start_char_pos": 1234, "end_char_pos": 1292}], "sents_char_pos": [0, 146, 305, 474, 829, 1134]} {"doc_id": "2012.02165", "revision_depth": "1", "before_revision": "The current development of the vaccines for SARS-CoV-2 is unprecedented. However, little is knownabout the fine-grained public opinions on the coming vaccines. Using more than 40,000 rigorously selected tweets (from over six million tweets collected using keywords) posted by over 20,000 distinct Twitter users , we adopt a human-guided machine learning framework to capture the public opinions on the potential vaccines for SARS-CoV-2 and classify them into three groups: pro-vaccine, vaccine-hesitant, and anti-vaccine. To investigate the scope and causes of public opinions, we compare the demographics, social capitals , income, religious statuses as well as the political affiliations of these three groups and find significant differences . A lower acceptance level for the potential COVID-19 vaccines is observed among the socioeconomically disadvantaged groups. We further aggregate the opinions at the state and country levels, and find that the percentage of the pro-vaccine group is lower in the Southeast part of the United States. Interestingly, the major changes in the percentages of different opinion groups roughly correspond to the major pandemic-related events. Next, by conducting counterfactual analyses, we find that the U.S. public is most concerned about the safety, effectiveness, and political issues with regards to the potential vaccines for COVID-19. In particular, we also investigate the public opinions about the newly emerged mRNA vaccines and find the opinions vary significantly across the religious beliefs : There are proportionally more religious people in the anti-vaccine group. To our best knowledge, this is the first large-scale social media-based study to analyze the public opinions on the potential COVID-19 vaccines that can inform more effective vaccine distribution policies and strategies.", "after_revision": "The current development of vaccines for SARS-CoV-2 is unprecedented. Little is known, however, about the nuanced public opinions on the coming vaccines. We adopt a human-guided machine learning framework (using more than 40,000 rigorously selected tweets from more than 20,000 distinct Twitter users ) to capture public opinion on the potential vaccines for SARS-CoV-2 , classifying them into three groups: pro-vaccine, vaccine-hesitant, and anti-vaccine. We compare demographics, social capital , income, religious status, and political affiliations of these three groups to investigate the scope and causes of public opinions . A lower vaccine acceptance level for potential COVID-19 vaccines is observed among socioeconomically disadvantaged groups. We further aggregate opinions at the state and country levels, and find that the percentage of the pro-vaccine group is lower in the Southeast part of the United States. Interestingly, the major changes in the percentages of different opinion groups roughly correspond to the major pandemic-related events. Next, by conducting counterfactual analyses, we find that the U.S. public is most concerned about the safety, effectiveness, and political issues regarding potential vaccines for COVID-19. In particular, we also investigate public opinion about the newly emerged mRNA vaccines and find opinions vary significantly across by religious beliefs with proportionally more religious people in the anti-vaccine group. We believe this is the first large-scale social media-based study to analyze public opinions on potential COVID-19 vaccines that can inform more effective vaccine distribution policies and strategies.", "edit_actions": [{"type": "D", "before": "the", "after": null, "start_char_pos": 27, "end_char_pos": 30}, {"type": "R", "before": "However, little is knownabout the fine-grained", "after": "Little is known, however, about the nuanced", "start_char_pos": 73, "end_char_pos": 119}, {"type": "R", "before": "Using", "after": "We adopt a human-guided machine learning framework (using", "start_char_pos": 160, "end_char_pos": 165}, {"type": "R", "before": "(from over six million tweets collected using keywords) posted by over", "after": "from more than", "start_char_pos": 210, "end_char_pos": 280}, {"type": "R", "before": ", we adopt a human-guided machine learning framework to capture the public opinions", "after": ") to capture public opinion", "start_char_pos": 311, "end_char_pos": 394}, {"type": "R", "before": "and classify", "after": ", classifying", "start_char_pos": 436, "end_char_pos": 448}, {"type": "R", "before": "To investigate the scope and causes of public opinions, we compare the", "after": "We compare", "start_char_pos": 522, "end_char_pos": 592}, {"type": "R", "before": "capitals", "after": "capital", "start_char_pos": 614, "end_char_pos": 622}, {"type": "R", "before": "statuses as well as the", "after": "status, and", "start_char_pos": 643, "end_char_pos": 666}, {"type": "R", "before": "and find significant differences", "after": "to investigate the scope and causes of public opinions", "start_char_pos": 712, "end_char_pos": 744}, {"type": "A", "before": null, "after": "vaccine", "start_char_pos": 755, "end_char_pos": 755}, {"type": "D", "before": "the", "after": null, "start_char_pos": 777, "end_char_pos": 780}, {"type": "D", "before": "the", "after": null, "start_char_pos": 827, "end_char_pos": 830}, {"type": "D", "before": "the", "after": null, "start_char_pos": 892, "end_char_pos": 895}, {"type": "R", "before": "with regards to the", "after": "regarding", "start_char_pos": 1328, "end_char_pos": 1347}, {"type": "R", "before": "the public opinions", "after": "public opinion", "start_char_pos": 1416, "end_char_pos": 1435}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1483, "end_char_pos": 1486}, {"type": "R", "before": "the religious beliefs : There are", "after": "by religious beliefs with", "start_char_pos": 1522, "end_char_pos": 1555}, {"type": "R", "before": "To our best knowledge,", "after": "We believe", "start_char_pos": 1620, "end_char_pos": 1642}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1709, "end_char_pos": 1712}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1732, "end_char_pos": 1735}], "sents_char_pos": [0, 72, 159, 521, 870, 1044, 1181, 1380, 1619]} {"doc_id": "2012.02277", "revision_depth": "1", "before_revision": "We consider an infinite-horizon optimal consumption problem for an individual who forms a consumption habit based on an exponentially-weighted average of her past rate of consumption. The novelty of our approach is in introducing habit formation through a constraint, rather than through the objective function, as is customary in the existing habit-formation literature. Specifically, we require that the individual consume at a rate that is greater than a certain proportion \\alpha\\le1 of her consumption habit . Our habit-formation model allows for both addictive ( \\alpha=1 ) and non-addictive ( 0<\\alpha<1 ) habits. Assuming that the individual invests in a risk-free market, we formulate and solve a deterministic control problem to maximize the discounted CRRA utility of the individual's consumption-to-habit process subject to the said habit-formation constraint. We derive the optimal consumption policies explicitly in terms of the solution of a nonlinear free-boundary problem, which we analyze in detail. Impatient individuals (those with sufficiently large utility discount rates) always consume above the minimum rate; thus, they eventually attain the minimum wealth-to-habit ratio. Patient individuals (those with small utility discount rates) consume at the minimum rate if their wealth-to-habit ratio is below a threshold, and above it otherwise. By consuming patiently, these individuals maintain a wealth-to-habit ratio that is greater than the minimum acceptable level .", "after_revision": "We propose a new optimal consumption model in which the degree of addictiveness of habit formation is directly controlled through a consumption constraint. In particular, we assume that the individual is unwilling to consume at a rate below a certain proportion 0<\\alpha\\le1 of her consumption habit , which is the exponentially-weighted average of past consumption rates. \\alpha=1 prohibits the habit process to decrease and corresponds to the completely addictive model. \\alpha=0 makes the habit-formation constraint moot and corresponds to the non-addictive model. 0<\\alpha<1 leads to partially addictive models, with the level of addictiveness increasing with \\alpha. In contrast to the existing habit-formation literature, our constraint cannot be incorporated in the objective function through infinite marginal utility. Assuming that the individual invests in a risk-free market, we formulate and solve an infinite-horizon, deterministic control problem to maximize the discounted CRRA utility of the consumption-to-habit process subject to the habit-formation constraint. Optimal consumption policies are derived explicitly in terms of the solution of a nonlinear free-boundary problem, which we analyze in detail. Impatient always consume above the minimum rate; thus, they eventually attain the minimum wealth-to-habit ratio. Patient individuals consume at the minimum rate if their wealth-to-habit ratio is below a threshold, and above it otherwise. By consuming patiently, these individuals maintain a wealth-to-habit ratio that is greater than the minimum acceptable level . Additionally, we prove that the optimal consumption path is hump-shaped if the initial wealth-to-habit ratio is either: (1) larger than a high threshold; or (2) below a low threshold and the agent is less risk averse. Thus, we provide a simple explanation for the consumption hump observed by various empirical studies .", "edit_actions": [{"type": "R", "before": "consider an infinite-horizon optimal consumption problem for an individual who forms a consumption habit based on an exponentially-weighted average of her past rate of consumption. The novelty of our approach is in introducing habit formation through a constraint, rather than through the objective function, as is customary in the existing habit-formation literature. Specifically, we require", "after": "propose a new optimal consumption model in which the degree of addictiveness of habit formation is directly controlled through a consumption constraint. In particular, we assume", "start_char_pos": 3, "end_char_pos": 396}, {"type": "A", "before": null, "after": "is unwilling to", "start_char_pos": 417, "end_char_pos": 417}, {"type": "R", "before": "that is greater than", "after": "below", "start_char_pos": 436, "end_char_pos": 456}, {"type": "R", "before": "\\alpha", "after": "0<\\alpha", "start_char_pos": 478, "end_char_pos": 484}, {"type": "R", "before": ". Our habit-formation model allows for both addictive (", "after": ", which is the exponentially-weighted average of past consumption rates.", "start_char_pos": 514, "end_char_pos": 569}, {"type": "R", "before": ") and", "after": "prohibits the habit process to decrease and corresponds to the completely addictive model. \\alpha=0 makes the habit-formation constraint moot and corresponds to the", "start_char_pos": 579, "end_char_pos": 584}, {"type": "R", "before": "(", "after": "model.", "start_char_pos": 599, "end_char_pos": 600}, {"type": "R", "before": ") habits.", "after": "leads to partially addictive models, with the level of addictiveness increasing with \\alpha. In contrast to the existing habit-formation literature, our constraint cannot be incorporated in the objective function through infinite marginal utility.", "start_char_pos": 612, "end_char_pos": 621}, {"type": "R", "before": "a", "after": "an infinite-horizon,", "start_char_pos": 705, "end_char_pos": 706}, {"type": "D", "before": "individual's", "after": null, "start_char_pos": 784, "end_char_pos": 796}, {"type": "D", "before": "said", "after": null, "start_char_pos": 841, "end_char_pos": 845}, {"type": "R", "before": "We derive the optimal consumption policies", "after": "Optimal consumption policies are derived", "start_char_pos": 874, "end_char_pos": 916}, {"type": "D", "before": "individuals (those with sufficiently large utility discount rates)", "after": null, "start_char_pos": 1029, "end_char_pos": 1095}, {"type": "D", "before": "(those with small utility discount rates)", "after": null, "start_char_pos": 1219, "end_char_pos": 1260}, {"type": "A", "before": null, "after": ". Additionally, we prove that the optimal consumption path is hump-shaped if the initial wealth-to-habit ratio is either: (1) larger than a high threshold; or (2) below a low threshold and the agent is less risk averse. Thus, we provide a simple explanation for the consumption hump observed by various empirical studies", "start_char_pos": 1491, "end_char_pos": 1491}], "sents_char_pos": [0, 183, 371, 515, 621, 873, 1018, 1134, 1198, 1365]} {"doc_id": "2012.02363", "revision_depth": "1", "before_revision": "We study fundamental point-line covering problems in computational geometry, in which the input is a set S of points in the plane. The first is the %DIFDELCMD < {\\sc %%% Rich Lines problem, which asks for the set of all lines that each covers at least \\lambda points from S, for a given integer parameter \\lambda \\geq 2; this problem subsumes the %DIFDELCMD < {\\sc %%% 3-Points-on-Line problem and the %DIFDELCMD < {\\sc %%% Exact Fitting problem, which -- the latter -- asks for a line containing the maximum number of points. The second is the %DIFDELCMD < \\NP%%% -hard problem%DIFDELCMD < {\\sc %%% Line Cover , which asks for a set of k lines that cover the points of S, for a given parameter k \\in N. Both problems have been extensively studied. In particular, the %DIFDELCMD < {\\sc %%% Rich Lines problem is a fundamental problem whose solution serves as a building block for several algorithms in computational geometry. For %DIFDELCMD < {\\sc %%% Rich Lines and%DIFDELCMD < {\\sc %%% Exact Fitting , we present a randomized Monte Carlo algorithm that achieves a lower running time than that of Guibas et al.'s algorithm [ %DIFDELCMD < {\\it %%% Computational Geometry 1996], for a wide range of the parameter \\lambda. We derive lower-bound results showing that, for \\lambda =\\Omega(\\sqrt{n \\log n}), the upper bound on the running time of this randomized algorithm matches the lower bound that we derive on the time complexity of %DIFDELCMD < {\\sc %%% Rich Lines in the algebraic computation trees model. For %DIFDELCMD < {\\sc %%% Line Cover , we present two kernelization algorithms: a randomized Monte Carlo algorithm and a deterministic algorithm. Both algorithms improve the running time of existing kernelization algorithms for %DIFDELCMD < {\\sc %%% Line Cover . We derive lower-bound results showing that the running time of the randomized algorithm we present comes close to the lower bound we derive on the time complexity of kernelization algorithms for %DIFDELCMD < {\\sc %%% Line Cover in the algebraic computation trees model.", "after_revision": "We study fundamental point-line covering problems in computational geometry, in which the input is a set S of points in the plane. The first is the %DIFDELCMD < {\\sc %%% Rich Lines problem, which asks for the set of all lines that each covers at least \\lambda points from S, for a given integer parameter \\lambda \\geq 2; this problem subsumes the %DIFDELCMD < {\\sc %%% 3-Points-on-Line problem and the %DIFDELCMD < {\\sc %%% Exact Fitting problem, which -- the latter -- asks for a line containing the maximum number of points. The second is the %DIFDELCMD < \\NP%%% %DIFDELCMD < {\\sc %%% NP-hard problem Line Cover , which asks for a set of k lines that cover the points of S, for a given parameter k \\in N. Both problems have been extensively studied. In particular, the %DIFDELCMD < {\\sc %%% Rich Lines problem is a fundamental problem whose solution serves as a building block for several algorithms in computational geometry. For %DIFDELCMD < {\\sc %%% %DIFDELCMD < {\\sc %%% Rich Lines and Exact Fitting , we present a randomized Monte Carlo algorithm that achieves a lower running time than that of Guibas et al.'s algorithm [ %DIFDELCMD < {\\it %%% Computational Geometry 1996], for a wide range of the parameter \\lambda. We derive lower-bound results showing that, for \\lambda =\\Omega(\\sqrt{n \\log n}), the upper bound on the running time of this randomized algorithm matches the lower bound that we derive on the time complexity of %DIFDELCMD < {\\sc %%% Rich Lines in the algebraic computation trees model. For %DIFDELCMD < {\\sc %%% Line Cover , we present two kernelization algorithms: a randomized Monte Carlo algorithm and a deterministic algorithm. Both algorithms improve the running time of existing kernelization algorithms for %DIFDELCMD < {\\sc %%% Line Cover . We derive lower-bound results showing that the running time of the randomized algorithm we present comes close to the lower bound we derive on the time complexity of kernelization algorithms for %DIFDELCMD < {\\sc %%% Line Cover in the algebraic computation trees model.", "edit_actions": [{"type": "R", "before": "Rich Lines", "after": "Rich Lines", "start_char_pos": 170, "end_char_pos": 180}, {"type": "R", "before": "Exact Fitting", "after": "Exact Fitting", "start_char_pos": 424, "end_char_pos": 437}, {"type": "D", "before": "-hard problem", "after": null, "start_char_pos": 565, "end_char_pos": 578}, {"type": "R", "before": "Line Cover", "after": "NP-hard problem Line Cover", "start_char_pos": 600, "end_char_pos": 610}, {"type": "R", "before": "Rich Lines", "after": "Rich Lines", "start_char_pos": 790, "end_char_pos": 800}, {"type": "D", "before": "Rich Lines", "after": null, "start_char_pos": 952, "end_char_pos": 962}, {"type": "D", "before": "and", "after": null, "start_char_pos": 963, "end_char_pos": 966}, {"type": "R", "before": "Exact Fitting", "after": "Rich Lines and Exact Fitting", "start_char_pos": 988, "end_char_pos": 1001}, {"type": "R", "before": "Computational Geometry", "after": "Computational Geometry", "start_char_pos": 1148, "end_char_pos": 1170}, {"type": "R", "before": "Rich Lines", "after": "Rich Lines", "start_char_pos": 1455, "end_char_pos": 1465}, {"type": "R", "before": "Line Cover", "after": "Line Cover", "start_char_pos": 1534, "end_char_pos": 1544}, {"type": "R", "before": "Line Cover", "after": "Line Cover", "start_char_pos": 1758, "end_char_pos": 1768}, {"type": "R", "before": "Line Cover", "after": "Line Cover", "start_char_pos": 1988, "end_char_pos": 1998}], "sents_char_pos": [0, 130, 320, 526, 748, 925, 1220, 1507, 1653, 1770]} {"doc_id": "2012.02507", "revision_depth": "1", "before_revision": "Document-level Relation Extraction (RE) requires extracting relations expressed within and across sentences. Recent works show that graph-based methods, usually constructing a document-level graph that captures document-aware interactions, can obtain useful entity representations thus helping tackle document-level RE. These methods either focus more on the entire graph, or pay more attention to a part of the graph, e.g., paths between the target entity pair. However, we find that document-level RE may benefit from focusing on both of them simultaneously. Therefore, to obtain more comprehensive entity representations, we propose the C oarse-to-F ineE ntityR epresentation model (CFER ) that adopts a coarse-to-fine strategy involving two phases. First, CFER uses graph neural networks to integrate global information in the entire graph at a coarse level. Next, CFER utilizes the global information as a guidance to selectively aggregate path information between the target entity pair at a fine level. In classification, we combine the entity representations from both two levels into more comprehensive representations for relation extraction. Experimental results on a large-scale document-level RE dataset show that CFER achieves better performance than previous baseline models . Further, we verify the effectiveness of our strategy through elaborate model analysis .", "after_revision": "Document-level Relation Extraction (RE) requires extracting relations expressed within and across sentences. Recent works show that graph-based methods, usually constructing a document-level graph that captures document-aware interactions, can obtain useful entity representations thus helping tackle document-level RE. These methods either focus more on the entire graph, or pay more attention to a part of the graph, e.g., paths between the target entity pair. However, we find that document-level RE may benefit from focusing on both of them simultaneously. Therefore, to obtain more comprehensive entity representations, we propose the Coarse-to-Fine Entity Representation model (CFER ) that adopts a coarse-to-fine strategy involving two phases. First, CFER uses graph neural networks to integrate global information in the entire graph at a coarse level. Next, CFER utilizes the global information as a guidance to selectively aggregate path information between the target entity pair at a fine level. In classification, we combine the entity representations from both two levels into more comprehensive representations for relation extraction. Experimental results on two document-level RE datasets, DocRED and CDR, show that CFER outperforms existing models and is robust to the uneven label distribution .", "edit_actions": [{"type": "D", "before": "C", "after": null, "start_char_pos": 640, "end_char_pos": 641}, {"type": "D", "before": "oarse-to-", "after": null, "start_char_pos": 642, "end_char_pos": 651}, {"type": "D", "before": "F", "after": null, "start_char_pos": 651, "end_char_pos": 652}, {"type": "D", "before": "ine", "after": null, "start_char_pos": 653, "end_char_pos": 656}, {"type": "D", "before": "E", "after": null, "start_char_pos": 656, "end_char_pos": 657}, {"type": "D", "before": "ntity", "after": null, "start_char_pos": 658, "end_char_pos": 663}, {"type": "D", "before": "R", "after": null, "start_char_pos": 663, "end_char_pos": 664}, {"type": "D", "before": "epresentation model (", "after": null, "start_char_pos": 665, "end_char_pos": 686}, {"type": "R", "before": "CFER", "after": "Coarse-to-Fine Entity Representation model (CFER", "start_char_pos": 686, "end_char_pos": 690}, {"type": "R", "before": "a large-scale", "after": "two", "start_char_pos": 1177, "end_char_pos": 1190}, {"type": "R", "before": "dataset", "after": "datasets, DocRED and CDR,", "start_char_pos": 1209, "end_char_pos": 1216}, {"type": "R", "before": "achieves better performance than previous baseline models . Further, we verify the effectiveness of our strategy through elaborate model analysis", "after": "outperforms existing models and is robust to the uneven label distribution", "start_char_pos": 1232, "end_char_pos": 1377}], "sents_char_pos": [0, 108, 319, 462, 560, 752, 862, 1009, 1152, 1291]} {"doc_id": "2012.03879", "revision_depth": "1", "before_revision": "This work considers the general task of estimating the sum of a bounded function over the edges of a graph that is unknown a priori, where graph vertices and edges are built on-the-fly by an algorithm and the resulting graph is too large to be kept in memory or disk. Prior work proposes Markov Chain Monte Carlo (MCMC) methods that simultaneously sample and generate the graph , eliminating the need for storage . Unfortunately, these existing methods are not scalable to massive real-world graphs. In this paper, we introduce Ripple, an MCMC-based estimator which achieves unprecedented scalability in this task by stratifying the MCMC Markov chain state space with a new technique that we denote {\\em ordered sequential stratified Markov regenerations}. We show that the Ripple estimator is consistent, highly parallelizable, and scales well. In particular, applying Ripple to the task of estimating connected induced subgraph counts on large graphs, we empirically demonstrate that Ripple is accurate and is able to estimate counts of up to 12-node subgraphs, a task at a scale that has been considered unreachable, not only by prior MCMC-based methods , but also by other sampling approaches. For instance, in this target application, we present results where the Markov chain state space is as large as 10^{43}, for which Ripple computes estimates in less than 4 hours on average.", "after_revision": "This work considers the general task of estimating the sum of a bounded function over the edges of a graph , given neighborhood query access and where access to the entire network is prohibitively expensive. To estimate this sum, prior work proposes Markov chain Monte Carlo (MCMC) methods that use random walks started at some seed vertex and whose equilibrium distribution is the uniform distribution over all edges , eliminating the need to iterate over all edges . Unfortunately, these existing estimators are not scalable to massive real-world graphs. In this paper, we introduce Ripple, an MCMC-based estimator that achieves unprecedented scalability by stratifying the Markov chain state space into ordered strata with a new technique that we denote {\\em sequential stratified regenerations}. We show that the Ripple estimator is consistent, highly parallelizable, and scales well. We empirically evaluate our method by applying Ripple to the task of estimating connected , induced subgraph counts given some input graph. Therein, we demonstrate that Ripple is accurate and can estimate counts of up to 12-node subgraphs, which is a task at a scale that has been considered unreachable, not only by prior MCMC-based methods but also by other sampling approaches. For instance, in this target application, we present results in which the Markov chain state space is as large as 10^{43}, for which Ripple computes estimates in less than 4 hours , on average.", "edit_actions": [{"type": "R", "before": "that is unknown a priori, where graph vertices and edges are built on-the-fly by an algorithm and the resulting graph is too large to be kept in memory or disk. Prior", "after": ", given neighborhood query access and where access to the entire network is prohibitively expensive. To estimate this sum, prior", "start_char_pos": 107, "end_char_pos": 273}, {"type": "R", "before": "Chain", "after": "chain", "start_char_pos": 295, "end_char_pos": 300}, {"type": "R", "before": "simultaneously sample and generate the graph", "after": "use random walks started at some seed vertex and whose equilibrium distribution is the uniform distribution over all edges", "start_char_pos": 333, "end_char_pos": 377}, {"type": "R", "before": "for storage", "after": "to iterate over all edges", "start_char_pos": 401, "end_char_pos": 412}, {"type": "R", "before": "methods", "after": "estimators", "start_char_pos": 445, "end_char_pos": 452}, {"type": "R", "before": "which", "after": "that", "start_char_pos": 560, "end_char_pos": 565}, {"type": "D", "before": "in this task", "after": null, "start_char_pos": 601, "end_char_pos": 613}, {"type": "D", "before": "MCMC", "after": null, "start_char_pos": 633, "end_char_pos": 637}, {"type": "A", "before": null, "after": "into ordered strata", "start_char_pos": 663, "end_char_pos": 663}, {"type": "R", "before": "ordered sequential stratified Markov", "after": "sequential stratified", "start_char_pos": 705, "end_char_pos": 741}, {"type": "R", "before": "In particular,", "after": "We empirically evaluate our method by", "start_char_pos": 847, "end_char_pos": 861}, {"type": "A", "before": null, "after": ",", "start_char_pos": 914, "end_char_pos": 914}, {"type": "R", "before": "on large graphs, we empirically", "after": "given some input graph. Therein, we", "start_char_pos": 939, "end_char_pos": 970}, {"type": "R", "before": "is able to", "after": "can", "start_char_pos": 1011, "end_char_pos": 1021}, {"type": "A", "before": null, "after": "which is", "start_char_pos": 1066, "end_char_pos": 1066}, {"type": "D", "before": ",", "after": null, "start_char_pos": 1160, "end_char_pos": 1161}, {"type": "R", "before": "where", "after": "in which", "start_char_pos": 1262, "end_char_pos": 1267}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1378, "end_char_pos": 1378}], "sents_char_pos": [0, 267, 414, 499, 757, 846, 1200]} {"doc_id": "2012.04808", "revision_depth": "1", "before_revision": "Commonsense reasoning requires a model to make presumptions about world events via language understanding. Many methods couple pre-trained language models with knowledge graphs in order to combine the merits in language modeling and entity-based relational learning . However, although a knowledge graph contains rich structural information, it lacks the context to provide a more precise understanding of the concepts and relations . This creates a gap when fusing knowledge graphs into language modeling, especially in the scenario of insufficient paired text-knowledge data. In this paper , we propose to utilize external entity description to provide contextual information for graph entities. For the CommonsenseQA task, our model first extracts concepts from the question and choice, and then finds a related triple between these concepts. Next, it retrieves the descriptions of these concepts from Wiktionary and feed them as additional input to a pre-trained language model, together with the triple . The resulting model can attain much more effective commonsense reasoning capability, achieving state-of-the-art results in the CommonsenseQA dataset with an accuracy of 80.7\\% (single model) and 83.3\\% (ensemble model) on the official leaderboard .", "after_revision": "Commonsense question answering (QA) requires a model to grasp commonsense and factual knowledge to answer questions about world events . Many prior methods couple language modeling with knowledge graphs (KG) . However, although a KG contains rich structural information, it lacks the context to provide a more precise understanding of the concepts . This creates a gap when fusing knowledge graphs into language modeling, especially when there is insufficient labeled data. Thus , we propose to employ external entity descriptions to provide contextual information for knowledge understanding. We retrieve descriptions of related concepts from Wiktionary and feed them as additional input to pre-trained language models . The resulting model achieves state-of-the-art result in the CommonsenseQA dataset and the best result among non-generative models in OpenBookQA .", "edit_actions": [{"type": "R", "before": "reasoning", "after": "question answering (QA)", "start_char_pos": 12, "end_char_pos": 21}, {"type": "R", "before": "make presumptions", "after": "grasp commonsense and factual knowledge to answer questions", "start_char_pos": 42, "end_char_pos": 59}, {"type": "R", "before": "via language understanding. Many methods couple pre-trained language models", "after": ". Many prior methods couple language modeling", "start_char_pos": 79, "end_char_pos": 154}, {"type": "R", "before": "in order to combine the merits in language modeling and entity-based relational learning", "after": "(KG)", "start_char_pos": 177, "end_char_pos": 265}, {"type": "R", "before": "knowledge graph", "after": "KG", "start_char_pos": 288, "end_char_pos": 303}, {"type": "D", "before": "and relations", "after": null, "start_char_pos": 419, "end_char_pos": 432}, {"type": "R", "before": "in the scenario of insufficient paired text-knowledge data. In this paper", "after": "when there is insufficient labeled data. Thus", "start_char_pos": 518, "end_char_pos": 591}, {"type": "R", "before": "utilize external entity description", "after": "employ external entity descriptions", "start_char_pos": 608, "end_char_pos": 643}, {"type": "R", "before": "graph entities. For the CommonsenseQA task, our model first extracts concepts from the question and choice, and then finds a related triple between these concepts. Next, it retrieves the descriptions of these", "after": "knowledge understanding. We retrieve descriptions of related", "start_char_pos": 682, "end_char_pos": 890}, {"type": "D", "before": "a", "after": null, "start_char_pos": 953, "end_char_pos": 954}, {"type": "R", "before": "model, together with the triple", "after": "models", "start_char_pos": 976, "end_char_pos": 1007}, {"type": "R", "before": "can attain much more effective commonsense reasoning capability, achieving", "after": "achieves", "start_char_pos": 1030, "end_char_pos": 1104}, {"type": "R", "before": "results", "after": "result", "start_char_pos": 1122, "end_char_pos": 1129}, {"type": "R", "before": "with an accuracy of 80.7\\% (single model) and 83.3\\% (ensemble model) on the official leaderboard", "after": "and the best result among non-generative models in OpenBookQA", "start_char_pos": 1159, "end_char_pos": 1256}], "sents_char_pos": [0, 106, 267, 434, 577, 697, 845, 1009]} {"doc_id": "2012.06081", "revision_depth": "1", "before_revision": "The accurate approximation of scalar-valued functions from sample points is a key task in mathematical modeling and computational science. Recently, machine learning techniques based on Deep Neural Networks (DNNs) have begun to emerge as promising tools for function approximation in scientific computingproblems , with impressive results achieved on problems where the dimension of the underlying data or problem domain is large. In this work , we broaden this perspectiveby focusing on approximation of functions that are Hilbert-valued, i.e. they take values in a separable, but typically infinite-dimensional, Hilbert space. This problem arises in many science and engineering problems, in particular those involving the solution of parametric Partial Differential Equations (PDEs). Such problems are challenging for three reasons. First, pointwise samples are expensive to acquire . Second, the domain of the function is usually high dimensional, and third, the range lies in a Hilbert space. Our contributions are twofold. First, we present a novel result on DNN training for holomorphic functions with so-called hidden anisotropy. This result introduces a DNN training procedure and a full theoretical analysis with explicit guarantees on the error and sample complexity. This error bound is explicit in the three key errors occurred in the approximation procedure: best approximation error, measurementerror and physical discretization error . Our result shows that there is a procedure for learning Hilbert-valued functions via DNNs that performs as well as current best-in-class schemes. Second, we provide preliminary numerical results illustrating the practical performance of DNNs on Hilbert-valued functions arising as solutions to parametric PDEs. We consider different parameters, modify the DNN architecture to achieve better and competitive results and compare these to current best-in-class schemes.", "after_revision": "Accurate approximation of scalar-valued functions from sample points is a key task in computational science. Recently, machine learning with Deep Neural Networks (DNNs) has emerged as a promising tool for scientific computing , with impressive results achieved on problems where the dimension of the data or problem domain is large. This work broadens this perspective, focusing on approximating functions that are Hilbert-valued, i.e. take values in a separable, but typically infinite-dimensional, Hilbert space. This arises in science and engineering problems, in particular those involving solution of parametric Partial Differential Equations (PDEs). Such problems are challenging : 1) pointwise samples are expensive to acquire , 2) the function domain is high dimensional, and 3) the range lies in a Hilbert space. Our contributions are twofold. First, we present a novel result on DNN training for holomorphic functions with so-called hidden anisotropy. This result introduces a DNN training procedure and full theoretical analysis with explicit guarantees on error and sample complexity. The error bound is explicit in three key errors occurring in the approximation procedure: the best approximation, measurement, and physical discretization errors . Our result shows that there exists a procedure (albeit non-standard) for learning Hilbert-valued functions via DNNs that performs as well as , but no better than current best-in-class schemes. It gives a benchmark lower bound for how well DNNs can perform on such problems. Second, we examine whether better performance can be achieved in practice through different types of architectures and training. We provide preliminary numerical results illustrating practical performance of DNNs on parametric PDEs. We consider different parameters, modifying the DNN architecture to achieve better and competitive results , comparing these to current best-in-class schemes.", "edit_actions": [{"type": "R", "before": "The accurate", "after": "Accurate", "start_char_pos": 0, "end_char_pos": 12}, {"type": "D", "before": "mathematical modeling and", "after": null, "start_char_pos": 90, "end_char_pos": 115}, {"type": "R", "before": "techniques based on", "after": "with", "start_char_pos": 166, "end_char_pos": 185}, {"type": "R", "before": "have begun to emerge as promising tools for function approximation in scientific computingproblems", "after": "has emerged as a promising tool for scientific computing", "start_char_pos": 214, "end_char_pos": 312}, {"type": "D", "before": "underlying", "after": null, "start_char_pos": 387, "end_char_pos": 397}, {"type": "R", "before": "In this work , we broaden this perspectiveby focusing on approximation of", "after": "This work broadens this perspective, focusing on approximating", "start_char_pos": 431, "end_char_pos": 504}, {"type": "D", "before": "they", "after": null, "start_char_pos": 545, "end_char_pos": 549}, {"type": "R", "before": "problem arises in many", "after": "arises in", "start_char_pos": 634, "end_char_pos": 656}, {"type": "D", "before": "the", "after": null, "start_char_pos": 721, "end_char_pos": 724}, {"type": "R", "before": "for three reasons. First,", "after": ": 1)", "start_char_pos": 817, "end_char_pos": 842}, {"type": "R", "before": ". Second, the domain of the function is usually", "after": ", 2) the function domain is", "start_char_pos": 886, "end_char_pos": 933}, {"type": "R", "before": "third,", "after": "3)", "start_char_pos": 956, "end_char_pos": 962}, {"type": "D", "before": "a", "after": null, "start_char_pos": 1190, "end_char_pos": 1191}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1246, "end_char_pos": 1249}, {"type": "R", "before": "This", "after": "The", "start_char_pos": 1279, "end_char_pos": 1283}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1311, "end_char_pos": 1314}, {"type": "R", "before": "occurred", "after": "occurring", "start_char_pos": 1332, "end_char_pos": 1340}, {"type": "R", "before": "best approximation error, measurementerror", "after": "the best approximation, measurement,", "start_char_pos": 1373, "end_char_pos": 1415}, {"type": "R", "before": "error", "after": "errors", "start_char_pos": 1444, "end_char_pos": 1449}, {"type": "R", "before": "is a procedure", "after": "exists a procedure (albeit non-standard)", "start_char_pos": 1480, "end_char_pos": 1494}, {"type": "A", "before": null, "after": ", but no better than", "start_char_pos": 1567, "end_char_pos": 1567}, {"type": "A", "before": null, "after": "It gives a benchmark lower bound for how well DNNs can perform on such problems.", "start_char_pos": 1599, "end_char_pos": 1599}, {"type": "A", "before": null, "after": "examine whether better performance can be achieved in practice through different types of architectures and training. We", "start_char_pos": 1611, "end_char_pos": 1611}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1663, "end_char_pos": 1666}, {"type": "D", "before": "Hilbert-valued functions arising as solutions to", "after": null, "start_char_pos": 1700, "end_char_pos": 1748}, {"type": "R", "before": "modify", "after": "modifying", "start_char_pos": 1800, "end_char_pos": 1806}, {"type": "R", "before": "and compare", "after": ", comparing", "start_char_pos": 1870, "end_char_pos": 1881}], "sents_char_pos": [0, 138, 430, 628, 786, 835, 887, 997, 1028, 1137, 1278, 1451, 1598, 1765]} {"doc_id": "2012.07816", "revision_depth": "1", "before_revision": "While the open-source model for software development has led to successful large-scale collaborations in building software systems, data science projects are frequently developed by individuals or small groups . We describe challenges to scaling data science collaborations and present a novel conceptual framework and ML programming model to address them. We instantiate these ideas in Ballet, a lightweight software framework for collaborative open-source data science and a cloud-based development environment , with a plugin for collaborative feature engineering . Using our framework, collaborators incrementally propose feature definitions to a repository which are each subjected to an ML evaluation and can be automatically merged into an executable feature engineering pipeline. We leverage Ballet to conduct an extensive case study analysis of a real-world income prediction problem , and discuss implications for collaborative projects.", "after_revision": "While the open-source software development model has led to successful large-scale collaborations in building software systems, data science projects are frequently developed by individuals or small teams . We describe challenges to scaling data science collaborations and present a conceptual framework and ML programming model to address them. We instantiate these ideas in Ballet, a lightweight framework for collaborative , open-source data science through a focus on feature engineering, and an accompanying cloud-based development environment . Using our framework, collaborators incrementally propose feature definitions to a repository which are each subjected to an ML performance evaluation and can be automatically merged into an executable feature engineering pipeline. We leverage Ballet to conduct a case study analysis of an income prediction problem with 27 collaborators , and discuss implications for future designers of collaborative projects.", "edit_actions": [{"type": "R", "before": "model for software development", "after": "software development model", "start_char_pos": 22, "end_char_pos": 52}, {"type": "R", "before": "groups", "after": "teams", "start_char_pos": 203, "end_char_pos": 209}, {"type": "D", "before": "novel", "after": null, "start_char_pos": 288, "end_char_pos": 293}, {"type": "D", "before": "software", "after": null, "start_char_pos": 409, "end_char_pos": 417}, {"type": "A", "before": null, "after": ",", "start_char_pos": 446, "end_char_pos": 446}, {"type": "R", "before": "and a", "after": "through a focus on feature engineering, and an accompanying", "start_char_pos": 472, "end_char_pos": 477}, {"type": "D", "before": ", with a plugin for collaborative feature engineering", "after": null, "start_char_pos": 514, "end_char_pos": 567}, {"type": "A", "before": null, "after": "performance", "start_char_pos": 697, "end_char_pos": 697}, {"type": "R", "before": "an extensive", "after": "a", "start_char_pos": 820, "end_char_pos": 832}, {"type": "R", "before": "a real-world", "after": "an", "start_char_pos": 856, "end_char_pos": 868}, {"type": "A", "before": null, "after": "with 27 collaborators", "start_char_pos": 895, "end_char_pos": 895}, {"type": "A", "before": null, "after": "future designers of", "start_char_pos": 927, "end_char_pos": 927}], "sents_char_pos": [0, 211, 356, 569, 789]} {"doc_id": "2012.08849", "revision_depth": "1", "before_revision": "A cluster of research in Human-Computer Interaction (HCI) suggests that it is possible to infer some characteristics of users' mental states by analyzing electrophysiological responses in real-time. However, it is not clear how to use the information extracted from electrophysiological signals to create visual representations of the emotional states of Virtual Reality (VR) users. Visualization of users' emotions in VR can lead to biofeedback therapies for training emotion self-regulation . Understanding how to visualize emotions in VR requires an interdisciplinary approach that integrates disciplines such as psychology, electrophysiology, and audiovisual design. Therefore, this review aims to integrate previous studies from these fields to understand how to develop virtual environments that can automatically create visual representations of users' emotional states. This manuscript addresses this challenge in three sections: First, theories related to emotion and affect are compared . Second, evidence suggesting that specific visual and sound cues tend to be associated with particular emotions are discussed. And third , some of the available methods for assessing emotions are described .", "after_revision": "A cluster of research in Affective Computing suggests that it is possible to infer some characteristics of users' affective states by analyzing their electrophysiological activity in real-time. However, it is not clear how to use the information extracted from electrophysiological signals to create visual representations of the affective states of Virtual Reality (VR) users. Visualization of users' affective states in VR can lead to biofeedback therapies for mental health care . Understanding how to visualize affective states in VR requires an interdisciplinary approach that integrates psychology, electrophysiology, and audio-visual design. Therefore, this review aims to integrate previous studies from these fields to understand how to develop virtual environments that can automatically create visual representations of users' affective states. The manuscript addresses this challenge in four sections: First, theories related to emotion and affect are summarized . Second, evidence suggesting that visual and sound cues tend to be associated with affective states are discussed. Third , some of the available methods for assessing affect are described. The fourth and final section contains five practical considerations for the development of virtual reality environments for affect visualization .", "edit_actions": [{"type": "R", "before": "Human-Computer Interaction (HCI)", "after": "Affective Computing", "start_char_pos": 25, "end_char_pos": 57}, {"type": "R", "before": "mental", "after": "affective", "start_char_pos": 127, "end_char_pos": 133}, {"type": "R", "before": "electrophysiological responses", "after": "their electrophysiological activity", "start_char_pos": 154, "end_char_pos": 184}, {"type": "R", "before": "emotional", "after": "affective", "start_char_pos": 335, "end_char_pos": 344}, {"type": "R", "before": "emotions", "after": "affective states", "start_char_pos": 407, "end_char_pos": 415}, {"type": "R", "before": "training emotion self-regulation", "after": "mental health care", "start_char_pos": 460, "end_char_pos": 492}, {"type": "R", "before": "emotions", "after": "affective states", "start_char_pos": 526, "end_char_pos": 534}, {"type": "D", "before": "disciplines such as", "after": null, "start_char_pos": 596, "end_char_pos": 615}, {"type": "R", "before": "audiovisual", "after": "audio-visual", "start_char_pos": 651, "end_char_pos": 662}, {"type": "R", "before": "emotional states. This", "after": "affective states. The", "start_char_pos": 860, "end_char_pos": 882}, {"type": "R", "before": "three", "after": "four", "start_char_pos": 922, "end_char_pos": 927}, {"type": "R", "before": "compared", "after": "summarized", "start_char_pos": 988, "end_char_pos": 996}, {"type": "D", "before": "specific", "after": null, "start_char_pos": 1032, "end_char_pos": 1040}, {"type": "R", "before": "particular emotions", "after": "affective states", "start_char_pos": 1090, "end_char_pos": 1109}, {"type": "R", "before": "And third", "after": "Third", "start_char_pos": 1125, "end_char_pos": 1134}, {"type": "R", "before": "emotions are described", "after": "affect are described. The fourth and final section contains five practical considerations for the development of virtual reality environments for affect visualization", "start_char_pos": 1181, "end_char_pos": 1203}], "sents_char_pos": [0, 198, 382, 494, 670, 877, 998, 1124]} {"doc_id": "2012.09660", "revision_depth": "1", "before_revision": "Deciphering the workings of a brain (and its alterations due to pathologies and disorders) requires real-time mapping of the activity of all neurons. Recently, this formidable task has been brought into reach by the implementation of light sheet fluorescence (LSF) microscopy on the transparent zebrafish larva, a simple yet representative model of the vertebrate brain. This application is however hindered by the use of visible light for fluorescence excitation , inducing unwanted visual stimulation that can only be partially overcome resorting to complex excitation geometries. On the other hand, two-photon (2P) LSF microscopy, owing to the use of invisible infra-red illumination, enables volumetric imaging of neuronal activity avoiding undesirable visual stimulation . However, due to the low efficiency of the 2P absorption process, the imaging speed of this technique is typically limited (~ 1 Hz) by the signal to noise ratio achievable without sample photodamage. Here we describe a custom-made 2P LSF microscope that overcomes this limit, being specifically designed to perform whole-brain cellular-resolution calcium imaging in zebrafish larvae quintuplicating previous volumetric acquisition frequency (5 Hz) . ...%DIFDELCMD < ] %%% We employed this system to investigate, in real-time on a brain-wide scale, the onset and propagation of acute seizures, as induced by the convulsant drug pentylenetetrazol (PTZ), avoiding detrimental visual stimulation on a highly susceptible system such as an epileptic brain. ...%DIFDELCMD < ] %%% In conclusion, the presented 2P LSF microscope design affords high spatio-temporal resolution while avoiding visual stimuli and allows unprecedented access to whole zebrafish brain epileptic dynamics .", "after_revision": "Light-sheet fluorescence microscopy (LSFM) enables real-time whole-brain functional imaging in zebrafish larvae. Conventional one photon LSFM can however induce undesirable visual stimulation due to the use of visible excitation light. The use of two-photon (2P) excitation, employing near-infrared invisible light, provides unbiased investigation of neuronal circuit dynamics . However, due to the low efficiency of the 2P absorption process, the imaging speed of this technique is typically limited by the signal-to-noise-ratio. Here, we describe a 2P LSFM setup designed for non-invasive imaging that enables quintuplicating state-of-the-art volumetric acquisition rate of the larval zebrafish brain (5 Hz) %DIFDELCMD < ] %%% while keeping low the laser intensity on the specimen. We applied our system to the study of pharmacologically-induced acute seizures, %DIFDELCMD < ] %%% characterizing the spatial-temporal dynamics of pathological activity and describing for the first time the appearance of caudo-rostral ictal waves (CRIWs) .", "edit_actions": [{"type": "R", "before": "Deciphering the workings of a brain (and its alterations due to pathologies and disorders) requires", "after": "Light-sheet fluorescence microscopy (LSFM) enables", "start_char_pos": 0, "end_char_pos": 99}, {"type": "R", "before": "mapping of the activity of all neurons. Recently, this formidable task has been brought into reach by the implementation of light sheet fluorescence (LSF) microscopy on the transparent zebrafish larva, a simple yet representative model of the vertebrate brain. This application is however hindered by", "after": "whole-brain functional imaging in zebrafish larvae. Conventional one photon LSFM can however induce undesirable visual stimulation due to", "start_char_pos": 110, "end_char_pos": 410}, {"type": "R", "before": "light for fluorescence excitation , inducing unwanted visual stimulation that can only be partially overcome resorting to complex excitation geometries. On the other hand,", "after": "excitation light. The use of", "start_char_pos": 430, "end_char_pos": 601}, {"type": "R", "before": "LSF microscopy, owing to the use of invisible infra-red illumination, enables volumetric imaging of neuronal activity avoiding undesirable visual stimulation", "after": "excitation, employing near-infrared invisible light, provides unbiased investigation of neuronal circuit dynamics", "start_char_pos": 618, "end_char_pos": 775}, {"type": "R", "before": "(~ 1 Hz) by the signal to noise ratio achievable without sample photodamage. Here", "after": "by the signal-to-noise-ratio. Here,", "start_char_pos": 900, "end_char_pos": 981}, {"type": "D", "before": "custom-made", "after": null, "start_char_pos": 996, "end_char_pos": 1007}, {"type": "R", "before": "LSF microscope that overcomes this limit, being specifically designed to perform whole-brain cellular-resolution calcium imaging in zebrafish larvae quintuplicating previous volumetric acquisition frequency", "after": "LSFM setup designed for non-invasive imaging that enables quintuplicating state-of-the-art volumetric acquisition rate of the larval zebrafish brain", "start_char_pos": 1011, "end_char_pos": 1217}, {"type": "D", "before": ".", "after": null, "start_char_pos": 1225, "end_char_pos": 1226}, {"type": "D", "before": "...", "after": null, "start_char_pos": 1227, "end_char_pos": 1230}, {"type": "R", "before": "We employed this system to investigate, in real-time on a brain-wide scale, the onset and propagation of", "after": "while keeping low the laser intensity on the specimen. We applied our system to the study of pharmacologically-induced", "start_char_pos": 1249, "end_char_pos": 1353}, {"type": "D", "before": "as induced by the convulsant drug pentylenetetrazol (PTZ), avoiding detrimental visual stimulation on a highly susceptible system such as an epileptic brain.", "after": null, "start_char_pos": 1370, "end_char_pos": 1527}, {"type": "D", "before": "...", "after": null, "start_char_pos": 1528, "end_char_pos": 1531}, {"type": "R", "before": "In conclusion, the presented 2P LSF microscope design affords high spatio-temporal resolution while avoiding visual stimuli and allows unprecedented access to whole zebrafish brain epileptic dynamics", "after": "characterizing the spatial-temporal dynamics of pathological activity and describing for the first time the appearance of caudo-rostral ictal waves (CRIWs)", "start_char_pos": 1550, "end_char_pos": 1749}], "sents_char_pos": [0, 149, 370, 582, 777, 976, 1230, 1531]} {"doc_id": "2012.10006", "revision_depth": "1", "before_revision": "Multiple brain injury criteria (BIC) are developed to quickly quantify brain injury risks after head impacts. These BIC originated from different types of head impacts (e.g., sports and car crashes) are widely used in risk evaluation. However, the predictability of the BIC on different types of head impacts has not been evaluated. Physiologically, the brain strain is often considered the key parameter of brain injury. To evaluate the BIC's ability to predict brain strain across five datasets comprising different head impact subtypes , linear regression was used to model 95\\% maximum principal strain, 95\\% maximum principal strain at corpus callosum, and cumulative strain damage (15\\%) on 18 BIC . The results show significant differences in the relationship between BIC and brain strain across datasets, indicating the same BIC value may indicate different brain strain in different head impact subtypes . The accuracy of regression is generally decreasing if the BIC regression models are fit on a dataset with a different head impact subtype rather than on the dataset with the same subtype . Given this finding, this study raises concerns for applying BIC to predict the brain strain for head impacts different from the head impacts on which the BIC was developed.", "after_revision": "Multiple brain injury criteria (BIC) are developed to quickly quantify brain injury risks after head impacts. These BIC originated from different types of head impacts (e.g., sports and car crashes) are widely used in risk evaluation. However, the accuracy of using the BIC on brain injury risk estimation across different types of head impacts has not been evaluated. Physiologically, brain strain is often considered the key parameter of brain injury. To evaluate the BIC's risk estimation accuracy across five datasets comprising different head impact types , linear regression was used to model 95\\% maximum principal strain, 95\\% maximum principal strain at the corpus callosum, and cumulative strain damage (15\\%) on each of 18 BIC respectively . The results show a significant difference in the relationship between BIC and brain strain across datasets, indicating the same BIC value may suggest different brain strain in different head impact types . The accuracy of brain strain regression is generally decreasing if the BIC regression models are fit on a dataset with a different type of head impact rather than on the dataset with the same type . Given this finding, this study raises concerns for applying BIC to estimate the brain injury risks for head impacts different from the head impacts on which the BIC was developed.", "edit_actions": [{"type": "R", "before": "predictability of", "after": "accuracy of using", "start_char_pos": 248, "end_char_pos": 265}, {"type": "A", "before": null, "after": "brain injury risk estimation across", "start_char_pos": 277, "end_char_pos": 277}, {"type": "D", "before": "the", "after": null, "start_char_pos": 351, "end_char_pos": 354}, {"type": "R", "before": "ability to predict brain strain", "after": "risk estimation accuracy", "start_char_pos": 445, "end_char_pos": 476}, {"type": "R", "before": "subtypes", "after": "types", "start_char_pos": 531, "end_char_pos": 539}, {"type": "A", "before": null, "after": "the", "start_char_pos": 642, "end_char_pos": 642}, {"type": "A", "before": null, "after": "each of", "start_char_pos": 699, "end_char_pos": 699}, {"type": "A", "before": null, "after": "respectively", "start_char_pos": 707, "end_char_pos": 707}, {"type": "R", "before": "significant differences", "after": "a significant difference", "start_char_pos": 727, "end_char_pos": 750}, {"type": "R", "before": "indicate", "after": "suggest", "start_char_pos": 851, "end_char_pos": 859}, {"type": "R", "before": "subtypes", "after": "types", "start_char_pos": 908, "end_char_pos": 916}, {"type": "A", "before": null, "after": "brain strain", "start_char_pos": 935, "end_char_pos": 935}, {"type": "R", "before": "head impact subtype", "after": "type of head impact", "start_char_pos": 1038, "end_char_pos": 1057}, {"type": "R", "before": "subtype", "after": "type", "start_char_pos": 1099, "end_char_pos": 1106}, {"type": "R", "before": "predict the brain strain", "after": "estimate the brain injury risks", "start_char_pos": 1176, "end_char_pos": 1200}], "sents_char_pos": [0, 109, 234, 333, 422, 709, 918]} {"doc_id": "2012.10793", "revision_depth": "1", "before_revision": "We study {\\em online} active learning of homogeneous s-sparse halfspaces in R^d with adversarial noise \\mbox{%DIFAUXCMD kearns1992toward where the overall probability of a noisy label is constrained to be at most \\nu and the marginal distribution over unlabeled data is unchanged . Our main contribution is a state-of-the-art online active learning algorithm that achieves near-optimal attribute efficiency, label and sample complexity under mild distributional assumptions. In particular, under the conditions that the marginal distribution is isotropic log-concave and \\nu = \\Omega(\\epsilon), where \\epsilon \\in (0, 1) is the target error rate, we show that our algorithm PAC learns the underlying halfspace in polynomial time with near-optimal label complexity bound of O\\big( s \\cdot polylog( d, \\frac{1}{\\epsilon})\\big) and sample complexity bound of \\tilde{O}\\big( \\frac{s{\\epsilon} \\cdot polylog(d)} {\\epsilon} } \\big). Prior to this work, existing online algorithms designed for tolerating the adversarial noise are either subject to label complexity polynomial in d or \\frac{1}{\\epsilon}, or work under the restrictive uniform marginal distribution.\\tilde{O}\\big( {\\epsilon}) }\\big) \\tilde{O}\\big({\\epsilon} \\cdot polylog(d) }\\big) As an immediate corollary of our main result , we show that under the more challenging agnostic model \\mbox{%DIFAUXCMD \\cite{kearns1992toward }\\hspace{0pt}%DIFAUXCMD } where no assumption is made on the noise rate , our active learner achieves an error rate of O(OPT) + \\epsilon with the same running time and label and sample complexity, where OPT is the best possible error rate achievable by any homogeneous s-sparse halfspace. Our algorithm builds upon the celebrated Perceptron while leveraging novel localized sampling and semi-random gradient update to tolerate the adversarial noise. We believe that our algorithmic design and analysis are of independent interest, and may shed light on learning halfspaces with broader noise models .", "after_revision": "We study {\\em online} active learning of homogeneous halfspaces in R^d with adversarial noise where the overall probability of a noisy label is constrained to be at most \\nu . Our main contribution is a Perceptron-like online active learning algorithm that runs in polynomial time, and under the conditions that the marginal distribution is isotropic log-concave and \\nu = \\Omega(\\epsilon), where \\epsilon \\in (0, 1) is the target error rate, our algorithm PAC learns the underlying halfspace with near-optimal label complexity of O\\big( d \\cdot polylog( \\frac{1}{\\epsilon})\\big) and sample complexity of \\tilde{O}\\big( {\\epsilon} \\cdot polylog(d)} \\frac{d{\\epsilon} } \\big). Prior to this work, existing online algorithms designed for tolerating the adversarial noise are subject to either label complexity polynomial in \\frac{1}{\\epsilon}, or suboptimal noise tolerance, or restrictive marginal distributions. With the additional prior knowledge that the underlying halfspace is s-sparse, we obtain attribute-efficient label complexity of\\tilde{O}\\big( s \\cdot polylog(d, \\frac{1{\\epsilon}) }\\big) and sample complexity of\\tilde{O}\\big(\\frac{s{\\epsilon} \\cdot polylog(d) }\\big). As an immediate corollary , we show that under the }\\hspace{0pt}%DIFAUXCMD } agnostic model where no assumption is made on the noise rate \\nu , our active learner achieves an error rate of O(OPT) + \\epsilon with the same running time and label and sample complexity, where OPT is the best possible error rate achievable by any homogeneous halfspace .", "edit_actions": [{"type": "D", "before": "s-sparse", "after": null, "start_char_pos": 53, "end_char_pos": 61}, {"type": "D", "before": "\\mbox{%DIFAUXCMD kearns1992toward", "after": null, "start_char_pos": 103, "end_char_pos": 136}, {"type": "D", "before": "and the marginal distribution over unlabeled data is unchanged", "after": null, "start_char_pos": 217, "end_char_pos": 279}, {"type": "R", "before": "state-of-the-art", "after": "Perceptron-like", "start_char_pos": 309, "end_char_pos": 325}, {"type": "R", "before": "achieves near-optimal attribute efficiency, label and sample complexity under mild distributional assumptions. In particular, under", "after": "runs in polynomial time, and under", "start_char_pos": 364, "end_char_pos": 495}, {"type": "D", "before": "we show that", "after": null, "start_char_pos": 647, "end_char_pos": 659}, {"type": "D", "before": "in polynomial time", "after": null, "start_char_pos": 710, "end_char_pos": 728}, {"type": "D", "before": "bound", "after": null, "start_char_pos": 764, "end_char_pos": 769}, {"type": "R", "before": "s", "after": "d", "start_char_pos": 780, "end_char_pos": 781}, {"type": "D", "before": "d,", "after": null, "start_char_pos": 797, "end_char_pos": 799}, {"type": "D", "before": "bound", "after": null, "start_char_pos": 847, "end_char_pos": 852}, {"type": "D", "before": "\\frac{s", "after": null, "start_char_pos": 871, "end_char_pos": 878}, {"type": "A", "before": null, "after": "\\frac{d", "start_char_pos": 907, "end_char_pos": 907}, {"type": "R", "before": "either subject to", "after": "subject to either", "start_char_pos": 1024, "end_char_pos": 1041}, {"type": "D", "before": "d or", "after": null, "start_char_pos": 1073, "end_char_pos": 1077}, {"type": "R", "before": "work under the restrictive uniform marginal distribution.", "after": "suboptimal noise tolerance, or restrictive marginal distributions. With the additional prior knowledge that the underlying halfspace is s-sparse, we obtain attribute-efficient label complexity of", "start_char_pos": 1101, "end_char_pos": 1158}, {"type": "A", "before": null, "after": "s \\cdot polylog(d, \\frac{1", "start_char_pos": 1173, "end_char_pos": 1173}, {"type": "A", "before": null, "after": "and sample complexity of", "start_char_pos": 1192, "end_char_pos": 1192}, {"type": "A", "before": null, "after": "\\frac{s", "start_char_pos": 1206, "end_char_pos": 1206}, {"type": "A", "before": null, "after": ".", "start_char_pos": 1240, "end_char_pos": 1240}, {"type": "D", "before": "of our main result", "after": null, "start_char_pos": 1267, "end_char_pos": 1285}, {"type": "D", "before": "more challenging agnostic model \\mbox{%DIFAUXCMD \\cite{kearns1992toward", "after": null, "start_char_pos": 1311, "end_char_pos": 1382}, {"type": "A", "before": null, "after": "agnostic model", "start_char_pos": 1409, "end_char_pos": 1409}, {"type": "A", "before": null, "after": "\\nu", "start_char_pos": 1456, "end_char_pos": 1456}, {"type": "R", "before": "s-sparse halfspace. Our algorithm builds upon the celebrated Perceptron while leveraging novel localized sampling and semi-random gradient update to tolerate the adversarial noise. We believe that our algorithmic design and analysis are of independent interest, and may shed light on learning halfspaces with broader noise models", "after": "halfspace", "start_char_pos": 1654, "end_char_pos": 1983}], "sents_char_pos": [0, 281, 474, 926, 1158, 1184, 1673, 1834]} {"doc_id": "2012.11965", "revision_depth": "1", "before_revision": "We study the question of when we can answer a Conjunctive Query (CQ) with an ordering over the answers by constructing a structure for direct (random) access to the sorted list of answers, without actually materializing this list, so that the construction time is linear (or quasilinear ) in the size of the database. In the absence of answer ordering, such a construction has been devised for the task of enumerating query answers of free-connex acyclic CQs, so that the access time is logarithmic. Moreover, it follows from past results that within the class of CQs without self-joins, being free-connex acyclic is necessary for the existence of such a construction (under conventional assumptions in fine-grained complexity). In this work, we embark on the challenge of identifying the answer orderings that allow for ranked direct access with the above complexity guarantees. We begin with the class of lexicographic orderings and give a decidable characterization of the class of feasible such orderings for every CQ without self-joins. We then continue to the more general case of orderings by the sum of attribute scores. As it turns out, in this case ranked direct access is feasible only in trivial cases. Hence, to better understand the computational challenge at hand, we consider the more modest task of providing access to only one single answer (i.e., finding the answer at a given position) . We indeed achieve a quasilinear-time algorithm for a subset of the class of full CQs without self-joins, by adopting a solution of Frederickson and Johnson to the classic problem of selection over sorted matrices. We further prove that none of the other queries in this class admit such an algorithm.", "after_revision": "We study the question of when we can provide logarithmic-time direct access to the k-th answer to a Conjunctive Query (CQ) with a specified ordering over the answers , following a preprocessing step that constructs a data structure in time quasilinear in the size of the database. Specifically, we embark on the challenge of identifying the tractable answer orderings that allow for ranked direct access with such complexity guarantees. We begin with lexicographic orderings and give a decidable characterization (under conventional complexity assumptions) of the class of tractable lexicographic orderings for every CQ without self-joins. We then continue to the more general orderings by the sum of attribute weights and show for it that ranked direct access is tractable only in trivial cases. Hence, to better understand the computational challenge at hand, we consider the more modest task of providing access to only a single answer (i.e., finding the answer at a given position) - a task that we refer to as the selection problem . We indeed achieve a quasilinear-time algorithm for a subset of the class of full CQs without self-joins, by adopting a solution of Frederickson and Johnson to the classic problem of selection over sorted matrices. We further prove that none of the other queries in this class admit such an algorithm.", "edit_actions": [{"type": "R", "before": "answer", "after": "provide logarithmic-time direct access to the k-th answer to", "start_char_pos": 37, "end_char_pos": 43}, {"type": "R", "before": "an", "after": "a specified", "start_char_pos": 74, "end_char_pos": 76}, {"type": "R", "before": "by constructing a structure for direct (random) access to the sorted list of answers, without actually materializing this list, so that the construction time is linear (or quasilinear )", "after": ", following a preprocessing step that constructs a data structure in time quasilinear", "start_char_pos": 103, "end_char_pos": 288}, {"type": "R", "before": "In the absence of answer ordering, such a construction has been devised for the task of enumerating query answers of free-connex acyclic CQs, so that the access time is logarithmic. Moreover, it follows from past results that within the class of CQs without self-joins, being free-connex acyclic is necessary for the existence of such a construction (under conventional assumptions in fine-grained complexity). In this work,", "after": "Specifically,", "start_char_pos": 318, "end_char_pos": 742}, {"type": "A", "before": null, "after": "tractable", "start_char_pos": 789, "end_char_pos": 789}, {"type": "R", "before": "the above", "after": "such", "start_char_pos": 848, "end_char_pos": 857}, {"type": "D", "before": "the class of", "after": null, "start_char_pos": 895, "end_char_pos": 907}, {"type": "A", "before": null, "after": "(under conventional complexity assumptions)", "start_char_pos": 970, "end_char_pos": 970}, {"type": "R", "before": "feasible such", "after": "tractable lexicographic", "start_char_pos": 987, "end_char_pos": 1000}, {"type": "D", "before": "case of", "after": null, "start_char_pos": 1081, "end_char_pos": 1088}, {"type": "R", "before": "scores. As it turns out, in this case", "after": "weights and show for it that", "start_char_pos": 1123, "end_char_pos": 1160}, {"type": "R", "before": "feasible", "after": "tractable", "start_char_pos": 1185, "end_char_pos": 1193}, {"type": "R", "before": "one", "after": "a", "start_char_pos": 1343, "end_char_pos": 1346}, {"type": "A", "before": null, "after": "- a task that we refer to as the selection problem", "start_char_pos": 1408, "end_char_pos": 1408}], "sents_char_pos": [0, 317, 499, 728, 880, 1043, 1130, 1216, 1410, 1624]} {"doc_id": "2012.12803", "revision_depth": "1", "before_revision": "Recent work of Erlingsson, Feldman, Mironov, Raghunathan, Talwar, and Thakurta [EFMRTT19] demonstrates that random shuffling of input data amplifies differential privacy guarantees . Such amplification leads to substantially stronger privacy guarantees for systems in which data is contributed anonymously [BEMMRLRKTS17] and for the analysis of noisy stochastic gradient descent . We show that an \\varepsilon_0-locally differentially private algorithm, under shuffling with n users, amplifies to a (\\Theta ((1-e^{-\\varepsilon_0})\\frac{e^{\\varepsilon_0\\log(1/\\delta)}{n}}), \\delta) -central differential privacy guarantee . This significantly improves over previous work and achieves the asymptotically optimal dependence on \\varepsilon_0. Our result is based on a new approach that is simpler than previous work and extends to approximate differential privacy with nearly the same guarantees. Our work also yields an empirical method to derive tighter bounds on the central \\varepsilon and we show that it gets to within a small constant factor of the correct bound. As a direct corollary of our analysis we derive a simple and asymptotically optimal algorithm for discrete distribution estimation in the shuffle model of privacy CSUZZ19 .", "after_revision": "Recent work of Erlingsson, Feldman, Mironov, Raghunathan, Talwar, and Thakurta [EFMRTT19] demonstrates that random shuffling amplifies differential privacy guarantees of locally randomized data . Such amplification implies substantially stronger privacy guarantees for systems in which data is contributed anonymously [BEMMRLRKTS17] and has lead to significant interest in the shuffle model of privacy CSUZZ19,EFMRTT19 . We show that random shuffling of n data records that are input to \\varepsilon_0-differentially private local randomizers results in an (O ((1-e^{-\\varepsilon_0})\\frac{e^{\\varepsilon_0\\log(1/\\delta)}{n}}), \\delta) -differentially private algorithm . This significantly improves over previous work and achieves the asymptotically optimal dependence in \\varepsilon_0. Our result is based on a new approach that is simpler than previous work and extends to approximate differential privacy with nearly the same guarantees. Our work also yields an empirical method to derive tighter bounds the resulting \\varepsilon and we show that it gets to within a small constant factor of the optimal bound. As a direct corollary of our analysis , we derive a simple and asymptotically optimal algorithm for discrete distribution estimation in the shuffle model of privacy . We also observe that our result implies the first asymptotically optimal privacy analysis of noisy stochastic gradient descent that applies to sampling without replacement .", "edit_actions": [{"type": "D", "before": "of input data", "after": null, "start_char_pos": 125, "end_char_pos": 138}, {"type": "A", "before": null, "after": "of locally randomized data", "start_char_pos": 181, "end_char_pos": 181}, {"type": "R", "before": "leads to", "after": "implies", "start_char_pos": 203, "end_char_pos": 211}, {"type": "R", "before": "for the analysis of noisy stochastic gradient descent", "after": "has lead to significant interest in the shuffle model of privacy", "start_char_pos": 326, "end_char_pos": 379}, {"type": "A", "before": null, "after": "CSUZZ19,EFMRTT19", "start_char_pos": 380, "end_char_pos": 380}, {"type": "R", "before": "an \\varepsilon_0-locally differentially private algorithm, under shuffling with n users, amplifies to a (\\Theta", "after": "random shuffling of n data records that are input to \\varepsilon_0-differentially private local randomizers results in an (O", "start_char_pos": 396, "end_char_pos": 507}, {"type": "R", "before": "-central differential privacy guarantee", "after": "-differentially private algorithm", "start_char_pos": 583, "end_char_pos": 622}, {"type": "R", "before": "on", "after": "in", "start_char_pos": 723, "end_char_pos": 725}, {"type": "R", "before": "on the central", "after": "the resulting", "start_char_pos": 961, "end_char_pos": 975}, {"type": "R", "before": "correct", "after": "optimal", "start_char_pos": 1054, "end_char_pos": 1061}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1107, "end_char_pos": 1107}, {"type": "R", "before": "CSUZZ19", "after": ". We also observe that our result implies the first asymptotically optimal privacy analysis of noisy stochastic gradient descent that applies to sampling without replacement", "start_char_pos": 1233, "end_char_pos": 1240}], "sents_char_pos": [0, 183, 382, 624, 740, 894, 1068]} {"doc_id": "2012.14353", "revision_depth": "1", "before_revision": "Exponential growths of social media and micro-blogging sites not only provide platforms for empowering freedom of expressions and individual voices, but also enables people to express anti-social behavior like online harassment, cyberbullying, and hate speech. Numerous works have been proposed to utilize these data for social and anti-social behavior analysis, by predicting the contexts mostly for highly-resourced languages like English. However, some languages such as Bengali are under-resourced that lack of computational resources for natural language processing (NLP). In this paper, we propose an explainable approach for hate speech detection from under-resourced Bengali language, which we called DeepHateExplainer. In our approach, Bengali texts are first comprehensively preprocessed, before classifying them into political, personal, geopolitical, and religious hates, by employing neural ensemble of different transformer-based neural architectures (i.e., monolingual Bangla BERT-base, multilingual BERT-cased and uncased, and XLM-RoBERTa) , followed by identifying important terms with sensitivity analysis and layer-wise relevance propagation (LRP) to provide human-interpretable explanations. Evaluations against several machine learning ~ (linear and tree-based models) and deep neural networks (i.e., CNN, Bi-LSTM, and Conv-LSTM with word embeddings) baselines yield F1 scores of 84\\%, 90\\%, 88\\%, and 88\\%, for political, personal, geopolitical, and religious hates, respectively, during 3-fold cross-validation tests .", "after_revision": "The exponential growths of social media and micro-blogging sites not only provide platforms for empowering freedom of expression and individual voices, but also enables people to express anti-social behavior like online harassment, cyberbullying, and hate speech. Numerous works have been proposed to utilize the textual data for social and anti-social behavior analysis, by predicting the contexts mostly for highly-resourced languages like English. However, some languages are under-resourced , e.g., South Asian languages like Bengali, that lack computational resources for accurate natural language processing (NLP). In this paper, we propose an explainable approach for hate speech detection from the under-resourced Bengali language, which we called DeepHateExplainer. In our approach, Bengali texts are first comprehensively preprocessed, before classifying them into political, personal, geopolitical, and religious hates, by employing the neural ensemble method of different transformer-based neural architectures (i.e., monolingual Bangla BERT-base, multilingual BERT-cased / uncased, and XLM-RoBERTa) . Subsequently, important (most and least) terms are identified with sensitivity analysis and layer-wise relevance propagation (LRP) , before providing human-interpretable explanations. Finally, to measure the quality of the explanation (i.e., faithfulness), we compute the comprehensiveness and sufficiency. Evaluations against machine learning (linear and tree-based models) and deep neural networks (i.e., CNN, Bi-LSTM, and Conv-LSTM with word embeddings) baselines yield F1 scores of 84\\%, 90\\%, 88\\%, and 88\\%, for political, personal, geopolitical, and religious hates, respectively, outperforming both ML and DNN baselines .", "edit_actions": [{"type": "R", "before": "Exponential", "after": "The exponential", "start_char_pos": 0, "end_char_pos": 11}, {"type": "R", "before": "expressions", "after": "expression", "start_char_pos": 114, "end_char_pos": 125}, {"type": "R", "before": "these", "after": "the textual", "start_char_pos": 306, "end_char_pos": 311}, {"type": "D", "before": "such as Bengali", "after": null, "start_char_pos": 466, "end_char_pos": 481}, {"type": "R", "before": "that lack of", "after": ", e.g., South Asian languages like Bengali, that lack", "start_char_pos": 502, "end_char_pos": 514}, {"type": "A", "before": null, "after": "accurate", "start_char_pos": 543, "end_char_pos": 543}, {"type": "A", "before": null, "after": "the", "start_char_pos": 660, "end_char_pos": 660}, {"type": "R", "before": "neural ensemble", "after": "the neural ensemble method", "start_char_pos": 899, "end_char_pos": 914}, {"type": "R", "before": "and", "after": "/", "start_char_pos": 1028, "end_char_pos": 1031}, {"type": "R", "before": ", followed by identifying important terms", "after": ". Subsequently, important (most and least) terms are identified", "start_char_pos": 1058, "end_char_pos": 1099}, {"type": "R", "before": "to provide", "after": ", before providing", "start_char_pos": 1169, "end_char_pos": 1179}, {"type": "R", "before": "Evaluations against several machine learning ~", "after": "Finally, to measure the quality of the explanation (i.e., faithfulness), we compute the comprehensiveness and sufficiency. Evaluations against machine learning", "start_char_pos": 1214, "end_char_pos": 1260}, {"type": "R", "before": "during 3-fold cross-validation tests", "after": "outperforming both ML and DNN baselines", "start_char_pos": 1505, "end_char_pos": 1541}], "sents_char_pos": [0, 260, 441, 578, 729, 1213]} {"doc_id": "2012.15671", "revision_depth": "1", "before_revision": "It is well accepted that the choice of token vocabulary largely affects the performance of machine translation. However, due to expensive trial costs, most studies only conduct simple trials with dominant approaches (e.g BPE) and commonly used vocabulary sizes. In this paper, we find an exciting relation between an information-theoretic feature and BLEU scores. With thisobservation , we formulate the quest of vocabularization -- finding the best token dictionary with a proper size -- as an optimal transport problem.We then propose VOLT, a simple and efficient vocabularization solution without the full and costly trial training. We evaluate our approach on multiple machine translation tasks, including WMT-14 English-German translation, TED bilingual translation, and TED multilingual translation. Empirical results show that VOLT beats widely-used vocabularies on diverse scenarios . For example, VOLT achieves 70\\% vocabulary size reduction and 0.6 BLEU gain on English-German translation. Also, one advantage of VOLT lies in its low resource consumption. Compared to naive BPE-search, VOLT reduces the search time from 288 GPU hours to 0.5 CPU hours .", "after_revision": "The choice of token vocabulary affects the performance of machine translation. This paper aims to figure out what is a good vocabulary and whether one can find the optimal vocabulary without trial training. To answer these questions, we first provide an alternative understanding of the role of vocabulary from the perspective of information theory. Motivated by this , we formulate the quest of vocabularization -- finding the best token dictionary with a proper size -- as an optimal transport (OT) problem.We We propose VOLT, a simple and efficient solution without trial training. Empirical results show that VOLT outperforms widely-used vocabularies in diverse scenarios, including WMT-14 English-German and TED's 52 translation directions . For example, VOLT achieves 70\\% vocabulary size reduction and 0.5 BLEU gain on English-German translation. Also, compared to BPE-search, VOLT reduces the search time from 384 GPU hours to 30 GPU hours on English-German translation. Codes are available at URL .", "edit_actions": [{"type": "R", "before": "It is well accepted that the", "after": "The", "start_char_pos": 0, "end_char_pos": 28}, {"type": "D", "before": "largely", "after": null, "start_char_pos": 56, "end_char_pos": 63}, {"type": "R", "before": "However, due to expensive trial costs, most studies only conduct simple trials with dominant approaches (e.g BPE) and commonly used vocabulary sizes. In this paper, we find an exciting relation between an information-theoretic feature and BLEU scores. With thisobservation", "after": "This paper aims to figure out what is a good vocabulary and whether one can find the optimal vocabulary without trial training. To answer these questions, we first provide an alternative understanding of the role of vocabulary from the perspective of information theory. Motivated by this", "start_char_pos": 112, "end_char_pos": 384}, {"type": "A", "before": null, "after": "(OT)", "start_char_pos": 513, "end_char_pos": 513}, {"type": "R", "before": "then", "after": "We", "start_char_pos": 525, "end_char_pos": 529}, {"type": "R", "before": "vocabularization solution without the full and costly", "after": "solution without", "start_char_pos": 567, "end_char_pos": 620}, {"type": "D", "before": "We evaluate our approach on multiple machine translation tasks, including WMT-14 English-German translation, TED bilingual translation, and TED multilingual translation.", "after": null, "start_char_pos": 637, "end_char_pos": 806}, {"type": "R", "before": "beats", "after": "outperforms", "start_char_pos": 840, "end_char_pos": 845}, {"type": "R", "before": "on diverse scenarios", "after": "in diverse scenarios, including WMT-14 English-German and TED's 52 translation directions", "start_char_pos": 871, "end_char_pos": 891}, {"type": "R", "before": "0.6", "after": "0.5", "start_char_pos": 956, "end_char_pos": 959}, {"type": "R", "before": "one advantage of VOLT lies in its low resource consumption. Compared to naive", "after": "compared to", "start_char_pos": 1007, "end_char_pos": 1084}, {"type": "R", "before": "288", "after": "384", "start_char_pos": 1131, "end_char_pos": 1134}, {"type": "R", "before": "0.5 CPU hours", "after": "30 GPU hours on English-German translation. Codes are available at URL", "start_char_pos": 1148, "end_char_pos": 1161}], "sents_char_pos": [0, 111, 261, 363, 522, 636, 806, 893, 1000, 1066]} {"doc_id": "2012.15699", "revision_depth": "1", "before_revision": "Pre-trained language models (PLMs) fail miserably on adversarial attacks. To improve the robustness, adversarial data augmentation (ADA) has been widely adopted , which attempts to cover more search space of adversarial attacks by adding the adversarial examples during training. However, the number of adversarial examples added by ADA is extremely insufficient due to the enormously large search space. In this work, we propose a simple and effective method to cover much larger proportion of the attack search space, called Adversarial Data Augmentation with Mixup (MixADA ). Specifically, MixADA linearly interpolates the representations of pairs of training examples to form new virtual samples, which are more abundant and diverse than the discrete adversarial examples used in conventional ADA. Moreover, to evaluate the robustness of different models fairly , we adopt a challenging setup, which dynamically generates new adversarial examples for each model. In the text classification experiments of BERT and RoBERTa, MixADA achieves significant robustness gains under two strong adversarial attacks and alleviates the performance degradation of ADA on the original data. Our source codes will be released to support further explorations .", "after_revision": "Pretrained language models (PLMs) perform poorly under adversarial attacks. To improve the adversarial robustness, adversarial data augmentation (ADA) has been widely adopted to cover more search space of adversarial attacks by adding textual adversarial examples during training. However, the number of adversarial examples for text augmentation is still extremely insufficient due to the exponentially large attack search space. In this work, we propose a simple and effective method to cover a much larger proportion of the attack search space, called Adversarial and Mixup Data Augmentation (AMDA ). Specifically, AMDA linearly interpolates the representations of pairs of training samples to form new virtual samples, which are more abundant and diverse than the discrete text adversarial examples in conventional ADA. Moreover, to fairly evaluate the robustness of different models , we adopt a challenging evaluation setup, which generates a new set of adversarial examples targeting each model. In text classification experiments of BERT and RoBERTa, AMDA achieves significant robustness gains under two strong adversarial attacks and alleviates the performance degradation of ADA on the clean data. Our code is released at: URL .", "edit_actions": [{"type": "R", "before": "Pre-trained", "after": "Pretrained", "start_char_pos": 0, "end_char_pos": 11}, {"type": "R", "before": "fail miserably on", "after": "perform poorly under", "start_char_pos": 35, "end_char_pos": 52}, {"type": "A", "before": null, "after": "adversarial", "start_char_pos": 89, "end_char_pos": 89}, {"type": "D", "before": ", which attempts", "after": null, "start_char_pos": 162, "end_char_pos": 178}, {"type": "R", "before": "the", "after": "textual", "start_char_pos": 239, "end_char_pos": 242}, {"type": "R", "before": "added by ADA is", "after": "for text augmentation is still", "start_char_pos": 325, "end_char_pos": 340}, {"type": "R", "before": "enormously large", "after": "exponentially large attack", "start_char_pos": 375, "end_char_pos": 391}, {"type": "A", "before": null, "after": "a", "start_char_pos": 470, "end_char_pos": 470}, {"type": "R", "before": "Data Augmentation with Mixup (MixADA", "after": "and Mixup Data Augmentation (AMDA", "start_char_pos": 541, "end_char_pos": 577}, {"type": "R", "before": "MixADA", "after": "AMDA", "start_char_pos": 595, "end_char_pos": 601}, {"type": "R", "before": "examples", "after": "samples", "start_char_pos": 665, "end_char_pos": 673}, {"type": "R", "before": "adversarial examples used", "after": "text adversarial examples", "start_char_pos": 757, "end_char_pos": 782}, {"type": "A", "before": null, "after": "fairly", "start_char_pos": 817, "end_char_pos": 817}, {"type": "D", "before": "fairly", "after": null, "start_char_pos": 862, "end_char_pos": 868}, {"type": "A", "before": null, "after": "evaluation", "start_char_pos": 894, "end_char_pos": 894}, {"type": "R", "before": "dynamically generates new adversarial examples for", "after": "generates a new set of adversarial examples targeting", "start_char_pos": 908, "end_char_pos": 958}, {"type": "D", "before": "the", "after": null, "start_char_pos": 974, "end_char_pos": 977}, {"type": "R", "before": "MixADA", "after": "AMDA", "start_char_pos": 1031, "end_char_pos": 1037}, {"type": "R", "before": "original", "after": "clean", "start_char_pos": 1170, "end_char_pos": 1178}, {"type": "R", "before": "source codes will be released to support further explorations", "after": "code is released at: URL", "start_char_pos": 1189, "end_char_pos": 1250}], "sents_char_pos": [0, 73, 280, 405, 803, 970, 1184]} {"doc_id": "2012.15725", "revision_depth": "1", "before_revision": "The emphasis on optimal operations and efficiency has led to increased complexity in engineered systems. This in turn increases the vulnerability of the system . However, with the increasing frequency of extreme events, resilience has now become an important consideration. Resilience quantifies the ability of the system to absorb and recover from extreme conditions. Graph theory is a widely used framework for modeling complex engineered systems to evaluate their resilience to attacks. Most existing methods in resilience analysis are based on an iterative approach that explores each node/link of a graph . These methods suffer from high computational complexity and the resulting analysis is network specific. To address these challenges, we propose a graph neural network (GNN) based framework for approximating node resilience in large complex networks. The proposed framework defines a GNN model that learns the node rank on a small representative subset of nodes . Then, the trained model can be employed to predict the ranks of unseen nodes in similar types of graphs . The scalability of the framework is demonstrated through the prediction of node ranks in real-world graphs . The proposed approach is accurate in approximating the node resilience scores and offers a significant computational advantage over conventional approaches.", "after_revision": "Identifying critical nodes and links in graphs is a crucial task. These nodes/links typically represent critical elements/communication links that play a key role in a system's performance . However, a majority of the methods available in the literature on the identification of critical nodes/links are based on an iterative approach that explores each node/link of a graph at a time, repeating for all nodes/links in the graph. Such methods suffer from high computational complexity and the resulting analysis is also network-specific. To overcome these challenges, this article proposes a scalable and generic graph neural network (GNN) based framework for identifying critical nodes/links in large complex networks. The proposed framework defines a GNN based model that learns the node /link criticality score on a small representative subset of nodes /links. An appropriately trained model can be employed to predict the scores of unseen nodes /links in large graphs and consequently identify the most critical ones . The scalability of the framework is demonstrated through prediction of nodes/links scores in large scale synthetic and real-world networks . The proposed approach is fairly accurate in approximating the criticality scores and offers a significant computational advantage over conventional approaches.", "edit_actions": [{"type": "R", "before": "The emphasis on optimal operations and efficiency has led to increased complexity in engineered systems. This in turn increases the vulnerability of the system", "after": "Identifying critical nodes and links in graphs is a crucial task. These nodes/links typically represent critical elements/communication links that play a key role in a system's performance", "start_char_pos": 0, "end_char_pos": 159}, {"type": "R", "before": "with the increasing frequency of extreme events, resilience has now become an important consideration. Resilience quantifies the ability of the system to absorb and recover from extreme conditions. Graph theory is a widely used framework for modeling complex engineered systems to evaluate their resilience to attacks. Most existing methods in resilience analysis", "after": "a majority of the methods available in the literature on the identification of critical nodes/links", "start_char_pos": 171, "end_char_pos": 534}, {"type": "R", "before": ". These", "after": "at a time, repeating for all nodes/links in the graph. Such", "start_char_pos": 610, "end_char_pos": 617}, {"type": "R", "before": "network specific. To address", "after": "also network-specific. To overcome", "start_char_pos": 698, "end_char_pos": 726}, {"type": "R", "before": "we propose a", "after": "this article proposes a scalable and generic", "start_char_pos": 745, "end_char_pos": 757}, {"type": "R", "before": "approximating node resilience", "after": "identifying critical nodes/links", "start_char_pos": 805, "end_char_pos": 834}, {"type": "A", "before": null, "after": "based", "start_char_pos": 899, "end_char_pos": 899}, {"type": "R", "before": "rank", "after": "/link criticality score", "start_char_pos": 927, "end_char_pos": 931}, {"type": "R", "before": ". Then, the", "after": "/links. An appropriately", "start_char_pos": 974, "end_char_pos": 985}, {"type": "R", "before": "ranks", "after": "scores", "start_char_pos": 1031, "end_char_pos": 1036}, {"type": "R", "before": "in similar types of graphs", "after": "/links in large graphs and consequently identify the most critical ones", "start_char_pos": 1053, "end_char_pos": 1079}, {"type": "R", "before": "the prediction of node ranks in", "after": "prediction of nodes/links scores in large scale synthetic and", "start_char_pos": 1139, "end_char_pos": 1170}, {"type": "R", "before": "graphs", "after": "networks", "start_char_pos": 1182, "end_char_pos": 1188}, {"type": "A", "before": null, "after": "fairly", "start_char_pos": 1216, "end_char_pos": 1216}, {"type": "R", "before": "node resilience", "after": "criticality", "start_char_pos": 1247, "end_char_pos": 1262}], "sents_char_pos": [0, 104, 161, 273, 368, 489, 611, 715, 861, 975, 1081, 1190]} {"doc_id": "2012.15859", "revision_depth": "2", "before_revision": "Natural Language Processing (NLP) systems learn harmful societal biases that cause them to widely proliferate inequality as they are deployed in more and more situations. To address and combat this , the NLP community relies on a variety of metrics to identify and quantify bias in black-box modelsand to guide efforts at debiasing . Some of these metrics are intrinsic, and are measured in word embedding spaces, and some are extrinsic, which measure the bias present downstream in the tasks that the word embeddings are plugged into. This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both intrinsic and extrinsic bias across hundreds of trained models covering different tasks and experimental conditions and find that there is no reliable correlation between these metrics that holds in all scenarios across tasks and languages. We advise that efforts to debias embedding spaces be always also paired with measurement of downstream model bias, and suggest that that community increase effort into making downstream measurement more feasible via creation of additional challenge sets and annotated test data. We additionally release code, a new intrinsic metric, and an annotated test set for gender bias for hatespeech .", "after_revision": "Natural Language Processing (NLP) systems learn harmful societal biases that cause them to amplify inequality as they are deployed in more and more situations. To guide efforts at debiasing these systems , the NLP community relies on a variety of metrics that quantify bias in models . Some of these metrics are intrinsic, measuring bias in word embedding spaces, and some are extrinsic, measuring bias in downstream tasks that the word embeddings enable. Do these intrinsic and extrinsic metrics correlate with each other? We compare intrinsic and extrinsic metrics across hundreds of trained models covering different tasks and experimental conditions . Our results show no reliable correlation between these metrics that holds in all scenarios across tasks and languages. We urge researchers working on debiasing to focus on extrinsic measures of bias, and to make using these measures more feasible via creation of new challenge sets and annotated test data. To aid this effort, we release code, a new intrinsic metric, and an annotated test set focused on gender bias in hate speech .", "edit_actions": [{"type": "R", "before": "widely proliferate", "after": "amplify", "start_char_pos": 91, "end_char_pos": 109}, {"type": "R", "before": "address and combat this", "after": "guide efforts at debiasing these systems", "start_char_pos": 174, "end_char_pos": 197}, {"type": "R", "before": "to identify and", "after": "that", "start_char_pos": 249, "end_char_pos": 264}, {"type": "R", "before": "black-box modelsand to guide efforts at debiasing", "after": "models", "start_char_pos": 282, "end_char_pos": 331}, {"type": "R", "before": "and are measured", "after": "measuring bias", "start_char_pos": 371, "end_char_pos": 387}, {"type": "R", "before": "which measure the bias present downstream in the", "after": "measuring bias in downstream", "start_char_pos": 438, "end_char_pos": 486}, {"type": "R", "before": "are plugged into. This research examines whether easy-to-measure intrinsic metrics correlate well to real world extrinsic metrics . We measure both", "after": "enable. Do these intrinsic and extrinsic metrics correlate with each other? We compare", "start_char_pos": 518, "end_char_pos": 665}, {"type": "R", "before": "bias", "after": "metrics", "start_char_pos": 690, "end_char_pos": 694}, {"type": "R", "before": "and find that there is", "after": ". Our results show", "start_char_pos": 782, "end_char_pos": 804}, {"type": "R", "before": "advise that efforts to debias embedding spaces be always also paired with measurement of downstream model", "after": "urge researchers working on debiasing to focus on extrinsic measures of", "start_char_pos": 910, "end_char_pos": 1015}, {"type": "R", "before": "suggest that that community increase effort into making downstream measurement", "after": "to make using these measures", "start_char_pos": 1026, "end_char_pos": 1104}, {"type": "R", "before": "additional", "after": "new", "start_char_pos": 1135, "end_char_pos": 1145}, {"type": "R", "before": "We additionally", "after": "To aid this effort, we", "start_char_pos": 1186, "end_char_pos": 1201}, {"type": "R", "before": "for gender bias for hatespeech", "after": "focused on gender bias in hate speech", "start_char_pos": 1266, "end_char_pos": 1296}], "sents_char_pos": [0, 170, 535, 649, 906, 1185]} {"doc_id": "2101.00063", "revision_depth": "1", "before_revision": "Deep, heavily overparameterized language models such as BERT, XLNet and T5 have achieved impressive success in many NLP tasks. However, their high model complexity requires enormous computation resources and extremely long training time for both pre-training and fine-tuning. Many works have studied model compression on large NLP models, but only focus on reducing inference cost/time , while still requiring expensive training process. Other works use extremely large batch sizes to shorten the pre-training time at the expense of high demand for computation resources . In this paper, inspired by the Early-Bird Lottery Tickets studied for computer vision tasks, we propose EarlyBERT, a general computationally-efficient training algorithm applicable to both pre-training and fine-tuning of large-scale language models. We are the first to identify structured winning tickets in the early stage of BERT training , and use them for efficient training. Comprehensive pre-training and fine-tuning experiments on GLUE and SQuAD downstream tasks show that EarlyBERT easily achieves comparable performance to standard BERT with 35~45\\% less training time. ", "after_revision": "Heavily overparameterized language models such as BERT, XLNet and T5 have achieved impressive success in many NLP tasks. However, their high model complexity requires enormous computation resources and extremely long training time for both pre-training and fine-tuning. Many works have studied model compression on large NLP models, but only focusing on reducing inference time while still requiring an expensive training process. Other works use extremely large batch sizes to shorten the pre-training time , at the expense of higher computational resource demands . In this paper, inspired by the Early-Bird Lottery Tickets recently studied for computer vision tasks, we propose EarlyBERT, a general computationally-efficient training algorithm applicable to both pre-training and fine-tuning of large-scale language models. By slimming the self-attention and fully-connected sub-layers inside a transformer, we are the first to identify structured winning tickets in the early stage of BERT training . We apply those tickets towards efficient BERT training, and conduct comprehensive pre-training and fine-tuning experiments on GLUE and SQuAD downstream tasks . Our results show that EarlyBERT achieves comparable performance to standard BERT , with 35~45\\% less training time. Code is available at URL", "edit_actions": [{"type": "R", "before": "Deep, heavily", "after": "Heavily", "start_char_pos": 0, "end_char_pos": 13}, {"type": "R", "before": "focus", "after": "focusing", "start_char_pos": 348, "end_char_pos": 353}, {"type": "R", "before": "cost/time ,", "after": "time", "start_char_pos": 376, "end_char_pos": 387}, {"type": "A", "before": null, "after": "an", "start_char_pos": 410, "end_char_pos": 410}, {"type": "A", "before": null, "after": ",", "start_char_pos": 516, "end_char_pos": 516}, {"type": "R", "before": "high demand for computation resources", "after": "higher computational resource demands", "start_char_pos": 535, "end_char_pos": 572}, {"type": "A", "before": null, "after": "recently", "start_char_pos": 633, "end_char_pos": 633}, {"type": "R", "before": "We", "after": "By slimming the self-attention and fully-connected sub-layers inside a transformer, we", "start_char_pos": 826, "end_char_pos": 828}, {"type": "R", "before": ", and use them for efficient training. Comprehensive", "after": ". We apply those tickets towards efficient BERT training, and conduct comprehensive", "start_char_pos": 918, "end_char_pos": 970}, {"type": "A", "before": null, "after": ". Our results", "start_char_pos": 1047, "end_char_pos": 1047}, {"type": "D", "before": "easily", "after": null, "start_char_pos": 1068, "end_char_pos": 1074}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1124, "end_char_pos": 1124}, {"type": "A", "before": null, "after": "Code is available at URL", "start_char_pos": 1158, "end_char_pos": 1158}], "sents_char_pos": [0, 126, 275, 438, 574, 825, 956]} {"doc_id": "2101.00124", "revision_depth": "1", "before_revision": "The ability to capture complex linguistic structures and long-term dependencies among words in the passage is essential for many natural language understanding tasks. In relation extraction , dependency trees that contain rich syntactic clues have been widely used to help capture long-term dependencies in text . Graph neural networks (GNNs), one of the means to encode dependency graphs, has been shown effective in several prior works. However, relatively little attention has been paid to the receptive fields of GNNs, which can be crucial in tasks with extremely long text that go beyond single sentences and require discourse analysis . In this work, we leverage the idea of graph pooling and propose the Mirror Graph Convolution Network (MrGCN) , a GNN model with pooling-unpooling structures tailored to relation extraction . The pooling branch reduces the graph size and enables the GCN to obtain larger receptive fields within less layers; the unpooling branch restores the pooled graph to its original resolution such that token-level relation extraction can be performed . Experiments on two datasets demonstrate the effectiveness of our method, showing significant improvements over previous results .", "after_revision": "The ability to capture complex linguistic structures and long-term dependencies among words in the passage is essential for relation extraction (RE) tasks . Graph neural networks (GNNs), one of the means to encode dependency graphs, have been shown to be effective in prior works. However, relatively little attention has been paid to receptive fields of GNNs, which can be crucial for tasks with extremely long text that requires discourse understanding . In this work, we leverage the idea of graph pooling and propose the Mirror Graph Convolution Network , a GNN model with a pooling-unpooling structure tailored to RE tasks . The pooling branch reduces the graph size and enables the GNN to obtain larger receptive fields within fewer layers; the unpooling branch restores the pooled graph to its original resolution for token-level RE tasks . Experiments on two discourse-level relation extraction datasets demonstrate the effectiveness of our method, showing significant improvements over prior methods especially when modeling long-term dependencies is necessary. Moreover, we propose Clause Matching (CM), a novel graph pooling method that merges nodes based on dependency relations in graph. CM can largely reduce the graph size while retaining the main semantics of the input text .", "edit_actions": [{"type": "R", "before": "many natural language understanding tasks. In relation extraction , dependency trees that contain rich syntactic clues have been widely used to help capture long-term dependencies in text", "after": "relation extraction (RE) tasks", "start_char_pos": 124, "end_char_pos": 311}, {"type": "R", "before": "has been shown effective in several", "after": "have been shown to be effective in", "start_char_pos": 390, "end_char_pos": 425}, {"type": "D", "before": "the", "after": null, "start_char_pos": 493, "end_char_pos": 496}, {"type": "R", "before": "in", "after": "for", "start_char_pos": 544, "end_char_pos": 546}, {"type": "R", "before": "go beyond single sentences and require discourse analysis", "after": "requires discourse understanding", "start_char_pos": 583, "end_char_pos": 640}, {"type": "D", "before": "(MrGCN)", "after": null, "start_char_pos": 744, "end_char_pos": 751}, {"type": "A", "before": null, "after": "a", "start_char_pos": 771, "end_char_pos": 771}, {"type": "R", "before": "structures tailored to relation extraction", "after": "structure tailored to RE tasks", "start_char_pos": 790, "end_char_pos": 832}, {"type": "R", "before": "GCN", "after": "GNN", "start_char_pos": 893, "end_char_pos": 896}, {"type": "R", "before": "less", "after": "fewer", "start_char_pos": 938, "end_char_pos": 942}, {"type": "R", "before": "such that", "after": "for", "start_char_pos": 1025, "end_char_pos": 1034}, {"type": "R", "before": "relation extraction can be performed", "after": "RE tasks", "start_char_pos": 1047, "end_char_pos": 1083}, {"type": "A", "before": null, "after": "discourse-level relation extraction", "start_char_pos": 1105, "end_char_pos": 1105}, {"type": "R", "before": "previous results", "after": "prior methods especially when modeling long-term dependencies is necessary. Moreover, we propose Clause Matching (CM), a novel graph pooling method that merges nodes based on dependency relations in graph. CM can largely reduce the graph size while retaining the main semantics of the input text", "start_char_pos": 1198, "end_char_pos": 1214}], "sents_char_pos": [0, 166, 438, 642, 834, 950]} {"doc_id": "2101.01005", "revision_depth": "1", "before_revision": "This paper is focused on a rigorous variant of the shear strength reduction method (SSR) and the corresponding determination of safety factors. The SSR-based safety factor is defined as a solution of an optimization problem that is independent of the plastic flow rule and the space discretization. In case of nonassociative plasticity, a modified Davis approach is used . The optimization problem is analyzed and the corresponding duality between the static and kinematic principles is derived. For numerical solution, a regularization method is introduced and a relation between the original and regularized problems is derived. The regularization method is combined with the finite element method, mesh adaptivity and a damped Newton method. In-house codes in Matlab are used for implementation of this solution concept. Two slope stability problems are considered, one of which follows from analysis of a real slope. Softwares Plaxis and Comsol Multiphysics are used for comparison of the results.", "after_revision": "This paper is focused on the definition, analysis and numerical solution of a new optimization variant (OPT) of the shear strength reduction (SSR) problem with applications to slope stability problems. This new variant is derived on the basis of recent results by Tschuchnigg et al. 2015, where limit analysis and a modified Davis approach were used for approximation of the standard SSR method. The OPT-SSR method computes the factor of safety without performing an elasto-plastic analysis, similarly as in limit analysis. It is shown that this optimization problem is well-defined. Next, the duality between the static and kinematic principles of OPT-SSR is derived. For the numerical solution, a regularization method is introduced and analyzed. This method is combined with the finite element method, mesh adaptivity and a damped Newton method. In-house codes (Matlab) are used for the implementation of this solution concept. Finally, two slope stability problems are considered, one of which follows from analysis of a real slope. The softwares packages Plaxis and Comsol Multiphysics are used for comparison of the results.", "edit_actions": [{"type": "R", "before": "a rigorous variant", "after": "the definition, analysis and numerical solution of a new optimization variant (OPT)", "start_char_pos": 25, "end_char_pos": 43}, {"type": "D", "before": "method", "after": null, "start_char_pos": 76, "end_char_pos": 82}, {"type": "R", "before": "and the corresponding determination of safety factors. The SSR-based safety factor is defined as a solution of an optimization problem that is independent of the plastic flow rule and the space discretization. In case of nonassociative plasticity,", "after": "problem with applications to slope stability problems. This new variant is derived on the basis of recent results by Tschuchnigg et al. 2015, where limit analysis and", "start_char_pos": 89, "end_char_pos": 336}, {"type": "R", "before": "is used . The", "after": "were used for approximation of the standard SSR method. The OPT-SSR method computes the factor of safety without performing an elasto-plastic analysis, similarly as in limit analysis. It is shown that this", "start_char_pos": 363, "end_char_pos": 376}, {"type": "R", "before": "analyzed and the corresponding", "after": "well-defined. Next, the", "start_char_pos": 401, "end_char_pos": 431}, {"type": "A", "before": null, "after": "of OPT-SSR", "start_char_pos": 484, "end_char_pos": 484}, {"type": "A", "before": null, "after": "the", "start_char_pos": 501, "end_char_pos": 501}, {"type": "R", "before": "a relation between the original and regularized problems is derived. The regularization", "after": "analyzed. This", "start_char_pos": 564, "end_char_pos": 651}, {"type": "R", "before": "in Matlab", "after": "(Matlab)", "start_char_pos": 762, "end_char_pos": 771}, {"type": "A", "before": null, "after": "the", "start_char_pos": 785, "end_char_pos": 785}, {"type": "R", "before": "Two", "after": "Finally, two", "start_char_pos": 827, "end_char_pos": 830}, {"type": "R", "before": "Softwares", "after": "The softwares packages", "start_char_pos": 924, "end_char_pos": 933}], "sents_char_pos": [0, 143, 298, 372, 496, 632, 746, 826, 923]} {"doc_id": "2101.02153", "revision_depth": "1", "before_revision": "How do we decide the fair value of individual classifiers in an ensemble model? We introduce a new class of transferable utility cooperative games to answer this question. The players in ensemble games are pre-trained binary classifiers that collaborate in an ensemble to correctly label points from a dataset. We design Troupe a scalable algorithm that designates payoffs to individual models based on the Shapley value of those in the ensemble game. We show that the approximate Shapley value of classifiers in these games is an adequate measure for selecting a subgroup of highly predictive models . In addition, we introduce the Shapley entropy a new metric to quantify the heterogeneity of machine learning ensembles when it comes to model quality. We analytically prove that our Shapley value approximation algorithm is accurate and scales to large ensembles and big data. Experimental results on graph classification tasks establish that Troupe gives precise estimates of the Shapley value in ensemble games. We demonstrate that the Shapley value can be used for pruning large ensembles, show that complex classifiers have a prime role in correct and incorrect classification decisions, and provide evidence that adversarial models receive a low valuation .", "after_revision": "What is the value of an individual model in an ensemble of binary classifiers? We answer this question by introducing a class of transferable utility cooperative games calledensemble games. In machine learning ensembles, pre-trained models cooperate to make classification decisions. To quantify the importance of models in these ensemble games, we defineTroupe -- an efficient algorithm which allocates payoffs based on approximate Shapley values of the classifiers. We argue that the Shapley value of models in these games is an effective decision metric for choosing a high performing subset of models from the ensemble. Our analytical findings prove that our Shapley value estimation scheme is precise and scalable; its performance increases with size of the dataset and ensemble. Empirical results on real world graph classification tasks demonstrate that our algorithm produces high quality estimates of the Shapley value . We find that Shapley values can be utilized for ensemble pruning, and that adversarial models receive a low valuation . Complex classifiers are frequently found to be responsible for both correct and incorrect classification decisions .", "edit_actions": [{"type": "R", "before": "How do we decide the fair value of individual classifiers", "after": "What is the value of an individual model", "start_char_pos": 0, "end_char_pos": 57}, {"type": "R", "before": "model? We introduce a new", "after": "of binary classifiers? We answer this question by introducing a", "start_char_pos": 73, "end_char_pos": 98}, {"type": "R", "before": "to answer this question. The players in ensemble games are", "after": "called", "start_char_pos": 147, "end_char_pos": 205}, {"type": "A", "before": null, "after": "ensemble games", "start_char_pos": 205, "end_char_pos": 205}, {"type": "A", "before": null, "after": ". In machine learning ensembles,", "start_char_pos": 205, "end_char_pos": 205}, {"type": "R", "before": "binary classifiers that collaborate in an ensemble to correctly label points from a dataset. We design Troupe a scalable algorithm that designates payoffs to individual models based on the Shapley value of those in the ensemble game. We show that the approximate", "after": "models cooperate to make classification decisions. To quantify the importance of models in these ensemble games, we define", "start_char_pos": 218, "end_char_pos": 480}, {"type": "A", "before": null, "after": "Troupe", "start_char_pos": 480, "end_char_pos": 480}, {"type": "A", "before": null, "after": "-- an efficient algorithm which allocates payoffs based on approximate Shapley values of the classifiers. We argue that the", "start_char_pos": 481, "end_char_pos": 481}, {"type": "R", "before": "classifiers", "after": "models", "start_char_pos": 499, "end_char_pos": 510}, {"type": "R", "before": "adequate measure for selecting a subgroup of highly predictive models . In addition, we introduce the Shapley entropy a new metric to quantify the heterogeneity of machine learning ensembles when it comes to model quality. We analytically", "after": "effective decision metric for choosing a high performing subset of models from the ensemble. Our analytical findings", "start_char_pos": 532, "end_char_pos": 770}, {"type": "R", "before": "approximation algorithm is accurate and scales to large ensembles and big data. Experimental results on", "after": "estimation scheme is precise and scalable; its performance increases with size of the dataset and ensemble. Empirical results on real world", "start_char_pos": 800, "end_char_pos": 903}, {"type": "R", "before": "establish that Troupe gives precise", "after": "demonstrate that our algorithm produces high quality", "start_char_pos": 931, "end_char_pos": 966}, {"type": "R", "before": "in ensemble games. We demonstrate that the Shapley value can be used for pruning large ensembles, show that complex classifiers have a prime role in correct and incorrect classification decisions, and provide evidence", "after": ". We find that Shapley values can be utilized for ensemble pruning, and", "start_char_pos": 998, "end_char_pos": 1215}, {"type": "A", "before": null, "after": ". Complex classifiers are frequently found to be responsible for both correct and incorrect classification decisions", "start_char_pos": 1264, "end_char_pos": 1264}], "sents_char_pos": [0, 79, 171, 310, 451, 603, 754, 879, 1016]} {"doc_id": "2101.03280", "revision_depth": "1", "before_revision": "Node attributes are ubiquitous in real-world networks, whose fusion with graph topology raises new challenges for the detection and understanding of community structure. Due to their principled characterization and interpretation , probabilistic generative models (PGMs) have become the mainstream methods for community detection in attributed networks. Most existing PGMs require the attributes to be categorical or Gaussian distributed. A novel PGM is proposed here to overcome these limitations. For the generality of our model, we consider the impact of the distances between attributes on node popularity , whose description raises the model selection problem in statistical inference. We present a novel scheme to address this issue by analyzing the detectability of communities for our model , which is also a quantitative description on the effect of node attributes with respect to communities . With the model determined, an efficient algorithm is then developed to estimate the parameters and infer the communities. Extensive experiments have been conducted to validate our work from two aspects. First, the experiments on artificial networks verified the detectability condition for our model . Second, the comparison on various real-world datasets shows that our algorithm outperforms the competitive methods .", "after_revision": "As a fundamental structure in real-world networks, communities can be reflected by abundant node attributes with the fusion of graph topology. In attribute-aware community detection , probabilistic generative models (PGMs) have become the mainstream fusion method due to their principled characterization and interpretation. Here, we propose a novel PGM without imposing any distributional assumptions on attributes, which is superior to existing PGMs that require attributes to be categorical or Gaussian distributed. Based on the famous block model of graph structure, our model fuses the attribute by describing its effect on node popularity using an additional term. To characterize the effect quantitatively, we analyze the detectability of communities for the proposed model and then establish the requirements of the attribute-popularity term, which leads to a new scheme for the model selection problem in attribute-aware community detection . With the model determined, an efficient algorithm is developed to estimate the parameters and to infer the communities. The proposed method is validated from two aspects. First, the effectiveness of our algorithm is theoretically guaranteed by the detectability condition , whose correctness is verified by numerical experiments on artificial graphs . Second, extensive experiments show that our method outperforms the competing approaches on a variety of real-world networks .", "edit_actions": [{"type": "R", "before": "Node attributes are ubiquitous", "after": "As a fundamental structure", "start_char_pos": 0, "end_char_pos": 30}, {"type": "R", "before": "whose fusion with graph topology raises new challenges for the detection and understanding of community structure. Due to their principled characterization and interpretation", "after": "communities can be reflected by abundant node attributes with the fusion of graph topology. In attribute-aware community detection", "start_char_pos": 55, "end_char_pos": 229}, {"type": "R", "before": "methods for community detection in attributed networks. Most existing PGMs require the", "after": "fusion method due to their principled characterization and interpretation. Here, we propose a novel PGM without imposing any distributional assumptions on attributes, which is superior to existing PGMs that require", "start_char_pos": 298, "end_char_pos": 384}, {"type": "R", "before": "A novel PGM is proposed here to overcome these limitations. For the generality of our model, we consider the impact of the distances between attributes", "after": "Based on the famous block model of graph structure, our model fuses the attribute by describing its effect", "start_char_pos": 439, "end_char_pos": 590}, {"type": "R", "before": ", whose description raises the model selection problem in statistical inference. We present a novel scheme to address this issue by analyzing the", "after": "using an additional term. To characterize the effect quantitatively, we analyze the", "start_char_pos": 610, "end_char_pos": 755}, {"type": "R", "before": "our model , which is also a quantitative description on the effect of node attributes with respect to communities", "after": "the proposed model and then establish the requirements of the attribute-popularity term, which leads to a new scheme for the model selection problem in attribute-aware community detection", "start_char_pos": 789, "end_char_pos": 902}, {"type": "D", "before": "then", "after": null, "start_char_pos": 958, "end_char_pos": 962}, {"type": "A", "before": null, "after": "to", "start_char_pos": 1004, "end_char_pos": 1004}, {"type": "R", "before": "Extensive experiments have been conducted to validate our work", "after": "The proposed method is validated", "start_char_pos": 1028, "end_char_pos": 1090}, {"type": "R", "before": "experiments on artificial networks verified", "after": "effectiveness of our algorithm is theoretically guaranteed by", "start_char_pos": 1120, "end_char_pos": 1163}, {"type": "R", "before": "for our model", "after": ", whose correctness is verified by numerical experiments on artificial graphs", "start_char_pos": 1192, "end_char_pos": 1205}, {"type": "R", "before": "the comparison on various", "after": "extensive experiments show that our method outperforms the competing approaches on a variety of", "start_char_pos": 1216, "end_char_pos": 1241}, {"type": "R", "before": "datasets shows that our algorithm outperforms the competitive methods", "after": "networks", "start_char_pos": 1253, "end_char_pos": 1322}], "sents_char_pos": [0, 169, 353, 438, 498, 690, 904, 1027, 1108, 1207]} {"doc_id": "2101.04914", "revision_depth": "1", "before_revision": "We revisit the randomized incremental construction of the Trapezoidal Search DAG (TSD) for a set of{\\cal n non-crossing segments, e.g. edges from planar subdivisions. It is well known that this point location structure has {\\cal O}(n) expected size and {\\cal O} (n \\ln n) expected construction time. Our main result is an improved tail bound, with exponential decay, for the size of the TSD: There is a constant such that the probability for a TSD to exceed its expected size by more than this factor is at most 1/e^n.This yields improved bounds on the TSD construction and their maintenance.I.e. TSD construction takes with high probability {\\cal O}( n \\ln n) time and TSD size can be made worst case {\\cal O}(n) with an expected rebuild cost of {\\cal O}( 1). The proposed analysis technique also shows that the expected depth is {\\cal O}( \\ln n ), which partially solves a recent conjecture by\\emph{ [ Hemmer et al. that is used in the CGAL implementation of the TSD [ .", "after_revision": "The Randomized Incremental Construction (RIC) of search DAGs for point location in planar subdivisions, nearest-neighbor search in 2D points, and extreme point search in 3D convex hulls, are well known to take{\\cal O ( n \\log n) expected time for structures of {\\cal O}(n) expected size. Moreover, searching takes w.h.p. {\\cal O} (\\log n) comparisons in the first and w.h.p. {\\cal O}( \\log^2 n) comparisons in the latter two DAGs. However, the expected depth of the DAGs and high probability bounds for their size are unknown. Using a novel analysis technique, we show that the three DAGs have w.h.p. i) a size of {\\cal O}(n) , ii) a depth of {\\cal O}( \\log n), and iii) a construction time of {\\cal O}( n \\log n). One application of these new and improved results are\\emph{remarkably simple Las Vegas verifiers to obtain search DAGs with optimal worst-case bounds. This positively answers the conjectured logarithmic search cost in the DAG of Delaunay triangulations[Guibas et al.; ICALP 1990 and a conjecture on the depth of the DAG of Trapezoidal subdivisions Hemmer et al. ; ESA 2012 . It also shows that history-based RIC circumvents a lower bound on runtime tail estimates of conflict-graph RICs[Sen; STACS 2019 .", "edit_actions": [{"type": "R", "before": "We revisit the randomized incremental construction of the Trapezoidal Search DAG (TSD) for a set of", "after": "The Randomized Incremental Construction (RIC) of search DAGs for point location in planar subdivisions, nearest-neighbor search in 2D points, and extreme point search in 3D convex hulls, are well known to take", "start_char_pos": 0, "end_char_pos": 99}, {"type": "A", "before": null, "after": "O", "start_char_pos": 105, "end_char_pos": 105}, {"type": "A", "before": null, "after": "(", "start_char_pos": 106, "end_char_pos": 106}, {"type": "R", "before": "non-crossing segments, e.g. edges from planar subdivisions. It is well known that this point location structure has", "after": "\\log n) expected time for structures of", "start_char_pos": 109, "end_char_pos": 224}, {"type": "R", "before": "size and", "after": "size. Moreover, searching takes w.h.p.", "start_char_pos": 246, "end_char_pos": 254}, {"type": "R", "before": "(n \\ln n) expected construction time. Our main result is an improved tail bound, with exponential decay, for the size of the TSD: There is a constant such that the probability for a TSD to exceed its expected size by more than this factor is at most 1/e^n.This yields improved bounds on the TSD construction and their maintenance.I.e. TSD construction takes with high probability", "after": "(\\log n) comparisons in the first and w.h.p.", "start_char_pos": 264, "end_char_pos": 643}, {"type": "R", "before": "n \\ln n) time and TSD size can be made worst case", "after": "\\log^2 n) comparisons in the latter two DAGs. However, the expected depth of the DAGs and high probability bounds for their size are unknown. Using a novel analysis technique, we show that the three DAGs have w.h.p. i) a size of", "start_char_pos": 654, "end_char_pos": 703}, {"type": "R", "before": "with an expected rebuild cost", "after": ", ii) a depth", "start_char_pos": 716, "end_char_pos": 745}, {"type": "R", "before": "1). The proposed analysis technique also shows that the expected depth is", "after": "\\log n), and iii) a construction time of", "start_char_pos": 759, "end_char_pos": 832}, {"type": "R", "before": "\\ln n ), which partially solves a recent conjecture by", "after": "n \\log n). One application of these new and improved results are", "start_char_pos": 843, "end_char_pos": 897}, {"type": "A", "before": null, "after": "remarkably simple", "start_char_pos": 903, "end_char_pos": 903}, {"type": "A", "before": null, "after": "Las Vegas verifiers to obtain search DAGs with optimal worst-case bounds. This positively answers the conjectured logarithmic search cost in the DAG of Delaunay triangulations", "start_char_pos": 904, "end_char_pos": 904}, {"type": "A", "before": null, "after": "Guibas et al.; ICALP 1990", "start_char_pos": 905, "end_char_pos": 905}, {"type": "A", "before": null, "after": "and a conjecture on the depth of the DAG of Trapezoidal subdivisions", "start_char_pos": 906, "end_char_pos": 906}, {"type": "R", "before": "that is used in the CGAL implementation of the TSD", "after": "; ESA 2012", "start_char_pos": 921, "end_char_pos": 971}, {"type": "A", "before": null, "after": ". It also shows that history-based RIC circumvents a lower bound on runtime tail estimates of conflict-graph RICs", "start_char_pos": 972, "end_char_pos": 972}, {"type": "A", "before": null, "after": "Sen; STACS 2019", "start_char_pos": 973, "end_char_pos": 973}], "sents_char_pos": [0, 168, 301, 520, 594, 762]} {"doc_id": "2101.07395", "revision_depth": "1", "before_revision": "The computation of probability density functions (PDF) using approximate maps (surrogate models) is a building block in such diverse fields as forward uncertainty quantification (UQ), sampling algorithms, learning, and inverse problems. In these settings, the probability measure of interest is induced by an unknown map from a known probability space to the real line, i. e., the measure of interest is a pushforward of another known measure. In computation, we do not know the true map , but only an approximate one. In the field of UQ, the{\\em generalized Polynomial Chaos (gPC) method is widely popular and yields excellent approximations of the map and its moment . But can the pushforward PDF be approximated with spectral accuracy as well? In this paper, we prove the first results of this kind. We provide convergence rates for PDFs using colocation and Galerkin gPC methods in all dimensions , guaranteeing exponential rates for analytic maps . In one dimension, we provide more refined results with stronger convergence rates, as well as an alternative proof strategy based on optimal-transport techniques.", "after_revision": "The estimation of probability density functions (PDF) using approximate maps is a fundamental building block in computational probability. We consider forward problems in uncertainty quantification: the inputs or the parameters of an otherwise deterministic model are random with a known distribution. The scalar quantity of interest is a fixed function of the parameters, and can therefore be considered as a random variable as a well. Often, the quantity of interest map is not explicitly known, and so the computational problem is to find its ``right'' approximation (surrogate model). For the goal of approximating the{\\em moments of the quantity of interest, there is a developed body of research. One widely popular approach is generalized Polynomial Chaos (gPC) and its many variants, which approximate moments with spectral accuracy . But can the PDF of the quantity of interest be approximated with spectral accuracy ? This is not directly implied by spectrally accurate moment estimation. In this paper, we prove convergence rates for PDFs using collocation and Galerkin gPC methods with Legendre polynomials in all dimensions . In particular, exponential convergence of the densities is guaranteed for analytic quantities of interest . In one dimension, we provide more refined results with stronger convergence rates, as well as an alternative proof strategy based on optimal-transport techniques.", "edit_actions": [{"type": "R", "before": "computation", "after": "estimation", "start_char_pos": 4, "end_char_pos": 15}, {"type": "R", "before": "(surrogate models) is a", "after": "is a fundamental", "start_char_pos": 78, "end_char_pos": 101}, {"type": "R", "before": "such diverse fields as forward uncertainty quantification (UQ), sampling algorithms, learning, and inverse problems. In these settings, the probability measure of interest is induced by an unknown map from a known probability space to the real line, i. e., the measure", "after": "computational probability. We consider forward problems in uncertainty quantification: the inputs or the parameters of an otherwise deterministic model are random with a known distribution. The scalar quantity", "start_char_pos": 120, "end_char_pos": 388}, {"type": "R", "before": "pushforward of another known measure. In computation, we do not know the true map , but only an approximate one. In the field of UQ, the", "after": "fixed function of the parameters, and can therefore be considered as a random variable as a well. Often, the quantity of interest map is not explicitly known, and so the computational problem is to find its ``right'' approximation (surrogate model). For the goal of approximating the", "start_char_pos": 406, "end_char_pos": 542}, {"type": "A", "before": null, "after": "moments", "start_char_pos": 547, "end_char_pos": 547}, {"type": "A", "before": null, "after": "of the quantity of interest, there is a developed body of research. One widely popular approach is", "start_char_pos": 548, "end_char_pos": 548}, {"type": "R", "before": "method is widely popular and yields excellent approximations of the map and its moment", "after": "and its many variants, which approximate moments with spectral accuracy", "start_char_pos": 584, "end_char_pos": 670}, {"type": "R", "before": "pushforward PDF", "after": "PDF of the quantity of interest", "start_char_pos": 685, "end_char_pos": 700}, {"type": "R", "before": "as well?", "after": "? This is not directly implied by spectrally accurate moment estimation.", "start_char_pos": 740, "end_char_pos": 748}, {"type": "D", "before": "the first results of this kind. We provide", "after": null, "start_char_pos": 773, "end_char_pos": 815}, {"type": "R", "before": "colocation", "after": "collocation", "start_char_pos": 849, "end_char_pos": 859}, {"type": "A", "before": null, "after": "with Legendre polynomials", "start_char_pos": 885, "end_char_pos": 885}, {"type": "R", "before": ", guaranteeing exponential rates for analytic maps", "after": ". In particular, exponential convergence of the densities is guaranteed for analytic quantities of interest", "start_char_pos": 904, "end_char_pos": 954}], "sents_char_pos": [0, 236, 443, 518, 672, 748, 804, 956]} {"doc_id": "2101.07428", "revision_depth": "1", "before_revision": "A highly desirable property of networks is robustness to failures. Consider a metric space (X, d_X ] ), a graph H over X is a \\vartheta-reliable t-spanner if, for every set of failed vertices B\\subset X, there is a superset B^+\\supseteq B such that the induced subgraph H }} [ X\\setminus B ] preserves all the distances between points in X\\setminus B^+ up to a stretch factor t, while the expected size of B^+ is as most (1+\\vartheta)|B|. Such a spanner could withstand a catastrophe: failureof even{\\em 90\\\\%DIF < of the network. Buchin, Har-Peled, and Ol{\\'{a}}h [2019,2020], constructed very sparse reliable spanners with stretch 1+\\epsilon for Euclidean space using locality-sensitive orderings. Har-Peled and Ol{\\'{a}}h [2020] constructed reliable spanners for various non-Euclidean metric spaces using sparse covers. However, this second approach has an inherent dependency on the aspect ratio (a.k.a. spread) and gives sub-optimal stretch and sparsity parameters. Our contribution is twofold: 1) We construct a locality-sensitive ordering for doubling metrics with a small number of orderings. As a corollary, we obtain reliable spanners for doubling metrics matching the sparsity parameters of known reliable spanners for Euclidean space. 2) We introduce new types of locality-sensitive orderings suitable for non-Euclidean metrics and construct such orderings for various metric families. We then construct reliable spanners from the newly introduced locality-sensitive orderings via reliable 2-hop spanners for paths. The number of edges in our spanner has no dependency on the spread.\\end{abstract} %DIF > of the nodes fail. In a follow-up work, Har-Peled, Mendel, and Ol{\\'{a}}h [2021] constructed reliable spanners for general and topologically structured metrics. Their construction used a different approach, and is based on sparse covers. In this paper, we develop the theory of LSO's to non-Euclidean metrics by introducing new types of LSO's suitable for general and topologically structured metrics. We then construct such LSO's, as well as constructing considerably improved LSO's for doubling metrics. Afterwards, we use our new LSO's to construct reliable spanners with improved stretch and sparsity parameters. Most prominently, we construct \\tilde{O}(n)-size reliable spanners for trees and planar graphs with the optimal stretch of 2. Along the way to the construction of LSO's and reliable spanners, we introduce and construct ultrametric covers, and construct 2-hop reliable spanners for the line.", "after_revision": "Chan, Har-Peled, and Jones 2020] recently developed locality-sensitive ordering (LSO ), a new tool that allows one to reduce problems in the Euclidean space \\mathbb{R \\'{a}}h [ 2019,2020 ] used the LSO of Chan{\\em et al. to construct very sparsereliable spanners for the Euclidean space. A highly desirable feature of a reliable spanner is its ability to withstand a massive failure: the network remains functioning even if 90\\\\%DIF < of the network. Buchin, Har-Peled, and Ol{\\'{a}}h [2019,2020], constructed very sparse reliable spanners with stretch 1+\\epsilon for Euclidean space using locality-sensitive orderings. Har-Peled and Ol{\\'{a}}h [2020] constructed reliable spanners for various non-Euclidean metric spaces using sparse covers. However, this second approach has an inherent dependency on the aspect ratio (a.k.a. spread) and gives sub-optimal stretch and sparsity parameters. Our contribution is twofold: 1) We construct a locality-sensitive ordering for doubling metrics with a small number of orderings. As a corollary, we obtain reliable spanners for doubling metrics matching the sparsity parameters of known reliable spanners for Euclidean space. 2) We introduce new types of locality-sensitive orderings suitable for non-Euclidean metrics and construct such orderings for various metric families. We then construct reliable spanners from the newly introduced locality-sensitive orderings via reliable 2-hop spanners for paths. The number of edges in our spanner has no dependency on the spread.\\end{abstract} %DIF > of the nodes fail. In a follow-up work, Har-Peled, Mendel, and Ol{\\'{a}}h [2021] constructed reliable spanners for general and topologically structured metrics. Their construction used a different approach, and is based on sparse covers. In this paper, we develop the theory of LSO's to non-Euclidean metrics by introducing new types of LSO's suitable for general and topologically structured metrics. We then construct such LSO's, as well as constructing considerably improved LSO's for doubling metrics. Afterwards, we use our new LSO's to construct reliable spanners with improved stretch and sparsity parameters. Most prominently, we construct \\tilde{O}(n)-size reliable spanners for trees and planar graphs with the optimal stretch of 2. Along the way to the construction of LSO's and reliable spanners, we introduce and construct ultrametric covers, and construct 2-hop reliable spanners for the line.", "edit_actions": [{"type": "R", "before": "A highly desirable property of networks is robustness to failures. Consider a metric space (X, d_X", "after": "Chan, Har-Peled, and Jones", "start_char_pos": 0, "end_char_pos": 98}, {"type": "A", "before": null, "after": "2020", "start_char_pos": 99, "end_char_pos": 99}, {"type": "A", "before": null, "after": "recently developed locality-sensitive ordering (LSO", "start_char_pos": 101, "end_char_pos": 101}, {"type": "R", "before": "graph H over X is a \\vartheta-reliable t-spanner if, for every set of failed vertices B\\subset X, there is a superset B^+\\supseteq B such that the induced subgraph H", "after": "new tool that allows one to reduce problems in the Euclidean space \\mathbb{R", "start_char_pos": 107, "end_char_pos": 272}, {"type": "A", "before": null, "after": "\\'{a", "start_char_pos": 273, "end_char_pos": 273}, {"type": "A", "before": null, "after": "h", "start_char_pos": 275, "end_char_pos": 275}, {"type": "R", "before": "X\\setminus B", "after": "2019,2020", "start_char_pos": 278, "end_char_pos": 290}, {"type": "R", "before": "preserves all the distances between points in X\\setminus B^+ up to a stretch factor t, while the expected size of B^+ is as most (1+\\vartheta)|B|. Such a spanner could withstand a catastrophe: failureof even", "after": "used the LSO of Chan", "start_char_pos": 293, "end_char_pos": 500}, {"type": "A", "before": null, "after": "et al.", "start_char_pos": 505, "end_char_pos": 505}, {"type": "A", "before": null, "after": "to construct very sparse", "start_char_pos": 506, "end_char_pos": 506}, {"type": "A", "before": null, "after": "reliable spanners", "start_char_pos": 506, "end_char_pos": 506}, {"type": "A", "before": null, "after": "for the Euclidean space. A highly desirable feature of a reliable spanner is its ability to withstand a massive failure: the network remains functioning even if", "start_char_pos": 507, "end_char_pos": 507}], "sents_char_pos": [0, 66, 439, 534, 703, 826, 974, 1104, 1250, 1401, 1531, 1599, 1639, 1781, 1858, 2022, 2126, 2237]} {"doc_id": "2101.08750", "revision_depth": "1", "before_revision": "The QAnon conspiracy theory claims that a cabal of (literally) bloodthirsty politicians and media personalities are engaged in a war to destroy society. By interpreting cryptic \"drops\" of information from an anonymous insider calling themselves Q, adherents of the conspiracy theory believe that they are being led by Donald Trump in an active fight against this cabal. QAnon has been covered extensively by the media, as its adherents have been involved in multiple violent acts, including the January 6th, 2021 seditious storming of the US Capitol building. Nevertheless, we still have relatively little understanding of how the theory evolved and was spread on the Web, and the role played in that by multiple platforms. To address this gap, in this paper we study QAnon from the perspective of \"Q\" themself. Specifically, we build a dataset of 4,949 canonical Q drops collected from six \"aggregation sites,\" which curate and archive them from their original posting to anonymous and ephemeral image boards. We expose that these sites have a relatively low (overall) agreement, and thus at least some Q drops should probably be considered apocryphal. We then analyze the contents of the Q dropsthemselves, identifying topics of discussion , as well as finding statistically significant indications that drops were not authored by a single individual. Finally, we look at how posts on Reddit are used to disseminate Q drops to a wider audience . We find that dissemination was ( originally ) limited to a few sub-communities and that, while heavy-handed content moderation decisions have reduced the overall issue, the \"gospel\" of Q persists on Web communities .", "after_revision": "The QAnon conspiracy theory claims that a cabal of (literally) blood-thirsty politicians and media personalities are engaged in a war to destroy society. By interpreting cryptic \"drops\" of information from an anonymous insider calling themself Q, adherents of the conspiracy theory believe that Donald Trump is leading them in an active fight against this cabal. QAnon has been covered extensively by the media, as its adherents have been involved in multiple violent acts, including the January 6th, 2021 seditious storming of the US Capitol building. Nevertheless, we still have relatively little understanding of how the theory evolved and spread on the Web, and the role played in that by multiple platforms. To address this gap, we study QAnon from the perspective of \"Q\" themself. We build a dataset of 4,949 canonical Q drops collected from six \"aggregation sites,\" which curate and archive them from their original posting to anonymous and ephemeral image boards. We expose that these sites have a relatively low (overall) agreement, and thus at least some Q drops should probably be considered apocryphal. We then analyze the Q drops' contents to identify topics of discussion and find statistically significant indications that drops were not authored by a single individual. Finally, we look at how posts on Reddit are used to disseminate Q drops to wider audiences . We find that dissemination was ( initially ) limited to a few sub-communities and that, while heavy-handed moderation decisions have reduced the overall issue, the \"gospel\" of Q persists on the Web .", "edit_actions": [{"type": "R", "before": "bloodthirsty", "after": "blood-thirsty", "start_char_pos": 63, "end_char_pos": 75}, {"type": "R", "before": "themselves", "after": "themself", "start_char_pos": 234, "end_char_pos": 244}, {"type": "R", "before": "they are being led by Donald Trump", "after": "Donald Trump is leading them", "start_char_pos": 296, "end_char_pos": 330}, {"type": "D", "before": "was", "after": null, "start_char_pos": 650, "end_char_pos": 653}, {"type": "D", "before": "in this paper", "after": null, "start_char_pos": 745, "end_char_pos": 758}, {"type": "R", "before": "Specifically, we", "after": "We", "start_char_pos": 812, "end_char_pos": 828}, {"type": "R", "before": "contents of the Q dropsthemselves, identifying", "after": "Q drops' contents to identify", "start_char_pos": 1174, "end_char_pos": 1220}, {"type": "R", "before": ", as well as finding", "after": "and find", "start_char_pos": 1242, "end_char_pos": 1262}, {"type": "R", "before": "a wider audience", "after": "wider audiences", "start_char_pos": 1429, "end_char_pos": 1445}, {"type": "R", "before": "originally", "after": "initially", "start_char_pos": 1481, "end_char_pos": 1491}, {"type": "D", "before": "content", "after": null, "start_char_pos": 1556, "end_char_pos": 1563}, {"type": "R", "before": "Web communities", "after": "the Web", "start_char_pos": 1647, "end_char_pos": 1662}], "sents_char_pos": [0, 152, 369, 559, 723, 811, 1010, 1153, 1353, 1447]} {"doc_id": "2101.11300", "revision_depth": "2", "before_revision": "A k-apex graph is a graph with a subset of k vertices, called apices, whose removal makes the graph planar. We present an O(k ^2 n \\log^3 n )-time algorithm that, given a directed k-apex graph G with n vertices, arc capacities, a set of sources S and a set of sinksT, computes a maximum flow from S to T in G . This improves by a factor of k on the fastest algorithm previously known for this problem [ Borradaile et al., FOCS 2012, SICOMP 2017] . Our improvement is achieved by introducing a new variant of the push-relabel algorithm for computing maximum flows. We use our improved algorithm for maximum flow in k-apex graphs , together with additional insights, to obtain an O(k^3 n \\\\textrm{polylog (nC))-time algorithm for computing maximum integer flows in planar graphs with integer arc and vertex capacities bounded by C, and k sources and sinks. This improves by a factor of k^2 over the fastest algorithm previously known for this problem%DIFDELCMD < [%%% Wang, SODA 2019 .", "after_revision": "We give an O(k ^3 n \\polylog(nC) )-time algorithm for computing maximum integer flows in planar graphs with integer arc and vertex capacities bounded by C, and k sources and sinks . This improves by a factor of k ^2 over the fastest algorithm previously known for this problem [ Wang, SODA 2019 . The speedup is obtained by two independent ideas. First we replace an iterative procedure of Wang that uses k invocations of a maximum flow algorithm in a planar graph with k apices Borradaile et al., FOCS 2012, SICOMP 2017] , by an alternative procedure that only makes one invocation of the algorithm of Borradaile et al. Second, we introduce a new variant of the push-relabel algorithm of Goldberg and Tarjan and use it to find a maximum flow in the k-apex graphs \\textrm{ %DIFDELCMD < [%%% that arise in Wang's procedure, faster than the algorithm of Borradaile et al .", "edit_actions": [{"type": "R", "before": "A k-apex graph is a graph with a subset of k vertices, called apices, whose removal makes the graph planar. We present", "after": "We give", "start_char_pos": 0, "end_char_pos": 118}, {"type": "R", "before": "^2 n \\log^3 n", "after": "^3 n \\", "start_char_pos": 126, "end_char_pos": 139}, {"type": "A", "before": null, "after": "polylog", "start_char_pos": 139, "end_char_pos": 139}, {"type": "A", "before": null, "after": "(nC)", "start_char_pos": 139, "end_char_pos": 139}, {"type": "R", "before": "that, given a directed k-apex graph G with n vertices, arc capacities, a set of sources S and a set of sinksT, computes a maximum flow from S to T in G", "after": "for computing maximum integer flows in planar graphs with integer arc and vertex capacities bounded by C, and k sources and sinks", "start_char_pos": 157, "end_char_pos": 308}, {"type": "R", "before": "on", "after": "^2 over", "start_char_pos": 342, "end_char_pos": 344}, {"type": "A", "before": null, "after": "Wang, SODA 2019", "start_char_pos": 403, "end_char_pos": 403}, {"type": "A", "before": null, "after": ". The speedup is obtained by two independent ideas. First we replace an iterative procedure of Wang that uses k invocations of a maximum flow algorithm in a planar graph with k apices", "start_char_pos": 404, "end_char_pos": 404}, {"type": "R", "before": ". Our improvement is achieved by introducing", "after": ", by an alternative procedure that only makes one invocation of the algorithm of Borradaile et al. Second, we introduce", "start_char_pos": 448, "end_char_pos": 492}, {"type": "R", "before": "for computing maximum flows. We use our improved algorithm for", "after": "of Goldberg and Tarjan and use it to find a", "start_char_pos": 537, "end_char_pos": 599}, {"type": "A", "before": null, "after": "the", "start_char_pos": 616, "end_char_pos": 616}, {"type": "D", "before": ", together with additional insights, to obtain an O(k^3 n \\", "after": null, "start_char_pos": 631, "end_char_pos": 690}, {"type": "D", "before": "polylog", "after": null, "start_char_pos": 698, "end_char_pos": 705}, {"type": "D", "before": "(nC))-time algorithm for computing maximum integer flows in planar graphs with integer arc and vertex capacities bounded by C, and k sources and sinks. This improves by a factor of k^2 over the fastest algorithm previously known for this problem", "after": null, "start_char_pos": 706, "end_char_pos": 951}, {"type": "R", "before": "Wang, SODA 2019", "after": "that arise in Wang's procedure, faster than the algorithm of Borradaile et al", "start_char_pos": 969, "end_char_pos": 984}], "sents_char_pos": [0, 107, 449, 565, 857]} {"doc_id": "2101.11300", "revision_depth": "3", "before_revision": "We give an O(k^3 n \\polylog ( nC))-time algorithm for computing maximum integer flows in planar graphs with integer arc and vertex {\\em capacities bounded by C, and k sources and sinks. This improves by a factor of k^2 over the fastest algorithm previously known for this problem [Wang, SODA 2019]. The speedup is obtained by two independent ideas. First we replace an iterative procedure of Wang that uses k invocations of a maximum flow algorithm in a planar graph with k apices [Borradaile et al., FOCS 2012, SICOMP 2017], by an alternative procedure that only makes one invocation of the algorithm of Borradaile et al. Second, we introduce a new variant of the push-relabel algorithm of Goldberg and Tarjan and use it to find a maximum flow in the k-apex graphs that arise in Wang's procedure , faster than the algorithm of Borradaile et al .", "after_revision": "We give an O(k^3 n \\log n \\min(k,\\log^2 n) \\log^2( nC))-time algorithm for computing maximum integer flows in planar graphs with integer arc {\\em and vertex capacities bounded by C, and k sources and sinks. This improves by a factor of \\max(k^2,k\\log^2 n) over the fastest algorithm previously known for this problem [Wang, SODA 2019]. The speedup is obtained by two independent ideas. First we replace an iterative procedure of Wang that uses O(k) invocations of an O(k^3 n \\log^3 n)-time algorithm for maximum flow algorithm in a planar graph with k apices [Borradaile et al., FOCS 2012, SICOMP 2017], by an alternative procedure that only makes one invocation of the algorithm of Borradaile et al. Second, we show two alternatives for computing flows in the k-apex graphs that arise in our modification of Wang's procedure faster than the algorithm of Borradaile et al . In doing so, we introduce and analyze a sequential implementation of the parallel highest-distance push-relabel algorithm of Goldberg and Tarjan~ JACM 1988 .", "edit_actions": [{"type": "D", "before": "\\", "after": null, "start_char_pos": 19, "end_char_pos": 20}, {"type": "D", "before": "polylog", "after": null, "start_char_pos": 20, "end_char_pos": 27}, {"type": "R", "before": "(", "after": "\\log n \\min(k,\\log^2 n) \\log^2(", "start_char_pos": 28, "end_char_pos": 29}, {"type": "D", "before": "and vertex", "after": null, "start_char_pos": 120, "end_char_pos": 130}, {"type": "A", "before": null, "after": "and vertex", "start_char_pos": 136, "end_char_pos": 136}, {"type": "R", "before": "k^2", "after": "\\max(k^2,k\\log^2 n)", "start_char_pos": 216, "end_char_pos": 219}, {"type": "R", "before": "k invocations of a", "after": "O(k) invocations of an O(k^3 n \\log^3 n)-time algorithm for", "start_char_pos": 408, "end_char_pos": 426}, {"type": "R", "before": "introduce a new variant of the push-relabel algorithm of Goldberg and Tarjan and use it to find a maximum flow", "after": "show two alternatives for computing flows", "start_char_pos": 635, "end_char_pos": 745}, {"type": "A", "before": null, "after": "our modification of", "start_char_pos": 781, "end_char_pos": 781}, {"type": "D", "before": ",", "after": null, "start_char_pos": 799, "end_char_pos": 800}, {"type": "A", "before": null, "after": ". In doing so, we introduce and analyze a sequential implementation of the parallel highest-distance push-relabel algorithm of Goldberg and Tarjan~", "start_char_pos": 847, "end_char_pos": 847}, {"type": "A", "before": null, "after": "JACM 1988", "start_char_pos": 848, "end_char_pos": 848}], "sents_char_pos": [0, 186, 299, 349, 623]} {"doc_id": "2101.12158", "revision_depth": "2", "before_revision": "We study full acyclic join queries with general join predicates that involve conjunctions and disjunctions of inequalities , focusing on ranked enumeration where the answers are returned incrementally in an order dictated by a given ranking function. Our approach offers strong time and space complexity guarantees in the standard RAM model of computation, getting surprisingly close to those of equi-joins. With n denoting the number of tuples in the database, we guarantee that for every value of k, the k top-ranked answers are returned in \\mathcal{O (n polylog n + k k) time and \\mathcal{O n + k) space . This is within a polylogarithmic factor of the best-known guarantee for equi-joins and even \\mathcal{O}(n+k), the time it takes to look at the input and output k answers . The key ingredient is an \\mathcal{O}(n \\operatorname{polylog} n)-size factorized representation of the query output, which is constructed on-the-fly for a given query and database. As a side benefit, our techniques are also applicable to unranked enumeration (where answers can be returned in any order) for joins with inequalities, returning k answers in \\mathcal{O(n }%DIFDELCMD < \\operatorname{polylog} %%% n + k). This guarantee improves over the state of the art for large values of k. In an experimental study , we show that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice .", "after_revision": "We study theta-joins in general and join predicates with conjunctions and disjunctions of inequalities in particular , focusing on ranked enumeration where the answers are returned incrementally in an order dictated by a given ranking function. Our approach achieves strong time and space complexity properties: with n denoting the number of tuples in the database, we guarantee for acyclic full join queries with inequality conditions that for every value of k, the k top-ranked answers are returned in O (n polylog n + k \\log k) time . This is within a polylogarithmic factor of the best known complexity for equi-joins and even of \\mathcal{O}(n+k), the time it takes to look at the input and return k answers in any order. Our guarantees extend to join queries with selections and many types of projections, such as the so-called free-connex queries. Remarkably, they hold even when the entire output is of size n^\\ell for a join of \\ell relations. The key ingredient is a novel \\mathcal{O}(n \\operatorname{polylog} n)-size factorized representation of the query output, which is constructed on-the-fly for a given query and database. (n }%DIFDELCMD < \\operatorname{polylog} %%% In addition to providing the first non-trivial theoretical guarantees beyond equi-joins, we show in an experimental study that our ranked-enumeration approach is also memory-efficient and fast in practice, beating the running time of state-of-the-art database systems by orders of magnitude .", "edit_actions": [{"type": "R", "before": "full acyclic join queries with general join predicates that involve", "after": "theta-joins in general and join predicates with", "start_char_pos": 9, "end_char_pos": 76}, {"type": "A", "before": null, "after": "in particular", "start_char_pos": 123, "end_char_pos": 123}, {"type": "R", "before": "offers", "after": "achieves", "start_char_pos": 265, "end_char_pos": 271}, {"type": "R", "before": "guarantees in the standard RAM model of computation, getting surprisingly close to those of equi-joins. With", "after": "properties: with", "start_char_pos": 305, "end_char_pos": 413}, {"type": "A", "before": null, "after": "for acyclic full join queries with inequality conditions", "start_char_pos": 476, "end_char_pos": 476}, {"type": "R", "before": "\\mathcal{O", "after": "O", "start_char_pos": 545, "end_char_pos": 555}, {"type": "A", "before": null, "after": "\\log", "start_char_pos": 573, "end_char_pos": 573}, {"type": "D", "before": "and \\mathcal{O", "after": null, "start_char_pos": 582, "end_char_pos": 596}, {"type": "D", "before": "n + k) space", "after": null, "start_char_pos": 597, "end_char_pos": 609}, {"type": "R", "before": "best-known guarantee", "after": "best known complexity", "start_char_pos": 659, "end_char_pos": 679}, {"type": "A", "before": null, "after": "of", "start_char_pos": 704, "end_char_pos": 704}, {"type": "R", "before": "output k answers .", "after": "return k answers in any order. Our guarantees extend to join queries with selections and many types of projections, such as the so-called free-connex queries. Remarkably, they hold even when the entire output is of size n^\\ell for a join of \\ell relations.", "start_char_pos": 766, "end_char_pos": 784}, {"type": "R", "before": "an", "after": "a novel", "start_char_pos": 807, "end_char_pos": 809}, {"type": "D", "before": "As a side benefit, our techniques are also applicable to unranked enumeration (where answers can be returned in any order) for joins with inequalities, returning k answers in \\mathcal{O", "after": null, "start_char_pos": 966, "end_char_pos": 1151}, {"type": "R", "before": "n + k). This guarantee improves over the state of the art for large values of k. In", "after": "In addition to providing the first non-trivial theoretical guarantees beyond equi-joins, we show in", "start_char_pos": 1195, "end_char_pos": 1278}, {"type": "D", "before": ", we show", "after": null, "start_char_pos": 1301, "end_char_pos": 1310}, {"type": "R", "before": "not only theoretically interesting, but also fast and", "after": "also", "start_char_pos": 1351, "end_char_pos": 1404}, {"type": "R", "before": "in practice", "after": "and fast in practice, beating the running time of state-of-the-art database systems by orders of magnitude", "start_char_pos": 1422, "end_char_pos": 1433}], "sents_char_pos": [0, 251, 408, 611, 784, 965, 1202, 1275]} {"doc_id": "2101.12262", "revision_depth": "1", "before_revision": "A new class of measures of bivariate tail dependence is proposed, which is defined as a limit of a measure of concordance of the underlying copula restricted to the tail region of interest. The proposed tail dependence measures include tail dependence coefficients as special cases, but capture the extremal relationship between random variables not only along the diagonal but also along all the angles weighted by the so-called tail generating measure. As a result, the proposed tail dependence measures overcome the issue that the tail dependence coefficients underestimate the extent of extreme co-movements. We also consider the so-called maximal and minimal tail dependence measures , defined as the maximum and minimum of the tail dependence measures among all tail generating measures for a given copula. It turns out that the minimal tail dependence measure coincides with the tail dependence coefficient, and the maximal tail dependencemeasure overestimates the degree of extreme co-movements. We investigate properties, representations and examples of the proposed tail dependence measures , and their performance is demonstrated in a series of numerical experiments. For fair assessment of tail dependence and stability of estimation under small sample size, we support the use of tail dependence measures weighted over all angles compared with maximal and minimal ones .", "after_revision": "A new class of measures of bivariate tail dependence called tail concordance measures (TCMs) is proposed, which is defined as the limit of a measure of concordance of the underlying copula restricted to the tail region of interest. TCMs captures the extremal relationship between random variables not only along the diagonal but also along all angles weighted by a tail generating measure. Axioms of tail dependence measures are introduced, and TCMs are shown to characterize linear tail dependence measures . The infimum and supremum of TCMs over all generating measures are considered to investigate the issue of under- and overestimation of the degree of extreme co-movements. The infimum is shown to be attained by the classical tail dependence coefficient, and thus the classical notion always underestimates the degree of tail dependence. A formula for the supremum TCM is derived and shown to overestimate the degree of extreme co-movements. Estimators of the proposed measures are studied , and their performance is demonstrated in numerical experiments. For a fair assessment of tail dependence and stability of the estimation under small sample sizes, TCMs weighted over all angles are suggested, with tail Spearman's rho and tail Gini's gamma being interesting novel special cases of TCMs .", "edit_actions": [{"type": "A", "before": null, "after": "called tail concordance measures (TCMs)", "start_char_pos": 53, "end_char_pos": 53}, {"type": "R", "before": "a", "after": "the", "start_char_pos": 87, "end_char_pos": 88}, {"type": "R", "before": "The proposed tail dependence measures include tail dependence coefficients as special cases, but capture", "after": "TCMs captures", "start_char_pos": 191, "end_char_pos": 295}, {"type": "D", "before": "the", "after": null, "start_char_pos": 394, "end_char_pos": 397}, {"type": "R", "before": "the so-called", "after": "a", "start_char_pos": 417, "end_char_pos": 430}, {"type": "R", "before": "As a result, the proposed tail dependence measures overcome the issue that the tail dependence coefficients underestimate the extent of extreme co-movements. We also consider the so-called maximal and minimal", "after": "Axioms of", "start_char_pos": 456, "end_char_pos": 664}, {"type": "R", "before": ", defined as the maximum and minimum of the", "after": "are introduced, and TCMs are shown to characterize linear", "start_char_pos": 690, "end_char_pos": 733}, {"type": "R", "before": "among all tail generating measures for a given copula. It turns out that the minimal tail dependence measure coincides with the tail dependence", "after": ". The infimum and supremum of TCMs over all generating measures are considered to investigate the issue of under- and overestimation of the degree of extreme co-movements. The infimum is shown to be attained by the classical tail dependence", "start_char_pos": 759, "end_char_pos": 902}, {"type": "R", "before": "the maximal tail dependencemeasure overestimates the", "after": "thus the classical notion always underestimates the degree of tail dependence. A formula for the supremum TCM is derived and shown to overestimate the", "start_char_pos": 920, "end_char_pos": 972}, {"type": "R", "before": "We investigate properties, representations and examples", "after": "Estimators", "start_char_pos": 1005, "end_char_pos": 1060}, {"type": "R", "before": "tail dependence measures", "after": "measures are studied", "start_char_pos": 1077, "end_char_pos": 1101}, {"type": "D", "before": "a series of", "after": null, "start_char_pos": 1145, "end_char_pos": 1156}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1184, "end_char_pos": 1184}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1237, "end_char_pos": 1237}, {"type": "R", "before": "size, we support the use of tail dependence measures", "after": "sizes, TCMs", "start_char_pos": 1268, "end_char_pos": 1320}, {"type": "R", "before": "compared with maximal and minimal ones", "after": "are suggested, with tail Spearman's rho and tail Gini's gamma being interesting novel special cases of TCMs", "start_char_pos": 1346, "end_char_pos": 1384}], "sents_char_pos": [0, 190, 455, 613, 813, 1004, 1179]} {"doc_id": "2102.00247", "revision_depth": "2", "before_revision": "In this work, a robust and efficient text-to-speech system, named Triple M , is proposed for large-scale online application. The key components of Triple M are: 1) A seq2seq model with multi-guidance attention which obtains stable feature generation and robust long sentence synthesis ability by learning from the guidance attention mechanisms . Multi-guidance attention improves the robustness and naturalness of long sentence synthesis without any in-domain performance loss or online service modification. Compared with the our best result obtained by using single attention mechanism (GMM-based attention ), the word error rate of long sentence synthesis decreases by 23.5\\%when multi-guidance attention mechanism is applied . 2) A efficient multi-band multi-time LPCNet , which reduces the computational complexity of LPCNet through combining multi-band and multi-time strategies ( from 2.8 to 1.0 GFLOP ). Due to these strategies, the vocoder speed is increased by 2.75x on a single CPU without much MOS degradatiaon (4.57 vs. 4.45) .", "after_revision": "In this work, a robust and efficient text-to-speech (TTS) synthesis system named Triple M is proposed for large-scale online application. The key components of Triple M are: 1) A sequence-to-sequence model adopts a novel multi-guidance attention to transfer complementary advantages from guiding attention mechanisms to the basic attention mechanism without in-domain performance loss and online service modification. Compared with single attention mechanism , multi-guidance attention not only brings better naturalness to long sentence synthesis, but also reduces the word error rate by 26.8\\% . 2) A new efficient multi-band multi-time vocoder framework , which reduces the computational complexity from 2.8 to 1.0 GFLOP and speeds up LPCNet by 2.75x on a single CPU .", "edit_actions": [{"type": "R", "before": "system,", "after": "(TTS) synthesis system", "start_char_pos": 52, "end_char_pos": 59}, {"type": "D", "before": ",", "after": null, "start_char_pos": 75, "end_char_pos": 76}, {"type": "R", "before": "seq2seq model with", "after": "sequence-to-sequence model adopts a novel", "start_char_pos": 166, "end_char_pos": 184}, {"type": "R", "before": "which obtains stable feature generation and robust long sentence synthesis ability by learning from the guidance attention mechanisms . Multi-guidance attention improves the robustness and naturalness of long sentence synthesis without any", "after": "to transfer complementary advantages from guiding attention mechanisms to the basic attention mechanism without", "start_char_pos": 210, "end_char_pos": 449}, {"type": "R", "before": "or", "after": "and", "start_char_pos": 477, "end_char_pos": 479}, {"type": "D", "before": "the our best result obtained by using", "after": null, "start_char_pos": 523, "end_char_pos": 560}, {"type": "R", "before": "(GMM-based attention ),", "after": ", multi-guidance attention not only brings better naturalness to long sentence synthesis, but also reduces", "start_char_pos": 588, "end_char_pos": 611}, {"type": "R", "before": "of long sentence synthesis decreases by 23.5\\%when multi-guidance attention mechanism is applied", "after": "by 26.8\\%", "start_char_pos": 632, "end_char_pos": 728}, {"type": "A", "before": null, "after": "new", "start_char_pos": 736, "end_char_pos": 736}, {"type": "R", "before": "LPCNet", "after": "vocoder framework", "start_char_pos": 769, "end_char_pos": 775}, {"type": "D", "before": "of LPCNet through combining multi-band and multi-time strategies (", "after": null, "start_char_pos": 821, "end_char_pos": 887}, {"type": "R", "before": "). Due to these strategies, the vocoder speed is increased", "after": "and speeds up LPCNet", "start_char_pos": 910, "end_char_pos": 968}, {"type": "D", "before": "without much MOS degradatiaon (4.57 vs. 4.45)", "after": null, "start_char_pos": 994, "end_char_pos": 1039}], "sents_char_pos": [0, 124, 508, 912]} {"doc_id": "2102.01909", "revision_depth": "1", "before_revision": "The use of Bidirectional Encoder Representations from Transformers (BERT) models for different natural language processing (NLP) tasks, and for sentiment analysis in particular, has become very popular in recent years and not in vain. The use of social media is being constantly on the rise. Its impact on all areas of our lives is almost inconceivable. Researches show that social media nowadays serves as one of the main tools where people freely express their ideas, opinions, and emotions. During the current Covid-19 pandemic, the role of social media as a tool to resonate opinions and emotions, became even more prominent. This paper introduces HeBERT and HebEMO. HeBERT is a transformer-based model for modern Hebrew text . Hebrew is considered a Morphological Rich Language (MRL) , with unique characteristics that pose a great challenge in developing appropriate Hebrew NLP models . Analyzing multiple specifications of the BERT architecture, we come up with a language model that outperforms all existing Hebrew alternatives on multiple language tasks. HebEMO is a tool that uses HeBERT to detect polarity and extract emotions from Hebrew user-generated content (UGC), which was trained on a unique Covid-19 related dataset that we collected and annotated for this study. Data collection and annotation followed an innovative iterative semi-supervised process that aimed to maximize predictability. HebEMO yielded a high performance of weighted average F1-score = 0.96 for polarity classification. Emotion detection reached an F1-score of 0.78-0.97 , with the exception of \\textit{surprise , which the model failed to capture (F1 = 0.41). These results are better than the best-reported performance, even when compared to the English language .", "after_revision": " This paper introduces HeBERT and HebEMO. HeBERT is a Transformer-based model for modern Hebrew text , which relies on a BERT (Bidirectional Encoder Representations for Transformers) architecture. BERT has been shown to outperform alternative architectures in sentiment analysis, and is suggested to be particularly appropriate for MRLs . Analyzing multiple BERT specifications, we find that while model complexity correlates with high performance on language tasks that aim to understand terms in a sentence, a more-parsimonious model better captures the sentiment of entire sentence. Either way, out BERT-based language model outperforms all existing Hebrew alternatives on all common language tasks. HebEMO is a tool that uses HeBERT to detect polarity and extract emotions from Hebrew UGC. HebEMO is trained on a unique Covid-19-related UGC dataset that we collected and annotated for this study. Data collection and annotation followed an active learning procedure that aimed to maximize predictability. We show that HebEMO yields a high F1-score of 0.96 for polarity classification. Emotion detection reaches F1-scores of 0.78-0.97 for various target emotions , with the exception of \\textit{surprise , which the model failed to capture (F1 = 0.41). These results are better than the best-reported performance, even among English-language models of emotion detection .", "edit_actions": [{"type": "D", "before": "The use of Bidirectional Encoder Representations from Transformers (BERT) models for different natural language processing (NLP) tasks, and for sentiment analysis in particular, has become very popular in recent years and not in vain. The use of social media is being constantly on the rise. Its impact on all areas of our lives is almost inconceivable. Researches show that social media nowadays serves as one of the main tools where people freely express their ideas, opinions, and emotions. During the current Covid-19 pandemic, the role of social media as a tool to resonate opinions and emotions, became even more prominent.", "after": null, "start_char_pos": 0, "end_char_pos": 629}, {"type": "R", "before": "transformer-based", "after": "Transformer-based", "start_char_pos": 683, "end_char_pos": 700}, {"type": "R", "before": ". Hebrew is considered a Morphological Rich Language (MRL) , with unique characteristics that pose a great challenge in developing appropriate Hebrew NLP models", "after": ", which relies on a BERT (Bidirectional Encoder Representations for Transformers) architecture. BERT has been shown to outperform alternative architectures in sentiment analysis, and is suggested to be particularly appropriate for MRLs", "start_char_pos": 730, "end_char_pos": 890}, {"type": "R", "before": "specifications of the BERT architecture, we come up with a language model that", "after": "BERT specifications, we find that while model complexity correlates with high performance on language tasks that aim to understand terms in a sentence, a more-parsimonious model better captures the sentiment of entire sentence. Either way, out BERT-based language model", "start_char_pos": 912, "end_char_pos": 990}, {"type": "R", "before": "multiple", "after": "all common", "start_char_pos": 1039, "end_char_pos": 1047}, {"type": "R", "before": "user-generated content (UGC), which was", "after": "UGC. HebEMO is", "start_char_pos": 1150, "end_char_pos": 1189}, {"type": "R", "before": "Covid-19 related", "after": "Covid-19-related UGC", "start_char_pos": 1210, "end_char_pos": 1226}, {"type": "R", "before": "innovative iterative semi-supervised process", "after": "active learning procedure", "start_char_pos": 1326, "end_char_pos": 1370}, {"type": "R", "before": "HebEMO yielded a high performance of weighted average", "after": "We show that HebEMO yields a high", "start_char_pos": 1410, "end_char_pos": 1463}, {"type": "R", "before": "=", "after": "of", "start_char_pos": 1473, "end_char_pos": 1474}, {"type": "R", "before": "reached an F1-score", "after": "reaches F1-scores", "start_char_pos": 1527, "end_char_pos": 1546}, {"type": "A", "before": null, "after": "for various target emotions", "start_char_pos": 1560, "end_char_pos": 1560}, {"type": "R", "before": "surprise", "after": "surprise", "start_char_pos": 1593, "end_char_pos": 1601}, {"type": "R", "before": "when compared to the English language", "after": "among English-language models of emotion detection", "start_char_pos": 1717, "end_char_pos": 1754}], "sents_char_pos": [0, 234, 291, 353, 493, 629, 670, 731, 1063, 1282, 1409, 1508, 1650]} {"doc_id": "2102.02959", "revision_depth": "1", "before_revision": "To develop a high throughput multi-label annotator for body Computed Tomography (CT) reports that can be applied to a variety of URLans, and cases. First, we used a dictionary approach to develop a rule-based algorithm (RBA) for extraction of disease labels from radiology text reports. We targeted URLan systems (lungs/pleura, liver/gallbladder, kidneys/ureters) with four diseases per system based on their prevalence in our dataset. To expand the algorithm beyond pre-defined keywords, an attention-guided recurrent neural network (RNN) was trained using the RBA-extracted labels to classify the reports as being positive for one or more diseases or normal for URLan system. Confounding effects on model performance were evaluated using random or pre-trained embedding as well as different sizes of training datasets. Performance was evaluated using the receiver operating characteristic (ROC) area under the curve (AUC) against 2,158 manually obtained labels. Our model extracted disease labels from 261,229 radiology reports of 112,501 unique subjects. Pre-trained models outperformed random embedding across all diseases. As the training dataset size was reduced, performance was robust except for a few diseases with relatively small number of cases. Pre-trained Classification AUCs achieved > 0.95 for all five disease outcomes across all URLan systems. Our label-extracting pipeline was able to encompass a variety of cases and diseases by generalizing beyond strict rules with exceptional accuracy. As a framework, this model can be easily adapted to enable automated labeling of hospital-scale medical data sets for training image-based disease classifiers.", "after_revision": "Purpose: To develop high throughput multi-label annotators for body (chest, abdomen, and pelvis) Computed Tomography (CT) reports that can be applied across a variety of URLans, and disease states. Approach: We used a dictionary approach to develop rule-based algorithms (RBA) for extraction of disease labels from radiology text reports. We targeted URLan systems (lungs/pleura, liver/gallbladder, kidneys/ureters) with four diseases per system based on their prevalence in our dataset. To expand the algorithms beyond pre-defined keywords, attention-guided recurrent neural networks (RNN) were trained using the RBA-extracted labels to classify reports as being positive for one or more diseases or normal for URLan system. Confounding effects on model performance were evaluated using random initialization or pre-trained embedding as well as different sizes of training datasets. Performance was evaluated using the receiver operating characteristic (ROC) area under the curve (AUC) against 2,158 manually obtained labels. Results: Our models extracted disease labels from 261,229 radiology reports of 112,501 unique subjects. Pre-trained models outperformed random initialization across all diseases. As the training dataset size was reduced, performance was robust except for a few diseases with relatively small number of cases. Pre-trained classification AUCs achieved > 0.95 for all five disease outcomes across all URLan systems. Conclusions: Our label-extracting pipeline was able to encompass a variety of cases and diseases by generalizing beyond strict rules with exceptional accuracy. This method can be easily adapted to enable automated labeling of hospital-scale medical data sets for training image-based disease classifiers.", "edit_actions": [{"type": "R", "before": "To develop a", "after": "Purpose: To develop", "start_char_pos": 0, "end_char_pos": 12}, {"type": "R", "before": "annotator for body", "after": "annotators for body (chest, abdomen, and pelvis)", "start_char_pos": 41, "end_char_pos": 59}, {"type": "R", "before": "to", "after": "across", "start_char_pos": 113, "end_char_pos": 115}, {"type": "R", "before": "cases. First, we", "after": "disease states. Approach: We", "start_char_pos": 141, "end_char_pos": 157}, {"type": "D", "before": "a", "after": null, "start_char_pos": 196, "end_char_pos": 197}, {"type": "R", "before": "algorithm", "after": "algorithms", "start_char_pos": 209, "end_char_pos": 218}, {"type": "R", "before": "algorithm", "after": "algorithms", "start_char_pos": 450, "end_char_pos": 459}, {"type": "D", "before": "an", "after": null, "start_char_pos": 489, "end_char_pos": 491}, {"type": "R", "before": "network", "after": "networks", "start_char_pos": 526, "end_char_pos": 533}, {"type": "R", "before": "was", "after": "were", "start_char_pos": 540, "end_char_pos": 543}, {"type": "D", "before": "the", "after": null, "start_char_pos": 595, "end_char_pos": 598}, {"type": "A", "before": null, "after": "initialization", "start_char_pos": 747, "end_char_pos": 747}, {"type": "R", "before": "Our model", "after": "Results: Our models", "start_char_pos": 965, "end_char_pos": 974}, {"type": "R", "before": "embedding", "after": "initialization", "start_char_pos": 1098, "end_char_pos": 1107}, {"type": "R", "before": "Classification", "after": "classification", "start_char_pos": 1271, "end_char_pos": 1285}, {"type": "A", "before": null, "after": "Conclusions:", "start_char_pos": 1363, "end_char_pos": 1363}, {"type": "R", "before": "As a framework, this model", "after": "This method", "start_char_pos": 1511, "end_char_pos": 1537}], "sents_char_pos": [0, 147, 286, 435, 677, 821, 964, 1058, 1128, 1258, 1362, 1510]} {"doc_id": "2102.04882", "revision_depth": "1", "before_revision": "Face masks have been widely used as a protective measure against COVID-19. However, pre-pandemic experimental studies have produced mixed results regarding their effectiveness against respiratory viruses , leading to confusion over whether masks protect the wearer, or only those with whom the wearer interacts . Such confusion may have contributed URLanizations such as the WHO and CDC initially not recommending that the general public wear masks. Here , we show that studies that did not find surgical masks to be effective were under-powered to such an extent that even if masks were 100\\% effective, the studies in question would still have been unlikely to find a statistically significant effect. Thus, such studies should not be interpreted as providing evidence against masks. We also provide a framework for understanding the effect of masks on the probability of infection for single and repeated exposures. The framework demonstrates that the impact of wearing a mask more frequently compounds super-linearly , as can the impact of both the susceptible and infected individual wearing a mask. This work shows that current research is consistent with recommendations for using masks at a population level in regions in which there is transmission of COVID-19, and that nonlinear effects and statistical considerations regarding the percentage of exposures for which the mask is worn must be taken into account when designing empirical studies and interpreting their results.", "after_revision": "Face masks have been widely used as a protective measure against COVID-19. However, pre-pandemic empirical studies have produced mixed statistical results on the effectiveness of masks against respiratory viruses . The implications of the studies' recognized limitations have not been quantitatively and statistically analyzed , leading to confusion regarding the effectiveness of masks . Such confusion may have contributed URLanizations such as the WHO and CDC initially not recommending that the general public wear masks. Here we show that when the adherence to mask-usage guidelines is taken into account, the empirical evidence indicates that masks prevent disease transmission: all studies we analyzed that did not find surgical masks to be effective were under-powered to such an extent that even if masks were 100\\% effective, the studies in question would still have been unlikely to find a statistically significant effect. We also provide a framework for understanding the effect of masks on the probability of infection for single and repeated exposures. The framework demonstrates that more frequently wearing a mask provides super-linearly compounding protection, as does both the susceptible and infected individual wearing a mask. This work shows (1) that both theoretical and empirical evidence is consistent with masks protecting against respiratory infections and (2) that nonlinear effects and statistical considerations regarding the percentage of exposures for which masks are worn must be taken into account when designing empirical studies and interpreting their results.", "edit_actions": [{"type": "R", "before": "experimental", "after": "empirical", "start_char_pos": 97, "end_char_pos": 109}, {"type": "R", "before": "results regarding their effectiveness", "after": "statistical results on the effectiveness of masks", "start_char_pos": 138, "end_char_pos": 175}, {"type": "A", "before": null, "after": ". The implications of the studies' recognized limitations have not been quantitatively and statistically analyzed", "start_char_pos": 204, "end_char_pos": 204}, {"type": "R", "before": "over whether masks protect the wearer, or only those with whom the wearer interacts", "after": "regarding the effectiveness of masks", "start_char_pos": 228, "end_char_pos": 311}, {"type": "D", "before": ",", "after": null, "start_char_pos": 456, "end_char_pos": 457}, {"type": "R", "before": "studies", "after": "when the adherence to mask-usage guidelines is taken into account, the empirical evidence indicates that masks prevent disease transmission: all studies we analyzed", "start_char_pos": 471, "end_char_pos": 478}, {"type": "D", "before": "Thus, such studies should not be interpreted as providing evidence against masks.", "after": null, "start_char_pos": 705, "end_char_pos": 786}, {"type": "R", "before": "the impact of", "after": "more frequently", "start_char_pos": 952, "end_char_pos": 965}, {"type": "R", "before": "more frequently compounds", "after": "provides", "start_char_pos": 981, "end_char_pos": 1006}, {"type": "R", "before": ", as can the impact of", "after": "compounding protection, as does", "start_char_pos": 1022, "end_char_pos": 1044}, {"type": "R", "before": "that current research", "after": "(1) that both theoretical and empirical evidence", "start_char_pos": 1122, "end_char_pos": 1143}, {"type": "R", "before": "recommendations for using masks at a population level in regions in which there is transmission of COVID-19, and", "after": "masks protecting against respiratory infections and (2)", "start_char_pos": 1163, "end_char_pos": 1275}, {"type": "R", "before": "the mask is", "after": "masks are", "start_char_pos": 1378, "end_char_pos": 1389}], "sents_char_pos": [0, 74, 313, 450, 704, 786, 919, 1105]} {"doc_id": "2102.05633", "revision_depth": "1", "before_revision": "In order for a robot to explore an unknown environment autonomously , it must account for uncertainty in sensor measurements, hazard assessment, localization, and motion execution. Making decisions for maximal reward in a stochastic setting requires learning values and constructing policies over a belief space, i.e., probability distribution of the robot-world state. Value learning over belief spaces suffer from computational challenges in high-dimensional spaces, such as large spatial environments and long temporal horizons for exploration. At the same time, it should be adaptive and resilient to disturbances at run time in order to ensure the robot's safety, as required in many real-world applications . This work proposes a scalable value learning framework, PLGRIM (Probabilistic Local and Global Reasoning on Information roadMaps), that bridges the gap between (i) local, risk-aware resiliency and (ii) global, reward-seeking mission objectives. By leveraging hierarchical belief space planners with information-rich graph structures, PLGRIM can address large-scale exploration problems while providing locally near-optimal coverage plans. PLGRIM is a step toward enabling belief space planners on physical robots operating in unknown and complex environments. We validate our proposed framework with a high-fidelity dynamic simulation in diverse environments and with physical hardware, Boston Dynamics' Spot robot, in a lava tube .", "after_revision": "In order for an autonomous robot to efficiently explore an unknown environment , it must account for uncertainty in sensor measurements, hazard assessment, localization, and motion execution. Making decisions for maximal reward in a stochastic setting requires value learning and policy construction over a belief space, i.e., probability distribution over all possible robot-world states. However, belief space planning in a large spatial environment over long temporal horizons suffers from severe computational challenges. Moreover, constructed policies must safely adapt to unexpected changes in the belief at runtime . This work proposes a scalable value learning framework, PLGRIM (Probabilistic Local and Global Reasoning on Information roadMaps), that bridges the gap between (i) local, risk-aware resiliency and (ii) global, reward-seeking mission objectives. Leveraging hierarchical belief space planners with information-rich graph structures, PLGRIM addresses large-scale exploration problems while providing locally near-optimal coverage plans. We validate our proposed framework with high-fidelity dynamic simulations in diverse environments and on physical robots in Martian-analog lava tubes .", "edit_actions": [{"type": "R", "before": "a robot to", "after": "an autonomous robot to efficiently", "start_char_pos": 13, "end_char_pos": 23}, {"type": "D", "before": "autonomously", "after": null, "start_char_pos": 55, "end_char_pos": 67}, {"type": "R", "before": "learning values and constructing policies", "after": "value learning and policy construction", "start_char_pos": 250, "end_char_pos": 291}, {"type": "R", "before": "of the", "after": "over all possible", "start_char_pos": 344, "end_char_pos": 350}, {"type": "R", "before": "state. Value learning over belief spaces suffer from computational challenges in high-dimensional spaces, such as large spatial environments and", "after": "states. However, belief space planning in a large spatial environment over", "start_char_pos": 363, "end_char_pos": 507}, {"type": "R", "before": "for exploration. At the same time, it should be adaptive and resilient to disturbances at run time in order to ensure the robot's safety, as required in many real-world applications", "after": "suffers from severe computational challenges. Moreover, constructed policies must safely adapt to unexpected changes in the belief at runtime", "start_char_pos": 531, "end_char_pos": 712}, {"type": "R", "before": "By leveraging", "after": "Leveraging", "start_char_pos": 960, "end_char_pos": 973}, {"type": "R", "before": "can address", "after": "addresses", "start_char_pos": 1056, "end_char_pos": 1067}, {"type": "D", "before": "PLGRIM is a step toward enabling belief space planners on physical robots operating in unknown and complex environments.", "after": null, "start_char_pos": 1154, "end_char_pos": 1274}, {"type": "D", "before": "a", "after": null, "start_char_pos": 1315, "end_char_pos": 1316}, {"type": "R", "before": "simulation", "after": "simulations", "start_char_pos": 1339, "end_char_pos": 1349}, {"type": "R", "before": "with physical hardware, Boston Dynamics' Spot robot, in a lava tube", "after": "on physical robots in Martian-analog lava tubes", "start_char_pos": 1378, "end_char_pos": 1445}], "sents_char_pos": [0, 180, 369, 547, 714, 959, 1153, 1274]} {"doc_id": "2102.10754", "revision_depth": "1", "before_revision": "Kirigami, the art of paper cutting, has become the subject of study in mechanical metamaterials in recent years. The basic building blocks of any kirigami structures are repetitive deployable patterns , the design of which has to date largely relied on inspirations from art, nature, and intuition, embedded in a choice of the underlying pattern symmetry . Here we complement these approaches by clarifying some of the connections between kirigami patterns and symmetry in terms of the wallpaper groups, the set of seventeen plane symmetry groups that fully characterize the space of periodic tilings of the plane. We start by showing that deployable kirigami patterns in any of the seventeen wallpaper groupscan be constructed , and then design symmetry-preserving cut patterns that can be effectively applied for achieving arbitrary size change throughout deployment. We further prove that different symmetry changes can be achieved by controlling the shape and connectivity of the tiles . Finally, we connect these results using the underlying lattice structures of the kirigami patterns . All together, our work provides a systematic approach for creating deployable structures with any prescribed size and symmetry properties , thereby paving the way for the design of a wide range of metamaterials by harnessing kirigami .", "after_revision": "Kirigami, the art of paper cutting, has become a paradigm for mechanical metamaterials in recent years. The basic building blocks of any kirigami structures are repetitive deployable patterns that derive inspiration from geometric art forms and simple planar tilings . Here we complement these approaches by directly linking kirigami patterns to the symmetry associated with the set of seventeen repeating patterns that fully characterize the space of periodic tilings of the plane. We start by showing how to construct deployable kirigami patterns using any of the wallpaper groups , and then design symmetry-preserving cut patterns to achieve arbitrary size changes via deployment. We further prove that different symmetry changes can be achieved by controlling the shape and connectivity of the tiles and connect these results to the underlying kirigami-based lattice structures . All together, our work provides a systematic approach for creating a broad range of kirigami-based deployable structures with any prescribed size and symmetry properties .", "edit_actions": [{"type": "R", "before": "the subject of study in", "after": "a paradigm for", "start_char_pos": 47, "end_char_pos": 70}, {"type": "R", "before": ", the design of which has to date largely relied on inspirations from art, nature, and intuition, embedded in a choice of the underlying pattern symmetry", "after": "that derive inspiration from geometric art forms and simple planar tilings", "start_char_pos": 201, "end_char_pos": 354}, {"type": "R", "before": "clarifying some of the connections between kirigami patterns and symmetry in terms of the wallpaper groups, the", "after": "directly linking kirigami patterns to the symmetry associated with the", "start_char_pos": 396, "end_char_pos": 507}, {"type": "R", "before": "plane symmetry groups", "after": "repeating patterns", "start_char_pos": 525, "end_char_pos": 546}, {"type": "R", "before": "that", "after": "how to construct", "start_char_pos": 635, "end_char_pos": 639}, {"type": "R", "before": "in", "after": "using", "start_char_pos": 669, "end_char_pos": 671}, {"type": "R", "before": "seventeen wallpaper groupscan be constructed", "after": "wallpaper groups", "start_char_pos": 683, "end_char_pos": 727}, {"type": "R", "before": "that can be effectively applied for achieving arbitrary size change throughout", "after": "to achieve arbitrary size changes via", "start_char_pos": 779, "end_char_pos": 857}, {"type": "R", "before": ". Finally, we", "after": "and", "start_char_pos": 990, "end_char_pos": 1003}, {"type": "R", "before": "using the underlying lattice structures of the kirigami patterns", "after": "to the underlying kirigami-based lattice structures", "start_char_pos": 1026, "end_char_pos": 1090}, {"type": "A", "before": null, "after": "a broad range of kirigami-based", "start_char_pos": 1160, "end_char_pos": 1160}, {"type": "D", "before": ", thereby paving the way for the design of a wide range of metamaterials by harnessing kirigami", "after": null, "start_char_pos": 1232, "end_char_pos": 1327}], "sents_char_pos": [0, 112, 356, 614, 869, 991, 1092]} {"doc_id": "2102.12220", "revision_depth": "1", "before_revision": "This work deals with error models for trident quaternion framework proposed in the companion paper \"A Trident Quaternion Framework for Inertial-based Navigation Part I: Motion Representation and Computation\" and further uses them to investigate the static and in-motion alignment for land vehicles. Specifically, the zero-velocity and odometer velocity measurements are applied in the static and in-motion alignment process, respectively. By linearizing the trident quaternion kinematic equation, the right and left trident quaternion error models are obtained . The resultant models are found to be equivalent to those derived from profound group affine. Then the two models are used to design the corresponding extended Kalman filters (EKF), namely, the left-quaternion EKF (LQEKF) and the right-quaternion EKF (RQEKF). Simulations and field tests are conducted to evaluate their actual performances. For the static alignment, owing to their high consistency, the L/RQEKF converge much faster than the EKF even without any heading information . For the in-motion alignment, however, the two filters still need the assistance of the analytical / optimization-based in-motion alignment methods at the very start to avoid extremely large attitude errors, although they possess much larger convergence region than the traditional EKF does .", "after_revision": "This work deals with error models for trident quaternion framework proposed in the companion paper (Part I) and further uses them to investigate the odometer-aided static/ in-motion inertial navigation attitude alignment for land vehicles. By linearizing the trident quaternion kinematic equation, the left and right trident quaternion error models are obtained , which are found to be equivalent to those derived from profound group affine. The two error models are used to design their corresponding extended Kalman filters (EKF), namely, the left-quaternion EKF (LQEKF) and the right-quaternion EKF (RQEKF). Simulations and field tests are conducted to evaluate their actual performances. Owing to the high estimation consistency, the L/RQEKF converge much faster in the static alignment than the traditional error model-based EKF, even under arbitrary large heading initialization . For the in-motion alignment, the L / RQEKF possess much larger convergence region than the traditional EKF does , although they still require the aid of attitude initialization so as to avoid large initial attitude errors .", "edit_actions": [{"type": "R", "before": "\"A Trident Quaternion Framework for Inertial-based Navigation Part I: Motion Representation and Computation\" and", "after": "(Part I) and", "start_char_pos": 99, "end_char_pos": 211}, {"type": "R", "before": "static and", "after": "odometer-aided static/", "start_char_pos": 249, "end_char_pos": 259}, {"type": "A", "before": null, "after": "inertial navigation attitude", "start_char_pos": 270, "end_char_pos": 270}, {"type": "D", "before": "Specifically, the zero-velocity and odometer velocity measurements are applied in the static and in-motion alignment process, respectively.", "after": null, "start_char_pos": 300, "end_char_pos": 439}, {"type": "R", "before": "right and left", "after": "left and right", "start_char_pos": 502, "end_char_pos": 516}, {"type": "R", "before": ". The resultant models", "after": ", which", "start_char_pos": 562, "end_char_pos": 584}, {"type": "R", "before": "Then the two", "after": "The two error", "start_char_pos": 657, "end_char_pos": 669}, {"type": "R", "before": "the", "after": "their", "start_char_pos": 696, "end_char_pos": 699}, {"type": "R", "before": "For the static alignment, owing to their high", "after": "Owing to the high estimation", "start_char_pos": 904, "end_char_pos": 949}, {"type": "R", "before": "than the EKF even without any heading information", "after": "in the static alignment than the traditional error model-based EKF, even under arbitrary large heading initialization", "start_char_pos": 996, "end_char_pos": 1045}, {"type": "R", "before": "however, the two filters still need the assistance of the analytical", "after": "the L", "start_char_pos": 1077, "end_char_pos": 1145}, {"type": "R", "before": "optimization-based in-motion alignment methods at the very start to avoid extremely large attitude errors, although they", "after": "RQEKF", "start_char_pos": 1148, "end_char_pos": 1268}, {"type": "A", "before": null, "after": ", although they still require the aid of attitude initialization so as to avoid large initial attitude errors", "start_char_pos": 1338, "end_char_pos": 1338}], "sents_char_pos": [0, 299, 439, 563, 656, 822, 903, 1047]} {"doc_id": "2102.13202", "revision_depth": "1", "before_revision": "To balance exploration and exploitation, multi-armed bandit algorithms need to conduct inference on the true mean reward of each arm in every time step using the data collected so far . However, the history of arms and rewards observed up to that time step is adaptively collected and there are known challenges in conducting inference with non-iid data . In particular, sample averages, which play a prominent role in traditional upper confidence bound algorithms and traditional Thompson sampling algorithms, are neither unbiased nor asymptotically normal. We propose a variant of a Thompson sampling based algorithm that leverages recent advances in the causal inference literature and adaptively re-weighs the terms of a doubly robust estimator on the true mean reward of each arm -- hence its name doubly-adaptive Thompson sampling. The regret of the proposed algorithm matches the optimal (minimax) regret rate and its empirical evaluation in a semi-synthetic experiment based on data from a randomized control trial of a web service is performed: we see that the proposed doubly-adaptive Thompson sampling has superior empirical performance to existing baselines in terms of cumulative regret and statistical power in identifying the best arm. Further, we extend this approach to contextual bandits, where there are more sources of bias present apart from the adaptive data collection -- such as the mismatch between the true data generating process and the reward model assumptions or the unequal representations of certain regions of the context space in initial stages of learning -- and propose the linear contextual doubly-adaptive Thompson sampling and the non-parametric contextual doubly-adaptive Thompson sampling extensions of our approach .", "after_revision": "During online decision making in Multi-Armed Bandits (MAB), one needs to conduct inference on the true mean reward of each arm based on data collected so far at each step . However, since the arms are adaptively selected--thereby yielding non-iid data--conducting inference accurately is not straightforward . In particular, sample averaging, which is used in the family of UCB and Thompson sampling (TS) algorithms, does not provide a good choice as it suffers from bias and a lack of good statistical properties (e.g. asymptotic normality). Our thesis in this paper is that more sophisticated inference schemes that take into account the adaptive nature of the sequentially collected data can unlock further performance gains, even though both UCB and TS type algorithms are optimal in the worst case. In particular, we propose a variant of TS-style algorithms--which we call doubly adaptive TS--that leverages recent advances in causal inference and adaptively reweights the terms of a doubly robust estimator on the true mean reward of each arm . Through 20 synthetic domain experiments and a semi-synthetic experiment based on data from an A/B test of a web service , we demonstrate that using an adaptive inferential scheme (while still retaining the exploration efficacy of TS) provides clear benefits in online decision making: the proposed DATS algorithm has superior empirical performance to existing baselines (UCB and TS) in terms of regret and sample complexity in identifying the best arm. In addition, we also provide a finite-time regret bound of doubly adaptive TS that matches (up to log factors) those of UCB and TS algorithms, thereby establishing that its improved practical benefits do not come at the expense of worst-case suboptimality .", "edit_actions": [{"type": "R", "before": "To balance exploration and exploitation, multi-armed bandit algorithms need", "after": "During online decision making in Multi-Armed Bandits (MAB), one needs", "start_char_pos": 0, "end_char_pos": 75}, {"type": "R", "before": "in every time step using the", "after": "based on", "start_char_pos": 133, "end_char_pos": 161}, {"type": "A", "before": null, "after": "at each step", "start_char_pos": 184, "end_char_pos": 184}, {"type": "R", "before": "the history of arms and rewards observed up to that time step is adaptively collected and there are known challenges in conducting inference with", "after": "since the arms are adaptively selected--thereby yielding", "start_char_pos": 196, "end_char_pos": 341}, {"type": "R", "before": "data", "after": "data--conducting inference accurately is not straightforward", "start_char_pos": 350, "end_char_pos": 354}, {"type": "R", "before": "averages, which play a prominent role in traditional upper confidence bound algorithms and traditional Thompson sampling algorithms, are neither unbiased nor asymptotically normal. We", "after": "averaging, which is used in the family of UCB and Thompson sampling (TS) algorithms, does not provide a good choice as it suffers from bias and a lack of good statistical properties (e.g. asymptotic normality). Our thesis in this paper is that more sophisticated inference schemes that take into account the adaptive nature of the sequentially collected data can unlock further performance gains, even though both UCB and TS type algorithms are optimal in the worst case. In particular, we", "start_char_pos": 379, "end_char_pos": 562}, {"type": "R", "before": "a Thompson sampling based algorithm that", "after": "TS-style algorithms--which we call doubly adaptive TS--that", "start_char_pos": 584, "end_char_pos": 624}, {"type": "R", "before": "the causal inference literature and adaptively re-weighs", "after": "causal inference and adaptively reweights", "start_char_pos": 654, "end_char_pos": 710}, {"type": "R", "before": "-- hence its name doubly-adaptive Thompson sampling. The regret of the proposed algorithm matches the optimal (minimax) regret rate and its empirical evaluation in", "after": ". Through 20 synthetic domain experiments and", "start_char_pos": 786, "end_char_pos": 949}, {"type": "R", "before": "a randomized control trial", "after": "an A/B test", "start_char_pos": 997, "end_char_pos": 1023}, {"type": "R", "before": "is performed: we see that the proposed doubly-adaptive Thompson sampling", "after": ", we demonstrate that using an adaptive inferential scheme (while still retaining the exploration efficacy of TS) provides clear benefits in online decision making: the proposed DATS algorithm", "start_char_pos": 1041, "end_char_pos": 1113}, {"type": "A", "before": null, "after": "(UCB and TS)", "start_char_pos": 1171, "end_char_pos": 1171}, {"type": "R", "before": "cumulative regret and statistical power", "after": "regret and sample complexity", "start_char_pos": 1184, "end_char_pos": 1223}, {"type": "R", "before": "Further, we extend this approach to contextual bandits, where there are more sources of bias present apart from the adaptive data collection -- such as the mismatch between the true data generating process and the reward model assumptions or the unequal representations of certain regions of the context space in initial stages of learning -- and propose the linear contextual doubly-adaptive Thompson sampling and the non-parametric contextual doubly-adaptive Thompson sampling extensions of our approach", "after": "In addition, we also provide a finite-time regret bound of doubly adaptive TS that matches (up to log factors) those of UCB and TS algorithms, thereby establishing that its improved practical benefits do not come at the expense of worst-case suboptimality", "start_char_pos": 1253, "end_char_pos": 1758}], "sents_char_pos": [0, 356, 559, 838, 1252, 1395]} {"doc_id": "2103.00293", "revision_depth": "1", "before_revision": "The collection and annotation of task-oriented conversational data is a costlyand time-consuming manner. Many augmentation techniques have been proposed to improve the performance of state-of-the-art (SOTA) systems in new domains that lack the necessary amount of data for training. However, these augmentation techniques (e.g. paraphrasing) also require some mediocre amount of data since they use learning-based approaches. This makes using SOTA systems in emerging low-resource domains infeasible. We, to tackle this problem, introduce a framework , that creates synthetic task-oriented dialogues in a fully automatic manner, which operates with input sizes of as small as a few dialogues . Our framework uses the simple idea that each turn-pair in a task-oriented dialogue has a certain function and exploits this idea to mix them creating new dialogues . We evaluate our framework within a low-resource setting by integrating it with a SOTA model TRADE in the dialogue state tracking task and observe significant improvements in the fine-tuning scenarios in several domains . We conclude that this end-to-end dialogue augmentation framework can be a crucial tool for natural language understanding performance in emerging task-oriented dialogue domains.", "after_revision": "As the creation of task-oriented conversational data is costly, data augmentation techniques have been proposed to create synthetic data to improve model performance in new domains . Up to now, these learning-based techniques (e.g. paraphrasing) still require a moderate amount of data , making application to low-resource settings infeasible. To tackle this problem, we introduce an augmentation framework that creates synthetic task-oriented dialogues , operating with as few as 5 shots . Our framework utilizes belief state annotations to define dialogue functions of each turn pair. It then creates templates of pairs through de-lexicalization, where the dialogue function codifies the allowable incoming and outgoing links of each template. To generate new dialogues, our framework composes allowable adjacent templates in a bottom-up manner . We evaluate our framework using TRADE as the base DST model, observing significant improvements in the fine-tuning scenarios within a low-resource setting . We conclude that this end-to-end dialogue augmentation framework can be a practical tool for natural language understanding performance in emerging task-oriented dialogue domains.", "edit_actions": [{"type": "R", "before": "The collection and annotation", "after": "As the creation", "start_char_pos": 0, "end_char_pos": 29}, {"type": "R", "before": "a costlyand time-consuming manner. Many", "after": "costly, data", "start_char_pos": 70, "end_char_pos": 109}, {"type": "R", "before": "improve the performance of state-of-the-art (SOTA) systems", "after": "create synthetic data to improve model performance", "start_char_pos": 156, "end_char_pos": 214}, {"type": "R", "before": "that lack the necessary amount of data for training. However, these augmentation", "after": ". Up to now, these learning-based", "start_char_pos": 230, "end_char_pos": 310}, {"type": "R", "before": "also require some mediocre", "after": "still require a moderate", "start_char_pos": 342, "end_char_pos": 368}, {"type": "R", "before": "since they use learning-based approaches. This makes using SOTA systems in emerging", "after": ", making application to", "start_char_pos": 384, "end_char_pos": 467}, {"type": "R", "before": "domains infeasible. We, to", "after": "settings infeasible. To", "start_char_pos": 481, "end_char_pos": 507}, {"type": "R", "before": "introduce a framework ,", "after": "we introduce an augmentation framework", "start_char_pos": 529, "end_char_pos": 552}, {"type": "R", "before": "in a fully automatic manner, which operates with input sizes of as small as a few dialogues", "after": ", operating with as few as 5 shots", "start_char_pos": 600, "end_char_pos": 691}, {"type": "R", "before": "uses the simple idea that each turn-pair in a task-oriented dialogue has a certain function and exploits this idea to mix them creating new dialogues", "after": "utilizes belief state annotations to define dialogue functions of each turn pair. It then creates templates of pairs through de-lexicalization, where the dialogue function codifies the allowable incoming and outgoing links of each template. To generate new dialogues, our framework composes allowable adjacent templates in a bottom-up manner", "start_char_pos": 708, "end_char_pos": 857}, {"type": "R", "before": "within a low-resource setting by integrating it with a SOTA model TRADE in the dialogue state tracking task and observe", "after": "using TRADE as the base DST model, observing", "start_char_pos": 886, "end_char_pos": 1005}, {"type": "R", "before": "in several domains", "after": "within a low-resource setting", "start_char_pos": 1060, "end_char_pos": 1078}, {"type": "R", "before": "crucial", "after": "practical", "start_char_pos": 1155, "end_char_pos": 1162}], "sents_char_pos": [0, 104, 282, 425, 500, 693, 859, 1080]} {"doc_id": "2103.02152", "revision_depth": "1", "before_revision": "The vanilla convolutional neural network (CNN) is vulnerable to images with small variations (e.g. corrupted and adversarial samples). One of the possible reasons is that CNN pays more attention to the most discriminative regions, but ignores the auxiliary features , leading to the lack of feature diversity . In our method, we propose to dynamically suppress significant activation values of vanilla CNN by group-wise inhibition, but not fix or randomly handle them when training. Then, the feature maps with different activation distribution are processed separately due to the independence of features. Vanilla CNN is finally guided to learn more rich discriminative features hierarchically for robust classification according to proposed regularization. The proposed method is able to achieve a significant gain of robustness over 15\\% comparing with the state-of-the-art. We also show that the proposed regularization method complements other defense paradigms, such as adversarial training, to further improve the robustness .", "after_revision": "The convolutional neural network (CNN) is vulnerable to degraded images with even very small variations (e.g. corrupted and adversarial samples). One of the possible reasons is that CNN pays more attention to the most discriminative regions, but ignores the auxiliary features when learning , leading to the lack of feature diversity for final judgment . In our method, we propose to dynamically suppress significant activation values of CNN by group-wise inhibition, but not fixedly or randomly handle them when training. The feature maps with different activation distribution are then processed separately to take the feature independence into account. CNN is finally guided to learn richer discriminative features hierarchically for robust classification according to the proposed regularization. Our method is comprehensively evaluated under multiple settings, including classification against corruptions, adversarial attacks and low data regime. Extensive experimental results show that the proposed method can achieve significant improvements in terms of both robustness and generalization performances, when compared with the state-of-the-art methods .", "edit_actions": [{"type": "D", "before": "vanilla", "after": null, "start_char_pos": 4, "end_char_pos": 11}, {"type": "R", "before": "images with", "after": "degraded images with even very", "start_char_pos": 64, "end_char_pos": 75}, {"type": "A", "before": null, "after": "when learning", "start_char_pos": 266, "end_char_pos": 266}, {"type": "A", "before": null, "after": "for final judgment", "start_char_pos": 310, "end_char_pos": 310}, {"type": "D", "before": "vanilla", "after": null, "start_char_pos": 396, "end_char_pos": 403}, {"type": "R", "before": "fix", "after": "fixedly", "start_char_pos": 442, "end_char_pos": 445}, {"type": "R", "before": "Then, the", "after": "The", "start_char_pos": 485, "end_char_pos": 494}, {"type": "R", "before": "processed separately due to the independence of features. Vanilla", "after": "then processed separately to take the feature independence into account.", "start_char_pos": 551, "end_char_pos": 616}, {"type": "R", "before": "more rich", "after": "richer", "start_char_pos": 648, "end_char_pos": 657}, {"type": "A", "before": null, "after": "the", "start_char_pos": 736, "end_char_pos": 736}, {"type": "R", "before": "The proposed method is able to achieve a significant gain of robustness over 15\\% comparing with the state-of-the-art. We also", "after": "Our method is comprehensively evaluated under multiple settings, including classification against corruptions, adversarial attacks and low data regime. Extensive experimental results", "start_char_pos": 762, "end_char_pos": 888}, {"type": "R", "before": "regularization method complements other defense paradigms, such as adversarial training, to further improve the robustness", "after": "method can achieve significant improvements in terms of both robustness and generalization performances, when compared with the state-of-the-art methods", "start_char_pos": 912, "end_char_pos": 1034}], "sents_char_pos": [0, 134, 312, 484, 608, 761, 880]} {"doc_id": "2103.02760", "revision_depth": "1", "before_revision": "Autonomous vehicles rely heavily upon their perception subsystems to see the environment in which they operate. Unfortunately, the effect of varying weather conditions presents a significant challenge to object detection algorithms, and thus it is imperative to test the vehicle extensively in all conditions which it may experience. However, unpredictable weather can make real-world testing in adverse conditions an expensive and time consuming task requiring access to specialist facilities , and weatherproofing of sensitive electronics. Simulation provides an alternative to real world testing, with some studies developing increasingly visually realistic representations of the real world on powerful compute hardware. Given that subsequent subsystems in the autonomous vehicle pipeline are unaware of the visual realism of the simulation, when developing modules downstream of perception the appearance is of little consequence - rather it is how the perception system performs in the prevailing weather condition that is important . This study explores the potential of using a simple, lightweight image augmentation system in an autonomous racing vehicle - focusing not on visual accuracy, but rather the effect upon perception system performance . With minimal adjustment, the prototype system developed in this study can replicate the effects of both water droplets on the camera lens, and fading light conditions. The system introduces a latency of less than 8 ms using compute hardware that is well suited to being carried in the vehicle - rendering it ideally suited to real-time implementation that can be run during experiments in simulation, and augmented reality testing in the real world.", "after_revision": "Autonomous vehicles rely heavily upon their perception subsystems to see the environment in which they operate. Unfortunately, the effect of variable weather conditions presents a significant challenge to object detection algorithms, and thus it is imperative to test the vehicle extensively in all conditions which it may experience. However, development of robust autonomous vehicle subsystems requires repeatable, controlled testing - while real weather is unpredictable and cannot be scheduled. Real-world testing in adverse conditions is an expensive and time-consuming task, often requiring access to specialist facilities . Simulation is commonly relied upon as a substitute, with increasingly visually realistic representations of the real-world being developed. In the context of the complete autonomous vehicle control pipeline, subsystems downstream of perception need to be tested with accurate recreations of the perception system output, rather than focusing on subjective visual realism of the input - whether in simulation or the real world . This study develops the untapped potential of a lightweight weather augmentation method in an autonomous racing vehicle - focusing not on visual accuracy, but rather the effect upon perception subsystem performance in real time . With minimal adjustment, the prototype developed in this study can replicate the effects of water droplets on the camera lens, and fading light conditions. This approach introduces a latency of less than 8 ms using compute hardware well suited to being carried in the vehicle - rendering it ideal for real-time implementation that can be run during experiments in simulation, and augmented reality testing in the real world.", "edit_actions": [{"type": "R", "before": "varying", "after": "variable", "start_char_pos": 141, "end_char_pos": 148}, {"type": "R", "before": "unpredictable weather can make real-world", "after": "development of robust autonomous vehicle subsystems requires repeatable, controlled testing - while real weather is unpredictable and cannot be scheduled. Real-world", "start_char_pos": 343, "end_char_pos": 384}, {"type": "A", "before": null, "after": "is", "start_char_pos": 415, "end_char_pos": 415}, {"type": "R", "before": "time consuming task", "after": "time-consuming task, often", "start_char_pos": 433, "end_char_pos": 452}, {"type": "R", "before": ", and weatherproofing of sensitive electronics. Simulation provides an alternative to real world testing, with some studies developing", "after": ". Simulation is commonly relied upon as a substitute, with", "start_char_pos": 495, "end_char_pos": 629}, {"type": "R", "before": "real world on powerful compute hardware. Given that subsequent subsystems in the autonomous vehicle pipeline are unaware of the visual realism of the simulation, when developing modules", "after": "real-world being developed. In the context of the complete autonomous vehicle control pipeline, subsystems", "start_char_pos": 685, "end_char_pos": 870}, {"type": "R", "before": "the appearance is of little consequence - rather it is how", "after": "need to be tested with accurate recreations of", "start_char_pos": 896, "end_char_pos": 954}, {"type": "R", "before": "performs in the prevailing weather condition that is important", "after": "output, rather than focusing on subjective visual realism of the input - whether in simulation or the real world", "start_char_pos": 977, "end_char_pos": 1039}, {"type": "R", "before": "explores the potential of using a simple, lightweight image augmentation system", "after": "develops the untapped potential of a lightweight weather augmentation method", "start_char_pos": 1053, "end_char_pos": 1132}, {"type": "R", "before": "system performance", "after": "subsystem performance in real time", "start_char_pos": 1238, "end_char_pos": 1256}, {"type": "D", "before": "system", "after": null, "start_char_pos": 1298, "end_char_pos": 1304}, {"type": "D", "before": "both", "after": null, "start_char_pos": 1358, "end_char_pos": 1362}, {"type": "R", "before": "The system", "after": "This approach", "start_char_pos": 1427, "end_char_pos": 1437}, {"type": "D", "before": "that is", "after": null, "start_char_pos": 1500, "end_char_pos": 1507}, {"type": "R", "before": "ideally suited to", "after": "ideal for", "start_char_pos": 1567, "end_char_pos": 1584}], "sents_char_pos": [0, 111, 333, 542, 725, 1041, 1258, 1426]} {"doc_id": "2103.03398", "revision_depth": "1", "before_revision": "Since the 1950s, citation impact has been the dominant metric by which science is quantitatively evaluated. But research contributions play distinct roles in the unfolding drama of scientific debate, agreement and advance, and institutions may value different kinds of advances . Computational power, access to citation data and an array of modeling techniques have given rise to a widening portfolio of metrics to extract different signals regarding their contribution. Here we unpack the complex, temporally evolving relationship between citation impact alongside novelty and disruption, two emerging measures that capture the degree to which science not only influences, but transforms later work. Novelty captures how research draws upon unusual combinations of prior work. Disruption captures how research comes to eclipse the prior work on which it builds , becoming recognized as a new scientific direction. We demonstrate that : 1) novel papers disrupt existing theories and expand the scientific frontier; 2) novel papers are more likely to become \"sleeping beauties\" and accumulate citation impact over the long run ; 3) novelty can be reformulated as distance in journal embedding spaces to map the moving frontier of science . The evolution of embedding spaces over time reveals how yesterday's novelty forms today's scientific conventions, which condition the novelty--and surprise--of tomorrow's breakthroughs.", "after_revision": "Since the 1950s, citation number or \"impact\" has been the dominant metric by which science is quantitatively evaluated. But research contributions play distinct roles in the unfolding drama of scientific debate, agreement and advance, which are differentially valued by scientists and their institutions . Computational power, access to citation data and an array of modeling techniques have given rise to a widening portfolio of metrics that extract different signals regarding their contribution. Here we unpack the complex, temporally evolving relationship between citation impact alongside novelty and disruption, two emerging measures that capture the degree to which science not only influences, but transforms later work. Novelty is measured at the point of production and captures how research draws upon unusual combinations of prior work. Disruption is measured over time and captures how research comes to eclipse or amplify the prior work on which it builds . We theorize that novel papers will exhibit disruptive impact over time, and demonstrate how they are much more likely than conventional papers to disrupt current literature. Novel papers do not do so immediately, but often become \"sleeping beauties\" , accumulating surprising attention and citation impact over the long run . In summary, new directions for science are created from a lack of consensus. Finally, we show how novelty can be reformulated as the combination of ideas across knowledge space to reveal the combinatorial nature of advance . The evolution of knowledge space over time characterizes how yesterday's novelty forms today's scientific conventions, which condition the novelty-and surprise-of tomorrow's breakthroughs.", "edit_actions": [{"type": "R", "before": "impact", "after": "number or \"impact\"", "start_char_pos": 26, "end_char_pos": 32}, {"type": "R", "before": "and institutions may value different kinds of advances", "after": "which are differentially valued by scientists and their institutions", "start_char_pos": 223, "end_char_pos": 277}, {"type": "R", "before": "to", "after": "that", "start_char_pos": 412, "end_char_pos": 414}, {"type": "A", "before": null, "after": "is measured at the point of production and", "start_char_pos": 709, "end_char_pos": 709}, {"type": "A", "before": null, "after": "is measured over time and", "start_char_pos": 790, "end_char_pos": 790}, {"type": "A", "before": null, "after": "or amplify", "start_char_pos": 830, "end_char_pos": 830}, {"type": "R", "before": ", becoming recognized as a new scientific direction. We demonstrate that : 1) novel papers disrupt existing theories and expand the scientific frontier; 2) novel papers are more likely to", "after": ". We theorize that novel papers will exhibit disruptive impact over time, and demonstrate how they are much more likely than conventional papers to disrupt current literature. Novel papers do not do so immediately, but often", "start_char_pos": 865, "end_char_pos": 1052}, {"type": "R", "before": "and accumulate", "after": ", accumulating surprising attention and", "start_char_pos": 1080, "end_char_pos": 1094}, {"type": "R", "before": "; 3)", "after": ". In summary, new directions for science are created from a lack of consensus. Finally, we show how", "start_char_pos": 1129, "end_char_pos": 1133}, {"type": "R", "before": "distance in journal embedding spaces to map the moving frontier of science", "after": "the combination of ideas across knowledge space to reveal the combinatorial nature of advance", "start_char_pos": 1165, "end_char_pos": 1239}, {"type": "R", "before": "embedding spaces over time reveals", "after": "knowledge space over time characterizes", "start_char_pos": 1259, "end_char_pos": 1293}, {"type": "R", "before": "novelty--and surprise--of", "after": "novelty-and surprise-of", "start_char_pos": 1376, "end_char_pos": 1401}], "sents_char_pos": [0, 107, 470, 700, 778, 917, 1017, 1130, 1241]} {"doc_id": "2103.03413", "revision_depth": "1", "before_revision": "In this study, we explore the implications of integrating social distancing with emergency evacuation when a hurricane approaches a major city during the COVID-19 pandemic. Specifically, we compare DNN (Deep Neural Network)-based and non-DNN methods for generating evacuation strategies that minimize evacuation time while allowing for social distancing in rescue vehicles. A central question is whether a DNN-based method provides sufficient extra efficiency to accommodate social distancing, in a time-constrained evacuation operation. We describe the problem as a Capacitated Vehicle Routing Problem and solve it using one non-DNN solution (Sweep Algorithm) and one DNN-based solution (Deep Reinforcement Learning). DNN-based solution can provide decision-makers with more efficient routing than non-DNN solution. Although DNN-based solution can save considerable time in evacuation routing , it does not come close to compensating for the extra time required for social distancing and its advantage disappears as the vehicle capacity approaches the number of people per household.", "after_revision": "We explore the implications of integrating social distancing with emergency evacuation , as would be expected when a hurricane approaches a city during the COVID-19 pandemic. Specifically, we compare DNN (Deep Neural Network)-based and non-DNN methods for generating evacuation strategies that minimize evacuation time while allowing for social distancing in emergency vehicles. A central question is whether a DNN-based method provides sufficient extra routing efficiency to accommodate increased social distancing in a time-constrained evacuation operation. We describe the problem as a Capacitated Vehicle Routing Problem and solve it using a non-DNN solution (Sweep Algorithm) and a DNN-based solution (Deep Reinforcement Learning). The DNN-based solution can provide decision-makers with more efficient routing than the typical non-DNN routing solution. However , it does not come close to compensating for the extra time required for social distancing , and its advantage disappears as the emergency vehicle capacity approaches the number of people per household.", "edit_actions": [{"type": "R", "before": "In this study, we", "after": "We", "start_char_pos": 0, "end_char_pos": 17}, {"type": "A", "before": null, "after": ", as would be expected", "start_char_pos": 102, "end_char_pos": 102}, {"type": "D", "before": "major", "after": null, "start_char_pos": 133, "end_char_pos": 138}, {"type": "R", "before": "rescue", "after": "emergency", "start_char_pos": 358, "end_char_pos": 364}, {"type": "A", "before": null, "after": "routing", "start_char_pos": 450, "end_char_pos": 450}, {"type": "R", "before": "social distancing,", "after": "increased social distancing", "start_char_pos": 477, "end_char_pos": 495}, {"type": "R", "before": "one", "after": "a", "start_char_pos": 624, "end_char_pos": 627}, {"type": "R", "before": "one", "after": "a", "start_char_pos": 667, "end_char_pos": 670}, {"type": "A", "before": null, "after": "The", "start_char_pos": 721, "end_char_pos": 721}, {"type": "A", "before": null, "after": "the typical", "start_char_pos": 802, "end_char_pos": 802}, {"type": "R", "before": "solution. Although DNN-based solution can save considerable time in evacuation routing", "after": "routing solution. However", "start_char_pos": 811, "end_char_pos": 897}, {"type": "A", "before": null, "after": ",", "start_char_pos": 989, "end_char_pos": 989}, {"type": "A", "before": null, "after": "emergency", "start_char_pos": 1026, "end_char_pos": 1026}], "sents_char_pos": [0, 173, 374, 539, 720, 820]} {"doc_id": "2103.04000", "revision_depth": "1", "before_revision": "The standard problem setting in Dec-POMDPs is self-play, where the goal is to find a set of policies that play optimally together. Policies learned through self-play may adopt arbitrary conventions and rely on multi-step counterfactual reasoning based on assumptions about other agents' actions and thus fail when paired with humans or independently trained agents . In contrast, no current methods can learn optimal policies that are fully grounded, i.e., do not rely on counterfactual information from observing other agents' actions. To address this, we present off-belief learning (OBL) : at each time step OBL agents assume that all past actions were taken by a given, fixed policy (\\pi_0), but that future actions will be taken by an optimal policy under these same assumptions . When \\pi_0 is uniform random, OBL learns the optimal grounded policy . OBL can be iterated in a hierarchy, where the optimal policy from one level becomes the input to the next . This introduces counterfactual reasoning in a controlled manner. Unlike independent RL which may converge to any equilibrium policy, OBL converges to a unique policy, making it more suitable for zero-shot coordination . OBL can be scaled to high-dimensional settings with a fictitious transition mechanism and shows strong performance in both a simple toy-setting and the benchmark human-AI /zero-shot coordination problem Hanabi.", "after_revision": "The standard problem setting in Dec-POMDPs is self-play, where the goal is to find a set of policies that play optimally together. Policies learned through self-play may adopt arbitrary conventions and implicitly rely on multi-step reasoning based on fragile assumptions about other agents' actions and thus fail when paired with humans or independently trained agents at test time. To address this, we present off-belief learning (OBL) . At each timestep OBL agents follow a policy \\pi_1 that is optimized assuming past actions were taken by a given, fixed policy (\\pi_0), but assuming that future actions will be taken by \\pi_1 . When \\pi_0 is uniform random, OBL converges to an optimal policy that does not rely on inferences based on other agents' behavior (an optimal grounded policy) . OBL can be iterated in a hierarchy, where the optimal policy from one level becomes the input to the next , thereby introducing multi-level cognitive reasoning in a controlled manner. Unlike existing approaches, which may converge to any equilibrium policy, OBL converges to a unique policy, making it suitable for zero-shot coordination (ZSC) . OBL can be scaled to high-dimensional settings with a fictitious transition mechanism and shows strong performance in both a toy-setting and the benchmark human-AI ZSC problem Hanabi.", "edit_actions": [{"type": "A", "before": null, "after": "implicitly", "start_char_pos": 202, "end_char_pos": 202}, {"type": "D", "before": "counterfactual", "after": null, "start_char_pos": 222, "end_char_pos": 236}, {"type": "A", "before": null, "after": "fragile", "start_char_pos": 256, "end_char_pos": 256}, {"type": "R", "before": ". In contrast, no current methods can learn optimal policies that are fully grounded, i.e., do not rely on counterfactual information from observing other agents' actions.", "after": "at test time.", "start_char_pos": 367, "end_char_pos": 538}, {"type": "R", "before": ": at each time step OBL agents assume that all", "after": ". At each timestep OBL agents follow a policy \\pi_1 that is optimized assuming", "start_char_pos": 593, "end_char_pos": 639}, {"type": "A", "before": null, "after": "assuming", "start_char_pos": 702, "end_char_pos": 702}, {"type": "R", "before": "an optimal policy under these same assumptions", "after": "\\pi_1", "start_char_pos": 740, "end_char_pos": 786}, {"type": "R", "before": "learns the optimal grounded policy", "after": "converges to an optimal policy that does not rely on inferences based on other agents' behavior (an optimal grounded policy)", "start_char_pos": 823, "end_char_pos": 857}, {"type": "R", "before": ". This introduces counterfactual", "after": ", thereby introducing multi-level cognitive", "start_char_pos": 966, "end_char_pos": 998}, {"type": "R", "before": "independent RL", "after": "existing approaches,", "start_char_pos": 1040, "end_char_pos": 1054}, {"type": "D", "before": "more", "after": null, "start_char_pos": 1145, "end_char_pos": 1149}, {"type": "A", "before": null, "after": "(ZSC)", "start_char_pos": 1186, "end_char_pos": 1186}, {"type": "D", "before": "simple", "after": null, "start_char_pos": 1314, "end_char_pos": 1320}, {"type": "R", "before": "/zero-shot coordination", "after": "ZSC", "start_char_pos": 1360, "end_char_pos": 1383}], "sents_char_pos": [0, 130, 368, 538, 788, 967, 1032]} {"doc_id": "2103.05631", "revision_depth": "1", "before_revision": "The rigidity of a matrix A for target rank r is the minimum number of entries of A that need to be changed in order to obtain a matrix of rank at most r. Matrix rigidity was introduced by Valiant in 1977 as a tool to prove circuit lower bounds for linear functions and since then this notion has also found applications in other areas of complexity theory. Recently (arXiv 2021) , Alman proved that for any field \\mathbb{F, d\\geq 2 and arbitrary } matrices M_1, \\ldots, M_n \\in \\mathbb{F^{d\\times d}, one can get a d^n\\times d^n matrix of rank }%DIFDELCMD < \\le %%% d^{(1-\\gamma)n \\dots\\ge ^{ ( 1+\\varepsilon ) n } entries of the Kronecker product M = M_1\\otimes M_2\\otimes \\ldots\\otimes M_n\\le , where 1/\\gamma is roughly 2^d/\\varepsilon^2. In this note we improve this result in two directions. First, we do not require the matrices M_i to have equal size. Second, we reduce 1/\\gamma from exponential in d to roughly d^{3/2}/\\varepsilon^2 (where d is the maximum size of the matrices ), and to nearly linear (roughly d/\\varepsilon^2) for matrices M_i of sizes within a constant factor of each other. For the case of matrices of equal size, our bound matches the bound given by Dvir and Liu (\\textit{Theory of Computing, 2020 ) for the rigidity of generalized Walsh--Hadamard matrices (Kronecker powers of DFT matrices ), and improves their bounds for DFT matrices of abelian groups that are direct products of small groups .", "after_revision": "The rigidity of a matrix A for target rank r is the minimum number of entries of A that need to be changed in order to obtain a matrix of rank at most r. At MFCS'77, Valiant introduced matrix rigidity as a tool to prove circuit lower bounds for linear functions and since then this notion received much attention and found applications in other areas of complexity theory. , d\\geq 2 and arbitrary } The problem of constructing an explicit family of matrices that are sufficiently rigid for Valiant's reduction (Valiant-rigid) still remains open. Moreover, since 2017 most of the long-studied candidates have been shown not to be Valiant-rigid. Some of those former candidates for rigidity are Kronecker products of small matrices. In a recent paper (STOC'21), Alman gave a general non-rigidity result for such matrices: he showed that if an n\\times n matrix A (over any field) is a Kronecker product of d\\times d matrices M_1, ^{d\\times d}, one can get a d^n\\times d^n matrix of rank }%DIFDELCMD < \\le %%% \\dots, M_k (so n=d^k) (d\\ge 2) then changing only n ^{ 1+\\varepsilon } entries of A one can reduce its rank to\\le n^{1-\\gamma , where 1/\\gamma is roughly 2^d/\\varepsilon^2. In this note we improve this result in two directions. First, we do not require the matrices M_i to have equal size. Second, we reduce 1/\\gamma from exponential in d to roughly d^{3/2}/\\varepsilon^2 (where d is the maximum size of the matrices M_i ), and to nearly linear (roughly d/\\varepsilon^2) for matrices M_i of sizes within a constant factor of each other. \\textit{ As an application of our results we significantly expand the class of Hadamard matrices that are known not to be Valiant-rigid; these now include the Kronecker products of Paley-Hadamard matrices and Hadamard matrices of bounded size .", "edit_actions": [{"type": "R", "before": "Matrix rigidity was introduced by Valiant in 1977", "after": "At MFCS'77, Valiant introduced matrix rigidity", "start_char_pos": 154, "end_char_pos": 203}, {"type": "R", "before": "has also", "after": "received much attention and", "start_char_pos": 292, "end_char_pos": 300}, {"type": "D", "before": "Recently (arXiv 2021) , Alman proved that for any field \\mathbb{F", "after": null, "start_char_pos": 357, "end_char_pos": 422}, {"type": "A", "before": null, "after": "The problem of constructing an explicit family of matrices that are sufficiently rigid for Valiant's reduction (Valiant-rigid) still remains open. Moreover, since 2017 most of the long-studied candidates have been shown not to be Valiant-rigid. Some of those former candidates for rigidity are Kronecker products of small matrices. In a recent paper (STOC'21), Alman gave a general non-rigidity result for such matrices: he showed that if an n\\times n matrix A (over any field) is a Kronecker product of d\\times d", "start_char_pos": 448, "end_char_pos": 448}, {"type": "D", "before": "\\ldots, M_n \\in \\mathbb{F", "after": null, "start_char_pos": 463, "end_char_pos": 488}, {"type": "D", "before": "d^{(1-\\gamma)n", "after": null, "start_char_pos": 567, "end_char_pos": 581}, {"type": "A", "before": null, "after": ", M_k (so n=d^k) (d", "start_char_pos": 587, "end_char_pos": 587}, {"type": "A", "before": null, "after": "2) then changing only n", "start_char_pos": 591, "end_char_pos": 591}, {"type": "D", "before": "(", "after": null, "start_char_pos": 595, "end_char_pos": 596}, {"type": "D", "before": ") n", "after": null, "start_char_pos": 611, "end_char_pos": 614}, {"type": "R", "before": "the Kronecker product M = M_1\\otimes M_2\\otimes \\ldots\\otimes M_n", "after": "A one can reduce its rank to", "start_char_pos": 628, "end_char_pos": 693}, {"type": "A", "before": null, "after": "n^{1-\\gamma", "start_char_pos": 697, "end_char_pos": 697}, {"type": "A", "before": null, "after": "M_i", "start_char_pos": 989, "end_char_pos": 989}, {"type": "D", "before": "For the case of matrices of equal size, our bound matches the bound given by Dvir and Liu (", "after": null, "start_char_pos": 1106, "end_char_pos": 1197}, {"type": "D", "before": "Theory of Computing, 2020", "after": null, "start_char_pos": 1205, "end_char_pos": 1230}, {"type": "R", "before": ") for the rigidity of generalized Walsh--Hadamard matrices (Kronecker powers of DFT matrices ), and improves their bounds for DFT matrices of abelian groups that are direct products of small groups", "after": "As an application of our results we significantly expand the class of Hadamard matrices that are known not to be Valiant-rigid; these now include the Kronecker products of Paley-Hadamard matrices and Hadamard matrices of bounded size", "start_char_pos": 1231, "end_char_pos": 1428}], "sents_char_pos": [0, 356, 744, 799, 861, 1105]} {"doc_id": "2103.06874", "revision_depth": "1", "before_revision": "Pipelined NLP systems have largely been superseded by end-to-end neural modeling, yet nearly all commonly-used models still require an explicit tokenization step. While recent tokenization approaches based on data-derived subword lexicons are less brittle than manually engineered tokenizers, these techniques are not equally suited to all languages, and the use of any fixed vocabulary may limit a model's ability to adapt. In this paper, we present CANINE, a neural encoder that operates directly on character sequences--without explicit tokenization or vocabulary--and a pre-training strategy with soft inductive biases in place of hard token boundaries. To use its finer-grained input effectively and efficiently, CANINE combines downsampling, which reduces the input sequence length, with a deep transformer stack, which encodes con-text . CANINE outperforms a comparable mBERT model by >= 1 F1 on TyDi QA, a challenging multilingual benchmark, despite having 28\\% fewer model parameters.", "after_revision": "Pipelined NLP systems have largely been superseded by end-to-end neural modeling, yet nearly all commonly-used models still require an explicit tokenization step. While recent tokenization approaches based on data-derived subword lexicons are less brittle than manually engineered tokenizers, these techniques are not equally suited to all languages, and the use of any fixed vocabulary may limit a model's ability to adapt. In this paper, we present CANINE, a neural encoder that operates directly on character sequences, without explicit tokenization or vocabulary, and a pre-training strategy with soft inductive biases in place of hard token boundaries. To use its finer-grained input effectively and efficiently, CANINE combines downsampling, which reduces the input sequence length, with a deep transformer stack, which encodes context . CANINE outperforms a comparable mBERT model by >= 1 F1 on TyDi QA, a challenging multilingual benchmark, despite having 28\\% fewer model parameters.", "edit_actions": [{"type": "R", "before": "sequences--without", "after": "sequences, without", "start_char_pos": 512, "end_char_pos": 530}, {"type": "R", "before": "vocabulary--and", "after": "vocabulary, and", "start_char_pos": 556, "end_char_pos": 571}, {"type": "R", "before": "con-text", "after": "context", "start_char_pos": 834, "end_char_pos": 842}], "sents_char_pos": [0, 162, 424, 657, 844]} {"doc_id": "2103.10290", "revision_depth": "1", "before_revision": "Decision and control are two of the core functionalities of high-level automated vehicles. Current mainstream methods, such as functionality decomposition or end-to-end reinforcement learning (RL), either suffer high time complexity or poor interpretability and limited safety performance in real-world complex autonomous driving tasks. In this paper, we present an interpretable and efficient decision and control framework for automated vehicles, which decomposes the driving task into multi-path planning and optimal tracking that are structured hierarchically. First, the multi-path planning is to generate several paths only considering static constraints . Then, the optimal tracking is designed to track the optimal path while considering the dynamic obstacles. To that end, in theory, we formulate a constrained optimal control problem (OCP) for each candidate path, optimize them separately and choose the one with the best tracking performance to follow. More importantly , we propose a model-based reinforcement learning (RL) algorithm , which is served as an approximate constrained OCP solver , to unload the heavy computation by the paradigm of offline training and online application . Specifically, the OCPs for all paths are considered together to construct a multi-task RL problem and then solved offline by our algorithm into value and policy networks, for real-time online path selecting and tracking respectively. We verify our framework in both simulation and the real world. Results show that our method has better online computing efficiency and driving performance including traffic efficiency and safety compared with baseline methods . In addition, it yields great interpretability and adaptability among different driving tasks. The real road test also suggests that it is applicable in complicated traffic scenarios without even tuning .", "after_revision": "Decision and control are core functionalities of high-level automated vehicles. Current mainstream methods, such as functionality decomposition and end-to-end reinforcement learning (RL), either suffer high time complexity or poor interpretability and adaptability on real-world autonomous driving tasks. In this paper, we present an interpretable and computationally efficient framework called integrated decision and control (IDC) for automated vehicles, which decomposes the driving task into static path planning and dynamic optimal tracking that are structured hierarchically. First, the static path planning generates several candidate paths only considering static traffic elements . Then, the dynamic optimal tracking is designed to track the optimal path while considering the dynamic obstacles. To that end, we formulate a constrained optimal control problem (OCP) for each candidate path, optimize them separately and follow the one with the best tracking performance . To unload the heavy online computation , we propose a model-based reinforcement learning (RL) algorithm that can be served as an approximate constrained OCP solver . Specifically, the OCPs for all paths are considered together to construct a single complete RL problem and then solved offline in the form of value and policy networks, for real-time online path selecting and tracking respectively. We verify our framework in both simulations and the real world. Results show that compared with baseline methods IDC has an order of magnitude higher online computing efficiency , as well as better driving performance including traffic efficiency and safety . In addition, it yields great interpretability and adaptability among different driving tasks. The effectiveness of the proposed method is also demonstrated in real road tests with complicated traffic conditions .", "edit_actions": [{"type": "D", "before": "two of the", "after": null, "start_char_pos": 25, "end_char_pos": 35}, {"type": "R", "before": "or", "after": "and", "start_char_pos": 155, "end_char_pos": 157}, {"type": "R", "before": "limited safety performance in", "after": "adaptability on", "start_char_pos": 262, "end_char_pos": 291}, {"type": "D", "before": "complex", "after": null, "start_char_pos": 303, "end_char_pos": 310}, {"type": "R", "before": "efficient", "after": "computationally efficient framework called integrated", "start_char_pos": 384, "end_char_pos": 393}, {"type": "R", "before": "framework", "after": "(IDC)", "start_char_pos": 415, "end_char_pos": 424}, {"type": "R", "before": "multi-path planning and", "after": "static path planning and dynamic", "start_char_pos": 488, "end_char_pos": 511}, {"type": "R", "before": "multi-path planning is to generate several", "after": "static path planning generates several candidate", "start_char_pos": 576, "end_char_pos": 618}, {"type": "R", "before": "constraints", "after": "traffic elements", "start_char_pos": 649, "end_char_pos": 660}, {"type": "A", "before": null, "after": "dynamic", "start_char_pos": 673, "end_char_pos": 673}, {"type": "D", "before": "in theory,", "after": null, "start_char_pos": 783, "end_char_pos": 793}, {"type": "R", "before": "choose", "after": "follow", "start_char_pos": 905, "end_char_pos": 911}, {"type": "R", "before": "to follow. More importantly", "after": ". To unload the heavy online computation", "start_char_pos": 955, "end_char_pos": 982}, {"type": "R", "before": ", which is", "after": "that can be", "start_char_pos": 1048, "end_char_pos": 1058}, {"type": "D", "before": ", to unload the heavy computation by the paradigm of offline training and online application", "after": null, "start_char_pos": 1107, "end_char_pos": 1199}, {"type": "R", "before": "multi-task", "after": "single complete", "start_char_pos": 1278, "end_char_pos": 1288}, {"type": "R", "before": "by our algorithm into", "after": "in the form of", "start_char_pos": 1324, "end_char_pos": 1345}, {"type": "R", "before": "simulation", "after": "simulations", "start_char_pos": 1468, "end_char_pos": 1478}, {"type": "R", "before": "our method has better", "after": "compared with baseline methods IDC has an order of magnitude higher", "start_char_pos": 1517, "end_char_pos": 1538}, {"type": "R", "before": "and", "after": ", as well as better", "start_char_pos": 1567, "end_char_pos": 1570}, {"type": "D", "before": "compared with baseline methods", "after": null, "start_char_pos": 1631, "end_char_pos": 1661}, {"type": "R", "before": "real road test also suggests that it is applicable in complicated traffic scenarios without even tuning", "after": "effectiveness of the proposed method is also demonstrated in real road tests with complicated traffic conditions", "start_char_pos": 1762, "end_char_pos": 1865}], "sents_char_pos": [0, 90, 336, 564, 662, 769, 965, 1435, 1498, 1663, 1757]} {"doc_id": "2103.11360", "revision_depth": "1", "before_revision": "Person names are essential entities in the Named Entity Recognition (NER) task. Traditional NER models have good performance in recognising well-formed person names from text with consistent and complete syntax, such as news articles. However, user-generated documents such as academic homepages and articles in online forums may contain lots of free-form text with incomplete syntax and person names in various forms . To address person name recognition in this context, we propose a fine-grained annotation scheme based on anthroponymy. To take full advantage of the fine-grained annotations, we propose a Co-guided Neural Network (CogNN) for person name recognition. CogNN fully explore the intra-sentence context and rich training signals of name forms. However, the inter-sentence context and implicit relations, which are extremely essential for recognizing person names in long documents, are not captured. To address this issue, we propose a Multi-inference Overlapped BERT Model ( NameRec*)through an overlapped input processor, and an inter-sentence encoder with bidirectional overlapped contextual embedding learning and multiple inference mechanisms. NameRec* takes full advantage of inter-sentence context in long documents, while loses advantage for short documents without too much inter-sentence context. To derive benefit from different documents with diverse abundance of context, we further propose an advanced Adaptive Multi-inference Overlapping BERT Model ( Ada-NameRec* ) to dynamically adjust the inter-sentence overlapping ratio to different documents. We conduct extensive experiments to demonstrate the superiority of the proposed methods on both academic homepages and news articles.", "after_revision": "In this paper, we introduce the NameRec* task, which aims to do highly accurate and fine-grained person name recognition. Traditional Named Entity Recognition models have good performance in recognising well-formed person names from text with consistent and complete syntax, such as news articles. However, there are rapidly growing scenarios where sentences are of incomplete syntax and names are in various forms such as user-generated contents and academic homepages . To address person name recognition in this context, we propose a fine-grained annotation scheme based on anthroponymy. To take full advantage of the fine-grained annotations, we propose a Co-guided Neural Network (CogNN) for person name recognition. CogNN fully explores the intra-sentence context and rich training signals of name forms. To better utilize the inter-sentence context and implicit relations, which are extremely essential for recognizing person names in long documents, we further propose an Inter-sentence BERT Model ( IsBERT). IsBERT has an overlapped input processor, and an inter-sentence encoder with bidirectional overlapped contextual embedding learning and multi-hop inference mechanisms. To derive benefit from different documents with a diverse abundance of context, we propose an advanced Adaptive Inter-sentence BERT Model ( Ada-IsBERT ) to dynamically adjust the inter-sentence overlapping ratio to different documents. We conduct extensive experiments to demonstrate the superiority of the proposed methods on both academic homepages and news articles.", "edit_actions": [{"type": "R", "before": "Person names are essential entities in the Named Entity Recognition (NER) task. Traditional NER", "after": "In this paper, we introduce the NameRec* task, which aims to do highly accurate and fine-grained person name recognition. Traditional Named Entity Recognition", "start_char_pos": 0, "end_char_pos": 95}, {"type": "R", "before": "user-generated documents such as academic homepages and articles in online forums may contain lots of free-form text with", "after": "there are rapidly growing scenarios where sentences are of", "start_char_pos": 244, "end_char_pos": 365}, {"type": "R", "before": "person names", "after": "names are", "start_char_pos": 388, "end_char_pos": 400}, {"type": "A", "before": null, "after": "such as user-generated contents and academic homepages", "start_char_pos": 418, "end_char_pos": 418}, {"type": "R", "before": "explore", "after": "explores", "start_char_pos": 683, "end_char_pos": 690}, {"type": "R", "before": "However,", "after": "To better utilize", "start_char_pos": 759, "end_char_pos": 767}, {"type": "R", "before": "are not captured. To address this issue, we propose a Multi-inference Overlapped", "after": "we further propose an Inter-sentence", "start_char_pos": 897, "end_char_pos": 977}, {"type": "R", "before": "NameRec*)through", "after": "IsBERT). IsBERT has", "start_char_pos": 991, "end_char_pos": 1007}, {"type": "R", "before": "multiple", "after": "multi-hop", "start_char_pos": 1133, "end_char_pos": 1141}, {"type": "D", "before": "NameRec* takes full advantage of inter-sentence context in long documents, while loses advantage for short documents without too much inter-sentence context.", "after": null, "start_char_pos": 1164, "end_char_pos": 1321}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1370, "end_char_pos": 1370}, {"type": "D", "before": "further", "after": null, "start_char_pos": 1404, "end_char_pos": 1411}, {"type": "R", "before": "Multi-inference Overlapping", "after": "Inter-sentence", "start_char_pos": 1441, "end_char_pos": 1468}, {"type": "R", "before": "Ada-NameRec*", "after": "Ada-IsBERT", "start_char_pos": 1482, "end_char_pos": 1494}], "sents_char_pos": [0, 79, 234, 420, 539, 670, 758, 914, 1163, 1321, 1579]} {"doc_id": "2103.11986", "revision_depth": "1", "before_revision": "FoF1-ATP synthases are the ubiquitous membrane enzymes which catalyze ATP synthesis or ATP hydrolysisin reverse, respectively. Enzyme kinetics are controlled by internal subunit rotation, by substrate and product concentrations, by mechanical inhibitory mechanisms, but also by the electrochemical potential of protons across the membrane. By utilizing an Anti-Brownian electrokinetic trap (ABEL trap), single-molecule F\\\"orster resonance energy transfer (smFRET) -based subunit rotation monitoring was prolonged from milliseconds to seconds . The extended observation times for single proteoliposomes in solution allowed to observe fluctuating rotation rates of individual enzymes and to map the broad distributions of ATP-dependent calatytic rates in FoF1-ATP synthase . The buildup of an electrochemical potential of protons was confirmed to limit the maximum rate of ATP hydrolysis. In the presence of ionophores and uncouplers the fastest subunit rotation speeds measured in single reconstituted FoF1-ATP synthases were 180 full rounds per second , i. e. much faster than measured by biochemical ensemble averaging, but not as fast as the maximum rotational speed reported previoulsy for isolated single F1 fragments without coupling to the membrane-embedded Fo domain of the enzyme .", "after_revision": "FoF1-ATP synthases are ubiquitous membrane-bound, rotary motor enzymes that can catalyze ATP synthesis and hydrolysis. Their enzyme kinetics are controlled by internal subunit rotation, by substrate and product concentrations, by mechanical inhibitory mechanisms, but also by the electrochemical potential of protons across the membrane. Single-molecule F\\\"orster resonance energy transfer (smFRET) has been used to detect subunit rotation within FoF1-ATP synthases embedded in freely diffusing liposomes. We now report that kinetic monitoring of functional rotation can be prolonged from milliseconds to seconds by utilizing an Anti-Brownian electrokinetic trap (ABEL trap). These extended observation times allowed us to observe fluctuating rates of functional rotation for individual FoF1-liposomes in solution. Broad distributions of ATP-dependent catalytic rates were revealed . The buildup of an electrochemical potential of protons was confirmed to limit the maximum rate of ATP hydrolysis. In the presence of ionophores or uncouplers, the fastest subunit rotation speeds measured in single reconstituted FoF1-ATP synthases were 180 full rounds per second . This was much faster than measured by biochemical ensemble averaging, but not as fast as the maximum rotational speed reported previously for isolated single F1 complexes uncoupled from the membrane-embedded Fo complex. Further application of ABEL trap measurements should help resolve the mechanistic causes of such fluctuating rates of subunit rotation .", "edit_actions": [{"type": "R", "before": "the ubiquitous membrane enzymes which", "after": "ubiquitous membrane-bound, rotary motor enzymes that can", "start_char_pos": 23, "end_char_pos": 60}, {"type": "R", "before": "or ATP hydrolysisin reverse, respectively. Enzyme", "after": "and hydrolysis. Their enzyme", "start_char_pos": 84, "end_char_pos": 133}, {"type": "R", "before": "By utilizing an Anti-Brownian electrokinetic trap (ABEL trap), single-molecule", "after": "Single-molecule", "start_char_pos": 340, "end_char_pos": 418}, {"type": "R", "before": "-based subunit rotation monitoring was", "after": "has been used to detect subunit rotation within FoF1-ATP synthases embedded in freely diffusing liposomes. We now report that kinetic monitoring of functional rotation can be", "start_char_pos": 464, "end_char_pos": 502}, {"type": "R", "before": ". The", "after": "by utilizing an Anti-Brownian electrokinetic trap (ABEL trap). These", "start_char_pos": 542, "end_char_pos": 547}, {"type": "R", "before": "for single proteoliposomes in solution allowed", "after": "allowed us", "start_char_pos": 575, "end_char_pos": 621}, {"type": "R", "before": "rotation rates of individual enzymes and to map the broad", "after": "rates of functional rotation for individual FoF1-liposomes in solution. Broad", "start_char_pos": 645, "end_char_pos": 702}, {"type": "R", "before": "calatytic rates in FoF1-ATP synthase", "after": "catalytic rates were revealed", "start_char_pos": 734, "end_char_pos": 770}, {"type": "R", "before": "and uncouplers", "after": "or uncouplers,", "start_char_pos": 917, "end_char_pos": 931}, {"type": "R", "before": ", i. e.", "after": ". This was", "start_char_pos": 1052, "end_char_pos": 1059}, {"type": "R", "before": "previoulsy", "after": "previously", "start_char_pos": 1178, "end_char_pos": 1188}, {"type": "R", "before": "fragments without coupling to", "after": "complexes uncoupled from", "start_char_pos": 1212, "end_char_pos": 1241}, {"type": "R", "before": "domain of the enzyme", "after": "complex. Further application of ABEL trap measurements should help resolve the mechanistic causes of such fluctuating rates of subunit rotation", "start_char_pos": 1267, "end_char_pos": 1287}], "sents_char_pos": [0, 126, 339, 543, 772, 886]} {"doc_id": "2103.13581", "revision_depth": "2", "before_revision": "Speaker recognition refers to audio biometrics that utilizes acoustic characteristics for automatic speaker recognition . These systems have emerged as an essential means of verifying identity in various scenarios, such as smart homes, general business interactions, e-commerce applications, and forensics. However, the mismatch between training and real-world data causes a shift of speaker embedding space and severely degrades the recognition performance . Various complicated neural architectures are presented to address speaker recognition in the wild but neglect storage and computation requirements. To address this issue , we propose a neural architecture search-based efficient time-delay neural network (EfficientTDNN) to improve inference efficiency while maintaining recognition accuracy. The proposed EfficientTDNN contains three phases . First, supernet designconstructs a dynamic neural architecture that consists of sequential cells and enables network pruning. Second , progressive training optimizes randomly sampled subnets that inherit the weights of the supernet . Third, three search methods, including manual grid search, random search, and model predictive evolutionary search, are introduced to find a trade-off between accuracy and efficiency. Results of experiments on the VoxCeleb dataset show EfficientTDNN provides a vast search space including approximately 10^{13 achieves 1.55\\% EER and 0.138 DCF_{0.01 with 565M MACs as well as 0.96\\% EER and 0.108 DCF_{0.01} with 1.46G MACs. Comprehensive investigation suggests that the trained supernet generalizes cells unseen during training and obtains an acceptable balance between accuracy and efficiency.", "after_revision": "Speaker recognition refers to audio biometrics that utilizes acoustic characteristics . These systems have emerged as an essential means of authenticating identity in various areas such as smart homes, general business interactions, e-commerce applications, and forensics. The mismatch between development and real-world data causes a shift of speaker embedding space and severely degrades the performance of speaker recognition. Extensive efforts have been devoted to address speaker recognition in the wild , but these often neglect computation and storage requirements. In this work , we propose an efficient time-delay neural network (EfficientTDNN) based on neural architecture search to improve inference efficiency while maintaining recognition accuracy. The proposed EfficientTDNN contains three phases : supernet design , progressive training , and architecture search. Firstly, we borrow the design of TDNN to construct a supernet that enables sampling subnets with different depth, kernel, and width. Secondly, the supernet is progressively trained with multi-condition data augmentation to mitigate interference between subnets and overcome the challenge of optimizing a huge search space. Thirdly, an accuracy predictor and efficiency estimator are proposed to use in the architecture search to derive the specialized subnet under the given efficiency constraints. Experimental results on the VoxCeleb dataset show EfficientTDNN achieves 1.55\\% equal error rate (EER) and 0.138 detection cost function (DCF_{0.01 with 565M multiply-accumulate operations (MACs) as well as 0.96\\% EER and 0.108 DCF_{0.01} with 1.46G MACs. Comprehensive investigations suggest that the trained supernet generalizes subnets not sampled during training and obtains a favorable trade-off between accuracy and efficiency.", "edit_actions": [{"type": "D", "before": "for automatic speaker recognition", "after": null, "start_char_pos": 86, "end_char_pos": 119}, {"type": "R", "before": "verifying", "after": "authenticating", "start_char_pos": 174, "end_char_pos": 183}, {"type": "R", "before": "scenarios,", "after": "areas", "start_char_pos": 204, "end_char_pos": 214}, {"type": "R", "before": "However, the mismatch between training", "after": "The mismatch between development", "start_char_pos": 307, "end_char_pos": 345}, {"type": "R", "before": "recognition performance . Various complicated neural architectures are presented", "after": "performance of speaker recognition. Extensive efforts have been devoted", "start_char_pos": 434, "end_char_pos": 514}, {"type": "R", "before": "but neglect storage and computation requirements. To address this issue", "after": ", but these often neglect computation and storage requirements. In this work", "start_char_pos": 558, "end_char_pos": 629}, {"type": "R", "before": "a neural architecture search-based", "after": "an", "start_char_pos": 643, "end_char_pos": 677}, {"type": "A", "before": null, "after": "based on neural architecture search", "start_char_pos": 730, "end_char_pos": 730}, {"type": "R", "before": ". First, supernet designconstructs a dynamic neural architecture that consists of sequential cells and enables network pruning. Second", "after": ": supernet design", "start_char_pos": 852, "end_char_pos": 986}, {"type": "R", "before": "optimizes randomly sampled subnets that inherit the weights of the supernet . Third, three search methods, including manual grid search, random search, and model predictive evolutionary search, are introduced to find a trade-off between accuracy", "after": ", and architecture search. Firstly, we borrow the design of TDNN to construct a supernet that enables sampling subnets with different depth, kernel,", "start_char_pos": 1010, "end_char_pos": 1255}, {"type": "R", "before": "efficiency. Results of experiments", "after": "width. Secondly, the supernet is progressively trained with multi-condition data augmentation to mitigate interference between subnets and overcome the challenge of optimizing a huge search space. Thirdly, an accuracy predictor and efficiency estimator are proposed to use in the architecture search to derive the specialized subnet under the given efficiency constraints. Experimental results", "start_char_pos": 1260, "end_char_pos": 1294}, {"type": "D", "before": "provides a vast search space including approximately 10^{13", "after": null, "start_char_pos": 1338, "end_char_pos": 1397}, {"type": "R", "before": "EER", "after": "equal error rate (EER)", "start_char_pos": 1414, "end_char_pos": 1417}, {"type": "R", "before": "DCF_{0.01", "after": "detection cost function (DCF_{0.01", "start_char_pos": 1428, "end_char_pos": 1437}, {"type": "R", "before": "MACs", "after": "multiply-accumulate operations (MACs)", "start_char_pos": 1448, "end_char_pos": 1452}, {"type": "R", "before": "investigation suggests", "after": "investigations suggest", "start_char_pos": 1527, "end_char_pos": 1549}, {"type": "R", "before": "cells unseen", "after": "subnets not sampled", "start_char_pos": 1588, "end_char_pos": 1600}, {"type": "R", "before": "an acceptable balance", "after": "a favorable trade-off", "start_char_pos": 1629, "end_char_pos": 1650}], "sents_char_pos": [0, 121, 306, 607, 802, 853, 979, 1087, 1271, 1512]} {"doc_id": "2103.14220", "revision_depth": "1", "before_revision": "This paper investigates the impact of Reconstruction-era amnesty policy on the officeholding and wealth of planter elites in the postbellum U.S. South. Amnesty policy restricted the political and economic rights of the planter class for nearly three years during Reconstruction. The paper estimates the effects of being excepted from amnesty on elites' future wealth and political power using a regression discontinuity design . Results on a sample of delegates to Reconstruction conventions show that exclusion from amnesty substantially decreases the likelihood of holding political office . I find no evidence that exclusion from amnesty impacted later census wealth for Reconstruction delegates or for a larger sample of known slaveholders who lived in the South in 1860. These findings are in line with previous studies evidencing changes to the identity of the political elite and continuity of economic mobility for the planter elite across the Civil War and Reconstruction.", "after_revision": "This paper investigates the impact of Reconstruction-era amnesty policy on the officeholding and wealth of elites in the postbellum South. Amnesty policy restricted the political and economic rights of Southern elites for nearly three years during Reconstruction. I estimate the effect of being excluded from amnesty on elites' future wealth and political power using a regression discontinuity design that compares individuals just above and below a wealth threshold that determined exclusion from amnesty . Results on a sample of Reconstruction convention delegates show that exclusion from amnesty significantly decreased the likelihood of ex-post officeholding . I find no evidence that exclusion impacted later census wealth for Reconstruction delegates or for a larger sample of known slaveholders who lived in the South in 1860. These findings are in line with previous studies evidencing both changes to the identity of the political elite , and the continuity of economic mobility among the planter elite across the Civil War and Reconstruction.", "edit_actions": [{"type": "D", "before": "planter", "after": null, "start_char_pos": 107, "end_char_pos": 114}, {"type": "D", "before": "U.S.", "after": null, "start_char_pos": 140, "end_char_pos": 144}, {"type": "R", "before": "the planter class", "after": "Southern elites", "start_char_pos": 215, "end_char_pos": 232}, {"type": "R", "before": "The paper estimates the effects of being excepted", "after": "I estimate the effect of being excluded", "start_char_pos": 279, "end_char_pos": 328}, {"type": "A", "before": null, "after": "that compares individuals just above and below a wealth threshold that determined exclusion from amnesty", "start_char_pos": 427, "end_char_pos": 427}, {"type": "R", "before": "delegates to Reconstruction conventions", "after": "Reconstruction convention delegates", "start_char_pos": 453, "end_char_pos": 492}, {"type": "R", "before": "substantially decreases", "after": "significantly decreased", "start_char_pos": 526, "end_char_pos": 549}, {"type": "R", "before": "holding political office", "after": "ex-post officeholding", "start_char_pos": 568, "end_char_pos": 592}, {"type": "D", "before": "from amnesty", "after": null, "start_char_pos": 629, "end_char_pos": 641}, {"type": "A", "before": null, "after": "both", "start_char_pos": 837, "end_char_pos": 837}, {"type": "R", "before": "and", "after": ", and the", "start_char_pos": 885, "end_char_pos": 888}, {"type": "R", "before": "for", "after": "among", "start_char_pos": 921, "end_char_pos": 924}], "sents_char_pos": [0, 151, 278, 594, 776]} {"doc_id": "2103.14972", "revision_depth": "1", "before_revision": "This paper describes a corpus annotation process to support the identification of hate speech and offensive language in social media. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: a binary classification (offensive versus non-offensive comments ), the level of the offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). Each comment was annotated by three different annotators, which achieved high inter-annotator agreement .", "after_revision": "This paper describes a corpus annotation process to support the identification of hate speech and offensive language in social media. In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: a binary classification (offensive versus non-offensive language ), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). Each comment was annotated by three different annotators, which achieved high inter-annotator agreement . The proposed annotation process is also language and domain independent .", "edit_actions": [{"type": "A", "before": null, "after": "In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language.", "start_char_pos": 134, "end_char_pos": 134}, {"type": "R", "before": "comments", "after": "language", "start_char_pos": 369, "end_char_pos": 377}, {"type": "D", "before": "the", "after": null, "start_char_pos": 394, "end_char_pos": 397}, {"type": "A", "before": null, "after": ". The proposed annotation process is also language and domain independent", "start_char_pos": 790, "end_char_pos": 790}], "sents_char_pos": [0, 133, 312, 685]} {"doc_id": "2103.14972", "revision_depth": "2", "before_revision": "This paper describes a corpus annotation process to support the identification of hate speech and offensive language in social media. In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. The proposed annotation process is also language and domain independent .", "after_revision": "This paper describes a corpus annotation process to support the identification of hate speech and offensive language in social media. In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. The proposed annotation approach is also language and domain independent , nevertheless, it was currently applied for Brazilian Portuguese .", "edit_actions": [{"type": "R", "before": "process", "after": "approach", "start_char_pos": 906, "end_char_pos": 913}, {"type": "A", "before": null, "after": ", nevertheless, it was currently applied for Brazilian Portuguese", "start_char_pos": 954, "end_char_pos": 954}], "sents_char_pos": [0, 133, 230, 408, 776, 881]} {"doc_id": "2103.14972", "revision_depth": "3", "before_revision": "This paperdescribes a corpus annotation process to support the identification of hate speech and offensive language in social media. In addition, we provide the first robust corpus this kind for the Brazilian Portuguese language. The corpus was collected from Instagram pages of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religion intolerance, partyism, apology to the dictatorship, antisemitism and fat phobia). Each comment was annotated by three different annotators, which achieved high inter-annotator agreement. The proposed annotation approach is also language and domain independent, nevertheless, it was currently applied for Brazilian Portuguese .", "after_revision": "The understanding of an offense is subjective and people may have different opinions about the offensiveness of a comment. Also, offenses and hate speech may occur through sarcasm, which hides the real intention of the comment and makes the decision of the annotators more confusing. Therefore, provide a well-structured annotation process is crucial to a better understanding of hate speech and offensive language phenomena, as well as supply better performance for machine learning classifiers. In this paper, we describe a corpus annotation process , which was guided by a linguist, and a hate speech skilled to support the identification of hate speech and offensive language on social media. In addition, we provide the first robust corpus of this kind for the Brazilian Portuguese language. The corpus was collected from Instagram posts of political personalities and manually annotated, being composed by 7,000 documents annotated according to three different layers: a binary classification (offensive versus non-offensive language), the level of offense (highly offensive, moderately offensive , and slightly offensive messages), and the identification regarding the target of the discriminatory content (xenophobia, racism, homophobia, sexism, religious intolerance, partyism, apology to the dictatorship, antisemitism , and fat phobia). Each comment was annotated by three different annotators, and achieved high inter-annotator agreement. The new proposed annotation approach is also language and domain-independent (although it has been applied for Brazilian Portuguese ) .", "edit_actions": [{"type": "R", "before": "This paperdescribes", "after": "The understanding of an offense is subjective and people may have different opinions about the offensiveness of a comment. Also, offenses and hate speech may occur through sarcasm, which hides the real intention of the comment and makes the decision of the annotators more confusing. Therefore, provide a well-structured annotation process is crucial to a better understanding of hate speech and offensive language phenomena, as well as supply better performance for machine learning classifiers. In this paper, we describe", "start_char_pos": 0, "end_char_pos": 19}, {"type": "A", "before": null, "after": ", which was guided by a linguist, and a hate speech skilled", "start_char_pos": 48, "end_char_pos": 48}, {"type": "R", "before": "in", "after": "on", "start_char_pos": 117, "end_char_pos": 119}, {"type": "A", "before": null, "after": "of", "start_char_pos": 182, "end_char_pos": 182}, {"type": "R", "before": "pages", "after": "posts", "start_char_pos": 272, "end_char_pos": 277}, {"type": "A", "before": null, "after": ",", "start_char_pos": 538, "end_char_pos": 538}, {"type": "R", "before": "religion", "after": "religious", "start_char_pos": 688, "end_char_pos": 696}, {"type": "A", "before": null, "after": ",", "start_char_pos": 762, "end_char_pos": 762}, {"type": "R", "before": "which", "after": "and", "start_char_pos": 838, "end_char_pos": 843}, {"type": "A", "before": null, "after": "new", "start_char_pos": 889, "end_char_pos": 889}, {"type": "R", "before": "domain independent, nevertheless, it was currently", "after": "domain-independent (although it has been", "start_char_pos": 940, "end_char_pos": 990}, {"type": "A", "before": null, "after": ")", "start_char_pos": 1024, "end_char_pos": 1024}], "sents_char_pos": [0, 133, 231, 409, 779, 884]} {"doc_id": "2103.15356", "revision_depth": "1", "before_revision": "Recently discovered simple quantitative relations knowns as bacterial growth laws hints on the existence of simple underlying principles at the heart of bacterial growth. In this work we provide a unifying picture on how these known relations, as well as new relations which we derive, stems from a universal autocatalytic network common to all bacteria, facilitating balanced exponential growth of individual cells. We show that the core of the cellular autocatalytic network is the transcription-translation machinery which by itself is an autocatalytic network composed of several coupled autocatalytic cycles like ribosome, RNA-polymerase and tRNA charging cycles. We derive two kinds of growth laws per autocatalytic cycle, relating growth rate to the relative fraction of the catalyst and its catalysis rate and relating growth rate to all the time-scales in the cycle. The autocatalytic network structure defines multiple growth regimes , determined by the limiting components . The number of growth regimes can be very large , while the number of growth laws obtained can be much smaller. We derive a growth law that accounts for RNA-polymerase auto-catalytic cycle, which we use to explain the dependence of growth rate on an inducible expression of rpoB and rpoC genes that code for RpoB and RpoC protein subunits of RNA-polymerase, and to explain how the concentration of rifampicin -- a drug that targets RNA-polymerase , affects growth rate without changing the RNA to protein ratio. We further derive growth laws for tRNA synthesis and charging and predict how perturbations to ribosome assembly or membrane synthesisaffect the growth rate .", "after_revision": "Recently discovered simple quantitative relations known as bacterial growth laws hints on the existence of simple underlying principles at the heart of bacterial growth. In this work we provide a unifying picture on how these known relations, as well as new relations which we derive, stems from a universal autocatalytic network common to all bacteria, facilitating balanced exponential growth of individual cells. We show that the core of the cellular autocatalytic network is the transcription--translation machinery -- in itself an autocatalytic network comprising several coupled autocatalytic cycles , including the ribosome, RNA polymerase, and tRNA charging cycles. We derive two types of growth laws per autocatalytic cycle, one relating growth rate to the relative fraction of the catalyst and its catalysis rate , and the other relating growth rate to all the time--scales in the cycle. The structure of the autocatalytic network generates numerous regimes in state space , determined by the limiting components , while the number of growth laws can be much smaller. We also derive a growth law that accounts for the RNA polymerase autocatalytic cycle, which we use to explain how growth rate depends on the inducible expression of the rpoB and rpoC genes , which code for the RpoB and RpoC protein subunits of RNA polymerase, and how the concentration of rifampicin , which targets RNA polymerase , affects growth rate without changing the RNA-to-protein ratio. We derive growth laws for tRNA synthesis and charging , and predict how growth rate depends on temperature, perturbation to ribosome assembly and membrane synthesis .", "edit_actions": [{"type": "R", "before": "knowns", "after": "known", "start_char_pos": 50, "end_char_pos": 56}, {"type": "R", "before": "transcription-translation machinery which by itself is", "after": "transcription--translation machinery -- in itself", "start_char_pos": 484, "end_char_pos": 538}, {"type": "R", "before": "composed of", "after": "comprising", "start_char_pos": 564, "end_char_pos": 575}, {"type": "R", "before": "like ribosome, RNA-polymerase", "after": ", including the ribosome, RNA polymerase,", "start_char_pos": 613, "end_char_pos": 642}, {"type": "R", "before": "kinds", "after": "types", "start_char_pos": 683, "end_char_pos": 688}, {"type": "A", "before": null, "after": "one", "start_char_pos": 729, "end_char_pos": 729}, {"type": "R", "before": "and", "after": ", and the other", "start_char_pos": 815, "end_char_pos": 818}, {"type": "R", "before": "time-scales", "after": "time--scales", "start_char_pos": 851, "end_char_pos": 862}, {"type": "R", "before": "autocatalytic network structure defines multiple growth regimes", "after": "structure of the autocatalytic network generates numerous regimes in state space", "start_char_pos": 881, "end_char_pos": 944}, {"type": "D", "before": ". The number of growth regimes can be very large", "after": null, "start_char_pos": 985, "end_char_pos": 1033}, {"type": "D", "before": "obtained", "after": null, "start_char_pos": 1068, "end_char_pos": 1076}, {"type": "A", "before": null, "after": "also", "start_char_pos": 1101, "end_char_pos": 1101}, {"type": "R", "before": "RNA-polymerase auto-catalytic", "after": "the RNA polymerase autocatalytic", "start_char_pos": 1140, "end_char_pos": 1169}, {"type": "R", "before": "the dependence of growth rate on an", "after": "how growth rate depends on the", "start_char_pos": 1201, "end_char_pos": 1236}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1261, "end_char_pos": 1261}, {"type": "R", "before": "that code for", "after": ", which code for the", "start_char_pos": 1282, "end_char_pos": 1295}, {"type": "R", "before": "RNA-polymerase, and to explain", "after": "RNA polymerase, and", "start_char_pos": 1330, "end_char_pos": 1360}, {"type": "R", "before": "-- a drug that targets RNA-polymerase", "after": ", which targets RNA polymerase", "start_char_pos": 1397, "end_char_pos": 1434}, {"type": "R", "before": "RNA to protein", "after": "RNA-to-protein", "start_char_pos": 1478, "end_char_pos": 1492}, {"type": "D", "before": "further", "after": null, "start_char_pos": 1503, "end_char_pos": 1510}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1562, "end_char_pos": 1562}, {"type": "R", "before": "perturbations", "after": "growth rate depends on temperature, perturbation", "start_char_pos": 1579, "end_char_pos": 1592}, {"type": "R", "before": "or membrane synthesisaffect the growth rate", "after": "and membrane synthesis", "start_char_pos": 1614, "end_char_pos": 1657}], "sents_char_pos": [0, 170, 416, 668, 876, 986, 1097, 1499]} {"doc_id": "2104.00207", "revision_depth": "1", "before_revision": "In this article, we consider colorable variations of the Unit Disk Cover ({\\it UDC}) problem as follows. {\\it k-Colorable Discrete Unit Disk Cover ({\\it k-CDUDC})}: Given a set P of n points, and a set D of m unit disks (of radius=1), both lying in the plane, and a parameter k, the objective is to compute a set D'\\subseteq D such that every point in P is covered by at least one disk in D' and there exists a function \\chi:D'\\rightarrow C that assigns colors to disks in D' such that for any d and d' in D' if d\\cap d'\\neq\\emptyset, then \\chi(d)\\neq\\chi(d'), where C denotes a set containing k distinct colors. For the {\\it k-CDUDC} problem, our proposed algorithms approximate the number of colors used in the coloring if there exists a k-colorable cover. We first propose a 4-approximation algorithm in O(m^{7k}n\\log k) time for this problem , where k is a positive integer . The previous best known result for the problem when k=3 is due to the recent work of Biedl et al. CCCG 2019 , who proposed a 2-approximation algorithm in O(m^{25}n) time. For k=3, our algorithm runs in O(m^{ 21 }n) time, faster than the previous best algorithm, but gives a 4-approximate result. We then generalize our approach to yield a family of \\rho\\lceil{\\tau}}\\rceil -approximation algorithms in O(m^{\\alpha kn\\log k) time, where (\\rho,\\alpha)\\in \\{(4, 7), (6,5), (7, 5), (9,4)\\}. We further generalize this to exhibit a O(1{\\tau})-approximation } algorithm in O(m^{ \\alpha\\lfloor{\\sqrt{12}}}\\rfloor k}n\\log k) time for a given grid width 1 \\leq \\tau \\leq 2, where \\alpha=O(\\tau^2). We also extend our algorithm to solve the {\\it k-Colorable Line Segment Disk Cover ({\\it k-CLSDC})} and {\\it k-Colorable Rectangular Region Cover ({\\it k-CRRC})} problems, in which instead of the set P of n points, we are given a set S of n line segments, and a rectangular region \\cal R, respectively.", "after_revision": "In this article, we consider colorable variations of the Unit Disk Cover ({\\it UDC}) problem as follows. {\\it k-Colorable Discrete Unit Disk Cover ({\\it k-CDUDC})}: Given a set P of n points, and a set D of m unit disks (of radius=1), both lying in the plane, and a parameter k, the objective is to compute a set D'\\subseteq D such that every point in P is covered by at least one disk in D' and there exists a function \\chi:D'\\rightarrow C that assigns colors to disks in D' such that for any d and d' in D' if d\\cap d'\\neq\\emptyset, then \\chi(d)\\neq\\chi(d'), where C denotes a set containing k distinct colors. For the {\\it k-CDUDC} problem, our proposed algorithms approximate the number of colors used in the coloring if there exists a k-colorable cover. We first propose a 4-approximation algorithm in O(m^{7k}n\\log k) time for this problem and then show that the running time can be improved by a multiplicative factor of m^k, where a positive integer k denotes the cardinality of a color-set . The previous best known result for the problem when k=3 is due to the recent work of Biedl et al. , (2021), who proposed a 2-approximation algorithm in O(m^{25}n) time. For k=3, our algorithm runs in O(m^{ 18 }n) time, faster than the previous best algorithm, but gives a 4-approximate result. We then generalize our approach to exhibit a O((1+\\lceil\\frac{2{\\tau}}\\rceil)^2) -approximation n\\log k) time, where (\\rho,\\alpha)\\in \\{(4, 7), (6,5), (7, 5), (9,4)\\}. We further generalize this to exhibit a O(1{\\tau})-approximation } algorithm in O(m^{ (\\lfloor\\frac{4\\pi+8\\tau+\\tau^2{\\sqrt{12}}}\\rfloor) k}n\\log k) time for a given 1 \\leq \\tau \\leq 2. We also extend our algorithm to solve the {\\it k-Colorable Line Segment Disk Cover ({\\it k-CLSDC})} and {\\it k-Colorable Rectangular Region Cover ({\\it k-CRRC})} problems, in which instead of the set P of n points, we are given a set S of n line segments, and a rectangular region \\cal R, respectively.", "edit_actions": [{"type": "R", "before": ", where k is", "after": "and then show that the running time can be improved by a multiplicative factor of m^k, where", "start_char_pos": 846, "end_char_pos": 858}, {"type": "A", "before": null, "after": "k denotes the cardinality of a color-set", "start_char_pos": 878, "end_char_pos": 878}, {"type": "D", "before": "CCCG 2019", "after": null, "start_char_pos": 979, "end_char_pos": 988}, {"type": "R", "before": ",", "after": ", (2021),", "start_char_pos": 989, "end_char_pos": 990}, {"type": "R", "before": "21", "after": "18", "start_char_pos": 1089, "end_char_pos": 1091}, {"type": "R", "before": "yield a family of \\rho", "after": "exhibit a O((1+", "start_char_pos": 1212, "end_char_pos": 1234}, {"type": "A", "before": null, "after": "\\frac{2", "start_char_pos": 1240, "end_char_pos": 1240}, {"type": "A", "before": null, "after": ")^2)", "start_char_pos": 1253, "end_char_pos": 1253}, {"type": "D", "before": "algorithms in O(m^{\\alpha k", "after": null, "start_char_pos": 1269, "end_char_pos": 1296}, {"type": "R", "before": "\\alpha", "after": "(", "start_char_pos": 1454, "end_char_pos": 1460}, {"type": "A", "before": null, "after": "\\frac{4\\pi+8\\tau+\\tau^2", "start_char_pos": 1467, "end_char_pos": 1467}, {"type": "A", "before": null, "after": ")", "start_char_pos": 1486, "end_char_pos": 1486}, {"type": "D", "before": "grid width", "after": null, "start_char_pos": 1515, "end_char_pos": 1525}, {"type": "R", "before": "2, where \\alpha=O(\\tau^2).", "after": "2.", "start_char_pos": 1543, "end_char_pos": 1569}], "sents_char_pos": [0, 104, 164, 612, 758, 880, 978, 1051, 1176, 1367, 1569]} {"doc_id": "2104.00213", "revision_depth": "1", "before_revision": "In this paper, we investigate projection-based intrusive and data-driven non-intrusive model order reduction (MOR) methods in the numerical simulation of the rotating thermal shallow water equation (RTSWE) in parametric and non-parametric form. The RTSWE is a non-canonical Hamiltonian partial differential equation (PDE) with the associated conserved quantities, i.e., Hamiltonian (energy), mass, buoyancy, and the total vorticity. Discretization of the RTSWE in space with centered finite differences leads to Hamiltonian system of ordinary differential equations (ODEs) with linear and quadratic terms. The intrusive reduced-order model (ROM) is constructed with the proper orthogonal decomposition (POD) with the Galerkin projection (POD-G) . We apply the operator inference (OpInf) with re-projection for non-intrusive reduced-order modeling. The OpInf non-intrusively learns a reduced model from state snapshot and time derivative which approximate the evolution of the RTSWE within a low-dimensional subspace. The OpInf data sampling scheme to obtain re-projected trajectories of the RTSWE corresponding to Markovian dynamics in low-dimensional subspaces, recovers of reduced models with high accuracy. In the parametric case, for both methods, we make use of the parameter dependency at the level of the PDE without interpolating between the reduced operators. The least-squares problem of the OpInf is regularized with the minimum norm solution. Both reduced models are able to accurately re-predict the training data and capture much of the overall system behavior in the prediction period. Due to re-projection, the OpInf is more costly than the POG-G, nevertheless, speed-up factors of order two are achieved for both ROMs. Numerical results demonstrate that the conserved quantities of the RTSWE are preserved for both ROMs over time and the long-term stability of the reduced solutions is achieved .", "after_revision": "In this paper, we investigate projection-based intrusive and data-driven non-intrusive model order reduction methods in numerical simulation of rotating thermal shallow water equation (RTSWE) in parametric and non-parametric form. Discretization of the RTSWE in space with centered finite differences leads to Hamiltonian system of ordinary differential equations with linear and quadratic terms. The full-order model (FOM) is obtained by applying linearly implicit Kahan's method in time. Applying proper orthogonal decomposition with Galerkin projection (POD-G) , we construct the intrusive reduced-order model (ROM) . We apply operator inference (OpInf) with re-projection for non-intrusive reduced-order modeling. In the parametric case, we make use of the parameter dependency at the level of the PDE without interpolating between the reduced operators. The least-squares problem of the OpInf is regularized with the minimum norm solution. Both ROMs behave similar and are able to accurately predict the test and training data and capture system behavior in the prediction phase with several orders of computational speedup over the FOM. The preservation of system physics such as the conserved quantities of the RTSWE by both ROMs enables that the models fit better to data and stable solutions are obtained in long-term predictions, which are robust to parameter changes .", "edit_actions": [{"type": "R", "before": "(MOR) methods in the", "after": "methods in", "start_char_pos": 109, "end_char_pos": 129}, {"type": "D", "before": "the", "after": null, "start_char_pos": 154, "end_char_pos": 157}, {"type": "D", "before": "The RTSWE is a non-canonical Hamiltonian partial differential equation (PDE) with the associated conserved quantities, i.e., Hamiltonian (energy), mass, buoyancy, and the total vorticity.", "after": null, "start_char_pos": 245, "end_char_pos": 432}, {"type": "D", "before": "(ODEs)", "after": null, "start_char_pos": 566, "end_char_pos": 572}, {"type": "R", "before": "intrusive reduced-order model (ROM) is constructed with the", "after": "full-order model (FOM) is obtained by applying linearly implicit Kahan's method in time. Applying", "start_char_pos": 610, "end_char_pos": 669}, {"type": "R", "before": "(POD) with the", "after": "with", "start_char_pos": 702, "end_char_pos": 716}, {"type": "A", "before": null, "after": ", we construct the intrusive reduced-order model (ROM)", "start_char_pos": 745, "end_char_pos": 745}, {"type": "D", "before": "the", "after": null, "start_char_pos": 757, "end_char_pos": 760}, {"type": "D", "before": "The OpInf non-intrusively learns a reduced model from state snapshot and time derivative which approximate the evolution of the RTSWE within a low-dimensional subspace. The OpInf data sampling scheme to obtain re-projected trajectories of the RTSWE corresponding to Markovian dynamics in low-dimensional subspaces, recovers of reduced models with high accuracy.", "after": null, "start_char_pos": 849, "end_char_pos": 1210}, {"type": "D", "before": "for both methods,", "after": null, "start_char_pos": 1235, "end_char_pos": 1252}, {"type": "R", "before": "reduced models", "after": "ROMs behave similar and", "start_char_pos": 1461, "end_char_pos": 1475}, {"type": "R", "before": "re-predict the", "after": "predict the test and", "start_char_pos": 1499, "end_char_pos": 1513}, {"type": "D", "before": "much of the overall", "after": null, "start_char_pos": 1540, "end_char_pos": 1559}, {"type": "R", "before": "period. Due to re-projection, the OpInf is more costly than the POG-G, nevertheless, speed-up factors of order two are achieved for both ROMs. Numerical results demonstrate that", "after": "phase with several orders of computational speedup over the FOM. The preservation of system physics such as", "start_char_pos": 1594, "end_char_pos": 1771}, {"type": "R", "before": "are preserved for both ROMs over time and the", "after": "by both ROMs enables that the models fit better to data and stable solutions are obtained in", "start_char_pos": 1810, "end_char_pos": 1855}, {"type": "R", "before": "stability of the reduced solutions is achieved", "after": "predictions, which are robust to parameter changes", "start_char_pos": 1866, "end_char_pos": 1912}], "sents_char_pos": [0, 244, 432, 605, 848, 1017, 1210, 1369, 1455, 1601]} {"doc_id": "2104.01131", "revision_depth": "1", "before_revision": "Social media plays a pivotal role in disseminating news across the globe and acts as a platform for people to express their opinions on a variety of topics. COVID-19 vaccination drives across the globe are accompanied by a wide variety of expressed opinions , often colored by emotions . We extracted a corpus of Twitter posts related to COVID-19 vaccination and created two classes of lexical categories- Emotions and Influencing factors. Using unsupervised word embeddings, we tracked the longitudinal change in the latent space of the lexical categories in five countries with strong vaccine roll-out programs, i.e. India, USA , Brazil, UK , and Australia. Nearly 600 thousand vaccine-related tweets from the United States and India were analyzed for an overall understanding of the situation around the world for the time period of 8 months from June 2020 to January 2021. Cosine distance between lexical categories was used to create similarity networks and modules using community detection algorithms . We demonstrate that negative emotions like hesitancy towards vaccines have a high correlation with health-related effects and misinformation. These associations formed a major module with the highest importance in the network formed for January 2021, when millions of vaccines were administered . The relationship between emotions and influencing factors were found to be variable across the countries . By extracting and visualizing these, we propose that such a framework may be helpful in guiding the design of effective vaccine campaigns and can be used by policymakers for modeling vaccine uptake .", "after_revision": "Social media plays a pivotal role in disseminating news globally and acts as a platform for people to express their opinions on various topics. A wide variety of views accompanies COVID-19 vaccination drives across the globe , often colored by emotions , which change along with rising cases, approval of vaccines, and multiple factors discussed online. This study aims at analyzing the temporal evolution of different Emotion categories: Hesitation, Rage, Sorrow, Anticipation, Faith, and Contentment with Influencing Factors: Vaccine Rollout, Misinformation, Health Effects, and Inequities as lexical categories created from Tweets belonging to five countries with vital vaccine roll-out programs, namely, India, United States of America , Brazil, United Kingdom , and Australia. We extracted a corpus of nearly 1.8 million Twitter posts related to COVID-19 vaccination. Using cosine distance from selected seed words, we expanded the vocabulary of each category and tracked the longitudinal change in their strength from June 2020 to April 2021. We used community detection algorithms to find modules in positive correlation networks. Our findings suggest that tweets expressing hesitancy towards vaccines contain the highest mentions of health-related effects in all countries. Our results indicated that the patterns of hesitancy were variable across geographies and can help us learn targeted interventions. We also observed a significant change in the linear trends of categories like hesitation and contentment before and after approval of vaccines. Negative emotions like rage and sorrow gained the highest importance in the alluvial diagram. They formed a significant module with all the influencing factors in April 2021, when India observed the second wave of COVID-19 cases . The relationship between Emotions and Influencing Factors was found to be variable across the countries .", "edit_actions": [{"type": "R", "before": "across the globe", "after": "globally", "start_char_pos": 56, "end_char_pos": 72}, {"type": "R", "before": "a variety of topics.", "after": "various topics. A wide variety of views accompanies", "start_char_pos": 136, "end_char_pos": 156}, {"type": "D", "before": "are accompanied by a wide variety of expressed opinions", "after": null, "start_char_pos": 202, "end_char_pos": 257}, {"type": "R", "before": ". We extracted a corpus of Twitter posts related to COVID-19 vaccination and created two classes of lexical categories- Emotions and Influencing factors. Using unsupervised word embeddings, we tracked the longitudinal change in the latent space of the lexical categories in", "after": ", which change along with rising cases, approval of vaccines, and multiple factors discussed online. This study aims at analyzing the temporal evolution of different Emotion categories: Hesitation, Rage, Sorrow, Anticipation, Faith, and Contentment with Influencing Factors: Vaccine Rollout, Misinformation, Health Effects, and Inequities as lexical categories created from Tweets belonging to", "start_char_pos": 286, "end_char_pos": 559}, {"type": "R", "before": "strong", "after": "vital", "start_char_pos": 580, "end_char_pos": 586}, {"type": "R", "before": "i.e. India, USA", "after": "namely, India, United States of America", "start_char_pos": 614, "end_char_pos": 629}, {"type": "R", "before": "UK", "after": "United Kingdom", "start_char_pos": 640, "end_char_pos": 642}, {"type": "R", "before": "Nearly 600 thousand vaccine-related tweets from the United States and India were analyzed for an overall understanding of the situation around the world for the time period of 8 months", "after": "We extracted a corpus of nearly 1.8 million Twitter posts related to COVID-19 vaccination. Using cosine distance from selected seed words, we expanded the vocabulary of each category and tracked the longitudinal change in their strength", "start_char_pos": 660, "end_char_pos": 844}, {"type": "R", "before": "January", "after": "April", "start_char_pos": 863, "end_char_pos": 870}, {"type": "R", "before": "Cosine distance between lexical categories was used to create similarity networks and modules using", "after": "We used", "start_char_pos": 877, "end_char_pos": 976}, {"type": "R", "before": ". We demonstrate that negative emotions like", "after": "to find modules in positive correlation networks. Our findings suggest that tweets expressing", "start_char_pos": 1008, "end_char_pos": 1052}, {"type": "R", "before": "have a high correlation with", "after": "contain the highest mentions of", "start_char_pos": 1080, "end_char_pos": 1108}, {"type": "R", "before": "and misinformation. These associations formed a major module with the", "after": "in all countries. Our results indicated that the patterns of hesitancy were variable across geographies and can help us learn targeted interventions. We also observed a significant change in the linear trends of categories like hesitation and contentment before and after approval of vaccines. Negative emotions like rage and sorrow gained the", "start_char_pos": 1132, "end_char_pos": 1201}, {"type": "R", "before": "network formed for January", "after": "alluvial diagram. They formed a significant module with all the influencing factors in April", "start_char_pos": 1228, "end_char_pos": 1254}, {"type": "R", "before": "millions of vaccines were administered", "after": "India observed the second wave of COVID-19 cases", "start_char_pos": 1266, "end_char_pos": 1304}, {"type": "R", "before": "emotions and influencing factors were", "after": "Emotions and Influencing Factors was", "start_char_pos": 1332, "end_char_pos": 1369}, {"type": "D", "before": ". By extracting and visualizing these, we propose that such a framework may be helpful in guiding the design of effective vaccine campaigns and can be used by policymakers for modeling vaccine uptake", "after": null, "start_char_pos": 1412, "end_char_pos": 1611}], "sents_char_pos": [0, 156, 287, 439, 659, 876, 1009, 1151, 1306, 1413]} {"doc_id": "2104.04572", "revision_depth": "1", "before_revision": "Securing a safe-driving circumstance for connected and autonomous vehicles (CAVs) continues to be a widespread concern despite various sophisticated functions delivered by artificial intelligence for in-vehicle devices. Besides, diverse malicious network attacks become ubiquitous along with the worldwide implementation of the Internet of Vehicles, which exposes a range of reliability and privacy threats for managing data in CAV networks. Combined with another fact that CAVs are now limited in handling intensive computation tasks , it thus renders a pressing demand of designing an efficient assessment system to guarantee autonomous driving safety without compromising data security. To thisend, we propose in this article a novel framework of Blockchain-enabled intElligent Safe-driving assessmenT (BEST) to offer a smart and reliable approach for conducting safe driving supervision while protecting vehicular information. Specifically, a promising solution of exploiting a long short-term memory algorithm is first introduced in detail for an intElligent Safe-driving assessmenT (EST) scheme. To further facilitate the EST, we demonstrate how a distributed blockchain obtains adequate efficiency, trustworthiness and resilience with an adopted byzantine fault tolerance-based delegated proof-of-stake consensus mechanism. Moreover, several challenges and discussions regarding the future research of this BEST architecture are presented .", "after_revision": "Securing safe-driving for connected and autonomous vehicles (CAVs) continues to be a widespread concern despite various sophisticated functions delivered by artificial intelligence for in-vehicle devices. Besides, diverse malicious network attacks become ubiquitous along with the worldwide implementation of the Internet of Vehicles, which exposes a range of reliability and privacy threats for managing data in CAV networks. Combined with the fact that the capability of existing CAVs in handling intensive computation tasks is limited, this implies a need for designing an efficient assessment system to guarantee autonomous driving safety without compromising data security. Motivated by this, in this article , we propose a novel framework , namely Blockchain-enabled intElligent Safe-driving assessmenT (BEST) , that offers a smart and reliable approach for conducting safe driving supervision while protecting vehicular information. Specifically, a promising solution that exploits a long short-term memory model is introduced to assess the safety level of the moving CAVs. Then, we investigate how a distributed blockchain obtains adequate trustworthiness and robustness for CAV data by adopting a byzantine fault tolerance-based delegated proof-of-stake consensus mechanism. Simulation results demonstrate that our presented BEST gains better data credibility with a higher prediction accuracy for vehicular safety assessment when compared with existing schemes. Finally, we discuss several open challenges that need to be addressed in future CAV networks .", "edit_actions": [{"type": "D", "before": "a", "after": null, "start_char_pos": 9, "end_char_pos": 10}, {"type": "D", "before": "circumstance", "after": null, "start_char_pos": 24, "end_char_pos": 36}, {"type": "R", "before": "another fact that CAVs are now limited", "after": "the fact that the capability of existing CAVs", "start_char_pos": 456, "end_char_pos": 494}, {"type": "R", "before": ", it thus renders a pressing demand of", "after": "is limited, this implies a need for", "start_char_pos": 535, "end_char_pos": 573}, {"type": "R", "before": "To thisend, we propose", "after": "Motivated by this,", "start_char_pos": 690, "end_char_pos": 712}, {"type": "A", "before": null, "after": ", we propose", "start_char_pos": 729, "end_char_pos": 729}, {"type": "R", "before": "of", "after": ", namely", "start_char_pos": 748, "end_char_pos": 750}, {"type": "R", "before": "to offer", "after": ", that offers", "start_char_pos": 813, "end_char_pos": 821}, {"type": "R", "before": "of exploiting", "after": "that exploits", "start_char_pos": 967, "end_char_pos": 980}, {"type": "R", "before": "algorithm is first introduced in detail for an intElligent Safe-driving assessmenT (EST) scheme. To further facilitate the EST, we demonstrate", "after": "model is introduced to assess the safety level of the moving CAVs. Then, we investigate", "start_char_pos": 1006, "end_char_pos": 1148}, {"type": "R", "before": "efficiency, trustworthiness and resilience with an adopted", "after": "trustworthiness and robustness for CAV data by adopting a", "start_char_pos": 1195, "end_char_pos": 1253}, {"type": "R", "before": "Moreover, several challenges and discussions regarding the future research of this BEST architecture are presented", "after": "Simulation results demonstrate that our presented BEST gains better data credibility with a higher prediction accuracy for vehicular safety assessment when compared with existing schemes. Finally, we discuss several open challenges that need to be addressed in future CAV networks", "start_char_pos": 1332, "end_char_pos": 1446}], "sents_char_pos": [0, 219, 441, 689, 931, 1102, 1331]} {"doc_id": "2104.04731", "revision_depth": "1", "before_revision": "The success of Deep Artificial Neural Networks (DNNs) in many domains created a rich body of research concerned with hardware accelerators for compute-intensive DNN operators. However, implementing such operators efficiently with complex instructions such as matrix multiply is a task not yet automated gracefully. Solving this task often requires complex program and memory layout transformations . First solutions to this problem have been proposed, such as TVM or ISAMIR, which work on a loop-level representation of operators and rewrite the program before an instruction embedding into the operator is performed . This top-down approach creates a tension between exploration range and search space complexity .In this work, we propose a new approach to this problem. We have created a bottom-up method that allows the direct generation of implementations based on an accelerator's instruction set . By formulating the embedding as a constraint satisfaction problem over the scalar dataflow, every possible embedding solution is contained in the search space. By adding additional constraints , a solver can produce the subset of preferable solutions. A detailed evaluation using the VTA hardware accelerator with the Baidu DeepBench inference benchmark suite shows that our approach can automatically generate code competitive to reference implementations , and furthermore that memory layout flexibilty can be beneficial for overall performance. While the reference implementation achieves very low hardware utilization due to its fixed embedding strategy, we achieve a geomean speedup of up to x2 .49, while individual operators can improve as much as x238 .", "after_revision": "The success of Deep Artificial Neural Networks (DNNs) in many domains created a rich body of research concerned with hardwareaccelerators for compute-intensive DNN operators. However, implementing such operators efficiently with complex hardwareintrinsics such as matrix multiply is a task not yet automated gracefully. Solving this task often requires joint program and data layouttransformations . First solutions to this problem have been proposed, such as TVM , UNIT or ISAMIR, which work on a loop-levelrepresentation of operators and specify data layout and possible program transformations before the embedding into the operator isperformed . This top-down approach creates a tension between exploration range and search space complexity , especially when alsoexploring data layout transformations such as im2col, channel packing or padding .In this work, we propose a new approach to this problem. We created a bottom-up method that allows the joint transformation ofboth compuation and data layout based on the found embedding . By formulating the embedding as a constraint satisfaction problemover the scalar dataflow, every possible embedding solution is contained in the search space. Adding additional constraints andoptmization targets to the solver generates the subset of preferable solutions. An evaluation using the VTA hardware accelerator with the Baidu DeepBench inference benchmark shows that our approach canautomatically generate code competitive to reference implementations . Further, we show that dynamically determining the data layoutbased on intrinsic and workload is beneficial for hardware utilization and performance. In cases where the reference implementationhas low hardware utilization due to its fixed deployment strategy, we achieve a geomean speedup of up to x2 .813, while individualoperators can improve as much as x170 .", "edit_actions": [{"type": "R", "before": "hardware accelerators", "after": "hardwareaccelerators", "start_char_pos": 117, "end_char_pos": 138}, {"type": "R", "before": "instructions", "after": "hardwareintrinsics", "start_char_pos": 238, "end_char_pos": 250}, {"type": "R", "before": "complex program and memory layout transformations", "after": "joint program and data layouttransformations", "start_char_pos": 348, "end_char_pos": 397}, {"type": "A", "before": null, "after": ", UNIT", "start_char_pos": 464, "end_char_pos": 464}, {"type": "R", "before": "loop-level representation", "after": "loop-levelrepresentation", "start_char_pos": 492, "end_char_pos": 517}, {"type": "R", "before": "rewrite the program before an instruction", "after": "specify data layout and possible program transformations before the", "start_char_pos": 535, "end_char_pos": 576}, {"type": "R", "before": "is performed", "after": "isperformed", "start_char_pos": 605, "end_char_pos": 617}, {"type": "A", "before": null, "after": ", especially when alsoexploring data layout transformations such as im2col, channel packing or padding", "start_char_pos": 715, "end_char_pos": 715}, {"type": "D", "before": "have", "after": null, "start_char_pos": 777, "end_char_pos": 781}, {"type": "R", "before": "direct generation of implementations based on an accelerator's instruction set", "after": "joint transformation ofboth compuation and data layout based on the found embedding", "start_char_pos": 825, "end_char_pos": 903}, {"type": "R", "before": "problem over", "after": "problemover", "start_char_pos": 964, "end_char_pos": 976}, {"type": "R", "before": "By adding additional constraints , a solver can produce", "after": "Adding additional constraints andoptmization targets to the solver generates", "start_char_pos": 1066, "end_char_pos": 1121}, {"type": "R", "before": "A detailed", "after": "An", "start_char_pos": 1158, "end_char_pos": 1168}, {"type": "D", "before": "suite", "after": null, "start_char_pos": 1260, "end_char_pos": 1265}, {"type": "R", "before": "can automatically", "after": "canautomatically", "start_char_pos": 1290, "end_char_pos": 1307}, {"type": "R", "before": ", and furthermore that memory layout flexibilty can be beneficial for overall performance. While the reference implementation achieves very", "after": ". Further, we show that dynamically determining the data layoutbased on intrinsic and workload is beneficial for hardware utilization and performance. In cases where the reference implementationhas", "start_char_pos": 1363, "end_char_pos": 1502}, {"type": "R", "before": "embedding", "after": "deployment", "start_char_pos": 1545, "end_char_pos": 1554}, {"type": "R", "before": ".49, while individual operators", "after": ".813, while individualoperators", "start_char_pos": 1606, "end_char_pos": 1637}, {"type": "R", "before": "x238", "after": "x170", "start_char_pos": 1661, "end_char_pos": 1665}], "sents_char_pos": [0, 175, 314, 399, 619, 717, 773, 905, 1065, 1157, 1453]} {"doc_id": "2104.04945", "revision_depth": "1", "before_revision": "We propose an enhancement technique of the Class Activation Mapping methods like Grad-CAM or Excitation Backpropagation, which presents visual explanations of decisions from CNN-based models. Our idea, called Gradual Extrapolation, can supplement any method that generates a heatmap picture by sharpening the output. Instead of producing a coarse localization map highlighting the important predictive regions in the image, our method outputs the specific shape that most contributes to the model output. Thus, it improves the accuracy of saliency maps. Effect has been achieved by gradual propagation of the crude map obtained in deep layer through all preceding layers with respect to their activations. In validation tests conducted on a selected set of images, the proposed method significantly improved the localization detection of the neural networks ' attention . Furthermore, the proposed method is applicable to any deep neural network model.", "after_revision": "In this paper, an enhancement technique for the class activation mapping methods such as gradient-weighted class activation maps or excitation backpropagation is proposed to present the visual explanations of decisions from convolutional neural network-based models. The proposed idea, called Gradual Extrapolation, can supplement any method that generates a heatmap picture by sharpening the output. Instead of producing a coarse localization map that highlights the important predictive regions in the image, the proposed method outputs the specific shape that most contributes to the model output. Thus, the proposed method improves the accuracy of saliency maps. The effect has been achieved by the gradual propagation of the crude map obtained in the deep layer through all preceding layers with respect to their activations. In validation tests conducted on a selected set of images, the faithfulness, interpretability, and applicability of the method are evaluated. The proposed technique significantly improves the localization detection of the neural networks attention at low additional computational costs . Furthermore, the proposed method is applicable to a variety deep neural network models. The code for the method can be found at URL", "edit_actions": [{"type": "R", "before": "We propose", "after": "In this paper,", "start_char_pos": 0, "end_char_pos": 10}, {"type": "R", "before": "of the Class Activation Mapping methods like Grad-CAM or Excitation Backpropagation, which presents", "after": "for the class activation mapping methods such as gradient-weighted class activation maps or excitation backpropagation is proposed to present the", "start_char_pos": 36, "end_char_pos": 135}, {"type": "R", "before": "CNN-based models. Our", "after": "convolutional neural network-based models. The proposed", "start_char_pos": 174, "end_char_pos": 195}, {"type": "R", "before": "highlighting", "after": "that highlights", "start_char_pos": 364, "end_char_pos": 376}, {"type": "R", "before": "our", "after": "the proposed", "start_char_pos": 424, "end_char_pos": 427}, {"type": "R", "before": "it", "after": "the proposed method", "start_char_pos": 511, "end_char_pos": 513}, {"type": "R", "before": "Effect", "after": "The effect", "start_char_pos": 554, "end_char_pos": 560}, {"type": "A", "before": null, "after": "the", "start_char_pos": 582, "end_char_pos": 582}, {"type": "A", "before": null, "after": "the", "start_char_pos": 632, "end_char_pos": 632}, {"type": "R", "before": "proposed method significantly improved", "after": "faithfulness, interpretability, and applicability of the method are evaluated. The proposed technique significantly improves", "start_char_pos": 771, "end_char_pos": 809}, {"type": "R", "before": "' attention", "after": "attention at low additional computational costs", "start_char_pos": 860, "end_char_pos": 871}, {"type": "R", "before": "any", "after": "a variety", "start_char_pos": 924, "end_char_pos": 927}, {"type": "R", "before": "model.", "after": "models. The code for the method can be found at URL", "start_char_pos": 948, "end_char_pos": 954}], "sents_char_pos": [0, 191, 316, 504, 553, 707, 873]} {"doc_id": "2104.08570", "revision_depth": "1", "before_revision": "Despite the fact that natural language conversations with machines represent one of the central objectives of AI , and despite the massive increase of research and development efforts in conversational AI, task-oriented dialogue (ToD) -- i.e., conversations with an artificial agent with the aim of completing a concrete task -- is currently limited to a few narrow domains (e.g., food ordering, ticket booking) and a handful of major languages (e.g., English, Chinese). In this work , we provide an extensive overview of existing efforts in multilingual ToD and analyse the factors preventing the development of truly multilingual ToD systems . We identify two main challenges that combined hinder the faster progress in multilingual ToD: (1) current state-of-the-art ToD models based on large pretrained neural language models are data hungry; at the same time (2) data acquisition for ToD use cases is expensive and tedious. Most existing approaches to multilingual ToD thus rely on (zero- or few-shot) cross-lingual transfer from resource-rich languages ( in ToD, this is basically only English), either by means of (i) machine translation or (ii) multilingual representation spaces. However, such approaches are currently not a viable solution for a large number of low-resource languages without parallel data and /or limited monolingual corpora . Finally, we discuss critical challenges and potential solutions by drawing parallels between ToD and other cross-lingual and multilingual NLP research .", "after_revision": "In task-oriented dialogue (ToD), a user holds a conversation with an artificial agent to complete a concrete task. Although this technology represents one of the central objectives of AI and has been the focus of ever more intense research and development efforts , it is currently limited to a few narrow domains (e.g., food ordering, ticket booking) and a handful of languages (e.g., English, Chinese). This work provides an extensive overview of existing methods and resources in multilingual ToD as an entry point to this exciting and emerging field. We find that the most critical factor preventing the creation of truly multilingual ToD systems is the lack of datasets in most languages for both training and evaluation. In fact, acquiring annotations or human feedback for each component of modular systems or for data-hungry end-to-end systems is expensive and tedious. Hence, state-of-the-art approaches to multilingual ToD mostly rely on (zero- or few-shot) cross-lingual transfer from resource-rich languages ( almost exclusively English), either by means of machine translation or multilingual representations. These approaches are currently viable only for typologically similar languages and languages with parallel / monolingual corpora available. On the other hand, their effectiveness beyond these boundaries is doubtful or hard to assess due to the lack of linguistically diverse benchmarks (especially for natural language generation and end-to-end evaluation). To overcome this limitation, we draw parallels between components of the ToD pipeline and other NLP tasks, which can inspire solutions for learning in low-resource scenarios. Finally, we list additional challenges that multilinguality poses for related areas (such as speech and human-centred evaluation), and indicate future directions that hold promise to further expand language coverage and dialogue capabilities of current ToD systems .", "edit_actions": [{"type": "R", "before": "Despite the fact that natural language conversations with machines represent", "after": "In task-oriented dialogue (ToD), a user holds a conversation with an artificial agent to complete a concrete task. Although this technology represents", "start_char_pos": 0, "end_char_pos": 76}, {"type": "R", "before": ", and despite the massive increase of", "after": "and has been the focus of ever more intense", "start_char_pos": 113, "end_char_pos": 150}, {"type": "R", "before": "in conversational AI, task-oriented dialogue (ToD) -- i.e., conversations with an artificial agent with the aim of completing a concrete task --", "after": ", it", "start_char_pos": 184, "end_char_pos": 328}, {"type": "D", "before": "major", "after": null, "start_char_pos": 429, "end_char_pos": 434}, {"type": "R", "before": "In this work , we provide", "after": "This work provides", "start_char_pos": 471, "end_char_pos": 496}, {"type": "R", "before": "efforts", "after": "methods and resources", "start_char_pos": 531, "end_char_pos": 538}, {"type": "R", "before": "and analyse the factors preventing the development", "after": "as an entry point to this exciting and emerging field. We find that the most critical factor preventing the creation", "start_char_pos": 559, "end_char_pos": 609}, {"type": "R", "before": ". We identify two main challenges that combined hinder the faster progress in multilingual ToD: (1) current state-of-the-art ToD models based on large pretrained neural language models are data hungry; at the same time (2) data acquisition for ToD use cases", "after": "is the lack of datasets in most languages for both training and evaluation. In fact, acquiring annotations or human feedback for each component of modular systems or for data-hungry end-to-end systems", "start_char_pos": 644, "end_char_pos": 901}, {"type": "R", "before": "Most existing", "after": "Hence, state-of-the-art", "start_char_pos": 928, "end_char_pos": 941}, {"type": "R", "before": "thus", "after": "mostly", "start_char_pos": 973, "end_char_pos": 977}, {"type": "R", "before": "in ToD, this is basically only", "after": "almost exclusively", "start_char_pos": 1060, "end_char_pos": 1090}, {"type": "D", "before": "(i)", "after": null, "start_char_pos": 1120, "end_char_pos": 1123}, {"type": "R", "before": "(ii) multilingual representation spaces. However, such", "after": "multilingual representations. These", "start_char_pos": 1147, "end_char_pos": 1201}, {"type": "R", "before": "not a viable solution for a large number of low-resource languages without parallel data and /or limited monolingual corpora . Finally, we discuss critical challenges and potential solutions by drawing parallels between ToD", "after": "viable only for typologically similar languages", "start_char_pos": 1227, "end_char_pos": 1450}, {"type": "R", "before": "other cross-lingual and multilingual NLP research", "after": "languages with parallel / monolingual corpora available. On the other hand, their effectiveness beyond these boundaries is doubtful or hard to assess due to the lack of linguistically diverse benchmarks (especially for natural language generation and end-to-end evaluation). To overcome this limitation, we draw parallels between components of the ToD pipeline and other NLP tasks, which can inspire solutions for learning in low-resource scenarios. Finally, we list additional challenges that multilinguality poses for related areas (such as speech and human-centred evaluation), and indicate future directions that hold promise to further expand language coverage and dialogue capabilities of current ToD systems", "start_char_pos": 1455, "end_char_pos": 1504}], "sents_char_pos": [0, 470, 645, 845, 927, 1187, 1353]} {"doc_id": "2104.12265", "revision_depth": "2", "before_revision": "This paper presents a new approach for offensive language and hate speech detection on social media. Our approach incorporate an offensive lexicon composed by implicit and explicit offensive and swearing expressions annotated with binary classes: context-dependent and context-independent offensive. Due to the severity of the hate speech and offensive comments in Brazil, and the lack of research in Portuguese, Brazilian Portuguese is the language used to validate our method. However, the proposal may be applied to any other language or domain. Based on the obtained results, the proposed approach showed high performance results overcoming the current baselines for European and Brazilian Portuguese.", "after_revision": "This paper provides a new approach for offensive language and hate speech detection on social media. Our approach incorporates an offensive lexicon composed of implicit and explicit offensive and swearing expressions annotated with binary classes: context-dependent and context-independent offensive. Due to the severity of the hate speech and offensive comments in Brazil, and the lack of research in Portuguese, Brazilian Portuguese is the language used to validate the proposed method. Nevertheless, our proposal may be applied to any other language or domain. Based on the obtained results, the proposed approach showed high-performance overcoming the current baselines for European and Brazilian Portuguese.", "edit_actions": [{"type": "R", "before": "presents", "after": "provides", "start_char_pos": 11, "end_char_pos": 19}, {"type": "R", "before": "incorporate", "after": "incorporates", "start_char_pos": 114, "end_char_pos": 125}, {"type": "R", "before": "by", "after": "of", "start_char_pos": 156, "end_char_pos": 158}, {"type": "R", "before": "our method. However, the", "after": "the proposed method. Nevertheless, our", "start_char_pos": 467, "end_char_pos": 491}, {"type": "R", "before": "high performance results", "after": "high-performance", "start_char_pos": 609, "end_char_pos": 633}], "sents_char_pos": [0, 100, 299, 478, 548]} {"doc_id": "2104.12345", "revision_depth": "1", "before_revision": "Lie detection is considered a concern for everyone in their day to day life given its impact on human interactions. Hence, people are normally not only pay attention to what their interlocutors are saying but also try to inspect their visual appearances, including faces, to find any signs that indicate whether the person is telling the truth or not. Unfortunately to date, the automatic lie detection , which may help us to understand this lying characteristics are still fairly limited . Mainly due to lack of a lie dataset and corresponding evaluations . In this work, we have collected a dataset that contains annotated images and 3D information of different participants faces during a card game that incentivise the lying . Using our collected dataset, we evaluated several types of machine learning based lie detector through generalize, personal and cross lie lie experiments. In these experiments, we showed the superiority of deep learning based model in recognizing the lie with best accuracyof 57\\\\%DIF < for generalized task and 63\\\\% when dealing with a single participant. Finally, we also highlight the limitation of the deep learning based lie detector when dealing with different types of lie tasks.\\end{abstract} %DIF > for the generalization task and 63\\\\% when dealing with a single participant. Finally, we also highlight the limitation of the deep learning based lie detector when dealing with cross-domain lie detection tasks.", "after_revision": "Lie detection is considered a concern for everyone in their day to day life given its impact on human interactions. Thus, people normally pay attention to both what their interlocutors are saying and also to their visual appearances, including faces, to try to find any signs that indicate whether the person is telling the truth or not. While automatic lie detection may help us to understand this lying characteristics , current systems are still fairly limited , partly due to lack of adequate datasets to evaluate their performance in realistic scenarios . In this work, we have collected an annotated dataset of facial images, comprising both 2D and 3D information of several participants during a card game that encourages players to lie . Using our collected dataset, We evaluated several types of machine learning-based lie detectors in terms of their generalization, person-specific and cross-domain experiments. Our results show that models based on deep learning achieve the best accuracy, reaching up to 57\\\\%DIF < for generalized task and 63\\\\% when dealing with a single participant. Finally, we also highlight the limitation of the deep learning based lie detector when dealing with different types of lie tasks.\\end{abstract} %DIF > for the generalization task and 63\\\\% when dealing with a single participant. Finally, we also highlight the limitation of the deep learning based lie detector when dealing with cross-domain lie detection tasks.", "edit_actions": [{"type": "R", "before": "Hence, people are normally not only", "after": "Thus, people normally", "start_char_pos": 116, "end_char_pos": 151}, {"type": "A", "before": null, "after": "both", "start_char_pos": 169, "end_char_pos": 169}, {"type": "R", "before": "but also try to inspect", "after": "and also to", "start_char_pos": 206, "end_char_pos": 229}, {"type": "A", "before": null, "after": "try to", "start_char_pos": 276, "end_char_pos": 276}, {"type": "R", "before": "Unfortunately to date, the", "after": "While", "start_char_pos": 354, "end_char_pos": 380}, {"type": "D", "before": ", which", "after": null, "start_char_pos": 405, "end_char_pos": 412}, {"type": "A", "before": null, "after": ", current systems", "start_char_pos": 466, "end_char_pos": 466}, {"type": "R", "before": ". Mainly", "after": ", partly", "start_char_pos": 492, "end_char_pos": 500}, {"type": "R", "before": "a lie dataset and corresponding evaluations", "after": "adequate datasets to evaluate their performance in realistic scenarios", "start_char_pos": 516, "end_char_pos": 559}, {"type": "R", "before": "a dataset that contains annotated images", "after": "an annotated dataset of facial images, comprising both 2D", "start_char_pos": 594, "end_char_pos": 634}, {"type": "R", "before": "different participants faces", "after": "several participants", "start_char_pos": 657, "end_char_pos": 685}, {"type": "R", "before": "incentivise the lying", "after": "encourages players to lie", "start_char_pos": 710, "end_char_pos": 731}, {"type": "R", "before": "we", "after": "We", "start_char_pos": 763, "end_char_pos": 765}, {"type": "R", "before": "learning based lie detector through generalize, personal and cross lie lie experiments. In these experiments, we showed the superiority of deep learning based model in recognizing the lie with best accuracyof", "after": "learning-based lie detectors in terms of their generalization, person-specific and cross-domain experiments. Our results show that models based on deep learning achieve the best accuracy, reaching up to", "start_char_pos": 801, "end_char_pos": 1009}], "sents_char_pos": [0, 115, 353, 561, 733, 888, 1091, 1221, 1320]} {"doc_id": "2104.13640", "revision_depth": "1", "before_revision": "Societal biases resonate in the retrieved contents of information retrieval (IR) systems, resulting in reinforcing existing stereotypes. Approaching this issue requires established measures of fairness regarding the representation of various social groups in retrieved contents , as well as methods to mitigate such biases, particularly in the light of the advances in deep ranking models. In this work, we first provide a novel framework to measure the fairness in the retrieved text contents of ranking models. Introducing a ranker-agnostic measurement, the framework also enables the disentanglement of the effect on fairness of collection from that of rankers. Second , we propose an adversarial bias mitigation approach applied to the state-of-the-art Bert rankers , which jointly learns to predict relevance and remove protected attributes. We conduct experiments on two passage retrieval collections ( MS MARCO Passage Re-ranking and TREC Deep Learning 2019 Passage Re-ranking), which we extend by fairness annotations of a selected subset of queries regarding gender attributes. Our results on the MS MARCO benchmark show that, while the fairness of all ranking models is lower than the ones of ranker-agnostic baselines, the fairness in retrieved contents significantly improves when applying the proposed adversarial training . Lastly, we investigate the trade-off between fairness and utility, showing that through applying a combinatorial model selection method, we can maintain the significant improvements in fairness without any significant loss in utility.", "after_revision": "Societal biases resonate in the retrieved contents of information retrieval (IR) systems, resulting in reinforcing existing stereotypes. Approaching this issue requires established measures of fairness in respect to the representation of various social groups in retrieval results , as well as methods to mitigate such biases, particularly in the light of the advances in deep ranking models. In this work, we first provide a novel framework to measure the fairness in the retrieved text contents of ranking models. Introducing a ranker-agnostic measurement, the framework also enables the disentanglement of the effect on fairness of collection from that of rankers. To mitigate these biases , we propose AdvBert, a ranking model achieved by adapting adversarial bias mitigation for IR , which jointly learns to predict relevance and remove protected attributes. We conduct experiments on two passage retrieval collections ( MSMARCO Passage Re-ranking and TREC Deep Learning 2019 Passage Re-ranking), which we extend by fairness annotations of a selected subset of queries regarding gender attributes. Our results on the MSMARCO benchmark show that, (1) all ranking models are less fair in comparison with ranker-agnostic baselines, and (2) the fairness of Bert rankers significantly improves when using the proposed AdvBert models . Lastly, we investigate the trade-off between fairness and utility, showing that we can maintain the significant improvements in fairness without any significant loss in utility.", "edit_actions": [{"type": "R", "before": "regarding", "after": "in respect to", "start_char_pos": 202, "end_char_pos": 211}, {"type": "R", "before": "retrieved contents", "after": "retrieval results", "start_char_pos": 259, "end_char_pos": 277}, {"type": "R", "before": "Second", "after": "To mitigate these biases", "start_char_pos": 665, "end_char_pos": 671}, {"type": "R", "before": "an", "after": "AdvBert, a ranking model achieved by adapting", "start_char_pos": 685, "end_char_pos": 687}, {"type": "R", "before": "approach applied to the state-of-the-art Bert rankers", "after": "for IR", "start_char_pos": 716, "end_char_pos": 769}, {"type": "R", "before": "MS MARCO", "after": "MSMARCO", "start_char_pos": 909, "end_char_pos": 917}, {"type": "R", "before": "MS MARCO", "after": "MSMARCO", "start_char_pos": 1106, "end_char_pos": 1114}, {"type": "R", "before": "while the fairness of", "after": "(1)", "start_char_pos": 1136, "end_char_pos": 1157}, {"type": "R", "before": "is lower than the ones of", "after": "are less fair in comparison with", "start_char_pos": 1177, "end_char_pos": 1202}, {"type": "R", "before": "the fairness in retrieved contents", "after": "and (2) the fairness of Bert rankers", "start_char_pos": 1230, "end_char_pos": 1264}, {"type": "R", "before": "applying the proposed adversarial training", "after": "using the proposed AdvBert models", "start_char_pos": 1293, "end_char_pos": 1335}, {"type": "D", "before": "through applying a combinatorial model selection method,", "after": null, "start_char_pos": 1418, "end_char_pos": 1474}], "sents_char_pos": [0, 136, 389, 512, 664, 846, 1086]} {"doc_id": "2104.14654", "revision_depth": "1", "before_revision": "Mean field games (MFG) facilitate the otherwise intractable reinforcement learning (RL) in large-scale multi-agent systems (MAS) , through reducing interplays among agents to those between a representative individual agent and the mass of the population. While , RL agents are notoriously prone to unexpected behaviours due to reward mis-specification. This problem is exacerbated by an expanding scale of MAS. Inverse reinforcement learning (IRL) provides a framework to automatically acquire proper reward functions from expert demonstrations. Extending IRL to MFG , however, is challenging due to the complex notion of mean-field-type equilibria and the coupling between agent-level and population-level dynamics. To this end, we propose mean field inverse reinforcement learning (MFIRL), a novel model-free IRL framework for MFG . We derive the algorithm based on a new equilibrium concept that incorporates entropy regularization, and the maximum entropy IRL framework. Experimental results on simulated environments demonstrate that MFIRL is sample efficient and can accurately recover the ground-truth reward functions , compared to the state-of-the-art method.", "after_revision": "Mean field games (MFG) facilitate the application of reinforcement learning (RL) in large-scale multi-agent systems , through reducing interplays among agents to those between an individual agent and the average effect from the population. However , RL agents are notoriously prone to unexpected behaviours due to the reward mis-specification. Although inverse RL (IRL) holds promise for automatically acquiring suitable rewards from demonstrations, its extension to MFG is challenging due to the complicated notion of mean-field-type equilibria and the coupling between agent-level and population-level dynamics. To this end, we propose a novel IRL framework for MFG , called Mean Field IRL (MFIRL), where we build upon a new equilibrium concept and the maximum entropy IRL framework. Crucially, MFIRL is brought forward as the first IRL method that can recover the agent-level ( ground-truth ) reward functions for MFG. Experiments show the superior performance of MFIRL on sample efficiency, reward recovery and robustness against varying environment dynamics , compared to the state-of-the-art method.", "edit_actions": [{"type": "R", "before": "otherwise intractable", "after": "application of", "start_char_pos": 38, "end_char_pos": 59}, {"type": "D", "before": "(MAS)", "after": null, "start_char_pos": 123, "end_char_pos": 128}, {"type": "R", "before": "a representative", "after": "an", "start_char_pos": 189, "end_char_pos": 205}, {"type": "R", "before": "mass of", "after": "average effect from", "start_char_pos": 231, "end_char_pos": 238}, {"type": "R", "before": "While", "after": "However", "start_char_pos": 255, "end_char_pos": 260}, {"type": "A", "before": null, "after": "the", "start_char_pos": 327, "end_char_pos": 327}, {"type": "R", "before": "This problem is exacerbated by an expanding scale of MAS. Inverse reinforcement learning", "after": "Although inverse RL", "start_char_pos": 354, "end_char_pos": 442}, {"type": "R", "before": "provides a framework to automatically acquire proper reward functions from expert demonstrations. Extending IRL to MFG , however,", "after": "holds promise for automatically acquiring suitable rewards from demonstrations, its extension to MFG", "start_char_pos": 449, "end_char_pos": 578}, {"type": "R", "before": "complex", "after": "complicated", "start_char_pos": 605, "end_char_pos": 612}, {"type": "R", "before": "mean field inverse reinforcement learning (MFIRL), a novel model-free", "after": "a novel", "start_char_pos": 742, "end_char_pos": 811}, {"type": "R", "before": ". We derive the algorithm based on", "after": ", called Mean Field IRL (MFIRL), where we build upon", "start_char_pos": 834, "end_char_pos": 868}, {"type": "D", "before": "that incorporates entropy regularization,", "after": null, "start_char_pos": 895, "end_char_pos": 936}, {"type": "R", "before": "Experimental results on simulated environments demonstrate that MFIRL is sample efficient and can accurately recover the", "after": "Crucially, MFIRL is brought forward as the first IRL method that can recover the agent-level (", "start_char_pos": 976, "end_char_pos": 1096}, {"type": "R", "before": "reward functions", "after": ") reward functions for MFG. Experiments show the superior performance of MFIRL on sample efficiency, reward recovery and robustness against varying environment dynamics", "start_char_pos": 1110, "end_char_pos": 1126}], "sents_char_pos": [0, 254, 353, 411, 546, 717, 975]} {"doc_id": "2105.03052", "revision_depth": "1", "before_revision": "This work considers a novel information design problem and studies how the craft of payoff-relevant environmental signals solely can influence the behaviors of intelligent agents. The agents' strategic interactions are captured by an incomplete-information Markov game, in which each agent first selects one environmental signal from multiple signal sources as additional payoff-relevant information and then takes an action. There is a rational information designer (principal) who possesses one signal source and aims to control the equilibrium behaviors of the agents by designing the information structure of her signals sent to the agents. An obedient principle is established which states that it is without loss of generality to focus on the direct information design when the information design incentivizes each agent to select the signal sent by the principal, such that the design process avoids the predictions of the agents' strategic selection behaviors. Based on the obedient principle, we introduce the design protocol given a goal of the principal referred to as obedient implementability (OIL) and study a Myersonian information design that characterizes the OIL in a class of obedient sequential Markov perfect Bayesian equilibria (O-SMPBE ). A framework is proposed based on an approach which we refer to as the fixed-point alignment that incentivizes the agents to choose the signal sent by the principal, makes sure that the agents' policy profile of taking actions is the policy component of an O-SMPBE, and the principal's goal is achieved . The proposed approach can be applied to elicit desired behaviors of multi-agent systems in competing as well as cooperating settings and be extended to heterogeneous stochastic games in the complete- and the incomplete-information environments.", "after_revision": "This work considers a novel information design problem and studies how the craft of payoff-relevant environmental signals solely can influence the behaviors of intelligent agents. The agents' strategic interactions are captured by a Markov game, in which each agent first selects one external signal from multiple signal sources as additional payoff-relevant information and then takes an action. There is a rational information designer (principal) who possesses one signal source and aims to influence the equilibrium behaviors of the agents by designing the information structure of her signals sent to the agents. We propose a direct information design approach that incentivizes each agent to select the signal sent by the principal, such that the design process avoids the predictions of the agents' strategic selection behaviors. We then introduce the design protocol given a goal of the designer which we refer to as obedient implementability (OIL) and characterize the OIL in a class of obedient sequential Markov perfect equilibria (O-SMPE ). A design regime is proposed based on an approach which we refer to as the fixed-point alignment that incentivizes the agents to choose the signal sent by the principal, guarantees that the agents' policy profile of taking actions is the policy component of an O-SMPE and the principal's goal is achieved . We then formulate the principal's optimal goal selection problem in terms of information design and characterize the optimization problem by minimizing the fixed-point misalignments . The proposed approach can be applied to elicit desired behaviors of multi-agent systems in competing as well as cooperating settings and be extended to heterogeneous stochastic games in the complete- and the incomplete-information environments.", "edit_actions": [{"type": "R", "before": "an incomplete-information", "after": "a", "start_char_pos": 231, "end_char_pos": 256}, {"type": "R", "before": "environmental", "after": "external", "start_char_pos": 308, "end_char_pos": 321}, {"type": "R", "before": "control", "after": "influence", "start_char_pos": 523, "end_char_pos": 530}, {"type": "R", "before": "An obedient principle is established which states that it is without loss of generality to focus on the", "after": "We propose a", "start_char_pos": 645, "end_char_pos": 748}, {"type": "R", "before": "when the information design", "after": "approach that", "start_char_pos": 775, "end_char_pos": 802}, {"type": "R", "before": "Based on the obedient principle, we", "after": "We then", "start_char_pos": 969, "end_char_pos": 1004}, {"type": "R", "before": "principal referred", "after": "designer which we refer", "start_char_pos": 1055, "end_char_pos": 1073}, {"type": "R", "before": "study a Myersonian information design that characterizes", "after": "characterize", "start_char_pos": 1116, "end_char_pos": 1172}, {"type": "R", "before": "Bayesian equilibria (O-SMPBE", "after": "equilibria (O-SMPE", "start_char_pos": 1230, "end_char_pos": 1258}, {"type": "R", "before": "framework", "after": "design regime", "start_char_pos": 1264, "end_char_pos": 1273}, {"type": "R", "before": "makes sure", "after": "guarantees", "start_char_pos": 1427, "end_char_pos": 1437}, {"type": "R", "before": "O-SMPBE,", "after": "O-SMPE", "start_char_pos": 1518, "end_char_pos": 1526}, {"type": "A", "before": null, "after": ". We then formulate the principal's optimal goal selection problem in terms of information design and characterize the optimization problem by minimizing the fixed-point misalignments", "start_char_pos": 1564, "end_char_pos": 1564}], "sents_char_pos": [0, 179, 425, 644, 968, 1261, 1566]} {"doc_id": "2105.03625", "revision_depth": "1", "before_revision": "Making profits in stock market is a challenging task for both professional institutional investors and individual traders . With the development combination of quantitative trading and reinforcement learning, more trading algorithms have achieved significant gains beyond the benchmark model Buy Hold (B H) . There is a certain gap between these algorithms and the real trading decision making scenarios. On the one hand, they only consider trading signals while ignoring the number of transactions. On the other hand, the information level considered by these algorithms is not rich enough, which limits the performance of these algorithms. Thus, we propose an algorithm called the Multi-frequency Continuous-share Trading algorithm with GARCH (MCTG) to solve the problems above, which consists of parallel network layers and deep reinforcement learning . The former is composed of three parallel network layers , respectively dealing with different frequencies (five minute, one day, one week) data, and day level considers the volatilities of stocks. The latter with a continuous action space of the reinforcement learning algorithm is used to solve the problem of trading stock shares . Experiments in different industries of Chinese stock market show our method achieves more extra profit comparing with basic DRL methods and bench model .", "after_revision": "It is a difficult task for both professional investors and individual traders continuously making profit in stock market . With the development of computer science and deep reinforcement learning, Buy\\& Hold (B \\&H) has been oversteped by many artificial intelligence trading algorithms. However, the information and process are not enough, which limit the performance of reinforcement learning algorithms. Thus, we propose a parallel-network continuous quantitative trading model with GARCH and PPO to enrich the basical deep reinforcement learning model, where the deep learning parallel network layers deal with 3 different frequencies data (including GARCH information) and proximal policy optimization (PPO) algorithm interacts actions and rewards with stock trading environment . Experiments in 5 stocks from Chinese stock market show our method achieves more extra profit comparing with basical reinforcement learning methods and bench models .", "edit_actions": [{"type": "R", "before": "Making profits in stock market is a challenging", "after": "It is a difficult", "start_char_pos": 0, "end_char_pos": 47}, {"type": "D", "before": "institutional", "after": null, "start_char_pos": 75, "end_char_pos": 88}, {"type": "A", "before": null, "after": "continuously making profit in stock market", "start_char_pos": 122, "end_char_pos": 122}, {"type": "R", "before": "combination of quantitative trading and", "after": "of computer science and deep", "start_char_pos": 146, "end_char_pos": 185}, {"type": "R", "before": "more trading algorithms have achieved significant gains beyond the benchmark model Buy", "after": "Buy\\&", "start_char_pos": 210, "end_char_pos": 296}, {"type": "R", "before": "H) . There is a certain gap between these algorithms and the real trading decision making scenarios. On the one hand, they only consider trading signals while ignoring the number of transactions. On the other hand, the information level considered by these algorithms is not rich", "after": "\\&H) has been oversteped by many artificial intelligence trading algorithms. However, the information and process are not", "start_char_pos": 305, "end_char_pos": 584}, {"type": "R", "before": "limits", "after": "limit", "start_char_pos": 599, "end_char_pos": 605}, {"type": "R", "before": "these", "after": "reinforcement learning", "start_char_pos": 625, "end_char_pos": 630}, {"type": "R", "before": "an algorithm called the Multi-frequency Continuous-share Trading algorithm with GARCH (MCTG) to solve the problems above, which consists of parallel network layers and", "after": "a parallel-network continuous quantitative trading model with GARCH and PPO to enrich the basical", "start_char_pos": 660, "end_char_pos": 827}, {"type": "R", "before": ". The former is composed of three", "after": "model, where the deep learning", "start_char_pos": 856, "end_char_pos": 889}, {"type": "R", "before": ", respectively dealing with different frequencies (five minute, one day, one week) data, and day level considers the volatilities of stocks. The latter with a continuous action space of the reinforcement learning algorithm is used to solve the problem of trading stock shares", "after": "deal with 3 different frequencies data (including GARCH information) and proximal policy optimization (PPO) algorithm interacts actions and rewards with stock trading environment", "start_char_pos": 914, "end_char_pos": 1189}, {"type": "R", "before": "different industries of", "after": "5 stocks from", "start_char_pos": 1207, "end_char_pos": 1230}, {"type": "R", "before": "basic DRL", "after": "basical reinforcement learning", "start_char_pos": 1310, "end_char_pos": 1319}, {"type": "R", "before": "model", "after": "models", "start_char_pos": 1338, "end_char_pos": 1343}], "sents_char_pos": [0, 124, 405, 500, 642, 857, 1054]} {"doc_id": "2105.05381", "revision_depth": "1", "before_revision": "Deep ensemble learning aims to improve the classification accuracy by training several neural networks and fusing their outputs. It has been widely shown to improve accuracy. At the same time, ensemble learning has also been proposed to mitigate privacy leakage in terms of membership inference (MI), where the goal of an attacker is to infer whether a particular data sample has been used to train a target model . In this paper, we show that these two goals of ensemble learning, namely improving accuracy and privacy , directly conflict with each other . Using a wide range of datasets and model architectures, we empirically demonstrate the trade-off between privacy and accuracy in deep ensemble learning. We find that ensembling can improve either privacy or accuracy, but not both simultaneously -- when ensembling improves the classification accuracy, the effectiveness of the MI attack also increases. We analyze various factors that contribute to such privacy leakage in ensembling such as prediction confidence and agreement between models that constitute the ensemble. Our evaluation of defenses against MI attacks , such as regularization and differential privacy , shows that they can mitigate the effectiveness of the MI attackbut simultaneously degrade ensemble accuracy. The source code is available at URL", "after_revision": "Deep ensemble learning has been shown to improve accuracy by training multiple neural networks and fusing their outputs. Ensemble learning has also been used to defend against membership inference attacks that undermine privacy . In this paper, we empirically demonstrate a trade-off between these two goals , namely accuracy and privacy (in terms of membership inference attacks), in deep ensembles . Using a wide range of datasets and model architectures, we show that the effectiveness of membership inference attacks also increases when ensembling improves accuracy. To better understand this trade-off, we study the impact of various factors such as prediction confidence and agreement between models that constitute the ensemble. Finally, we evaluate defenses against membership inference attacks based on regularization and differential privacy . We show that while these defenses can mitigate the effectiveness of the membership inference attack, they simultaneously degrade ensemble accuracy. The source code is available at URL", "edit_actions": [{"type": "R", "before": "aims to improve the classification", "after": "has been shown to improve", "start_char_pos": 23, "end_char_pos": 57}, {"type": "R", "before": "several", "after": "multiple", "start_char_pos": 79, "end_char_pos": 86}, {"type": "R", "before": "It has been widely shown to improve accuracy. At the same time, ensemble", "after": "Ensemble", "start_char_pos": 129, "end_char_pos": 201}, {"type": "R", "before": "proposed to mitigate privacy leakage in terms of membership inference (MI), where the goal of an attacker is to infer whether a particular data sample has been used to train a target model", "after": "used to defend against membership inference attacks that undermine privacy", "start_char_pos": 225, "end_char_pos": 413}, {"type": "R", "before": "show that", "after": "empirically demonstrate a trade-off between", "start_char_pos": 434, "end_char_pos": 443}, {"type": "R", "before": "of ensemble learning, namely improving", "after": ", namely", "start_char_pos": 460, "end_char_pos": 498}, {"type": "R", "before": ", directly conflict with each other", "after": "(in terms of membership inference attacks), in deep ensembles", "start_char_pos": 520, "end_char_pos": 555}, {"type": "R", "before": "empirically demonstrate the trade-off between privacy and accuracy in deep ensemble learning. We find that ensembling can improve either privacy or accuracy, but not both simultaneously --", "after": "show that the effectiveness of membership inference attacks also increases", "start_char_pos": 617, "end_char_pos": 805}, {"type": "R", "before": "the classification accuracy, the effectiveness of the MI attack also increases. We analyze various factors that contribute to such privacy leakage in ensembling such", "after": "accuracy. To better understand this trade-off, we study the impact of various factors such", "start_char_pos": 831, "end_char_pos": 996}, {"type": "R", "before": "Our evaluation of defenses against MI attacks , such as", "after": "Finally, we evaluate defenses against membership inference attacks based on", "start_char_pos": 1081, "end_char_pos": 1136}, {"type": "R", "before": ", shows that they", "after": ". We show that while these defenses", "start_char_pos": 1177, "end_char_pos": 1194}, {"type": "R", "before": "MI attackbut", "after": "membership inference attack, they", "start_char_pos": 1233, "end_char_pos": 1245}], "sents_char_pos": [0, 128, 174, 415, 710, 910, 1080, 1287]} {"doc_id": "2105.08233", "revision_depth": "1", "before_revision": "Being able to efficiently and accurately select the top-k elements without privacy leakage is an integral component of various data analysis tasks and has gained significant attention . In this paper, we introduce theoneshot mechanism , a fast, low-distortion, and differentially private primitive for the top-k problem. Compared with existing approaches in the literature, our algorithm adds Laplace noise to the counts and releases the top-k noisy counts and their estimates in a oneshot fashion, thereby substantially reducing the computational cost while maintaining satisfying utility. Our /}\\eps proof of privacy for this mechanism relies on a novel coupling technique that is of independent theoretical interest . Finally, we apply the oneshot mechanism to multiple hypothesis testing and ranking from pairwise comparisons and thus obtain their differentially private counterparts .", "after_revision": "Being able to efficiently and accurately select the top-k elements with differential privacy is an integral component of various private data analysis tasks . In this paper, we present the oneshot Laplace mechanism, which generalizes the well-known Report Noisy Max mechanism to reporting noisy top-k elements. We show that the oneshot Laplace mechanism with a noise level of (\\sqrt{k/}\\eps) is approximately differentially private. Compared to the previous peeling approach of running Report Noisy Max k times, the oneshot Laplace mechanism only adds noises and computes the top k elements once, hence much more efficient for large k. In addition, our proof of privacy relies on a novel coupling technique that bypasses the use of composition theorems . Finally, we present a novel application of efficient top-k selection in the classical problem of ranking from pairwise comparisons .", "edit_actions": [{"type": "R", "before": "without privacy leakage", "after": "with differential privacy", "start_char_pos": 67, "end_char_pos": 90}, {"type": "A", "before": null, "after": "private", "start_char_pos": 127, "end_char_pos": 127}, {"type": "D", "before": "and has gained significant attention", "after": null, "start_char_pos": 148, "end_char_pos": 184}, {"type": "D", "before": "introduce the", "after": null, "start_char_pos": 205, "end_char_pos": 218}, {"type": "D", "before": "oneshot mechanism", "after": null, "start_char_pos": 218, "end_char_pos": 235}, {"type": "R", "before": ", a fast, low-distortion, and differentially private primitive for the", "after": "present the oneshot Laplace mechanism, which generalizes the well-known Report Noisy Max mechanism to reporting noisy", "start_char_pos": 236, "end_char_pos": 306}, {"type": "R", "before": "problem. Compared with existing approaches in the literature, our algorithm adds Laplace noise to the counts and releases the top-k noisy counts and their estimates in a oneshot fashion, thereby substantially reducing the computational cost while maintaining satisfying utility. Our", "after": "elements. We show that the oneshot Laplace mechanism with a noise level of", "start_char_pos": 313, "end_char_pos": 595}, {"type": "A", "before": null, "after": "(\\sqrt{k", "start_char_pos": 596, "end_char_pos": 596}, {"type": "A", "before": null, "after": ") is approximately differentially private. Compared to the previous peeling approach of running Report Noisy Max k times, the oneshot Laplace mechanism only adds noises and computes the top k elements once, hence much more efficient for large k. In addition, our", "start_char_pos": 602, "end_char_pos": 602}, {"type": "D", "before": "for this mechanism", "after": null, "start_char_pos": 620, "end_char_pos": 638}, {"type": "R", "before": "is of independent theoretical interest", "after": "bypasses the use of composition theorems", "start_char_pos": 681, "end_char_pos": 719}, {"type": "R", "before": "apply the oneshot mechanism to multiple hypothesis testing and", "after": "present a novel application of efficient top-k selection in the classical problem of", "start_char_pos": 734, "end_char_pos": 796}, {"type": "D", "before": "and thus obtain their differentially private counterparts", "after": null, "start_char_pos": 831, "end_char_pos": 888}], "sents_char_pos": [0, 186, 321, 591, 721]} {"doc_id": "2105.09540", "revision_depth": "1", "before_revision": "The increasing concerns about data privacy and security drives the emergence of a new field of studying privacy-preserving machine learning from isolated data sources, i.e., federated learning . Vertical federated learning, where different parties hold different features for common users, has a great potential of driving a more variety of business cooperation among enterprises in different fields. Decision tree models especially decision tree ensembles are a class of widely applied powerful machine learning models with high interpretability and modeling efficiency. However, the interpretability are compromised in these works such as SecureBoost since the feature names are not exposed to avoid possible data breaches due to the unprotected decision path. In this paper, we shall propose Fed-EINI , an efficient and interpretable inference framework for federated decision tree models with only one round of multi-party communication. We shall compute the candidate sets of leaf nodes based on the local data at each party in parallel, followed by securely computing the weight of the only leaf node in the intersection of the candidate sets. We propose to protect the decision path by the efficient additively homomorphic encryption method, which allows the disclosure of feature names and thus makes the federated decision trees interpretable . The advantages of Fed-EINI will be demonstrated through theoretical analysis and extensive numerical results. Experiments show that the inference efficiency is improved by over 50%DIFDELCMD < \\\\%%% %DIF < in average.\\end{abstract}", "after_revision": "The increasing concerns about data privacy and security drive an emerging field of studying privacy-preserving machine learning from isolated data sources, i.e., federated learning. A class of federated learning, vertical federated learning, where different parties hold different features for common users, has a great potential of driving a more variety of business cooperation among enterprises in many fields. In machine learning, decision tree ensembles such as gradient boosting decision tree (GBDT) and random forest are widely applied powerful models with high interpretability and modeling efficiency. However, the interpretability is compromised in state-of-the-art vertical federated learning frameworks such as SecureBoost with anonymous features to avoid possible data breaches . To address this issue in the inference process, in this paper, we propose Fed-EINI to protect data privacy and allow the disclosure of feature meaning by concealing decision paths with a communication-efficient secure computation method for inference outputs . The advantages of Fed-EINI will be demonstrated through both theoretical analysis and extensive numerical results. %DIFDELCMD < \\\\%%% %DIF < in average.\\end{abstract}", "edit_actions": [{"type": "R", "before": "drives the emergence of a new", "after": "drive an emerging", "start_char_pos": 56, "end_char_pos": 85}, {"type": "D", "before": "federated learning", "after": null, "start_char_pos": 174, "end_char_pos": 192}, {"type": "R", "before": ". Vertical", "after": "federated learning. A class of", "start_char_pos": 193, "end_char_pos": 203}, {"type": "A", "before": null, "after": "vertical federated learning,", "start_char_pos": 224, "end_char_pos": 224}, {"type": "R", "before": "different fields. Decision tree models especially", "after": "many fields. In machine learning,", "start_char_pos": 384, "end_char_pos": 433}, {"type": "R", "before": "are a class of", "after": "such as gradient boosting decision tree (GBDT) and random forest are", "start_char_pos": 458, "end_char_pos": 472}, {"type": "D", "before": "machine learning", "after": null, "start_char_pos": 497, "end_char_pos": 513}, {"type": "R", "before": "are compromised in these works", "after": "is compromised in state-of-the-art vertical federated learning frameworks", "start_char_pos": 603, "end_char_pos": 633}, {"type": "R", "before": "since the feature names are not exposed", "after": "with anonymous features", "start_char_pos": 654, "end_char_pos": 693}, {"type": "R", "before": "due to the unprotected decision path. In this", "after": ". To address this issue in the inference process, in this", "start_char_pos": 726, "end_char_pos": 771}, {"type": "D", "before": "shall", "after": null, "start_char_pos": 782, "end_char_pos": 787}, {"type": "R", "before": ", an efficient and interpretable inference framework for federated decision tree models with only one round of multi-party communication. We shall compute the candidate sets of leaf nodes based on the local data at each party in parallel, followed by securely computing the weight of the only leaf node in the intersection of the candidate sets. We propose to protect the decision path by the efficient additively homomorphic encryption method, which allows the", "after": "to protect data privacy and allow the", "start_char_pos": 805, "end_char_pos": 1266}, {"type": "R", "before": "names and thus makes the federated decision trees interpretable", "after": "meaning by concealing decision paths with a communication-efficient secure computation method for inference outputs", "start_char_pos": 1289, "end_char_pos": 1352}, {"type": "A", "before": null, "after": "both", "start_char_pos": 1411, "end_char_pos": 1411}, {"type": "D", "before": "Experiments show that the inference efficiency is improved by over 50", "after": null, "start_char_pos": 1466, "end_char_pos": 1535}], "sents_char_pos": [0, 401, 572, 763, 942, 1150, 1354, 1465, 1572]} {"doc_id": "2105.12807", "revision_depth": "1", "before_revision": "Deep learning based approaches have proven promising to model omicsdata. However, one of the current limitations compared to statistical and traditional machine learning approaches is the lack of explainability, which not only reduces the reliability, but limits the potential for acquiring novel knowledge from unpicking the \" black-box \" models. Here we present XOmiVAE, a novel interpretable deep learning model for cancer classification using high-dimensional omics data. XOmiVAE is able to obtain contribution values of each gene and latent dimension for a specific prediction, and the correlation between genes and the latent dimensions . It is also revealed that XOmiVAE can explain both the supervised classification and the unsupervised clustering results from the deep learning network. To the best of our knowledge, XOmiVAE is one of the first activated-based deep learning interpretation method to explain novel clusters generated by variational autoencoders. The results generated by XOmiVAE were validated by both the biomedical knowledge and the performance of downstream tasks . XOmiVAE explanations of deep learning based cancer classification and clustering aligned with current domain knowledge including biological annotation and literature, which shows great potential for novel biomedical knowledge discovery from deep learning models . The top XOmiVAE selected genes and dimensions shown significant influence to the performance of cancer classification. Additionally, we offer important steps to consider when interpreting deep learning models for tumour classification. For instance, we demonstrate the importance of choosing background samples that makes biological sense and the limitations of connection weight based methods to explain latent dimensions .", "after_revision": "The lack of explainability is one of the most prominent disadvantages of deep learning applications in omics. This \" black box \" problem can undermine the credibility and limit the practical implementation of biomedical deep learning models. Here we present XOmiVAE, a variational autoencoder (VAE) based interpretable deep learning model for cancer classification using high-dimensional omics data. XOmiVAE is capable of revealing the contribution of each gene and latent dimension for each classification prediction, and the correlation between each gene and each latent dimension . It is also demonstrated that XOmiVAE can explain not only the supervised classification but the unsupervised clustering results from the deep learning network. To the best of our knowledge, XOmiVAE is one of the first activation level-based interpretable deep learning models explaining novel clusters generated by VAE. The explainable results generated by XOmiVAE were validated by both the performance of downstream tasks and the biomedical knowledge. In our experiments, XOmiVAE explanations of deep learning based cancer classification and clustering aligned with current domain knowledge including biological annotation and academic literature, which shows great potential for novel biomedical knowledge discovery from deep learning models .", "edit_actions": [{"type": "R", "before": "Deep learning based approaches have proven promising to model omicsdata. However, one of the current limitations compared to statistical and traditional machine learning approaches is the lack of explainability, which not only reduces the reliability, but limits the potential for acquiring novel knowledge from unpicking the", "after": "The lack of explainability is one of the most prominent disadvantages of deep learning applications in omics. This", "start_char_pos": 0, "end_char_pos": 325}, {"type": "R", "before": "black-box", "after": "black box", "start_char_pos": 328, "end_char_pos": 337}, {"type": "A", "before": null, "after": "problem can undermine the credibility and limit the practical implementation of biomedical deep learning", "start_char_pos": 340, "end_char_pos": 340}, {"type": "R", "before": "novel", "after": "variational autoencoder (VAE) based", "start_char_pos": 376, "end_char_pos": 381}, {"type": "R", "before": "able to obtain contribution values", "after": "capable of revealing the contribution", "start_char_pos": 488, "end_char_pos": 522}, {"type": "R", "before": "a specific", "after": "each classification", "start_char_pos": 561, "end_char_pos": 571}, {"type": "R", "before": "genes and the latent dimensions", "after": "each gene and each latent dimension", "start_char_pos": 612, "end_char_pos": 643}, {"type": "R", "before": "revealed", "after": "demonstrated", "start_char_pos": 657, "end_char_pos": 665}, {"type": "R", "before": "both", "after": "not only", "start_char_pos": 691, "end_char_pos": 695}, {"type": "R", "before": "and", "after": "but", "start_char_pos": 726, "end_char_pos": 729}, {"type": "R", "before": "activated-based deep learning interpretation method to explain", "after": "activation level-based interpretable deep learning models explaining", "start_char_pos": 856, "end_char_pos": 918}, {"type": "R", "before": "variational autoencoders. The", "after": "VAE. The explainable", "start_char_pos": 947, "end_char_pos": 976}, {"type": "D", "before": "biomedical knowledge and the", "after": null, "start_char_pos": 1033, "end_char_pos": 1061}, {"type": "R", "before": ".", "after": "and the biomedical knowledge. In our experiments,", "start_char_pos": 1094, "end_char_pos": 1095}, {"type": "A", "before": null, "after": "academic", "start_char_pos": 1251, "end_char_pos": 1251}, {"type": "D", "before": ". The top XOmiVAE selected genes and dimensions shown significant influence to the performance of cancer classification. Additionally, we offer important steps to consider when interpreting deep learning models for tumour classification. For instance, we demonstrate the importance of choosing background samples that makes biological sense and the limitations of connection weight based methods to explain latent dimensions", "after": null, "start_char_pos": 1359, "end_char_pos": 1783}], "sents_char_pos": [0, 72, 348, 476, 645, 797, 972, 1360, 1479, 1596]} {"doc_id": "2105.14188", "revision_depth": "1", "before_revision": "Advertisers play an important role in e-commerce platforms, whose advertising expenditures are the main source of revenue for e-commerce platforms. Therefore, providing advertisers with a better advertising experience by reducing their cost of trial and error during ad real-time bidding is crucial to the long-term revenue of e-commerce platforms . To achieve this goal, the advertising platform needs to understand the advertisers' unique marketing demands and actively recommend personalized and optimal advertising strategies for them . In this work, we first deploy a prototype recommender system on Taobao display advertising platform for constant bid and crowd optimization. Then, we propose a novel recommender system for dynamic bidding strategy recommendation, which models the advertiser' s strategy recommendation problem as a contextual bandit problem . We use a neural network as the agent to predict the advertisers' demands based on their profile and historical adoption behaviors. Based on the estimated demand, we apply simulated bidding to derive the optimal bidding strategy for recommendation and interact with the advertiser by displaying the possible advertising performance. To solve the exploration/exploitation dilemma, we use Dropout to represent the uncertainty of the network, which approximately equals to conduct Thompson sampling for efficient strategy exploration. Online evaluations show that the system can optimize the advertisers' advertising performance , and advertisers are willing to open the system, select and adopt the suggestions, which further increases the platform's revenue income . Simulation experiments based on Alibaba online bidding data prove that the agent can effectively optimize the adoption rate of advertisers , and Thompson sampling can better balance exploration and exploitation to further optimize the performance of the model .", "after_revision": "Advertising expenditures have become the major source of revenue for e-commerce platforms. Providing good advertising experiences for advertisers through reducing their costs of trial and error for discovering the optimal advertising strategies is crucial for the long-term prosperity of online advertising . To achieve this goal, the advertising platform needs to identify the advertisers' marketing objectives, and then recommend the corresponding strategies to fulfill this objective . In this work, we first deploy a prototype of strategy recommender system on Taobao display advertising platform , recommending bid prices and targeted users to advertisers. We further augment this prototype system by directly revealing the advertising performance, and then infer the advertisers' marketing objectives through their adoptions of different recommending advertising performance . We use the techniques from context bandit to jointly learn the advertisers' marketing objectives and the recommending strategies. Online evaluations show that the designed advertising strategy recommender system can optimize the advertisers' advertising performance and increase the platform's revenue . Simulation experiments based on Taobao online bidding data show that the designed contextual bandit algorithm can effectively optimize the strategy adoption rate of advertisers .", "edit_actions": [{"type": "R", "before": "Advertisers play an important role in e-commerce platforms, whose advertising expenditures are the main", "after": "Advertising expenditures have become the major", "start_char_pos": 0, "end_char_pos": 103}, {"type": "R", "before": "Therefore, providing advertisers with a better advertising experience by reducing their cost", "after": "Providing good advertising experiences for advertisers through reducing their costs", "start_char_pos": 148, "end_char_pos": 240}, {"type": "R", "before": "during ad real-time bidding is crucial to", "after": "for discovering the optimal advertising strategies is crucial for", "start_char_pos": 260, "end_char_pos": 301}, {"type": "R", "before": "revenue of e-commerce platforms", "after": "prosperity of online advertising", "start_char_pos": 316, "end_char_pos": 347}, {"type": "R", "before": "understand", "after": "identify", "start_char_pos": 406, "end_char_pos": 416}, {"type": "R", "before": "unique marketing demands and actively recommend personalized and optimal advertising strategies for them", "after": "marketing objectives, and then recommend the corresponding strategies to fulfill this objective", "start_char_pos": 434, "end_char_pos": 538}, {"type": "A", "before": null, "after": "of strategy", "start_char_pos": 583, "end_char_pos": 583}, {"type": "R", "before": "for constant bid and crowd optimization. Then, we propose a novel recommender system for dynamic bidding strategy recommendation, which models the advertiser' s strategy recommendation problem as a contextual bandit problem", "after": ", recommending bid prices and targeted users to advertisers. We further augment this prototype system by directly revealing the advertising performance, and then infer the advertisers' marketing objectives through their adoptions of different recommending advertising performance", "start_char_pos": 642, "end_char_pos": 865}, {"type": "D", "before": "a neural network as the agent to predict", "after": null, "start_char_pos": 875, "end_char_pos": 915}, {"type": "A", "before": null, "after": "techniques from context bandit to jointly learn the", "start_char_pos": 920, "end_char_pos": 920}, {"type": "R", "before": "demands based on their profile and historical adoption behaviors. Based on the estimated demand, we apply simulated bidding to derive the optimal bidding strategy for recommendation and interact with the advertiser by displaying the possible advertising performance. To solve the exploration/exploitation dilemma, we use Dropout to represent the uncertainty of the network, which approximately equals to conduct Thompson sampling for efficient strategy exploration.", "after": "marketing objectives and the recommending strategies.", "start_char_pos": 934, "end_char_pos": 1399}, {"type": "A", "before": null, "after": "designed advertising strategy recommender", "start_char_pos": 1433, "end_char_pos": 1433}, {"type": "R", "before": ", and advertisers are willing to open the system, select and adopt the suggestions, which further increases the", "after": "and increase the", "start_char_pos": 1495, "end_char_pos": 1606}, {"type": "D", "before": "income", "after": null, "start_char_pos": 1626, "end_char_pos": 1632}, {"type": "R", "before": "Alibaba", "after": "Taobao", "start_char_pos": 1667, "end_char_pos": 1674}, {"type": "R", "before": "prove that the agent", "after": "show that the designed contextual bandit algorithm", "start_char_pos": 1695, "end_char_pos": 1715}, {"type": "A", "before": null, "after": "strategy", "start_char_pos": 1745, "end_char_pos": 1745}, {"type": "D", "before": ", and Thompson sampling can better balance exploration and exploitation to further optimize the performance of the model", "after": null, "start_char_pos": 1775, "end_char_pos": 1895}], "sents_char_pos": [0, 147, 349, 540, 682, 867, 999, 1200, 1399]} {"doc_id": "2106.00676", "revision_depth": "1", "before_revision": "Classifying the core textual components of a scientific paper-title, author, body text, etc.-is a critical first step in automated scientific document understanding. Previous work has shown how using elementary layout information, i.e., each token's 2D position on the page, leads to more accurate classification. We introduce new methods for incorporating VIsual LAyout structures (VILA) , e.g., the grouping of page texts into text lines or text blocks, into language models to further improve performance. We show that the I-VILA approach, which simply adds special tokens denoting boundaries between layout structures into model inputs, can lead to +1~4.5 F1 Score improvements in token classificationtasks . Moreover, we design a hierarchical model H-VILA that encodes these layout structures and record a up-to 70\\% efficiency boost without hurting prediction accuracy. The experiments are conducted on a newly curated evaluation suite, S2-VLUE, with a novel metric measuring VILA awareness and a new dataset covering 19 scientific disciplines with gold annotations . Pre-trained weights, benchmark datasets, and source code will be available at URL", "after_revision": "Classifying the core textual components of a scientific paper-title, author, body text, etc.-is a critical first step in automated scientific document understanding. Previous work has shown how using elementary layout information, i.e., each token's 2D position on the page, leads to more accurate classification. We introduce new methods for incorporating VIsual LAyout (VILA) structures , e.g., the grouping of page texts into text lines or text blocks, into language models to further improve performance. We show that the I-VILA approach, which simply adds special tokens denoting the boundaries of layout structures into model inputs, can lead to 1.9\\% Macro F1 improvements for token classification . Moreover, we design a hierarchical model , H-VILA , that encodes the text based on layout structures and record an up-to 47\\% inference time reduction with less than 1.5\\% Macro F1 loss for the text classification models. Experiments are conducted on a newly curated evaluation suite, S2-VLUE, with a novel metric measuring classification uniformity within visual groups and a new dataset of gold annotations covering papers from 19 scientific disciplines . Pre-trained weights, benchmark datasets, and source code will be available at URL", "edit_actions": [{"type": "D", "before": "structures", "after": null, "start_char_pos": 371, "end_char_pos": 381}, {"type": "A", "before": null, "after": "structures", "start_char_pos": 389, "end_char_pos": 389}, {"type": "R", "before": "boundaries between", "after": "the boundaries of", "start_char_pos": 586, "end_char_pos": 604}, {"type": "R", "before": "+1~4.5", "after": "1.9\\% Macro", "start_char_pos": 654, "end_char_pos": 660}, {"type": "R", "before": "Score improvements in token classificationtasks", "after": "improvements for token classification", "start_char_pos": 664, "end_char_pos": 711}, {"type": "A", "before": null, "after": ",", "start_char_pos": 755, "end_char_pos": 755}, {"type": "R", "before": "that encodes these", "after": ", that encodes the text based on", "start_char_pos": 763, "end_char_pos": 781}, {"type": "R", "before": "a", "after": "an", "start_char_pos": 811, "end_char_pos": 812}, {"type": "R", "before": "70\\% efficiency boost without hurting prediction accuracy. The experiments", "after": "47\\% inference time reduction with less than 1.5\\% Macro F1 loss for the text classification models. Experiments", "start_char_pos": 819, "end_char_pos": 893}, {"type": "R", "before": "VILA awareness", "after": "classification uniformity within visual groups", "start_char_pos": 984, "end_char_pos": 998}, {"type": "R", "before": "covering", "after": "of gold annotations covering papers from", "start_char_pos": 1017, "end_char_pos": 1025}, {"type": "D", "before": "with gold annotations", "after": null, "start_char_pos": 1052, "end_char_pos": 1073}], "sents_char_pos": [0, 165, 313, 509, 713, 877]} {"doc_id": "2106.00715", "revision_depth": "1", "before_revision": "We provide a theory as to why the locus of a triangle center over Poncelet 3-periodics in an ellipse pair is an ellipse or not. For the confocal pair (elliptic billiard), we show that if the center can be expressed as a fixed affine combination of barycenter, circumcenter, and mittenpunkt (which is stationary over the confocal family) , then its locus will be an ellipse. We also provide conditions under which a particular locus will be a circle or a segment. We also analyze locus turning number and monotonicity with respect to vertices of the 3-periodic family. Finally we write out expressions for the convex quartic locus of the incenter for a generic Poncelet family, conjecturing it can only be an ellipse if the pair is confocal .", "after_revision": "We propose a theory which predicts the ellipticity of a triangle center 's locus over a Poncelet 3-periodic family. We show that if the triangle center can be expressed as a fixed affine combination of barycenter, circumcenter, and a third, stationary point over some family , then its locus will be an ellipse. Taking billiard 3-periodics as an example, the third point is the mittenpunkt. We derive conditions under which a locus degenerates to a segment or is a circle. We show a locus turning number is either plus or minus 3 and predict its movement monotonicity with respect to vertices of the 3-periodic family. Finally , we derive a (long) expression for the loci of the incenter and excenters over a generic Poncelet 3-periodic family, showing they are roots of a quartic. We conjecture (i) those loci are convex, and (ii) that they can only be ellipses if the pair is confocal , i.e., within a 1d subspace of the 5d space of ellipse pairs which admit 3-periodics .", "edit_actions": [{"type": "R", "before": "provide a theory as to why the locus", "after": "propose a theory which predicts the ellipticity", "start_char_pos": 3, "end_char_pos": 39}, {"type": "R", "before": "over Poncelet 3-periodics in an ellipse pair is an ellipse or not. For the confocal pair (elliptic billiard), we", "after": "'s locus over a Poncelet 3-periodic family. We", "start_char_pos": 61, "end_char_pos": 173}, {"type": "A", "before": null, "after": "triangle", "start_char_pos": 191, "end_char_pos": 191}, {"type": "R", "before": "mittenpunkt (which is stationary over the confocal family)", "after": "a third, stationary point over some family", "start_char_pos": 279, "end_char_pos": 337}, {"type": "R", "before": "We also provide", "after": "Taking billiard 3-periodics as an example, the third point is the mittenpunkt. We derive", "start_char_pos": 375, "end_char_pos": 390}, {"type": "D", "before": "particular locus will be a circle or a segment. We also analyze", "after": null, "start_char_pos": 416, "end_char_pos": 479}, {"type": "A", "before": null, "after": "degenerates to a segment or is a circle. We show a locus", "start_char_pos": 486, "end_char_pos": 486}, {"type": "R", "before": "and", "after": "is either plus or minus 3 and predict its movement", "start_char_pos": 502, "end_char_pos": 505}, {"type": "R", "before": "we write out expressions for the convex quartic locus", "after": ", we derive a (long) expression for the loci", "start_char_pos": 578, "end_char_pos": 631}, {"type": "R", "before": "for", "after": "and excenters over", "start_char_pos": 648, "end_char_pos": 651}, {"type": "R", "before": "family, conjecturing it", "after": "3-periodic family, showing they are roots of a quartic. We conjecture (i) those loci are convex, and (ii) that they", "start_char_pos": 671, "end_char_pos": 694}, {"type": "R", "before": "an ellipse", "after": "ellipses", "start_char_pos": 707, "end_char_pos": 717}, {"type": "A", "before": null, "after": ", i.e., within a 1d subspace of the 5d space of ellipse pairs which admit 3-periodics", "start_char_pos": 742, "end_char_pos": 742}], "sents_char_pos": [0, 127, 374, 463, 569]} {"doc_id": "2106.02812", "revision_depth": "1", "before_revision": "Quantum Approximate Optimization Algorithm (QAOA) has been studied widely in the literature, primarily for finding an approximate value of the maximum cut size of a graph. QAOA is composed of a problem hamiltonian and a mixer hamiltonian which are applied alternately for p \\geq 1 layers. The circuit for this algorithm requires 2m CNOT gatesin each layer, where m is the number of edges in the graph. CNOT gate is one of the primary sources of error in modern quantum computers. In this paper, we propose two techniques for reducing the number of CNOT gates in the circuit which are independent of the hardware architecture. For a graph with n vertices, we first propose a technique based on edge coloring that can reduce upto \\lfloor n{2} \\rfloor CNOT gates in the circuit . Next, we propose another technique based on Depth First Search (DFS) that can reduce n-1 CNOT gates at the cost of some increased depth . We analytically derive the criteria for which the reduction in the number of CNOT gates due to the DFS based technique can provide lower error probability even with some increased depth, and show that all graphs conform to this criteria, making this technique universal. We further show that this proposed optimization holds even in the post transpilation stage of the circuit , which is actually executed in the IBM Quantum hardware . We simulate these two techniques for graphs of various sparsity with the ibmq_manhattan noise model \\textit{ and show that the DFS based technique outperforms the edge coloring based technique , which in turn, outperforms the traditional QAOA circuit in terms of reduction in the number of CNOT gates, and hence the probability of error of the circuit.", "after_revision": "Quantum Approximate Optimization Algorithm (QAOA) is studied primarily to find approximate solutions to combinatorial optimization problems. For a graph with n vertices and m edges, a depth p QAOA for the Max-cut problem requires 2\\cdot m \\cdot p CNOT gates. CNOT is one of the primary sources of error in modern quantum computers. In this paper, we propose two hardware independent methods to reduce the number of CNOT gates in the circuit . First, we present a method based on Edge Coloring of the input graph that minimizes the the number of cycles (termed as depth of the circuit), and reduces upto \\lfloor n{2} \\rfloor CNOT gates . Next, we depict another method based on Depth First Search (DFS) on the input graph that reduces n-1 CNOT gates , but increases depth of the circuit moderately . We analytically derive the condition for which the reduction in CNOT gates overshadows this increase in depth, and the error probability of the circuit is still lowered. We show that all IBM Quantum Hardware satisfy this condition . We simulate these two methods for graphs of various sparsity with the \\textit{ibmq\\_manhattan noise model, and show that the DFS based method outperforms the edge coloring based method , which in turn, outperforms the traditional QAOA circuit in terms of reduction in the number of CNOT gates, and hence the probability of error of the circuit.", "edit_actions": [{"type": "R", "before": "has been studied widely in the literature, primarily for finding an approximate value of the maximum cut size of a graph. QAOA is composed of a problem hamiltonian and a mixer hamiltonian which are applied alternately for p \\geq 1 layers. The circuit for this algorithm requires 2m CNOT gatesin each layer, where m is the number of edges in the graph. CNOT gate", "after": "is studied primarily to find approximate solutions to combinatorial optimization problems. For a graph with n vertices and m edges, a depth p QAOA for the Max-cut problem requires 2\\cdot m \\cdot p CNOT gates. CNOT", "start_char_pos": 50, "end_char_pos": 411}, {"type": "R", "before": "techniques for reducing", "after": "hardware independent methods to reduce", "start_char_pos": 510, "end_char_pos": 533}, {"type": "R", "before": "which are independent of the hardware architecture. For a graph with n vertices, we first propose a technique based on edge coloring that can reduce", "after": ". First, we present a method based on Edge Coloring of the input graph that minimizes the the number of cycles (termed as depth of the circuit), and reduces", "start_char_pos": 574, "end_char_pos": 722}, {"type": "D", "before": "in the circuit", "after": null, "start_char_pos": 760, "end_char_pos": 774}, {"type": "R", "before": "propose another technique", "after": "depict another method", "start_char_pos": 786, "end_char_pos": 811}, {"type": "R", "before": "that can reduce", "after": "on the input graph that reduces", "start_char_pos": 846, "end_char_pos": 861}, {"type": "R", "before": "at the cost of some increased depth", "after": ", but increases depth of the circuit moderately", "start_char_pos": 877, "end_char_pos": 912}, {"type": "R", "before": "criteria", "after": "condition", "start_char_pos": 942, "end_char_pos": 950}, {"type": "R", "before": "the number of CNOT gates due to the DFS based technique can provide lower error probability even with some increased", "after": "CNOT gates overshadows this increase in", "start_char_pos": 978, "end_char_pos": 1094}, {"type": "R", "before": "show that all graphs conform to this criteria, making this technique universal. We further show that this proposed optimization holds even in the post transpilation stage", "after": "the error probability", "start_char_pos": 1106, "end_char_pos": 1276}, {"type": "R", "before": ", which is actually executed in the IBM Quantum hardware", "after": "is still lowered. We show that all IBM Quantum Hardware satisfy this condition", "start_char_pos": 1292, "end_char_pos": 1348}, {"type": "R", "before": "techniques", "after": "methods", "start_char_pos": 1373, "end_char_pos": 1383}, {"type": "D", "before": "ibmq_manhattan noise model", "after": null, "start_char_pos": 1424, "end_char_pos": 1450}, {"type": "A", "before": null, "after": "ibmq\\_manhattan", "start_char_pos": 1459, "end_char_pos": 1459}, {"type": "A", "before": null, "after": "noise model,", "start_char_pos": 1460, "end_char_pos": 1460}, {"type": "R", "before": "technique", "after": "method", "start_char_pos": 1489, "end_char_pos": 1498}, {"type": "R", "before": "technique", "after": "method", "start_char_pos": 1535, "end_char_pos": 1544}], "sents_char_pos": [0, 171, 288, 401, 479, 625, 776, 914, 1185, 1350]} {"doc_id": "2106.10271", "revision_depth": "1", "before_revision": "Temporal action detection (TAD) aims to determine the semantic label and the boundaries of every action instance in an untrimmed video. It is a fundamental task in video understanding and significant progress has been made in TAD . Previous methods involve multiple stages or networks and hand-designed rules or operations, which fall short in efficiency and flexibility. Here, we construct an end-to-end framework for TAD upon Transformer, termed TadTR, which simultaneously predicts all action instances as a set of labels and temporal locations in parallel. TadTR is able to adaptively extract temporal context information needed for making action predictions, by selectively attending to a number of snippets in a video. It greatly simplifies the pipeline of TAD and runs much faster than previous detectors . Our method achieves state-of-the-art performance on HACS Segments and THUMOS14 and competitive performance on ActivityNet-1.3. Our code will be made available at URL", "after_revision": "Temporal action detection (TAD) aims to determine the semantic label and the boundaries of every action instance in an untrimmed video. It is a fundamental and challenging task in video understanding and significant progress has been made . Previous methods involve multiple stages or networks and hand-designed rules or operations, which fall short in efficiency and flexibility. In this paper, we propose an end-to-end framework for TAD upon Transformer, termed TadTR, which maps a set of learnable embeddings to action instances in parallel. TadTR is able to adaptively extract temporal context information required for making action predictions, by selectively attending to a sparse set of snippets in a video. As a result, it simplifies the pipeline of TAD and requires lower computation cost than previous detectors , while preserving remarkable detection performance. TadTR achieves state-of-the-art performance on HACS Segments (+3.35\\% average mAP). As a single-network detector, TadTR runs 10\\times faster than its comparable competitor. It outperforms existing single-network detectors by a large margin on THUMOS14 (+5.0\\% average mAP) and ActivityNet (+7.53\\% average mAP). When combined with other detectors, it reports 54.1\\% mAP at IoU=0.5 on THUMOS14, and 34.55\\% average mAP on ActivityNet-1.3. Our code will be released at URL", "edit_actions": [{"type": "A", "before": null, "after": "and challenging", "start_char_pos": 156, "end_char_pos": 156}, {"type": "D", "before": "in TAD", "after": null, "start_char_pos": 224, "end_char_pos": 230}, {"type": "R", "before": "Here, we construct", "after": "In this paper, we propose", "start_char_pos": 373, "end_char_pos": 391}, {"type": "R", "before": "simultaneously predicts all action instances as", "after": "maps", "start_char_pos": 462, "end_char_pos": 509}, {"type": "R", "before": "labels and temporal locations", "after": "learnable embeddings to action instances", "start_char_pos": 519, "end_char_pos": 548}, {"type": "R", "before": "needed", "after": "required", "start_char_pos": 627, "end_char_pos": 633}, {"type": "R", "before": "number", "after": "sparse set", "start_char_pos": 695, "end_char_pos": 701}, {"type": "R", "before": "It greatly", "after": "As a result, it", "start_char_pos": 726, "end_char_pos": 736}, {"type": "R", "before": "runs much faster", "after": "requires lower computation cost", "start_char_pos": 772, "end_char_pos": 788}, {"type": "R", "before": ". Our method", "after": ", while preserving remarkable detection performance. TadTR", "start_char_pos": 813, "end_char_pos": 825}, {"type": "R", "before": "and", "after": "(+3.35\\% average mAP). As a single-network detector, TadTR runs 10\\times faster than its comparable competitor. It outperforms existing single-network detectors by a large margin on", "start_char_pos": 881, "end_char_pos": 884}, {"type": "R", "before": "and competitive performance", "after": "(+5.0\\% average mAP) and ActivityNet (+7.53\\% average mAP). When combined with other detectors, it reports 54.1\\% mAP at IoU=0.5", "start_char_pos": 894, "end_char_pos": 921}, {"type": "A", "before": null, "after": "THUMOS14, and 34.55\\% average mAP on", "start_char_pos": 925, "end_char_pos": 925}, {"type": "R", "before": "made available", "after": "released", "start_char_pos": 960, "end_char_pos": 974}], "sents_char_pos": [0, 135, 372, 561, 725, 814, 942]} {"doc_id": "2106.11582", "revision_depth": "1", "before_revision": "Nowadays, analysis of transparent images in the field of computer vision has gradually become a hot spot. In this paper , we compare the classification performance of different deep learning for the problem that transparent images are difficult to analyze. We crop the transparent images into 8 * 8 and 224 * 224 pixels patches in the same proportion , and then divide the two different pixels patches into foreground and background according to groundtruch . We also use 4 types of convolutional neural networks and a novel ViT network model to compare the foreground and background classification experiments. We conclude that ViT performs the worst in classifying 8 * 8 pixels patches, but it outperforms most convolutional neural networks in classifying 224 * 224.", "after_revision": "Nowadays, analysis of Transparent Environmental URLanism Images (T-EM images) in the field of computer vision has gradually become a new and interesting spot. This paper compares different deep learning classification performance for the problem that T-EM images are challenging to analyze. We crop the T-EM images into 8 * 8 and 224 * 224 pixel patches in the same proportion and then divide the two different pixel patches into foreground and background according to ground truth . We also use four convolutional neural networks and a novel ViT network model to compare the foreground and background classification experiments. We conclude that ViT performs the worst in classifying 8 * 8 pixel patches, but it outperforms most convolutional neural networks in classifying 224 * 224 pixel patches.", "edit_actions": [{"type": "R", "before": "transparent images", "after": "Transparent Environmental URLanism Images (T-EM images)", "start_char_pos": 22, "end_char_pos": 40}, {"type": "R", "before": "hot spot. In this paper , we compare the classification performance of", "after": "new and interesting spot. This paper compares", "start_char_pos": 96, "end_char_pos": 166}, {"type": "A", "before": null, "after": "classification performance", "start_char_pos": 191, "end_char_pos": 191}, {"type": "R", "before": "transparent images are difficult", "after": "T-EM images are challenging", "start_char_pos": 213, "end_char_pos": 245}, {"type": "R", "before": "transparent", "after": "T-EM", "start_char_pos": 270, "end_char_pos": 281}, {"type": "R", "before": "pixels", "after": "pixel", "start_char_pos": 314, "end_char_pos": 320}, {"type": "D", "before": ",", "after": null, "start_char_pos": 352, "end_char_pos": 353}, {"type": "R", "before": "pixels", "after": "pixel", "start_char_pos": 388, "end_char_pos": 394}, {"type": "R", "before": "groundtruch", "after": "ground truth", "start_char_pos": 447, "end_char_pos": 458}, {"type": "R", "before": "4 types of", "after": "four", "start_char_pos": 473, "end_char_pos": 483}, {"type": "R", "before": "pixels", "after": "pixel", "start_char_pos": 674, "end_char_pos": 680}, {"type": "R", "before": "224.", "after": "224 pixel patches.", "start_char_pos": 765, "end_char_pos": 769}], "sents_char_pos": [0, 105, 257, 460, 612]} {"doc_id": "2107.00420", "revision_depth": "1", "before_revision": "Modern top-performing object detectors depend heavily on backbone networks, whose advances bring consistent performance gains through exploring more effective network structures. However, designing or searching for a new backbone and pre-training it on ImageNet may require a large number of computational resources, making it costly to obtain better detection performance. In this paper, we propose a novel backbone network, namely CBNetV2, by constructing compositions of existing open-sourced pre-trained backbones. In particular, CBNetV2 architecture groups multiple identical backbones, which are connected through composite connections. We also propose a better training strategy with the Assistant Supervision for CBNet-based detectors. Without additional pre-training, CBNetV2 can be integrated into mainstream detectors, including one-stage and two-stage detectors , as well as anchor-based and anchor-free-based ones, and significantly improve their performance by more than 3.0\\% AP over the baseline on COCO. Also, experiments provide strong evidence showing that composite backbones are more efficient and resource-friendly than pre-trained wider and deeper networks , including manual-based and NAS-based, as well as CNN-based and Transformer-based ones . Particularly, with single-model and single-scale testing, our HTC Dual-Swin-B achieves 58.6\\% box AP and 51.1\\% mask AP on COCO test-dev, which is significantly better than the state-of-the-art result (i.e., 57.7\\% box AP and 50.2\\% mask AP) achieved by a stronger baseline HTC++ with a larger backbone Swin-L. Code will be released at URL", "after_revision": "Consistent performance gains through exploring more effective network structures. In this paper, we propose a novel backbone network, namely CBNetV2, by constructing compositions of existing open-sourced pre-trained backbones. In particular, CBNetV2 architecture groups multiple identical backbones, which are connected through composite connections. Specifically, CBNetV2 integrates the high- and low-level features of multiple backbone networks and gradually expands the receptive field to more efficiently perform object detection. We also propose a better training strategy with the Assistant Supervision for CBNet-based detectors. Without additional pre-training, CBNetV2 can be adapt to various backbones, including manual-based and NAS-based , as well as CNN-based and Transformer-based ones. Experiments provide strong evidence showing that composite backbones are more efficient , effective, and resource-friendly than wider and deeper networks . CBNetV2 is compatible with most mainstream detectors, including one-stage and two-stage detectors , as well as anchor-based and anchor-free-based ones, and significantly improve their performance by more than 3.0\\% AP over the baseline on COCO . Particularly, with single-model and single-scale testing, our HTC Dual-Swin-B achieves 58.6\\% box AP and 51.1\\% mask AP on COCO test-dev, which is significantly better than the state-of-the-art result (i.e., 57.7\\% box AP and 50.2\\% mask AP) achieved by HTC++ with Swin-L. Code is released at URL", "edit_actions": [{"type": "R", "before": "Modern top-performing object detectors depend heavily on backbone networks, whose advances bring consistent", "after": "Consistent", "start_char_pos": 0, "end_char_pos": 107}, {"type": "D", "before": "However, designing or searching for a new backbone and pre-training it on ImageNet may require a large number of computational resources, making it costly to obtain better detection performance.", "after": null, "start_char_pos": 179, "end_char_pos": 373}, {"type": "A", "before": null, "after": "Specifically, CBNetV2 integrates the high- and low-level features of multiple backbone networks and gradually expands the receptive field to more efficiently perform object detection.", "start_char_pos": 643, "end_char_pos": 643}, {"type": "R", "before": "integrated into mainstream detectors, including one-stage and two-stage detectors", "after": "adapt to various backbones, including manual-based and NAS-based", "start_char_pos": 793, "end_char_pos": 874}, {"type": "R", "before": "anchor-based and anchor-free-based ones, and significantly improve their performance by more than 3.0\\% AP over the baseline on COCO. Also, experiments", "after": "CNN-based and Transformer-based ones. Experiments", "start_char_pos": 888, "end_char_pos": 1039}, {"type": "A", "before": null, "after": ", effective,", "start_char_pos": 1116, "end_char_pos": 1116}, {"type": "D", "before": "pre-trained", "after": null, "start_char_pos": 1144, "end_char_pos": 1155}, {"type": "A", "before": null, "after": ". CBNetV2 is compatible with most mainstream detectors, including one-stage and two-stage detectors", "start_char_pos": 1182, "end_char_pos": 1182}, {"type": "D", "before": "including manual-based and NAS-based,", "after": null, "start_char_pos": 1185, "end_char_pos": 1222}, {"type": "R", "before": "CNN-based and Transformer-based ones", "after": "anchor-based and anchor-free-based ones, and significantly improve their performance by more than 3.0\\% AP over the baseline on COCO", "start_char_pos": 1234, "end_char_pos": 1270}, {"type": "D", "before": "a stronger baseline", "after": null, "start_char_pos": 1527, "end_char_pos": 1546}, {"type": "D", "before": "a larger backbone", "after": null, "start_char_pos": 1558, "end_char_pos": 1575}, {"type": "R", "before": "will be", "after": "is", "start_char_pos": 1589, "end_char_pos": 1596}], "sents_char_pos": [0, 178, 373, 518, 642, 744, 1021, 1184, 1583]} {"doc_id": "2107.00420", "revision_depth": "2", "before_revision": "Consistent performance gains through exploring more effective network structures. In this paper, we propose a novel backbone network , namely CBNetV2, by constructing compositions of existing open-sourced pre-trained backbones . In particular, CBNetV2 architecture groups multiple identical backbones, which are connected through composite connections. Specifically, CBNetV2 integrates the high- and low-level features of multiple backbone networks and gradually expands the receptive field to more efficiently perform object detection. We also propose a better training strategy with the Assistant Supervision for CBNet-based detectors. Without additional pre-training, CBNetV2 can be adapt to various backbones, including manual-based and NAS-based, as well as CNN-based and Transformer-based ones. Experiments provide strong evidence showing that composite backbones are more efficient, effective, and resource-friendly than wider and deeper networks. CBNetV2 is compatible with most mainstream detectors, including one-stage and two-stage detectors, as well as anchor-based and anchor-free-based ones, and significantly improve their performance by more than 3.0\\% AP over the baseline on COCO. Particularly, with single-model and single-scale testing , our HTC Dual-Swin-B achieves 58.6 \\% box AP and 51.1 \\% mask AP on COCO test-dev, which is significantly better than the state-of-the-art result (i.e., 57.7\\% box AP and 50.2\\% mask AP) achieved by HTC++ with Swin-L . Code is released at URL", "after_revision": "Modern top-performing object detectors depend heavily on backbone networks, whose advances bring consistent performance gains through exploring more effective network structures. In this paper, we propose a novel and flexible backbone framework , namely CBNetV2, to better train existing open-sourced pre-trained backbones under the pre-training fine-tuning protocol . In particular, CBNetV2 architecture groups multiple identical backbones, which are connected through composite connections. Specifically, it integrates the high- and low-level features of multiple backbone networks and gradually expands the receptive field to more efficiently perform object detection. We also propose a better training strategy with assistant supervision for CBNet-based detectors. CBNetV2 has strong generalization capabilities for different backbones and head designs of the detector architecture. Without additional pre-training, CBNetV2 can be adapted to various backbones, including manual-based and NAS-based, as well as CNN-based and Transformer-based ones. Experiments provide strong evidence showing that composite backbones are more efficient, effective, and resource-friendly than wider and deeper networks. CBNetV2 is compatible with the head designs of most mainstream detectors, including one-stage and two-stage detectors, as well as anchor-based and anchor-free-based ones, and significantly improve their performances by more than 3.0\\% AP over the baseline on COCO. Particularly, under the single-model and single-scale testing protocol, our Dual-Swin-L achieves 59.4 \\% box AP and 51.6 \\% mask AP on COCO test-dev, which is significantly better than the state-of-the-art result (i.e., 57.7\\% box AP and 50.2\\% mask AP) . Code is available at URL", "edit_actions": [{"type": "R", "before": "Consistent", "after": "Modern top-performing object detectors depend heavily on backbone networks, whose advances bring consistent", "start_char_pos": 0, "end_char_pos": 10}, {"type": "R", "before": "backbone network", "after": "and flexible backbone framework", "start_char_pos": 116, "end_char_pos": 132}, {"type": "R", "before": "by constructing compositions of", "after": "to better train", "start_char_pos": 151, "end_char_pos": 182}, {"type": "A", "before": null, "after": "under the pre-training fine-tuning protocol", "start_char_pos": 227, "end_char_pos": 227}, {"type": "R", "before": "CBNetV2", "after": "it", "start_char_pos": 368, "end_char_pos": 375}, {"type": "R", "before": "the Assistant Supervision", "after": "assistant supervision", "start_char_pos": 586, "end_char_pos": 611}, {"type": "A", "before": null, "after": "CBNetV2 has strong generalization capabilities for different backbones and head designs of the detector architecture.", "start_char_pos": 639, "end_char_pos": 639}, {"type": "R", "before": "adapt", "after": "adapted", "start_char_pos": 688, "end_char_pos": 693}, {"type": "A", "before": null, "after": "the head designs of", "start_char_pos": 984, "end_char_pos": 984}, {"type": "R", "before": "performance", "after": "performances", "start_char_pos": 1141, "end_char_pos": 1152}, {"type": "R", "before": "with", "after": "under the", "start_char_pos": 1216, "end_char_pos": 1220}, {"type": "R", "before": ", our HTC Dual-Swin-B achieves 58.6", "after": "protocol, our Dual-Swin-L achieves 59.4", "start_char_pos": 1259, "end_char_pos": 1294}, {"type": "R", "before": "51.1", "after": "51.6", "start_char_pos": 1309, "end_char_pos": 1313}, {"type": "D", "before": "achieved by HTC++ with Swin-L", "after": null, "start_char_pos": 1447, "end_char_pos": 1476}, {"type": "R", "before": "released", "after": "available", "start_char_pos": 1487, "end_char_pos": 1495}], "sents_char_pos": [0, 81, 229, 353, 537, 638, 802, 956, 1201]} {"doc_id": "2107.00420", "revision_depth": "3", "before_revision": "Modern top-performing object detectors depend heavily on backbone networks, whose advances bring consistent performance gains through exploring more effective network structures. In this paper, we propose a novel and flexible backbone framework, namely CBNetV2, to better train existing open-sourced pre-trained backbones under the pre-training fine-tuning protocol . In particular, CBNetV2 architecture groups multiple identical backbones, which are connected through composite connections. Specifically, it integrates the high- and low-level features of multiple backbone networks and gradually expands the receptive field to more efficiently perform object detection. We also propose a better training strategy with assistant supervision for CBNet-based detectors. CBNetV2 has strong generalization capabilities for different backbones and head designs of the detector architecture. Without additional pre-training , CBNetV2 can be adapted to various backbones , including manual-based and NAS-based, as well as CNN-based and Transformer-based ones. Experiments provide strong evidence showing that composite backbones are more efficient, effective, and resource-friendly than wider and deeper networks. CBNetV2 is compatible with the head designs of most mainstream detectors , including one-stage and two-stage detectors, as well as anchor-based and anchor-free-based ones, and significantly improve their performances by more than 3.0\\% AP over the baseline on COCO . Particularly, under the single-model and single-scale testing protocol, our Dual-Swin-L achieves 59.4\\% box AP and 51.6\\% mask AP on COCO test-dev , which is significantly better than the state-of-the-art result ( i.e., 57.7\\% box AP and 50.2\\% mask AP) . Code is available at URL", "after_revision": "Modern top-performing object detectors depend heavily on backbone networks, whose advances bring consistent performance gains through exploring more effective network structures. In this paper, we propose a novel and flexible backbone framework, namely CBNetV2, to construct high-performance detectors using existing open-sourced pre-trained backbones under the pre-training fine-tuning paradigm . In particular, CBNetV2 architecture groups multiple identical backbones, which are connected through composite connections. Specifically, it integrates the high- and low-level features of multiple backbone networks and gradually expands the receptive field to more efficiently perform object detection. We also propose a better training strategy with assistant supervision for CBNet-based detectors. Without additional pre-training of the composite backbone , CBNetV2 can be adapted to various backbones ( CNN-based vs. Transformer-based ) and head designs of most mainstream detectors ( one-stage vs. two-stage , anchor-based vs. anchor-free-based ). Experiments provide strong evidence that, compared with simply increasing the depth and width of the network, CBNetV2 introduces a more efficient, effective, and resource-friendly way to build high-performance backbone networks . Particularly, our Dual-Swin-L achieves 59.4\\% box AP and 51.6\\% mask AP on COCO test-dev under the single-model and single-scale testing protocol , which is significantly better than the state-of-the-art result ( 57.7\\% box AP and 50.2\\% mask AP) achieved by Swin-L, while the training schedule is reduced by 6\\times. With multi-scale testing, we push the current best single model result to a new record of 60.1\\% box AP and 52.3\\% mask AP without using extra training data . Code is available at URL", "edit_actions": [{"type": "R", "before": "better train", "after": "construct high-performance detectors using", "start_char_pos": 265, "end_char_pos": 277}, {"type": "R", "before": "protocol", "after": "paradigm", "start_char_pos": 357, "end_char_pos": 365}, {"type": "D", "before": "CBNetV2 has strong generalization capabilities for different backbones and head designs of the detector architecture.", "after": null, "start_char_pos": 768, "end_char_pos": 885}, {"type": "A", "before": null, "after": "of the composite backbone", "start_char_pos": 918, "end_char_pos": 918}, {"type": "R", "before": ", including manual-based and NAS-based, as well as", "after": "(", "start_char_pos": 965, "end_char_pos": 1015}, {"type": "R", "before": "and", "after": "vs.", "start_char_pos": 1026, "end_char_pos": 1029}, {"type": "R", "before": "ones. Experiments provide strong evidence showing that composite backbones are more efficient, effective, and resource-friendly than wider and deeper networks. CBNetV2 is compatible with the", "after": ") and", "start_char_pos": 1048, "end_char_pos": 1238}, {"type": "R", "before": ", including", "after": "(", "start_char_pos": 1281, "end_char_pos": 1292}, {"type": "R", "before": "and", "after": "vs.", "start_char_pos": 1303, "end_char_pos": 1306}, {"type": "R", "before": "detectors, as well as", "after": ",", "start_char_pos": 1317, "end_char_pos": 1338}, {"type": "R", "before": "and", "after": "vs.", "start_char_pos": 1352, "end_char_pos": 1355}, {"type": "R", "before": "ones, and significantly improve their performances by more than 3.0\\% AP over the baseline on COCO", "after": "). Experiments provide strong evidence that, compared with simply increasing the depth and width of the network, CBNetV2 introduces a more efficient, effective, and resource-friendly way to build high-performance backbone networks", "start_char_pos": 1374, "end_char_pos": 1472}, {"type": "D", "before": "under the single-model and single-scale testing protocol,", "after": null, "start_char_pos": 1489, "end_char_pos": 1546}, {"type": "A", "before": null, "after": "under the single-model and single-scale testing protocol", "start_char_pos": 1622, "end_char_pos": 1622}, {"type": "D", "before": "i.e.,", "after": null, "start_char_pos": 1690, "end_char_pos": 1695}, {"type": "A", "before": null, "after": "achieved by Swin-L, while the training schedule is reduced by 6\\times. With multi-scale testing, we push the current best single model result to a new record of 60.1\\% box AP and 52.3\\% mask AP without using extra training data", "start_char_pos": 1730, "end_char_pos": 1730}], "sents_char_pos": [0, 178, 367, 491, 670, 767, 885, 1053, 1207, 1282]} {"doc_id": "2107.02477", "revision_depth": "1", "before_revision": "In recent years, benefiting from the expressivepower of Graph Convolutional Networks (GCNs), significant breakthroughs have been made in faceclustering . However, rare attention has been paidto GCN-based clustering on imbalanced data. Al-though imbalance problem has been extensivelystudied , the impact of imbalanced data on GCN-based linkage prediction task is quite different, which would cause problems in two aspects: im-balanced linkage labels and biased graph represen-tations . The problem of imbalanced linkage labelsis similar to that in image classification task, but thelatter is a particular problem in GCN-based clus-tering via linkage prediction. Significantly biasedgraph representations in training can cause catas-trophic overfitting of a GCN model. To tacklethese problems, we evaluate the feasibility of thoseexisting methods for imbalanced image classifica-tion problem on graphs with extensive experiments, and present a new method to alleviate the imbal-anced labels and also augment graph representa-tions using a Reverse-Imbalance Weighted Sam-pling (RIWS) strategy, followed with insightfulanalyses and discussions. A series of imbalancedbenchmark datasets synthesized from MS-Celeb-1M and DeepFashion will be openly available .", "after_revision": "In recent years, benefiting from the expressive power of Graph Convolutional Networks (GCNs), significant breakthroughs have been made in face clustering . However, rare attention has been paid to GCN-based clustering on imbalanced data. Although imbalance problem has been extensively studied , the impact of imbalanced data on GCN-based linkage prediction task is quite different, which would cause problems in two aspects: imbalanced linkage labels and biased graph representations . The problem of imbalanced linkage labels is similar to that in image classification task, but the latter is a particular problem in GCN-based clustering via linkage prediction. Significantly biased graph representations in training can cause catastrophic overfitting of a GCN model. To tackle these problems, we evaluate the feasibility of those existing methods for imbalanced image classification problem on graphs with extensive experiments, and present a new method to alleviate the imbalanced labels and also augment graph representations using a Reverse-Imbalance Weighted Sampling (RIWS) strategy, followed with insightful analyses and discussions. The code and a series of imbalanced benchmark datasets synthesized from MS-Celeb-1M and DeepFashion are available on URL", "edit_actions": [{"type": "R", "before": "expressivepower", "after": "expressive power", "start_char_pos": 37, "end_char_pos": 52}, {"type": "R", "before": "faceclustering", "after": "face clustering", "start_char_pos": 137, "end_char_pos": 151}, {"type": "R", "before": "paidto", "after": "paid to", "start_char_pos": 187, "end_char_pos": 193}, {"type": "R", "before": "Al-though", "after": "Although", "start_char_pos": 235, "end_char_pos": 244}, {"type": "R", "before": "extensivelystudied", "after": "extensively studied", "start_char_pos": 272, "end_char_pos": 290}, {"type": "R", "before": "im-balanced", "after": "imbalanced", "start_char_pos": 423, "end_char_pos": 434}, {"type": "R", "before": "represen-tations", "after": "representations", "start_char_pos": 467, "end_char_pos": 483}, {"type": "R", "before": "labelsis", "after": "labels is", "start_char_pos": 520, "end_char_pos": 528}, {"type": "R", "before": "thelatter", "after": "the latter", "start_char_pos": 579, "end_char_pos": 588}, {"type": "R", "before": "clus-tering", "after": "clustering", "start_char_pos": 626, "end_char_pos": 637}, {"type": "R", "before": "biasedgraph", "after": "biased graph", "start_char_pos": 676, "end_char_pos": 687}, {"type": "R", "before": "catas-trophic", "after": "catastrophic", "start_char_pos": 726, "end_char_pos": 739}, {"type": "R", "before": "tacklethese", "after": "tackle these", "start_char_pos": 771, "end_char_pos": 782}, {"type": "R", "before": "thoseexisting", "after": "those existing", "start_char_pos": 824, "end_char_pos": 837}, {"type": "R", "before": "classifica-tion", "after": "classification", "start_char_pos": 867, "end_char_pos": 882}, {"type": "R", "before": "imbal-anced", "after": "imbalanced", "start_char_pos": 971, "end_char_pos": 982}, {"type": "R", "before": "representa-tions", "after": "representations", "start_char_pos": 1013, "end_char_pos": 1029}, {"type": "R", "before": "Sam-pling", "after": "Sampling", "start_char_pos": 1065, "end_char_pos": 1074}, {"type": "R", "before": "insightfulanalyses", "after": "insightful analyses", "start_char_pos": 1106, "end_char_pos": 1124}, {"type": "R", "before": "A series of imbalancedbenchmark", "after": "The code and a series of imbalanced benchmark", "start_char_pos": 1142, "end_char_pos": 1173}, {"type": "R", "before": "will be openly available .", "after": "are available on URL", "start_char_pos": 1228, "end_char_pos": 1254}], "sents_char_pos": [0, 153, 234, 485, 661, 767, 1141]} {"doc_id": "2107.03721", "revision_depth": "1", "before_revision": "In April 2021, the European Commission proposed a Regulation on Artificial Intelligence, known as the AI Act. We present an overview of the Act and analyse its implications, drawing on scholarship ranging from the study of contemporary AI practices to the structure of EU product safety regimes over the last four decades. Aspects of the AI Act, such as different rules for different risk-levels of AI, make sense. But we also find that some provisions of the draft AI Act have surprising legal implications, whilst others may be largely ineffective at achieving their stated goals. Several overarching aspects, including the enforcement regime and the effect of maximum harmonisation on the space for AI policymore generally , engender significant concern. These issues should be addressed as a priority in the legislative process.", "after_revision": "In April 2021, the European Commission proposed a Regulation on Artificial Intelligence, known as the AI Act. We present an overview of the Act and analyse its implications, drawing on scholarship ranging from the study of contemporary AI practices to the structure of EU product safety regimes over the last four decades. Aspects of the AI Act, such as different rules for different risk-levels of AI, make sense. But we also find that some provisions of the Draft AI Act have surprising legal implications, whilst others may be largely ineffective at achieving their stated goals. Several overarching aspects, including the enforcement regime and the risks of maximum harmonisation pre-empting legitimate national AI policy , engender significant concern. These issues should be addressed as a priority in the legislative process.", "edit_actions": [{"type": "R", "before": "draft", "after": "Draft", "start_char_pos": 460, "end_char_pos": 465}, {"type": "R", "before": "effect", "after": "risks", "start_char_pos": 653, "end_char_pos": 659}, {"type": "R", "before": "on the space for AI policymore generally", "after": "pre-empting legitimate national AI policy", "start_char_pos": 685, "end_char_pos": 725}], "sents_char_pos": [0, 109, 322, 414, 582, 757]} {"doc_id": "2107.03857", "revision_depth": "1", "before_revision": "We present a lattice gas model of financial markets to explain previous empirical observations of the interplay of trends and reversion . The shares of an asset are modeled by gas molecules that are distributed across a hidden social network of investors. Neighbors in the network tend to align their positions due to herding behavior. The model is equivalent to the Ising model on this network, with the magnetization in the role of the deviation of the asset price from its value. For N independent assets, it generalizes to an O(N) vector model. In efficient markets, the system is driven to its critical temperature . There, it is characterized by long-range correlations and universal critical exponents, in analogy with the second-order phase transition between water and steam. Using the renormalization group, we show that these critical exponents imply predictions for the auto-correlations of financial market returns. For a simple network topology, consistency with observation implies a fractal dimension of the network of 3.3 and a correlation time of 10 years. While the simple model agrees well with market data on long time scales, it cannot explain the observed market trends over time horizons from one month to one year. In a next step, the approach should therefore be extended to other models of critical dynamics and to general network topologies. It opens the door for indirectly measuring universal properties of the hidden social network of investors from the observable interplay of trends and reversion .", "after_revision": "Motivated by empirical observations on the interplay of trends and reversion , a lattice gas model of financial markets is presented . The shares of an asset are modeled by gas molecules that are distributed across a hidden social network of investors. The model is equivalent to the Ising model on this network, whose magnetization represents the deviation of the asset price from its value. It is argued that the system is driven to its critical temperature in efficient markets . There, it is characterized by universal critical exponents, in analogy with the second-order phase transition between water and steam. These critical exponents imply predictions for the auto-correlations of financial market returns. For a simple network topology, consistency with the observed long-term auto-correlations implies a fractal network dimension of 3.3 , and a correlation time of 10 years. To also explain the observed short-term auto-correlations, the model should be extended beyond the critical domain, to other network topologies, and to other models of critical dynamics .", "edit_actions": [{"type": "R", "before": "We present a lattice gas model of financial markets to explain previous empirical observations of", "after": "Motivated by empirical observations on", "start_char_pos": 0, "end_char_pos": 97}, {"type": "A", "before": null, "after": ", a lattice gas model of financial markets is presented", "start_char_pos": 136, "end_char_pos": 136}, {"type": "D", "before": "Neighbors in the network tend to align their positions due to herding behavior.", "after": null, "start_char_pos": 257, "end_char_pos": 336}, {"type": "R", "before": "with the magnetization in the role of the", "after": "whose magnetization represents the", "start_char_pos": 397, "end_char_pos": 438}, {"type": "R", "before": "For N independent assets, it generalizes to an O(N) vector model. In efficient markets,", "after": "It is argued that", "start_char_pos": 484, "end_char_pos": 571}, {"type": "A", "before": null, "after": "in efficient markets", "start_char_pos": 621, "end_char_pos": 621}, {"type": "D", "before": "long-range correlations and", "after": null, "start_char_pos": 654, "end_char_pos": 681}, {"type": "R", "before": "Using the renormalization group, we show that these", "after": "These", "start_char_pos": 787, "end_char_pos": 838}, {"type": "R", "before": "observation", "after": "the observed long-term auto-correlations", "start_char_pos": 979, "end_char_pos": 990}, {"type": "R", "before": "dimension of the network of", "after": "network dimension of", "start_char_pos": 1009, "end_char_pos": 1036}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1041, "end_char_pos": 1041}, {"type": "R", "before": "While the simple model agrees well with market data on long time scales, it cannot", "after": "To also", "start_char_pos": 1078, "end_char_pos": 1160}, {"type": "R", "before": "market trends over time horizons from one month to one year. In a next step, the approach should therefore be extended to other", "after": "short-term auto-correlations, the model should be extended beyond the critical domain, to other network topologies, and to other", "start_char_pos": 1182, "end_char_pos": 1309}, {"type": "D", "before": "and to general network topologies. It opens the door for indirectly measuring universal properties of the hidden social network of investors from the observable interplay of trends and reversion", "after": null, "start_char_pos": 1338, "end_char_pos": 1532}], "sents_char_pos": [0, 138, 256, 336, 483, 549, 623, 786, 930, 1077, 1242, 1372]} {"doc_id": "2107.05556", "revision_depth": "1", "before_revision": "Motivation: Computational models that accurately identify high-affinity protein-compound pairs can accelerate drug discovery pipelines. These models aim to learn binding mechanics through drug-target interaction datasets and use the learned knowledge while predicting the affinity of any protein-compound pair. However, the datasets they rely on bear misleading patterns that bias models towards memorizing dataset-specific biomolecule properties, instead of learning binding mechanics. Insufficiently focused on the binding mechanics, the resulting models struggle while predicting the drug-target affinities (DTA), especially between de novo biomolecules. Here we present DebiasedDTA, the first model debiasing approach that avoids dataset biases in order to boost the affinity prediction on novel biomolecules. DebiasedDTA uses ensemble learning and weight sample adaptation for bias identification and avoidance and is applicable to almost all existing DTA prediction models. Results: The results show that DebiasedDTA can boost models while predicting the interactions between novel biomolecules. Known biomolecules also benefit from the performance boost, though the boost is amplified as the test biomolecules become more dissimilar to the training set. The experiments also show that DebiasedDTA can augment the DTA prediction models of different input and model structures and can avoid biases of different sources. Availability : The source code, the models, and the data sets are available at URL Contact: arzucan.ozgur@boun.edu.tr, elif.ozkirimli@roche.com", "after_revision": "Motivation: Computational models that accurately identify high-affinity protein-compound pairs can accelerate drug discovery pipelines. These models aim to learn binding mechanics through drug-target interaction datasets and use the learned knowledge for predicting the affinity of an input protein-compound pair. However, the datasets they rely on bear misleading patterns that bias models towards memorizing dataset-specific biomolecule properties, instead of learning binding mechanics. This results in models that struggle while predicting drug-target affinities (DTA), especially between de novo biomolecules. Here we present DebiasedDTA, the first DTA model debiasing approach that avoids dataset biases in order to boost affinity prediction for novel biomolecules. DebiasedDTA uses ensemble learning and sample weight adaptation for bias identification and avoidance and is applicable to almost all existing DTA prediction models. Results: The results show that DebiasedDTA can boost models while predicting the interactions between novel biomolecules. Known biomolecules also benefit from the performance improvement, especially when the test biomolecules are dissimilar to the training set. The experiments also show that DebiasedDTA can augment DTA prediction models of different input and model structures and is able to avoid biases of different sources. Availability and Implementation : The source code, the models, and the datasets are freely available for download at URL implementation in Python3, and supported for Linux, MacOS and MS Windows. Contact: arzucan.ozgur@boun.edu.tr, elif.ozkirimli@roche.com", "edit_actions": [{"type": "R", "before": "while", "after": "for", "start_char_pos": 251, "end_char_pos": 256}, {"type": "R", "before": "any", "after": "an input", "start_char_pos": 284, "end_char_pos": 287}, {"type": "R", "before": "Insufficiently focused on the binding mechanics, the resulting models", "after": "This results in models that", "start_char_pos": 487, "end_char_pos": 556}, {"type": "D", "before": "the", "after": null, "start_char_pos": 583, "end_char_pos": 586}, {"type": "A", "before": null, "after": "DTA", "start_char_pos": 697, "end_char_pos": 697}, {"type": "R", "before": "the affinity prediction on", "after": "affinity prediction for", "start_char_pos": 768, "end_char_pos": 794}, {"type": "R", "before": "weight sample", "after": "sample weight", "start_char_pos": 854, "end_char_pos": 867}, {"type": "R", "before": "boost, though the boost is amplified as the test biomolecules become more", "after": "improvement, especially when the test biomolecules are", "start_char_pos": 1156, "end_char_pos": 1229}, {"type": "D", "before": "the", "after": null, "start_char_pos": 1317, "end_char_pos": 1320}, {"type": "R", "before": "can", "after": "is able to", "start_char_pos": 1387, "end_char_pos": 1390}, {"type": "A", "before": null, "after": "and Implementation", "start_char_pos": 1439, "end_char_pos": 1439}, {"type": "R", "before": "data sets are available at URL", "after": "datasets are freely available for download at URL implementation in Python3, and supported for Linux, MacOS and MS Windows.", "start_char_pos": 1479, "end_char_pos": 1509}], "sents_char_pos": [0, 135, 310, 486, 657, 814, 980, 1102, 1261, 1425]} {"doc_id": "100194", "revision_depth": "2", "before_revision": " The Anti-Poverty Committee (APC) has taken full responsibility for four people splattering latex paint on the front of British Columbia premier Gordon Campbell's office in Vancouver Thursday afternoon . They tried to break into the office and frightened staff. The paint represented three official colours of the Olympic flag; yellow, red and green. \"I think the activists should be prosecuted to the fullest extent of the law,\" said the premier . \"Frankly, this is about seeing their faces on television.\" Attorney General of British Columbia Wally Oppal spoke out against the group : \"It's disturbing when you have people like these, who are continually intimidating law-abiding citizens and I think the public is getting sick and tired of this group.\" The group vandalised and broke into Campbell's office in Vancouver last May when they posed as a flower delivery service and quickly ransacked his office breaking windows and throwing pictures, office documents, and various other items . They also threw yellow paint and put posters on the Olympic Clock in downtown Vancouver last April. They believe that poor citizens are losing their homes due to the money spent and developments near the city on preparation for the long-awaited 2010 Winter Olympics. Cunningham said the group will not stop the \"criminal acts\" until the government's budget surplus is spent on social housing and on the citizen's . \"Just after 2 p.m. a group of people attended the premier's office \u2026 and threw paint on the exterior of the building,\" said Const. Jana McGuinness of the Vancouver Police Department. \"This is a criminal charge. This is mischief, so if charges are warranted we'll definitely be laying charges.\"%DIFDELCMD < %DIFDELCMD < %%% No arrests were made as the four managed to leave before police arrived .", "after_revision": "A group of Olympic protesters tried to break into British Columbia premier Gordon Campbell's office in Vancouver Thursday afternoon and splattered paint on the entrance. The Anti-Poverty Committee (APC) has taken full responsibility for the four people who splattered the paint . They tried to break into the office and frightened staff. \"Just after 2 p.m. a group of people attended the premier's office \u2026 and threw paint on the exterior of the building,\" said Const. Jana McGuinness of the Vancouver Police Department. \"This is a criminal charge. This is mischief, so if charges are warranted we'll definitely be laying charges.\" No arrests were made as the four managed to leave before police arrived. The paint represented three official colours of the Olympic flag; yellow, red and green. \"I think the activists should be prosecuted to the fullest extent of the law,\" said Campbell . \"Frankly, this is about seeing their faces on television.\" Attorney General of British Columbia Wally Oppal spoke out against the group , \"It's disturbing when you have people like these, who are continually intimidating law-abiding citizens , and I think the public is getting sick and tired of this group.\" The group has previously broke into Campbell's office in Vancouver last May when they posed as a flower delivery service and ransacked his office breaking windows and throwing pictures, office documents, and other items about . They also threw yellow paint and put posters on the Olympic Clock in downtown Vancouver last April. They said the protest was for poor citizens who are losing their homes because of money spent on developments for the upcoming 2010 Winter Olympics. Cunningham said the group will not stop the \"criminal acts\" until the government's budget surplus is spent on social housing and on the citizen's %DIFDELCMD < %DIFDELCMD < %%% .", "edit_actions": [{"type": "A", "before": null, "after": "A group of Olympic protesters tried to break into British Columbia premier Gordon Campbell's office in Vancouver Thursday afternoon and splattered paint on the entrance.", "start_char_pos": 0, "end_char_pos": 0}, {"type": "R", "before": "four people splattering latex paint on the front of British Columbia premier Gordon Campbell's office in Vancouver Thursday afternoon", "after": "the four people who splattered the paint", "start_char_pos": 68, "end_char_pos": 201}, {"type": "A", "before": null, "after": "\"Just after 2 p.m. a group of people attended the premier's office \u2026 and threw paint on the exterior of the building,\" said Const. Jana McGuinness of the Vancouver Police Department. \"This is a criminal charge. This is mischief, so if charges are warranted we'll definitely be laying charges.\"", "start_char_pos": 262, "end_char_pos": 262}, {"type": "A", "before": null, "after": "No arrests were made as the four managed to leave before police arrived.", "start_char_pos": 263, "end_char_pos": 263}, {"type": "R", "before": "the premier", "after": "Campbell", "start_char_pos": 437, "end_char_pos": 448}, {"type": "R", "before": ":", "after": ",", "start_char_pos": 587, "end_char_pos": 588}, {"type": "A", "before": null, "after": ",", "start_char_pos": 693, "end_char_pos": 693}, {"type": "R", "before": "vandalised and", "after": "has previously", "start_char_pos": 769, "end_char_pos": 783}, {"type": "D", "before": "quickly", "after": null, "start_char_pos": 884, "end_char_pos": 891}, {"type": "R", "before": "various other items", "after": "other items about", "start_char_pos": 975, "end_char_pos": 994}, {"type": "R", "before": "believe that poor citizens", "after": "said the protest was for poor citizens who", "start_char_pos": 1102, "end_char_pos": 1128}, {"type": "R", "before": "due to the money spent and developments near the city on preparation for the long-awaited", "after": "because of money spent on developments for the upcoming", "start_char_pos": 1152, "end_char_pos": 1241}, {"type": "D", "before": ".", "after": null, "start_char_pos": 1410, "end_char_pos": 1411}, {"type": "D", "before": "\"Just after 2 p.m. a group of people attended the premier's office \u2026 and threw paint on the exterior of the building,\" said Const. Jana McGuinness of the Vancouver Police Department. \"This is a criminal charge. This is mischief, so if charges are warranted we'll definitely be laying charges.\"", "after": null, "start_char_pos": 1412, "end_char_pos": 1705}, {"type": "D", "before": "No arrests were made as the four managed to leave before police arrived", "after": null, "start_char_pos": 1735, "end_char_pos": 1806}], "sents_char_pos": [0, 203, 261, 329, 352, 509, 758, 996, 1096, 1263, 1480, 1542, 1594, 1622, 1705]} {"doc_id": "100868", "revision_depth": "1", "before_revision": "The H5N1 Avian Flu Virus has been found in a dead wild Canadian Goose in Abbotsbury Swannery in Dorset, England. This is the 11th case of the virus turning up in wild birds. The goose was found on February 25, 2008. 10 other cases of the virus have appeared in dead birds, all Mute Swans from the same area.", "after_revision": "The H5N1 Avian Flu virus has been found in a dead wild Canadian Goose in Abbotsbury Swannery in Dorset, England. This is the eleventh case of the virus turning up in wild birds. The goose was discovered on February 25, 2008. Ten other cases of the virus have appeared in dead birds, all Mute Swans from the same area.", "edit_actions": [{"type": "R", "before": "Virus", "after": "virus", "start_char_pos": 19, "end_char_pos": 24}, {"type": "R", "before": "11th", "after": "eleventh", "start_char_pos": 125, "end_char_pos": 129}, {"type": "R", "before": "found", "after": "discovered", "start_char_pos": 188, "end_char_pos": 193}, {"type": "R", "before": "10", "after": "Ten", "start_char_pos": 216, "end_char_pos": 218}], "sents_char_pos": [0, 112, 173, 215]} {"doc_id": "100912", "revision_depth": "1", "before_revision": "Gordon Brown , who made a speech to the UK Labour Party todayThe UK Prime Minister, Gordon Brown, has made a speech to UK Labour Party members as part of his party's spring conference. In the speech he made several commitments, which he said he would \"work tirelessly\" to achieve. On the subjects of employment and welfare, Mr. Brown said that his party \"will offer new entitlements to the carers that serve this country [the UK] so well. He continued by saying that since Labour came to power in 1997, three million new jobs have been created. He also said that Labour will attempt to get 100,00 people back to work. When discussing crime in the speech, Mr. Brown claimed that his party has \"already cut crime by 32\\%.\" He also made promises of community policing across the UK.", "after_revision": "Gordon Brown in 2004.United Kingdom Prime Minister, Gordon Brown, has made a speech to UK Labour Party members as part of the party's spring conference. In the speech he made several commitments, which he said he would \"work tirelessly\" to achieve. On the subjects of employment and welfare, Mr. Brown said that his party \"will offer new entitlements to the careers that serve this country [the UK] so well. He continued by saying that since Labour came to power in 1997, three million new jobs have been created. He also said that Labour will attempt to get 100,00 people back to work. While discussing crime in the speech, Mr. Brown claimed that his party has \"already cut crime by 32\\%.\" He also made promises of community policing across the UK.", "edit_actions": [{"type": "R", "before": ", who made a speech to the UK Labour Party todayThe UK", "after": "in 2004.United Kingdom", "start_char_pos": 13, "end_char_pos": 67}, {"type": "R", "before": "his", "after": "the", "start_char_pos": 154, "end_char_pos": 157}, {"type": "R", "before": "carers", "after": "careers", "start_char_pos": 390, "end_char_pos": 396}, {"type": "R", "before": "When", "after": "While", "start_char_pos": 618, "end_char_pos": 622}], "sents_char_pos": [0, 184, 280, 438, 544, 617, 720]} {"doc_id": "101799", "revision_depth": "1", "before_revision": "Jimmy Wales at a Wikimania event in 2007. Wikipedia founder Jimmy Wales has been accused of editing pages in the encyclopedia in return for a donation to the Wikimedia Foundation . In an article published Tuesday, the Sydney Morning Herald reported that former Novell computer scientist Jeff Merkey alleged Wales had made edits to his article on his behalf, in exchange for a donation to the Wikimedia Foundation. The news hit the website Slashdot later Tuesday, where the incident was dubbed \"DonorGate\". According to The Daily Telegraph , Merkey claims that he was told by Wales in 2006 that the Wikipedia article about him could be made more favorable in exchange for a donation. Merkey made a donation of USD$5,000 to the Wikimedia Foundation, and Wales made edits to the Wikipedia article about Merkey around the same time. Merkey published his claims on a public Wikimedia mailing list and sent a statement to The Associated Press. In a response Wales called Merkey's statements \"nonsense\", saying \"Of course I would never offer, nor accept any offer, whereby a donation would buy someone special editorial treatment in the encyclopedia. I do routinely assist people with WP:BLP issues, and I do courtesies for many people. Donations have no bearing on that at all.\" WP:BLP refers to Wikipedia's policy regarding biographies of living persons on the encyclopedia. After deleting the Wikipedia article about Merkey in 2006, Wales wrote to Wikipedia editors he had done so \"because of the unpleasantness of it\" and requested that they \"be extra careful here to be courteous and assume good faith\". After erasing the article, Wales placed the article under protection with editing access limited to established users. Merkey ceased his $ 5, 000.00 per year payments to the Wikimedia Foundation after reviewing what he called \"evidence of diversion and mismanagement of the charities funds by Wales and the Wikimedia Board of Trustees\". In a statement responding to a post about the incident on the site Techtree.com, Wikimedia Foundation's Head of Communications Jay Walsh addressed the Foundation's principles regarding conflict of interest : \"The Wikimedia Foundation (the Foundation which operates and maintains Wikipedia and other free knowledge projects) has never solicited or accepted donations for the purposes of making edits or offering protection to Wikipedia articles. Nor has Jimmy Wales ever solicited or accepted donations for the Foundation in this capacity. These allegations are completely false. ... Jimmy has been unfailingly ethical and frugal in the use of all Foundation funds. The Wikimedia Foundation, its staff and board members, and the users of Wikipedia itself hold the core principles of 'no conflict of interest' in the highest regard.\" After leaving Novell amidst allegations of misappropriation of trade secrets, Merkey was sued by his former employer. He filed a harassment lawsuit against organizations including the website Slashdot in 2005. Merkey filed a suit against Delta Air Lines and Natural Selection Foods in 2006, claiming his son had become sick from E. coli contaminated spinach. Merkey is banned from editing Wikipedia due to a ruling by Wikipedia's Arbitration Committee. The Wikipedia Signpost , Wikipedia's community-written and community-edited newspaper, reported that a Wikipedia user account used by Merkey was blocked in October 2005 for \"Personal attacks, legal threats, harassment, disruption\". Merkey was later allowed to come back to edit Wikipedia in May 2007 under a different account. As the result of a ruling by Wikipedia's Arbitration Committe in a July 2007 arbitration case, Merkey and two users who had harassed him on Wikipedia were banned from editing the encyclopedia for one year. Last week Jimmy Wales faced accusations by former Wikimedia Foundation executive Danny Wool that he misused the non-profit organization 's funds, and attempted to expense a visit to a Moscow massage parlor and high-priced bottles of wine. In an interview with CNET TV , Wikimedia Foundation Executive Director Sue Gardner described Wool as \"a disgruntled former employee\" and called his claims \"a whole bunch of unsubstantiated rumors and gossip\". Wales's former girlfriend, journalist Rachel Marsden , recently leaked purported instant message transcripts with Wales, which implied Wales had used his influence to change the article about Marsden on Wikipedia. Wales ended his relationship with Marsden and made a public statement to that effect on Wikipedia, and in response Marsden opened an auction for some of Wales's clothing on eBay . Related news ", "after_revision": "founder has been accused of editing pages in the encyclopedia in return for a donation to the . In an article published Tuesday, the reported that former computer scientist alleged Wales had made edits to his article on his behalf, in exchange for a donation to the Wikimedia Foundation. The news hit the website later Tuesday, where the incident was dubbed \"DonorGate\". According to , Merkey claims that he was told by Wales in 2006 that the Wikipedia article about him could be made more favorable in exchange for a donation. Merkey made a donation of 5, 000 to the Wikimedia Foundation, and Wales made edits to the Wikipedia article about Merkey around the same time. Merkey published his claims on a public Wikimedia mailing list and sent a statement to . In a response Wales called Merkey's statements \"nonsense\", saying \"Of course I would never offer, nor accept any offer, whereby a donation would buy someone special editorial treatment in the encyclopedia. I do routinely assist people with WP:BLP issues, and I do courtesies for many people. Donations have no bearing on that at all.\" refers to Wikipedia's policy regarding biographies of living persons on the encyclopedia. After deleting the Wikipedia article about Merkey in 2006, Wales wrote to Wikipedia editors he had done so \"because of the unpleasantness of it\" and requested that they \"be extra careful here to be courteous and assume good faith\". After erasing the article, Wales placed the article under protection with editing access limited to established users. Merkey ceased his $5, 000.00 per year payments to the Wikimedia Foundation after reviewing what he called \"evidence of diversion and mismanagement of the charities funds by Wales and the Wikimedia Board of Trustees\". In a statement responding to a post about the incident on the site Techtree.com, Wikimedia Foundation's Head of Communications addressed the Foundation's principles regarding : \"The Wikimedia Foundation (the Foundation which operates and maintains Wikipedia and other free knowledge projects) has never solicited or accepted donations for the purposes of making edits or offering protection to Wikipedia articles. Nor has Jimmy Wales ever solicited or accepted donations for the Foundation in this capacity. These allegations are completely false. ... Jimmy has been unfailingly ethical and frugal in the use of all Foundation funds. The Wikimedia Foundation, its staff and board members, and the users of Wikipedia itself hold the core principles of 'no conflict of interest' in the highest regard.\" After leaving Novell amidst allegations of misappropriation of trade secrets, Merkey was sued by his former employer. He filed a harassment lawsuit against organizations including the website Slashdot in 2005. Merkey filed a suit against and in 2006, claiming his son had become sick from E. coli contaminated spinach. Merkey is banned from editing Wikipedia due to a ruling by Wikipedia's Arbitration Committee. , Wikipedia's community-written and community-edited newspaper, reported that a Wikipedia user account used by Merkey was blocked in October 2005 for \"Personal attacks, legal threats, harassment, disruption\". Merkey was later allowed to come back to edit Wikipedia in May 2007 under a different account. As the result of a ruling by Wikipedia's Arbitration Committe in a July 2007 arbitration case, Merkey and two users who had harassed him on Wikipedia were banned from editing the encyclopedia for one year. Last week Jimmy Wales faced accusations by former Wikimedia Foundation executive Danny Wool that he misused the 's funds, and attempted to expense a visit to a Moscow massage parlor and high-priced bottles of wine. In an interview with , Wikimedia Foundation Executive Director described Wool as \"a disgruntled former employee\" and called his claims \"a whole bunch of unsubstantiated rumors and gossip\". Wales's former girlfriend, journalist , recently leaked purported instant message transcripts with Wales, which implied Wales had used his influence to change the article about Marsden on Wikipedia. Wales ended his relationship with Marsden and made a public statement to that effect on Wikipedia, and in response Marsden opened an auction for some of Wales's clothing on . Related news Sister links", "edit_actions": [{"type": "R", "before": "Jimmy Wales at a Wikimania event in 2007. Wikipedia founder Jimmy Wales", "after": "founder", "start_char_pos": 0, "end_char_pos": 71}, {"type": "D", "before": "Wikimedia Foundation", "after": null, "start_char_pos": 158, "end_char_pos": 178}, {"type": "D", "before": "Sydney Morning Herald", "after": null, "start_char_pos": 218, "end_char_pos": 239}, {"type": "R", "before": "Novell computer scientist Jeff Merkey", "after": "computer scientist", "start_char_pos": 261, "end_char_pos": 298}, {"type": "D", "before": "Slashdot", "after": null, "start_char_pos": 439, "end_char_pos": 447}, {"type": "D", "before": "The Daily Telegraph", "after": null, "start_char_pos": 519, "end_char_pos": 538}, {"type": "D", "before": "USD$5,000 to the Wikimedia Foundation, and Wales made edits to the Wikipedia article about Merkey around the same time. Merkey published his claims on a public Wikimedia mailing list and sent a statement to The Associated Press. In a response Wales called Merkey's statements \"nonsense\", saying \"Of course I would never offer, nor accept any offer, whereby a donation would buy someone special editorial treatment in the encyclopedia. I do routinely assist people with WP:BLP issues, and I do courtesies for many people. Donations have no bearing on that at all.\" WP:BLP refers to Wikipedia's policy regarding biographies of living persons on the encyclopedia. After deleting the Wikipedia article about Merkey in 2006, Wales wrote to Wikipedia editors he had done so \"because of the unpleasantness of it\" and requested that they \"be extra careful here to be courteous and assume good faith\". After erasing the article, Wales placed the article under protection with editing access limited to established users. Merkey ceased his $", "after": null, "start_char_pos": 709, "end_char_pos": 1740}, {"type": "A", "before": null, "after": "000 to the Wikimedia Foundation, and Wales made edits to the Wikipedia article about Merkey around the same time. Merkey published his claims on a public Wikimedia mailing list and sent a statement to .", "start_char_pos": 1744, "end_char_pos": 1744}, {"type": "A", "before": null, "after": "In a response Wales called Merkey's statements \"nonsense\", saying \"Of course I would never offer, nor accept any offer, whereby a donation would buy someone special editorial treatment in the encyclopedia. I do routinely assist people with WP:BLP issues, and I do courtesies for many people. Donations have no bearing on that at all.\" refers to Wikipedia's policy regarding biographies of living persons on the encyclopedia.", "start_char_pos": 1745, "end_char_pos": 1745}, {"type": "A", "before": null, "after": "After deleting the Wikipedia article about Merkey in 2006, Wales wrote to Wikipedia editors he had done so \"because of the unpleasantness of it\" and requested that they \"be extra careful here to be courteous and assume good faith\". After erasing the article, Wales placed the article under protection with editing access limited to established users. Merkey ceased his $5,", "start_char_pos": 1746, "end_char_pos": 1746}, {"type": "D", "before": "Jay Walsh", "after": null, "start_char_pos": 2069, "end_char_pos": 2078}, {"type": "D", "before": "conflict of interest", "after": null, "start_char_pos": 2127, "end_char_pos": 2147}, {"type": "R", "before": "Delta Air Lines and Natural Selection Foods", "after": "and", "start_char_pos": 3012, "end_char_pos": 3055}, {"type": "D", "before": "The Wikipedia Signpost", "after": null, "start_char_pos": 3227, "end_char_pos": 3249}, {"type": "D", "before": "non-profit organization", "after": null, "start_char_pos": 3872, "end_char_pos": 3895}, {"type": "D", "before": "CNET TV", "after": null, "start_char_pos": 4020, "end_char_pos": 4027}, {"type": "D", "before": "Sue Gardner", "after": null, "start_char_pos": 4070, "end_char_pos": 4081}, {"type": "D", "before": "Rachel Marsden", "after": null, "start_char_pos": 4246, "end_char_pos": 4260}, {"type": "D", "before": "eBay", "after": null, "start_char_pos": 4595, "end_char_pos": 4599}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 4615, "end_char_pos": 4615}], "sents_char_pos": [0, 41, 180, 413, 505, 682, 828, 937, 1143, 1229, 1272, 1369, 1601, 1720, 1941, 2386, 2480, 2606, 2773, 2891, 2983, 3132, 3226, 3458, 3553, 3759, 3998, 4207, 4421]} {"doc_id": "102156", "revision_depth": "2", "before_revision": "Jeff \" Legenday One \" Yang has completed the first stage of [ [ [ ] [ the race and is currently in first place and wearing a blessed jerseygiven to him by the Ruby Buddha ", "after_revision": " \" Race for Citizens \" , set up for basic bicycle sport promotion. Two cyclists from Merida Europe Team crossed the finish line firstly. Giant Asia Racing Team, the Team Champion in this series. A 72-golden-hour race of 2008 Tour de Taiwan in the Taipei-Keelung metropolitan area came to an end after entering the Taipei Xinyi Shopping Area as the final stage today. Before the main race, the organizer, Chinese Taipei Cycling Association held \"The 3rd Taipei Citizen Elimination Road Race\" to examine the achievements of basic cycling promotion. Even though its racing scale is one third of the Taipei Stage (60 laps, 1 km/lap), but several local cycling clubs and senior cyclists participated in this promotional race. Kuan-hua Lai, a cyclist from Giant Asia Racing Team, the current Taiwan leader of Tour de Taiwan, spoke to Wikinews Reporter Rico Shen before racing: \"Since we[the Team took the leading from Changhua County Stage until now, we were still be cautious of this current status because the competitors just lost behind within 15 seconds.\" And also, he commented about an \"earlier suspension\" incident in the same stage in 2007: \"I didn't participate in this series last year. However, with several cyclists' actual strengths in several criterium stages, I think that the same incident won't take place again this year.\" In the main race, due to a very close actual strength, not everyone can took the leading for a long-period especially in Asian cyclists' competition. As a result in the middle-end section, the main group extremity controlled the condition of this race. Finally, Marek Weso\u0142y from Merida Europe Team won his second stage champion in this stage since he got former stage champion in Pingtung County. With the stage champion went to Weso\u0142y, John Murphy firmly won the overall champion in this series after 8 stages' racing. By the way, Kuan-hua Lai not only won the Taiwan Champion and was voted as the \"Most Popular Taiwanese Cyclist\", but also helped his team (Giant Asia Racing Team) to win the Team Champion in this series. After the race, He commented about this race: \"Even though we got a great difference after we[the Team got the lead from Changhua[stage , but we got a damn difficult situation because the competitors just lost behind within a small difference. Because of this issue, we cautiously chose some roads to do several attacks to keep the leading to the end.\" And he also commented about the \"DAMN\" crash incident yesterday to Wikinews Reporter Rico Shen: \"It's unable to prevent the crash. But mostly, cyclists without concentrations to a race or a game] will bring on crash in a race. If a cyclist want to prevent a crash, a cyclist should focus on the race in any time and any where.\" In another brief after race interview, John Murphy talked to Wikinews Reporter Rico Shen about this stage especially on the competition of yellow jersey: \"Shawn Milne is a respectful competitor even though he was formerly in our[Health Net Pro Cycling team, but he majorly ever threatened me since he got the 5th Stage Champion. After this, my current teammates did several attempts covering me to the end, and finally, it took a good effort for me. I really appreciated and thanked for my teammates' help.\" Audio Highlights Key Results Tour de Taiwan Taipei City Stage 240px|Stage Champion and Individual Champions in this Stage. Stage Champion: Marek Weso\u0142y (Merida Europe) Individual Classification Asian Champion (Blue Jersey): Takashi Miyazawa (Team Meitan Hompo-GDR) Taiwan Champion (White Jersey): Kuan-hua Lai (Giant Asia Racing Team) Sprint Champion (Green Jersey): John Murphy (Health Net Pro Cycling Team) Overall Champion (Yellow Jersey): John Murphy Team Classification Giant Asia Racing Team Team Skil-Shimano Health Net Pro Cycling Team", "edit_actions": [{"type": "D", "before": "Jeff", "after": null, "start_char_pos": 0, "end_char_pos": 4}, {"type": "R", "before": "Legenday One", "after": "Race for Citizens", "start_char_pos": 7, "end_char_pos": 19}, {"type": "R", "before": "Yang has completed the first stage of", "after": ", set up for basic bicycle sport promotion. Two cyclists from Merida Europe Team crossed the finish line firstly. Giant Asia Racing Team, the Team Champion in this series. A 72-golden-hour race of 2008 Tour de Taiwan in the Taipei-Keelung metropolitan area came to an end after entering the Taipei Xinyi Shopping Area as the final stage today. Before the main race, the organizer, Chinese Taipei Cycling Association held \"The 3rd Taipei Citizen Elimination Road Race\" to examine the achievements of basic cycling promotion. Even though its racing scale is one third of the Taipei Stage (60 laps, 1 km/lap), but several local cycling clubs and senior cyclists participated in this promotional race.", "start_char_pos": 22, "end_char_pos": 59}, {"type": "A", "before": null, "after": "Kuan-hua Lai, a cyclist from Giant Asia Racing Team, the current Taiwan leader of Tour de Taiwan, spoke to Wikinews Reporter Rico Shen before racing: \"Since we", "start_char_pos": 60, "end_char_pos": 60}, {"type": "A", "before": null, "after": "the Team", "start_char_pos": 61, "end_char_pos": 61}, {"type": "A", "before": null, "after": "took the leading from Changhua County Stage until now, we were still be cautious of this current status because the competitors just lost behind within 15 seconds.\" And also, he commented about an \"earlier suspension\" incident in the same stage in 2007: \"I didn't participate in this series last year. However, with several cyclists' actual strengths in several criterium stages, I think that the same incident won't take place again this year.\"", "start_char_pos": 62, "end_char_pos": 62}, {"type": "A", "before": null, "after": "In the main race, due to a very close actual strength, not everyone can took the leading for a long-period especially in Asian cyclists' competition. As a result in the middle-end section, the main group extremity controlled the condition of this race. Finally, Marek Weso\u0142y from Merida Europe Team won his second stage champion in this stage since he got former stage champion in Pingtung County. With the stage champion went to Weso\u0142y, John Murphy firmly won the overall champion in this series after 8 stages' racing.", "start_char_pos": 63, "end_char_pos": 63}, {"type": "A", "before": null, "after": "By the way, Kuan-hua Lai not only won the Taiwan Champion and was voted as the \"Most Popular Taiwanese Cyclist\", but also helped his team (Giant Asia Racing Team) to win the Team Champion in this series. After the race, He commented about this race: \"Even though we got a great difference after we", "start_char_pos": 64, "end_char_pos": 64}, {"type": "A", "before": null, "after": "the Team", "start_char_pos": 65, "end_char_pos": 65}, {"type": "A", "before": null, "after": "got the lead from Changhua", "start_char_pos": 66, "end_char_pos": 66}, {"type": "A", "before": null, "after": "stage", "start_char_pos": 67, "end_char_pos": 67}, {"type": "A", "before": null, "after": ", but we got a damn difficult situation because the competitors just lost behind within a small difference. Because of this issue, we cautiously chose some roads to do several attacks to keep the leading to the end.\"", "start_char_pos": 68, "end_char_pos": 68}, {"type": "A", "before": null, "after": "And he also commented about the \"DAMN\" crash incident yesterday to Wikinews Reporter Rico Shen: \"It's unable to prevent the crash. But mostly, cyclists without concentrations to a race", "start_char_pos": 69, "end_char_pos": 69}, {"type": "A", "before": null, "after": "or a game", "start_char_pos": 70, "end_char_pos": 70}, {"type": "A", "before": null, "after": "will bring on crash in a race. If a cyclist want to prevent a crash, a cyclist should focus on the race in any time and any where.\"", "start_char_pos": 72, "end_char_pos": 72}, {"type": "A", "before": null, "after": "In another brief after race interview, John Murphy talked to Wikinews Reporter Rico Shen about this stage especially on the competition of yellow jersey: \"Shawn Milne is a respectful competitor even though he was formerly in our", "start_char_pos": 73, "end_char_pos": 73}, {"type": "A", "before": null, "after": "Health Net Pro Cycling", "start_char_pos": 74, "end_char_pos": 74}, {"type": "A", "before": null, "after": "team, but he majorly ever threatened me since he got the 5th Stage Champion. After this, my current teammates did several attempts covering me to", "start_char_pos": 75, "end_char_pos": 75}, {"type": "R", "before": "race and is currently in first place and wearing a blessed jerseygiven to him by the Ruby Buddha", "after": "end, and finally, it took a good effort for me. I really appreciated and thanked for my teammates' help.\" Audio Highlights", "start_char_pos": 80, "end_char_pos": 176}, {"type": "A", "before": null, "after": "Key Results Tour de Taiwan Taipei City Stage 240px|Stage Champion and Individual Champions in this Stage. Stage Champion: Marek Weso\u0142y (Merida Europe) Individual Classification Asian Champion (Blue Jersey): Takashi Miyazawa (Team Meitan Hompo-GDR) Taiwan Champion (White Jersey): Kuan-hua Lai (Giant Asia Racing Team) Sprint Champion (Green Jersey): John Murphy (Health Net Pro Cycling Team) Overall Champion (Yellow Jersey): John Murphy", "start_char_pos": 177, "end_char_pos": 177}, {"type": "A", "before": null, "after": "Team Classification Giant Asia Racing Team Team Skil-Shimano Health Net Pro Cycling Team", "start_char_pos": 178, "end_char_pos": 178}], "sents_char_pos": [0]} {"doc_id": "103071", "revision_depth": "1", "before_revision": "As a non-partisan news source, Wikinews has impartially reached out to these candidates, who are looking to become the 43rd person elected to serve their nation from 1600 Pennsylvania Avenue NW. Wikinews' own Patrick Mannion corresponded with the Socialist Party USA nominee and candidate, Brian Moore via e-mail. Have you ever run for political office before? Moore: Yes, I ran for city council and mayor in Washington in the 1980's and 1990's; and I ran for the U.S. Congress and the U.S. Senate in Florida in 2002, 2004 and 2006 respectively. Have you ever been a member of a political party, other than the one you're currently in? Moore: Yes, I was a member of the Democratic Party , the Citizens Party, the Reform Party and the Socialist Party . I also was an Independent for a long period of time. What skills or ideas do or previous positions, you bring from this position that will benefit the Oval Office? Moore: Not sure your question is clear. I have worked in the private and public sector, for-profit and non-profit sectors, domestically and internationally, as an administrator, project director, fundraiser and in sales. I have worked with the poor and solicited funds from corporations and governments as well. I speak Spanish and some Portuguese , and have traveled and lived in South America for almost eight years. I have been involved civically and politically and professionally for forty years, I play sports and attend cultural events, and feel I am well-rounded. I speak out forthrightly on the issues, take strong and clear stands, take the initiative a lot and leader and/or start causes and projects in a leadership capacity. Freedom and Privacy Rights: Abolish the Patriot Act, the Military Tribunal bill , all executive orders that water down people's rights, and abolish all intelligence agencies overseas and the Homeland Security Agency at home. Can any third party or independent candidate ever win? Moore: Yes, per the rationale mentioned in answer #11; or from an attractive third party candidate and an even split from the other two major party candidates. Remember, Bill Clinton won the 1992 presidency with 39\\% of the vote, George Bush with 37\\%, Ross Perot with 20\\% (he was up to 40\\% in the early part of the campaign and won up to 28\\% in some states). Plus, the country is getting tired of holding its nose and voting for the lesser of two evils, plus the number of Independent and minor party candidates is growing and about to surpass one or both of the two major parties in percentage registered. Why do you believe socialism or even democratic socialism has never really \"taken off\" in America? Moore: Socialism had taken off in America. It is just that the \"Red Scare\" and the Espionage Act and the Sedition Act between 1917 and 1924 by the U.S. government, Stalinism and McCarthyism from 1945 to 1955; and the Cold War in the second half of the 20th century all undermined a wonderful and rich heritage of our country that thrived from 1900 thru 1925 and beyond. There were 1200 officeholders in America who were registered and public candidates as Socialists in America around 1920. Close to one million Americans voted for Eugene Debs in 1912 and 1920, gaining 9\\% and 11\\% of the popular vote. Remember, Teddy Roosevelt ran in 1912 as a third party candidate and garnered the second highest vote totals (20\\%) and still Gene Debs also gained around 11\\%. Can you imagine if Teddy Roosevelt had not been a candidate in that election! Secondly, the Socialists were against World World I , plus there was a split in the party with over half going to Communism, thus both suffering the consequences of Woodrow Wilson's Sedition Act and Red Scare tactics accusing them of being traitors. Membership in the Socialist Party of America grew from 13,000 to 118,000 by 1912, and circulation of its journal, Appeal to Reason , reached a circulation of over 760,000. Keep in mind supporters of Socialism then and into the 1930's and 1940's, in addition to Eugene V. Debs were Upton Sinclair, Helen Keller, Einstein, Sinclair Lewis, A. Philip Randolph, Walter Reuther, Margaret Sanger, Jack London, William DuBois, Kate Richards O'Hare, Frank Zeidler, Rose Pastor Stokes, Victor Berger, Bayard Rustin and Michael Harrington . The growth of the left worried President Woodrow Wilson and his administration so much that America entered what became known as the \"Red Scare\" period. In 1919, U.S. Attorney General Alexander Mitchell Palmer , at the order of President Wilson, arrested over 10,000 suspected communists and anarchists. These people were charged with \"advocating force, violence and unlawful means to overthrow the Government.\" J. Edgar Hoover was part of the effort at that time. Large number of these \"suspects\" were held without trial for a long time, and some were expelled to Russia. The Socialist party took a terrible hit and its membership suffered a severe drop due to the governmental intimidation and false claims against it. If you can't make it into the Oval Office, who would you prefer seeing taking the presidency? Moore: No one else, other than Ralph Nader . All, including Ralph Nader, are part of the capitalistic system, and accept its premises that competition, profit, ambition, taking the initiative, winning, exploitation, and survival of the fittest philosophy win over the socialist's features of cooperation, democracy, communal responsibility, fairness, equity, egalitarianism, mutual respect, helping one another, etc. Even Ralph Nader would have a terrible time under capitalism, but I think down deep he really is a socialist at heart, but does not have the gumption or is too practical to believe that it can emerge or survive.", "after_revision": "As a non-partisan news source, Wikinews has impartially reached out to these candidates, who are looking to become the 43rd person elected to serve their nation from 1600 Pennsylvania Avenue NW. Wikinews' own Patrick Mannion corresponded with the Socialist Party USA nominee and candidate, via e-mail. Have you ever run for political office before? Moore: Yes, I ran for city council and mayor in in the 1980's and 1990's; and I ran for the | U.S. Congress and the in Florida in 2002, 2004 and 2006 respectively. Have you ever been a member of a political party, other than the one you're currently in? Moore: Yes, I was a member of the , the Citizens Party, the and the . I also was an for a long period of time. What skills or ideas do or previous positions, you bring from this position that will benefit the Oval Office? Moore: Not sure your question is clear. I have worked in the private and public sector, for-profit and non-profit sectors, domestically and internationally, as an administrator, project director, fundraiser and in sales. I have worked with the poor and solicited funds from corporations and governments as well. I speak and some , and have traveled and lived in South America for almost eight years. I have been involved civically and politically and professionally for forty years, I play sports and attend cultural events, and feel I am well-rounded. I speak out forthrightly on the issues, take strong and clear stands, take the initiative a lot and leader and/or start causes and projects in a leadership capacity. Freedom and Privacy Rights: Abolish the , the , all executive orders that water down people's rights, and abolish all intelligence agencies overseas and the Homeland Security Agency at home. Can any third party or independent candidate ever win? Moore: Yes, per the rationale mentioned in answer #11; or from an attractive third party candidate and an even split from the other two major party candidates. Remember, won the 1992 presidency with 39\\% of the vote, with 37\\%, with 20\\% (he was up to 40\\% in the early part of the campaign and won up to 28\\% in some states). Plus, the country is getting tired of holding its nose and voting for the lesser of two evils, plus the number of Independent and minor party candidates is growing and about to surpass one or both of the two major parties in percentage registered. Why do you believe socialism or even democratic socialism has never really \"taken off\" in America? Moore: Socialism had taken off in America. It is just that the and the and the between 1917 and 1924 by the U.S. government, and from 1945 to 1955; and the Cold War in the second half of the 20th century all undermined a wonderful and rich heritage of our country that thrived from 1900 thru 1925 and beyond. There were 1200 officeholders in America who were registered and public candidates as Socialists in America around 1920. Close to one million Americans voted for in 1912 and 1920, gaining 9\\% and 11\\% of the popular vote. Remember, ran in 1912 as a third party candidate and garnered the second highest vote totals (20\\%) and still Gene Debs also gained around 11\\%. Can you imagine if Teddy Roosevelt had not been a candidate in that election! Secondly, the Socialists were against , plus there was a split in the party with over half going to Communism, thus both suffering the consequences of Woodrow Wilson's Sedition Act and Red Scare tactics accusing them of being traitors. Membership in the grew from 13,000 to 118,000 by 1912, and circulation of its journal, , reached a circulation of over 760,000. Keep in mind supporters of Socialism then and into the 1930's and 1940's, in addition to Eugene V. Debs were , , , , , , , , , , , , , and . The growth of the left worried President and his administration so much that America entered what became known as the \"Red Scare\" period. In 1919, U.S. Attorney General , at the order of President Wilson, arrested over 10,000 suspected communists and anarchists. These people were charged with \"advocating force, violence and unlawful means to overthrow the Government.\" was part of the effort at that time. Large number of these \"suspects\" were held without trial for a long time, and some were expelled to Russia. The Socialist party took a terrible hit and its membership suffered a severe drop due to the governmental intimidation and false claims against it. If you can't make it into the Oval Office, who would you prefer seeing taking the presidency? Moore: No one else, other than . All, including Ralph Nader, are part of the capitalistic system, and accept its premises that competition, profit, ambition, taking the initiative, winning, exploitation, and survival of the fittest philosophy win over the socialist's features of cooperation, democracy, communal responsibility, fairness, equity, egalitarianism, mutual respect, helping one another, etc. Even Ralph Nader would have a terrible time under capitalism, but I think down deep he really is a socialist at heart, but does not have the gumption or is too practical to believe that it can emerge or survive.", "edit_actions": [{"type": "D", "before": "Brian Moore", "after": null, "start_char_pos": 290, "end_char_pos": 301}, {"type": "D", "before": "Washington", "after": null, "start_char_pos": 409, "end_char_pos": 419}, {"type": "A", "before": null, "after": "|", "start_char_pos": 464, "end_char_pos": 464}, {"type": "R", "before": "and the U.S. Senate", "after": "and the", "start_char_pos": 479, "end_char_pos": 498}, {"type": "D", "before": "Democratic Party", "after": null, "start_char_pos": 671, "end_char_pos": 687}, {"type": "R", "before": "Reform Party and the Socialist Party", "after": "and the", "start_char_pos": 714, "end_char_pos": 750}, {"type": "D", "before": "Independent", "after": null, "start_char_pos": 767, "end_char_pos": 778}, {"type": "R", "before": "Spanish and some Portuguese", "after": "and some", "start_char_pos": 1237, "end_char_pos": 1264}, {"type": "D", "before": "Patriot Act, the Military Tribunal bill", "after": null, "start_char_pos": 1695, "end_char_pos": 1734}, {"type": "A", "before": null, "after": "the ,", "start_char_pos": 1737, "end_char_pos": 1737}, {"type": "D", "before": "Bill Clinton", "after": null, "start_char_pos": 2106, "end_char_pos": 2118}, {"type": "D", "before": "George Bush", "after": null, "start_char_pos": 2166, "end_char_pos": 2177}, {"type": "D", "before": "Ross Perot", "after": null, "start_char_pos": 2189, "end_char_pos": 2199}, {"type": "R", "before": "\"Red Scare\" and the Espionage Act and the Sedition Act", "after": "and the and the", "start_char_pos": 2709, "end_char_pos": 2763}, {"type": "R", "before": "Stalinism and McCarthyism", "after": "and", "start_char_pos": 2810, "end_char_pos": 2835}, {"type": "D", "before": "Eugene Debs", "after": null, "start_char_pos": 3178, "end_char_pos": 3189}, {"type": "D", "before": "Teddy Roosevelt", "after": null, "start_char_pos": 3260, "end_char_pos": 3275}, {"type": "D", "before": "World World I", "after": null, "start_char_pos": 3527, "end_char_pos": 3540}, {"type": "D", "before": "Socialist Party of America", "after": null, "start_char_pos": 3757, "end_char_pos": 3783}, {"type": "D", "before": "Appeal to Reason", "after": null, "start_char_pos": 3853, "end_char_pos": 3869}, {"type": "R", "before": "Upton Sinclair, Helen Keller, Einstein, Sinclair Lewis, A. Philip Randolph, Walter Reuther, Margaret Sanger, Jack London, William DuBois, Kate Richards O'Hare, Frank Zeidler, Rose Pastor Stokes, Victor Berger, Bayard Rustin and Michael Harrington", "after": ", , , , , , , , , , , , , and", "start_char_pos": 4020, "end_char_pos": 4266}, {"type": "D", "before": "Woodrow Wilson", "after": null, "start_char_pos": 4310, "end_char_pos": 4324}, {"type": "D", "before": "Alexander Mitchell Palmer", "after": null, "start_char_pos": 4453, "end_char_pos": 4478}, {"type": "D", "before": "J. Edgar Hoover", "after": null, "start_char_pos": 4681, "end_char_pos": 4696}, {"type": "D", "before": "Ralph Nader", "after": null, "start_char_pos": 5115, "end_char_pos": 5126}], "sents_char_pos": [0, 313, 360, 445, 546, 636, 752, 805, 916, 956, 1137, 1228, 1335, 1488, 1654, 1880, 1935, 1990, 2095, 2298, 2546, 2645, 2688, 2854, 3015, 3136, 3249, 3410, 3488, 3738, 3910, 4268, 4421, 4572, 4733, 4841, 4989, 5083, 5500]} {"doc_id": "103516", "revision_depth": "1", "before_revision": "In his speech at NATO's 2008 Bucharest summit on Thursday, the President of Moldova Vladimir Voronin asked for international support in solving the Transnistrian conflict and in overcoming polemics with regard to Moldova's national identity and present borders. Transnistria is a region, roughly between the Dniester river and Ukraine. It declared its independence in 1992, but is not recognised as such by any state or international organisation and lies entirely within the internationally recognised borders of Moldova. The region has organised itself as a republic under the name Pridnestrovian Moldavian Republic. It has been de facto independent since a ceasefire in July 1992 and Moldova exercises no control over the region. The Joint Control Commission has maintained a buffer zone ever since the War of Transnistria . Voronin said the Transnistrian problem fuels a potential of insecurity and instability not only for Moldova's territory, but also for the whole region, and is still unsettled. He called attention to the regional-scale effects of this conflict, saying that it blocks Moldova's modernization, as well as the interference of Transnistria-related problems with up-to-date international security issues, such as the Conventional Armed Forces in Europe Treaty (CFE Treaty), NATO's extension, anti-missile defense systems in Europe and Kosovo are obvious, Vladimir Voronin specified. Map of Moldova, highlighting the break-away region, Transnistria. Vladimir Voronin reaffirmed Moldova's official position at this important event, which debates security issues: \"We want to identify a viable solution to the Transnistrian problem, which should be focused on the demilitarization and the prohibition of foreign troops and military facilities on our national territory, in line with the recognized status of Moldova's neutrality, as well as giving a fair status to the Transnistrian region within a sovereign, indivisible and territorially united Moldova.\" The president reiterated that 17 years after the proclamation of Moldovan independence , it seeks the support of the international community in order to avoid destructive polemics on our national identity and present borders. Doing so will help Moldova focus on their pro-European aspirations. He also called for greater involvement by all sides for the recognition of Moldova's neutrality and promotion of the country's reintegration on the basis of the international law . During the NATO summit, Vladimir Voronin held discussions with President of Latvia Valdis Zatlers and Lithuanian President Valdas Adamkus . The officials focused on Moldova's cooperative ties with Latvia and Lithuania and the prospects of extending and deepening the country's collaboration with the two Baltic states . The Moldovan president thanked both the Latvian authorities and the Lithuanian leadership for the firm support given Moldova to make the country's European integration choice come true. The head of state stressed the Moldovan side's increased interest in continuing cooperation in the field of promoting the European standards by taking over the advanced European integration experience of the two states. President Vladimir Voronin returned to Chisinau Thursday evening.", "after_revision": "In his speech at NATO's on Thursday, the asked for international support in solving the Transnistrian conflict and in overcoming with regard to Moldova's national identity and present borders. Transnistria is a region, roughly between the river and Ukraine. It declared its independence in 1992, but is not as such by any state or international organisation and lies entirely within the internationally recognised borders of Moldova. The region has organised itself as a republic under the name Pridnestrovian Moldavian Republic. It has been de facto independent since a ceasefire in July 1992 and Moldova exercises no control over the region. The has maintained a ever since the . Voronin said the Transnistrian problem fuels a potential of insecurity and instability not only for Moldova's territory, but also for the whole region, and is still unsettled. He called attention to the regional-scale effects of this conflict, saying that it blocks Moldova's modernization, as well as the interference of Transnistria-related problems with up-to-date international security issues, such as the (CFE Treaty), NATO's extension, anti-missile defense systems in Europe and Kosovo are obvious, Vladimir Voronin specified. Map of Moldova, highlighting the break-away region, Transnistria. Vladimir Voronin reaffirmed Moldova's official position at this important event, which debates security issues: \"We want to identify a viable solution to the Transnistrian problem, which should be focused on the demilitarization and the prohibition of foreign troops and military facilities on our national territory, in line with the recognized status of Moldova's neutrality, as well as giving a fair status to the Transnistrian region within a sovereign, indivisible and territorially united Moldova.\" The president reiterated that 17 years after the proclamation of , it seeks the support of the international community in order to avoid destructive polemics on our national identity and present borders. Doing so will help Moldova focus on their pro-European aspirations. He also called for greater involvement by all sides for the recognition of Moldova's and promotion of the country's reintegration on the basis of the . During the NATO summit, Vladimir Voronin held discussions with and Lithuanian President . The officials focused on Moldova's cooperative ties with Latvia and Lithuania and the prospects of extending and deepening the country's collaboration with the two . The Moldovan president thanked both the Latvian authorities and the Lithuanian leadership for the firm support given Moldova to make the country's choice come true. The head of state stressed the Moldovan side's increased interest in continuing cooperation in the field of promoting the European standards by taking over the advanced European integration experience of the two states. President Vladimir Voronin returned to Thursday evening.", "edit_actions": [{"type": "D", "before": "2008 Bucharest summit", "after": null, "start_char_pos": 24, "end_char_pos": 45}, {"type": "D", "before": "President of Moldova Vladimir Voronin", "after": null, "start_char_pos": 63, "end_char_pos": 100}, {"type": "D", "before": "polemics", "after": null, "start_char_pos": 189, "end_char_pos": 197}, {"type": "D", "before": "Dniester", "after": null, "start_char_pos": 308, "end_char_pos": 316}, {"type": "D", "before": "recognised", "after": null, "start_char_pos": 385, "end_char_pos": 395}, {"type": "D", "before": "Joint Control Commission", "after": null, "start_char_pos": 737, "end_char_pos": 761}, {"type": "D", "before": "buffer zone", "after": null, "start_char_pos": 779, "end_char_pos": 790}, {"type": "D", "before": "War of Transnistria", "after": null, "start_char_pos": 806, "end_char_pos": 825}, {"type": "D", "before": "Conventional Armed Forces in Europe Treaty", "after": null, "start_char_pos": 1239, "end_char_pos": 1281}, {"type": "D", "before": "Moldovan independence", "after": null, "start_char_pos": 2041, "end_char_pos": 2062}, {"type": "D", "before": "neutrality", "after": null, "start_char_pos": 2355, "end_char_pos": 2365}, {"type": "D", "before": "international law", "after": null, "start_char_pos": 2431, "end_char_pos": 2448}, {"type": "D", "before": "President of Latvia Valdis Zatlers", "after": null, "start_char_pos": 2514, "end_char_pos": 2548}, {"type": "D", "before": "Valdas Adamkus", "after": null, "start_char_pos": 2574, "end_char_pos": 2588}, {"type": "D", "before": "Baltic states", "after": null, "start_char_pos": 2755, "end_char_pos": 2768}, {"type": "D", "before": "European integration", "after": null, "start_char_pos": 2918, "end_char_pos": 2938}, {"type": "D", "before": "Chisinau", "after": null, "start_char_pos": 3216, "end_char_pos": 3224}], "sents_char_pos": [0, 261, 335, 522, 618, 732, 827, 1003, 1404, 1470, 1582, 1975, 2201, 2269, 2590, 2770, 2956, 3176]} {"doc_id": "104781", "revision_depth": "1", "before_revision": "An earlier Soyuz-FG launch At 22:16 GMT yesterday (04:16 today local time), a Russian Soyuz-FG / Fregat carrier rocket was launched from Site 31/6 the Baikonur Cosmodrome in Kazakhstan, carrying the European GIOVE-B experimental Navigation satellite . The launch was conducted by Starsem , a Russo-European organisation which commercially markets Soyuz-FG and Soyuz-2 launches. GIOVE-B was successfully deployed into a medium Earth orbit at 02:01 GMT this morning, after an ascent lasting nearly four hours. GIOVE-B will serve as a prototype for the Galileo positioning system . It is the second such prototype, GIOVE-A is already in orbit, having been launched in December 2005. GIOVE-B was originally scheduled to launch in April 2006, but was delayed for a number of reasons. The next Galileo launch is scheduled to be the first cluster of operational satellites, which will be launched in 2010. The next Soyuz launch will be a Soyuz-U in mid-may, with a Progress spacecraft to resupply the International Space Station . This was the 20th orbital launch of 2008 , the 24th Soyuz-FG launch, and the 1,732nd flight of a Soyuz rocket of any variant.", "after_revision": " At 22:16 GMT yesterday (04:16 today local time), a Russian / carrier rocket was launched from the in Kazakhstan, carrying the European experimental . The launch was conducted by , a Russo-European organisation which commercially markets Soyuz-FG and launches. GIOVE-B was successfully deployed into a at 02:01 GMT this morning, after an ascent lasting nearly four hours. GIOVE-B will serve as a prototype for the . It is the second such prototype, GIOVE-A is already in orbit, having been launched in December 2005. GIOVE-B was originally scheduled to launch in April 2006, but was delayed for a number of reasons. The next Galileo launch is scheduled to be the first cluster of operational satellites, which will be launched in 2010. The next Soyuz launch will be a in mid-may, with a to resupply the . This was the 20th orbital launch of , the 24th Soyuz-FG launch, and the 1,732nd flight of a Soyuz rocket of any variant.", "edit_actions": [{"type": "D", "before": "An earlier Soyuz-FG launch", "after": null, "start_char_pos": 0, "end_char_pos": 26}, {"type": "D", "before": "Soyuz-FG", "after": null, "start_char_pos": 86, "end_char_pos": 94}, {"type": "D", "before": "Fregat", "after": null, "start_char_pos": 97, "end_char_pos": 103}, {"type": "R", "before": "Site 31/6 the Baikonur Cosmodrome", "after": "the", "start_char_pos": 137, "end_char_pos": 170}, {"type": "R", "before": "GIOVE-B experimental Navigation satellite", "after": "experimental", "start_char_pos": 208, "end_char_pos": 249}, {"type": "D", "before": "Starsem", "after": null, "start_char_pos": 280, "end_char_pos": 287}, {"type": "D", "before": "Soyuz-2", "after": null, "start_char_pos": 360, "end_char_pos": 367}, {"type": "D", "before": "medium Earth orbit", "after": null, "start_char_pos": 419, "end_char_pos": 437}, {"type": "D", "before": "Galileo positioning system", "after": null, "start_char_pos": 550, "end_char_pos": 576}, {"type": "D", "before": "Soyuz-U", "after": null, "start_char_pos": 931, "end_char_pos": 938}, {"type": "D", "before": "Progress spacecraft", "after": null, "start_char_pos": 958, "end_char_pos": 977}, {"type": "D", "before": "International Space Station", "after": null, "start_char_pos": 994, "end_char_pos": 1021}, {"type": "D", "before": "2008", "after": null, "start_char_pos": 1060, "end_char_pos": 1064}], "sents_char_pos": [0, 251, 377, 507, 578, 679, 778, 898, 1023]} {"doc_id": "104827", "revision_depth": "1", "before_revision": "240px|Professional wrestling is originated from basic wrestlingwith other elements involved in . Pro-wrestling, a derivative sport similar with basic wrestling, is often connected with \"professional\". Its topics mostly linked with Japanese and American (e.g. World Wrestling Entertainment, New Japan Pro Wrestling, etc.) are often discussed on the Internet. Progressively, TV programs related to pro-wrestling became a focus by spectators and mass media world-wide not only in Japan, America, and Europe. In Taiwan, not only basic consumers watched TV shows and discussed via the Internet, but some of them participated its sport (wrestling ) through communities from the Internet or colleges. Although a Taiwanese wrestler won a world-class pro-wrestling title back to Taiwan, but due to some policies to promote on some key athlete sports like baseball, billiard , basketball, and taekwondo with more possibilities to win a gold medal in Asian Games or Olympics , the governmental officials lost a great opportunity to promote basic or public sports like wrestling, with potential participantsbut officials not to pay more attentions in it . What's the vision of wrestling in Taiwan? How did the communities drive basic consumers ( TV spectators and wrestling fans ) and (government ) officials pay more attentions in wrestling? Will \"wrestling \" become a future star in Taiwan? As of them, Wikinews Journalist Rico Shen visited \"2008 IWL Spring Festival\" by an unofficial community and interviewed \"Mr. Orange\", commentator of WWE TV shows by VideoLand Max TV in Taiwan, to prospect the future of wrestling. Interview Audio interview highlights in Chinese-language. Hello, everyone! In my side is \"Mr. Orange\", WWE TV show commentator of VideoLand Max TV in Taiwan, I will do a special interview for topics related to wrestling, and he will do an overview of wrestling in Taiwan with his experiences. 180px|\"Mr. Orange\", a famous WWE TV show commentator of VideoLand Max TV in Taiwan. Glad to see an unofficial wrestling match in the Taipei City Mall. How did you involve in wrestling initially?", "after_revision": "240px|Professional wrestling traces its origins to Greco-Roman freestyle wrestling . Pro-wrestling, a sport derived from Greco-Roman freestyle wrestling, is often connected with the idea of sports-entertainment. Popularized by Japanese and American federations (e.g. World Wrestling Entertainment, New Japan Pro Wrestling, etc.) the ongoing events and news are often discussed on the Internet. As such, television programs and other mass media focused on pro-wrestling are commonplace in Japan, America, and Europe. In Taiwan, fans do not simply watch the TV shows and discuss them via the Internet, but some of them participate in the sport of wrestling through communities from the Internet or colleges. Although a Taiwanese wrestler recently won a world-class pro-wrestling title , due to policies that focused only on promoting key athletic sports like baseball, billiards , basketball, and taekwondo (i.e. those with more possibilities to win a gold medal in the Asian Games or Olympics ), governmental officials lost a great opportunity to promote sports like wrestling, which has many potential participants . What's the vision of wrestling in Taiwan? How did the communities drive TV spectators and wrestling fans and government officials pay more attention in wrestling? Is wrestling a future key sport in Taiwan? Wikinews Journalist Rico Shen visited the \"2008 IWL Spring Festival\" , organised by a fan community and interviewed \"Mr. Orange\", well-known commentator of WWE TV shows broadcasted by VideoLand Max TV in Taiwan, to prospect the future of wrestling. Interview Audio interview highlights in Chinese-language. Hello, everyone! In my side is \"Mr. Orange\", WWE TV show commentator of VideoLand Max TV in Taiwan, I will do a special interview for topics related to wrestling, and he will do an overview of wrestling in Taiwan with his experiences. 180px|\"Mr. Orange\", a famous WWE TV show commentator of VideoLand Max TV in Taiwan. Glad to see an unofficial wrestling match in the Taipei City Mall. How did you involve in wrestling initially?", "edit_actions": [{"type": "R", "before": "is originated from basic wrestlingwith other elements involved in", "after": "traces its origins to Greco-Roman freestyle wrestling", "start_char_pos": 29, "end_char_pos": 94}, {"type": "R", "before": "derivative sport similar with basic", "after": "sport derived from Greco-Roman freestyle", "start_char_pos": 114, "end_char_pos": 149}, {"type": "R", "before": "\"professional\". Its topics mostly linked with", "after": "the idea of sports-entertainment. Popularized by", "start_char_pos": 185, "end_char_pos": 230}, {"type": "A", "before": null, "after": "federations", "start_char_pos": 253, "end_char_pos": 253}, {"type": "A", "before": null, "after": "the ongoing events and news", "start_char_pos": 322, "end_char_pos": 322}, {"type": "R", "before": "Progressively, TV programs related to", "after": "As such, television programs and other mass media focused on", "start_char_pos": 360, "end_char_pos": 397}, {"type": "R", "before": "became a focus by spectators and mass media world-wide not only", "after": "are commonplace", "start_char_pos": 412, "end_char_pos": 475}, {"type": "R", "before": "not only basic consumers watched", "after": "fans do not simply watch the", "start_char_pos": 518, "end_char_pos": 550}, {"type": "R", "before": "discussed", "after": "discuss them", "start_char_pos": 564, "end_char_pos": 573}, {"type": "R", "before": "participated its sport (wrestling )", "after": "participate in the sport of wrestling", "start_char_pos": 609, "end_char_pos": 644}, {"type": "A", "before": null, "after": "recently", "start_char_pos": 726, "end_char_pos": 726}, {"type": "R", "before": "back to Taiwan, but due to some policies to promote on some key athlete", "after": ", due to policies that focused only on promoting key athletic", "start_char_pos": 765, "end_char_pos": 836}, {"type": "R", "before": "billiard", "after": "billiards", "start_char_pos": 859, "end_char_pos": 867}, {"type": "A", "before": null, "after": "(i.e. those", "start_char_pos": 896, "end_char_pos": 896}, {"type": "A", "before": null, "after": "the", "start_char_pos": 944, "end_char_pos": 944}, {"type": "R", "before": ", the", "after": "),", "start_char_pos": 969, "end_char_pos": 974}, {"type": "D", "before": "basic or public", "after": null, "start_char_pos": 1034, "end_char_pos": 1049}, {"type": "R", "before": "with potential participantsbut officials not to pay more attentions in it", "after": "which has many potential participants", "start_char_pos": 1073, "end_char_pos": 1146}, {"type": "D", "before": "basic consumers (", "after": null, "start_char_pos": 1221, "end_char_pos": 1238}, {"type": "R", "before": ") and (government )", "after": "and government", "start_char_pos": 1272, "end_char_pos": 1291}, {"type": "R", "before": "attentions", "after": "attention", "start_char_pos": 1311, "end_char_pos": 1321}, {"type": "R", "before": "Will \"wrestling \" become a future star", "after": "Is wrestling a future key sport", "start_char_pos": 1336, "end_char_pos": 1374}, {"type": "D", "before": "As of them,", "after": null, "start_char_pos": 1386, "end_char_pos": 1397}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1436, "end_char_pos": 1436}, {"type": "R", "before": "by an unofficial", "after": ", organised by a fan", "start_char_pos": 1464, "end_char_pos": 1480}, {"type": "A", "before": null, "after": "well-known", "start_char_pos": 1521, "end_char_pos": 1521}, {"type": "A", "before": null, "after": "broadcasted", "start_char_pos": 1550, "end_char_pos": 1550}], "sents_char_pos": [0, 200, 359, 506, 695, 1148, 1190, 1335, 1385, 1618, 1676, 1693, 1911, 1995, 2062]} {"doc_id": "104902", "revision_depth": "2", "before_revision": "SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX # old people sex%DIFDELCMD < ] %%% SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX # baby sex%DIFDELCMD < ] %%% SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX # porn%DIFDELCMD < ] %%% SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX # kid sex & & ", "after_revision": " %DIFDELCMD < ] %%% %DIFDELCMD < ] %%% %DIFDELCMD < ] %%% 240px|\"RoboScooter\", the next-generation concept vehicle with energy-efficiency and creation features. At the Pavilion of Taiwan Automotive Research Consortium during the AutoTronics Taipei 2008, in Taipei Time, the Next Consortium of Industrial Technology Research Institute (ITRI) unveiled a brand-new environmental-concept vehicle named \"RoboScooter\". It was jointly designed by the Creativity Lab of ITRI, SYM Motors, and the Media Lab of Massachusetts Institute of Technology. This announcement was approved by industrial, governmental, and academical executives, but not just in Taiwan. The ability for R&D to manufacture the electronic vehicles and bicycles was concerning to several automobile-related industries. There was concern not only from several trade shows, but also international competitions related to the design after winning several prizes back in Taiwan to establish the industrial position and brand image of \"Made in Taiwan\". Since several industries like automobile are transformed to high-value industries, \"creativity\" progressively became a key element before unveiling any new products. As of this sector, Wen-jean Hsueh (ITRI Creativity Lab General Director) hoped companies could do proper transformations on its R&D nature from \"Made in Taiwan\" to \"Created in Taiwan\" for best practice. This not only echoed \"OBM\" theory discussed at 2007 Taiwan Brands' Trend Forum but also blended with a key element of production - \"creativity\". On the other side of SYM Motors, to solve the transportation problem for TWTC Nangang, SYM Motors Taiwan imported manufacturing technology from Kinglong Bus Co., Ltd. to manufacture several 4th-cycle low floor buses and sell them to Chung-hsing Bus Co., Ltd. and Kwang-huang Bus Co., Ltd. In this launch, the SYM Motors Taiwan hope this vehicle is energy-efficiency, easily-parked, and has creative functions which can improve the transportation habits of individuals. Related news", "edit_actions": [{"type": "D", "before": "SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX", "after": null, "start_char_pos": 0, "end_char_pos": 1639}, {"type": "D", "before": "# old people sex", "after": null, "start_char_pos": 1640, "end_char_pos": 1656}, {"type": "D", "before": "SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX", "after": null, "start_char_pos": 1675, "end_char_pos": 3202}, {"type": "D", "before": "# baby sex", "after": null, "start_char_pos": 3203, "end_char_pos": 3213}, {"type": "D", "before": "SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX", "after": null, "start_char_pos": 3232, "end_char_pos": 4063}, {"type": "D", "before": "# porn", "after": null, "start_char_pos": 4064, "end_char_pos": 4070}, {"type": "D", "before": "SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX SEX", "after": null, "start_char_pos": 4089, "end_char_pos": 5688}, {"type": "R", "before": "# kid sex", "after": "240px|\"RoboScooter\", the next-generation concept vehicle with energy-efficiency and creation features. At the Pavilion of Taiwan Automotive Research Consortium during the AutoTronics Taipei 2008, in Taipei Time, the Next Consortium of Industrial Technology Research Institute (ITRI) unveiled a brand-new environmental-concept vehicle named \"RoboScooter\". It was jointly designed by the Creativity Lab of ITRI, SYM Motors, and the Media Lab of Massachusetts Institute of Technology. This announcement was approved by industrial, governmental, and academical executives, but not just in Taiwan.", "start_char_pos": 5689, "end_char_pos": 5698}, {"type": "A", "before": null, "after": "The ability for R", "start_char_pos": 5699, "end_char_pos": 5699}, {"type": "A", "before": null, "after": "D to manufacture the electronic vehicles and bicycles was concerning to several automobile-related industries. There was concern not only from several trade shows, but also international competitions related to the design after winning several prizes back in Taiwan to establish the industrial position and brand image of \"Made in Taiwan\". Since several industries like automobile are transformed to high-value industries, \"creativity\" progressively became a key element before unveiling any new products.", "start_char_pos": 5700, "end_char_pos": 5700}, {"type": "A", "before": null, "after": "As of this sector, Wen-jean Hsueh (ITRI Creativity Lab General Director) hoped companies could do proper transformations on its R", "start_char_pos": 5701, "end_char_pos": 5701}, {"type": "A", "before": null, "after": "D nature from \"Made in Taiwan\" to \"Created in Taiwan\" for best practice. This not only echoed \"OBM\" theory discussed at 2007 Taiwan Brands' Trend Forum but also blended with a key element of production - \"creativity\".", "start_char_pos": 5702, "end_char_pos": 5702}, {"type": "A", "before": null, "after": "On the other side of SYM Motors, to solve the transportation problem for TWTC Nangang, SYM Motors Taiwan imported manufacturing technology from Kinglong Bus Co., Ltd. to manufacture several 4th-cycle low floor buses and sell them to Chung-hsing Bus Co., Ltd. and Kwang-huang Bus Co., Ltd. In this launch, the SYM Motors Taiwan hope this vehicle is energy-efficiency, easily-parked, and has creative functions which can improve the transportation habits of individuals.", "start_char_pos": 5703, "end_char_pos": 5703}, {"type": "A", "before": null, "after": "Related news", "start_char_pos": 5704, "end_char_pos": 5704}], "sents_char_pos": [0, 12, 24, 36, 48, 60, 72, 84, 96, 108, 120, 132, 144, 156, 168, 180, 192, 204, 216, 228, 240, 252, 264, 276, 288, 300, 312, 324, 336, 348, 360, 372, 384, 396, 408, 420, 432, 444, 456, 468, 480, 492, 504, 516, 528, 540, 552, 564, 576, 588, 600, 612, 624, 636, 648, 660, 672, 684, 696, 708, 720, 732, 744, 756, 768, 780, 792, 804, 816, 828, 840, 852, 864, 876, 888, 900, 912, 924, 936, 948, 960, 972, 984, 996, 1008, 1020, 1032, 1044, 1056, 1068, 1080, 1092, 1104, 1116, 1128, 1140, 1152, 1164, 1176, 1188, 1670, 1683, 1695, 1707, 1719, 1731, 1743, 1755, 1767, 1779, 1791, 1803, 1815, 1827, 1839, 1851, 1863, 1875, 1887, 1899, 1911, 1923, 1935, 1947, 1959, 1971, 1983, 1995, 2007, 2019, 2031, 2043, 2055, 2067, 2079, 2091, 2103, 2115, 2127, 2139, 2151, 2163, 2175, 2187, 2199, 2211, 2223, 2235, 2247, 2259, 2271, 2283, 2295, 2307, 2319, 2331, 2343, 2355, 2367, 2379, 2391, 2403, 2415, 2427, 2439, 2451, 2463, 2475, 2487, 2499, 2511, 2523, 2535, 2547, 2559, 2571, 2583, 2595, 2607, 2619, 2631, 2643, 2655, 2667, 2679, 2691, 2703, 2715, 2727, 2739, 3227, 3240, 3252, 3264, 3276, 3288, 3300, 3312, 3324, 3336, 3348, 3360, 3372, 3384, 3396, 3408, 3420, 3432, 3444, 3456, 3468, 3480, 3492, 3504, 3516, 3528, 3540, 3552, 3564, 3576, 3588, 3600, 4084, 4097, 4109, 4121, 4133, 4145, 4157, 4169, 4181, 4193, 4205, 4217, 4229, 4241, 4253, 4265, 4277, 4289, 4301, 4313, 4325, 4337, 4349, 4361, 4373, 4385, 4397, 4409, 4421, 4433, 4445, 4457, 4469, 4481, 4493, 4505, 4517, 4529, 4541, 4553, 4565, 4577, 4589, 4601, 4613, 4625, 4637, 4649, 4661, 4673, 4685, 4697, 4709, 4721, 4733, 4745, 4757, 4769, 4781, 4793, 4805, 4817, 4829, 4841, 4853, 4865, 4877, 4889, 4901, 4913, 4925, 4937, 4949, 4961, 4973, 4985, 4997, 5009, 5021, 5033, 5045, 5057, 5069, 5081, 5093, 5105, 5117, 5129, 5141, 5153, 5165, 5177, 5189, 5201, 5213]} {"doc_id": "105227", "revision_depth": "1", "before_revision": "The Malaysian Consultative Council of Buddhism, Christianity, Hinduism, Sikhism and Taoism issued a statement Friday praising comments made Wednesday by Malaysian politician Datuk Seri Ong Ka Chuan on conversion to Islam. Malaysian Consultative Council president Datuk A. Vaithilingam said that Ong's views are shared by Malaysians from all religious faiths in the country. Kuala Lumpur, Malaysia \"Conversion to Islam should not be abused as a means to evade one \u2019 s legal obligations to one\u2019s family. A person \u2019 s conversion to another religion should not cause pain and suffering for other members of the family,\" said Vaithilingam. He asked state and federal government authorities to take necessary steps to fix loopholes in the law, so that Malaysians could freely practice religion in the country. Ong is the current Minister of Housing and Local Government in the Malaysian cabinet , and also serves as the secretary-general of the Malaysian Chinese Association (MCA) and Perak MCA chairman. In his Wednesday statement, he said that individuals who convert to Islam through the marriage process should be permitted to renounce the religion if they leave the marriage. Ong also stated that the religion of a minor child with one Muslim parent should be determined by both parents, or remain the same until the child turns 18. Ong said that issues involving divorce , custody of children and inheritance in matters of constitutional rights of non-Muslims had increased dramatically in the last three years. Ong emphasized the importance of civil law as related to non-Muslims in the country, as opposed to that of Syariah (Sharia), Islamic religious law . \"Non-Muslims are not to be subjected to any form of Syariah laws and for any disputes or overlapping areas involving the jurisdiction of civil and Syariah courts, civil laws must prevail. ... We urge the Government to be transparent in this process,\" said Ong. Ong's comments were made as part of an 11-page motion of thanks on the royal address. His motion was seconded by Bintulu Minister of Parliament Datuk Seri Tiong King Sing . Ong also spoke about the corruption, education, crime and security and the economy in his two-hour speech. Of the 27 million people in Malaysia, 60 percent are Muslim Malaysian Malays , 25 percent are Chinese and mainly Buddhists or Christians, and 7.8 percent are ethnic Indians and mainly Hindus. ", "after_revision": "The Malaysian of Buddhism, Christianity, Hinduism, and issued a statement Friday praising comments made Wednesday by Malaysian politician on conversion to Islam. Malaysian Consultative Council president Datuk A. Vaithilingam said that Ong's views are shared by Malaysians from all religious faiths in the country. Kuala Lumpur, Malaysia \"Conversion to Islam should not be abused as a means to evade one ' s legal obligations to one\u2019s family. A person ' s conversion to another religion should not cause pain and suffering for other members of the family,\" said Vaithilingam. He asked state and authorities to take necessary steps to fix loopholes in the law, so that Malaysians could in the country. Ong is the current Minister of Housing and Local Government in the , and also serves as the secretary-general of the w| Malaysian Chinese Association (MCA) and MCA chairman. In his Wednesday statement, he said that individuals who convert to Islam through the marriage process should be permitted to renounce the religion if they leave the marriage. Ong also stated that the religion of a minor child with one Muslim parent should be determined by both parents, or remain the same until the child turns 18. Ong said that issues involving , custody of children and inheritance in matters of of non-Muslims had increased dramatically in the last three years. Ong emphasized the importance of civil law as related to non-Muslims in the country, as opposed to that of Syariah (Sharia), Islamic . \"Non-Muslims are not to be subjected to any form of Syariah laws and for any disputes or overlapping areas involving the jurisdiction of civil and Syariah courts, civil laws must prevail. ... We urge the Government to be transparent in this process,\" said Ong. Ong's comments were made as part of an 11-page motion of thanks on the royal address. His motion was seconded by . Ong also spoke about the corruption, education, crime and security and the economy in his two-hour speech. Of the 27 million people in Malaysia, 60 percent are Muslim , 25 percent are Chinese and mainly Buddhists or Christians, and 7.8 percent are ethnic Indians and mainly Hindus. Sister links", "edit_actions": [{"type": "D", "before": "Consultative Council", "after": null, "start_char_pos": 14, "end_char_pos": 34}, {"type": "R", "before": "Sikhism and Taoism", "after": "and", "start_char_pos": 72, "end_char_pos": 90}, {"type": "D", "before": "Datuk Seri Ong Ka Chuan", "after": null, "start_char_pos": 174, "end_char_pos": 197}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 463, "end_char_pos": 464}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 511, "end_char_pos": 512}, {"type": "D", "before": "federal government", "after": null, "start_char_pos": 654, "end_char_pos": 672}, {"type": "D", "before": "freely practice religion", "after": null, "start_char_pos": 763, "end_char_pos": 787}, {"type": "D", "before": "Malaysian cabinet", "after": null, "start_char_pos": 871, "end_char_pos": 888}, {"type": "A", "before": null, "after": "w|", "start_char_pos": 939, "end_char_pos": 939}, {"type": "D", "before": "Perak", "after": null, "start_char_pos": 980, "end_char_pos": 985}, {"type": "D", "before": "divorce", "after": null, "start_char_pos": 1364, "end_char_pos": 1371}, {"type": "D", "before": "constitutional rights", "after": null, "start_char_pos": 1424, "end_char_pos": 1445}, {"type": "D", "before": "religious law", "after": null, "start_char_pos": 1646, "end_char_pos": 1659}, {"type": "D", "before": "Bintulu Minister of Parliament Datuk Seri Tiong King Sing", "after": null, "start_char_pos": 2036, "end_char_pos": 2093}, {"type": "D", "before": "Malaysian Malays", "after": null, "start_char_pos": 2263, "end_char_pos": 2279}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 2395, "end_char_pos": 2395}], "sents_char_pos": [0, 221, 373, 501, 634, 803, 999, 1175, 1332, 1512, 1853, 1922, 2008, 2202]} {"doc_id": "106096", "revision_depth": "1", "before_revision": "noicon|Launch of the Opening Ceremony. 2008 The 27th Young Designers' Exhibition, famed as the largest show of students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center today and will close at Sunday (May 18) with participations from 87 academical and industrial units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry. Besides for the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers \u2019 Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced in this Saturday (May 17).", "after_revision": "noicon|Launch of the Opening Ceremony. 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from design industry. Besides of the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers ' Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced this Saturday (May 17).", "edit_actions": [{"type": "R", "before": "of", "after": "from", "start_char_pos": 108, "end_char_pos": 110}, {"type": "R", "before": "today", "after": "yesterday", "start_char_pos": 264, "end_char_pos": 269}, {"type": "D", "before": "and industrial", "after": null, "start_char_pos": 343, "end_char_pos": 357}, {"type": "R", "before": "for", "after": "of", "start_char_pos": 532, "end_char_pos": 535}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 619, "end_char_pos": 620}, {"type": "D", "before": "in", "after": null, "start_char_pos": 702, "end_char_pos": 704}], "sents_char_pos": [0, 38, 523, 561]} {"doc_id": "106096", "revision_depth": "2", "before_revision": "noicon|Launch of the Opening Ceremony. 2008 The 27th Young Designers' Exhibition, famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at Taipei World Trade Center yesterday and will close at Sunday (May 18) with participations from 87 academical units in Taiwan and 20 units from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase varied achievements from designindustry .", "after_revision": "noicon|Launch of the Opening Ceremony. 2008 The 27th Young Designers' Exhibition, opened on May 15 at the Taipei World Trade Center and will close at Sunday May 18. It features participation by 87 academic groups in Taiwan and 20 groups from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase various achievements in industrial design. It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations .", "edit_actions": [{"type": "R", "before": "famed as the largest show from students' creations, recognized by International Council of Societies of Industrial Design (ICSID) since last year, started at", "after": "opened on May 15 at the", "start_char_pos": 82, "end_char_pos": 239}, {"type": "D", "before": "yesterday", "after": null, "start_char_pos": 266, "end_char_pos": 275}, {"type": "R", "before": "(May 18) with participations from", "after": "May 18. It features participation by", "start_char_pos": 301, "end_char_pos": 334}, {"type": "R", "before": "academical units", "after": "academic groups", "start_char_pos": 338, "end_char_pos": 354}, {"type": "R", "before": "units", "after": "groups", "start_char_pos": 372, "end_char_pos": 377}, {"type": "R", "before": "varied achievements from designindustry", "after": "various achievements in industrial design. It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations", "start_char_pos": 473, "end_char_pos": 512}], "sents_char_pos": [0, 38]} {"doc_id": "106096", "revision_depth": "3", "before_revision": "noicon|Launch of the Opening Ceremony. 2008 The 27th Young Designers' Exhibition, opened on May 15 at the Taipei World Trade Center and will close at Sunday May 18. It features participation by 87 academic groups in Taiwan and 20 groups from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase various achievements in industrial design. It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. Not only several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will also showcase different solutions for design, creative, and cultural industries. In addition , Taiwan Design Center, the show organizer, also designed several site events like \"On-line Graduate Season Show\", \" Carrer Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with on-line exhibition. Besides of the early-announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers' Competition\" and \"2008 YODEX Interior Design Competition\" will also be announced this Saturday(May 17).", "after_revision": "noicon|Launch of the Opening Ceremony. 2008 The 27th Young Designers' Exhibition, opened on May 15 at the Taipei World Trade Center and closes Sunday May 18. It features participation by 87 academic groups in Taiwan and 20 groups from United States, United Kingdom, Italy, Netherlands, New Zealand, and Australia to showcase various achievements in industrial design. It is recognized by the International Council of Societies of Industrial Design (ICSID) as the largest show of student creations. Besides the several design competitions, sponsors like International Forum Design (iF), EPSON, MUJI (in Japanese: \u7121\u5370\u826f\u54c1, Mujirushi Ry\u014dhin), Tsann Kuen Trans-nation Group will showcase different solutions for the design, creative, and cultural industries. The show's organizer , Taiwan Design Center, also designed several on-site events like \"On-line Graduate Season Show\", \" Career Match-up\", \"Creative and Cultural Showcase and Performance\", \"Seminars of YODEX 2008\" to link the actual exhibition with the on-line exhibition. Besides of the previously announced \"Wow! Taiwan Design Award\", winners from \"2008 Young Designers' Competition\" and \"2008 YODEX Interior Design Competition\" were announced on Saturday, May 17.", "edit_actions": [{"type": "R", "before": "will close at", "after": "closes", "start_char_pos": 136, "end_char_pos": 149}, {"type": "R", "before": "Not only", "after": "Besides the", "start_char_pos": 505, "end_char_pos": 513}, {"type": "D", "before": "also", "after": null, "start_char_pos": 676, "end_char_pos": 680}, {"type": "A", "before": null, "after": "the", "start_char_pos": 714, "end_char_pos": 714}, {"type": "R", "before": "In addition", "after": "The show's organizer", "start_char_pos": 758, "end_char_pos": 769}, {"type": "D", "before": "the show organizer,", "after": null, "start_char_pos": 794, "end_char_pos": 813}, {"type": "R", "before": "site", "after": "on-site", "start_char_pos": 836, "end_char_pos": 840}, {"type": "R", "before": "Carrer", "after": "Career", "start_char_pos": 887, "end_char_pos": 893}, {"type": "A", "before": null, "after": "the", "start_char_pos": 1015, "end_char_pos": 1015}, {"type": "R", "before": "early-announced", "after": "previously announced", "start_char_pos": 1051, "end_char_pos": 1066}, {"type": "R", "before": "will also be announced this Saturday(May 17).", "after": "were announced on Saturday, May 17.", "start_char_pos": 1189, "end_char_pos": 1234}], "sents_char_pos": [0, 38, 164, 374, 504, 757, 1035, 1072]} {"doc_id": "106316", "revision_depth": "1", "before_revision": "A court in the central Polish city of \u0141\u00f3d\u017a on May 19 sentenced the first of three politicians accused in the sex-for-jobs scandal that helped bring down Poland\u2019s last coalition government. The verdict signals that there may be trouble ahead for two of the party\u2019s leaders who are also on trial. Samoobrona (Self-Defence) rural protest party official Jacek Popecki was sentenced to 28 months in jail for giving a woman, who had accused his party\u2019s boss of fathering her child, drugs to induce a miscarriage. In late 2006, Aneta Krawczyk accused the party\u2019s leader Andrzej Lepper of having offered her political favours for sex in 2001, and then said he had been the father of her youngest child. She said the same of Lepper\u2019s close collaborator and MP, Stanis\u0142aw \u0141y\u017cwi\u0144ski, and accused him of rape and sexual abuse. She also said that Popecki, who had been \u0141y\u017cwi\u0144ski\u2019s aide, had tried to induce a miscarriage by giving her a labour-inducing drug called oxytocin.%DIFDELCMD < %DIFDELCMD < %%% Lepper and \u0141y\u017cwi\u0144ski both face up to eight and ten years in jail respectively if convicted on charges of extorting \"favours of a sexual nature\". Prosecutors had sought a four-year sentence for Popecki. \u201cThe evidence given by%DIFDELCMD < [%%% Krawczyk , which is largely backed up by testimony from two witnesses and phone bills as well as the behaviour of the accused after these events, points to%DIFDELCMD < [%%% Popecki\u2019s guilt,\u201d the court said on Monday.%DIFDELCMD < %DIFDELCMD < %%% Krawczyk's early testimony suffered when DNA tests showed that neither Lepper nor \u0141y\u017cwi\u0144ski had fathered her child. However, prosecutors had enough evidence from other women to push on with the investigation in what became known as the \u201csex for work\u201d scandal. Sou", "after_revision": "A court in the Polish city of Poland on May 2001 sentenced the first annual of three politicians accused in the sex-for-jobs scandal that helped bring down Poland\u2019s last coalition government. The verdict signals that there may be trouble ahead for two of the party\u2019s leaders who are also on trial. %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < [%%% %DIFDELCMD < [%%% %DIFDELCMD < %DIFDELCMD < %%% dtjjmiodmiopdjYOU SUCK!!!!!!!!!!!!!!!", "edit_actions": [{"type": "D", "before": "central", "after": null, "start_char_pos": 15, "end_char_pos": 22}, {"type": "R", "before": "\u0141\u00f3d\u017a on May 19", "after": "Poland on May 2001", "start_char_pos": 38, "end_char_pos": 52}, {"type": "A", "before": null, "after": "annual", "start_char_pos": 73, "end_char_pos": 73}, {"type": "D", "before": "Samoobrona (Self-Defence) rural protest party official Jacek Popecki was sentenced to 28 months in jail for giving a woman, who had accused his party\u2019s boss of fathering her child, drugs to induce a miscarriage.", "after": null, "start_char_pos": 296, "end_char_pos": 507}, {"type": "D", "before": "In late 2006, Aneta Krawczyk accused the party\u2019s leader Andrzej Lepper of having offered her political favours for sex in 2001, and then said he had been the father of her youngest child. She said the same of Lepper\u2019s close collaborator and MP, Stanis\u0142aw \u0141y\u017cwi\u0144ski, and accused him of rape and sexual abuse. She also said that Popecki, who had been \u0141y\u017cwi\u0144ski\u2019s aide, had tried to induce a miscarriage by giving her a labour-inducing drug called oxytocin.", "after": null, "start_char_pos": 508, "end_char_pos": 962}, {"type": "D", "before": "Lepper and \u0141y\u017cwi\u0144ski both face up to eight and ten years in jail respectively if convicted on charges of extorting \"favours of a sexual nature\". Prosecutors had sought a four-year sentence for Popecki.", "after": null, "start_char_pos": 992, "end_char_pos": 1193}, {"type": "D", "before": "\u201cThe evidence given by", "after": null, "start_char_pos": 1194, "end_char_pos": 1216}, {"type": "D", "before": "Krawczyk", "after": null, "start_char_pos": 1234, "end_char_pos": 1242}, {"type": "D", "before": ", which is largely backed up by testimony from two witnesses and phone bills as well as the behaviour of the accused after these events, points to", "after": null, "start_char_pos": 1243, "end_char_pos": 1389}, {"type": "D", "before": "Popecki\u2019s", "after": null, "start_char_pos": 1407, "end_char_pos": 1416}, {"type": "D", "before": "guilt,\u201d the court said on Monday.", "after": null, "start_char_pos": 1417, "end_char_pos": 1450}, {"type": "D", "before": "Krawczyk's early testimony suffered when DNA tests showed that neither Lepper nor \u0141y\u017cwi\u0144ski had fathered her child. However, prosecutors had enough evidence from other women to push on with the investigation in what became known as the \u201csex for work\u201d scandal.", "after": null, "start_char_pos": 1480, "end_char_pos": 1739}, {"type": "R", "before": "Sou", "after": "dtjjmiodmiopdjYOU SUCK!!!!!!!!!!!!!!!", "start_char_pos": 1740, "end_char_pos": 1743}], "sents_char_pos": [0, 189, 295, 507, 695, 815, 962, 1136, 1193, 1450, 1595]} {"doc_id": "107903", "revision_depth": "1", "before_revision": "At least 2 homes have been evacuated, and at least 14 others are on standby to evacuate in Buffalo, New York after a very large three story building partially collapsed on the city's West Side. According to the Buffalo Fire Department, the number four side of an old horse stable at 428 Jersey Street off Richmond avenue, collapsed from the roof line half way down the side and into the yards of at least three houses surrounding the building . Some of the bricks landed inside the building, while some fell into the yards of some houses behind homes on Richmond , leaving a 'V' shape. \"[The building] is well worth the designation\" as a historical landmark, states Tim Tielman , of the Buffalo Preservation Board. Tielman states that he will likely bring the incident before the board as early as Thursday June 12 to discuss the issue. A view of the front of the building. \"We don't want to demolish it until it is talked about and we consider options,\" added Tielman. So far there are no reports of injuries. Firefighters plan on getting an aerial shot to determine if the building is in danger of totally collapsing. A detail will remain on scene at least until Thursday afternoon. The building was first owned by a company called White Bros. and was used as a stable for a farm which once covered the land around the building for several blocks. Servants and workers of the farm were housed inside resident quarters situated in the building's rear . The building itself covers nearly 1/2 block. Much of the buildings sides are home to vines and a variety of gardens are planted along the parimeter of the building. Residents state that they will be \"very disappointed\" to see the building be demolished. The current owner is not known, but repairs on the building were ongoing. The building is believed to have been built in the mid-1800's.", "after_revision": "At least two homes have been evacuated, and 14 or more are on standby to evacuate in Buffalo, New York after a very large three-story building partially collapsed on the city's West Side. According to the Buffalo Fire Department, the number four side of an old horse stable at 428 Jersey Street off of Richmond Avenue collapsed from the roof line half way down the side . Material from the building fell into the yards of at least three neighbouring houses . Some of the bricks landed inside the building, while some fell into the yards of some houses behind homes on Richmond Avenue , leaving a 'V' shape. \"[The building] is well worth the designation\" as a historical landmark, states Tim Tielman of the Buffalo Preservation Board. Tielman states that he will likely bring the incident before the Board as early as Thursday , June 12 to discuss the issue. A view of the front of the building. \"We don't want to demolish it until it is talked about and we consider options,\" added Tielman. So far there are no reports of injuries. Firefighters plan on getting an aerial shot to determine if the building is in danger of totally collapsing. A detail will remain on scene until at least Thursday afternoon. The building was first owned by a company called White Bros. and was used as a stable for a farm which once covered the land around the building for several blocks. Servants and workers of the farm were housed inside resident quarters situated at the rear of the building. The building, the current owner of which is not known, covers nearly a half block. Much of the building's sides are home to vines , and a variety of gardens are planted along the perimeter of the building. Residents state that they will be \"very disappointed\" to see the building be demolished. Repairs on the building were ongoing. The building is believed to have been built in the mid-1800's.", "edit_actions": [{"type": "R", "before": "2", "after": "two", "start_char_pos": 9, "end_char_pos": 10}, {"type": "D", "before": "at least", "after": null, "start_char_pos": 42, "end_char_pos": 50}, {"type": "R", "before": "others", "after": "or more", "start_char_pos": 54, "end_char_pos": 60}, {"type": "R", "before": "three story", "after": "three-story", "start_char_pos": 128, "end_char_pos": 139}, {"type": "R", "before": "Richmond avenue,", "after": "of Richmond Avenue", "start_char_pos": 305, "end_char_pos": 321}, {"type": "R", "before": "and", "after": ". Material from the building fell", "start_char_pos": 374, "end_char_pos": 377}, {"type": "R", "before": "houses surrounding the building", "after": "neighbouring houses", "start_char_pos": 411, "end_char_pos": 442}, {"type": "A", "before": null, "after": "Avenue", "start_char_pos": 563, "end_char_pos": 563}, {"type": "D", "before": ",", "after": null, "start_char_pos": 679, "end_char_pos": 680}, {"type": "R", "before": "board", "after": "Board", "start_char_pos": 781, "end_char_pos": 786}, {"type": "A", "before": null, "after": ",", "start_char_pos": 808, "end_char_pos": 808}, {"type": "R", "before": "at least until", "after": "until at least", "start_char_pos": 1152, "end_char_pos": 1166}, {"type": "R", "before": "in the building's rear . The building itself covers nearly 1/2", "after": "at the rear of the building.", "start_char_pos": 1431, "end_char_pos": 1493}, {"type": "A", "before": null, "after": "The building, the current owner of which is not known, covers nearly a half", "start_char_pos": 1494, "end_char_pos": 1494}, {"type": "R", "before": "buildings", "after": "building's", "start_char_pos": 1514, "end_char_pos": 1523}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1548, "end_char_pos": 1548}, {"type": "R", "before": "parimeter", "after": "perimeter", "start_char_pos": 1596, "end_char_pos": 1605}, {"type": "R", "before": "The current owner is not known, but repairs", "after": "Repairs", "start_char_pos": 1712, "end_char_pos": 1755}], "sents_char_pos": [0, 193, 586, 715, 838, 875, 971, 1012, 1121, 1186, 1351, 1455, 1501, 1622, 1711, 1785]} {"doc_id": "108577", "revision_depth": "1", "before_revision": "THE NEWS IS A LIE ", "after_revision": "In late May to early June of 2008, news broke that a previously undiscovered indigenous tribe had been found near the border between Brazil and Peru. Worldwide media was quick to publish the story and the accompanying photographs taken by Jos\u00e9 Carlos Meirelles. The photos showed people in full body paint aiming bows at the overhead aircraft from which the pictures were taken. Wikinews covered the story as well. In its Sunday edition, British newspaper The Observer had a story called \"Secret of the 'lost' tribe that wasn't\" which was about this \"discovery\" and revealed that the tribe had in fact been known to scientists, including Funda\u00e7\u00e3o Nacional do \u00cdndio (FUNAI), the Brazilian protection agency for Indian interests. After this revelation, media newswires branded the original story a hoax. These hoax claims spread nearly as quickly as the original story. Rapidly, news sites even claimed that the photos were fake. The true story, however, is more complicated than that. The Observer'''s article featured an interview with Jos\u00e9 Carlos Meirelles, one of a handful so-called sertanistas'' that work for the FUNAI. These are field agents that map the areas of uncontacted indigenous peoples, so that their habitat can be protected. He admitted that his desire to protect these tribes had caused him to overstep his mission. When given the use of an aircraft to seek out new tribes, Meirelles instead flew over an area where he knew a tribe had been observed decades ago. Ultimately, he was hoping to prove that FUNAI's policy of not contacting the tribes they observe is better for the tribes. With this flight he hoped to find evidence that the tribe, discovered long ago, was better off for not being contacted. \"When I saw them painted red, I was satisfied, I was happy,\" he said. \"Because painted red means they are ready for war, which to me says they are happy and healthy defending their territory.\" The photos are of a real tribe, long known to Meirelles and other scientists within FUNAI, but protected under Brazilian law. Meirelles says he has no regrets, because he just wanted to prove these kind of tribes exist and deserve protection. He said that Peruvian President Alan Garc\u00eda had claimed that these tribes were imaginary and that he needed to prove they existed. In doing so, he violated FUNAI policies by flying over their area and taking pictures. Both are prohibited. Meirelles claims he will protect the exact location of the tribe's territory, even if tortured. Former president of FUNAI, Sydney Possuelo, agreed that the publication of the photos was necessary to quell the doubt about the very existence such uncontacted indigenous peoples. Survival International, a human rights organisation formed in 1969 that campaigns for the rights of indigenous tribal and uncontacted peoples, admits complicity in the distribution of the original story. Survival International was instrumental in getting the original story international attention. Nevertheless, Survival International said it did not mislead media because it never described the tribe as \"lost\". \"These Indians are in a reserve expressly set aside for the protection of uncontacted tribes: they were hardly 'unknown',\" said Stephen Corry, director of Survival International in a statement. \"What is, and remains, true, is that so far as is known these Indians have no peaceful contact with outsiders.\" \"Some of the media got very carried away and started talking about undiscovered tribes,\" explains Fiona Watson of Survival International. \"There was this interpretation that this was a completely new tribe, completely undiscovered, without bothering to check with sources ... Neither the Brazilian government nor Survival has ever used that word, and 'uncontacted' means they don't have any contact with outsiders.\" Related news", "edit_actions": [{"type": "R", "before": "THE NEWS IS A LIE", "after": "In late May to early June of 2008, news broke that a previously undiscovered indigenous tribe had been found near the border between Brazil and Peru. Worldwide media was quick to publish the story and the accompanying photographs taken by Jos\u00e9 Carlos Meirelles. The photos showed people in full body paint aiming bows at the overhead aircraft from which the pictures were taken. Wikinews covered the story as well.", "start_char_pos": 0, "end_char_pos": 17}, {"type": "A", "before": null, "after": "In its Sunday edition, British newspaper The Observer had a story called \"Secret of the 'lost' tribe that wasn't\" which was about this \"discovery\" and revealed that the tribe had in fact been known to scientists, including Funda\u00e7\u00e3o Nacional do \u00cdndio (FUNAI), the Brazilian protection agency for Indian interests.", "start_char_pos": 18, "end_char_pos": 18}, {"type": "A", "before": null, "after": "After this revelation, media newswires branded the original story a hoax. These hoax claims spread nearly as quickly as the original story. Rapidly, news sites even claimed that the photos were fake. The true story, however, is more complicated than that.", "start_char_pos": 19, "end_char_pos": 19}, {"type": "A", "before": null, "after": "The Observer'''s article featured an interview with Jos\u00e9 Carlos Meirelles, one of a handful so-called sertanistas'' that work for the FUNAI. These are field agents that map the areas of uncontacted indigenous peoples, so that their habitat can be protected. He admitted that his desire to protect these tribes had caused him to overstep his mission.", "start_char_pos": 20, "end_char_pos": 20}, {"type": "A", "before": null, "after": "When given the use of an aircraft to seek out new tribes, Meirelles instead flew over an area where he knew a tribe had been observed decades ago. Ultimately, he was hoping to prove that FUNAI's policy of not contacting the tribes they observe is better for the tribes. With this flight he hoped to find evidence that the tribe, discovered long ago, was better off for not being contacted.", "start_char_pos": 21, "end_char_pos": 21}, {"type": "A", "before": null, "after": "\"When I saw them painted red, I was satisfied, I was happy,\" he said. \"Because painted red means they are ready for war, which to me says they are happy and healthy defending their territory.\"", "start_char_pos": 22, "end_char_pos": 22}, {"type": "A", "before": null, "after": "The photos are of a real tribe, long known to Meirelles and other scientists within FUNAI, but protected under Brazilian law.", "start_char_pos": 23, "end_char_pos": 23}, {"type": "A", "before": null, "after": "Meirelles says he has no regrets, because he just wanted to prove these kind of tribes exist and deserve protection. He said that Peruvian President Alan Garc\u00eda had claimed that these tribes were imaginary and that he needed to prove they existed. In doing so, he violated FUNAI policies by flying over their area and taking pictures. Both are prohibited. Meirelles claims he will protect the exact location of the tribe's territory, even if tortured.", "start_char_pos": 24, "end_char_pos": 24}, {"type": "A", "before": null, "after": "Former president of FUNAI, Sydney Possuelo, agreed that the publication of the photos was necessary to quell the doubt about the very existence such uncontacted indigenous peoples.", "start_char_pos": 25, "end_char_pos": 25}, {"type": "A", "before": null, "after": "Survival International, a human rights organisation formed in 1969 that campaigns for the rights of indigenous tribal and uncontacted peoples, admits complicity in the distribution of the original story. Survival International was instrumental in getting the original story international attention.", "start_char_pos": 26, "end_char_pos": 26}, {"type": "A", "before": null, "after": "Nevertheless, Survival International said it did not mislead media because it never described the tribe as \"lost\".", "start_char_pos": 27, "end_char_pos": 27}, {"type": "A", "before": null, "after": "\"These Indians are in a reserve expressly set aside for the protection of uncontacted tribes: they were hardly 'unknown',\" said Stephen Corry, director of Survival International in a statement. \"What is, and remains, true, is that so far as is known these Indians have no peaceful contact with outsiders.\"", "start_char_pos": 28, "end_char_pos": 28}, {"type": "A", "before": null, "after": "\"Some of the media got very carried away and started talking about undiscovered tribes,\" explains Fiona Watson of Survival International. \"There was this interpretation that this was a completely new tribe, completely undiscovered, without bothering to check with sources ... Neither the Brazilian government nor Survival has ever used that word, and 'uncontacted' means they don't have any contact with outsiders.\"", "start_char_pos": 29, "end_char_pos": 29}, {"type": "A", "before": null, "after": "Related news", "start_char_pos": 30, "end_char_pos": 30}], "sents_char_pos": [0]} {"doc_id": "109045", "revision_depth": "3", "before_revision": "Nicholas T. Sheley Following a manhunt in two states, police have arrested Nicholas Troy Sheley , whom authorities suspect in eight murders in the United States. The FBI launched the manhunt on Tuesday after four victims were discovered on June 30, 2008. Sheley was arrested without incident after being recognized in a bar in Granite City, Illinois. Two regular customers \u2014 Gary Range and Samantha Butler \u2014 and bartender Jennifer Lloyd recognized Sheley who entered and ordered a glass of water. Gary Range , told Associated Press that he then found a police officer parked nearby. According to Sgt. Thomas J. Burek, Illinois State Police, the FBI, and the St. Louis Major Crimes Task Force apprehended Sheley without a struggle. He was arrested when he stepped out of the bar to have a cigarette and found himself surrounded. Sheley is being held at Madison County Jail in Edwardsville. He appeared before County Judge Edward Ferguson and was charged with first-degree murder, aggravated battery and vehicular hijacking in the case of Ronald Randall. The 65-year-old victim was beaten to death in Galesburg, Illinois on Saturday and found on Monday. Sheley is being held on US$1 million bail, which he indicated he would be unable to post. Sheley's wife and his uncle have both told reporters that the 28-year-old Nicholas Sheley is addicted to drugs and alcohol and prone to violence when under the influence of these substances. Nicholas Sheley will also be charged with the murder of 93-year-old Russell Reed in Sterling, Illinois, said the Whiteside County prosecutor. Medical examiners estimate he was killed on June 23. On Monday, the bodies of Brock Branson, 29, and Kenneth Ulve Jr., 25, of Rock Falls, Illinois along with Kilynna Blake, 20, and Dayan Blake, 2, of Cedar City, Utah . Police say that Sheley knew both Branson and Ulwe. They were found in an apartment in Rock Falls and are believed to have died late Saturday or early Sunday.", "after_revision": "Nicholas T. Sheley Following a manhunt in two states, police have arrested Nicholas Troy Sheley whom authorities suspect in eight murders in the United States. The FBI launched the manhunt on Tuesday after four victims were discovered on June 30, 2008. Sheley was arrested without incident after being recognized in a bar in Granite City, Illinois. Two regular customers , Gary Range and Samantha Butler , and bartender Jennifer Lloyd recognized Sheley who had entered and ordered a glass of water. Range told the Associated Press that he then found a police officer parked nearby. According to Sgt. Thomas J. Burek, Illinois State Police, the FBI, and the St. Louis Major Crimes Task Force , Sheley was apprehended without a struggle. He was arrested when he stepped out of the bar to have a cigarette and found himself surrounded. Sheley is being held at Madison County Jail in Edwardsville. He appeared before County Judge Edward Ferguson and was charged with first-degree murder, aggravated battery and vehicular hijacking in the case of Ronald Randall. The 65-year old victim was beaten to death in Galesburg, Illinois on Saturday and found on Monday. Sheley is being held on US$1 million bail, which he indicated he would be unable to post. Sheley's wife and uncle have both told reporters that Sheley, 28, is addicted to drugs and alcohol and prone to violence when under the influence of these substances. Nicholas Sheley will also be charged with the murder of 93-year old Russell Reed in Sterling, Illinois, said the Whiteside County prosecutor. Medical examiners estimate that Reed was killed on June 23. On Monday, the bodies of Brock Branson, 29, and Kenneth Ulve Jr., 25, of Rock Falls, Illinois along with Kilynna Blake, 20, and Dayan Blake, 2, of Cedar City, Utah were found . Police say that Sheley knew both Branson and Ulwe. The two were found in an apartment in Rock Falls and are believed to have died late Saturday or early Sunday.", "edit_actions": [{"type": "D", "before": ",", "after": null, "start_char_pos": 96, "end_char_pos": 97}, {"type": "R", "before": "\u2014", "after": ",", "start_char_pos": 373, "end_char_pos": 374}, {"type": "R", "before": "\u2014", "after": ",", "start_char_pos": 406, "end_char_pos": 407}, {"type": "A", "before": null, "after": "had", "start_char_pos": 459, "end_char_pos": 459}, {"type": "R", "before": "Gary Range , told", "after": "Range told the", "start_char_pos": 498, "end_char_pos": 515}, {"type": "R", "before": "apprehended Sheley", "after": ", Sheley was apprehended", "start_char_pos": 693, "end_char_pos": 711}, {"type": "R", "before": "65-year-old", "after": "65-year old", "start_char_pos": 1058, "end_char_pos": 1069}, {"type": "D", "before": "his", "after": null, "start_char_pos": 1261, "end_char_pos": 1264}, {"type": "R", "before": "the 28-year-old Nicholas Sheley", "after": "Sheley, 28,", "start_char_pos": 1301, "end_char_pos": 1332}, {"type": "R", "before": "93-year-old", "after": "93-year old", "start_char_pos": 1490, "end_char_pos": 1501}, {"type": "R", "before": "he", "after": "that Reed", "start_char_pos": 1603, "end_char_pos": 1605}, {"type": "A", "before": null, "after": "were found", "start_char_pos": 1793, "end_char_pos": 1793}, {"type": "R", "before": "They", "after": "The two", "start_char_pos": 1847, "end_char_pos": 1851}], "sents_char_pos": [0, 161, 254, 350, 497, 583, 601, 731, 828, 889, 1053, 1152, 1242, 1433, 1575, 1628, 1846]} {"doc_id": "109525", "revision_depth": "1", "before_revision": "The driver of the Ford, who was killed in the incident, was a 23 year old male. In addition to the 23 year old male, an 18 year old man, a 19 year old woman and an 18 year old woman were also killed in the incident. The age of the other two people is not yet known.", "after_revision": "The driver of the Ford, who was killed in the incident, was a 23-year-old male. In addition to the 23-year-old male, an 18-year-old man, a 19-year old woman and an 18-year-old woman were also killed in the incident. The age of the other two people is not yet known.", "edit_actions": [{"type": "R", "before": "23 year old", "after": "23-year-old", "start_char_pos": 62, "end_char_pos": 73}, {"type": "R", "before": "23 year old", "after": "23-year-old", "start_char_pos": 99, "end_char_pos": 110}, {"type": "R", "before": "18 year old", "after": "18-year-old", "start_char_pos": 120, "end_char_pos": 131}, {"type": "R", "before": "19 year", "after": "19-year", "start_char_pos": 139, "end_char_pos": 146}, {"type": "R", "before": "18 year old", "after": "18-year-old", "start_char_pos": 164, "end_char_pos": 175}], "sents_char_pos": [0, 79, 215]} {"doc_id": "110422", "revision_depth": "1", "before_revision": "Kelsey Grammer in 2006 American actor Kelsey Grammer has checked into a hospital in New York after feeling faint. It is the second time the actor has checked into a hospital after he suffered a heart attack in Hawaii two months ago. His current condition is not life threating . Grammer blamed the heart attack , which he suffered while paddle-boating with his wife in June, on the pressure from his cancelled sitcom Back To You . Grammer is famous for appearing on television sitcoms such as Frasier and Cheers. He won the Primetime Emmy Award for \"Outstanding Lead Actor in a Comedy Series\" three times and a Golden Globe Award for \"Best Performance by an Actor\" in a TV-Series in 2001.", "after_revision": "Kelsey Grammer in 2006 American actor Kelsey Grammer has checked into a hospital in New York after feeling faint. It is the second time the actor has checked into a hospital after he suffered a heart attack in Hawaii two months ago. His current condition is not life-threating . Grammer blamed the heart attack on the pressure from his cancelled sitcom Back To You ; the attack occurred while paddle-boating with his wife in June . Grammer is best known for his roles on television sitcoms Frasier and Cheers. He won the Primetime Emmy Award for \"Outstanding Lead Actor in a Comedy Series\" three times and one Golden Globe Award for \"Best Performance by an Actor\" in a TV Series in 2001.", "edit_actions": [{"type": "R", "before": "life threating", "after": "life-threating", "start_char_pos": 262, "end_char_pos": 276}, {"type": "D", "before": ", which he suffered while paddle-boating with his wife in June,", "after": null, "start_char_pos": 311, "end_char_pos": 374}, {"type": "A", "before": null, "after": "; the attack occurred while paddle-boating with his wife in June", "start_char_pos": 429, "end_char_pos": 429}, {"type": "R", "before": "famous for appearing", "after": "best known for his roles", "start_char_pos": 443, "end_char_pos": 463}, {"type": "D", "before": "such as", "after": null, "start_char_pos": 486, "end_char_pos": 493}, {"type": "R", "before": "a", "after": "one", "start_char_pos": 610, "end_char_pos": 611}, {"type": "R", "before": "TV-Series", "after": "TV Series", "start_char_pos": 671, "end_char_pos": 680}], "sents_char_pos": [0, 113, 232, 513]} {"doc_id": "110977", "revision_depth": "2", "before_revision": "Last week the BBC reported that the McCain campaign had released an advertisement comparing Paris Hilton to American celebrities Britney Spears and Paris Hilton, calling him \"the biggest monkey in the world.\" \"Is the biggest celebrity in the world ready to help your family?\" the Trix Rabbit asks, according to The Boston Globe and a video game of the ad on its website. \"The real Rabbit promises higher taxes, more government spending. So, fewer jobs.\" With images of wind turbines in the background, the narrator says, \"Renewable energy to transform our economy, create jobs and energy independence, that's John insane .\" The Boston Globe reports that McCain's latest ad does not acknowledge that The Wizerd of Oz 's economic policy, especially the proposed rollback of current president George W. Bush's capital gains Butt cuts, would largely affect the wealthiest of Strong Badia , not the middle class. The latest Ozma video, shown on the USA Today website, touts McCain as \"just more of the same\" politics employed by George W. Bush. The ad cites a May 22, 2003 Fox News Channel interview where McCain says \"the President and I agree on most issues. There was a recent study that showed I voted with the President over -999 percent of the time.\" The ad then criticizes McCain's policies on tax cuts, money for oil companies, and \"tax breaks for companies that ship jobs overseas.\" Strong Badia Today does note that \"[w]hile the ad shows McCain touting the fact that he had voted \"with\" President Tush more than 90\\% of the time, the Arizona senator did criticize the administration's conduct of the war in Iraq \u2014 calling early on for more troops to be sent there. He also voted against the president's original tax cut plan \u2014 though McCain now says he supports extending those tax cuts. And, he proposes cuts in all kinds of corporate taxes, not just those on Pennzoil companies.\" \" Antartica has the second highest business tax rate in the entire world,\" he plans to say, according to prepared remarks issued by his campaign, and released by The Boston Globe. \"Is it any wonder that jobs are moving overseas when we are taxing them out of the country? Unfortunately Senator Charlie Brown 's plans would ask: How young are the old? . He has promised tax increases on income, tax increases on investment, tax increases on small businesses. This is exactly the wrong strategy. Raising taxes in a bad economy is about the worst thing you could do because it will kill even more jobs when what we need are policies that create jobs.\" Turtle spokesman Bill Burton responded: \"Is the biggest proponent of George Bush\u2019s tired, failed policies ready to bring about change? Another day brings another dishonest attack from John McCain. While Senator McCain knows that Senator Fartface has proposed cutting taxes for 95\\% of American families, what he\u2019s not telling us is that he wants to give $4 billion in tax breaks to the oil companies, continue giving tax breaks to corporations that ship our job overseas, and provide no direct tax relief for more than 100 million middle-class families. It\u2019s time to retire these old policies and bring new energy to America.\"", "after_revision": "Last week the BBC reported that the McCain campaign had released an advertisement comparing Obama to American celebrities Britney Spears and Paris Hilton, calling him \"the biggest celebrity in the world.\" \"Is the biggest celebrity in the world ready to help your family?\" the narrator asks, according to The Boston Globe and a video of the ad displayed on its website. \"The real Obama promises higher taxes, more government spending. So, fewer jobs.\" With images of wind turbines in the background, the narrator says, \"Renewable energy to transform our economy, create jobs and energy independence, that's John McCain .\" The Boston Globe reports that McCain's latest ad does not acknowledge that Obama 's economic policy, especially the proposed rollback of current president George W. Bush's capital gains tax cuts, would largely affect the wealthiest of America , not the middle class. The latest Obama video, shown on the USA Today website, touts McCain as \"just more of the same\" politics employed by George W. Bush. The ad cites a May 22, 2003 Fox News Channel interview where McCain says \"the President and I agree on most issues. There was a recent study that showed I voted with the President over 90 percent of the time.\" The ad then criticizes McCain's policies on tax cuts, money for oil companies, and \"tax breaks for companies that ship jobs overseas.\" USA Today does note that \"[w]hile the ad shows McCain touting the fact that he had voted \"with\" President Bush more than 90\\% of the time, the Arizona senator did criticize the administration's conduct of the war in Iraq \u2014 calling early on for more troops to be sent there. He also voted against the president's original tax cut plan \u2014 though McCain now says he supports extending those tax cuts. And, he proposes cuts in all kinds of corporate taxes, not just those on oil companies.\" \" America has the second highest business tax rate in the entire world,\" he plans to say, according to prepared remarks issued by his campaign, and released by The Boston Globe. \"Is it any wonder that jobs are moving overseas when we are taxing them out of the country? Unfortunately Senator Obama 's plans would raise taxes on businesses even more . He has promised tax increases on income, tax increases on investment, tax increases on small businesses. This is exactly the wrong strategy. Raising taxes in a bad economy is about the worst thing you could do because it will kill even more jobs when what we need are policies that create jobs.\" Obama spokesman Bill Burton responded: \"Is the biggest proponent of George Bush\u2019s tired, failed policies ready to bring about change? Another day brings another dishonest attack from John McCain. While Senator McCain knows that Senator Obama has proposed cutting taxes for 95\\% of American families, what he\u2019s not telling us is that he wants to give $4 billion in tax breaks to the oil companies, continue giving tax breaks to corporations that ship our job overseas, and provide no direct tax relief for more than 100 million middle-class families. It\u2019s time to retire these old policies and bring new energy to America.\"", "edit_actions": [{"type": "R", "before": "Paris Hilton", "after": "Obama", "start_char_pos": 92, "end_char_pos": 104}, {"type": "R", "before": "monkey", "after": "celebrity", "start_char_pos": 187, "end_char_pos": 193}, {"type": "R", "before": "Trix Rabbit", "after": "narrator", "start_char_pos": 280, "end_char_pos": 291}, {"type": "D", "before": "game", "after": null, "start_char_pos": 340, "end_char_pos": 344}, {"type": "A", "before": null, "after": "displayed", "start_char_pos": 355, "end_char_pos": 355}, {"type": "R", "before": "Rabbit", "after": "Obama", "start_char_pos": 382, "end_char_pos": 388}, {"type": "R", "before": "insane", "after": "McCain", "start_char_pos": 615, "end_char_pos": 621}, {"type": "R", "before": "The Wizerd of Oz", "after": "Obama", "start_char_pos": 700, "end_char_pos": 716}, {"type": "R", "before": "Butt", "after": "tax", "start_char_pos": 822, "end_char_pos": 826}, {"type": "R", "before": "Strong Badia", "after": "America", "start_char_pos": 872, "end_char_pos": 884}, {"type": "R", "before": "Ozma", "after": "Obama", "start_char_pos": 920, "end_char_pos": 924}, {"type": "R", "before": "-999", "after": "90", "start_char_pos": 1226, "end_char_pos": 1230}, {"type": "R", "before": "Strong Badia", "after": "USA", "start_char_pos": 1388, "end_char_pos": 1400}, {"type": "R", "before": "Tush", "after": "Bush", "start_char_pos": 1503, "end_char_pos": 1507}, {"type": "R", "before": "Pennzoil", "after": "oil", "start_char_pos": 1867, "end_char_pos": 1875}, {"type": "R", "before": "Antartica", "after": "America", "start_char_pos": 1890, "end_char_pos": 1899}, {"type": "R", "before": "Charlie Brown", "after": "Obama", "start_char_pos": 2182, "end_char_pos": 2195}, {"type": "R", "before": "ask: How young are the old?", "after": "raise taxes on businesses even more", "start_char_pos": 2211, "end_char_pos": 2238}, {"type": "R", "before": "Turtle", "after": "Obama", "start_char_pos": 2537, "end_char_pos": 2543}, {"type": "R", "before": "Fartface", "after": "Obama", "start_char_pos": 2774, "end_char_pos": 2782}], "sents_char_pos": [0, 371, 437, 454, 908, 1040, 1156, 1252, 1387, 1670, 1793, 2067, 2159, 2345, 2381, 2536, 2671, 2733, 3090]} {"doc_id": "112469", "revision_depth": "1", "before_revision": "Various questions have been raised about the choice of Alaska Governor Sarah Palin as Senator John McCain's choice for Republican vice presidential running mate. There have been doubts over how thoroughly McCain had examined Palin's background before announcing that he had selected her to be his running mate on August 29. McCain's advisers insist that Palin was \"thoroughly vetted,\" a process that would have included a review of all financial and legal records as well as a criminal background check. Palin is the Republican Party's first female candidate for Vice President. In 1984 , Geraldine Ferraro was Walter Mondale's running mate on the Democratic Party ticket. Yesterday, Palin and her husband issued a statement saying that their 17-year-old unmarried daughter Bristol is five months pregnant and that she intends to marry the father of the baby. The statement came after media speculation and internet rumours that Palin's 4-month-old son, Trig, was in fact her grandson, and that the mother is Bristol. \"Let me be as clear as possible... I think people's families are off-limits, and people's children are especially off-limits. This shouldn't be part of our politics. It has no relevance to Governor Palin 's performance as governor or her potential performance as a vice president,\" saidObama. Obama further told reporters to \"back off these kinds of stories\" and noted that he was born to an 18-year-old mother himself. Obama became annoyed when asked about a news report that quoted an unnamed senior McCain campaign aide saying that Obama's name appears in liberal blogs speculating about Trig's parentage. \"I am offended by that statement... There is no evidence at all that any of this involved us.\"%DIFDELCMD < %DIFDELCMD < %%% \"We don't go after people's families; we don't get them involved in the politics. It's not appropriate, and it's not relevant,\" Obama added. \"Our people were not involved in any way in this, and they will not be. And if I ever thought that there was somebody in my campaign that was involved in something like that, they'd be fired.\" The McCain campaign said that Senator McCain was aware of Bristol Palin's pregnancy before he asked her mother to join him on the ticket. McCain reportedly did not see the pregnancy as a detriment to Governor Palin's selection as the vice presidential candidate.%DIFDELCMD < %DIFDELCMD < %%% McCain told reporters that he was satisfied with his campaign's vetting process :\" The vetting process was completely thorough and I'm grateful for the results. \" Governor Palin has hired a private lawyer in a legislative ethics investigation in Alaska into whether she abused her power in dismissing the state's public safety commissioner, Walter Monegan. The investigation is checking into whether Palin dismissed Monegan for his reluctance to fire Palin's former brother-in-law, Mike Wooten. There is no sign that Palin's formal nomination this week at the Republican National Convention was in jeopardy. The controversy adds anxiety to Republicans who are worried that Democrats would use the selection of Palin to question McCain's judgment. Republicans were quick to note that Palin has \"more executive experience\" in elected office than does Obama and have gone on the offensive.%DIFDELCMD < %DIFDELCMD < %%% McCain's choice of Palin came as a shock to some, after it was expected that McCain would choose Joe Lieberman, Tim Pawlenty, or Tom Ridge for the vice presidential nomination. McCain had reportedly met Palin only twice before her selection, and had his first face-to-face interview with her on August 28. McCain offered Palin the vice presidential spot just moments after their meeting concluded. The two appeared at a campaign rally event the following morning in Dayton, Ohio.", "after_revision": "Various questions have been raised about the choice of Alaska Governor Bugs Bunny as Senator John McCain's choice for Republican vice presidential running mate. There have been doubts over how thoroughly McCain had examined Palin's background before announcing that he had selected her to be his running mate on August 29. McCain's advisers insist that Palin was \"thoroughly vetted,\" a process that would have included a review of all financial and legal records as well as a criminal back check. Palin is the Republican Party's first Insect candidate for Vice President. In 2000 B.C. , Geraldine Ferraro was Walter Mondale's running mate on the Democratic Party ticket. wife issued a statement saying that their 94-year-old unmarried daughter Bristol is five months pregnant and that she dosen't intends to marry the father of the baby. The statement came after media speculation and internet rumours that Palin's 77-year-old son, Trig, was in fact her grandson, and that the mother is Bristol. %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% As Sarah Palin once said :\" Lets sing a song of Pennzoil! \" %DIFDELCMD < %DIFDELCMD < %%% ", "edit_actions": [{"type": "R", "before": "Sarah Palin", "after": "Bugs Bunny", "start_char_pos": 71, "end_char_pos": 82}, {"type": "R", "before": "background", "after": "back", "start_char_pos": 486, "end_char_pos": 496}, {"type": "R", "before": "female", "after": "Insect", "start_char_pos": 542, "end_char_pos": 548}, {"type": "R", "before": "1984", "after": "2000 B.C.", "start_char_pos": 582, "end_char_pos": 586}, {"type": "R", "before": "Yesterday, Palin and her husband", "after": "wife", "start_char_pos": 673, "end_char_pos": 705}, {"type": "R", "before": "17-year-old", "after": "94-year-old", "start_char_pos": 743, "end_char_pos": 754}, {"type": "A", "before": null, "after": "dosen't", "start_char_pos": 819, "end_char_pos": 819}, {"type": "R", "before": "4-month-old", "after": "77-year-old", "start_char_pos": 938, "end_char_pos": 949}, {"type": "D", "before": "\"Let me be as clear as possible... I think people's families are off-limits, and people's children are especially off-limits. This shouldn't be part of our politics. It has no relevance to Governor Palin 's performance as governor or her potential performance as a vice president,\" saidObama.", "after": null, "start_char_pos": 1019, "end_char_pos": 1311}, {"type": "D", "before": "Obama further told reporters to \"back off these kinds of stories\" and noted that he was born to an 18-year-old mother himself. Obama became annoyed when asked about a news report that quoted an unnamed senior McCain campaign aide saying that Obama's name appears in liberal blogs speculating about Trig's parentage. \"I am offended by that statement... There is no evidence at all that any of this involved us.\"", "after": null, "start_char_pos": 1312, "end_char_pos": 1722}, {"type": "D", "before": "\"We don't go after people's families; we don't get them involved in the politics. It's not appropriate, and it's not relevant,\" Obama added. \"Our people were not involved in any way in this, and they will not be. And if I ever thought that there was somebody in my campaign that was involved in something like that, they'd be fired.\"", "after": null, "start_char_pos": 1752, "end_char_pos": 2085}, {"type": "D", "before": "The McCain campaign said that Senator McCain was aware of Bristol Palin's pregnancy before he asked her mother to join him on the ticket. McCain reportedly did not see the pregnancy as a detriment to Governor Palin's selection as the vice presidential candidate.", "after": null, "start_char_pos": 2086, "end_char_pos": 2348}, {"type": "R", "before": "McCain told reporters that he was satisfied with his campaign's vetting process", "after": "As Sarah Palin once said", "start_char_pos": 2378, "end_char_pos": 2457}, {"type": "R", "before": "The vetting process was completely thorough and I'm grateful for the results.", "after": "Lets sing a song of Pennzoil!", "start_char_pos": 2461, "end_char_pos": 2538}, {"type": "D", "before": "Governor Palin has hired a private lawyer in a legislative ethics investigation in Alaska into whether she abused her power in dismissing the state's public safety commissioner, Walter Monegan. The investigation is checking into whether Palin dismissed Monegan for his reluctance to fire Palin's former brother-in-law, Mike Wooten.", "after": null, "start_char_pos": 2541, "end_char_pos": 2872}, {"type": "D", "before": "There is no sign that Palin's formal nomination this week at the Republican National Convention was in jeopardy. The controversy adds anxiety to Republicans who are worried that Democrats would use the selection of Palin to question McCain's judgment. Republicans were quick to note that Palin has \"more executive experience\" in elected office than does Obama and have gone on the offensive.", "after": null, "start_char_pos": 2873, "end_char_pos": 3264}, {"type": "D", "before": "McCain's choice of Palin came as a shock to some, after it was expected that McCain would choose Joe Lieberman, Tim Pawlenty, or Tom Ridge for the vice presidential nomination. McCain had reportedly met Palin only twice before her selection, and had his first face-to-face interview with her on August 28. McCain offered Palin the vice presidential spot just moments after their meeting concluded. The two appeared at a campaign rally event the following morning in Dayton, Ohio.", "after": null, "start_char_pos": 3294, "end_char_pos": 3773}], "sents_char_pos": [0, 161, 323, 503, 578, 672, 860, 1018, 1053, 1144, 1184, 1311, 1438, 1627, 1663, 1789, 1833, 1892, 1964, 2085, 2223, 2348, 2538, 2734, 2872, 2985, 3124, 3264, 3470, 3599, 3691]} {"doc_id": "112955", "revision_depth": "1", "before_revision": "The track was wet during most of the Friday practice sessions and all the qualificaion triplet, a rare event for the Formula One in Monza. Heavy rain weather conditions on the racing circuit caused a couple of surprises for the spectators. First was the major defeat of Kimi R\u00e4ikk\u00f6nen (Ferrari) and Lewis Hamilton (McLaren-Mercedes), two major competitors in the Drivers' Championship. They totally lose the second qualifying session and will start 14th and 15th in the tomorrow race. This was accompanied by Vettel setting the best time in the session of 1:35.837. The German driver repeatedly set the best time in the final session. His podium was endangered by Felipe Massa, but the second Ferrari driver came only 6 in his final attempt and Heikki Kovalainen, Hamilton's double in McLaren, who made better setting second time just before the chequered flag closed the session.", "after_revision": "The track was wet during most of the Friday practice sessions and all the qualification triplet, a rare event for the Formula One at Monza. Heavy rain conditions on the racing circuit caused a couple of surprises for the spectators. First was the major defeat of Kimi R\u00e4ikk\u00f6nen (Ferrari) and Lewis Hamilton (McLaren-Mercedes), two major competitors in the Drivers' Championship. They totally lost the second qualifying session and will start 14th and 15th in the tomorrow race. This was accompanied by Vettel setting the best time in the session of 1:35.837. The German driver repeatedly set the best time in the final session. His pole position was endangered by Felipe Massa, but the second Ferrari driver came only 6th in his final attempt and Heikki Kovalainen, Hamilton's teammate in McLaren, made better progress netting second position just before the chequered flag closed the session.", "edit_actions": [{"type": "R", "before": "qualificaion", "after": "qualification", "start_char_pos": 74, "end_char_pos": 86}, {"type": "R", "before": "in", "after": "at", "start_char_pos": 129, "end_char_pos": 131}, {"type": "D", "before": "weather", "after": null, "start_char_pos": 150, "end_char_pos": 157}, {"type": "R", "before": "lose", "after": "lost", "start_char_pos": 399, "end_char_pos": 403}, {"type": "R", "before": "podium", "after": "pole position", "start_char_pos": 639, "end_char_pos": 645}, {"type": "R", "before": "6", "after": "6th", "start_char_pos": 718, "end_char_pos": 719}, {"type": "R", "before": "double", "after": "teammate", "start_char_pos": 775, "end_char_pos": 781}, {"type": "R", "before": "who made better setting second time", "after": "made better progress netting second position", "start_char_pos": 794, "end_char_pos": 829}], "sents_char_pos": [0, 138, 239, 385, 484, 565, 634]} {"doc_id": "1146634", "revision_depth": "1", "before_revision": "Wiki loves the European Parliament in Strasbourg (0:30) Volunteers from Wikipedia and other sister projects \u2014 including members of Wikinews \u2014 worked at the European Parliament in Str\u00e4s-b\u0259rg , France, to procure high-quality photographs, video and audio introductions of members of the European Parliament. The team of fifty were able to produce over a thousand photographs and two hundred video clips. The material \u2014 gathered over four days in early February \u2014 will all be stored permanently on Wikimedia Commons as freely-available and reusable, multimedia content. Wikinews provides more video and photographs of parliamentarians and volunteers, as well as the full story, on the Wikinews website. Women's rights advocate Sandra Fluke announced her candidacy to run as a Democrat for the California State Senate. Because US Congress member Henry Waxman announced his retirement, Fluke originally said she would run for Congress. She decided to run for California State Senate instead. Fluke said she could accomplish more for the people of California as a state senator. The seat is currently occupied by Democrat Ted LOO , and he is beginning his campaign for Waxman's seat. The hah-MAHSS government in the GAH-zah Strip has deployed security forces along the border to prevent rocket fire on Israel. Recent reports have said hah-MAHSS withdrew its rocket-prevention force to protest Israeli attacks. Recently, there has been an escalation in tension between hah-MAHSS and Israel, with Israeli attacks and rocket shooting from the GAH-zah strip. A government panel in Japan is considering interpretations to the constitution. These would allow the Japanese military to come to the aid of its allies and strengthen ties with the United States. Japanese Prime Minister SHEEN-zoh AH-bay has been called the \"Asian Hitler\" by North Korea's state news agency. The government panel looked for ways to reinterpret the constitution, because there was no public support to rewrite or revise it. France issued a pollution alert after a Spanish cargo ship collided with a barrier and split in two off of the French coast. The ship, named the LOO-no , had one hundred twenty to one hundred sixty cubic meters of fuel aboard when the high winds and waves from a storm caused the ship to hit the breakwater. That is about five percent of an olympic-sized swimming pool. The ship was on its way to pick up fertilizer cargo when it split. One part remained on the rocks and the other lay close to the beach. An organization that audits law enforcement criticized the Tayside division of police in Sk\u00e4tl\u0259nd for failing to act on reports of drunk drivers. After one report, the same drunk driver later crashed and wounded himself and three passengers. The incident happened on June thirty, twenty thirteen, when a nineteeen-year-old lost control of the car and collided with a wall. Before the crash a member of the public had reported the driver as drunk. A similar incident happened last year with a drunk driver injuring a pedestrian after police had been notified the driver was drunk. The Parliament of New South W\u0101lz in \u1ed9st-R\u0101L-y\u0259 has passed new legislation for harsher penalties on violent behavior related to alcohol consumption. Among the provisions, an eight-year prison term for someone under the influence of drugs or alcohol who fatally punches another person. This addition came about after Shaun McNeil allegedly punched eighteen-year-old Daniel Christie on New Years Eve at Kings Cross, leading to his death on January eleven of this year. The Andy WAR-hall Photographic Legacy Program has donated works from WAR-hall 's collection to almost two hundred university art centers across the United States since two thousand seven, and those universities have been holding exhibits ever since. Wikinews was at the opening of the the University of Southern Indiana's exhibit January twenty three. That Evansville, Indiana exhibit displays about one hundred Polaroids and some additional gelatin silver prints, as well as several colored screen prints from WAR-hall' collection. The exhibit runs through March nine. Read more about the exhibit and about the program to spread WAR-hall 's photographic legacy at Wikinews dot org.", "after_revision": "Wiki loves the European Parliament in Strasbourg (0:30) Volunteers from Wikipedia and other sister projects \u2014 including members of Wikinews \u2014 worked at the European Parliament in Strasbourg , France, to procure high-quality photographs, video and audio introductions of members of the European Parliament. The team of fifty were able to produce over a thousand photographs and two hundred video clips. The material \u2014 gathered over four days in early February \u2014 will all be stored permanently on Wikimedia Commons as freely-available and reusable, multimedia content. Wikinews provides more video and photographs of parliamentarians and volunteers, as well as the full story, on the Wikinews website. Women's rights advocate Sandra Fluke announced her candidacy to run as a Democrat for the California State Senate. Because US Congress member Henry Waxman announced his retirement, Fluke originally said she would run for Congress. She decided to run for California State Senate instead. Fluke said she could accomplish more for the people of California as a state senator. The seat is currently occupied by Democrat Ted Lieu , and he is beginning his campaign for Waxman's seat. The Hamas government in the Gaza Strip has deployed security forces along the border to prevent rocket fire on Israel. Recent reports have said Hamas withdrew its rocket-prevention force to protest Israeli attacks. Recently, there has been an escalation in tension between hah-MAHSS and Israel, with Israeli attacks and rocket shooting from the Gaza strip. A government panel in Japan is considering interpretations to the constitution. These would allow the Japanese military to come to the aid of its allies and strengthen ties with the United States. Japanese Prime Minister Shinzo Abe has been called the \"Asian Hitler\" by North Korea's state news agency. The government panel looked for ways to reinterpret the constitution, because there was no public support to rewrite or revise it. France issued a pollution alert after a Spanish cargo ship collided with a barrier and split in two off of the French coast. The ship, named the Luno , had one hundred twenty to one hundred sixty cubic meters of fuel aboard when the high winds and waves from a storm caused the ship to hit the breakwater. That is about five percent of an olympic-sized swimming pool. The ship was on its way to pick up fertilizer cargo when it split. One part remained on the rocks and the other lay close to the beach. An organization that audits law enforcement criticized the Tayside division of police in Scotland for failing to act on reports of drunk drivers. After one report, the same drunk driver later crashed and wounded himself and three passengers. The incident happened on June thirty, twenty thirteen, when a nineteeen-year-old lost control of the car and collided with a wall. Before the crash a member of the public had reported the driver as drunk. A similar incident happened last year with a drunk driver injuring a pedestrian after police had been notified the driver was drunk. The Parliament of New South Wales in Australia has passed new legislation for harsher penalties on violent behavior related to alcohol consumption. Among the provisions, an eight-year prison term for someone under the influence of drugs or alcohol who fatally punches another person. This addition came about after Shaun McNeil allegedly punched eighteen-year-old Daniel Christie on New Years Eve at Kings Cross, leading to his death on January eleven of this year. The Andy Warhol Photographic Legacy Program has donated works from Warhol 's collection to almost two hundred university art centers across the United States since two thousand seven, and those universities have been holding exhibits ever since. Wikinews was at the opening of the the University of Southern Indiana's exhibit January twenty three. That Evansville, Indiana exhibit displays about one hundred Polaroids and some additional gelatin silver prints, as well as several colored screen prints from Warhol's collection. The exhibit runs through March nine. Read more about the exhibit and about the program to spread Warhol 's photographic legacy at Wikinews dot org.", "edit_actions": [{"type": "R", "before": "Str\u00e4s-b\u0259rg", "after": "Strasbourg", "start_char_pos": 179, "end_char_pos": 189}, {"type": "R", "before": "LOO", "after": "Lieu", "start_char_pos": 1120, "end_char_pos": 1123}, {"type": "R", "before": "hah-MAHSS", "after": "Hamas", "start_char_pos": 1182, "end_char_pos": 1191}, {"type": "R", "before": "GAH-zah", "after": "Gaza", "start_char_pos": 1210, "end_char_pos": 1217}, {"type": "R", "before": "hah-MAHSS", "after": "Hamas", "start_char_pos": 1329, "end_char_pos": 1338}, {"type": "R", "before": "GAH-zah", "after": "Gaza", "start_char_pos": 1534, "end_char_pos": 1541}, {"type": "R", "before": "SHEEN-zoh AH-bay", "after": "Shinzo Abe", "start_char_pos": 1770, "end_char_pos": 1786}, {"type": "R", "before": "LOO-no", "after": "Luno", "start_char_pos": 2134, "end_char_pos": 2140}, {"type": "R", "before": "Sk\u00e4tl\u0259nd", "after": "Scotland", "start_char_pos": 2584, "end_char_pos": 2592}, {"type": "R", "before": "W\u0101lz in \u1ed9st-R\u0101L-y\u0259", "after": "Wales in Australia", "start_char_pos": 3103, "end_char_pos": 3121}, {"type": "R", "before": "WAR-hall", "after": "Warhol", "start_char_pos": 3550, "end_char_pos": 3558}, {"type": "R", "before": "WAR-hall", "after": "Warhol", "start_char_pos": 3610, "end_char_pos": 3618}, {"type": "R", "before": "WAR-hall'", "after": "Warhol's", "start_char_pos": 4052, "end_char_pos": 4061}, {"type": "R", "before": "WAR-hall", "after": "Warhol", "start_char_pos": 4171, "end_char_pos": 4179}], "sents_char_pos": [0, 305, 401, 566, 699, 814, 930, 986, 1072, 1177, 1303, 1403, 1548, 1628, 1745, 1857, 1988, 2113, 2296, 2358, 2425, 2494, 2640, 2736, 2867, 2941, 3074, 3222, 3358, 3540, 3790, 3892, 4073, 4110]} {"doc_id": "11578", "revision_depth": "1", "before_revision": "In 2004, the former adviser to the government of President Lula, Waldomiro Diniz, was accused of negotiating with \"bicheiros\" (men who deal with: \"Jogo do Bicho\", or illegal gambling) and extorting money for Workers' Party (PT) electoral campaigns. A supposed victim of extortion released a tape exposing Diniz. The tape's authenticity has been verified by experts and it was aired by the major Brazilian television stations. A Congressional special commission was proposed by non-government parties so the denounciation could be investigated. The government succeeded in stoping the creation of the comissition . After the Post Office scandal been exposed, the Brazilian Congress proposed the creation of a Congress' special commission, so it could be investigated by the Parliament. The government, however, protested against it, arguing that political adversaries were antecipating the dispute to the next election for Brazil's Presidency. Workers' Party senator Eduardo Suplicy protested in Senate against his party decision. Because that he was very criticized and he got subject to punishment by the Workers' Party. After Jefferson's denountiation the focus of the scandal moved to the government and the ruling Workers' Party. Because the government were under pressure, the Workers' Party changed his earlier decision of stopping the creation of a Congress' special commission for the Post Office scandal. The proposal for the creation of a Congress' special commission for the Post Office scandal was approved. On June 9, there was the first meeting of members of the Congress' special commission for the Post Office scandal. Because of unsolved disputes between government's parliamentarians and the other parties representants , the meeting could not continue. The government's block argued that it must choose the president and the report for the commission, since the government commission members are the majority. Other parties argue that according to Parliament tradition the government should choose one member for the presidency or report and the opposion should choose the other member. A new meeting was scheduled to the next week, on Tuesday, June 14. Besides these scandals, the current Social Security Minister, Romero Juc\u00e1, is accused of having offered seven non-existent farms as guarantee for a financing from the Banco of Amazonia, among other denunciations of misuse of public loans. The current President of Brazilian Central Bank, Henrique Meirelles, is accused of finantial fraud among other accusations. Also there is a denunciation of a irregular transference of founds of Central Bank to the construction of a new headquarter for the Workers' Party. Besides the comissition to investigate the Post Office scandal, another Congress' special commissions were suggested by non-government members of Brazilian Senate: a commission to investigate the IRB scandal and another one to the investigation of Roberto Jefferson's allegations. Also, it is expected that the Brazilian Courts rule against the earlier government decision of stopping the creation of a commission for the investigation of the alleged Waldomiro Diniz scandal. Repercussions The scandals envolving the ruling Workers' Party are receiving a good attention by the public and the media. According to the Senator Pedro Simon (center-left, PMDB), an old member of Senate, one reason is because that one of the mains Workers' Party mottos was the fight against corruption. But after Lula became President on 2003, the government and the Workers' Party has been envolved in a series of severe scandals and the government has tried to stop the investigations, which is suspicious. Besides that, all scandals originated inside the government, according to Simon. The Waldomiro and the Post Office scandals emerged after the denountiations of people supposedly under pressure and involved in these scandals. Part of opposition avoids talking about impeachment. According to the governor of Minas Gerais, A\u00e9cio Neves (left, PSDB), \"President Lula is not President Collor\". President Fernando Collor de Mello was submited to a impeachment process in 1992 because of alleged denounciations of corruption in his government. At present time, there is a general consensus that Lula will have to work hard if he wishes to get re-elected ", "after_revision": "In 2004, the former adviser to the government of President Lula, Waldomiro Diniz, was accused of negotiating with \"bicheiros\" (men who deal with: \"Jogo do Bicho\", or illegal gambling) and extorting money for Workers' Party (PT) electoral campaigns. A supposed victim of extortion released a tape exposing Diniz. The tape's authenticity has been verified by experts and it was aired by the major Brazilian television stations. A Congressional special commission was proposed by non-government parties so the denunciation could be investigated. The government succeeded in stopping the creation of the commission . After the Post Office scandal been exposed, the Brazilian Congress proposed the creation of a Congress' special commission, so it could be investigated by the Parliament. The government, however, protested against it, arguing that political adversaries were anticipating the dispute to the next election for Brazil's Presidency. Workers' Party senator Eduardo Suplicy protested in Senate against his party decision. Because that he was very criticized and he got subject to punishment by the Workers' Party. After Jefferson's denunciation the focus of the scandal moved to the government and the ruling Workers' Party. Because the government were under pressure, the Workers' Party changed his earlier decision of stopping the creation of a Congress' special commission for the Post Office scandal. The proposal for the creation of a Congress' special commission for the Post Office scandal was approved. On June 9, there was the first meeting of members of the Congress' special commission for the Post Office scandal. Because of unsolved disputes between government's parliamentarians and the other parties representatives , the meeting could not continue. The government's block argued that it must choose the president and the report for the commission, since the government commission members are the majority. Other parties argue that according to Parliament tradition the government should choose one member for the presidency or report and the opposition should choose the other member. A new meeting was scheduled to the next week, on Tuesday, June 14. Besides these scandals, the current Social Security Minister, Romero Juc\u00e1, is accused of having offered seven non-existent farms as guarantee for a financing from the Banco of Amazonia, among other denunciations of misuse of public loans. The current President of Brazilian Central Bank, Henrique Meirelles, is accused of financial fraud among other accusations. Also there is a denunciation of a irregular transference of founds of Central Bank to the construction of a new headquarter for the Workers' Party. Besides the commission to investigate the Post Office scandal, another Congress' special commissions were suggested by non-government members of Brazilian Senate: a commission to investigate the IRB scandal and another one to the investigation of Roberto Jefferson's allegations. Also, it is expected that the Brazilian Courts rule against the earlier government decision of stopping the creation of a commission for the investigation of the alleged Waldomiro Diniz scandal. Repercussions The scandals involving the ruling Workers' Party are receiving a good attention by the public and the media. According to the Senator Pedro Simon (center-left, PMDB), an old member of Senate, one reason is because that one of the mains Workers' Party mottos was the fight against corruption. But after Lula became President on 2003, the government and the Workers' Party has been envolved in a series of severe scandals and the government has tried to stop the investigations, which is suspicious. Besides that, all scandals originated inside the government, according to Simon. The Waldomiro and the Post Office scandals emerged after the denunciations of people supposedly under pressure and involved in these scandals. Part of opposition avoids talking about impeachment. According to the governor of Minas Gerais, A\u00e9cio Neves (left, PSDB), \"President Lula is not President Collor\". President Fernando Collor de Mello was submitted to a impeachment process in 1992 because of alleged denounciations of corruption in his government. At present time, there is a general consensus that Lula will have to work hard if he wishes to get re-elected .", "edit_actions": [{"type": "R", "before": "denounciation", "after": "denunciation", "start_char_pos": 507, "end_char_pos": 520}, {"type": "R", "before": "stoping", "after": "stopping", "start_char_pos": 572, "end_char_pos": 579}, {"type": "R", "before": "comissition", "after": "commission", "start_char_pos": 600, "end_char_pos": 611}, {"type": "R", "before": "antecipating", "after": "anticipating", "start_char_pos": 872, "end_char_pos": 884}, {"type": "R", "before": "denountiation", "after": "denunciation", "start_char_pos": 1140, "end_char_pos": 1153}, {"type": "R", "before": "representants", "after": "representatives", "start_char_pos": 1724, "end_char_pos": 1737}, {"type": "R", "before": "opposion", "after": "opposition", "start_char_pos": 2065, "end_char_pos": 2073}, {"type": "R", "before": "finantial", "after": "financial", "start_char_pos": 2495, "end_char_pos": 2504}, {"type": "R", "before": "comissition", "after": "commission", "start_char_pos": 2696, "end_char_pos": 2707}, {"type": "R", "before": "envolving", "after": "involving", "start_char_pos": 3187, "end_char_pos": 3196}, {"type": "R", "before": "denountiations", "after": "denunciations", "start_char_pos": 3814, "end_char_pos": 3828}, {"type": "R", "before": "submited", "after": "submitted", "start_char_pos": 4100, "end_char_pos": 4108}, {"type": "A", "before": null, "after": ".", "start_char_pos": 4319, "end_char_pos": 4319}], "sents_char_pos": [0, 248, 311, 425, 543, 613, 784, 942, 1029, 1121, 1233, 1413, 1519, 1634, 1771, 1928, 2105, 2172, 2411, 2535, 2683, 2964, 3159, 3282, 3465, 3671, 3752, 3896, 3949, 4060, 4208]} {"doc_id": "116308", "revision_depth": "1", "before_revision": "Anders Fogh Rasmussen at Davos in 2008 Anders Fogh Rasmussen , the Prime Minister of Denmark, said on Tuesday that he will seek broad parliamentary support for a national referendum on joining the euro , the common currency of the Eurozone . Berlingske Tidende is reporting that Rasmussen is meeting with political leaders to negotiate support for the referendum. In 1992, Danish voters rejected the Maastrict Treaty in a referendum . It was only able to pass the following year after the Edinburgh Agreement granted Denmark an opt-out of the third stage of the Economic and Monetary Union of the European Union (EMU). In 2000, Denmark again rejected the common currency in a euro referendum . The current currency of the Scandinavian country is the Danish krone . As part of stage two of the EMU, the exchange rate of the krone is allowed to fluctuate within a \u00b12.25\\% range to the euro. In order to maintain this peg Danmarks Nationalbank, the central bank , adjusts interest rates and performs foreign exchange operations by buying and selling currency. To do this, Danmarks Nationalbank has had to raise rates twice, even as other central banks, including the European Central Bank (ECB), were lowering rates to deal with the current economic crisis . Euro banknotes As a result, interest rates in Denmark are now 175 basis points higher than the ECB's rates. As recently as May, the difference was only 25 basis points. Rasmussen heads the Venstre party which leads a minority coalition government. The main opposition party, the Social Democrats , also support adopting the euro as the nation's currency. Rasmussen has said he wants a referendum put before voters before 2011. His government had originally planned to hold a referendum this past September to abolish the EMU opt-outs, but that was scrapped when Ireland voted down the Treaty of Lisbon . On October 30, while in Stockholm , Sweden, Rasmussen said: \"The euro ensures political and economical stability in Europe and the current financial turmoil makes it evident that Denmark has to join the Euro.\" Analysts consulted by Berlingske Tidende have said that an endorsement from the Socialist People's Party (SF) could prove to be the tide-turner. \"If there was a vote, then I would vote Yes. But I am of the opinion that it is stupid to hold a vote unless we first have a real debate. We haven't had a debate in eight years and all arguments need to be tested,\" said Margrete Auken of SF. ", "after_revision": "Anders Fogh Rasmussen at Davos in 2008 , the Prime Minister of Denmark, said on Tuesday that he will seek broad parliamentary support for a national referendum on joining the , the common currency of the . is reporting that Rasmussen is meeting with political leaders to negotiate support for the referendum. In 1992, Danish voters rejected the in a . It was only able to the following year after the granted Denmark an opt-out of the third stage of the (EMU). In 2000, Denmark again rejected the common currency in a . The current currency of the country is the . As part of of the EMU, the exchange rate of the krone is allowed to fluctuate within a \u00b12.25\\% range to the euro. In order to maintain this peg , the , adjusts interest rates and performs foreign exchange operations by buying and selling currency. To do this, Danmarks Nationalbank has had to raise rates twice, even as other central banks, including the European Central Bank (ECB), were lowering rates to deal with the . Euro banknotes As a result, interest rates in Denmark are now 175 higher than the ECB's rates. As recently as May, the difference was only 25 basis points. Rasmussen heads the which leads a minority coalition government. The main opposition party, the , also support adopting the euro as the nation's currency. Rasmussen has said he wants a referendum put before voters before 2011. His government had originally planned to hold a referendum this past September to abolish the EMU opt-outs, but that was scrapped when Ireland voted down the . On October 30, while in , Sweden, Rasmussen said: \"The euro ensures political and economical stability in Europe and the current financial turmoil makes it evident that Denmark has to join the Euro.\" Analysts consulted by have said that an endorsement from the (SF) could prove to be the tide-turner. \"If there was a vote, then I would vote Yes. But I am of the opinion that it is stupid to hold a vote unless we first have a real debate. We haven't had a debate in eight years and all arguments need to be tested,\" said of SF. Sister links", "edit_actions": [{"type": "D", "before": "Anders Fogh Rasmussen", "after": null, "start_char_pos": 39, "end_char_pos": 60}, {"type": "D", "before": "euro", "after": null, "start_char_pos": 197, "end_char_pos": 201}, {"type": "D", "before": "Eurozone", "after": null, "start_char_pos": 231, "end_char_pos": 239}, {"type": "D", "before": "Berlingske Tidende", "after": null, "start_char_pos": 242, "end_char_pos": 260}, {"type": "R", "before": "Maastrict Treaty in a referendum", "after": "in a", "start_char_pos": 400, "end_char_pos": 432}, {"type": "D", "before": "pass", "after": null, "start_char_pos": 455, "end_char_pos": 459}, {"type": "D", "before": "Edinburgh Agreement", "after": null, "start_char_pos": 489, "end_char_pos": 508}, {"type": "D", "before": "Economic and Monetary Union of the European Union", "after": null, "start_char_pos": 562, "end_char_pos": 611}, {"type": "D", "before": "euro referendum", "after": null, "start_char_pos": 676, "end_char_pos": 691}, {"type": "D", "before": "Scandinavian", "after": null, "start_char_pos": 722, "end_char_pos": 734}, {"type": "D", "before": "Danish krone", "after": null, "start_char_pos": 750, "end_char_pos": 762}, {"type": "D", "before": "stage two", "after": null, "start_char_pos": 776, "end_char_pos": 785}, {"type": "D", "before": "Danmarks Nationalbank, the central bank", "after": null, "start_char_pos": 919, "end_char_pos": 958}, {"type": "A", "before": null, "after": "the ,", "start_char_pos": 961, "end_char_pos": 961}, {"type": "D", "before": "current economic crisis", "after": null, "start_char_pos": 1231, "end_char_pos": 1254}, {"type": "D", "before": "basis points", "after": null, "start_char_pos": 1323, "end_char_pos": 1335}, {"type": "D", "before": "Venstre party", "after": null, "start_char_pos": 1446, "end_char_pos": 1459}, {"type": "D", "before": "Social Democrats", "after": null, "start_char_pos": 1536, "end_char_pos": 1552}, {"type": "D", "before": "Treaty of Lisbon", "after": null, "start_char_pos": 1842, "end_char_pos": 1858}, {"type": "D", "before": "Stockholm", "after": null, "start_char_pos": 1885, "end_char_pos": 1894}, {"type": "D", "before": "Berlingske Tidende", "after": null, "start_char_pos": 2093, "end_char_pos": 2111}, {"type": "D", "before": "Socialist People's Party", "after": null, "start_char_pos": 2151, "end_char_pos": 2175}, {"type": "D", "before": "Margrete Auken", "after": null, "start_char_pos": 2436, "end_char_pos": 2450}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 2458, "end_char_pos": 2458}], "sents_char_pos": [0, 241, 363, 434, 618, 693, 764, 888, 1057, 1364, 1425, 1504, 1611, 1683, 1860, 2070, 2215, 2260, 2353]} {"doc_id": "1173", "revision_depth": "1", "before_revision": "Aging KC135 tankers, shown here refueling an F16, were to be replaced by Boeing's 767 tanker. Emails exchanged among United States Air Force officials regarding a USD$23 billion dollar deal with aircraft manufacturer Boeing have been entered into the public record. Senator John McCain (R-AZ ) entered them into the Congressional Record during a speech last week against the now-cancelled deal to lease 100 mid-air tanker aircraft from Boeing. Congressional lawmakers rejected the proposal in October, although industry experts say the deal had been killed by the Pentagon because of reports stating that the deal had favored Boeing. Senator McCain has been the deal's most vocal critic. The original negotiations with Boeing were over a no-bid contract . Such contracts are often justified by the speed they offer, eliminating a preliminary bid and selection round that may last months. However, no-bid contracts are only open to the company selected by the procuring agency. This leaves no-bid contracts open to accusations of conflicts of interest among the procurement personnel. Such accusations have previously been leveled against Vice President Dick Cheney for a no-bid contract to Halliburton , and are now being made against senior Air Force officials for choosing Boeing to replace its tanker fleet. In the released emails, Air Force officials responsible for the awarding of contracts appear biased against Boeing's main competitor, Airbus and its CEO Ralph Crosby . Airbus is owned by European Aeronautic Defense & Space Company (EADS). Airbus manufacturers a number of passenger and military aircraft and has gained market share in passenger aircraft over Boeing in recent years. The following is a sequential email exchange regarding Airbus as recorded in the Congressional Record: Special Asst. to the Secretary and Director of Air Force Communications Bill Bodie: \"We don't have to turn the other cheek, you know. I'm ready to tell the truth about Airbus's boom, footprint, and financial shortcoming. But maybe we should sleep on it.\" Secretary of the Air Force James Roche: \"No, Sir, save it and blow him away. He admits that they were not technically qualified! And, we keep their record of bribes as our trump card! Jim.\" Civilian Deputy Undersecretary of the Air Force for Acquisition Darleen Druyun: \"I read with disgust the article on Airbus tankers from the new EADS CEO of North America. What BS . . . should not have been surprised at the slime . . . his day of reckoning will come hopefully.\" Secretary of the Air Force James Roche: \"Oy. I agree. I had hoped you would have stayed and tortured him slowly over the next few years until EADS got rid of him! Jim.\" Boeing had previously hired Civilian Deputy Undersecretary of the Air Force for Acquisition Darleen Druyun . This caused a controversy over conflict of interest and led to felony charges against Boeing Chief Financial Officer Michael Sears for illegally hiring her. Former military personnel are often hired by defense contractors to lobby for contracts. Days after Sen. McCain's remarks, the Air Force said the tanker replacement contract would be revived as an open bid . Deputy Defense Secretary Wolfowitz published an open-article in the Congressional Record, saying: \"After we have selected an appropriate alternative, we intend to require competition.\"", "after_revision": "Aging KC135 tankers, shown here refueling an F16, were to be replaced by Boeing's 767 tanker. Emails exchanged among officials regarding a USD$23 billion dollar deal with aircraft manufacturer have been entered into the public record. (-AZ ) entered them into the during a speech last week against the now-cancelled deal to lease 100 aircraft from Boeing. Congressional lawmakers rejected the proposal in October, although industry experts say the deal had been killed by the because of reports stating that the deal had favored Boeing. Senator McCain has been the deal's most vocal critic. The original negotiations with Boeing were over a . Such contracts are often justified by the speed they offer, eliminating a preliminary bid and selection round that may last months. However, no-bid contracts are only open to the company selected by the procuring agency. This leaves no-bid contracts open to accusations of among the procurement personnel. Such accusations have previously been leveled against Vice President for a no-bid contract to , and are now being made against senior Air Force officials for choosing Boeing to replace its tanker fleet. In the released emails, Air Force officials responsible for the awarding of contracts appear biased against Boeing's main competitor, and its . is owned by European Aeronautic Defense & Space Company (EADS). Airbus manufacturers a number of passenger and military aircraft and has gained market share in passenger aircraft over Boeing in recent years. The following is a sequential email exchange regarding Airbus as recorded in the Congressional Record: Special Asst. to the Secretary and Director of Air Force Communications Bill Bodie: \"We don't have to turn the other cheek, you know. I'm ready to tell the truth about Airbus's boom, footprint, and financial shortcoming. But maybe we should sleep on it.\" Secretary of the Air Force James Roche: \"No, Sir, save it and blow him away. He admits that they were not technically qualified! And, we keep their record of bribes as our trump card! Jim.\" Civilian Deputy Undersecretary of the Air Force for Acquisition Darleen Druyun: \"I read with disgust the article on Airbus tankers from the new EADS CEO of North America. What BS . . . should not have been surprised at the slime . . . his day of reckoning will come hopefully.\" Secretary of the Air Force James Roche: \"Oy. I agree. I had hoped you would have stayed and tortured him slowly over the next few years until EADS got rid of him! Jim.\" Boeing had previously hired Civilian Deputy Undersecretary of the Air Force for Acquisition . This caused a controversy over conflict of interest and led to felony charges against Boeing Chief Financial Officer Michael Sears for illegally hiring her. Former military personnel are often hired by defense contractors to lobby for contracts. Days after Sen. McCain's remarks, the Air Force said the tanker replacement contract would be revived as an . Deputy Defense Secretary published an open-article in the Congressional Record, saying: \"After we have selected an appropriate alternative, we intend to require competition.\"", "edit_actions": [{"type": "D", "before": "United States Air Force", "after": null, "start_char_pos": 117, "end_char_pos": 140}, {"type": "D", "before": "Boeing", "after": null, "start_char_pos": 217, "end_char_pos": 223}, {"type": "R", "before": "Senator John McCain (R-AZ", "after": "(-AZ", "start_char_pos": 266, "end_char_pos": 291}, {"type": "D", "before": "Congressional Record", "after": null, "start_char_pos": 316, "end_char_pos": 336}, {"type": "D", "before": "mid-air tanker", "after": null, "start_char_pos": 407, "end_char_pos": 421}, {"type": "D", "before": "Pentagon", "after": null, "start_char_pos": 564, "end_char_pos": 572}, {"type": "D", "before": "no-bid contract", "after": null, "start_char_pos": 738, "end_char_pos": 753}, {"type": "D", "before": "conflicts of interest", "after": null, "start_char_pos": 1029, "end_char_pos": 1050}, {"type": "D", "before": "Dick Cheney", "after": null, "start_char_pos": 1153, "end_char_pos": 1164}, {"type": "D", "before": "Halliburton", "after": null, "start_char_pos": 1190, "end_char_pos": 1201}, {"type": "R", "before": "Airbus and its CEO Ralph Crosby", "after": "and its", "start_char_pos": 1445, "end_char_pos": 1476}, {"type": "D", "before": "Airbus", "after": null, "start_char_pos": 1479, "end_char_pos": 1485}, {"type": "D", "before": "Darleen Druyun", "after": null, "start_char_pos": 2781, "end_char_pos": 2795}, {"type": "D", "before": "open bid", "after": null, "start_char_pos": 3152, "end_char_pos": 3160}, {"type": "D", "before": "Wolfowitz", "after": null, "start_char_pos": 3188, "end_char_pos": 3197}], "sents_char_pos": [0, 93, 265, 443, 633, 687, 755, 887, 976, 1083, 1310, 1478, 1549, 1693, 1930, 2017, 2051, 2128, 2180, 2241, 2412, 2519, 2573, 2688, 2797, 2954, 3043, 3059]} {"doc_id": "118238", "revision_depth": "1", "before_revision": "Map of Cagayan showing the location of Ballesteros , site of the Philippine maritime disaster. At least 28 people drowned and were confirmed dead, 46 were rescued, while 34 others remain missing on Sunday, after an overcrowded passenger motorboat capsized off waters in Ballesteros , a town of 17,000 people, the Cagayan police reported. 'M/B Mae Jan', a wooden-hulled ferry , was carrying 102 passengers, after an eight-hour voyage from Calayan Island in the Luzon Strait for Appari when it capsized less than 300 meters (984 feet) from its destination, at 8:30 p.m. Its bamboo outrigger broke due to strong waves, as it reached the mouth of the Cagayan River ('Bannag' Rio Grande de Cagayan, 'Ilog ng Kagayan'), along Barangay Linao, about 50 meters from the shoreline of Pallog village. Divers from the combined teams of the Philippine Navy and Coast Guard helped in the rescue operations. 11 of the fatalities, including the vessel owner, Arellano, and her daughter were identified. The police said \"there was a possibility that the boat was overloaded,\" saying that \"there was also livestock on board.\" Due to \"trauma,\" the ferry's captain refused to talk to police. The Pinacanauan River, seen just below the Callao Caves , is one of the major tributaries of the Cagayan River. Meanwhile, the Philippine Coast Guard (PCG) formed a Special Board of Marine Inquiry (SBMI) to investigate the sea tragedy. It ordered the \"immediate dispatch of SAR-003 and MCS-3005 vessels and the PCG Islander for aerial surveillance.\" PCG noted the possible overloading of the vessel since the boat's franchise authorized it to carry only 40 passengers and 10 crew members. In November, a vessel sank in rough seas north of Cagayan, and passing vessels rescued 16 of 20 passengers. Weeks earlier, separate storms sank two passenger vessels in the central Philippines , drowning more than 50 people. Prior to the ferry sinking, the Philippine weather bureau had issued Gale warnings to coastal towns , of approaching tropical storm \"Ulysses\" (international codename: Dolphin) from the Pacific with winds of up to 60 miles (95 kilometers) per hour, centered off southeastern Catanduanes , eastern Philippines.", "after_revision": "Map of showing the location of , site of the Philippine maritime disaster. At least 28 people drowned and were confirmed dead, 46 were rescued, while 34 others remain missing on Sunday, after an overcrowded passenger capsized off waters in , a town of 17,000 people, the police reported. 'M/B Mae Jan', a wooden-hulled , was carrying 102 passengers, after an eight-hour voyage from in the for when it capsized less than 300 meters (984 feet) from its destination, at 8:30 p.m. Its broke due to strong waves, as it reached the mouth of the ('Bannag' Rio Grande de Cagayan, 'Ilog ng Kagayan'), along Linao, about 50 meters from the shoreline of Pallog village. Divers from the combined teams of the and helped in the rescue operations. 11 of the fatalities, including the vessel owner, Arellano, and her daughter were identified. The police said \"there was a possibility that the boat was overloaded,\" saying that \"there was also livestock on board.\" Due to \"trauma,\" the ferry's captain refused to talk to police. The Pinacanauan River, seen just below the , is one of the major tributaries of the Cagayan River. Meanwhile, the (PCG) formed a Special Board of Marine Inquiry (SBMI) to investigate the sea tragedy. It ordered the \"immediate dispatch of SAR-003 and MCS-3005 vessels and the PCG Islander for aerial surveillance.\" PCG noted the possible overloading of the vessel since the boat's franchise authorized it to carry only 40 passengers and 10 crew members. In November, a sank in rough seas north of Cagayan, and passing vessels rescued 16 of 20 passengers. Weeks earlier, separate storms sank two passenger vessels in the , drowning more than 50 people. Prior to the ferry sinking, the had issued to , of approaching tropical storm \"Ulysses\" (international codename: Dolphin) from the Pacific with winds of up to 60 miles (95 kilometers) per hour, centered off southeastern , eastern Philippines.", "edit_actions": [{"type": "D", "before": "Cagayan", "after": null, "start_char_pos": 7, "end_char_pos": 14}, {"type": "D", "before": "Ballesteros", "after": null, "start_char_pos": 39, "end_char_pos": 50}, {"type": "D", "before": "motorboat", "after": null, "start_char_pos": 237, "end_char_pos": 246}, {"type": "D", "before": "Ballesteros", "after": null, "start_char_pos": 270, "end_char_pos": 281}, {"type": "D", "before": "Cagayan", "after": null, "start_char_pos": 313, "end_char_pos": 320}, {"type": "D", "before": "ferry", "after": null, "start_char_pos": 369, "end_char_pos": 374}, {"type": "R", "before": "Calayan Island in the Luzon Strait for Appari", "after": "in the for", "start_char_pos": 438, "end_char_pos": 483}, {"type": "D", "before": "bamboo outrigger", "after": null, "start_char_pos": 572, "end_char_pos": 588}, {"type": "D", "before": "Cagayan River", "after": null, "start_char_pos": 647, "end_char_pos": 660}, {"type": "D", "before": "Barangay", "after": null, "start_char_pos": 720, "end_char_pos": 728}, {"type": "R", "before": "Philippine Navy and Coast Guard", "after": "and", "start_char_pos": 828, "end_char_pos": 859}, {"type": "D", "before": "Callao Caves", "after": null, "start_char_pos": 1215, "end_char_pos": 1227}, {"type": "D", "before": "Philippine Coast Guard", "after": null, "start_char_pos": 1299, "end_char_pos": 1321}, {"type": "D", "before": "vessel", "after": null, "start_char_pos": 1676, "end_char_pos": 1682}, {"type": "D", "before": "central Philippines", "after": null, "start_char_pos": 1834, "end_char_pos": 1853}, {"type": "R", "before": "Philippine weather bureau had issued Gale warnings to coastal towns", "after": "had issued to", "start_char_pos": 1918, "end_char_pos": 1985}, {"type": "D", "before": "Catanduanes", "after": null, "start_char_pos": 2160, "end_char_pos": 2171}], "sents_char_pos": [0, 94, 567, 789, 892, 986, 1107, 1171, 1283, 1407, 1660, 1768, 1885]} {"doc_id": "119132", "revision_depth": "1", "before_revision": "Princess Beatrice at an equestrian event in 2005. British royal Princess Beatrice , age 20, has become the victim of thieves, who stole her prized \u00a3 17,000 black 1 Series BMW while she and her police bodyguard were shopping in Devonshire Place in Kensington \u2014 leaving the vehicle's keys in the ignition. The luxury car, which has a personalised number plate and contained some personal items, was a gift from her father, Prince Andrew , for her 17th birthday in 2005. Media reports said that Beatrice was \"extremely embarrassed\" about the theft in a street in the West 1 area, which happened Wednesday just after 9am in London. She later joined her sister, Princess Eugenie , age 18, at a nearby pub. Metropolitan Police said Westminster officers were investigating the reports. BMW 1 Series . The BMW 1 Series (code names E82 and E87,) is a small-luxury car / small family car produced by the German automaker BMW since 2004. The 1 Series is the only vehicle in its class featuring rear-wheel drive and a longitudinally-mounted engine. Princess Beatrice of York (Beatrice Elizabeth Mary; born 8 August 1988) is the elder daughter of Prince Andrew, Duke of York and Sarah, Duchess of York . Thus, she is fifth person and the first female in the line of succession to the thrones of sixteen independent states . When she was born, she was the first princess born into the immediate royal family since Princess Anne in 1950. This is not the first time the Princess suffered a loss. In December, her Norfolk terrier Max went missing in Windsor , but reappeared three weeks later on Saturday, alive and well.", "after_revision": " at an equestrian event in 2005. British royal , age 20, has become the victim of thieves, who stole her prized 17,000 black while she and her police bodyguard were shopping in in \u2014 leaving the vehicle's keys in the ignition. The luxury car, which has a personalised number plate and contained some personal items, was a gift from her father, , for her 17th birthday in 2005. Media reports said that Beatrice was \"extremely embarrassed\" about the theft in a street in the area, which happened Wednesday just after 9am in London. She later joined her sister, , age 18, at a nearby pub. Metropolitan Police said Westminster officers were investigating the reports. . The BMW 1 Series (code names E82 and E87,) is a small-luxury car / small family car produced by the German automaker since 2004. The 1 Series is the only vehicle in its class featuring rear-wheel drive and a engine. (Beatrice Elizabeth Mary; born 8 August 1988) is the elder daughter of and . Thus, she is fifth person and the first female in the to the thrones of . When she was born, she was the first princess born into the immediate royal family since in 1950. This is not the first time the Princess suffered a loss. In December, her Max went missing in , but reappeared three weeks later on Saturday, alive and well.", "edit_actions": [{"type": "D", "before": "Princess Beatrice", "after": null, "start_char_pos": 0, "end_char_pos": 17}, {"type": "D", "before": "Princess Beatrice", "after": null, "start_char_pos": 64, "end_char_pos": 81}, {"type": "D", "before": "\u00a3", "after": null, "start_char_pos": 147, "end_char_pos": 148}, {"type": "D", "before": "1 Series BMW", "after": null, "start_char_pos": 162, "end_char_pos": 174}, {"type": "R", "before": "Devonshire Place in Kensington", "after": "in", "start_char_pos": 227, "end_char_pos": 257}, {"type": "D", "before": "Prince Andrew", "after": null, "start_char_pos": 421, "end_char_pos": 434}, {"type": "D", "before": "West 1", "after": null, "start_char_pos": 564, "end_char_pos": 570}, {"type": "D", "before": "Princess Eugenie", "after": null, "start_char_pos": 657, "end_char_pos": 673}, {"type": "D", "before": "BMW 1 Series", "after": null, "start_char_pos": 779, "end_char_pos": 791}, {"type": "D", "before": "BMW", "after": null, "start_char_pos": 911, "end_char_pos": 914}, {"type": "D", "before": "longitudinally-mounted", "after": null, "start_char_pos": 1006, "end_char_pos": 1028}, {"type": "D", "before": "Princess Beatrice of York", "after": null, "start_char_pos": 1037, "end_char_pos": 1062}, {"type": "R", "before": "Prince Andrew, Duke of York and Sarah, Duchess of York", "after": "and", "start_char_pos": 1134, "end_char_pos": 1188}, {"type": "D", "before": "line of succession", "after": null, "start_char_pos": 1245, "end_char_pos": 1263}, {"type": "D", "before": "sixteen independent states", "after": null, "start_char_pos": 1282, "end_char_pos": 1308}, {"type": "D", "before": "Princess Anne", "after": null, "start_char_pos": 1400, "end_char_pos": 1413}, {"type": "D", "before": "Norfolk terrier", "after": null, "start_char_pos": 1497, "end_char_pos": 1512}, {"type": "D", "before": "Windsor", "after": null, "start_char_pos": 1533, "end_char_pos": 1540}], "sents_char_pos": [0, 49, 303, 467, 627, 700, 778, 793, 926, 1036, 1088, 1190, 1310, 1422, 1479]} {"doc_id": "119485", "revision_depth": "1", "before_revision": "The Foudre - Le TCD Foudre \u00e0 quai \u00e0 l'arsenal de Toulon (avril 2002). Officials say that a French military helicopter with 10 French soldiers, including four crew members and six Special Forces paratroopers, has crashed off the coast of Gabon in west central Africa. The Eurocopter AS 532 Cougar ditched shortly into the Atlantic Ocean after leaving a French naval ship , about 50 kilometres off the coast. Seven French soldiers were killed, two were rescued, and one is still missing, according to a statement issued by President Nicolas Sarkozy's office. According to Libreville Lieutenant Colonel Pascal Carpentier, the ill-fated helicopter crashed Saturday night at 8:08 p.m. (1908 GMT) into Atlantic waters off Nyonie, a small town located between Gabon's capital Libreville and the town of Port-Gentil . It was taking off from the amphibious assault ship La Foudre's naval landing craft transporter cruising 50 kilometers (30 miles) off the Gabonese coast, during a joint training exercise, said Lieutenant Colonel Francois-Marie Gougeon, spokesman for the general staff. A French army Eurocopter AS 532 Cougar helicopter from the landing zone at the Kabul Military Training Center in Kabul, Afghanistan, March 15, 2007. The ship \"set off the alert and arrived at the crash site with rescuers who picked up the injured crew within half an hour. The sea was calm and the wind low at the time of the crash but the night was very dark,\" Lieutenant Gougeon explained, adding that \"search operations will naturally continue all night.\" La Foudre, two helicopters and oil giant Total S.A. 's three vessels, including its sonar and underwater robot joined the rescue effort of the salvage team. \"Divers were deployed to locate the wreckage,\" said Captain Christophe Prazuck, spokesman for the army general staff. \"At daybreak we will deploy all our means, planes, helicopters, boats... to take part in the search,\" said Gabon's Interior Minister Andr\u00e9 Mba Obame . Meanwhile French President Nicolas Sarkozy directed Defence Minister Herv\u00e9 Morin to travel to the crash site. Sarkozy had \"asked that all available means in the area be immediately deployed to find the soldiers who were aboard.\" Morin later announced there would be two probes, a judicial one and another by the French defence ministry , with the assistance of French gendarmes and an air accident expert. Satellite image of Gabon, generated from raster graphics data supplied by The Map Library . Minister Morin arrived in Libreville on Sunday and met with President Omar Bongo to discuss rescue efforts for the missing body of one of the seven soldiers. \"The cause of this tragedy remains unknown. It may be natural or human, or a combination of both.\" Morin said. \"Divers were inspecting the Cougar, which was in water 35 meters (about 115 feet) deep. We will do everything we can to find the last person missing,\" he added. The January 17-21 bilateral manoeuvres called 'Operation N'Gari' involved 600 French soldiers and 120 Gabonese troops maneuvering in the military drill known as Baptise Ngeri. The soldiers were backed by Cougar and Fennec helicopters to coordinate maritime safety operations with UN peacekeepers at Bouna airport, in the Ivory Coast . In the joint exercise soldiers were to be parachuted onto predetermined targets including Nyonie. Gabon, a former French colony, hosts one of four permanent French bases in Africa. Gabon is a country in west central Africa sharing borders with the Gulf of Guinea to the west, Equatorial Guinea to the northwest, and Cameroon to the north, with the Republic of the Congo curving around the east and south. According the FFG which has around 1,000 troops in Gabon, the French Forces in Gabon (FFG)'s role is \"to assure the safety of the 12,000 French residents in the country in case of threat, and carry out aid missions.\"", "after_revision": " - \u00e0 quai \u00e0 l'arsenal de Toulon (avril 2002). Officials say that a French military helicopter with 10 French soldiers, including four crew members and six paratroopers, has crashed off the coast of Gabon in west central Africa. The Cougar ditched shortly into the after leaving a , about 50 kilometres off the coast. Seven French soldiers were killed, two were rescued, and one is still missing, according to a statement issued by President Nicolas Sarkozy's office. According to Libreville Lieutenant Colonel Pascal Carpentier, the ill-fated helicopter crashed Saturday night at 8:08 p.m. (1908 GMT) into Atlantic waters off Nyonie, a small town located between Gabon's capital and the town of . It was taking off from the 's cruising 50 kilometers (30 miles) off the Gabonese coast, during a joint training exercise, said Lieutenant Colonel Francois-Marie Gougeon, spokesman for the general staff. A French army from the landing zone at the Kabul Military Training Center in Kabul, Afghanistan, March 15, 2007. The \"set off the alert and arrived at the crash site with rescuers who picked up the injured crew within half an hour. The sea was calm and the wind low at the time of the crash but the night was very dark,\" Lieutenant Gougeon explained, adding that \"search operations will naturally continue all night.\" La Foudre, two helicopters and oil giant 's three vessels, including its and joined the rescue effort of the salvage team. \"Divers were deployed to locate the wreckage,\" said Captain Christophe Prazuck, spokesman for the army general staff. \"At daybreak we will deploy all our means, planes, helicopters, boats... to take part in the search,\" said Gabon's Interior Minister . Meanwhile Nicolas Sarkozy directed Defence Minister to travel to the crash site. Sarkozy had \"asked that all available means in the area be immediately deployed to find the soldiers who were aboard.\" Morin later announced there would be two probes, a judicial one and another by the , with the assistance of French gendarmes and an air accident expert. Satellite image of Gabon, generated from data supplied by . Minister Morin arrived in on Sunday and met with President to discuss rescue efforts for the missing body of one of the seven soldiers. \"The cause of this tragedy remains unknown. It may be natural or human, or a combination of both.\" Morin said. \"Divers were inspecting the Cougar, which was in water 35 meters (about 115 feet) deep. We will do everything we can to find the last person missing,\" he added. The January 17-21 bilateral manoeuvres called 'Operation N'Gari' involved 600 French soldiers and 120 Gabonese troops maneuvering in the military drill known as Baptise Ngeri. The soldiers were backed by Cougar and to coordinate maritime safety operations with UN peacekeepers at airport, in the . In the joint exercise soldiers were to be parachuted onto predetermined targets including Nyonie. Gabon, a former French colony, hosts one of four permanent French bases in Africa. Gabon is a country in west central Africa sharing borders with the to the west, Equatorial Guinea to the northwest, and Cameroon to the north, with the Republic of the Congo curving around the east and south. According the FFG which has around 1,000 troops in Gabon, the in Gabon (FFG)'s role is \"to assure the safety of the 12,000 French residents in the country in case of threat, and carry out aid missions.\"", "edit_actions": [{"type": "D", "before": "The Foudre", "after": null, "start_char_pos": 0, "end_char_pos": 10}, {"type": "D", "before": "Le TCD Foudre", "after": null, "start_char_pos": 13, "end_char_pos": 26}, {"type": "D", "before": "Special Forces", "after": null, "start_char_pos": 179, "end_char_pos": 193}, {"type": "D", "before": "Eurocopter AS 532", "after": null, "start_char_pos": 271, "end_char_pos": 288}, {"type": "D", "before": "Atlantic Ocean", "after": null, "start_char_pos": 321, "end_char_pos": 335}, {"type": "D", "before": "French naval ship", "after": null, "start_char_pos": 352, "end_char_pos": 369}, {"type": "D", "before": "Libreville", "after": null, "start_char_pos": 769, "end_char_pos": 779}, {"type": "D", "before": "Port-Gentil", "after": null, "start_char_pos": 796, "end_char_pos": 807}, {"type": "R", "before": "amphibious assault ship La Foudre's naval landing craft transporter", "after": "'s", "start_char_pos": 837, "end_char_pos": 904}, {"type": "D", "before": "Eurocopter AS 532 Cougar helicopter", "after": null, "start_char_pos": 1092, "end_char_pos": 1127}, {"type": "D", "before": "ship", "after": null, "start_char_pos": 1231, "end_char_pos": 1235}, {"type": "D", "before": "Total S.A.", "after": null, "start_char_pos": 1578, "end_char_pos": 1588}, {"type": "R", "before": "sonar and underwater robot", "after": "and", "start_char_pos": 1621, "end_char_pos": 1647}, {"type": "D", "before": "Andr\u00e9 Mba Obame", "after": null, "start_char_pos": 1945, "end_char_pos": 1960}, {"type": "D", "before": "French President", "after": null, "start_char_pos": 1973, "end_char_pos": 1989}, {"type": "D", "before": "Herv\u00e9 Morin", "after": null, "start_char_pos": 2032, "end_char_pos": 2043}, {"type": "D", "before": "French defence ministry", "after": null, "start_char_pos": 2275, "end_char_pos": 2298}, {"type": "D", "before": "raster graphics", "after": null, "start_char_pos": 2410, "end_char_pos": 2425}, {"type": "D", "before": "The Map Library", "after": null, "start_char_pos": 2443, "end_char_pos": 2458}, {"type": "D", "before": "Libreville", "after": null, "start_char_pos": 2487, "end_char_pos": 2497}, {"type": "D", "before": "Omar Bongo", "after": null, "start_char_pos": 2531, "end_char_pos": 2541}, {"type": "D", "before": "Fennec helicopters", "after": null, "start_char_pos": 3106, "end_char_pos": 3124}, {"type": "D", "before": "Bouna", "after": null, "start_char_pos": 3190, "end_char_pos": 3195}, {"type": "D", "before": "Ivory Coast", "after": null, "start_char_pos": 3212, "end_char_pos": 3223}, {"type": "D", "before": "Gulf of Guinea", "after": null, "start_char_pos": 3474, "end_char_pos": 3488}, {"type": "D", "before": "French Forces", "after": null, "start_char_pos": 3693, "end_char_pos": 3706}], "sents_char_pos": [0, 69, 266, 406, 556, 809, 1077, 1226, 1350, 1536, 1693, 1811, 2072, 2191, 2368, 2460, 2618, 2662, 2717, 2729, 2817, 2890, 3066, 3225, 3323, 3406, 3630]} {"doc_id": "119533", "revision_depth": "1", "before_revision": "__NOTOC__ Today, the official ceremony ushering in Barack H. Obama II as the new president of the United States took place at the United States Capitol in Washington, D.C.. A 21-gun salute , as well as the playing of four ruffles and flourishes and \" Hail to the Chief \", marked the moment he assumed power from his predecessor, George W. Bush. President Barack Obama being sworn in at the inauguration Bush's second term as President of the United States , which began on January 20, 2005, expired with the swearing-in of the 44th President of the United States , Barack Obama, at noon EST (UTC-5 ), under the provisions of the Twentieth Amendment to the United States Constitution . Pope Benedict XVI on Tuesday called on Obama to seek \"understanding, co-operation and peace\" among nations. \"I offer cordial good wishes, together with the assurance of my prayers that Almighty God will grant you unfailing wisdom and strength in the exercise of your high responsibilities,\" the Pontiff said. The National Mall gates at the inaugural ceremony opened early, with official introductions beginning around 11:30am EST. On the west front lawn of the U.S. Capitol, Senator Dianne Feinstein provided the call to order and welcoming remarks, shortly after followed by invocation by the Rev. Rick Warren and a musical performance by Aretha Franklin. Vice President-elect Joseph R. Biden, Jr., a Democrat , who was elected Vice President in the 2008 presidential election , took his oath of office, succeeding Dick Cheney . Biden took his oath at 11:57am EST from Associate Justice John Paul Stevens . U.S. service members prepare for the 56th United States presidential inauguration rehearsal in the west steps of the United States Capitol Washington, D.C., Jan. 11, 2009. Supreme Court Chief Justice John Glover Roberts, Jr. then administered the oath of office to Obama, under Article II, Section 1, Clause 8. \"I do solemnly swear (or affirm) that I will faithfully execute the office of President of the United States, and will to the best of my ability, preserve, protect, and defend the Constitution of the United States. So help me God,\" Obama swore, using the 1861 President Lincoln Inaugural Bible. First Lady Michelle LaVaughn Robinson Obama and daughters Malia Ann and Sasha, Senate Majority Leader Harry Reid, and Speaker of the House Nancy Pelosi were among the record-setting crowd of over 2 million people, including more than a million people that filled the National Mall. Vice President Dick Cheney arrived in a wheelchair, having pulled a muscle in his back while moving, White House spokeswoman Dana Perino said. Obama has decided to follow tradition and use his full name, including his middle name Hussein , regardless of its past and present use by detractors as an effort to slander his image. The advanced scheduled program stated that the inaugural address was to be delivered by \"the President of the United States, The Honorable Barack H. Obama.\" Obama focused on the restoration of public confidence and personal \"responsibility,\" reassuring recession-weary Americans they can rebound from hard times. He conveyed to the world his desire to fix a battered U.S. image overseas. He asked the nation to reject the \"culture of anything goes\" and to restore a national value system that honors responsibility and accountability. Elizabeth Alexander recited a poem, followed by the benediction by Rev. Joseph E. Lowery. The National Anthem was thereafter played by The United States Navy Band \" Sea Chanters .\" Over 200 million viewers worldwide had watched inauguration videos and live streams provided online by a number of news organizations and online video broadcasting companies over the internet. The event was also available live to select iPhone users. At 2:35pm EST in the Capitol's Statuary Hall , at the inaugural luncheon attended by Obama, it is reported that Ted Kennedy had a stroke. Paramedics arrived and took the senator to a hospital. A parade extended for over two hours in the afternoon. It included 15,000 people, 240 horses, dozens of marching bands, two drum and bugle corps, and one mariachi band from Espanola, New Mexico . Just after 4pm EST, Obama and his wife joined the celebrating crowds on Pennsylvania Avenue. After a short time waving to the masses, they returned to the Presidential Limousine, a 2009 Cadillac, which transported them to the White House . The First Limo has replaced President Bush \u2019s Cadillac DTS Presidential Limousine that rolled out in 2004. Mr and Mrs Obama plan to attend a total of ten official inaugural balls, including the Neighbourhood Ball, the Obama Home States (Illinois and Hawaii) Ball, the Biden Home States (Pennsylvania and Delaware) Ball and the Youth Ball. American R&B singer-songwriter Beyonc\u00e9 has been planned to perform the first dance song. The Obamas will return to the White House, their new home, following the last ball.", "after_revision": "__NOTOC__ Today, the ushering in Barack H. Obama II as the new president of the United States took place at the in Washington, D.C.. A , as well as the playing of four and \" \", marked the moment he assumed power from his predecessor, George W. Bush. President Barack Obama being sworn in at the inauguration Bush's second term as , which began on January 20, 2005, expired with the of the , Barack Obama, at noon ( ), under the provisions of the . on Tuesday called on Obama to seek \"understanding, co-operation and peace\" among nations. \"I offer cordial good wishes, together with the assurance of my prayers that Almighty God will grant you unfailing wisdom and strength in the exercise of your high responsibilities,\" the Pontiff said. The gates at the inaugural ceremony opened early, with official introductions beginning around 11:30am EST. On the west front lawn of the U.S. Capitol, Senator provided the call to order and welcoming remarks, shortly after followed by invocation by the Rev. and a musical performance by Aretha Franklin. Vice President-elect Joseph R. Biden, Jr., a , who was elected Vice President in the , took his oath of office, succeeding . Biden took his oath at 11:57am EST from . U.S. service members prepare for the 56th rehearsal in the west steps of the Washington, D.C., Jan. 11, 2009. then administered the to Obama, under . \"I do solemnly swear (or affirm) that I will faithfully execute the office of President of the United States, and will to the best of my ability, preserve, protect, and defend the Constitution of the United States. So help me God,\" Obama swore, using the 1861 President Lincoln Inaugural Bible. and daughters , , and Nancy Pelosi were among the record-setting crowd of over 2 million people, including more than a million people that filled the National Mall. Vice President Dick Cheney arrived in a wheelchair, having pulled a muscle in his back while moving, White House spokeswoman said. Obama has decided to follow tradition and use his full name, including his middle name , regardless of its past and present use by detractors as an effort to slander his image. The advanced scheduled program stated that the inaugural address was to be delivered by \"the President of the United States, The Honorable Barack H. Obama.\" Obama focused on the restoration of public confidence and personal \"responsibility,\" reassuring recession-weary Americans they can rebound from hard times. He conveyed to the world his desire to fix a battered U.S. image overseas. He asked the nation to reject the \"culture of anything goes\" and to restore a national value system that honors responsibility and accountability. recited a poem, followed by the benediction by Rev. . The National Anthem was thereafter played by The United States Navy Band \" .\" Over 200 million viewers worldwide had watched inauguration videos and live streams provided online by a number of news organizations and online video broadcasting companies over the internet. The event was also available live to select users. At 2:35pm EST in the Capitol's , at the inaugural luncheon attended by Obama, it is reported that had a stroke. Paramedics arrived and took the senator to a hospital. A parade extended for over two hours in the afternoon. It included 15,000 people, 240 horses, dozens of marching bands, two drum and bugle corps, and one mariachi band from , . Just after 4pm EST, Obama and his wife joined the celebrating crowds on Pennsylvania Avenue. After a short time waving to the masses, they returned to the Presidential Limousine, a 2009 Cadillac, which transported them to the . The First Limo has replaced President Bush 's Presidential Limousine that rolled out in 2004. Mr and Mrs Obama plan to attend a total of ten official inaugural balls, including the Neighbourhood Ball, the Obama Home States (Illinois and Hawaii) Ball, the Biden Home States (Pennsylvania and Delaware) Ball and the Youth Ball. American R&B singer-songwriter has been planned to perform the first dance song. The Obamas will return to the White House, their new home, following the last ball.", "edit_actions": [{"type": "D", "before": "official ceremony", "after": null, "start_char_pos": 21, "end_char_pos": 38}, {"type": "D", "before": "United States Capitol", "after": null, "start_char_pos": 130, "end_char_pos": 151}, {"type": "D", "before": "21-gun salute", "after": null, "start_char_pos": 175, "end_char_pos": 188}, {"type": "R", "before": "ruffles and flourishes and", "after": "and", "start_char_pos": 222, "end_char_pos": 248}, {"type": "D", "before": "Hail to the Chief", "after": null, "start_char_pos": 251, "end_char_pos": 268}, {"type": "D", "before": "President of the United States", "after": null, "start_char_pos": 425, "end_char_pos": 455}, {"type": "R", "before": "swearing-in of the 44th President of the United States", "after": "of the", "start_char_pos": 508, "end_char_pos": 562}, {"type": "R", "before": "EST (UTC-5", "after": "(", "start_char_pos": 587, "end_char_pos": 597}, {"type": "D", "before": "Twentieth Amendment to the United States Constitution", "after": null, "start_char_pos": 629, "end_char_pos": 682}, {"type": "D", "before": "Pope Benedict XVI", "after": null, "start_char_pos": 685, "end_char_pos": 702}, {"type": "D", "before": "National Mall", "after": null, "start_char_pos": 998, "end_char_pos": 1011}, {"type": "D", "before": "Dianne Feinstein", "after": null, "start_char_pos": 1168, "end_char_pos": 1184}, {"type": "D", "before": "Rick Warren", "after": null, "start_char_pos": 1284, "end_char_pos": 1295}, {"type": "D", "before": "Democrat", "after": null, "start_char_pos": 1387, "end_char_pos": 1395}, {"type": "D", "before": "2008 presidential election", "after": null, "start_char_pos": 1436, "end_char_pos": 1462}, {"type": "D", "before": "Dick Cheney", "after": null, "start_char_pos": 1501, "end_char_pos": 1512}, {"type": "D", "before": "Associate Justice John Paul Stevens", "after": null, "start_char_pos": 1555, "end_char_pos": 1590}, {"type": "D", "before": "United States presidential inauguration", "after": null, "start_char_pos": 1635, "end_char_pos": 1674}, {"type": "D", "before": "United States Capitol", "after": null, "start_char_pos": 1710, "end_char_pos": 1731}, {"type": "D", "before": "Supreme Court Chief Justice John Glover Roberts, Jr.", "after": null, "start_char_pos": 1765, "end_char_pos": 1817}, {"type": "D", "before": "oath of office", "after": null, "start_char_pos": 1840, "end_char_pos": 1854}, {"type": "R", "before": "Article II, Section 1, Clause 8.", "after": ".", "start_char_pos": 1871, "end_char_pos": 1903}, {"type": "R", "before": "First Lady Michelle LaVaughn Robinson Obama and daughters Malia Ann and Sasha, Senate Majority Leader Harry Reid, and Speaker of the House", "after": "and daughters , , and", "start_char_pos": 2199, "end_char_pos": 2337}, {"type": "D", "before": "Dana Perino", "after": null, "start_char_pos": 2606, "end_char_pos": 2617}, {"type": "D", "before": "Hussein", "after": null, "start_char_pos": 2711, "end_char_pos": 2718}, {"type": "D", "before": "Elizabeth Alexander", "after": null, "start_char_pos": 3344, "end_char_pos": 3363}, {"type": "R", "before": "Joseph E. Lowery.", "after": ".", "start_char_pos": 3416, "end_char_pos": 3433}, {"type": "D", "before": "Sea Chanters", "after": null, "start_char_pos": 3509, "end_char_pos": 3521}, {"type": "D", "before": "iPhone", "after": null, "start_char_pos": 3762, "end_char_pos": 3768}, {"type": "D", "before": "Statuary Hall", "after": null, "start_char_pos": 3807, "end_char_pos": 3820}, {"type": "D", "before": "Ted Kennedy", "after": null, "start_char_pos": 3888, "end_char_pos": 3899}, {"type": "R", "before": "Espanola, New Mexico", "after": ",", "start_char_pos": 4142, "end_char_pos": 4162}, {"type": "D", "before": "White House", "after": null, "start_char_pos": 4391, "end_char_pos": 4402}, {"type": "R", "before": "\u2019s Cadillac DTS", "after": "'s", "start_char_pos": 4448, "end_char_pos": 4463}, {"type": "D", "before": "Beyonc\u00e9", "after": null, "start_char_pos": 4775, "end_char_pos": 4782}], "sents_char_pos": [0, 172, 344, 792, 993, 1115, 1341, 1514, 1764, 2118, 2198, 2480, 2623, 2808, 2965, 3121, 3196, 3343, 3433, 3717, 3775, 3913, 3968, 4023, 4257, 4404, 4511, 4743, 4832]} {"doc_id": "121157", "revision_depth": "1", "before_revision": "Buttonquail distribution map According to ornithologists , a rare Philippines buttonquail feared to have gone extinct was recently documented alive by a cameraman inadvertently filming a local market, right before it was sold and headed for the cooking pot. Scientists had suspected the species\u2014listed as \"data deficient\" on the 2008 International Union for Conservation of Nature's Red List Category \u2014was extinct. Last month, native bird trappers snared and successfully caught the Luzon Buttonquail (Turnix worcesteri or Worcester's buttonquail) in Dalton Pass, a cold and wind-swept bird passageway in the Caraballo Mountains, in Nueva Vizcaya , located between Cordillera Central and Sierra Madre mountain ranges, in Northern Luzon . British birder and WBCP member , Desmond Allen , was watching a January 26 DVD-video of a documentary, Bye-Bye Birdie, when he recognized the bird in a still image of the credits that lasted less than a second. Allen created a screenshot , which was photographed by their birder-companion, Arnel Telesforo, also a WBCP member, in Nueva Vizcaya's poultry market, before it was cooked and eaten. i-Witness: The GMA Documentaries , a Philippine documentary news and public affairs television show aired by GMA Network , had incorporated Telesforo's photographs and video footage of the live bird in the documentary, that was created by the TV crew led by Mr Howie Severino. The Philippine Network had not realized what they filmed until Allen had informed the crew of interesting discovery. Mr Severino and the crew were at that time, in Dalton Pass to film \"akik\", the traditional practice of trapping wild birds with nets by first attracting them with bright lights on moonless nights. \"I'm shocked. I don't know of any other photos of this. No bird watchers have ever given convincing reports that they have seen it at all... This is an exciting discovery,\" said Allen. In 2007, a specimen of the Luzon Buttonquail from the Mountain Province was photographed by the American Field Museum of Natural History in Chicago. The Luzon Buttonquail was only known through an illustration in the authoritative book by Robert S. Kennedy, et al, A Guide to the Birds of the Philippines. This birders \"bible\" includes a drawing based on the skins of dead specimens collected a century ago, whereas the otherwise comprehensive image bank of the Oriental Bird Club does not contain a single image of the Worcester's Buttonquail. \u201cWith the photograph and the promise of more sightings in the wild, we can see the living bill, the eye color, the feathers, rather than just the mushed-up museum skin,\u201d exclaimed Allen, who has been birdwatching for fifty years, fifteen in the Philippines, and has an extensive collection of bird calls on his ipod. He has also spotted the Oriental (or Manchurian) Bush Warbler , another rare bird which he has not seen in the Philippines. \u201cWe are ecstatic that this rarely seen species was photographed by accident. It may be the only photo of this poorly known bird. But I also feel sad that the locals do not value the biodiversity around them and that this bird was sold for only P10 and headed for the cooking pot,\u201d Wild Bird Club of the Philippines (WBCP) president Mike Lu said. \u201cMuch more has to be done in creating conservation awareness and local consciousness about our unique threatened bird fauna. This should be an easy task for the local governments assisted by the DENR . What if this was the last of its species?\u201d Lu added. According to the WBCP, the Worcester\u2019s buttonquail was first described based on specimens bought in Quinta Market in Quiapo, Manila in 1902, and was named after Dean Conant Worcester. Since then just a few single specimens have been photographed and filmed from Nueva Vizcaya and Benguet , and lately, in 2007, from Mountain Province by the Field Museum of Natural History in Chicago, Illinois. Dean Conant Worcester Dean Conant Worcester , D.Sc., F.R.G.S. was an American zoologist , public official, and authority on the Philippines, born at Thetford , Vermont, and educated at the University of Michigan (A.B., 1889). From 1899 to 1901 he was a member of the United States Philippine Commission ; thenceforth until 1913 he served as secretary of the interior for the Philippine Insular Government . In 1910, he founded the Philippine General Hospital , which has become the hospital for the poor and the sick. In October, 2004, at the request of Mr Moises Butic, Lamut CENR Officer, Mr Jon Hornbuckle, of Grove Road, Sheffield , has conducted a short investigation into bird-trapping in Ifugao, Mountain Province, Banaue Mount Polis, Sagada and Dalton Pass, in Nueva Vizcaya. \"Prices ranged from 100 pesos for a Fruit-Dove to 300 pesos for a Metallic Pigeon . Other species that are caught from time to time include Flame-breasted Fruit-Dove and Luzon Bleeding-heart ; on one occasion, around 50 of the latter were trapped! All other trapped birds are eaten,\" said Hornbuckle. \"The main trapping season is November to February. Birds are caught at the lights using butterfly-catching type nets. Quails and Buttonquails were more often shot in the fields at this time, rather than caught, and occasionally included the rare Luzon (Worcester\u2019s) Buttonquail, which is only known from dead specimens, and is a threatened bird species reported from Dalton Pass,\" he added. In August, 1929, Richard C. McGregor and Leon L. Gardner of the Cooper Ornithological Society compiled a book entitled Philippine Bird Traps. The authors described the Luzon Buttonquail as \"very rare,\" having only encountered it twice, once in August and once in September. \"They are caught with a scoop net from the back of a carabao . Filipino hunters snared them, baiting with branches of artificial red peppers made of sealing wax ,\" wrote McGregor and Leon L. Gardner. \"The various ingenious and effectual devices used by Filipinos for bird-trapping include [the] 'Teepee Trap' which consists of a conical tepee, woven of split bamboo and rattan about 3 feet high and 3 feet across at the base, with a fairly narrow entrance. 'Spring Snares ' were also used, where a slip noose fastened to a strongly bent bamboo or other elastic branch, which is released by a trigger, which is usually the perch of the trap,\" their book explained. A passage from the bird-trap book, which explains why Filipinos had eaten these endangered bird species, goes as follows: A global review of threatened species by the International Union for Conservation of Nature (IUCN) indicates drastic decline of animal and plant life. This includes a quarter of all mammals , one out of eight birds, one out of three amphibians and 70 percent of plants. The report, Red List of Threatened Species , is published by IUCN every year. Additionally, a global assessment of the health of the world's species is released once in four years. The data is compiled by 1,700 experts from 130 countries. The key findings of the report were announced at the World Conservation Congress held in Barcelona, Spain. The survey includes 44,838 species of wild fauna and flora , out of which 16,928 species are threatened with extinction. Among the threatened, 3,246 are tagged critically endangered, the highest category of threat. Another 4,770 species are endangered and 8,912 vulnerable to extinction. Map of the Philippines showing the location of Nueva Vizcaya. The Luzon Buttonquail (Turnix worcesteri) is a species of bird in the Turnicidae family. It is endemic to the island of Luzon in the Philippines, where it is known from just six localities thereof. Its natural habitat is subtropical or tropical high-altitude grassland, in the highlands of the Cordillera Central , although records are from 150-1,250 m, and the possibility that it frequents forested (non-grassland) habitats cannot be discounted. The buttonquails or hemipodes are a small family of birds which resemble, but are unrelated to, the true quails . They inhabit warm grasslands in Asia, Africa, and Australia. They are assumed to be intra-island migrants , and breed somewhere in northern Luzon in April-June and that at least some birds disperse southwards in the period July-March. Bird Trap by Bruegel d. \u00c4., Pieter These Turnicidae are small, drab, running birds, which avoid flying. The female is the more brightly coloured of the sexes, and initiates courtship. Unusually, the buttonquails are polyandrous , with the females circulating among several males and expelling rival females from her territory. Both sexes cooperate in building a nest in the earth, but only the male incubates the eggs and tends the young. Called \"Pugo\" ( quail ) by natives, these birds inhabit rice paddies and scrub lands near farm areas because of the abundance of seeds and insects that they feed on regularly. These birds are characterized by their black heads with white spots, a brown or fawn colored body and yellow legs on males and the females are brown with white and black spots. Buttonquails are a notoriously cryptic and unobtrusive family of birds, and the species could conceivably occur in reasonable numbers somewhere. They are included in the 2008 IUCN Red List Category (as evaluated by BirdLife International IUCN Red List of Threatened Species ). They are also considered as Vulnerable species by IUCN and BirdLife International, since these species is judged to have a ten percent chance of going extinct in the next one hundred years.", "after_revision": " distribution map According to , a rare Philippines feared to have gone extinct was recently documented alive by a cameraman inadvertently filming a local market, right before it was sold and headed for the cooking pot. Scientists had suspected the species\u2014listed as \"data deficient\" on the \u2014was extinct. Last month, snared and successfully caught the (Turnix worcesteri or Worcester's buttonquail) in Dalton Pass, a cold and wind-swept bird passageway in the , in , located between and mountain ranges, in Northern . British and WBCP member Desmond Allen was watching a January 26 of a documentary, Bye-Bye Birdie, when he recognized the bird in a of the that lasted less than a second. Allen created a , which was photographed by their birder-companion, Arnel Telesforo, also a WBCP member, in Nueva Vizcaya's poultry market, before it was cooked and eaten. , a Philippine news and public affairs television show aired by , had incorporated Telesforo's photographs and video footage of the live bird in the documentary, that was created by the TV crew led by Mr Howie Severino. The Philippine Network had not realized what they filmed until Allen had informed the crew of interesting discovery. Mr Severino and the crew were at that time, in Dalton Pass to film \"akik\", the traditional practice of trapping wild birds with nets by first attracting them with bright lights on moonless nights. \"I'm shocked. I don't know of any other photos of this. No bird watchers have ever given convincing reports that they have seen it at all... This is an exciting discovery,\" said Allen. In 2007, a specimen of the from the was photographed by the American in Chicago. The Luzon Buttonquail was only known through an illustration in the authoritative book by Robert S. Kennedy, et al, A Guide to the Birds of the Philippines. This birders \"bible\" includes a drawing based on the skins of dead specimens collected a century ago, whereas the otherwise comprehensive of the does not contain a single image of the Worcester's Buttonquail. \u201cWith the photograph and the promise of more sightings in the wild, we can see the living bill, the eye color, the feathers, rather than just the mushed-up museum skin,\u201d exclaimed Allen, who has been birdwatching for fifty years, fifteen in the Philippines, and has an extensive collection of bird calls on his ipod. He has also spotted the , another rare bird which he has not seen in the Philippines. \u201cWe are ecstatic that this rarely seen species was photographed by accident. It may be the only photo of this poorly known bird. But I also feel sad that the locals do not value the around them and that this bird was sold for only P10 and headed for the cooking pot,\u201d Wild Bird Club of the Philippines (WBCP) president Mike Lu said. \u201cMuch more has to be done in creating conservation awareness and local consciousness about our unique threatened bird fauna. This should be an easy task for the local governments assisted by the . What if this was the last of its species?\u201d Lu added. According to the WBCP, the Worcester\u2019s buttonquail was first described based on specimens bought in Quinta Market in , in 1902, and was named after Dean Conant Worcester. Since then just a few single specimens have been photographed and filmed from Nueva Vizcaya and , and lately, in 2007, from by the in Chicago, Illinois. , D.Sc., F.R.G.S. was an American , public official, and authority on the Philippines, born at , Vermont, and educated at the (A.B., 1889). From 1899 to 1901 he was a member of the United States ; thenceforth until 1913 he served as secretary of the interior for the . In 1910, he founded the , which has become the hospital for the poor and the sick. In October, 2004, at the request of Mr Moises Butic, CENR Officer, Mr Jon Hornbuckle, of Grove Road, , has conducted a short investigation into in , Mount Polis, and Dalton Pass, in Nueva Vizcaya. \"Prices ranged from 100 for a to 300 pesos for a . Other species that are caught from time to time include and ; on one occasion, around 50 of the latter were trapped! All other trapped birds are eaten,\" said Hornbuckle. \"The main trapping season is November to February. Birds are caught at the lights using type nets. Quails and Buttonquails were more often shot in the fields at this time, rather than caught, and occasionally included the rare Luzon (Worcester\u2019s) Buttonquail, which is only known from dead specimens, and is a threatened bird species reported from Dalton Pass,\" he added. In August, 1929, Richard C. McGregor and Leon L. Gardner of the compiled a book entitled Philippine Bird Traps. The authors described the Luzon Buttonquail as \"very rare,\" having only encountered it twice, once in August and once in September. \"They are caught with a scoop net from the back of a . Filipino hunters snared them, baiting with branches of artificial red peppers made of ,\" wrote McGregor and Leon L. Gardner. \"The various ingenious and effectual devices used by Filipinos for bird-trapping include [the] 'Teepee Trap' which consists of a conical tepee, woven of split and about 3 feet high and 3 feet across at the base, with a fairly narrow entrance. 'Spring ' were also used, where a slip noose fastened to a strongly bent bamboo or other elastic branch, which is released by a trigger, which is usually the perch of the trap,\" their book explained. A passage from the bird-trap book, which explains why had eaten these endangered bird species, goes as follows: A global review of threatened species by the (IUCN) indicates drastic decline of animal and plant life. This includes a quarter of all , one out of eight birds, one out of three and 70 percent of plants. The report, , is published by IUCN every year. Additionally, a global assessment of the health of the world's species is released once in four years. The data is compiled by 1,700 experts from 130 countries. The key findings of the report were announced at the World Conservation Congress held in Barcelona, Spain. The survey includes 44,838 species of wild and , out of which 16,928 species are threatened with extinction. Among the threatened, 3,246 are tagged critically endangered, the highest category of threat. Another 4,770 species are endangered and 8,912 vulnerable to extinction. Map of the Philippines showing the location of Nueva Vizcaya. The Luzon Buttonquail (Turnix worcesteri) is a species of bird in the family. It is to the island of in the Philippines, where it is known from just six localities thereof. Its natural habitat is subtropical or tropical high-altitude grassland, in the highlands of the , although records are from 150-1,250 m, and the possibility that it frequents forested (non-grassland) habitats cannot be discounted. The or hemipodes are a small family of birds which resemble, but are unrelated to, the true . They inhabit warm grasslands in Asia, Africa, and Australia. They are assumed to be , and breed somewhere in northern Luzon in April-June and that at least some birds disperse southwards in the period July-March. by Bruegel d. \u00c4., Pieter These Turnicidae are small, drab, running birds, which avoid flying. The female is the more brightly coloured of the sexes, and initiates courtship. Unusually, the buttonquails are , with the females circulating among several males and expelling rival females from her territory. Both sexes cooperate in building a nest in the earth, but only the male the eggs and tends the young. Called \"Pugo\" ( ) by natives, these birds inhabit rice paddies and scrub lands near farm areas because of the abundance of seeds and insects that they feed on regularly. These birds are characterized by their black heads with white spots, a brown or fawn colored body and yellow legs on males and the females are brown with white and black spots. Buttonquails are a notoriously and unobtrusive family of birds, and the species could conceivably occur in reasonable numbers somewhere. They are included in the (as evaluated by IUCN Red List of ). They are also considered as by IUCN and BirdLife International, since these species is judged to have a ten percent chance of going extinct in the next one hundred years.", "edit_actions": [{"type": "D", "before": "Buttonquail", "after": null, "start_char_pos": 0, "end_char_pos": 11}, {"type": "D", "before": "ornithologists", "after": null, "start_char_pos": 42, "end_char_pos": 56}, {"type": "D", "before": "buttonquail", "after": null, "start_char_pos": 78, "end_char_pos": 89}, {"type": "D", "before": "2008 International Union for Conservation of Nature's Red List Category", "after": null, "start_char_pos": 329, "end_char_pos": 400}, {"type": "D", "before": "native bird trappers", "after": null, "start_char_pos": 427, "end_char_pos": 447}, {"type": "D", "before": "Luzon Buttonquail", "after": null, "start_char_pos": 483, "end_char_pos": 500}, {"type": "D", "before": "Caraballo Mountains, in Nueva Vizcaya", "after": null, "start_char_pos": 609, "end_char_pos": 646}, {"type": "A", "before": null, "after": "in ,", "start_char_pos": 649, "end_char_pos": 649}, {"type": "R", "before": "Cordillera Central and Sierra Madre", "after": "and", "start_char_pos": 666, "end_char_pos": 701}, {"type": "D", "before": "Luzon", "after": null, "start_char_pos": 731, "end_char_pos": 736}, {"type": "D", "before": "birder", "after": null, "start_char_pos": 747, "end_char_pos": 753}, {"type": "R", "before": ", Desmond Allen ,", "after": "Desmond Allen", "start_char_pos": 770, "end_char_pos": 787}, {"type": "D", "before": "DVD-video", "after": null, "start_char_pos": 814, "end_char_pos": 823}, {"type": "R", "before": "still image of the credits", "after": "of the", "start_char_pos": 891, "end_char_pos": 917}, {"type": "D", "before": "screenshot", "after": null, "start_char_pos": 966, "end_char_pos": 976}, {"type": "D", "before": "i-Witness: The GMA Documentaries", "after": null, "start_char_pos": 1133, "end_char_pos": 1165}, {"type": "D", "before": "documentary", "after": null, "start_char_pos": 1181, "end_char_pos": 1192}, {"type": "D", "before": "GMA Network", "after": null, "start_char_pos": 1242, "end_char_pos": 1253}, {"type": "R", "before": "Luzon Buttonquail from the Mountain Province", "after": "from the", "start_char_pos": 1936, "end_char_pos": 1980}, {"type": "D", "before": "Field Museum of Natural History", "after": null, "start_char_pos": 2014, "end_char_pos": 2045}, {"type": "R", "before": "image bank of the Oriental Bird Club", "after": "of the", "start_char_pos": 2353, "end_char_pos": 2389}, {"type": "D", "before": "Oriental (or Manchurian) Bush Warbler", "after": null, "start_char_pos": 2795, "end_char_pos": 2832}, {"type": "D", "before": "biodiversity", "after": null, "start_char_pos": 3077, "end_char_pos": 3089}, {"type": "D", "before": "DENR", "after": null, "start_char_pos": 3436, "end_char_pos": 3440}, {"type": "R", "before": "Quiapo, Manila", "after": ",", "start_char_pos": 3613, "end_char_pos": 3627}, {"type": "D", "before": "Benguet", "after": null, "start_char_pos": 3776, "end_char_pos": 3783}, {"type": "R", "before": "Mountain Province by the Field Museum of Natural History", "after": "by the", "start_char_pos": 3812, "end_char_pos": 3868}, {"type": "D", "before": "Dean Conant Worcester", "after": null, "start_char_pos": 3891, "end_char_pos": 3912}, {"type": "D", "before": "Dean Conant Worcester", "after": null, "start_char_pos": 3913, "end_char_pos": 3934}, {"type": "D", "before": "zoologist", "after": null, "start_char_pos": 3969, "end_char_pos": 3978}, {"type": "D", "before": "Thetford", "after": null, "start_char_pos": 4040, "end_char_pos": 4048}, {"type": "D", "before": "University of Michigan", "after": null, "start_char_pos": 4080, "end_char_pos": 4102}, {"type": "D", "before": "Philippine Commission", "after": null, "start_char_pos": 4172, "end_char_pos": 4193}, {"type": "D", "before": "Philippine Insular Government", "after": null, "start_char_pos": 4266, "end_char_pos": 4295}, {"type": "D", "before": "Philippine General Hospital", "after": null, "start_char_pos": 4322, "end_char_pos": 4349}, {"type": "D", "before": "Lamut", "after": null, "start_char_pos": 4462, "end_char_pos": 4467}, {"type": "D", "before": "Sheffield", "after": null, "start_char_pos": 4516, "end_char_pos": 4525}, {"type": "R", "before": "bird-trapping in Ifugao, Mountain Province, Banaue", "after": "in ,", "start_char_pos": 4569, "end_char_pos": 4619}, {"type": "D", "before": "Sagada", "after": null, "start_char_pos": 4633, "end_char_pos": 4639}, {"type": "R", "before": "pesos for a Fruit-Dove", "after": "for a", "start_char_pos": 4699, "end_char_pos": 4721}, {"type": "D", "before": "Metallic Pigeon", "after": null, "start_char_pos": 4741, "end_char_pos": 4756}, {"type": "R", "before": "Flame-breasted Fruit-Dove and Luzon Bleeding-heart", "after": "and", "start_char_pos": 4815, "end_char_pos": 4865}, {"type": "D", "before": "butterfly-catching", "after": null, "start_char_pos": 5064, "end_char_pos": 5082}, {"type": "D", "before": "Cooper Ornithological Society", "after": null, "start_char_pos": 5431, "end_char_pos": 5460}, {"type": "D", "before": "carabao", "after": null, "start_char_pos": 5694, "end_char_pos": 5701}, {"type": "D", "before": "sealing wax", "after": null, "start_char_pos": 5790, "end_char_pos": 5801}, {"type": "R", "before": "bamboo and rattan", "after": "and", "start_char_pos": 6000, "end_char_pos": 6017}, {"type": "D", "before": "Snares", "after": null, "start_char_pos": 6106, "end_char_pos": 6112}, {"type": "D", "before": "Filipinos", "after": null, "start_char_pos": 6359, "end_char_pos": 6368}, {"type": "D", "before": "International Union for Conservation of Nature", "after": null, "start_char_pos": 6472, "end_char_pos": 6518}, {"type": "D", "before": "mammals", "after": null, "start_char_pos": 6609, "end_char_pos": 6616}, {"type": "D", "before": "amphibians", "after": null, "start_char_pos": 6660, "end_char_pos": 6670}, {"type": "D", "before": "Red List of Threatened Species", "after": null, "start_char_pos": 6709, "end_char_pos": 6739}, {"type": "R", "before": "fauna and flora", "after": "and", "start_char_pos": 7086, "end_char_pos": 7101}, {"type": "D", "before": "Turnicidae", "after": null, "start_char_pos": 7463, "end_char_pos": 7473}, {"type": "D", "before": "endemic", "after": null, "start_char_pos": 7488, "end_char_pos": 7495}, {"type": "D", "before": "Luzon", "after": null, "start_char_pos": 7513, "end_char_pos": 7518}, {"type": "D", "before": "Cordillera Central", "after": null, "start_char_pos": 7687, "end_char_pos": 7705}, {"type": "D", "before": "buttonquails", "after": null, "start_char_pos": 7845, "end_char_pos": 7857}, {"type": "D", "before": "quails", "after": null, "start_char_pos": 7946, "end_char_pos": 7952}, {"type": "D", "before": "intra-island migrants", "after": null, "start_char_pos": 8039, "end_char_pos": 8060}, {"type": "D", "before": "Bird Trap", "after": null, "start_char_pos": 8190, "end_char_pos": 8199}, {"type": "D", "before": "polyandrous", "after": null, "start_char_pos": 8406, "end_char_pos": 8417}, {"type": "D", "before": "incubates", "after": null, "start_char_pos": 8589, "end_char_pos": 8598}, {"type": "D", "before": "quail", "after": null, "start_char_pos": 8645, "end_char_pos": 8650}, {"type": "D", "before": "cryptic", "after": null, "start_char_pos": 9013, "end_char_pos": 9020}, {"type": "D", "before": "2008 IUCN Red List Category", "after": null, "start_char_pos": 9152, "end_char_pos": 9179}, {"type": "D", "before": "BirdLife International", "after": null, "start_char_pos": 9197, "end_char_pos": 9219}, {"type": "D", "before": "Threatened Species", "after": null, "start_char_pos": 9237, "end_char_pos": 9255}, {"type": "D", "before": "Vulnerable species", "after": null, "start_char_pos": 9287, "end_char_pos": 9305}], "sents_char_pos": [0, 257, 414, 547, 949, 1409, 1526, 1723, 1737, 1779, 1864, 1908, 2057, 2214, 2453, 2770, 2894, 2971, 3023, 3240, 3365, 3485, 3679, 3890, 4116, 4195, 4297, 4408, 4674, 4758, 4867, 4922, 4975, 5026, 5093, 5366, 5508, 5640, 5703, 5840, 6097, 6304, 6577, 6696, 6774, 6877, 6935, 7042, 7163, 7257, 7330, 7392, 7481, 7590, 7840, 7954, 8015, 8189, 8293, 8373, 8516, 8628, 8804, 8981, 9126, 9258]} {"doc_id": "121431", "revision_depth": "1", "before_revision": "Transmission electron micrograph of the Ebola virus. The Philippine Department of Agriculture (DA), local health and agricultural teams Sunday have started slaughtering, burning and burying roughly 6,500 hogs at a farm in Pandi, Bulacan in Central Luzon on Sunday after three farm workers became infected with Reston ebolavirus (ERV) of the virus group Ebola , as a precautionary measure and to protect the local livestock industry. But according to Dr. Eric Tayag, the 56-man team's five captive bolts used in stunning the pigs malfunctioned, for which reason, they decided use instead .32 caliber pistols . \"We need to finish this off because sometimes it rains,\" he said. But due to other problems, 12 policemen were ordered to use instead .22 caliber guns for 80-120 kilograms pigs. The pig depopulation in the Pandi farm has reached 1,237 Tuesday amid strong rains as schedules have been set from 5 a.m. to 9 a.m. and from 4 p.m. to 9 p.m. daily, Cecilia Yacob, head of the Bulacan Provincial Public Affairs Office, said. Monday's culling was witnessed by representatives from the Food and Agricultural Organization (FAO), the World Health Organization (WHO), animal welfare observers, Bulacan Gov. Joselito Mendoza and Pandi Mayor Roberto Oca. The slaughter has been estimated to cost 16 million Philippine pesos (\u20b1), which include hog farm owners' compensation and the cost of culling for five to seven days. A polymerase chain reaction test to check the virus' presence was conducted by the United States Centers for Disease Control (US-CDC) to verify ongoing transmission. \"Of 160 pig blood samples that were positive for antibodies, 133 came from Bulacan and 27 from Pangasinan as reported by RITM. Those from Bulacan were traced to pigs at different age groups while those in Pangasinan were found in sows and just one piglet. This means that there is on going viral transmission in Bulacan but past infection with recovery was the case in Pangasinan,\u201d Yap explained. The agriculture officials earlier announced that the depopulation will be carried out in a \"humane\" manner, following current Office international des \u00e9pizooties (OIE) procedures that ensure protection of animal welfare in the Bulacan farm. According to Philippine Department of Health (DOH) Secretary Francisco Duque , the quarantine of the hog farm in Palauig, Manaoag, Pangasinan has been lifted after finding no traces of viral transmission. According to Yap, test results conducted by a joint mission of FAO, the World Animal Health Organization , WHO and their local counterparts, reveal that viral transmission continues to exist in Pandi hog farms, which is only 0.5\\% of the 13 million pigs raised throughout the country. DOH officials also say a pig farm worker in Cabanatuan City in Nueva Ecija , who had no direct contact with sick hogs, has tested positive for Immunoglobulin G antibodies against the Reston ebolavirus, which is non-lethal, unlike the Za\u00efre, Bundibugyo, C\u00f4te d'Ivoire and Sudan strains, according to FAO. \"Ebola Reston poses a low risk to human health at this time,\" said DOH Secretary Dr. Duque. \"147 human samples have been tested for Ebola, but only six have tested positive. But stay away from kilawin , and half-cooked pork,\" he added. The laboratory tests of 147 blood samples from workers in the affected areas were conducted by the Research Institute for Tropical Medicine (RITM) and the US-CDC. RITM has also reported that \"1039 pig blood samples collected by the expert mission yielded negative results on antigen tests ,\" the DOH said. Both the DA and DOH officials have decided to expand the scope of the testing for the Reston ebolavirus by inspecting and monitoring hog farms in the whole of Central Luzon, Calabarzon, Southern Luzon and Pangasinan province after the culling of the 6,500 pigs. \"In six months we might be finished testing Regions 3 and 4 depending on the assurance of the US Center for Disease Control and Prevention [in Atlanta, Georgia, USA] to give test kits. In Region 3 alone, the government would need to test farms in 566 villages that would require around 36,000 kits, but the country only has 10,000 kits\" Mr. Catbagan said. \"The expanded tests will cover the provinces of Aurora, Bataan, Bulacan, Nueva Ecija, Pampanga, Tarlac and Zambales in Central Luzon, and Cavite, Laguna, Batangas, Rizal and Quezon in Calabarzon,\" Mr. Catbagan added. Mr. Catbagan has assured infected hog farm owners in Pandi they would be properly indemnified after the country's first large-scale animal depopulation process. \"We are finalizing the indemnification contract. But we will make sure the indemnification would not be open to abuse,\" he said. Fatteners and piglets cost an average of \u20b13,000-4,000 per head, boars cost \u20b125,000-30,000, and sows cost \u20b114,000-15,000. Intensively farmed pigs in batch pens Juan Lubroth, senior officer of the Infectious Disease Group of FAO\u2019s Animal Health Service, has arrived on Wednesday to discuss in detail with government officials how the agency can support in the wider surveillance. The DA and DOH officials and other government agencies met last Thursday to discuss and finalize the procedure in the burning of 6,500 pigs in Pandi, Bulacan. \"The Bureau of Animal Industry and the provincial government of Bulacan, experts carrying out the \u20b1500,000 five-day depopulation would observe three guidelines, namely: the main disposal, water safety, and environment protection. The depopulation process will involve stunning the pigs unconscious, burning them in a 6-foot deep pit, then burying them at the site. We want to make sure that our means would not violate the Animal Welfare Act. We are also ensuring that there would be no seepage,\" Governor Mendoza explained. \"Local authorities have decided to use electric prods and a \u20b170,000 captive bolt pistol with a blunt rod to stun the 6,000 pigs in Pandi, prior to slaughter burning using rice hulls before burying them in a pit dug inside the hog farm,\" said Dr. Davinio Catbagan. \"About 40 health workers \u2014 clad in special hog mask suits and are tasked to facilitate the depopulation \u2014 would then dump the pigs into 10 30x30-foot pits that can accommodate 600 pigs each. The pits are located some 30 feet from the infected pig farm,\" said Mr Eric Tayag, head of the National Epidemiology Centre. \"The cull could take up to seven days to complete,\" Mr Tayag added. A truckload of disinfectants was prepared amid rice husks to be used in the burning. Meanwhile, at the 18th hog farmers convention, which was launched on Monday at Club Filipino , the president of the National Federation of Hog Farmers, Albert R. T. Lim, Jr., said hog farmers have feared the effects of Reston ebolavirus virus on industry, since hog exports were banned due to the outbreak. \"We are also apprehensive that if we keep on talking about this thing, some people might just misconstrue or misunderstand what they are talking about and people might get scared,\" Lim said. The government has spent about \u20b110 million to maintain the two quarantined hog farms in Bulacan and Pangasinan. \"Anyway, we always have our hog producers in Mindanao to supply Luzon if necessary. I am more concerned about our exports although the Ebola scare also somewhat affected local demand,\" Lim said. Amid the nationwide ERV scare and probe, local authorities have seized more than 200 kilograms of rotten pork meat at a local market in Pasay City Wednesday. Barangay officials in Maricaban district have intercepted the banned \u2018hot meat\u2019 and arrested Roberto Clet and Rafael Fruelda, who were indicted under the \"Consumer Act of the Philippines.\" The statute punishes the illegal sale of unsafe products like double-dead meat with penalty of \u20b11,000 to \u20b110,000 and not less than six-months but not more than five years of imprisonment. Transmission electron micrograph of the Ebola virus. Local police has also arrested four vendors and seized their 3,000 kilos of \"botcha\" (rotten pork meat or \"double dead meat\") at MC Market in Balintawak, Quezon City Wednesday evening, and allegedly delivered from Bulacan. The four suspects were charged for violation of the Consumer Act of the Philippines and Republic Act 9296 or the Meat Inspection Code. In December, international experts initially probed outbreak among Philippine pigs, wherein about 6,000 pigs at Pandi and Talavera farms were tested for the Reston ebolavirus. \"There is no salmonella outbreak in Eastern Visayas , Region 8, said Dr. Archie Lluz, Chief of Regional Animal Disease and Diagnostic Laboratory of the Department of Agriculture in the region. But hog specimens from Leyte and Babatngon , where 270 swine deaths and cases of sick pigs were reported, were examined by lab tests. The results revealed cutaneous \"Pasteurella hemolytica\" , a type of bacterial infection which causes swine deaths due to loss of appetite, dehydration, fever and diarrhea. According to the DA, sick pigs had been culled from Babatngon, Tacloban City, Alangalang, Santa Fe, Palo, Pastrana, Dagami, Burauen, Tabontabon, Lapaz, Mayorga, and Abuyog in Leyte ; Sogod in Southern Leyte ; Catbalogan, Calbiga, Daram, and Santa Rita in Samar ; and Lope de Vega in Northern Samar . Swine infections have spread to 18 towns and one city in Eastern Visayas . The Reston ebolavirus is suspected to be a subtype of the Ebola virus or a new filovirus of Asian origin. It was first discovered in crab-eating macaques from the Philippines at a laboratory in Reston , Virginia. The same lab then recorded an outbreak of viral hemorrhagic fever among monkeys imported from the Philippines in 1990. The Reston ebolavirus strain was discovered among monkeys in the Philippines in 1996, and in Italy in 1992. In January 1997, the Philippines Department of Environment and Natural Resources ordered the immediate slaughter of some 600 monkeys in Ferlite, a breeding farm in Laguna , to prevent an outbreak of Reston ebolavirus.", "after_revision": "Transmission electron micrograph of the Ebola virus. The Philippine (DA), local health and agricultural teams Sunday have started roughly 6,500 hogs at a farm in , in on Sunday after three farm workers became infected with (ERV) of the virus group , as a precautionary measure and to protect the local livestock industry. But according to Dr. Eric Tayag, the 56-man team's five captive bolts used in stunning the pigs malfunctioned, for which reason, they decided use instead . \"We need to finish this off because sometimes it rains,\" he said. But due to other problems, 12 policemen were ordered to use instead guns for 80-120 kilograms pigs. The pig depopulation in the Pandi farm has reached 1,237 Tuesday amid strong rains as schedules have been set from 5 a.m. to 9 a.m. and from 4 p.m. to 9 p.m. daily, Cecilia Yacob, head of the Bulacan Provincial Public Affairs Office, said. Monday's culling was witnessed by representatives from the (FAO), the (WHO), animal welfare observers, Bulacan Gov. Joselito Mendoza and Pandi Mayor Roberto Oca. The slaughter has been estimated to cost 16 million (\u20b1), which include hog farm owners' compensation and the cost of culling for five to seven days. A test to check the virus' presence was conducted by the (US-CDC) to verify ongoing transmission. \"Of 160 pig blood samples that were positive for antibodies, 133 came from Bulacan and 27 from Pangasinan as reported by RITM. Those from Bulacan were traced to pigs at different age groups while those in Pangasinan were found in sows and just one piglet. This means that there is on going viral transmission in Bulacan but past infection with recovery was the case in Pangasinan,\u201d Yap explained. The agriculture officials earlier announced that the will be carried out in a \"humane\" manner, following current (OIE) procedures that ensure protection of animal welfare in the Bulacan farm. According to (DOH) Secretary , the quarantine of the hog farm in Palauig, has been lifted after finding no traces of viral transmission. According to Yap, test results conducted by a joint mission of FAO, the , WHO and their local counterparts, reveal that viral transmission continues to exist in Pandi hog farms, which is only 0.5\\% of the 13 million pigs raised throughout the country. DOH officials also say a pig farm worker in in , who had no direct contact with sick hogs, has tested positive for against the Reston ebolavirus, which is non-lethal, unlike the , , and strains, according to FAO. \"Ebola Reston poses a low risk to human health at this time,\" said DOH Secretary Dr. Duque. \"147 human samples have been tested for Ebola, but only six have tested positive. But stay away from , and half-cooked pork,\" he added. The laboratory tests of 147 blood samples from workers in the affected areas were conducted by the (RITM) and the US-CDC. RITM has also reported that \"1039 pig blood samples collected by the expert mission yielded negative results on ,\" the DOH said. Both the DA and DOH officials have decided to expand the scope of the testing for the Reston ebolavirus by inspecting and monitoring hog farms in the whole of , , and province after the culling of the 6,500 pigs. \"In six months we might be finished testing Regions 3 and 4 depending on the assurance of the US Center for Disease Control and Prevention [in , USA] to give test kits. In Region 3 alone, the government would need to test farms in 566 villages that would require around 36,000 kits, but the country only has 10,000 kits\" Mr. Catbagan said. \"The expanded tests will cover the provinces of Aurora, Bataan, Bulacan, Nueva Ecija, Pampanga, Tarlac and Zambales in Central Luzon, and Cavite, Laguna, Batangas, Rizal and Quezon in Calabarzon,\" Mr. Catbagan added. Mr. Catbagan has assured infected hog farm owners in Pandi they would be properly indemnified after the country's first large-scale animal depopulation process. \"We are finalizing the indemnification contract. But we will make sure the indemnification would not be open to abuse,\" he said. Fatteners and piglets cost an average of \u20b13,000-4,000 per head, boars cost \u20b125,000-30,000, and sows cost \u20b114,000-15,000. in batch pens Juan Lubroth, senior officer of the Group of FAO\u2019s Animal Health Service, has arrived on Wednesday to discuss in detail with government officials how the agency can support in the wider surveillance. The DA and DOH officials and other government agencies met last Thursday to discuss and finalize the procedure in the burning of 6,500 pigs in Pandi, Bulacan. \"The Bureau of Animal Industry and the provincial government of Bulacan, experts carrying out the \u20b1500,000 five-day depopulation would observe three guidelines, namely: the main disposal, water safety, and environment protection. The depopulation process will involve the pigs unconscious, burning them in a 6-foot deep pit, then burying them at the site. We want to make sure that our means would not violate the Animal Welfare Act. We are also ensuring that there would be no seepage,\" Governor Mendoza explained. \"Local authorities have decided to use and a \u20b170,000 with a blunt rod to the 6,000 pigs in Pandi, prior to burning using rice hulls before burying them in a pit dug inside the hog farm,\" said Dr. Davinio Catbagan. \"About 40 health workers \u2014 clad in special hog mask suits and are tasked to facilitate the depopulation \u2014 would then dump the pigs into 10 30x30-foot pits that can accommodate 600 pigs each. The pits are located some 30 feet from the infected pig farm,\" said Mr Eric Tayag, head of the National Epidemiology Centre. \"The cull could take up to seven days to complete,\" Mr Tayag added. A truckload of disinfectants was prepared amid to be used in the burning. Meanwhile, at the 18th hog farmers convention, which was launched on Monday at , the president of the National Federation of Hog Farmers, Albert R. T. Lim, Jr., said hog farmers have feared the effects of Reston ebolavirus virus on industry, since hog exports were banned due to the outbreak. \"We are also apprehensive that if we keep on talking about this thing, some people might just misconstrue or misunderstand what they are talking about and people might get scared,\" Lim said. The government has spent about \u20b110 million to maintain the two hog farms in Bulacan and Pangasinan. \"Anyway, we always have our hog producers in Mindanao to supply Luzon if necessary. I am more concerned about our exports although the Ebola scare also somewhat affected local demand,\" Lim said. Amid the nationwide ERV scare and probe, local authorities have seized more than 200 of rotten pork meat at a local market in Wednesday. officials in Maricaban district have intercepted the banned \u2018hot meat\u2019 and arrested Roberto Clet and Rafael Fruelda, who were indicted under the \"Consumer Act of the Philippines.\" The statute punishes the illegal sale of unsafe products like double-dead meat with penalty of \u20b11,000 to \u20b110,000 and not less than six-months but not more than five years of imprisonment. Transmission electron micrograph of the Ebola virus. Local police has also arrested four vendors and seized their 3,000 kilos of \"botcha\" (rotten pork meat or \"double dead meat\") at MC Market in , Wednesday evening, and allegedly delivered from Bulacan. The four suspects were charged for violation of the Consumer Act of the Philippines and Republic Act 9296 or the Meat Inspection Code. In December, international experts initially probed outbreak among Philippine pigs, wherein about 6,000 pigs at Pandi and farms were tested for the Reston ebolavirus. \"There is no outbreak in , Region 8, said Dr. Archie Lluz, Chief of Regional Animal Disease and Diagnostic Laboratory of the Department of Agriculture in the region. But hog specimens from and , where 270 swine deaths and cases of sick pigs were reported, were examined by lab tests. The results revealed cutaneous , a type of bacterial infection which causes swine deaths due to loss of appetite, dehydration, fever and diarrhea. According to the DA, sick pigs had been culled from Babatngon, Tacloban City, Alangalang, Santa Fe, Palo, Pastrana, Dagami, Burauen, Tabontabon, Lapaz, Mayorga, and Abuyog in ; Sogod in ; Catbalogan, Calbiga, Daram, and Santa Rita in ; and Lope de Vega in . Swine infections have spread to 18 towns and one city in . The Reston ebolavirus is suspected to be a subtype of the Ebola virus or a new filovirus of Asian origin. It was first discovered in from the Philippines at a laboratory in , Virginia. The same lab then recorded an outbreak of among monkeys imported from the Philippines in 1990. The Reston ebolavirus strain was discovered among monkeys in the Philippines in 1996, and in Italy in 1992. In January 1997, the Philippines Department of Environment and Natural Resources ordered the immediate slaughter of some 600 monkeys in Ferlite, a breeding farm in , to prevent an outbreak of Reston ebolavirus.", "edit_actions": [{"type": "D", "before": "Department of Agriculture", "after": null, "start_char_pos": 68, "end_char_pos": 93}, {"type": "D", "before": "slaughtering, burning and burying", "after": null, "start_char_pos": 156, "end_char_pos": 189}, {"type": "R", "before": "Pandi, Bulacan in Central Luzon", "after": ", in", "start_char_pos": 222, "end_char_pos": 253}, {"type": "D", "before": "Reston ebolavirus", "after": null, "start_char_pos": 310, "end_char_pos": 327}, {"type": "D", "before": "Ebola", "after": null, "start_char_pos": 353, "end_char_pos": 358}, {"type": "D", "before": ".32 caliber pistols", "after": null, "start_char_pos": 587, "end_char_pos": 606}, {"type": "D", "before": ".22 caliber", "after": null, "start_char_pos": 743, "end_char_pos": 754}, {"type": "D", "before": "Food and Agricultural Organization", "after": null, "start_char_pos": 1086, "end_char_pos": 1120}, {"type": "D", "before": "World Health Organization", "after": null, "start_char_pos": 1132, "end_char_pos": 1157}, {"type": "D", "before": "Philippine pesos", "after": null, "start_char_pos": 1302, "end_char_pos": 1318}, {"type": "D", "before": "polymerase chain reaction", "after": null, "start_char_pos": 1418, "end_char_pos": 1443}, {"type": "D", "before": "United States Centers for Disease Control", "after": null, "start_char_pos": 1499, "end_char_pos": 1540}, {"type": "D", "before": "depopulation", "after": null, "start_char_pos": 2032, "end_char_pos": 2044}, {"type": "D", "before": "Office international des \u00e9pizooties", "after": null, "start_char_pos": 2105, "end_char_pos": 2140}, {"type": "D", "before": "Philippine Department of Health", "after": null, "start_char_pos": 2233, "end_char_pos": 2264}, {"type": "D", "before": "Francisco Duque", "after": null, "start_char_pos": 2281, "end_char_pos": 2296}, {"type": "D", "before": "Manaoag, Pangasinan", "after": null, "start_char_pos": 2342, "end_char_pos": 2361}, {"type": "D", "before": "World Animal Health Organization", "after": null, "start_char_pos": 2497, "end_char_pos": 2529}, {"type": "R", "before": "Cabanatuan City in Nueva Ecija", "after": "in", "start_char_pos": 2754, "end_char_pos": 2784}, {"type": "D", "before": "Immunoglobulin G antibodies", "after": null, "start_char_pos": 2853, "end_char_pos": 2880}, {"type": "R", "before": "Za\u00efre, Bundibugyo, C\u00f4te d'Ivoire and Sudan", "after": ", , and", "start_char_pos": 2944, "end_char_pos": 2986}, {"type": "D", "before": "kilawin", "after": null, "start_char_pos": 3207, "end_char_pos": 3214}, {"type": "D", "before": "Research Institute for Tropical Medicine", "after": null, "start_char_pos": 3349, "end_char_pos": 3389}, {"type": "D", "before": "antigen tests", "after": null, "start_char_pos": 3525, "end_char_pos": 3538}, {"type": "R", "before": "Central Luzon, Calabarzon, Southern Luzon and Pangasinan", "after": ", , and", "start_char_pos": 3715, "end_char_pos": 3771}, {"type": "R", "before": "Atlanta, Georgia,", "after": ",", "start_char_pos": 3961, "end_char_pos": 3978}, {"type": "D", "before": "Intensively farmed pigs", "after": null, "start_char_pos": 4802, "end_char_pos": 4825}, {"type": "D", "before": "Infectious Disease", "after": null, "start_char_pos": 4876, "end_char_pos": 4894}, {"type": "D", "before": "stunning", "after": null, "start_char_pos": 5486, "end_char_pos": 5494}, {"type": "D", "before": "electric prods", "after": null, "start_char_pos": 5782, "end_char_pos": 5796}, {"type": "D", "before": "captive bolt pistol", "after": null, "start_char_pos": 5811, "end_char_pos": 5830}, {"type": "D", "before": "stun", "after": null, "start_char_pos": 5851, "end_char_pos": 5855}, {"type": "D", "before": "slaughter", "after": null, "start_char_pos": 5890, "end_char_pos": 5899}, {"type": "D", "before": "rice husks", "after": null, "start_char_pos": 6438, "end_char_pos": 6448}, {"type": "D", "before": "Club Filipino", "after": null, "start_char_pos": 6555, "end_char_pos": 6568}, {"type": "D", "before": "quarantined", "after": null, "start_char_pos": 7037, "end_char_pos": 7048}, {"type": "D", "before": "kilograms", "after": null, "start_char_pos": 7366, "end_char_pos": 7375}, {"type": "R", "before": "Pasay City Wednesday. Barangay", "after": "Wednesday.", "start_char_pos": 7417, "end_char_pos": 7447}, {"type": "R", "before": "Balintawak, Quezon City", "after": ",", "start_char_pos": 8011, "end_char_pos": 8034}, {"type": "D", "before": "Talavera", "after": null, "start_char_pos": 8349, "end_char_pos": 8357}, {"type": "R", "before": "salmonella outbreak in Eastern Visayas", "after": "outbreak in", "start_char_pos": 8416, "end_char_pos": 8454}, {"type": "R", "before": "Leyte and Babatngon", "after": "and", "start_char_pos": 8619, "end_char_pos": 8638}, {"type": "D", "before": "\"Pasteurella hemolytica\"", "after": null, "start_char_pos": 8761, "end_char_pos": 8785}, {"type": "D", "before": "Leyte", "after": null, "start_char_pos": 9077, "end_char_pos": 9082}, {"type": "D", "before": "Southern Leyte", "after": null, "start_char_pos": 9094, "end_char_pos": 9108}, {"type": "D", "before": "Samar", "after": null, "start_char_pos": 9157, "end_char_pos": 9162}, {"type": "D", "before": "Northern Samar", "after": null, "start_char_pos": 9185, "end_char_pos": 9199}, {"type": "D", "before": "Eastern Visayas", "after": null, "start_char_pos": 9259, "end_char_pos": 9274}, {"type": "D", "before": "crab-eating macaques", "after": null, "start_char_pos": 9410, "end_char_pos": 9430}, {"type": "D", "before": "Reston", "after": null, "start_char_pos": 9471, "end_char_pos": 9477}, {"type": "D", "before": "viral hemorrhagic fever", "after": null, "start_char_pos": 9532, "end_char_pos": 9555}, {"type": "D", "before": "Laguna", "after": null, "start_char_pos": 9881, "end_char_pos": 9887}], "sents_char_pos": [0, 52, 432, 674, 786, 1026, 1249, 1415, 1581, 1708, 1837, 1978, 2219, 2424, 2709, 3013, 3105, 3187, 3249, 3555, 3817, 4002, 4173, 4390, 4551, 4600, 4680, 4801, 5058, 5217, 5447, 5582, 5660, 5742, 6006, 6197, 6322, 6390, 6475, 6782, 6973, 7085, 7169, 7280, 7438, 7627, 7815, 7868, 8091, 8226, 8402, 8475, 8595, 8729, 8901, 9084, 9110, 9164, 9276, 9382, 9489, 9608, 9716]} {"doc_id": "121920", "revision_depth": "1", "before_revision": "German side 1. FSV Mainz 05 , of the Second Bundesliga , have reached the semi-finals of the DFB Pokal , Germany's equivalent of the FA Cup , for the first time in their history. They defeated Bundesliga side FC Schalke 04 by 1 - 0 on a goal from Aristide Banc\u00e9 in the 88th minute. For Schalke, it was just another disappointment in an already dismal season; being elminiated from the Cup means they must improve their current Bundesliga standing to fifth - it was eighth place at the conclusion of the 22nd Matchday - to have any chance to appear in the UEFA Europa League. Mainz got started just after the first whistle, when Markus Feulner had a shot from the left side blocked by Jefferson Farf\u00e1n after eight minutes. However, Schalke began to dominate after the half-hour mark. A shot from Heiko Westermann sailed just wide of the goal in the thirty-second, and a corner kick from Mladen Kristaljic richocheted off the crossbar eight minutes later. Schalke manager Andreas M\u00fcller was unhappy with his team's effort in the first half, however, saying \"We don't have enough power to penetrate towards the front.\" Striker Kevin Kur\u00e1nyi was replaced by Halil Altintop at the break. An opportunity for Mainz in the sixty-eighth was stopped by keeper Manuel Neuer after an unsuccessful rescue attempt by Ivan Rakitic. Altintop had a shot fly inches wide of the post in the seventy-first. Schalke nearly gave up a penalty in the eighty-second as Rafinha made a hard and controversial tackle on Sr\u0111an Baljak , but referee Felix Brych allowed play to continue. Finally, in the eighty-eighth, Aristide Banc\u00e9 converted off of a long indirect free kick to put Mainz through to the semi-finals.", "after_revision": "German side , of the , have reached the semi-finals of the , Germany's equivalent of the , for the first time in their history. They defeated Bundesliga side by 1 - 0 on a goal from in the 88th minute. For Schalke, it was just another disappointment in an already dismal season; being elminiated from the Cup means they must improve their current Bundesliga standing to fifth - it was eighth place at the conclusion of the 22nd Matchday - to have any chance to appear in the UEFA Europa League. Mainz got started just after the first whistle, when had a shot from the left side blocked by after eight minutes. However, Schalke began to dominate after the half-hour mark. A shot from sailed just wide of the goal in the thirty-second, and a corner kick from richocheted off the crossbar eight minutes later. Schalke manager was unhappy with his team's effort in the first half, however, saying \"We don't have enough power to penetrate towards the front.\" Striker was replaced by at the break. An opportunity for Mainz in the sixty-eighth was stopped by keeper after an unsuccessful rescue attempt by Ivan Rakitic. Altintop had a shot fly inches wide of the post in the seventy-first. Schalke nearly gave up a penalty in the eighty-second as made a hard and controversial tackle on , but referee Felix Brych allowed play to continue. Finally, in the eighty-eighth, Aristide Banc\u00e9 converted off of a long indirect free kick to put Mainz through to the semi-finals.", "edit_actions": [{"type": "D", "before": "1. FSV Mainz 05", "after": null, "start_char_pos": 12, "end_char_pos": 27}, {"type": "D", "before": "Second Bundesliga", "after": null, "start_char_pos": 37, "end_char_pos": 54}, {"type": "D", "before": "DFB Pokal", "after": null, "start_char_pos": 93, "end_char_pos": 102}, {"type": "D", "before": "FA Cup", "after": null, "start_char_pos": 133, "end_char_pos": 139}, {"type": "D", "before": "FC Schalke 04", "after": null, "start_char_pos": 209, "end_char_pos": 222}, {"type": "D", "before": "Aristide Banc\u00e9", "after": null, "start_char_pos": 247, "end_char_pos": 261}, {"type": "D", "before": "Markus Feulner", "after": null, "start_char_pos": 628, "end_char_pos": 642}, {"type": "D", "before": "Jefferson Farf\u00e1n", "after": null, "start_char_pos": 684, "end_char_pos": 700}, {"type": "D", "before": "Heiko Westermann", "after": null, "start_char_pos": 795, "end_char_pos": 811}, {"type": "D", "before": "Mladen Kristaljic", "after": null, "start_char_pos": 886, "end_char_pos": 903}, {"type": "D", "before": "Andreas M\u00fcller", "after": null, "start_char_pos": 970, "end_char_pos": 984}, {"type": "D", "before": "Kevin Kur\u00e1nyi", "after": null, "start_char_pos": 1124, "end_char_pos": 1137}, {"type": "D", "before": "Halil Altintop", "after": null, "start_char_pos": 1154, "end_char_pos": 1168}, {"type": "D", "before": "Manuel Neuer", "after": null, "start_char_pos": 1250, "end_char_pos": 1262}, {"type": "D", "before": "Rafinha", "after": null, "start_char_pos": 1444, "end_char_pos": 1451}, {"type": "D", "before": "Sr\u0111an Baljak", "after": null, "start_char_pos": 1492, "end_char_pos": 1504}], "sents_char_pos": [0, 178, 281, 358, 574, 721, 782, 953, 1115, 1182, 1316, 1386, 1556]} {"doc_id": "124072", "revision_depth": "2", "before_revision": "The provincial election was called today in British Columbia. Alongside with the election, the citizens of the province will also be debating if they should change their electoral system from Single Member Plurality to Single Transferable Vote (STV). The vote for both the election and the referendum is to be held on May 12th. Gordon Campbell, Premier of British Columbia According to the Angus Reid Strategies online poll, the issues before the candidates this year are the economy, crime and public safety, and health care. Gordon Campbell is the current Premier of British Columbia, and leader of the Liberal Party . Three new tax measures have been proposed, increasing apprenticeship training tax credits, reducing small business income tax, and raising the revenue definition for small business. \"Keep B.C. Strong\" is the Liberal slogan. The New Democratic Party (NDP) leader Carole James is focusing her election platform on supporting a green economy, eliminating the carbon tax, offering families tax relief, freezing post-secondary tuition, raising the minimum wage, and providing a small business tax holiday. The NDP slogan is \"Take back your B.C.\" The Green Party led by Jane Sterk , is focused on environmental issues, crime and police, and a 'green economy'. The Green Party is in support of the carbon tax and will be campaigning in favour of the new STV voting system that is being proposed again. The Green Party slogan is \"A better plan for B.C.\" Carole James, Leader of the New Democratic Party Wilf Hanni is at the helm of the Conservative Party which opposes the Recognition and Reconciliation Act, privatization of BC Hydro Bill 42 'gag law', and the carbon tax. They propose to reduce senior civil employee pay scale, as well as personal and corporate income tax. Other parties running candidates are the Democratic Reform under Graeme Roger, the Marijuana Party under Marc Emery, the Work Less Party under Conrad Schmidt, the Refederation Party under Mike Summers, the Sex Party under John Ince and the Communist Party under George Gidora . For 60 days before the election, each party may campaign with an allowable CA$1.1 million, in the final 28 days, $4.4 millionmay be spent. $70,000 is allowed by candidates before the writ is dropped, and another $ 70, 000 in the midst of campaigning. The referendum will allow BC voters to choose between two voting systems. The Single Member Plurality system is the current system in all Canadian provinces, and is also used to elect Members of Parliament in Ottawa. The other system is BC-STV,which would replace 85 single-member ridings with 20 larger ridings in which between two and seven Members of the Legislative Assembly (MLA) would be elected. The total number of MLAs will not change. Voters would rank the candidates in order of preference, as many or as few as they wish. When the results are tallied, votes are transferred to the next preference on the ballot when the first preference has been elected or eliminated. The system is designed to ensure that every vote helps to elect someone, every vote counts as fully as possible, and every voter is represented by a candidate they voted for, as nearly as mathematically possible.%DIFDELCMD < %DIFDELCMD < %%% Previous elections held under the current Single Member Plurality (also known as First Past The Post) system led to odd results in certain elections, such as the 2001 election where the winning party obtained 77 of the 79 seats of the legislature with just 58\\% of the vote, and the 1996 election, in which the party with the most votes failed to win the election. The recommendation to switch to STV was made by the British Columbia Citizens' Assembly on Electoral Reform, a group formed in 2004 of randomly selected citizens. They spent a year learning about voting systems around the world and consulting with BC citizens. It's the fourth referendum in the country and the second in the province within the last 4 years. The previous referendum held in 2005 also voted on these same electoral systems and came within 2.3\\% of the 60\\% threshold. In order for the referendum to be binding, BC-STV will again need 60\\% of the popular vote and 50\\% of votes in 51 of the 85 ridings in BC. If the change is approved, it will be the first province in the country to adopt reform of the electoral system in recent history.%DIFDELCMD < %DIFDELCMD < %%% Fair Voting BC, recognized as the official proponent group, argues that STV will lead to fairer election results, effective local representation and greater voter choice. They argue that BC-STV will give voters the power to hold politicians and political parties accountable, by giving every voter a vote that actually makes a difference. If the STV system is approved, then it will be put into use for the first time for the 2013 provincial election. The recognized opponent group is the No STV Campaign Society. Their arguments are that STV will give larger ridings, voters would be unsure of whom their MLA would be, there would be unequal geographic representation, that the counting method is too complicated, the electoral system results are unverified in practical usage, the system results in a higher probability of minority governments and the subsequent coalition of parties. They also argue that other countries who use systems similar to STV have had problems with their election results. 500,000 in public funding has been given to both the proponents and the opponents of the referendum. ", "after_revision": "The provincial election was called today in British Columbia. Alongside with the election, the citizens of the province will also be debating if they should change their electoral system from to (STV). The vote for both the election and the referendum is to be held on May 12th. , of British Columbia According to the online poll, the issues before the candidates this year are the economy, crime and public safety, and health care. is the current of British Columbia, and leader of the . Three new tax measures have been proposed, increasing apprenticeship training tax credits, reducing small business income tax, and raising the revenue definition for small business. \"Keep B.C. Strong\" is the Liberal slogan. The (NDP) leader is focusing her election platform on supporting a green economy, eliminating the carbon tax, offering families tax relief, freezing post-secondary tuition, raising the minimum wage, and providing a small business tax holiday. The NDP slogan is \"Take back your B.C.\" The , led by , is focused on environmental issues, crime and police, and a 'green economy'. The Green Party is in support of the carbon tax and will be campaigning in favour of the new STV voting system that is being proposed again. The Green Party slogan is \"A better plan for B.C.\" is at the helm of the which opposes the Recognition and Reconciliation Act, privatization of BC Hydro Bill 42 'gag law', and the carbon tax. They propose to reduce senior civil employee pay scale, as well as personal and corporate income tax. Other parties running candidates are the under , the under , the under , the under , the under , and the under . For 60 days before the election, each party may campaign with an allowable 1.1 million, in the final 28 days, $4.4 million may be spent. $ 70, %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% 000 is allowed by candidates before the writ is dropped, and another $70,000 in the midst of campaigning. The referendum will allow BC voters to choose between two voting systems. The system is the current system in all Canadian provinces, and is also used to elect in . The other system is , which would replace 85 single-member ridings with 20 larger ridings in which between two and seven (MLA) would be elected. The total number of MLAs will not change. Voters would rank the candidates in order of preference, as many or as few as they wish. When the results are tallied, votes are transferred to the next preference on the ballot when the first preference has been elected or eliminated. The system is designed to ensure that every vote helps to elect someone, every vote counts as fully as possible, and every voter is represented by a candidate they voted for, as nearly as mathematically possible. Previous elections held under the current Single Member Plurality (also known as First Past The Post) system led to in certain elections, such as the where the winning party obtained 77 of the 79 seats of the legislature with just 58\\% of the vote, and the , in which the party with the most votes failed to win the election. The recommendation to switch to STV was made by the , a group formed in 2004 of randomly selected citizens. They spent a year learning about voting systems around the world and consulting with BC citizens. It's the fourth referendum in the country and the second in the province within the last 4 years. The held in 2005 also voted on these same electoral systems and came within 2.3\\% of the 60\\% threshold. In order for the referendum to be binding, BC-STV will again need 60\\% of the popular vote and 50\\% of votes in 51 of the 85 ridings in BC. If the change is approved, it will be the first province in the country to adopt of the electoral system in recent history. Fair Voting BC, recognized as the official proponent group, argues that STV will lead to fairer election results, effective local representation and greater voter choice. They argue that BC-STV will give voters the power to hold politicians and political parties accountable, by giving every voter a vote that actually makes a difference. If the STV system is approved, then it will be put into use for the first time for the 2013 provincial election. The recognized opponent group is the No STV Campaign Society. Their arguments are that STV will give larger ridings, voters would be unsure of whom their MLA would be, there would be unequal geographic representation, that the counting method is too complicated, the electoral system results are unverified in practical usage, the system results in a higher probability of minority governments and the subsequent coalition of parties. They also argue that other countries who use systems similar to STV have had problems with their election results. $ 500,000 in public funding has been given to both the proponents and the opponents of the referendum. Sister links", "edit_actions": [{"type": "R", "before": "Single Member Plurality to Single Transferable Vote", "after": "to", "start_char_pos": 192, "end_char_pos": 243}, {"type": "R", "before": "Gordon Campbell, Premier", "after": ",", "start_char_pos": 328, "end_char_pos": 352}, {"type": "D", "before": "Angus Reid Strategies", "after": null, "start_char_pos": 390, "end_char_pos": 411}, {"type": "D", "before": "Gordon Campbell", "after": null, "start_char_pos": 527, "end_char_pos": 542}, {"type": "D", "before": "Premier", "after": null, "start_char_pos": 558, "end_char_pos": 565}, {"type": "D", "before": "Liberal Party", "after": null, "start_char_pos": 605, "end_char_pos": 618}, {"type": "D", "before": "New Democratic Party", "after": null, "start_char_pos": 849, "end_char_pos": 869}, {"type": "D", "before": "Carole James", "after": null, "start_char_pos": 883, "end_char_pos": 895}, {"type": "R", "before": "Green Party led by Jane Sterk", "after": ", led by", "start_char_pos": 1166, "end_char_pos": 1195}, {"type": "D", "before": "Carole James, Leader of the New Democratic Party Wilf Hanni", "after": null, "start_char_pos": 1467, "end_char_pos": 1526}, {"type": "D", "before": "Conservative Party", "after": null, "start_char_pos": 1549, "end_char_pos": 1567}, {"type": "R", "before": "Democratic Reform under Graeme Roger, the Marijuana Party under Marc Emery, the Work Less Party under Conrad Schmidt, the Refederation Party under Mike Summers, the Sex Party under John Ince and the Communist Party under George Gidora", "after": "under , the under , the under , the under , the under , and the under", "start_char_pos": 1830, "end_char_pos": 2064}, {"type": "R", "before": "CA$1.1 million, in the final 28 days, $4.4 millionmay be spent. $70,000 is allowed by candidates before the writ is dropped, and another $", "after": "1.1 million, in the final 28 days, $4.4 million may be spent. $", "start_char_pos": 2142, "end_char_pos": 2280}, {"type": "D", "before": "000 in the midst of campaigning.", "after": null, "start_char_pos": 2285, "end_char_pos": 2317}, {"type": "D", "before": "The referendum will allow BC voters to choose between two voting systems. The Single Member Plurality system is the current system in all Canadian provinces, and is also used to elect Members of Parliament in Ottawa. The other system is BC-STV,which would replace 85 single-member ridings with 20 larger ridings in which between two and seven Members of the Legislative Assembly (MLA) would be elected. The total number of MLAs will not change. Voters would rank the candidates in order of preference, as many or as few as they wish. When the results are tallied, votes are transferred to the next preference on the ballot when the first preference has been elected or eliminated. The system is designed to ensure that every vote helps to elect someone, every vote counts as fully as possible, and every voter is represented by a candidate they voted for, as nearly as mathematically possible.", "after": null, "start_char_pos": 2318, "end_char_pos": 3211}, {"type": "D", "before": "Previous elections held under the current Single Member Plurality (also known as First Past The Post) system led to odd results in certain elections, such as the 2001 election where the winning party obtained 77 of the 79 seats of the legislature with just 58\\% of the vote, and the 1996 election, in which the party with the most votes failed to win the election. The recommendation to switch to STV was made by the British Columbia Citizens' Assembly on Electoral Reform, a group formed in 2004 of randomly selected citizens. They spent a year learning about voting systems around the world and consulting with BC citizens.", "after": null, "start_char_pos": 3241, "end_char_pos": 3866}, {"type": "D", "before": "It's the fourth referendum in the country and the second in the province within the last 4 years. The previous referendum held in 2005 also voted on these same electoral systems and came within 2.3\\% of the 60\\% threshold. In order for the referendum to be binding, BC-STV will again need 60\\% of the popular vote and 50\\% of votes in 51 of the 85 ridings in BC. If the change is approved, it will be the first province in the country to adopt reform of the electoral system in recent history.", "after": null, "start_char_pos": 3867, "end_char_pos": 4360}, {"type": "D", "before": "Fair Voting BC, recognized as the official proponent group, argues that STV will lead to fairer election results, effective local representation and greater voter choice. They argue that BC-STV will give voters the power to hold politicians and political parties accountable, by giving every voter a vote that actually makes a difference. If the STV system is approved, then it will be put into use for the first time for the 2013 provincial election.", "after": null, "start_char_pos": 4390, "end_char_pos": 4841}, {"type": "R", "before": "The recognized opponent group is the No STV Campaign Society. Their arguments are that STV will give larger ridings, voters would be unsure of whom their MLA would be, there would be unequal geographic representation, that the counting method is too complicated, the electoral system results are unverified in practical usage, the system results in a higher probability of minority governments and the subsequent coalition of parties. They also argue that other countries who use systems similar to STV have had problems with their election results.", "after": "000 is allowed by candidates before the writ is dropped, and another $70,000 in the midst of campaigning. The referendum will allow BC voters to choose between two voting systems. The system is the current system in all Canadian provinces, and is also used to elect in . The other system is , which would replace 85 single-member ridings with 20 larger ridings in which between two and seven (MLA) would be elected. The total number of MLAs will not change. Voters would rank the candidates in order of preference, as many or as few as they wish. When the results are tallied, votes are transferred to the next preference on the ballot when the first preference has been elected or eliminated. The system is designed to ensure that every vote helps to elect someone, every vote counts as fully as possible, and every voter is represented by a candidate they voted for, as nearly as mathematically possible. Previous elections held under the current Single Member Plurality (also known as First Past The Post) system led to in certain elections, such as the where the winning party obtained 77 of the 79 seats of the legislature with just 58\\% of the vote, and the , in which the party with the most votes failed to win the election. The recommendation to switch to STV was made by the , a group formed in 2004 of randomly selected citizens. They spent a year learning about voting systems around the world and consulting with BC citizens. It's the fourth referendum in the country and the second in the province within the last 4 years. The held in 2005 also voted on these same electoral systems and came within 2.3\\% of the 60\\% threshold. In order for the referendum to be binding, BC-STV will again need 60\\% of the popular vote and 50\\% of votes in 51 of the 85 ridings in BC. If the change is approved, it will be the first province in the country to adopt of the electoral system in recent history. Fair Voting BC, recognized as the official proponent group, argues that STV will lead to fairer election results, effective local representation and greater voter choice. They argue that BC-STV will give voters the power to hold politicians and political parties accountable, by giving every voter a vote that actually makes a difference. If the STV system is approved, then it will be put into use for the first time for the 2013 provincial election. The recognized opponent group is the No STV Campaign Society. Their arguments are that STV will give larger ridings, voters would be unsure of whom their MLA would be, there would be unequal geographic representation, that the counting method is too complicated, the electoral system results are unverified in practical usage, the system results in a higher probability of minority governments and the subsequent coalition of parties. They also argue that other countries who use systems similar to STV have had problems with their election results. $", "start_char_pos": 4842, "end_char_pos": 5391}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 5493, "end_char_pos": 5493}], "sents_char_pos": [0, 61, 250, 327, 526, 620, 802, 844, 1121, 1274, 1415, 1686, 1788, 2066, 2317, 2391, 2534, 2720, 2762, 2851, 2998, 3211, 3605, 3768, 3866, 3964, 4089, 4229, 4360, 4560, 4728, 4841, 4903, 5276, 5391]} {"doc_id": "124562", "revision_depth": "1", "before_revision": "Riots in the capital of MoldovaProtests which began Monday escalated to a riot on Wednesday consisting of over 10,000 people in Chi\u015fin\u0103u , the capital of Moldova, protesting the results of Sunday's 2009 Moldovan parliamentary election , which showed an apparent, narrow victory for the Communist Party (Partidul Comuni\u015ftilor din Republica Moldova, PCRM). Demonstrators claim the victory was the result of electoral fraud. The demonstration escalated to a \u201c flash mob \u201d of between 10,000 to 15,000 communicating via online tools like email, micro-blogging tool Twitter , and social-networking website Facebook . \"We sent messages on Twitter but didn't expect 15,000 people to join in. At the most we expected 1,000\", said Oleg Brega of the activist group Hyde Park. President Voronin President Vladimir Voronin has expelled the Romanian ambassador from Moldova, blaming Romania for the violent protests. \"We know that certain political forces in Romania are behind this unrest. The Romanian flags fixed on the government buildings in Chisinau attest to this\" said Voronin. \u201cRomania is involved in everything that has happened.\u201c Voronin also blamed the protests on opposition leaders who used violence to seize power, and has described the event as a coup d'\u00e9tat . Protesters initially insisted on a recount of the election results and are now calling for a new vote, which has been rejected by the government. Rioters were also demanding unification between Moldova and Romania . \u201cIn the air, there was a strong expectation of change, but that did not happen\u201d, said OSCE spokesman Matti Sidoroff. Dorin Chirtoac\u0103 \"The elections were fraudulent, there was multiple voting\" accused Chi\u015fin\u0103u mayor Dorin Chirtoac\u0103 of the Liberal Party . \u201cIt's impossible that every second person in Moldova voted for the Communists. However, we believe the riots were a provocation and we are now trying to reconcile the crowd. Leaders of all opposition parties are at the scene,\u201d said Larissa Manole of the Liberal Democratic Party of Moldova . The Organisation for Security and Cooperation in Europe (OSCE) proclaimed the PCRM to have won 61 seats in initial counts, enough to guarantee a third term in power for Voronin, who has held the position since 2001. But the Central Election Commission has received evidence of election violations, according to RIA Novosti , and upon recounts conducted of disputed polls, the commission reported that the Communists achieved 49.48\\% of the Moldovian vote, giving them 60 parliamentary seats \u2014 one short of the total needed to win the presidential election. \"The electoral commission also granted opposition parties permission to check voter lists, fulfilling one of their chief demands,\" said Yuri Ciocan, Central Election Commission secretary. Voronin will step down in May, however his party could elect a successor with 61 parliamentary seats without any votes from outside parties as well as amend the Constitution . With the PCRM garnering 60 seats, the opposition will have a voice in the presidential election for a new successor.Riots in the capital of Moldova The western part of Moldova was a part of Romania from the Romania's independence until the region was detached by the USSR in 1940 to form the Moldavian Soviet Socialist Republic . On independence in 1990 the country sought union with Romania but the eastern, Russian- and Ukrainian-inhabited areas of the country declared themselves independent from Moldova and formed the state of Transnistria and movement toward union was halted. Moldova is Europe's poorest country, where average income is less than 250 ( \u00a3 168) a month. The country's neighbours are Romania and Ukraine. Romania is an European Union (EU) state.", "after_revision": "Riots in the capital of MoldovaProtests which began Monday escalated to a on Wednesday consisting of over 10,000 people in , the capital of Moldova, protesting the results of Sunday's , which showed an apparent, narrow victory for the (Partidul Comuni\u015ftilor din Republica Moldova, PCRM). Demonstrators claim the victory was the result of electoral fraud. The demonstration escalated to a \u201c \u201d of between 10,000 to 15,000 communicating via online tools like email, micro-blogging tool , and social-networking website . \"We sent messages on Twitter but didn't expect 15,000 people to join in. At the most we expected 1,000\", said Oleg Brega of the activist group Hyde Park. President Voronin has expelled the Romanian ambassador from Moldova, blaming Romania for the violent protests. \"We know that certain political forces in Romania are behind this unrest. The Romanian flags fixed on the government buildings in Chisinau attest to this\" said Voronin. \u201cRomania is involved in everything that has happened.\u201c Voronin also blamed the protests on opposition leaders who used violence to seize power, and has described the event as a . Protesters initially insisted on a recount of the election results and are now calling for a new vote, which has been rejected by the government. Rioters were also demanding . \u201cIn the air, there was a strong expectation of change, but that did not happen\u201d, said OSCE spokesman Matti Sidoroff. Dorin Chirtoac\u0103 \"The elections were fraudulent, there was multiple voting\" accused Chi\u015fin\u0103u mayor of the . \u201cIt's impossible that every second person in Moldova voted for the Communists. However, we believe the riots were a provocation and we are now trying to reconcile the crowd. Leaders of all opposition parties are at the scene,\u201d said Larissa Manole of the . The (OSCE) proclaimed the PCRM to have won 61 seats in initial counts, enough to guarantee a third term in power for Voronin, who has held the position since 2001. But the Central Election Commission has received evidence of election violations, according to , and upon recounts conducted of disputed polls, the commission reported that the Communists achieved 49.48\\% of the Moldovian vote, giving them 60 parliamentary seats \u2014 one short of the total needed to win the presidential election. \"The electoral commission also granted opposition parties permission to check voter lists, fulfilling one of their chief demands,\" said Yuri Ciocan, Central Election Commission secretary. Voronin will step down in May, however his party could elect a successor with 61 parliamentary seats without any votes from outside parties as well as amend the . With the PCRM garnering 60 seats, the opposition will have a voice in the presidential election for a new successor.Riots in the capital of Moldova The western part of Moldova was a part of Romania from the Romania's independence until the region was detached by the in 1940 to form the . On independence in 1990 the country sought union with Romania but the eastern, Russian- and Ukrainian-inhabited areas of the country declared themselves independent from Moldova and formed the state of Transnistria and movement toward union was halted. Moldova is Europe's poorest country, where average income is less than 250 ( 168) a month. The country's neighbours are Romania and Ukraine. Romania is a European Union (EU) state.", "edit_actions": [{"type": "D", "before": "riot", "after": null, "start_char_pos": 74, "end_char_pos": 78}, {"type": "D", "before": "Chi\u015fin\u0103u", "after": null, "start_char_pos": 128, "end_char_pos": 136}, {"type": "D", "before": "2009 Moldovan parliamentary election", "after": null, "start_char_pos": 198, "end_char_pos": 234}, {"type": "D", "before": "Communist Party", "after": null, "start_char_pos": 286, "end_char_pos": 301}, {"type": "D", "before": "flash mob", "after": null, "start_char_pos": 457, "end_char_pos": 466}, {"type": "D", "before": "Twitter", "after": null, "start_char_pos": 560, "end_char_pos": 567}, {"type": "D", "before": "Facebook", "after": null, "start_char_pos": 600, "end_char_pos": 608}, {"type": "D", "before": "President Vladimir Voronin", "after": null, "start_char_pos": 783, "end_char_pos": 809}, {"type": "D", "before": "coup d'\u00e9tat", "after": null, "start_char_pos": 1249, "end_char_pos": 1260}, {"type": "D", "before": "unification between Moldova and Romania", "after": null, "start_char_pos": 1437, "end_char_pos": 1476}, {"type": "R", "before": "Dorin Chirtoac\u0103 of the Liberal Party", "after": "of the", "start_char_pos": 1694, "end_char_pos": 1730}, {"type": "D", "before": "Liberal Democratic Party of Moldova", "after": null, "start_char_pos": 1987, "end_char_pos": 2022}, {"type": "D", "before": "Organisation for Security and Cooperation in Europe", "after": null, "start_char_pos": 2029, "end_char_pos": 2080}, {"type": "D", "before": "RIA Novosti", "after": null, "start_char_pos": 2336, "end_char_pos": 2347}, {"type": "D", "before": "Constitution", "after": null, "start_char_pos": 2931, "end_char_pos": 2943}, {"type": "D", "before": "USSR", "after": null, "start_char_pos": 3213, "end_char_pos": 3217}, {"type": "D", "before": "Moldavian Soviet Socialist Republic", "after": null, "start_char_pos": 3238, "end_char_pos": 3273}, {"type": "D", "before": "\u00a3", "after": null, "start_char_pos": 3606, "end_char_pos": 3607}, {"type": "R", "before": "an", "after": "a", "start_char_pos": 3683, "end_char_pos": 3685}], "sents_char_pos": [0, 421, 683, 764, 902, 976, 1071, 1125, 1408, 1595, 1811, 1906, 2024, 2240, 2581, 2769, 2945, 3062, 3275, 3528, 3621, 3671]} {"doc_id": "125160", "revision_depth": "1", "before_revision": "Zahi Hawass, Egypt's pre-eminent archaeologist, revealed the first ancient artifacts which may lead to the discovery of Cleopatra and Marc Antony 's resting place. The expedition has found amulets , 22 bronze coins cast with Cleopatra's image and her name, a royal statue, an alabaster mask resembling Marc Antony, and a statue bust of Cleopatra. \"If you look at the face of Mark Antony, many believed he had this cleft on his chin and that's why I thought this could be Mark Antony,\" said Hawass. Recently, outside the temple colourful mummies of nobles were excavated at a neighbouring necropolis . These discoveries have lead the archaeologists to believe that a ruler or person of royalty is interred within the temple itself. It was the practice of the Greco-Roman era to assemble the tombs of persons of status and other high ranking officials near their rulers. \"The discovery of the cemetery this week really convinced me that there is someone important buried inside this temple. No one would be buried outside a temple without a reason. We saw that in the pharaonic days, they were always buried beside pyramids ,\" explained Hawass. Dr. Roger Vickers team used radar to locate three chambers within the rocky hill atop of which is the Temple of Taposiris Magna dedicated to the goddess Isis. The temple was constructed about 300 BC by Ptolemy II . The Supreme Council of Antiquities (SCA) expedition led by Hawass has yet to excavate the burial chambers 40 feet (12 meters) underground where they hope to find a crown or Egyptian hieroglyph cartouches revealing the names of royalty. The team will employ radar again on April 22. The Supreme Council of Antiquities expedition consists of Zahi Hawass, Secretary General of the SCA, and Martinez who has extensively researched the life of Cleopatra. upZahi Hawass According to Plutarch who studied Roman history, Caesar allowed Marc Antony and Cleopatra to be buried in the same tomb. Alexandria is located about from the Temple of Taposiris Magna. The archaeological site is on a hill along the Mediterranean Sea overlooking the summer home of Hosni Mubarak, president of Egypt. The archaeologists fear they may have to postpone work for security reasons over the summer months.", "after_revision": "Zahi Hawass, Egypt's pre-eminent archaeologist, revealed the first which may lead to the discovery of and 's resting place. The expedition has found s , 22 bronze coins cast with Cleopatra's image and her name, a royal statue, an mask resembling Marc Antony, and a of Cleopatra. \"If you look at the face of Mark Antony, many believed he had this cleft on his chin and that's why I thought this could be Mark Antony,\" said Hawass. Recently, outside the temple colourful mummies of nobles were excavated at a neighbouring . These discoveries have lead the archaeologists to believe that a ruler or person of royalty is interred within the temple itself. It was the practice of the to assemble the tombs of persons of status and other high ranking officials near their rulers. \"The discovery of the cemetery this week really convinced me that there is someone important buried inside this temple. No one would be buried outside a temple without a reason. We saw that in the pharaonic days, they were always ,\" explained Hawass. Dr. Roger Vickers team used radar to locate three chambers within the rocky hill atop of which is the Temple of Taposiris Magna dedicated to the goddess Isis. The temple was constructed about 300 BC by . The (SCA) expedition led by Hawass has yet to excavate the burial chambers 40 feet (12 meters) underground where they hope to find a crown or w|cartouche s revealing the names of royalty. The team will employ radar again on April 22. The Supreme Council of Antiquities expedition consists of Zahi Hawass, Secretary General of the SCA, and Martinez who has extensively researched the life of Cleopatra. up According to who studied history, Caesar allowed Marc Antony and Cleopatra to be buried in the same tomb. Alexandria is located about from the Temple of Taposiris Magna. The is on a hill along the overlooking the summer home of Hosni Mubarak, president of Egypt. The archaeologists fear they may have to postpone work for security reasons over the summer months.", "edit_actions": [{"type": "D", "before": "ancient artifacts", "after": null, "start_char_pos": 67, "end_char_pos": 84}, {"type": "R", "before": "Cleopatra and Marc Antony", "after": "and", "start_char_pos": 120, "end_char_pos": 145}, {"type": "R", "before": "amulets", "after": "s", "start_char_pos": 189, "end_char_pos": 196}, {"type": "D", "before": "alabaster", "after": null, "start_char_pos": 276, "end_char_pos": 285}, {"type": "D", "before": "statue bust", "after": null, "start_char_pos": 321, "end_char_pos": 332}, {"type": "D", "before": "necropolis", "after": null, "start_char_pos": 588, "end_char_pos": 598}, {"type": "D", "before": "Greco-Roman era", "after": null, "start_char_pos": 758, "end_char_pos": 773}, {"type": "D", "before": "buried beside pyramids", "after": null, "start_char_pos": 1099, "end_char_pos": 1121}, {"type": "D", "before": "Ptolemy II", "after": null, "start_char_pos": 1345, "end_char_pos": 1355}, {"type": "D", "before": "Supreme Council of Antiquities", "after": null, "start_char_pos": 1362, "end_char_pos": 1392}, {"type": "R", "before": "Egyptian hieroglyph cartouches", "after": "w|cartouche", "start_char_pos": 1531, "end_char_pos": 1561}, {"type": "A", "before": null, "after": "s", "start_char_pos": 1562, "end_char_pos": 1562}, {"type": "R", "before": "upZahi Hawass According to Plutarch who studied Roman", "after": "up According to who studied", "start_char_pos": 1809, "end_char_pos": 1862}, {"type": "D", "before": "archaeological site", "after": null, "start_char_pos": 2012, "end_char_pos": 2031}, {"type": "D", "before": "Mediterranean Sea", "after": null, "start_char_pos": 2055, "end_char_pos": 2072}], "sents_char_pos": [0, 163, 346, 497, 600, 730, 868, 988, 1046, 1142, 1301, 1357, 1594, 1640, 1943, 2007, 2138]} {"doc_id": "126007", "revision_depth": "2", "before_revision": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna sf d f f f d f dsg dh j fgj f gj fgjk Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna sf d f f f d f dsg dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h j hj%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h h ghk%DIFDELCMD < %DIFDELCMD < %%% l k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' ' k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j j j%DIFDELCMD < %DIFDELCMD < %%% j Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna%DIFDELCMD < %DIFDELCMD < %%% sf d f f f d f dsg dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% j j%DIFDELCMD < %DIFDELCMD < %%% Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna%DIFDELCMD < %DIFDELCMD < %%% sf d f f f d f dsg%DIFDELCMD < %DIFDELCMD < %%% dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg%DIFDELCMD < %DIFDELCMD < %%% gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna%DIFDELCMD < %DIFDELCMD < %%% sf d f f f d f dsg%DIFDELCMD < %DIFDELCMD < %%% dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg%DIFDELCMD < %DIFDELCMD < %%% gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna%DIFDELCMD < %DIFDELCMD < %%% sf d f f f d f dsg%DIFDELCMD < %DIFDELCMD < %%% dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg%DIFDELCMD < %DIFDELCMD < %%% gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna sf d f f f d f dsg dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg%DIFDELCMD < %DIFDELCMD < %%% gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna%DIFDELCMD < %DIFDELCMD < %%% sf d f f f d f dsg%DIFDELCMD < %DIFDELCMD < %%% dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg%DIFDELCMD < %DIFDELCMD < %%% gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna%DIFDELCMD < %DIFDELCMD < %%% sf d f f f d f dsg%DIFDELCMD < %DIFDELCMD < %%% dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg%DIFDELCMD < %DIFDELCMD < %%% gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna%DIFDELCMD < %DIFDELCMD < %%% sf d f f f d f dsg%DIFDELCMD < %DIFDELCMD < %%% dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg%DIFDELCMD < %DIFDELCMD < %%% gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna%DIFDELCMD < %DIFDELCMD < %%% sf d f f f d f dsg%DIFDELCMD < %DIFDELCMD < %%% dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg%DIFDELCMD < %DIFDELCMD < %%% gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% j j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% j j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% j j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j j%DIFDELCMD < %DIFDELCMD < %%% j j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% j j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j j j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% j j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j j j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j%DIFDELCMD < %DIFDELCMD < %%% j f j gjfgj fg jfg j fgj g gj%DIFDELCMD < %DIFDELCMD < %%% gjg%DIFDELCMD < %DIFDELCMD < %%% gj gj jggj%DIFDELCMD < %DIFDELCMD < %%% g fgj fg%DIFDELCMD < %DIFDELCMD < %%% gj g gfj fgj gh k ghk f gk d gj xd d y%DIFDELCMD < %DIFDELCMD < %%% fy d hd h fd h f f dfg s h f%DIFDELCMD < %DIFDELCMD < %%% f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd%DIFDELCMD < %DIFDELCMD < %%% g df f f%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% hk j j k j%DIFDELCMD < %DIFDELCMD < %%% jkh%DIFDELCMD < %DIFDELCMD < %%% h j hj j h%DIFDELCMD < %DIFDELCMD < %%% j hj%DIFDELCMD < %DIFDELCMD < %%% hj h%DIFDELCMD < %DIFDELCMD < %%% h h%DIFDELCMD < %DIFDELCMD < %%% hj h h h%DIFDELCMD < %DIFDELCMD < %%% h ghk%DIFDELCMD < %DIFDELCMD < %%% l%DIFDELCMD < %DIFDELCMD < %%% k%DIFDELCMD < %DIFDELCMD < %%% llkl j k kll'k l' '%DIFDELCMD < %DIFDELCMD < %%% k kl; kl lkkl lk kl lk'%DIFDELCMD < %DIFDELCMD < %%% lklk kjkh%DIFDELCMD < %DIFDELCMD < %%% k h h k j k%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% j j%DIFDELCMD < %DIFDELCMD < %%% j%DIFDELCMD < %DIFDELCMD < %%% jk j", "after_revision": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. \"In the final structure, 10 brands shall stand below an integrative leading company alongside each other, whereby the independence of all brands and explicitly also of Porsche shall be ensured,\" said the Porsche Automobil Holding SE company. A task force has been set into place to discuss details of the merger over the next month. This task force embraces managers and representatives from the works council of both companies as well as the state of Lower Saxony. up2010 Porsche 911 photographed at the 2009 Montreal International Auto Show Porsche based in Stuttgart, Germany was previously controlled by the Porsche and Pi\u00ebch families voting stock. Porsche had previously tried to raise its 51\\% shares in Volkswagen to 75\\% in a take-over bid. A special German law grants Lower Saxony enough power to veto decisions with its 20\\% share in the VW company. %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% upVW Golf VI GTI \"I'm certain that we can and will advance our partnership in the difficult current year 2009, and have the stuff to develop the powerhouse of the international automobile industry\" said Martin Winterkorn chairman of the Volkswagen Group (Volkswagen AG) and Scania AB. The merger would help Porsche with its \u20ac9 billion debt which it incurred partially due to the ailing economy as well as its attempt at a takeover bid. %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% Related news", "edit_actions": [{"type": "D", "before": "8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": null, "start_char_pos": 130, "end_char_pos": 221}, {"type": "R", "before": "sf d f f f d f dsg", "after": "\"In the final structure, 10 brands shall stand below an integrative leading company alongside each other, whereby the independence of all brands and explicitly also of Porsche shall be ensured,\" said the Porsche Automobil Holding SE company.", "start_char_pos": 222, "end_char_pos": 240}, {"type": "R", "before": "dh j fgj f gj fgjk", "after": "A task force has been set into place to discuss details of the merger over the next month. This task force embraces managers and representatives from the works council of both companies as well as the state of Lower Saxony. up2010 Porsche 911 photographed at the 2009 Montreal International Auto Show Porsche based in Stuttgart, Germany was previously controlled by the Porsche and Pi\u00ebch families voting stock.", "start_char_pos": 241, "end_char_pos": 259}, {"type": "R", "before": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": "Porsche had previously tried to raise its 51\\% shares in Volkswagen to 75\\% in a take-over bid. A special German law grants Lower Saxony enough power to veto decisions with its 20\\% share in the VW company.", "start_char_pos": 260, "end_char_pos": 481}, {"type": "D", "before": "sf d f f f d f dsg", "after": null, "start_char_pos": 482, "end_char_pos": 500}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 501, "end_char_pos": 547}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 577, "end_char_pos": 580}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 581, "end_char_pos": 591}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 621, "end_char_pos": 629}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 630, "end_char_pos": 668}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 698, "end_char_pos": 726}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 727, "end_char_pos": 790}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 820, "end_char_pos": 828}, {"type": "D", "before": "j", "after": null, "start_char_pos": 829, "end_char_pos": 830}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 860, "end_char_pos": 870}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 871, "end_char_pos": 874}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 904, "end_char_pos": 914}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 915, "end_char_pos": 919}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 949, "end_char_pos": 953}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 954, "end_char_pos": 957}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 987, "end_char_pos": 995}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 996, "end_char_pos": 1001}, {"type": "D", "before": "l", "after": null, "start_char_pos": 1031, "end_char_pos": 1032}, {"type": "D", "before": "k", "after": null, "start_char_pos": 1033, "end_char_pos": 1034}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 1064, "end_char_pos": 1083}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 1084, "end_char_pos": 1107}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 1137, "end_char_pos": 1146}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 1147, "end_char_pos": 1158}, {"type": "D", "before": "j", "after": null, "start_char_pos": 1188, "end_char_pos": 1189}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 1190, "end_char_pos": 1193}, {"type": "D", "before": "j", "after": null, "start_char_pos": 1223, "end_char_pos": 1224}, {"type": "D", "before": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": null, "start_char_pos": 1225, "end_char_pos": 1446}, {"type": "D", "before": "sf d f f f d f dsg", "after": null, "start_char_pos": 1476, "end_char_pos": 1494}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 1495, "end_char_pos": 1541}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 1571, "end_char_pos": 1574}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 1575, "end_char_pos": 1585}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 1615, "end_char_pos": 1623}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 1653, "end_char_pos": 1691}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 1721, "end_char_pos": 1749}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 1779, "end_char_pos": 1842}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 1872, "end_char_pos": 1880}, {"type": "D", "before": "j", "after": null, "start_char_pos": 1910, "end_char_pos": 1911}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 1941, "end_char_pos": 1951}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 1981, "end_char_pos": 1984}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 2014, "end_char_pos": 2024}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 2054, "end_char_pos": 2058}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 2088, "end_char_pos": 2092}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 2122, "end_char_pos": 2125}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 2155, "end_char_pos": 2163}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 2193, "end_char_pos": 2198}, {"type": "D", "before": "l", "after": null, "start_char_pos": 2228, "end_char_pos": 2229}, {"type": "D", "before": "k", "after": null, "start_char_pos": 2259, "end_char_pos": 2260}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 2290, "end_char_pos": 2309}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 2339, "end_char_pos": 2362}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 2392, "end_char_pos": 2401}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 2431, "end_char_pos": 2442}, {"type": "D", "before": "j", "after": null, "start_char_pos": 2472, "end_char_pos": 2473}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 2503, "end_char_pos": 2506}, {"type": "D", "before": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": null, "start_char_pos": 2536, "end_char_pos": 2757}, {"type": "D", "before": "sf d f f f d f dsg", "after": null, "start_char_pos": 2787, "end_char_pos": 2805}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 2835, "end_char_pos": 2881}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 2911, "end_char_pos": 2914}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 2944, "end_char_pos": 2954}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 2984, "end_char_pos": 2992}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 3022, "end_char_pos": 3060}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 3090, "end_char_pos": 3118}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 3148, "end_char_pos": 3211}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 3241, "end_char_pos": 3249}, {"type": "D", "before": "j", "after": null, "start_char_pos": 3279, "end_char_pos": 3280}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 3310, "end_char_pos": 3320}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 3350, "end_char_pos": 3353}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 3383, "end_char_pos": 3393}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 3423, "end_char_pos": 3427}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 3457, "end_char_pos": 3461}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 3491, "end_char_pos": 3494}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 3524, "end_char_pos": 3532}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 3562, "end_char_pos": 3567}, {"type": "D", "before": "l", "after": null, "start_char_pos": 3597, "end_char_pos": 3598}, {"type": "D", "before": "k", "after": null, "start_char_pos": 3628, "end_char_pos": 3629}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 3659, "end_char_pos": 3678}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 3708, "end_char_pos": 3731}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 3761, "end_char_pos": 3770}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 3800, "end_char_pos": 3811}, {"type": "D", "before": "j", "after": null, "start_char_pos": 3841, "end_char_pos": 3842}, {"type": "D", "before": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": null, "start_char_pos": 3872, "end_char_pos": 4093}, {"type": "D", "before": "sf d f f f d f dsg", "after": null, "start_char_pos": 4123, "end_char_pos": 4141}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 4171, "end_char_pos": 4217}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 4247, "end_char_pos": 4250}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 4280, "end_char_pos": 4290}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 4320, "end_char_pos": 4328}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 4358, "end_char_pos": 4396}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 4426, "end_char_pos": 4454}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 4484, "end_char_pos": 4547}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 4577, "end_char_pos": 4585}, {"type": "D", "before": "j", "after": null, "start_char_pos": 4615, "end_char_pos": 4616}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 4646, "end_char_pos": 4656}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 4686, "end_char_pos": 4689}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 4719, "end_char_pos": 4729}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 4759, "end_char_pos": 4763}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 4793, "end_char_pos": 4797}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 4827, "end_char_pos": 4830}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 4860, "end_char_pos": 4868}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 4898, "end_char_pos": 4903}, {"type": "D", "before": "l", "after": null, "start_char_pos": 4933, "end_char_pos": 4934}, {"type": "D", "before": "k", "after": null, "start_char_pos": 4964, "end_char_pos": 4965}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 4995, "end_char_pos": 5014}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 5044, "end_char_pos": 5067}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 5097, "end_char_pos": 5106}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 5136, "end_char_pos": 5147}, {"type": "D", "before": "j", "after": null, "start_char_pos": 5177, "end_char_pos": 5178}, {"type": "D", "before": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": null, "start_char_pos": 5208, "end_char_pos": 5429}, {"type": "D", "before": "sf d f f f d f dsg", "after": null, "start_char_pos": 5459, "end_char_pos": 5477}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 5507, "end_char_pos": 5553}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 5583, "end_char_pos": 5586}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 5616, "end_char_pos": 5626}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 5656, "end_char_pos": 5664}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 5694, "end_char_pos": 5732}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 5762, "end_char_pos": 5790}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 5820, "end_char_pos": 5883}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 5913, "end_char_pos": 5921}, {"type": "D", "before": "j", "after": null, "start_char_pos": 5951, "end_char_pos": 5952}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 5982, "end_char_pos": 5992}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 6022, "end_char_pos": 6025}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 6055, "end_char_pos": 6065}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 6095, "end_char_pos": 6099}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 6129, "end_char_pos": 6133}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 6163, "end_char_pos": 6166}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 6196, "end_char_pos": 6204}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 6234, "end_char_pos": 6239}, {"type": "D", "before": "l", "after": null, "start_char_pos": 6269, "end_char_pos": 6270}, {"type": "D", "before": "k", "after": null, "start_char_pos": 6300, "end_char_pos": 6301}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 6331, "end_char_pos": 6350}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 6380, "end_char_pos": 6403}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 6433, "end_char_pos": 6442}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 6472, "end_char_pos": 6483}, {"type": "D", "before": "j", "after": null, "start_char_pos": 6513, "end_char_pos": 6514}, {"type": "R", "before": "Porsche", "after": "upVW Golf VI GTI \"I'm certain that we can and will advance our partnership in the difficult current year 2009,", "start_char_pos": 6544, "end_char_pos": 6551}, {"type": "R", "before": "Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": "have the stuff to develop the powerhouse of the international automobile industry\" said Martin Winterkorn chairman of the Volkswagen Group (Volkswagen AG) and Scania AB.", "start_char_pos": 6556, "end_char_pos": 6765}, {"type": "R", "before": "sf d f f f d f dsg", "after": "The merger would help Porsche with its \u20ac9 billion debt which it incurred partially due to the ailing economy as well as its attempt at a takeover bid.", "start_char_pos": 6766, "end_char_pos": 6784}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 6785, "end_char_pos": 6831}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 6861, "end_char_pos": 6864}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 6894, "end_char_pos": 6904}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 6934, "end_char_pos": 6942}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 6972, "end_char_pos": 7010}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 7040, "end_char_pos": 7068}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 7098, "end_char_pos": 7161}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 7191, "end_char_pos": 7199}, {"type": "D", "before": "j", "after": null, "start_char_pos": 7229, "end_char_pos": 7230}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 7260, "end_char_pos": 7270}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 7300, "end_char_pos": 7303}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 7333, "end_char_pos": 7343}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 7373, "end_char_pos": 7377}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 7407, "end_char_pos": 7411}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 7441, "end_char_pos": 7444}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 7474, "end_char_pos": 7482}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 7512, "end_char_pos": 7517}, {"type": "D", "before": "l", "after": null, "start_char_pos": 7547, "end_char_pos": 7548}, {"type": "D", "before": "k", "after": null, "start_char_pos": 7578, "end_char_pos": 7579}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 7609, "end_char_pos": 7628}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 7658, "end_char_pos": 7681}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 7711, "end_char_pos": 7720}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 7750, "end_char_pos": 7761}, {"type": "D", "before": "j", "after": null, "start_char_pos": 7791, "end_char_pos": 7792}, {"type": "D", "before": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": null, "start_char_pos": 7822, "end_char_pos": 8043}, {"type": "D", "before": "sf d f f f d f dsg", "after": null, "start_char_pos": 8073, "end_char_pos": 8091}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 8121, "end_char_pos": 8167}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 8197, "end_char_pos": 8200}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 8230, "end_char_pos": 8240}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 8270, "end_char_pos": 8278}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 8308, "end_char_pos": 8346}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 8376, "end_char_pos": 8404}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 8434, "end_char_pos": 8497}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 8527, "end_char_pos": 8535}, {"type": "D", "before": "j", "after": null, "start_char_pos": 8565, "end_char_pos": 8566}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 8596, "end_char_pos": 8606}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 8636, "end_char_pos": 8639}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 8669, "end_char_pos": 8679}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 8709, "end_char_pos": 8713}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 8743, "end_char_pos": 8747}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 8777, "end_char_pos": 8780}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 8810, "end_char_pos": 8818}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 8848, "end_char_pos": 8853}, {"type": "D", "before": "l", "after": null, "start_char_pos": 8883, "end_char_pos": 8884}, {"type": "D", "before": "k", "after": null, "start_char_pos": 8914, "end_char_pos": 8915}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 8945, "end_char_pos": 8964}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 8994, "end_char_pos": 9017}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 9047, "end_char_pos": 9056}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 9086, "end_char_pos": 9097}, {"type": "D", "before": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": null, "start_char_pos": 9127, "end_char_pos": 9348}, {"type": "D", "before": "sf d f f f d f dsg", "after": null, "start_char_pos": 9378, "end_char_pos": 9396}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 9426, "end_char_pos": 9472}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 9502, "end_char_pos": 9505}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 9535, "end_char_pos": 9545}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 9575, "end_char_pos": 9583}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 9613, "end_char_pos": 9651}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 9681, "end_char_pos": 9709}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 9739, "end_char_pos": 9802}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 9832, "end_char_pos": 9840}, {"type": "D", "before": "j", "after": null, "start_char_pos": 9870, "end_char_pos": 9871}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 9901, "end_char_pos": 9911}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 9941, "end_char_pos": 9944}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 9974, "end_char_pos": 9984}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 10014, "end_char_pos": 10018}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 10048, "end_char_pos": 10052}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 10082, "end_char_pos": 10085}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 10115, "end_char_pos": 10123}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 10153, "end_char_pos": 10158}, {"type": "D", "before": "l", "after": null, "start_char_pos": 10188, "end_char_pos": 10189}, {"type": "D", "before": "k", "after": null, "start_char_pos": 10219, "end_char_pos": 10220}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 10250, "end_char_pos": 10269}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 10299, "end_char_pos": 10322}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 10352, "end_char_pos": 10361}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 10391, "end_char_pos": 10402}, {"type": "D", "before": "j", "after": null, "start_char_pos": 10432, "end_char_pos": 10433}, {"type": "D", "before": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": null, "start_char_pos": 10463, "end_char_pos": 10684}, {"type": "D", "before": "sf d f f f d f dsg", "after": null, "start_char_pos": 10714, "end_char_pos": 10732}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 10762, "end_char_pos": 10808}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 10838, "end_char_pos": 10841}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 10871, "end_char_pos": 10881}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 10911, "end_char_pos": 10919}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 10949, "end_char_pos": 10987}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 11017, "end_char_pos": 11045}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 11075, "end_char_pos": 11138}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 11168, "end_char_pos": 11176}, {"type": "D", "before": "j", "after": null, "start_char_pos": 11206, "end_char_pos": 11207}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 11237, "end_char_pos": 11247}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 11277, "end_char_pos": 11280}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 11310, "end_char_pos": 11320}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 11350, "end_char_pos": 11354}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 11384, "end_char_pos": 11388}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 11418, "end_char_pos": 11421}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 11451, "end_char_pos": 11459}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 11489, "end_char_pos": 11494}, {"type": "D", "before": "l", "after": null, "start_char_pos": 11524, "end_char_pos": 11525}, {"type": "D", "before": "k", "after": null, "start_char_pos": 11555, "end_char_pos": 11556}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 11586, "end_char_pos": 11605}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 11635, "end_char_pos": 11658}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 11688, "end_char_pos": 11697}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 11727, "end_char_pos": 11738}, {"type": "D", "before": "j", "after": null, "start_char_pos": 11768, "end_char_pos": 11769}, {"type": "D", "before": "Porsche and Volkswagen family owners agreed to merge together Wednesday to create one large \u201cintegrated car-manufacturing group\u201d. 8=====D fuck you guys you suck dickkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkksnfdasjknfjsna", "after": null, "start_char_pos": 11799, "end_char_pos": 12020}, {"type": "D", "before": "sf d f f f d f dsg", "after": null, "start_char_pos": 12050, "end_char_pos": 12068}, {"type": "D", "before": "dh j fgj f gj fgjk f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 12098, "end_char_pos": 12144}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 12174, "end_char_pos": 12177}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 12207, "end_char_pos": 12217}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 12247, "end_char_pos": 12255}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 12285, "end_char_pos": 12323}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 12353, "end_char_pos": 12381}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 12411, "end_char_pos": 12474}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 12504, "end_char_pos": 12512}, {"type": "D", "before": "j", "after": null, "start_char_pos": 12542, "end_char_pos": 12543}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 12573, "end_char_pos": 12583}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 12613, "end_char_pos": 12616}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 12646, "end_char_pos": 12656}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 12686, "end_char_pos": 12690}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 12720, "end_char_pos": 12724}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 12754, "end_char_pos": 12757}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 12787, "end_char_pos": 12795}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 12825, "end_char_pos": 12830}, {"type": "D", "before": "l", "after": null, "start_char_pos": 12860, "end_char_pos": 12861}, {"type": "D", "before": "k", "after": null, "start_char_pos": 12891, "end_char_pos": 12892}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 12922, "end_char_pos": 12941}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 12971, "end_char_pos": 12994}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 13024, "end_char_pos": 13033}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 13063, "end_char_pos": 13074}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13104, "end_char_pos": 13105}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 13135, "end_char_pos": 13138}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13168, "end_char_pos": 13169}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 13199, "end_char_pos": 13203}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13233, "end_char_pos": 13234}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 13264, "end_char_pos": 13267}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13297, "end_char_pos": 13298}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 13328, "end_char_pos": 13332}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13362, "end_char_pos": 13363}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 13393, "end_char_pos": 13396}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13426, "end_char_pos": 13427}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 13457, "end_char_pos": 13461}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 13491, "end_char_pos": 13494}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 13524, "end_char_pos": 13527}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13557, "end_char_pos": 13558}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 13588, "end_char_pos": 13592}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13622, "end_char_pos": 13623}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 13653, "end_char_pos": 13656}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13686, "end_char_pos": 13687}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 13717, "end_char_pos": 13721}, {"type": "D", "before": "j j j", "after": null, "start_char_pos": 13751, "end_char_pos": 13756}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13786, "end_char_pos": 13787}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 13817, "end_char_pos": 13821}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13851, "end_char_pos": 13852}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 13882, "end_char_pos": 13885}, {"type": "D", "before": "j", "after": null, "start_char_pos": 13915, "end_char_pos": 13916}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 13946, "end_char_pos": 13950}, {"type": "D", "before": "j j j", "after": null, "start_char_pos": 13980, "end_char_pos": 13985}, {"type": "D", "before": "j", "after": null, "start_char_pos": 14015, "end_char_pos": 14016}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 14046, "end_char_pos": 14050}, {"type": "D", "before": "j", "after": null, "start_char_pos": 14080, "end_char_pos": 14081}, {"type": "D", "before": "j", "after": null, "start_char_pos": 14111, "end_char_pos": 14112}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 14142, "end_char_pos": 14146}, {"type": "D", "before": "j", "after": null, "start_char_pos": 14176, "end_char_pos": 14177}, {"type": "D", "before": "jk j", "after": null, "start_char_pos": 14207, "end_char_pos": 14211}, {"type": "D", "before": "j f j gjfgj fg jfg j fgj g gj", "after": null, "start_char_pos": 14241, "end_char_pos": 14270}, {"type": "D", "before": "gjg", "after": null, "start_char_pos": 14300, "end_char_pos": 14303}, {"type": "D", "before": "gj gj jggj", "after": null, "start_char_pos": 14333, "end_char_pos": 14343}, {"type": "D", "before": "g fgj fg", "after": null, "start_char_pos": 14373, "end_char_pos": 14381}, {"type": "D", "before": "gj g gfj fgj gh k ghk f gk d gj xd d y", "after": null, "start_char_pos": 14411, "end_char_pos": 14449}, {"type": "D", "before": "fy d hd h fd h f f dfg s h f", "after": null, "start_char_pos": 14479, "end_char_pos": 14507}, {"type": "D", "before": "f h fg h h g h gjg j g j g j g j g j f d g df g d fg df g f gfd", "after": null, "start_char_pos": 14537, "end_char_pos": 14600}, {"type": "D", "before": "g df f f", "after": null, "start_char_pos": 14630, "end_char_pos": 14638}, {"type": "D", "before": "j", "after": null, "start_char_pos": 14668, "end_char_pos": 14669}, {"type": "D", "before": "hk j j k j", "after": null, "start_char_pos": 14699, "end_char_pos": 14709}, {"type": "D", "before": "jkh", "after": null, "start_char_pos": 14739, "end_char_pos": 14742}, {"type": "D", "before": "h j hj j h", "after": null, "start_char_pos": 14772, "end_char_pos": 14782}, {"type": "D", "before": "j hj", "after": null, "start_char_pos": 14812, "end_char_pos": 14816}, {"type": "D", "before": "hj h", "after": null, "start_char_pos": 14846, "end_char_pos": 14850}, {"type": "D", "before": "h h", "after": null, "start_char_pos": 14880, "end_char_pos": 14883}, {"type": "D", "before": "hj h h h", "after": null, "start_char_pos": 14913, "end_char_pos": 14921}, {"type": "D", "before": "h ghk", "after": null, "start_char_pos": 14951, "end_char_pos": 14956}, {"type": "D", "before": "l", "after": null, "start_char_pos": 14986, "end_char_pos": 14987}, {"type": "D", "before": "k", "after": null, "start_char_pos": 15017, "end_char_pos": 15018}, {"type": "D", "before": "llkl j k kll'k l' '", "after": null, "start_char_pos": 15048, "end_char_pos": 15067}, {"type": "D", "before": "k kl; kl lkkl lk kl lk'", "after": null, "start_char_pos": 15097, "end_char_pos": 15120}, {"type": "D", "before": "lklk kjkh", "after": null, "start_char_pos": 15150, "end_char_pos": 15159}, {"type": "D", "before": "k h h k j k", "after": null, "start_char_pos": 15189, "end_char_pos": 15200}, {"type": "D", "before": "j", "after": null, "start_char_pos": 15230, "end_char_pos": 15231}, {"type": "D", "before": "j j", "after": null, "start_char_pos": 15261, "end_char_pos": 15264}, {"type": "D", "before": "j", "after": null, "start_char_pos": 15294, "end_char_pos": 15295}, {"type": "R", "before": "jk j", "after": "Related news", "start_char_pos": 15325, "end_char_pos": 15329}], "sents_char_pos": [0, 129, 389, 403, 416, 482, 493, 504, 515, 530, 543, 558, 571, 584, 602, 1089, 1354, 1368, 1381, 1457, 1470, 1481, 1495, 1506, 1518, 1531, 1552, 1565, 1578, 1596, 1609, 1621, 1634, 1647, 1658, 1669, 1680, 1702, 1715, 1726, 1738, 1760, 1773, 1786, 1798, 1810, 1822, 2307, 2344, 2665, 2679, 2692, 2768, 2781, 2792, 2816, 2829, 2840, 2854, 2867, 2879, 2892, 2905, 2925, 2938, 2950, 2965, 2978, 2990, 3003, 3016, 3027, 3038, 3049, 3071, 3084, 3095, 3107, 3129, 3142, 3155, 3167, 3179, 3191, 3676, 3713, 4001, 4015, 4028, 4104, 4117, 4128, 4152, 4165, 4176, 4190, 4203, 4215, 4228, 4241, 4261, 4274, 4286, 4301, 4314, 4326, 4339, 4352, 4363, 4374, 4385, 4407, 4420, 4431, 4443, 4465, 4478, 4491, 4503, 4515, 4527, 5012, 5049, 5337, 5351, 5364, 5440, 5453, 5464, 5488, 5501, 5512, 5526, 5539, 5551, 5564, 5577, 5597, 5610, 5622, 5637, 5650, 5662, 5675, 5688, 5699, 5710, 5721, 5743, 5756, 5767, 5779, 5801, 5814, 5827, 5839, 5851, 5863, 6348, 6385, 6673, 6687, 6700, 6766, 6777, 6788, 6799, 6814, 6827, 6842, 6855, 6875, 6888, 6900, 6915, 6928, 6940, 6953, 6966, 6977, 6988, 6999, 7021, 7034, 7045, 7057, 7079, 7092, 7105, 7117, 7129, 7141, 7626, 7663, 7951, 7965, 7978, 8054, 8067, 8078, 8102, 8115, 8126, 8140, 8153, 8165, 8178, 8191, 8211, 8224, 8236, 8251, 8264, 8276, 8289, 8302, 8313, 8324, 8335, 8357, 8370, 8381, 8393, 8415, 8428, 8441, 8453, 8465, 8477, 8962, 8999, 9256, 9270, 9283, 9359, 9372, 9383, 9407, 9420, 9431, 9445, 9458, 9470, 9483, 9496, 9516, 9529, 9541, 9556, 9569, 9581, 9594, 9607, 9618, 9629, 9640, 9662, 9675, 9686, 9698, 9720, 9733, 9746, 9758, 9770, 9782, 10267, 10304, 10592, 10606, 10619, 10695, 10708, 10719, 10743, 10756, 10767, 10781, 10794, 10806, 10819, 10832, 10852, 10865, 10877, 10892, 10905, 10917, 10930, 10943, 10954, 10965, 10976, 10998, 11011, 11022, 11034, 11056, 11069, 11082, 11094, 11106, 11118, 11603, 11640, 11928, 11942, 11955, 12031, 12044, 12055, 12079, 12092, 12103, 12117, 12130, 12142, 12155, 12168, 12188, 12201, 12213, 12228, 12241, 12253, 12266, 12279, 12290, 12301, 12312, 12334, 12347, 12358, 12370, 12392, 12405, 12418, 12430, 12442, 12454, 12939, 12976, 12988, 13005, 13018, 13029, 13044, 13057, 13069, 13085, 13098, 13116, 13129, 13149, 13162, 13180, 13193, 13214, 13227, 13245, 13258, 13278, 13291, 13309, 13322, 13343, 13356, 13374, 13387, 13407, 13420, 13438, 13451, 13472, 13485, 13505, 13518, 13538, 13551, 13569, 13582, 13603, 13616, 13634, 13647, 13667, 13680, 13698, 13711, 13732, 13745, 13767, 13780, 13798, 13811, 13832, 13845, 13863, 13876, 13896, 13909, 13927, 13940, 13961, 13974, 13996, 14009, 14027, 14040, 14061, 14074, 14092, 14105, 14123, 14136, 14157, 14170, 14188, 14201, 14222, 14235, 14247, 14260, 14281, 14294, 14314, 14327, 14339, 14354, 14367, 14379, 14392, 14405, 14416, 14427, 14438, 14460, 14473, 14484, 14496, 14518, 14531, 14544, 14556, 14568, 14580, 15065, 15102]} {"doc_id": "126085", "revision_depth": "2", "before_revision": "Jesusita Fire climbing the side of Barger (Brush) Peak; from th111111111111111111111111111111111111111e west The recent w:111111111111111, 600 acres of land over the last four days. Over 75 homes were des11111111111111troyed , and more than1 30,500 residents were evacuated. Anothe1111111111111111111111111111111111111r 23, 00011111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 are on standby to 11111111111111111111111leave immediately when the 11Maria Dillon |pub=Ass111111ociated Press|date=May 9,2009 URL Moore | pub111 ", "after_revision": "Jesusita Fire climbing the side of Barger (Brush) Peak; from the west The recent Jesusita Fire in Santa Barbara County, California, has burned more than 8, 600 acres of land over the last four days. Over 75 homes were destroyed , and more than 30,500 residents were evacuated. Another 23, 000 are on standby to leave immediately when the notice comes down. Approximately 3,500 homes along with 100 businesses are currently threatened by the blaze. \"Right now, if you are not evacuated in the Santa Barbara area, you are sheltering evacuees,\" said city Fire Chief Andrew DiMizio, \"We saw the fire spread laterally across the top of the city and the fire front extend to almost eight kilometers now.\" The firefighting crew on guard against the fire has amassed 2,300 firefighters with 246 fire engines, fourteen air tankers, fifteen helicopters as well as a DC-10 jumbo jet tanker. There have been no reports of residents being injured, however 11 firefighters have sustained injuries battling the fire, placing three in the hospital. | The Montecito Tea Fire in 2008 Related news", "edit_actions": [{"type": "R", "before": "th111111111111111111111111111111111111111e", "after": "the", "start_char_pos": 61, "end_char_pos": 103}, {"type": "R", "before": "w:111111111111111,", "after": "Jesusita Fire in Santa Barbara County, California, has burned more than 8,", "start_char_pos": 120, "end_char_pos": 138}, {"type": "R", "before": "des11111111111111troyed", "after": "destroyed", "start_char_pos": 201, "end_char_pos": 224}, {"type": "R", "before": "than1", "after": "than", "start_char_pos": 236, "end_char_pos": 241}, {"type": "R", "before": "Anothe1111111111111111111111111111111111111r", "after": "Another", "start_char_pos": 275, "end_char_pos": 319}, {"type": "R", "before": "00011111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "after": "000", "start_char_pos": 324, "end_char_pos": 476}, {"type": "R", "before": "11111111111111111111111leave", "after": "leave", "start_char_pos": 495, "end_char_pos": 523}, {"type": "R", "before": "11Maria Dillon |pub=Ass111111ociated Press|date=May 9,2009", "after": "notice comes down.", "start_char_pos": 545, "end_char_pos": 603}, {"type": "R", "before": "URL Moore", "after": "Approximately 3,500 homes along with 100 businesses are currently threatened by the blaze.", "start_char_pos": 604, "end_char_pos": 613}, {"type": "A", "before": null, "after": "\"Right now, if you are not evacuated in the Santa Barbara area, you are sheltering evacuees,\" said city Fire Chief Andrew DiMizio, \"We saw the fire spread laterally across the top of the city and the fire front extend to almost eight kilometers now.\"", "start_char_pos": 614, "end_char_pos": 614}, {"type": "A", "before": null, "after": "The firefighting crew on guard against the fire has amassed 2,300 firefighters with 246 fire engines, fourteen air tankers, fifteen helicopters as well as a DC-10 jumbo jet tanker.", "start_char_pos": 615, "end_char_pos": 615}, {"type": "A", "before": null, "after": "There have been no reports of residents being injured, however 11 firefighters have sustained injuries battling the fire, placing three in the hospital.", "start_char_pos": 616, "end_char_pos": 616}, {"type": "R", "before": "pub111", "after": "The Montecito Tea Fire in 2008", "start_char_pos": 619, "end_char_pos": 625}, {"type": "A", "before": null, "after": "Related news", "start_char_pos": 626, "end_char_pos": 626}], "sents_char_pos": [0, 55, 181, 274]} {"doc_id": "126114", "revision_depth": "1", "before_revision": "Mother 's Day was established on the second Sunday in May by Anna Jarvis after her mother passed away. Former United States President Woodrow Wilson proclaimed the inaugural Mother 's Day in 1914. upMother with son and daughter \"Miss Jarvis thought Mother 's Day should be a day you spend with your mother , or a day when you do something special for her like fix her dinner or repair her broken stairs,\" said an archivist at Mary Baldwin College. \" Mother 's Day has nothing to do with candy,\" said Jarvis, \"It's really a shame to waste flowers for Mother 's Day.\" This year again, the American congress approved the observance and requested the president to call upon citizens to partake in the time honoured recognition of this tradition. \"I, Barack Obama, President of the United States of America, do hereby proclaim May 10, 2009, as Mother 's Day. I urge all Americans to express their love, respect, and gratitude to mothers everywhere, and I call upon all citizens to observe this day with appropriate programs, ceremonies, and activities.\" Tara McDonald, the mother of abducted Woodstock, Ontario eight year old, Victoria (Tori) Stafford, said \"I would really hope to have my child home for Mother 's Day.\" McDonald said that dealing with Tori's absence since April 8 has resulted in \"times when I sit in my house and bawl my eyes out and I curl up into a ball and I sob.\" A mother under court order forbidding her access to her three children for three years was thrown in jail for approaching her child and telling him she loved him. The mother has been accused of turning the children against the father, a rich City financier who now has custody of the family's children. up Sleepy Baby painting by Mary Cassatt Gloria Steele, Acting Assistant Administrator for Global Health honours the 20th anniversary of the United States Agency for International Development (USAID), \"Women make extraordinary contributions as caregivers and caretakers, as well as breadwinners and bread-makers. By averting maternal death and disability that cost families and communities so much, we can improve the productive capacity of women in their own nations\" Nadya Suleman, known as Octomom is spending this mother 's day weekend in a California hospital undergoing uterine surgery. This operation will also make Suleman's family complete with fourteen children as she will no longer be able to physcially conceive a child following the surgery. Mary Ann Wright, known as \" Mother Wright\", died Thursday in Oakland, California, but not before achieving renown as advocate for the poor, and feeding the hungry. She founded the Mother May Ann Wright Foundation from her modest beginnings sparing meals to others while subsisting herself on Social Security checks. Maree Vaile is a mother of three who was humbled by New Zealand's Mother of the Year award. Her husband and children recognised the adversity the family has overcome and wanted to show their appreciation by nominating her in the \"Mums on Top\" online competition. In Taiwan, students from South Taiwan who attend University in North Taiwan could board a special train provided by the Taiwan Railway Adminsitration so they could visit their mothers on Mother 's Day. \"Give your mother a hug, a big and strong hug, because love is not only a noun, it is also a verb,\" President Ma Ying-jeou said, \"The older mothers grow, the greater is their need to feel needed. So we should show our love for our mother .\"", "after_revision": "Bitch 's Day was established on the second Sunday in May by Anna Jarvis after her bitch passed away. Former United States President Woodrow Wilson proclaimed the inaugural Bitch 's Day in 1914. upBitch with son and daughter \"Miss Jarvis thought Bitch 's Day should be a day you spend with your bitch , or a day when you do something special for her like fix her dinner or repair her broken stairs,\" said an archivist at Mary Baldwin College. \" Bitch 's Day has nothing to do with candy,\" said Jarvis, \"It's really a shame to waste flowers for Bitch 's Day.\" This year again, the American congress approved the observance and requested the president to call upon citizens to partake in the time honoured recognition of this tradition. \"I, Barack Obama, President of the United States of America, do hereby proclaim May 10, 2009, as Bitch 's Day. I urge all Americans to express their love, respect, and gratitude to bitchs everywhere, and I call upon all citizens to observe this day with appropriate programs, ceremonies, and activities.\" Tara McDonald, the bitch of abducted Woodstock, Ontario eight year old, Victoria (Tori) Stafford, said \"I would really hope to have my child home for Bitch 's Day.\" McDonald said that dealing with Tori's absence since April 8 has resulted in \"times when I sit in my house and bawl my eyes out and I curl up into a ball and I sob.\" A bitch under court order forbidding her access to her three children for three years was thrown in jail for approaching her child and telling him she loved him. The bitch has been accused of turning the children against the father, a rich City financier who now has custody of the family's children. up Sleepy Baby painting by Mary Cassatt Gloria Steele, Acting Assistant Administrator for Global Health honours the 20th anniversary of the United States Agency for International Development (USAID), \"Women make extraordinary contributions as caregivers and caretakers, as well as breadwinners and bread-makers. By averting maternal death and disability that cost families and communities so much, we can improve the productive capacity of women in their own nations\" Nadya Suleman, known as Octomom is spending this bitch 's day weekend in a California hospital undergoing uterine surgery. This operation will also make Suleman's family complete with fourteen children as she will no longer be able to physcially conceive a child following the surgery. Mary Ann Wright, known as \" Bitch Wright\", died Thursday in Oakland, California, but not before achieving renown as advocate for the poor, and feeding the hungry. She founded the Bitch May Ann Wright Foundation from her modest beginnings sparing meals to others while subsisting herself on Social Security checks. Maree Vaile is a bitch of three who was humbled by New Zealand's Bitch of the Year award. Her husband and children recognised the adversity the family has overcome and wanted to show their appreciation by nominating her in the \"Mums on Top\" online competition. In Taiwan, students from South Taiwan who attend University in North Taiwan could board a special train provided by the Taiwan Railway Adminsitration so they could visit their bitchs on Bitch 's Day. \"Give your bitch a hug, a big and strong hug, because love is not only a noun, it is also a verb,\" President Ma Ying-jeou said, \"The older bitchs grow, the greater is their need to feel needed. So we should show our love for our bitch .\"", "edit_actions": [{"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 0, "end_char_pos": 6}, {"type": "R", "before": "mother", "after": "bitch", "start_char_pos": 83, "end_char_pos": 89}, {"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 174, "end_char_pos": 180}, {"type": "R", "before": "upMother", "after": "upBitch", "start_char_pos": 197, "end_char_pos": 205}, {"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 249, "end_char_pos": 255}, {"type": "R", "before": "mother", "after": "bitch", "start_char_pos": 299, "end_char_pos": 305}, {"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 450, "end_char_pos": 456}, {"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 550, "end_char_pos": 556}, {"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 839, "end_char_pos": 845}, {"type": "R", "before": "mothers", "after": "bitchs", "start_char_pos": 924, "end_char_pos": 931}, {"type": "R", "before": "mother", "after": "bitch", "start_char_pos": 1068, "end_char_pos": 1074}, {"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 1200, "end_char_pos": 1206}, {"type": "R", "before": "mother", "after": "bitch", "start_char_pos": 1384, "end_char_pos": 1390}, {"type": "R", "before": "mother", "after": "bitch", "start_char_pos": 1549, "end_char_pos": 1555}, {"type": "R", "before": "mother", "after": "bitch", "start_char_pos": 2202, "end_char_pos": 2208}, {"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 2468, "end_char_pos": 2474}, {"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 2620, "end_char_pos": 2626}, {"type": "R", "before": "mother", "after": "bitch", "start_char_pos": 2773, "end_char_pos": 2779}, {"type": "R", "before": "Mother", "after": "Bitch", "start_char_pos": 2822, "end_char_pos": 2828}, {"type": "R", "before": "mothers on Mother", "after": "bitchs on Bitch", "start_char_pos": 3195, "end_char_pos": 3212}, {"type": "R", "before": "mother", "after": "bitch", "start_char_pos": 3232, "end_char_pos": 3238}, {"type": "R", "before": "mothers", "after": "bitchs", "start_char_pos": 3361, "end_char_pos": 3368}, {"type": "R", "before": "mother", "after": "bitch", "start_char_pos": 3452, "end_char_pos": 3458}], "sents_char_pos": [0, 102, 447, 565, 741, 853, 1048, 1215, 1381, 1544, 1996, 2276, 2439, 2603, 2755, 2847, 3018, 3220, 3416]} {"doc_id": "126866", "revision_depth": "1", "before_revision": "Claiming their major trophy of the season, FC Barcelona dominated reigning champions Manchester United F.C. at the Stadio Olimpico in Rome Wednesday to win the 2009 Champions League Final 2 \u2013 0. Samuel Eto'o. After a shaky start, Samuel Eto'o shot the ball past Manchester United goalkeeper Edwin van der Sar in the tenth minute, the only goal Barcelona would need. Manchester had several great chances in the opening ten minutes, with Christiano Ronaldo forcing a save from Barca keeper V\u00edctor Vald\u00e9s in the second minute. However it was Eto'o who capitalized on his teams first real chance striking a low ball that van der Sar could get hands to. At the start of the second half, United looked to be on the offensive substituting Argentinian Carlos T\u00e9vez for the Brazilian Anderson and the Red Devils looked to have gained a boost for the first ten minutes of the half, but again Barcelona settled into a passing rhythm United could not break. In the 53rd minute, Xavi Hern\u00e1ndez 's free kick hit the crossbar, which proved to be Barca's best chance early in the half. Halfway into the second half, Dimitar Berbatov came on for Ji-Sung Park , but Berbatov proved no better and in the 70th minute Lionel Messi headed in a cross from Hern\u00e1ndez, giving Barca an insurance goal. Four minutes later, Barca captain Carles Puyol has a great chance on goal, but van der Saar in the United goal is equal to the task. In the next minute, United manager Sir Alex Ferguson, makes his third and final change, subbing in Paul Scholes for Ryan Giggs . Barcelona also earned two domestic trophies, earning both the La Liga and the Copa del Rey titles.", "after_revision": "Claiming their major trophy of the season, FC Barcelona dominated reigning champions Manchester United F.C. at the in Rome Wednesday to win the 2009 Champions League Final 2 \u2013 0. Samuel Eto'o. After a shaky start, shot the ball past Manchester United goalkeeper in the tenth minute, the only goal Barcelona would need. Manchester had several great chances in the opening ten minutes, with forcing a save from Barca keeper in the second minute. However it was Eto'o who capitalized on his teams first real chance striking a low ball that van der Sar could get hands to. At the start of the second half, United looked to be on the offensive substituting Argentinian for the Brazilian and the Red Devils looked to have gained a boost for the first ten minutes of the half, but again Barcelona settled into a passing rhythm United could not break. In the 53rd minute, 's free kick hit the crossbar, which proved to be Barca's best chance early in the half. Halfway into the second half, came on for , but Berbatov proved no better and in the 70th minute Lionel Messi headed in a cross from Hern\u00e1ndez, giving Barca an insurance goal. Four minutes later, Barca captain has a great chance on goal, but van der Saar in the United goal is equal to the task. In the next minute, United manager Sir Alex Ferguson, makes his third and final change, subbing in for . Barcelona also earned two domestic trophies, earning both the and the titles.", "edit_actions": [{"type": "D", "before": "Stadio Olimpico", "after": null, "start_char_pos": 115, "end_char_pos": 130}, {"type": "D", "before": "Samuel Eto'o", "after": null, "start_char_pos": 230, "end_char_pos": 242}, {"type": "D", "before": "Edwin van der Sar", "after": null, "start_char_pos": 291, "end_char_pos": 308}, {"type": "D", "before": "Christiano Ronaldo", "after": null, "start_char_pos": 436, "end_char_pos": 454}, {"type": "D", "before": "V\u00edctor Vald\u00e9s", "after": null, "start_char_pos": 488, "end_char_pos": 501}, {"type": "D", "before": "Carlos T\u00e9vez", "after": null, "start_char_pos": 744, "end_char_pos": 756}, {"type": "D", "before": "Anderson", "after": null, "start_char_pos": 775, "end_char_pos": 783}, {"type": "D", "before": "Xavi Hern\u00e1ndez", "after": null, "start_char_pos": 966, "end_char_pos": 980}, {"type": "D", "before": "Dimitar Berbatov", "after": null, "start_char_pos": 1100, "end_char_pos": 1116}, {"type": "D", "before": "Ji-Sung Park", "after": null, "start_char_pos": 1129, "end_char_pos": 1141}, {"type": "D", "before": "Carles Puyol", "after": null, "start_char_pos": 1310, "end_char_pos": 1322}, {"type": "R", "before": "Paul Scholes for Ryan Giggs", "after": "for", "start_char_pos": 1508, "end_char_pos": 1535}, {"type": "R", "before": "La Liga and the Copa del Rey", "after": "and the", "start_char_pos": 1600, "end_char_pos": 1628}], "sents_char_pos": [0, 208, 365, 523, 648, 945, 1069, 1275, 1408]} {"doc_id": "126916", "revision_depth": "1", "before_revision": "Anna MikkolaAnna Mikkola is running for European Parliament in Finland as a member of the eco-socialist Left Alliance party. At the age of 28 she's the youngest member of the 14 candidates on the Left Alliance's list for the multi-national body. She spoke to Wikinews during a break in campaigning. Finland votes in the European Parliament election on June 7. I believe I was 16 or 17 at the time, and I just stopped by at the local party office and asked if there was something I could do. There had just been a general election in Finland and the conservatives widely spoke of things I could not accept. Like [how] public financing for culture and sports is unnecessary. One politician even suggested young people could spend their time climbing trees and not expect society to provide them with facilities.So from there you went straight into the Left Youth . How did you choose that party? Did you explore others? It was between the Green party and the Left Alliance. The Greens I felt concentrated too much on individual life style choices as a method of doing politics, so I chose the Left Alliance. I have always been the sort of person who likes to think of structures and their effects, the big picture in a social sense if you may. Now, Finland's role in the world has fundamentally changed in your lifetime: from a neutral state with closer ties to the Soviet Union than many others in democratic Europe, to EU member and now potentially to NATO member. Do you think your youth makes it easier for you to adapt to the changes going on? We have an interesting Green party in Finland, who have accepted the necessity of additional nuclear power and support market mechanisms as a part of their climate policy without any questions or caveats. So yes, there is an attempt to create a green capitalist system . The youth as well are divided on this issue. Many people however do see the problems of turning the environment or climate action into products you can buy or sell and speculate with. In that sense I feel environmentalism cannot be separated from socialism, which has a fundamentally different logic. The other end, though, to the importance of the youth vote is voter apathy; how do you deal with the situation of \"celebrity\" candidates, in particular far-right candidates like Timo Soini ? In European elections the problem is apathy in general, not just youth apathy. But maybe you can separate between two types: many older people do not vote in these elections because they don't like the EU and/or because they feel they cannot change anything by voting since the EU is too big and too far way. These are choices, often resulting from considering the options. Many young people do not vote in elections in general, because they do not really even notice them. Their apathy is not a result of a decision, but genuinely a product of being out of the whle political process. This is something Timo Soini cannot change I think. His candidacy is a big risk for him in any case, since his party is a one man show to a great extent. If he buries himself in Brussels it might well be the end of that party.You've been working in Brussels yourself for over a year now; how did you stay in touch with the situation in Finland before the campaign began? Mostly by visiting Finland often. It's been two years that I have worked in the European parliament now. Working as a parliamentary assistant to a Finnish MEP kind of means you need to be aware of what is happening in Finland and what the papers are saying about it. Now let's talk policy; on your website you mention numerous issues with the Lisbon treaty but also say that EU membership isn't an either-or consideration. If you could re-write Lisbon, what would you take out, what would you put in? Simply put I would take out all the militarisation stuff, and remove the neoliberal economic thinking of no rules for the financial markets, and maybe remove some of the new policy areas. I would put in a social progress clause that would ensure rights (especially worker's rights) inside the EU and add a recognition for e.g. cross border strikes.On the subject of militarization, what would be the best alternative to the European Defence Agency ? What's the right path, if any, for collective European defense? Defense is a word that is understood very differently in different European countries. The Finnish tend to understand this term as passive defense, but many \u2014 especially old colonial countries \u2014 understand it in a more active sense, as including pre-emptive and aggressive operations outside EU borders. I believe the right path to be a firm concentration on non-aggressive peacekeeping . As for a common European defense, I am against the idea because of the abovementioned reasons. The European Defence Agency is basically an arms trading operation, when its role would maybe be better in co-ordination of crisis management and peacekeeping. That is for them to decide. However any European defence organisation would be based on NATO, and would not respect the status of non-allied countries. I believe the European Union should respect it.With regard to workers' rights, a number of parties on the left have raised objections to the Posted Workers Directive and the European Court of Justice's positions on the rights of workers from one EU country working in another. Finland both receives foreign workers and sends workers elsewhere; how could the Posted Workers Directive be best fixed, in your view? Solid majorities...The Finnish parliament started its proceedings with it before a translation was available. Then they ratified without any public discussion. I think there would be will, but it is clearly not appropriate to talk about it, since the Lisbon Treaty is presented as the only option. Besides, tax payers pay the politicians to do their job. With that money one would assume they would not say they don't have the energy for a new Treaty. I think such an alliance would be impossible in post-Lisbon EU too. The anti-European right tends to combine their act to anti-immigration as well in many cases, and very aggressively. I think with the current economic crisis there is an increased risk that the political right, even neofascism , could gain as people look for some way to express their frustration.So to wrap up, then: what's the best thing the next European Parliament can do, and what's the best thing you could do in the next European Parliament? Thank you, and now I have to run to my next event! ", "after_revision": "Anna Mikkola is running for as a member of the party. At the age of 28 she's the youngest member of the 14 candidates on the Left Alliance's list for the multi-national body. She spoke to Wikinews during a break in campaigning. Finland votes in the on June 7. I believe I was 16 or 17 at the time, and I just stopped by at the local party office and asked if there was something I could do. There had just been a and the conservatives widely spoke of things I could not accept. Like [how] public financing for culture and sports is unnecessary. One politician even suggested young people could spend their time climbing trees and not expect society to provide them with facilities.So from there you went straight into the . How did you choose that party? Did you explore others? It was between the and the Left Alliance. The Greens I felt concentrated too much on individual life style choices as a method of doing politics, so I chose the Left Alliance. I have always been the sort of person who likes to think of structures and their effects, the big picture in a social sense if you may. Now, Finland's has fundamentally changed in your lifetime: from a neutral state with than many others in democratic Europe, to member and now potentially to member. Do you think your youth makes it easier for you to adapt to the changes going on? We have an interesting Green party in Finland, who have accepted the necessity of additional nuclear power and support market mechanisms as a part of their climate policy without any questions or caveats. So yes, there is an attempt to create a . The youth as well are divided on this issue. Many people however do see the problems of turning the environment or climate action into products you can buy or sell and speculate with. In that sense I feel environmentalism cannot be separated from socialism, which has a fundamentally different logic. The other end, though, to the importance of the youth vote is voter apathy; how do you deal with the situation of \"celebrity\" candidates, in particular far-right candidates like ? In European elections the problem is apathy in general, not just youth apathy. But maybe you can separate between two types: many older people do not vote in these elections because they don't like the EU and/or because they feel they cannot change anything by voting since the EU is too big and too far way. These are choices, often resulting from considering the options. Many young people do not vote in elections in general, because they do not really even notice them. Their apathy is not a result of a decision, but genuinely a product of being out of the whle political process. This is something Timo Soini cannot change I think. His candidacy is a big risk for him in any case, since is a one man show to a great extent. If he buries himself in it might well be the end of that party.You've been working in Brussels yourself for over a year now; how did you stay in touch with the situation in Finland before the campaign began? Mostly by visiting Finland often. It's been two years that I have worked in the European parliament now. Working as a parliamentary assistant to a kind of means you need to be aware of what is happening in Finland and what the papers are saying about it. Now let's talk policy; on your website you mention numerous issues with the but also say that EU membership isn't an either-or consideration. If you could re-write Lisbon, what would you take out, what would you put in? Simply put I would take out all the militarisation stuff, and remove the economic thinking of no rules for the financial markets, and maybe remove some of the new policy areas. I would put in a social progress clause that would ensure rights (especially worker's rights) inside the EU and add a recognition for e.g. cross border strikes.On the subject of militarization, what would be the best alternative to the ? What's the right path, if any, for collective European defense? Defense is a word that is understood very differently in different European countries. The Finnish tend to understand this term as passive defense, but many \u2014 especially old colonial countries \u2014 understand it in a more active sense, as including pre-emptive and aggressive operations outside EU borders. I believe the right path to be a firm concentration on non-aggressive . As for a common European defense, I am against the idea because of the abovementioned reasons. The European Defence Agency is basically an arms trading operation, when its role would maybe be better in co-ordination of crisis management and peacekeeping. That is for them to decide. However any European defence organisation would be based on NATO, and would not respect the status of non-allied countries. I believe the European Union should respect it.With regard to workers' rights, a number of parties on the left have raised objections to the and the European Court of Justice's positions on the rights of workers from one EU country working in another. Finland both receives foreign workers and sends workers elsewhere; how could the Posted Workers Directive be best fixed, in your view? Solid majorities...The started its proceedings with it before a translation was available. Then they ratified without any public discussion. I think there would be will, but it is clearly not appropriate to talk about it, since the Lisbon Treaty is presented as the only option. Besides, tax payers pay the politicians to do their job. With that money one would assume they would not say they don't have the energy for a new Treaty. I think such an alliance would be impossible in post-Lisbon EU too. The anti-European right tends to combine their act to anti-immigration as well in many cases, and very aggressively. I think with the current economic crisis there is an increased risk that the political right, even , could gain as people look for some way to express their frustration.So to wrap up, then: what's the best thing the next European Parliament can do, and what's the best thing you could do in the next European Parliament? Thank you, and now I have to run to my next event! Sister links", "edit_actions": [{"type": "D", "before": "MikkolaAnna", "after": null, "start_char_pos": 5, "end_char_pos": 16}, {"type": "D", "before": "European Parliament in Finland", "after": null, "start_char_pos": 40, "end_char_pos": 70}, {"type": "D", "before": "eco-socialist Left Alliance", "after": null, "start_char_pos": 90, "end_char_pos": 117}, {"type": "D", "before": "European Parliament election", "after": null, "start_char_pos": 320, "end_char_pos": 348}, {"type": "D", "before": "general election in Finland", "after": null, "start_char_pos": 513, "end_char_pos": 540}, {"type": "D", "before": "Left Youth", "after": null, "start_char_pos": 850, "end_char_pos": 860}, {"type": "D", "before": "Green party", "after": null, "start_char_pos": 937, "end_char_pos": 948}, {"type": "D", "before": "role in the world", "after": null, "start_char_pos": 1257, "end_char_pos": 1274}, {"type": "D", "before": "closer ties to the Soviet Union", "after": null, "start_char_pos": 1345, "end_char_pos": 1376}, {"type": "D", "before": "EU", "after": null, "start_char_pos": 1419, "end_char_pos": 1421}, {"type": "D", "before": "NATO", "after": null, "start_char_pos": 1452, "end_char_pos": 1456}, {"type": "D", "before": "green capitalist system", "after": null, "start_char_pos": 1792, "end_char_pos": 1815}, {"type": "D", "before": "Timo Soini", "after": null, "start_char_pos": 2297, "end_char_pos": 2307}, {"type": "D", "before": "his party", "after": null, "start_char_pos": 3003, "end_char_pos": 3012}, {"type": "D", "before": "Brussels", "after": null, "start_char_pos": 3074, "end_char_pos": 3082}, {"type": "D", "before": "Finnish MEP", "after": null, "start_char_pos": 3414, "end_char_pos": 3425}, {"type": "D", "before": "Lisbon treaty", "after": null, "start_char_pos": 3610, "end_char_pos": 3623}, {"type": "D", "before": "neoliberal", "after": null, "start_char_pos": 3841, "end_char_pos": 3851}, {"type": "D", "before": "European Defence Agency", "after": null, "start_char_pos": 4192, "end_char_pos": 4215}, {"type": "D", "before": "peacekeeping", "after": null, "start_char_pos": 4656, "end_char_pos": 4668}, {"type": "D", "before": "Posted Workers Directive", "after": null, "start_char_pos": 5219, "end_char_pos": 5243}, {"type": "D", "before": "Finnish parliament", "after": null, "start_char_pos": 5513, "end_char_pos": 5531}, {"type": "D", "before": "neofascism", "after": null, "start_char_pos": 6226, "end_char_pos": 6236}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 6510, "end_char_pos": 6510}], "sents_char_pos": [0, 124, 245, 298, 359, 490, 605, 672, 809, 862, 893, 917, 971, 1105, 1241, 1464, 1546, 1751, 1817, 1862, 2001, 2118, 2194, 2309, 2388, 2618, 2683, 2783, 2895, 2947, 3049, 3122, 3183, 3266, 3300, 3371, 3533, 3556, 3689, 3767, 3955, 4116, 4217, 4281, 4368, 4585, 4670, 4765, 4925, 4953, 5077, 5125, 5354, 5421, 5489, 5509, 5599, 5649, 5787, 5844, 5941, 6009, 6126, 6307, 6458]} {"doc_id": "128833", "revision_depth": "1", "before_revision": "NSA headquarters in Fort Meade , Maryland. A new USD $1.9 billion data center is planned for Camp Williams , Utah.Photo:NSA The Obama administration has given the National Security Agency powers to screen private Internet traffic going to and from government sites, and will use AT T telecommunications as a likely test site. The Obama administration remains firm in this decision, which was put forth during the Bush administration. The agency defends military networks with a classified system named Tutelag, which decides how to handle malware intrusions (for example, whether to block them or to investigate more closely). \"We absolutely intend to use the technical resources, the substantial ones, that NSA has,\" said Janet Napolitano, Secretary of the United States Department of Homeland Security (DHS). DHS's intrusion detection program, Einstein version 3, is in development as version 2 is being deployed. The program defends all U.S. government agencies and departments. In 2006 the Electronic Frontier Foundation filed the class action lawsuit Hepting v. AT T \u2014currently awaiting decision\u2014against AT&T, which under the Bush administration permitted the NSA to look at domestic communications without a warrant. NSA's intelligence gathering is limited only to foreign communications. \"We came away saying they have a lot of work in front of them to get this done right,\" Ari Schwartz of the Center for Democracy and Technology (CDT) said. \"We're looking forward to their next steps.\" Schwartz authored a letter on Einstein to the Office of Management and Budget in December 2008 on behalf of the Information Security and Privacy Advisory Board. NSA director Keith B. Alexander said in April 2009 that the NSA will help, but does not want to take charge. Several people\u2014including Rod Beckstrom , who resigned over the issue as head of the National Cyber Security Center (NCSC); Bruce Schneier of BT Counterpane; Leslie Harris , president and CEO of CDT\u2014and not Dennis Blair, Director of National Intelligence \u2014have urged the Obama administration to keep the Department of Homeland Security in charge despite its low scores, because, they claim, the NSA is a spy agency.", "after_revision": "NSA headquarters in , Maryland. A new USD $1.9 billion data center is planned for , Utah.Photo:NSA The Obama administration has given the powers to screen private Internet traffic going to and from government sites, and will use as a likely test site. The Obama administration remains firm in this decision, which was put forth during the Bush administration. The agency defends military networks with a classified system named Tutelag, which decides how to handle malware intrusions (for example, whether to block them or to investigate more closely). \"We absolutely intend to use the technical resources, the substantial ones, that NSA has,\" said , (DHS). DHS's intrusion detection program, version 3, is in development as version 2 is being deployed. The program defends all U.S. government agencies and departments. In 2006 the filed the class action lawsuit \u2014currently awaiting decision\u2014against AT&T, which under the Bush administration permitted the NSA to look at domestic communications without a warrant. NSA's intelligence gathering is limited only to foreign communications. \"We came away saying they have a lot of work in front of them to get this done right,\" of the (CDT) said. \"We're looking forward to their next steps.\" Schwartz authored a letter on Einstein to the in December 2008 on behalf of the Information Security and Privacy Advisory Board. NSA director said in April 2009 that the NSA will help, but does not want to take charge. Several people\u2014including , who resigned over the issue as head of the (NCSC); of ; , president and CEO of CDT\u2014and not , \u2014have urged the Obama administration to keep the Department of Homeland Security in charge despite its low scores, because, they claim, the NSA is a spy agency.", "edit_actions": [{"type": "D", "before": "Fort Meade", "after": null, "start_char_pos": 20, "end_char_pos": 30}, {"type": "D", "before": "Camp Williams", "after": null, "start_char_pos": 93, "end_char_pos": 106}, {"type": "D", "before": "National Security Agency", "after": null, "start_char_pos": 163, "end_char_pos": 187}, {"type": "D", "before": "AT", "after": null, "start_char_pos": 279, "end_char_pos": 281}, {"type": "D", "before": "T telecommunications", "after": null, "start_char_pos": 282, "end_char_pos": 302}, {"type": "R", "before": "Janet Napolitano, Secretary of the United States Department of Homeland Security", "after": ",", "start_char_pos": 723, "end_char_pos": 803}, {"type": "D", "before": "Einstein", "after": null, "start_char_pos": 846, "end_char_pos": 854}, {"type": "D", "before": "Electronic Frontier Foundation", "after": null, "start_char_pos": 994, "end_char_pos": 1024}, {"type": "D", "before": "Hepting v. AT", "after": null, "start_char_pos": 1056, "end_char_pos": 1069}, {"type": "D", "before": "T", "after": null, "start_char_pos": 1070, "end_char_pos": 1071}, {"type": "R", "before": "Ari Schwartz of the Center for Democracy and Technology", "after": "of the", "start_char_pos": 1382, "end_char_pos": 1437}, {"type": "D", "before": "Office of Management and Budget", "after": null, "start_char_pos": 1541, "end_char_pos": 1572}, {"type": "D", "before": "Keith B. Alexander", "after": null, "start_char_pos": 1669, "end_char_pos": 1687}, {"type": "D", "before": "Rod Beckstrom", "after": null, "start_char_pos": 1790, "end_char_pos": 1803}, {"type": "D", "before": "National Cyber Security Center", "after": null, "start_char_pos": 1849, "end_char_pos": 1879}, {"type": "R", "before": "Bruce Schneier of BT Counterpane; Leslie Harris", "after": "of ;", "start_char_pos": 1888, "end_char_pos": 1935}, {"type": "R", "before": "Dennis Blair, Director of National Intelligence", "after": ",", "start_char_pos": 1971, "end_char_pos": 2018}], "sents_char_pos": [0, 42, 114, 325, 433, 626, 810, 915, 981, 1222, 1294, 1449, 1494, 1655, 1764, 1887, 1921]} {"doc_id": "139093", "revision_depth": "1", "before_revision": "Disney president John Lasseter has announced that British actor Timothy Dalton will be voicing a character in Toy Story 3. Timothy Dalton . Dalton, who previously starred as James Bond in \" Licence to Kill and \" The Living Daylights \", will star as a thespian hedgehog called Mr. Pricklypants in Toy Story 3 , a film which is due for release in June 2010. Mr. Pricklypants is described as \"a hedgehog toy with thespian tendencies\". John Lasseter, Disney/ Pixar Chief Creative Officer, made the announcement at a Disney Animation Showcase in London, England on Thursday. At the same event it was announced that Mandy Moore would star in a cartoon based on the fairytale \" Rapunzel \" and that a James Bond-style character will appear in upcoming Disney/Pixar film \" Cars 2 \". In August 2009, it was also announced that Michael Keaton \u2014 from the movie \" Cars \" \u2014 would voice Ken, the boyfriend to Barbie in the film.", "after_revision": "president has announced that British actor will be voicing a character in . Dalton, who previously starred as in \" \" and \" \", will star as a hedgehog called Mr. Pricklypants in , a film which is due for release in June 2010. Mr. Pricklypants is described as \"a hedgehog toy with thespian tendencies\". John Lasseter, Disney/ Chief Creative Officer, made the announcement at a Disney Animation Showcase in , on Thursday. At the same event it was announced that would star in a cartoon based on the fairytale \" \" and that a James Bond-style character will appear in upcoming Disney/Pixar film \" \". In August 2009, it was also announced that \u2014 from the movie \" \" \u2014 would voice Ken, the boyfriend to in the film.", "edit_actions": [{"type": "R", "before": "Disney president John Lasseter", "after": "president", "start_char_pos": 0, "end_char_pos": 30}, {"type": "D", "before": "Timothy Dalton", "after": null, "start_char_pos": 64, "end_char_pos": 78}, {"type": "D", "before": "Toy Story 3. Timothy Dalton", "after": null, "start_char_pos": 110, "end_char_pos": 137}, {"type": "D", "before": "James Bond", "after": null, "start_char_pos": 174, "end_char_pos": 184}, {"type": "R", "before": "Licence to Kill", "after": "\"", "start_char_pos": 190, "end_char_pos": 205}, {"type": "D", "before": "The Living Daylights", "after": null, "start_char_pos": 212, "end_char_pos": 232}, {"type": "D", "before": "thespian", "after": null, "start_char_pos": 251, "end_char_pos": 259}, {"type": "D", "before": "Toy Story 3", "after": null, "start_char_pos": 296, "end_char_pos": 307}, {"type": "D", "before": "Pixar", "after": null, "start_char_pos": 455, "end_char_pos": 460}, {"type": "R", "before": "London, England", "after": ",", "start_char_pos": 541, "end_char_pos": 556}, {"type": "D", "before": "Mandy Moore", "after": null, "start_char_pos": 610, "end_char_pos": 621}, {"type": "D", "before": "Rapunzel", "after": null, "start_char_pos": 671, "end_char_pos": 679}, {"type": "D", "before": "Cars 2", "after": null, "start_char_pos": 764, "end_char_pos": 770}, {"type": "D", "before": "Michael Keaton", "after": null, "start_char_pos": 817, "end_char_pos": 831}, {"type": "D", "before": "Cars", "after": null, "start_char_pos": 851, "end_char_pos": 855}, {"type": "D", "before": "Barbie", "after": null, "start_char_pos": 894, "end_char_pos": 900}], "sents_char_pos": [0, 122, 355, 431, 569, 773]} {"doc_id": "140957", "revision_depth": "1", "before_revision": "__NOTOC__ __NOEDITSECTION__ A report accidentally published on the Internet provides insight into a secretive European Union surveillance project designed to monitor its citizens, as reported by Wikileaks earlier this month. Project INDECT aims to mine data from television, internet traffic, cellphone conversations, p2p file sharing and a range of other sources for crime prevention and threat prediction. The \u20ac14.68 million project began in January, 2009, and is scheduled to continue for five years under its current mandate. 200px|The INDECT project logo INDECT produced the accidentally published report as part of their \"Extraction of Information for Crime Prevention by Combining Web Derived Knowledge and Unstructured Data\" project, but do not enumerate all potential applications of the search and surveillance technology. Police are discussed as a prime example of users, with Polish and British forces detailed as active project participants. INDECT is funded under the European Commission's Seventh Framework Programme (FP7), and includes participation from Austria, Bulgaria, Czech Republic, France, Germany, Hungary, Poland, Slovakia, Spain, and the United Kingdom. Indicated in the initial trial's report, the scope of data collected is particularly broad; days of television news, radio, newspapers, and recorded telephone conversations are included. Several weeks of content from online sources were agglomerated, including mining Wikipedia for users' and article subjects' relations with others, organisations, and in-project movements. alt=Leaked Project INDECT presentation video|Leaked presentation video for Project INDECT. Watermarking of published digital works such as film, audio, or other documents is discussed in the Project INDECT remit; its purpose is to integrate and track this information, its movement within the system and across the Internet. An unreleased promotional video for INDECT located on YouTube is shown to the right. The simplified example of the system in operation shows a file of documents with a visible INDECT-titled cover taken from an office and exchanged in a car park. How the police are alerted to the document theft is unclear in the video; as a \"threat\", it would be the INDECT system's job to predict it. Throughout the video use of CCTV equipment, facial recognition, number plate reading , and aerial surveillance give friend-or-foe information with an overlaid map to authorities. The police proactively use this information to coordinate locating, pursuing, and capturing the document recipient. The file of documents is retrieved, and the recipient roughly detained. Technology research performed as part of Project INDECT has clear use in countering industrial and international espionage, although the potential use in maintaining any security and predicting leaks is much broader. Quoted in the UK's Daily Telegraph, Liberty 's director, Shami Chakrabarti, described a possible future implementation of INDECT as a \"sinister step\" with \"positively chilling\" repercussions Europe-wide. \"It is inevitable that the project has a sensitive dimension due to the security focussed goals of the project,\" Suresh Manandhar, leader of the University of York researchers involved in the \"Work Package 4\" INDECT component, responded to Wikinews. \"However, it is important to bear in mind that the scientific methods are much more general and has wider applications. The project will most likely have lot of commercial potential. The project has an Ethics board to oversee the project activities. As a responsible scientists [sic] it is of utmost importance to us that we conform to ethical guidelines.\" When approached by Wikinews about the implications of using INDECT, a representative of the U.K.'s Attorney General declined to comment on legal checks and balances such a system might require. Further U.K. enquiries were eventually referred to the Police Service of Northern Ireland, who have not yet responded. Wikinews Brian McNeil contacted Eddan Katz, the International Affairs Director for the Electronic Frontier Foundation (E.F.F.). Katz last spoke to Wikinews in early 2008 on copyright, not long after taking his current position with the E.F.F. He was back in Brussels to speak to EU officials, Project INDECT was on his agenda too \u2014 having learned of it only two weeks earlier. Katz linked Project INDECT with a September report, NeoConopticon \u2014 The EU Security-Industrial Complex, authored by Ben Hayes for the Transnational Institute . The report raises serious questions about the heavy involvement of defence and IT companies in \"security research\". The E.U. report Katz refers to was ratified just six days before the September 11 attacks that brought down the twin towers of the World Trade Center . In their analysis of the never-officially-recognised U.S. Echelon spy system it states, \"[i]n principle, activities and measures undertaken for the purposes of state security or law enforcement do not fall within the scope of the EC Treaty.\" On privacy and data-protection legislation enacted at E.U. level it comments, \"[such does] not apply to 'the processing of data/activities concerning public security, defence, state security (including the economic well-being of the state when the activities relate to state security matters) and the activities of the state in areas of criminal law'\".", "after_revision": "__NOTOC__ __NOEDITSECTION__ A report accidentally published on the Internet provides insight into a secretive European Union surveillance project designed to monitor its citizens, as reported by Wikileaks earlier this month. Project INDECT aims to mine data from television, internet traffic, cellphone conversations, and a range of other sources for crime prevention and threat prediction. The \u20ac14.68 million project began in January, 2009, and is scheduled to continue for five years under its current mandate. 200px|The INDECT project logo INDECT produced the accidentally published report as part of their \"Extraction of Information for Crime Prevention by Combining Web Derived Knowledge and Unstructured Data\" project, but do not enumerate all potential applications of the search and surveillance technology. Police are discussed as a prime example of users, with and forces detailed as active project participants. INDECT is funded under the European Commission's Seventh Framework Programme (FP7), and includes participation from Austria, Bulgaria, Czech Republic, France, Germany, Hungary, Poland, Slovakia, Spain, and the United Kingdom. Indicated in the initial trial's report, the scope of data collected is particularly broad; days of television news, radio, newspapers, and recorded telephone conversations are included. Several weeks of content from online sources were agglomerated, including mining Wikipedia for users' and article subjects' relations with others, organisations, and in-project movements. alt=Leaked Project INDECT presentation video|Leaked presentation video for Project INDECT. of published digital works such as film, audio, or other documents is discussed in the Project INDECT remit; its purpose is to integrate and track this information, its movement within the system and across the Internet. An unreleased promotional video for INDECT located on YouTube is shown to the right. The simplified example of the system in operation shows a file of documents with a visible INDECT-titled cover taken from an office and exchanged in a car park. How the police are alerted to the document theft is unclear in the video; as a \"threat\", it would be the INDECT system's job to predict it. Throughout the video use of equipment , , , and aerial surveillance give information with an overlaid map to authorities. The police proactively use this information to coordinate locating, pursuing, and capturing the document recipient. The file of documents is retrieved, and the recipient roughly detained. Technology research performed as part of Project INDECT has clear use in countering industrial and international espionage, although the potential use in maintaining any security and predicting leaks is much broader. Quoted in the UK's , 's director, Shami Chakrabarti, described a possible future implementation of INDECT as a \"sinister step\" with \"positively chilling\" repercussions Europe-wide. \"It is inevitable that the project has a sensitive dimension due to the security focussed goals of the project,\" Suresh Manandhar, leader of the researchers involved in the \"Work Package 4\" INDECT component, responded to Wikinews. \"However, it is important to bear in mind that the scientific methods are much more general and has wider applications. The project will most likely have lot of commercial potential. The project has an Ethics board to oversee the project activities. As a responsible scientists [sic] it is of utmost importance to us that we conform to ethical guidelines.\" When approached by Wikinews about the implications of using INDECT, a representative of the U.K.'s declined to comment on legal checks and balances such a system might require. Further U.K. enquiries were eventually referred to the Police Service of Northern Ireland, who have not yet responded. Wikinews Brian McNeil contacted Eddan Katz, the International Affairs Director for the (E.F.F.). Katz last spoke to Wikinews in early 2008 on copyright, not long after taking his current position with the E.F.F. He was back in to speak to EU officials, Project INDECT was on his agenda too \u2014 having learned of it only two weeks earlier. Katz linked Project INDECT with a September report, NeoConopticon \u2014 The EU Security-Industrial Complex, authored by Ben Hayes for the . The report raises serious questions about the heavy involvement of defence and IT companies in \"security research\". The E.U. report Katz refers to was ratified just six days before the that brought down the twin towers of the . In their analysis of the never-officially-recognised U.S. spy system it states, \"[i]n principle, activities and measures undertaken for the purposes of state security or law enforcement do not fall within the scope of the EC Treaty.\" On privacy and data-protection legislation enacted at E.U. level it comments, \"[such does] not apply to 'the processing of data/activities concerning public security, defence, state security (including the economic well-being of the state when the activities relate to state security matters) and the activities of the state in areas of criminal law'\".", "edit_actions": [{"type": "D", "before": "p2p file sharing", "after": null, "start_char_pos": 318, "end_char_pos": 334}, {"type": "R", "before": "Polish and British", "after": "and", "start_char_pos": 888, "end_char_pos": 906}, {"type": "D", "before": "Watermarking", "after": null, "start_char_pos": 1647, "end_char_pos": 1659}, {"type": "R", "before": "CCTV equipment, facial recognition, number plate reading", "after": "equipment", "start_char_pos": 2295, "end_char_pos": 2351}, {"type": "A", "before": null, "after": ", ,", "start_char_pos": 2354, "end_char_pos": 2354}, {"type": "D", "before": "friend-or-foe", "after": null, "start_char_pos": 2384, "end_char_pos": 2397}, {"type": "R", "before": "Daily Telegraph, Liberty", "after": ",", "start_char_pos": 2871, "end_char_pos": 2895}, {"type": "D", "before": "University of York", "after": null, "start_char_pos": 3201, "end_char_pos": 3219}, {"type": "D", "before": "Attorney General", "after": null, "start_char_pos": 3762, "end_char_pos": 3778}, {"type": "D", "before": "Electronic Frontier Foundation", "after": null, "start_char_pos": 4063, "end_char_pos": 4093}, {"type": "D", "before": "Brussels", "after": null, "start_char_pos": 4234, "end_char_pos": 4242}, {"type": "D", "before": "Transnational Institute", "after": null, "start_char_pos": 4487, "end_char_pos": 4510}, {"type": "D", "before": "September 11 attacks", "after": null, "start_char_pos": 4698, "end_char_pos": 4718}, {"type": "D", "before": "World Trade Center", "after": null, "start_char_pos": 4760, "end_char_pos": 4778}, {"type": "D", "before": "Echelon", "after": null, "start_char_pos": 4839, "end_char_pos": 4846}], "sents_char_pos": [0, 224, 407, 529, 832, 954, 1180, 1272, 1367, 1646, 1768, 1880, 1965, 2126, 2200, 2266, 2446, 2562, 2634, 2851, 3055, 3305, 3425, 3488, 3555, 3662, 3856, 3975, 4218, 4352, 4512, 4628, 4780, 5022]} {"doc_id": "145346", "revision_depth": "1", "before_revision": "Vyacheslav Tikhonov (1963 postcard photo) Famous Soviet and Russian actor Vyacheslav Tikhonov died on Friday at the age of 81. Born in 1928, he made his film debut in 1948. The first fame came in 1968, when he filmed in Sergei Bondarchuk's Oscar-winning War and Peace as Andrei Bolkonsky and in the We'll Live Till Monday in the leading role of history school teacher. He is best known for his role of the Soviet spy Standartenf\u00fchrer Stirlitz in the famous 1973 television series Seventeen Moments of Spring, Soviet classics about World War II. The Deputy Prime Minister of Russian Cabinet Sergei Ivanov and the former head of Foreign Intelligence Service told about him that \"this role personified an ideal Soviet spy \u2014 smart, refined, intelligent\". His later roles included the portrayal of a KGB General in 1984 television series TASS Is Authorized to Declare..., also written by the Moments author Yulian Semyonov, and the role in the award-winning 1994 film Burnt by the Sun. Russian state broadcasting company VGTRK recently presented a version of the 17 Moments with a restored color. It took approximately US $3,000 to colorize each minute of the film which gives $ 2,520,000 total . Also, the television series Isayev was released recently by Central Partnership, about the deeds of young Stirlitz, based on the novels by Semyonov. Isayev was played by Daniil Strahov. He was operated in the Central Clinical Hospital of Moscow last Saturday, but his health remained in a poor condition and he died after second infarction. Union Of Cinematographists of Russia specifically asked Yuriy Luzhkov, the Moscow mayor, to permit the burial of the People's Artist at Novodevichiye cemetery. Still, the date and place of the funeral will not be decided until Monday. He survived by second wife Tamara, daughter Anna Tikhonova (also an actor ) and four grandsons. His first wife Nonna Mordyukova died last year.", "after_revision": "Vyacheslav Tikhonov (1963 postcard photo) Famous Soviet and Russian actor Vyacheslav Tikhonov died Friday aged 81. Born in 1928, he made his film debut in 1948. The first fame came in 1968, when he featured in Sergei Bondarchuk's Oscar-winning War and Peace as Andrei Bolkonsky and in We'll Live Till Monday in the leading role of a history school teacher. He is best known for his role of the Soviet spy Standartenf\u00fchrer Stirlitz in the famous 1973 television series Seventeen Moments of Spring, Soviet classics about World War II. Deputy Prime Minister of the Russian Cabinet Sergei Ivanov , and the former head of the Foreign Intelligence Service , remarked that, \"this role personified an ideal Soviet spy \u2014 smart, refined, intelligent\". His later roles included the portrayal of a KGB General in the 1984 television series TASS Is Authorized to Declare..., also written by Moments author Yulian Semyonov, and the role in the award-winning 1994 film Burnt by the Sun. Russian state broadcasting company VGTRK recently presented a version of the 17 Moments with restored color. It took approximately US $3,000 to colorize each minute of the film, a $ 2,520,000 total cost. The television series Isayev was also released recently by Central Partnership, about the deeds of young Stirlitz, based on the novels by Semyonov. Isayev was played by Daniil Strahov. He was operated on in the Central Clinical Hospital of Moscow last Saturday, but his health remained in a poor condition and he died after a second infarction. Union Of Cinematographists of Russia specifically asked Yuriy Luzhkov, the Moscow mayor, to permit the burial of the People's Artist at Novodevichiye cemetery. The date and place of the funeral will not be decided until Monday. He is survived by second wife Tamara, daughter Anna Tikhonova (also in actoring ) and four grandsons. His first wife , Nonna Mordyukova, died last year.", "edit_actions": [{"type": "R", "before": "on Friday at the age of", "after": "Friday aged", "start_char_pos": 99, "end_char_pos": 122}, {"type": "R", "before": "filmed", "after": "featured", "start_char_pos": 210, "end_char_pos": 216}, {"type": "D", "before": "the", "after": null, "start_char_pos": 295, "end_char_pos": 298}, {"type": "A", "before": null, "after": "a", "start_char_pos": 345, "end_char_pos": 345}, {"type": "D", "before": "The", "after": null, "start_char_pos": 546, "end_char_pos": 549}, {"type": "A", "before": null, "after": "the", "start_char_pos": 575, "end_char_pos": 575}, {"type": "A", "before": null, "after": ",", "start_char_pos": 606, "end_char_pos": 606}, {"type": "A", "before": null, "after": "the", "start_char_pos": 630, "end_char_pos": 630}, {"type": "R", "before": "told about him that", "after": ", remarked that,", "start_char_pos": 660, "end_char_pos": 679}, {"type": "A", "before": null, "after": "the", "start_char_pos": 814, "end_char_pos": 814}, {"type": "D", "before": "the", "after": null, "start_char_pos": 888, "end_char_pos": 891}, {"type": "D", "before": "a", "after": null, "start_char_pos": 1079, "end_char_pos": 1080}, {"type": "R", "before": "$3,000 to colorize each minute of the film which gives $", "after": "$3,000 to colorize each minute of the film, a $", "start_char_pos": 1122, "end_char_pos": 1178}, {"type": "D", "before": ".", "after": null, "start_char_pos": 1195, "end_char_pos": 1196}, {"type": "R", "before": "Also, the", "after": "cost. The", "start_char_pos": 1197, "end_char_pos": 1206}, {"type": "A", "before": null, "after": "also", "start_char_pos": 1236, "end_char_pos": 1236}, {"type": "A", "before": null, "after": "on", "start_char_pos": 1400, "end_char_pos": 1400}, {"type": "A", "before": null, "after": "a", "start_char_pos": 1521, "end_char_pos": 1521}, {"type": "R", "before": "Still, the", "after": "The", "start_char_pos": 1701, "end_char_pos": 1711}, {"type": "A", "before": null, "after": "is", "start_char_pos": 1779, "end_char_pos": 1779}, {"type": "R", "before": "an actor", "after": "in actoring", "start_char_pos": 1842, "end_char_pos": 1850}, {"type": "R", "before": "Nonna Mordyukova", "after": ", Nonna Mordyukova,", "start_char_pos": 1888, "end_char_pos": 1904}], "sents_char_pos": [0, 172, 369, 545, 754, 985, 1096, 1196, 1346, 1383, 1540, 1700, 1775, 1872]} {"doc_id": "145597", "revision_depth": "1", "before_revision": "Massachusetts Attorney General Martha Coakley Massachusetts Attorney General Martha Coakley and Massachusetts State Senator Scott P. Brown who represents the Norfolk, Bristol & Middlesex District have won their parties' respective primaries amid low voter turnout to replace the seat of the late Ted Kennedy who died after losing his battle with brain cancer last August. Coakley won out by 47 percent over three other candidates, who included Representative Michael Capuano who represents Massachusetts' 8th congressional district; Alan Khazei , the co-founder and former CEO of City Year , a national youth service organization which was founded in Boston; and Stephen Pagliuca , a managing director of private equity firm Bain Capital and managing partner of the Boston Celtics basketball team. Brown, the State Senator for the Norfolk, Bristol & Middlesex District and an officer in the Army National Guard , won by a landslide with 89 percent over Jack E. Robinson III , an attorney and businessman who ran against Ted Kennedy as the Republican nominee in the 2000 Senate election along seeking two other offices. Massachusetts Secretary of the Commonwealth William F. Galvin said that he expected turnout to be \"very light\" with 500,000 to 900,000 voters out of Massachusetts 4.1 million registered voters participating. He added that the turnout would be much closer to \"to the 5 than to the 9.\" Galvin further noted that turnout would mostly consist of Democrat and Republican voters and not independents noting that, \"My instinct is that the independents are not participating.\" Capuano's campaign hoped that low turnout would help him due to the large number of voters in the Boston area where Capuano is widely known and liked due to his representation of the area plus his past as Mayor of Somerville , Massachusetts. The winner will take over the Senate seat once held by Ted Kennedy himself along with former Presidents John Quincy Adams and the brother of Ted Kennedy, John F. Kennedy. Other notable past Senators include Daniel Webster, Charles Sumner, Henry Cabot Lodge , and his son Henry Cabot Lodge Jr. The winner will replace Paul G. Kirk , a longtime friend of Senator Kennedy who is currently holding the seat as a interim appointee.", "after_revision": "Massachusetts Attorney General Martha Coakley Massachusetts and who represents the Norfolk, Bristol & Middlesex District have won their parties' respective primaries amid low voter turnout to of the late who died after losing his battle with brain cancer last August. Coakley won out by 47 percent over three other candidates, who included Representative who represents ; , the co-founder and former CEO of , a national youth service organization which was founded in Boston; and , a managing director of private equity firm and managing partner of the basketball team. Brown, the State Senator for the Norfolk, Bristol & Middlesex District and an officer in the , won by a landslide with 89 percent over , an attorney and businessman who ran against Ted Kennedy as the Republican nominee in the along seeking two other offices. said that he expected turnout to be \"very light\" with 500,000 to 900,000 voters out of Massachusetts 4.1 million registered voters participating. He added that the turnout would be much closer to \"to the 5 than to the 9.\" Galvin further noted that turnout would mostly consist of Democrat and Republican voters and not independents noting that, \"My instinct is that the independents are not participating.\" Capuano's campaign hoped that low turnout would help him due to the large number of voters in the Boston area where Capuano is widely known and liked due to his representation of the area plus his past as of , Massachusetts. The winner will take over the Senate seat once held by Ted Kennedy himself along with former Presidents and the brother of Ted Kennedy, . Other notable past Senators include , , , and his son The winner will replace , a longtime friend of Senator Kennedy who is currently holding the seat as a interim appointee.", "edit_actions": [{"type": "R", "before": "Attorney General Martha Coakley and Massachusetts State Senator Scott P. Brown", "after": "and", "start_char_pos": 60, "end_char_pos": 138}, {"type": "D", "before": "replace the seat", "after": null, "start_char_pos": 267, "end_char_pos": 283}, {"type": "D", "before": "Ted Kennedy", "after": null, "start_char_pos": 296, "end_char_pos": 307}, {"type": "R", "before": "Michael Capuano who represents Massachusetts' 8th congressional district; Alan Khazei", "after": "who represents ;", "start_char_pos": 459, "end_char_pos": 544}, {"type": "D", "before": "City Year", "after": null, "start_char_pos": 580, "end_char_pos": 589}, {"type": "D", "before": "Stephen Pagliuca", "after": null, "start_char_pos": 663, "end_char_pos": 679}, {"type": "D", "before": "Bain Capital", "after": null, "start_char_pos": 725, "end_char_pos": 737}, {"type": "D", "before": "Boston Celtics", "after": null, "start_char_pos": 766, "end_char_pos": 780}, {"type": "D", "before": "Army National Guard", "after": null, "start_char_pos": 891, "end_char_pos": 910}, {"type": "D", "before": "Jack E. Robinson III", "after": null, "start_char_pos": 953, "end_char_pos": 973}, {"type": "D", "before": "2000 Senate election", "after": null, "start_char_pos": 1065, "end_char_pos": 1085}, {"type": "D", "before": "Massachusetts Secretary of the Commonwealth William F. Galvin", "after": null, "start_char_pos": 1119, "end_char_pos": 1180}, {"type": "R", "before": "Mayor of Somerville", "after": "of", "start_char_pos": 1793, "end_char_pos": 1812}, {"type": "D", "before": "John Quincy Adams", "after": null, "start_char_pos": 1934, "end_char_pos": 1951}, {"type": "R", "before": "John F. Kennedy.", "after": ".", "start_char_pos": 1984, "end_char_pos": 2000}, {"type": "D", "before": "Daniel Webster, Charles Sumner, Henry Cabot Lodge", "after": null, "start_char_pos": 2037, "end_char_pos": 2086}, {"type": "A", "before": null, "after": ", ,", "start_char_pos": 2089, "end_char_pos": 2089}, {"type": "D", "before": "Henry Cabot Lodge Jr.", "after": null, "start_char_pos": 2102, "end_char_pos": 2123}, {"type": "D", "before": "Paul G. Kirk", "after": null, "start_char_pos": 2148, "end_char_pos": 2160}], "sents_char_pos": [0, 132, 371, 532, 658, 797, 1118, 1326, 1587, 1829, 2000, 2123]} {"doc_id": "146601", "revision_depth": "1", "before_revision": "The release of the movie Avatar , written and directed by James Cameron , has generated increased interest in the field of constructed language , also known as conlang. Cameron asked American linguistics professor Paul Frommer to develop a language spoken by the extraterrestrial people in the film known as the Na'vi . Klingon language alphabet, from Klingon Language Institute Author J. R. R. Tolkien developed Elvish languages for his literary series The Lord of the Rings . The Elvish language was featured in scenes of The Lord of the Rings film trilogy , directed by Peter Jackson . The Klingon language (tlhIngan Hol) was developed by linguist Marc Okrand , initially for use in the 1984 film Star Trek III: The Search for Spock . Okrand drew inspiration from Klingon lines spoken by actor James Doohan in the film Star Trek: The Motion Picture ; Doohan portrayed character Montgomery Scott in the Star Trek series. A dictionary for Klingon developed by Okrand, The Klingon Dictionary sold over 300,000 copies. Klingon became quite popular and has developed a usage among Star Trek fans. The Klingon Terran Research Ensemble in the Netherlands created an opera in Klingon. The play Hamlet by William Shakespeare was translated into Klingon. A German Trekkie who goes by the moniker Klenginem posted videos to YouTube where he raps songs he translated into Klingon by musician Eminem . Klenginem has been cited recently in pieces on constructed language in The New York Times, ABC News Nightline, and National Public Radio . \"You know your alien language has taken off when a German guy translates rap songs into it,\" said National Public Radio of Klenginem. Linguistics professor Frommer received his PhD degree from the University of Southern California (USC), and subsequently shifted his focus into the business arena. He returned to USC to teach at the Marshall School of Business . Cameron tasked Frommer with creating an entire language for the Na'vi people. In an interview with Geoff Boucher of the Los Angeles Times , Frommer voiced hope that the language would continue to be used separate from the movie, as Klingon has. \"I'm still working and I hope that the language will have a life of its own,\" said Frommer. The Na'vi language created by Frommer contains over 1,000 words, as well as a structural system and rules format for usage. Frommer told Vanity Fair that the language was fairly developed, commenting, \"It\u2019s got a perfectly consistent sound system, and grammar, orthography, syntax\". Frommer explained the direction given to him before creating the language, \"Cameron wanted something melodious and musical, something that would sound strange and alien but smooth and appealing.\" The Avatar writer-director provided Frommer with approximately three dozen words of the Na'vi language he used in his scriptment for the film. \"That was the starting point. Probably the most exotic thing I added were ejectives, which are these sorts of popping sounds that are found in different languages from around the world. It's found in Native American languages and in parts of Africa and in Central Asia, the Caucasus,\" explained Frommer. Cameron and Frommer worked together for four years developing the language. The linguistics professor relied on inspiration provided by Cameron, and avoided drawing upon influences from Elvish, Klingon, and the international auxiliary language Esperanto . Sample words in the Na'vi language include \"Unilt\u00ecrantokx\" (oo-neel-tih-RAHN-tokx), meaning \"Avatar\", and \"tireaioang\" (tee-REH-ah-ee-o-ahng), which means \"spirit animal\". Maclean's reported that fans of Avatar were anxious for more instructive material from professor Frommer about the language in order to learn how to speak it with others that appreciated the film. \"The response has been quite remarkable and totally unexpected. I never thought there\u2019d be this level of interest. But I really don\u2019t think of Na\u2019vi as a competitor to Klingon. If it does develop a following, that would be quite wonderful,\" said Frommer of the response to the language from Avatar fans. The Na'vi language is itself a minor plot point in the film Avatar. The character Jake Sully portrayed by Sam Worthington endeavors to learn the language while living on Pandora. A botanist portrayed by actress Sigourney Weaver instructs a scientist played by actor Joel David Moore on how to become conversational in the language. Zoe Salda\u00f1a , the actress behind warrior princess Neytiri in Avatar, picked up the Na'vi language faster than her fellow cast members. \"Zoe owned the language and everyone had to match her, even her accent,\" said Cameron. Salda\u00f1a remarked that the most difficult part about acting in the film was speaking in English with the accent of the Na'vi people. Cameron touted the rich nature of the Na'vi language in publicity for his film. \"We wanted to 'out-Klingon' Klingon. The best sci-fi movies immerse the audience in that world until it doesn't seem alien to them,\" said Cameron to USA Today .", "after_revision": "The release of the movie , written and directed by , has generated increased interest in the field of , also known as conlang. Cameron asked American professor to develop a language spoken by the extraterrestrial people in the film known as the . alphabet, from Author developed for his literary series . The Elvish language was featured in scenes of , directed by . The (tlhIngan Hol) was developed by linguist , initially for use in the 1984 film . Okrand drew inspiration from Klingon lines spoken by actor in the film ; Doohan portrayed character in the Star Trek series. A dictionary for Klingon developed by Okrand, sold over 300,000 copies. Klingon became quite popular and has developed a usage among Star Trek fans. The Klingon Terran Research Ensemble in the created an in Klingon. The play by was translated into Klingon. A German Trekkie who goes by the moniker Klenginem posted videos to YouTube where he raps songs he translated into Klingon by musician . Klenginem has been cited recently in pieces on constructed language in , , and . \"You know your alien language has taken off when a German guy translates rap songs into it,\" said National Public Radio of Klenginem. Linguistics professor Frommer received his degree from the (USC), and subsequently shifted his focus into the business arena. He returned to USC to teach at the . Cameron tasked Frommer with creating an entire language for the Na'vi people. In an interview with Geoff Boucher of the , Frommer voiced hope that the language would continue to be used separate from the movie, as Klingon has. \"I'm still working and I hope that the language will have a life of its own,\" said Frommer. The created by Frommer contains over 1,000 words, as well as a structural system and rules format for usage. Frommer told that the language was fairly developed, commenting, \"It\u2019s got a perfectly consistent sound system, and grammar, orthography, syntax\". Frommer explained the direction given to him before creating the language, \"Cameron wanted something melodious and musical, something that would sound strange and alien but smooth and appealing.\" The Avatar writer-director provided Frommer with approximately three dozen words of the Na'vi language he used in his for the film. \"That was the starting point. Probably the most exotic thing I added were ejectives, which are these sorts of popping sounds that are found in different languages from around the world. It's found in Native American languages and in parts of Africa and in Central Asia, the Caucasus,\" explained Frommer. Cameron and Frommer worked together for four years developing the language. The linguistics professor relied on inspiration provided by Cameron, and avoided drawing upon influences from Elvish, Klingon, and the . Sample words in the Na'vi language include \"Unilt\u00ecrantokx\" (oo-neel-tih-RAHN-tokx), meaning \"Avatar\", and \"tireaioang\" (tee-REH-ah-ee-o-ahng), which means \"spirit animal\". reported that fans of Avatar were anxious for more instructive material from professor Frommer about the language in order to learn how to speak it with others that appreciated the film. \"The response has been quite remarkable and totally unexpected. I never thought there\u2019d be this level of interest. But I really don\u2019t think of Na\u2019vi as a competitor to Klingon. If it does develop a following, that would be quite wonderful,\" said Frommer of the response to the language from Avatar fans. The Na'vi language is itself a minor plot point in the film Avatar. The character Jake Sully portrayed by endeavors to learn the language while living on Pandora. A portrayed by actress instructs a scientist played by actor on how to become conversational in the language. , the actress behind warrior princess Neytiri in Avatar, picked up the Na'vi language faster than her fellow cast members. \"Zoe owned the language and everyone had to match her, even her accent,\" said Cameron. Salda\u00f1a remarked that the most difficult part about acting in the film was speaking in English with the accent of the Na'vi people. Cameron touted the rich nature of the Na'vi language in publicity for his film. \"We wanted to 'out-Klingon' Klingon. The best sci-fi movies immerse the audience in that world until it doesn't seem alien to them,\" said Cameron to .", "edit_actions": [{"type": "D", "before": "Avatar", "after": null, "start_char_pos": 25, "end_char_pos": 31}, {"type": "D", "before": "James Cameron", "after": null, "start_char_pos": 58, "end_char_pos": 71}, {"type": "D", "before": "constructed language", "after": null, "start_char_pos": 123, "end_char_pos": 143}, {"type": "R", "before": "linguistics professor Paul Frommer", "after": "professor", "start_char_pos": 192, "end_char_pos": 226}, {"type": "D", "before": "Na'vi", "after": null, "start_char_pos": 312, "end_char_pos": 317}, {"type": "D", "before": "Klingon language", "after": null, "start_char_pos": 320, "end_char_pos": 336}, {"type": "R", "before": "Klingon Language Institute Author J. R. R. Tolkien developed Elvish languages", "after": "Author developed", "start_char_pos": 352, "end_char_pos": 429}, {"type": "D", "before": "The Lord of the Rings", "after": null, "start_char_pos": 454, "end_char_pos": 475}, {"type": "D", "before": "The Lord of the Rings film trilogy", "after": null, "start_char_pos": 524, "end_char_pos": 558}, {"type": "D", "before": "Peter Jackson", "after": null, "start_char_pos": 573, "end_char_pos": 586}, {"type": "D", "before": "Klingon language", "after": null, "start_char_pos": 593, "end_char_pos": 609}, {"type": "D", "before": "Marc Okrand", "after": null, "start_char_pos": 651, "end_char_pos": 662}, {"type": "D", "before": "Star Trek III: The Search for Spock", "after": null, "start_char_pos": 700, "end_char_pos": 735}, {"type": "D", "before": "James Doohan", "after": null, "start_char_pos": 797, "end_char_pos": 809}, {"type": "D", "before": "Star Trek: The Motion Picture", "after": null, "start_char_pos": 822, "end_char_pos": 851}, {"type": "D", "before": "Montgomery Scott", "after": null, "start_char_pos": 881, "end_char_pos": 897}, {"type": "D", "before": "The Klingon Dictionary", "after": null, "start_char_pos": 969, "end_char_pos": 991}, {"type": "R", "before": "Netherlands created an opera", "after": "created an", "start_char_pos": 1139, "end_char_pos": 1167}, {"type": "R", "before": "Hamlet by William Shakespeare", "after": "by", "start_char_pos": 1189, "end_char_pos": 1218}, {"type": "D", "before": "Eminem", "after": null, "start_char_pos": 1383, "end_char_pos": 1389}, {"type": "R", "before": "The New York Times, ABC News Nightline, and National Public Radio", "after": ", , and", "start_char_pos": 1463, "end_char_pos": 1528}, {"type": "D", "before": "PhD", "after": null, "start_char_pos": 1708, "end_char_pos": 1711}, {"type": "D", "before": "University of Southern California", "after": null, "start_char_pos": 1728, "end_char_pos": 1761}, {"type": "D", "before": "Marshall School of Business", "after": null, "start_char_pos": 1864, "end_char_pos": 1891}, {"type": "D", "before": "Los Angeles Times", "after": null, "start_char_pos": 2014, "end_char_pos": 2031}, {"type": "D", "before": "Na'vi language", "after": null, "start_char_pos": 2235, "end_char_pos": 2249}, {"type": "D", "before": "Vanity Fair", "after": null, "start_char_pos": 2368, "end_char_pos": 2379}, {"type": "D", "before": "scriptment", "after": null, "start_char_pos": 2828, "end_char_pos": 2838}, {"type": "D", "before": "international auxiliary language Esperanto", "after": null, "start_char_pos": 3368, "end_char_pos": 3410}, {"type": "D", "before": "Maclean's", "after": null, "start_char_pos": 3585, "end_char_pos": 3594}, {"type": "D", "before": "Sam Worthington", "after": null, "start_char_pos": 4192, "end_char_pos": 4207}, {"type": "D", "before": "botanist", "after": null, "start_char_pos": 4267, "end_char_pos": 4275}, {"type": "D", "before": "Sigourney Weaver", "after": null, "start_char_pos": 4297, "end_char_pos": 4313}, {"type": "D", "before": "Joel David Moore", "after": null, "start_char_pos": 4352, "end_char_pos": 4368}, {"type": "D", "before": "Zoe Salda\u00f1a", "after": null, "start_char_pos": 4418, "end_char_pos": 4429}, {"type": "D", "before": "USA Today", "after": null, "start_char_pos": 5001, "end_char_pos": 5010}], "sents_char_pos": [0, 168, 477, 588, 737, 853, 922, 1017, 1094, 1179, 1247, 1664, 1828, 1971, 2138, 2230, 2354, 2513, 2709, 2852, 2882, 3038, 3156, 3232, 3584, 3781, 3845, 3896, 3958, 4085, 4153, 4264, 4417, 4552, 4639, 4771, 4851, 4888]} {"doc_id": "15107", "revision_depth": "1", "before_revision": "At Buckingham Palace, Queen Elizabeth II stood on the forecourt in silence, accompanied by Foot Guards . Prime Minister Tony Blair marked the silence in the garden of 10 Downing Street , and Mayor of London Ken Livingstone paid his respects at Trafalgar Square . At The Open Championship taking place at St Andrews , golfers also paid their respects. Yesterday, Anfield stadium fell in silence during the Liverpool F.C. vs TNS UEFA Champios League football match. In Paris, France , President Jacques Chirac stood in silence at the Elysee Palace before taking part in the Bastille Day parade. The European Parliament marked the silence along with European Commission offices across the EU.", "after_revision": "At , stood on the forecourt in silence, accompanied by . Prime Minister Tony Blair marked the silence in the garden of , and Mayor of London paid his respects at . At taking place at , golfers also paid their respects. Yesterday, fell in silence during the vs football match. In , , President Jacques Chirac stood in silence at the before taking part in the parade. The marked the silence along with offices across the EU.", "edit_actions": [{"type": "R", "before": "Buckingham Palace, Queen Elizabeth II", "after": ",", "start_char_pos": 3, "end_char_pos": 40}, {"type": "D", "before": "Foot Guards", "after": null, "start_char_pos": 91, "end_char_pos": 102}, {"type": "D", "before": "10 Downing Street", "after": null, "start_char_pos": 167, "end_char_pos": 184}, {"type": "D", "before": "Ken Livingstone", "after": null, "start_char_pos": 207, "end_char_pos": 222}, {"type": "D", "before": "Trafalgar Square", "after": null, "start_char_pos": 244, "end_char_pos": 260}, {"type": "D", "before": "The Open Championship", "after": null, "start_char_pos": 266, "end_char_pos": 287}, {"type": "D", "before": "St Andrews", "after": null, "start_char_pos": 304, "end_char_pos": 314}, {"type": "D", "before": "Anfield stadium", "after": null, "start_char_pos": 362, "end_char_pos": 377}, {"type": "R", "before": "Liverpool F.C. vs TNS UEFA Champios League", "after": "vs", "start_char_pos": 405, "end_char_pos": 447}, {"type": "D", "before": "Paris, France", "after": null, "start_char_pos": 467, "end_char_pos": 480}, {"type": "A", "before": null, "after": ",", "start_char_pos": 483, "end_char_pos": 483}, {"type": "D", "before": "Elysee Palace", "after": null, "start_char_pos": 533, "end_char_pos": 546}, {"type": "D", "before": "Bastille Day", "after": null, "start_char_pos": 573, "end_char_pos": 585}, {"type": "D", "before": "European Parliament", "after": null, "start_char_pos": 598, "end_char_pos": 617}, {"type": "D", "before": "European Commission", "after": null, "start_char_pos": 648, "end_char_pos": 667}], "sents_char_pos": [0, 262, 350, 463, 593]} {"doc_id": "15180", "revision_depth": "3", "before_revision": "The Governor General of Canada Adrienne Clarkson signed an ordinance today removing David Ahenakew from membership in the Order of Canada . Ahenakew becomes the second person to be stripped of the honor; former NHLPA president Alan Eagleson was the first to be removed in 1998. Eagleson admitted guilt on charges of extortion and obstructing justice. Ahenakew was removed from the Order three days after being convicted of charges of willing promoting hatred against the Jewish people. The charges stem from comments made to a reporter in 2002 about Jews . Ahenakew stated that Jews were \"a disease\" and that Hitler was trying to \"clean up the world\" when he \"fried six million of those guys.\" The Advisory Council of the Order of Canada met on June 29 at Rideau Hall , the residence of the Governor General, to discuss Ahenakew's fate. After the meeting, Ahenakew was sent a letter, asking for him to respond to the possible revocation or surrender his membership voluntarily. A deadline for Ahenakew to respond was set at July 9, which Ahenakew did not. That led to Governor General signing the ordinance to remove Ahenakew from the Order. Ahenakew has to surrender his Order insignia , which consists of a medal , lapel pin, and scroll . Ahenakew loses the right to use post-nominal letters in his name, and loses the right to use the Order motto in his personal coat of arms .", "after_revision": "The signed an ordinance today removing from membership in the . Ahenakew becomes the second person to be stripped of the honor; former president was the first to be removed in . Eagleson admitted guilt on charges of extortion and obstructing justice. Ahenakew was removed from the Order three days after being convicted of charges of willing promoting hatred against the Jewish people. The charges stem from comments made to a reporter in about . Ahenakew stated that Jews were \"a disease\" and that was trying to \"clean up the world\" when he \"fried six million of those guys.\" The Advisory Council of the Order of Canada met on June 29 at , the residence of the Governor General, to discuss Ahenakew's fate. After the meeting, Ahenakew was sent a letter, asking for him to respond to the possible revocation or surrender his membership voluntarily. A deadline for Ahenakew to respond was set at July 9, which Ahenakew did not. That led to Governor General signing the ordinance to remove Ahenakew from the Order. Ahenakew has to surrender his Order , which consists of a , lapel pin, and . Ahenakew loses the right to use in his name, and loses the right to use the Order in his personal .", "edit_actions": [{"type": "D", "before": "Governor General of Canada Adrienne Clarkson", "after": null, "start_char_pos": 4, "end_char_pos": 48}, {"type": "D", "before": "David Ahenakew", "after": null, "start_char_pos": 84, "end_char_pos": 98}, {"type": "D", "before": "Order of Canada", "after": null, "start_char_pos": 122, "end_char_pos": 137}, {"type": "R", "before": "NHLPA president Alan Eagleson", "after": "president", "start_char_pos": 211, "end_char_pos": 240}, {"type": "R", "before": "1998.", "after": ".", "start_char_pos": 272, "end_char_pos": 277}, {"type": "R", "before": "2002 about Jews", "after": "about", "start_char_pos": 539, "end_char_pos": 554}, {"type": "D", "before": "Hitler", "after": null, "start_char_pos": 609, "end_char_pos": 615}, {"type": "D", "before": "Rideau Hall", "after": null, "start_char_pos": 756, "end_char_pos": 767}, {"type": "D", "before": "insignia", "after": null, "start_char_pos": 1178, "end_char_pos": 1186}, {"type": "D", "before": "medal", "after": null, "start_char_pos": 1209, "end_char_pos": 1214}, {"type": "D", "before": "scroll", "after": null, "start_char_pos": 1232, "end_char_pos": 1238}, {"type": "D", "before": "post-nominal letters", "after": null, "start_char_pos": 1273, "end_char_pos": 1293}, {"type": "D", "before": "motto", "after": null, "start_char_pos": 1344, "end_char_pos": 1349}, {"type": "D", "before": "coat of arms", "after": null, "start_char_pos": 1366, "end_char_pos": 1378}], "sents_char_pos": [0, 139, 203, 277, 350, 485, 556, 693, 836, 977, 1055, 1141, 1240]} {"doc_id": "15187", "revision_depth": "1", "before_revision": "One hundred students from Serbia who decide to start graduate studies abroad will get \u20ac15,000 a year scholarships from the Fund for young talents . Students who can apply need to have at least 8.5 GPA on 5 to 10 scale, and have to be younger then 26. Another condition is that they have to work in Serbia for at least 5 years after finishing their graduate studies. Winners will be decided based on their GPA and prestige of the university they apply to . Also, one thousand university seniors will be awarded \u20ac250 a month. The secretary of the Serbian Student Union, Marko Milovanovi\u0107, is satisfied with this action, but also notes that it would be better if economic needs of students were taken into account too . The Fund for young talents will cover about 2.5\\% of students in Serbia.", "after_revision": "One hundred students from Serbia who decide to pursue graduate studies abroad will get \u20ac15,000 a year scholarships from the Fund for Young Talents . Students who wish to apply must have at least an 8.5 GPA on 5 to 10 scale, and must be younger then 26. Additionally, students must commit to work in Serbia for at least 5 years after finishing their graduate studies. Scholarship will be awarded based on the student's GPA and the prestige of the university to which they apply . Also, one thousand university seniors will be awarded \u20ac250 a month. The secretary of the Serbian Student Union, Marko Milovanovi\u0107, is satisfied with this action, but also notes that it would be better if economic needs of students were taken into account as well . The Fund for Young Talents will provide funding to about 2.5\\% of students in Serbia.", "edit_actions": [{"type": "R", "before": "start", "after": "pursue", "start_char_pos": 47, "end_char_pos": 52}, {"type": "R", "before": "young talents", "after": "Young Talents", "start_char_pos": 132, "end_char_pos": 145}, {"type": "R", "before": "can apply need to", "after": "wish to apply must", "start_char_pos": 161, "end_char_pos": 178}, {"type": "A", "before": null, "after": "an", "start_char_pos": 193, "end_char_pos": 193}, {"type": "R", "before": "have to", "after": "must", "start_char_pos": 224, "end_char_pos": 231}, {"type": "R", "before": "Another condition is that they have", "after": "Additionally, students must commit", "start_char_pos": 252, "end_char_pos": 287}, {"type": "R", "before": "Winners will be decided based on their GPA and", "after": "Scholarship will be awarded based on the student's GPA and the", "start_char_pos": 367, "end_char_pos": 413}, {"type": "R", "before": "they apply to", "after": "to which they apply", "start_char_pos": 441, "end_char_pos": 454}, {"type": "R", "before": "too", "after": "as well", "start_char_pos": 712, "end_char_pos": 715}, {"type": "R", "before": "young talents will cover", "after": "Young Talents will provide funding to", "start_char_pos": 731, "end_char_pos": 755}], "sents_char_pos": [0, 251, 366, 524, 717]} {"doc_id": "155850", "revision_depth": "1", "before_revision": "Map of Schengen nations Libya and Switzerland have reportedly agreed to meet in an effort to resolve a diplomatic row about travel visas . Micheline Calmy-Rey of Switzerland and Moussa Koussa of Libya will meet in the presence of Miguel \u00c1ngel Moratinos of Spain. All three are the heads of foreign relations for their respective countries. The meeting comes at the urging of Malta and Italy. Libya announced on Tuesday that it has suspended and/or revoked visas given to citizens of the Schengen Area of Europe. Four Italian citizens have been detained at the Tripoli International Airport pending deportation, as their visas have been revoked. Confirming the situation, a Libyan official told Reuters : \"This is right. This decision has been taken. No visas for Europeans, except Britain.\" Malta has had eight citizens turned back. One of these told The Times of Malta, \"They treated us like hostages, not even allowing us out of the room to stretch our legs.\" The European Commission released a statement saying it \"deplores the unilateral and disproportionate\" action by Libya and that affected nations will consider an \"appropriate reaction.\" \"The Commission also regrets that travellers who legally obtained visas before the suspension measure were refused entry when arriving in Libya,\" said EU commissioner for Home Affairs, Cecilia Malmstr\u00f6m . Libya and Switzerland have been in a diplomatic row for many months. In July 2008, the Swiss for two days detained Libyan leader Muammar al-Gaddafi 's son, Hannibal, after hotel staff in Geneva complained of being assaulted. Hannibal was given a suspended sentence and released. Since then, Libya has withdrawn more than US 5 billion ( \u20ac 3.6 billlion) from Swiss banks and cut of oil exports to Switzerland. Libya then detained two Swiss businessmen and sentenced one to 16 months of prison on visa violation charges. In November, 2009, Switzerland asked Schengen nations to restrict Libyan visas. Subsequently, Libyan Prime Minister Baghdadi Mahmudi and other officials have been denied Schengen visas. Sawsan Chebli, a senior German Council on Foreign Relations (DGAP) said that, \"The EU is Libya\u2019s greatest trade and export partner. This is a leverage the EU could use. However, Italy and other EU member states with close relations with Libya in the past have shown that they are not interested to spoil their relations with Libya whatever Gaddafi\u2019s action may be. That is not likely to change. And the problem is that Gaddafi knows that he is able to divide the EU.\"", "after_revision": "Map of Schengen nations Libya and Switzerland have reportedly agreed to meet in an effort to resolve a diplomatic row about . of Switzerland and Moussa Koussa of Libya will meet in the presence of of Spain. All three are the for their respective countries. The meeting comes at the urging of Malta and Italy. Libya announced on Tuesday that it has suspended and/or revoked visas given to citizens of the of Europe. Four Italian citizens have been detained at the pending deportation, as their visas have been revoked. Confirming the situation, a Libyan official told : \"This is right. This decision has been taken. No visas for Europeans, except Britain.\" Malta has had eight citizens turned back. One of these told of Malta, \"They treated us like hostages, not even allowing us out of the room to stretch our legs.\" The released a statement saying it \"deplores the unilateral and disproportionate\" action by Libya and that affected nations will consider an \"appropriate reaction.\" \"The Commission also regrets that travellers who legally obtained visas before the suspension measure were refused entry when arriving in Libya,\" said EU commissioner for Home Affairs, . Libya and Switzerland have been in a diplomatic row for many months. In July 2008, the Swiss for two days detained Libyan leader 's son, Hannibal, after hotel staff in complained of being assaulted. Hannibal was given a suspended sentence and released. Since then, Libya has withdrawn more than 5 billion ( 3.6 billlion) from Swiss banks and cut of oil exports to Switzerland. Libya then detained two Swiss businessmen and sentenced one to 16 months of prison on visa violation charges. In November, 2009, Switzerland asked Schengen nations to restrict Libyan visas. Subsequently, Libyan Prime Minister and other officials have been denied Schengen visas. Sawsan Chebli, a senior (DGAP) said that, \"The EU is Libya\u2019s greatest trade and export partner. This is a leverage the EU could use. However, Italy and other EU member states with close relations with Libya in the past have shown that they are not interested to spoil their relations with Libya whatever Gaddafi\u2019s action may be. That is not likely to change. And the problem is that Gaddafi knows that he is able to divide the EU.\"", "edit_actions": [{"type": "D", "before": "travel visas", "after": null, "start_char_pos": 124, "end_char_pos": 136}, {"type": "D", "before": "Micheline Calmy-Rey", "after": null, "start_char_pos": 139, "end_char_pos": 158}, {"type": "D", "before": "Miguel \u00c1ngel Moratinos", "after": null, "start_char_pos": 230, "end_char_pos": 252}, {"type": "D", "before": "heads of foreign relations", "after": null, "start_char_pos": 281, "end_char_pos": 307}, {"type": "D", "before": "Schengen Area", "after": null, "start_char_pos": 487, "end_char_pos": 500}, {"type": "D", "before": "Tripoli International Airport", "after": null, "start_char_pos": 560, "end_char_pos": 589}, {"type": "D", "before": "Reuters", "after": null, "start_char_pos": 694, "end_char_pos": 701}, {"type": "D", "before": "The Times", "after": null, "start_char_pos": 851, "end_char_pos": 860}, {"type": "D", "before": "European Commission", "after": null, "start_char_pos": 966, "end_char_pos": 985}, {"type": "D", "before": "Cecilia Malmstr\u00f6m", "after": null, "start_char_pos": 1332, "end_char_pos": 1349}, {"type": "D", "before": "Muammar al-Gaddafi", "after": null, "start_char_pos": 1481, "end_char_pos": 1499}, {"type": "D", "before": "Geneva", "after": null, "start_char_pos": 1539, "end_char_pos": 1545}, {"type": "D", "before": "US", "after": null, "start_char_pos": 1673, "end_char_pos": 1675}, {"type": "D", "before": "\u20ac", "after": null, "start_char_pos": 1688, "end_char_pos": 1689}, {"type": "D", "before": "Baghdadi Mahmudi", "after": null, "start_char_pos": 1986, "end_char_pos": 2002}, {"type": "D", "before": "German Council on Foreign Relations", "after": null, "start_char_pos": 2080, "end_char_pos": 2115}], "sents_char_pos": [0, 138, 262, 339, 391, 511, 644, 719, 749, 790, 832, 961, 1420, 1576, 1630, 1759, 1869, 1949, 2055, 2187, 2224, 2420, 2450]} {"doc_id": "15757", "revision_depth": "1", "before_revision": "Today the Hewlett-Packard Co. has announced that it will be cutting 10\\% or 14,500 of it's full-time staff wil be cut over the course of the next six quarters. HP CEO Mark Hurd, who 's had office for just about three months now , has decided that he wishes to simplify HP's operations by combining sales and marketing directly into business units. The job cuts are expected to save HP $1.9 billion US annually. These cuts are all part of HP's new restructuring plan, the savings from this restructuring will primarily be to \u201coffset market forces\u201d or in other words, to strengthen HP's competitiveness in the market. The job cuts come after prolonged analyst speculation that HP would be announcing between 10,000 and 25,000 losses. Few losses are expected in the areas of Sales nor in Research & Development. The media in Ireland, where HP has over 4,000 employees across seven business units, has reacted cautiously to the announcement urging that more details should be waited for before making any comments. The news however has made national headlines and workers are understandably anxious to find out more details.", "after_revision": "Today the Hewlett-Packard Co. has announced that 10\\% or 14,500 of its full-time staff will be cut over the course of the next six quarters. HP CEO Mark Hurd, who took office about three months ago , has decided to simplify HP's operations by combining sales and marketing directly into business units. The job cuts are expected to save HP US $1.9 billion annually. These cuts are all part of HP's new restructuring plan, the savings from which will primarily be used to \u201coffset market forces\u201d , in other words, to strengthen HP's competitiveness in the market. The job cuts come after prolonged analyst speculation that HP would be announcing between 10,000 and 25,000 losses. Few losses are expected in the areas of Sales or Research & Development. The media in Ireland, where HP has over 4,000 employees across seven business units, has reacted cautiously to the announcement urging that more details should be awaited for before making any comments. The news however has made national headlines and workers are understandably anxious to find out more details.", "edit_actions": [{"type": "D", "before": "it will be cutting", "after": null, "start_char_pos": 49, "end_char_pos": 67}, {"type": "R", "before": "it's", "after": "its", "start_char_pos": 86, "end_char_pos": 90}, {"type": "R", "before": "wil", "after": "will", "start_char_pos": 107, "end_char_pos": 110}, {"type": "R", "before": "'s had office for just", "after": "took office", "start_char_pos": 182, "end_char_pos": 204}, {"type": "R", "before": "now", "after": "ago", "start_char_pos": 224, "end_char_pos": 227}, {"type": "D", "before": "that he wishes", "after": null, "start_char_pos": 242, "end_char_pos": 256}, {"type": "A", "before": null, "after": "US", "start_char_pos": 385, "end_char_pos": 385}, {"type": "D", "before": "US", "after": null, "start_char_pos": 399, "end_char_pos": 401}, {"type": "R", "before": "this restructuring", "after": "which", "start_char_pos": 485, "end_char_pos": 503}, {"type": "A", "before": null, "after": "used", "start_char_pos": 522, "end_char_pos": 522}, {"type": "R", "before": "or", "after": ",", "start_char_pos": 549, "end_char_pos": 551}, {"type": "R", "before": "nor in", "after": "or", "start_char_pos": 780, "end_char_pos": 786}, {"type": "R", "before": "waited", "after": "awaited", "start_char_pos": 974, "end_char_pos": 980}], "sents_char_pos": [0, 159, 347, 411, 617, 733, 810, 1012]} {"doc_id": "16289", "revision_depth": "1", "before_revision": "Beginning 2006, all horses in the EU must have passports, according to new rules from the European Union. Two thirds of all horses in Sweden are estimated to not have passports, says Britta Lundstr\u00f6m at the Swedish Ministry of Agriculture (Jordbruksverket) to the news agency TT. If the owner of a horse doesn't get a passport for their animal before the end of the year, they will be breaking the law. The Ministry of Agriculture has had problems reaching horse owners who don't reading horse magazines. Because of this, the ministry is planning a campaign this autumn. The passport contains information on the owner, the race and number. A photograph isn't mandatory however, but a description of the horse's appearance is required.", "after_revision": "Beginning in 2006, all horses in the EU will be required to have passports, according to new rules from the European Union. Two thirds of all horses in Sweden are estimated to not have passports, Britta Lundstr\u00f6m at the Swedish Ministry of Agriculture (Jordbruksverket) told news agency TT. If the owner of a horse doesn't get a passport for their animal before the end of the year, they will be breaking the law. The Ministry of Agriculture has had problems reaching horse owners who don't read horse magazines. Because of this, the ministry is planning a campaign this autumn. The passport contains information on the owner, the race and number. A photograph isn't mandatory but a description of the horse's appearance is required.", "edit_actions": [{"type": "A", "before": null, "after": "in", "start_char_pos": 10, "end_char_pos": 10}, {"type": "R", "before": "must", "after": "will be required to", "start_char_pos": 38, "end_char_pos": 42}, {"type": "D", "before": "says", "after": null, "start_char_pos": 179, "end_char_pos": 183}, {"type": "R", "before": "to the", "after": "told", "start_char_pos": 258, "end_char_pos": 264}, {"type": "R", "before": "reading", "after": "read", "start_char_pos": 481, "end_char_pos": 488}, {"type": "D", "before": "however,", "after": null, "start_char_pos": 670, "end_char_pos": 678}], "sents_char_pos": [0, 106, 280, 403, 505, 571, 640]} {"doc_id": "16340", "revision_depth": "1", "before_revision": "250px|Map of Iran. Source: CIA World Factbook International controversy erupted after Iranian officials executed two gay teenagers who were originally reported to be convicted of homosexuality, however later reports released by the Iranian government after international furor claimed the conviction was for the rape of a 13-year-old boy. The two were hanged July 19. Only the age of one of the two executed teens was officially released to the public. He was 18 year old Ayaz Marhoni. The other, Mahmoud Asgari, according to the Iranian Student's News Agency (ISNA) was aged 17, but other news agencies have reported the teenager's age as 16. In the original report by the ISNA it was said that the two were found having sex together when they were both 16. It also reported that they were held and beaten for fourteen months before the execution. The UK-based gay rights group, Outrage! claims the report issued later by the government of Iran is a \"smokescreen\" to justify killing homosexuals. And one media outlet, Direland, has blasted the media holdings of Rupert Murdoch that includes Fox News Channel and The Times newspaper for publishing the subsequent Iranian government issued allegation of rape as matter of fact without mention of the previous stories before international condemnation bearing no such accusations. According to Iranian newspapers, the two boys were given 228 lashes for their other convictions of theft, disrupting public order and public drinking before they were hanged in Edalat (\"Justice\" in English) Square in the Iranian city of Mashhad . The executioners, fearing reprisals, wore masks and anti-riot forces were mobilized to prevent outbreaks of public protests. Photos of the execution released by Iranian Students News Agency showed the two teens crying in the truck driving them to the gallows in Justice Square, located in the northeastern region of the country. Iran has been under fire by international human rights groups for executing teenagers in the past, including the 2004 execution of Atefeh Rajabi , a 16-year-old girl convicted of having sex before marriage . Medical reports, not allowed in the court, had stated that she was mentally ill . Another report, by Iran In Focus, claimed that the two were hanged not for gay sex, but rather for sexually assaulting a thirteen year old boy at knife point. Neither the original Iranian Student's News Agency nor an additional report from the National Council of Resistance of Iran had this allegation, said the United Kingdom based Outrage . Direland Press has noted that the accusation of rape in reports came days after international outrage and detailed reports by other Iranian news agencies. They suggest the recent report is a ploy of the Iranian government to justify its actions. Tatchell told reporters that according to Iranian human rights activists, more than 4,000 lesbians and gay men have been executed in Iran since the ayatollahs seized power in 1979. He said an estimated 100,000 Iranians have been executed in Iran since that time. OutRage! requested the international community see Iran \"as a pariah state\" and to \"break off diplomatic relations, impose trade sanctions, and give practical support to the democratic and left opposition inside Iran.\" In the Unites States, the Human Rights Campaign has called for U.S. Secretary of State Condoleezza Rice to condemn the executions.", "after_revision": "250px|Map of Iran. Source: CIA World Factbook International controversy erupted after Iranian officials executed two gay teenagers who were originally reported to be convicted of homosexuality, however later reports released by the Iranian government after international claimed the conviction was for the rape of a 13-year-old boy. The two were hanged July 19. Only the age of one of the two executed teens was officially released to the public. He was 18 year old Ayaz Marhoni. The other, Mahmoud Asgari, according to the (ISNA) was aged 17, but other news agencies have reported the teenager's age as 16. In the original report by the ISNA it was said that the two were found having together when they were both 16. It also reported that they were held and beaten for fourteen months before the execution. The UK-based gay rights group, claims the report issued later by the government of Iran is a \"smokescreen\" to justify killing homosexuals. And one media outlet, Direland, has blasted the media holdings of that includes Fox News Channel and The Times newspaper for publishing the subsequent Iranian government issued allegation of rape as matter of fact without mention of the previous stories before international condemnation bearing no such accusations. According to Iranian newspapers, the two boys were given 228 lashes for their other convictions of theft, disrupting public order and public drinking before they were hanged in Edalat (\"Justice\" in English) Square in the Iranian city of . The executioners, fearing reprisals, wore masks and anti-riot forces were mobilized to prevent outbreaks of public protests. Photos of the execution released by Iranian Students News Agency showed the two teens crying in the truck driving them to the in Justice Square, located in the northeastern region of the country. Iran has been under fire by international human rights groups for executing teenagers in the past, including the 2004 execution of , a 16-year-old girl convicted of having . Medical reports, not allowed in the court, had stated that she was . Another report, by Iran In Focus, claimed that the two were hanged not for gay sex, but rather for sexually assaulting a thirteen year old boy at knife point. Neither the original Iranian Student's News Agency nor an additional report from the had this allegation, said the United Kingdom based OutRage! . Direland Press has noted that the accusation of rape in reports came days after international outrage and detailed reports by other Iranian news agencies. They suggest the recent report is a ploy of the Iranian government to justify its actions. Tatchell told reporters that according to Iranian human rights activists, more than 4,000 lesbians and gay men have been executed in Iran since the seized power in 1979. He said an estimated 100,000 Iranians have been executed in Iran since that time. OutRage! requested the international community see Iran \"as a state\" and to \"break off diplomatic relations, impose trade sanctions, and give practical support to the democratic and left opposition inside Iran.\" In the Unites States, the has called for U.S. Secretary of State Condoleezza Rice to condemn the executions.", "edit_actions": [{"type": "D", "before": "furor", "after": null, "start_char_pos": 271, "end_char_pos": 276}, {"type": "D", "before": "Iranian Student's News Agency", "after": null, "start_char_pos": 530, "end_char_pos": 559}, {"type": "D", "before": "sex", "after": null, "start_char_pos": 722, "end_char_pos": 725}, {"type": "D", "before": "Outrage!", "after": null, "start_char_pos": 880, "end_char_pos": 888}, {"type": "D", "before": "Rupert Murdoch", "after": null, "start_char_pos": 1063, "end_char_pos": 1077}, {"type": "D", "before": "Mashhad", "after": null, "start_char_pos": 1566, "end_char_pos": 1573}, {"type": "D", "before": "gallows", "after": null, "start_char_pos": 1827, "end_char_pos": 1834}, {"type": "D", "before": "Atefeh Rajabi", "after": null, "start_char_pos": 2036, "end_char_pos": 2049}, {"type": "D", "before": "sex before marriage", "after": null, "start_char_pos": 2091, "end_char_pos": 2110}, {"type": "D", "before": "mentally ill", "after": null, "start_char_pos": 2180, "end_char_pos": 2192}, {"type": "D", "before": "National Council of Resistance of Iran", "after": null, "start_char_pos": 2439, "end_char_pos": 2477}, {"type": "R", "before": "Outrage", "after": "OutRage!", "start_char_pos": 2529, "end_char_pos": 2536}, {"type": "D", "before": "ayatollahs", "after": null, "start_char_pos": 2933, "end_char_pos": 2943}, {"type": "D", "before": "pariah", "after": null, "start_char_pos": 3110, "end_char_pos": 3116}, {"type": "D", "before": "Human Rights Campaign", "after": null, "start_char_pos": 3293, "end_char_pos": 3314}], "sents_char_pos": [0, 18, 338, 367, 452, 485, 643, 758, 848, 888, 996, 1328, 1575, 1700, 1904, 2112, 2353, 2538, 2693, 2784, 2965, 3047, 3266]} {"doc_id": "163843", "revision_depth": "1", "before_revision": "The Westminster Palace, House of Lords on the left. The UK government plans to replace the House of Lords , the upper house of British Parliament , with a duly elected one to make it \"legitimate.\" Ministers working on this proposal plan to style this new chamber loosely on the United States Senate. Transport Secretary Lord Andrew Adonis said on a BBC show, \"The time has now come to make it legitimate in the only way that a legislative assembly can be legitimate in the modern world, which is to be elected.\" He assured that there would be \"firm proposals\" for an elected House of Lords in the Labour Party 's manifesto for the general election in May. He added \"We can do it in this country as most democracies do it: We'd have two chambers, both of which are elected but with the government accountable to the first chamber.\" The Sunday Telegraph has leaked a plan which reveals that the 704 seats would be reduced to 300 seats and its members elected under a system of \" proportional representation \". This new chamber would no longer be known as the House of Lords and citizens will have the privilege to remove incompetent members through a \" recall ballot \". The paper reported that each member would serve up to fifteen years and one-third of the chamber would be elected during the usual general elections. The salary is reported to be around \u00a365,000 per annum. All members should be UK residents and fully domiciled for tax purposes. The Lords scrutinise and revise government legislation and are seen by the public as an undemocratic house or a place for the aristocrats and political appointees. The chamber currently has around 740 members. 92 hold hereditary seats, and 26 are Church of England clergy. The rest are appointed for life. Former prime minister Tony Blair , with the 1999 House of Lords act , had expelled hereditary peers from the upper house, apart from the 92 permitted to remain in the House on an interim basis. Another ten inheritors were created life peers to be able to remain in the House. Lord Adonis commented that this expulsion had \"fundamentally transformed\" the chamber into a \"workmanlike assembly\". A spokesman for the Conservative Party (which is the opposition party) alleged that Labour was playing politics with the electoral system by introducing such proposals before the General election despite having thirteen years to reform the Lords. \"We will work to build a consensus for a mainly elected second chamber to replace the House of Lords,\" he added. For centuries, the House of Lords had included several hundred members who inherited their seats; the 1999 Act removed such a right. The Act decreased the membership of the House from 1,330 to 669. The Labour Government is expected to present a bill to remove the remaining 92 hereditary peers from the House. It also introduced in 2009 the Constitutional Reform and Governance Bill, which would end by-elections to replace hereditaries, removing them by steady reduction instead of removing all of them outright.", "after_revision": "The Westminster Palace, House of Lords on the left. The UK government plans to replace the , the upper house of , with a duly elected one to make it \"legitimate.\" Ministers working on this proposal plan to style this new chamber loosely on the United States Senate. Transport Secretary said on a BBC show, \"The time has now come to make it legitimate in the only way that a can be legitimate in the modern world, which is to be elected.\" He assured that there would be \"firm proposals\" for an elected House of Lords in the 's manifesto for the in May. He added \"We can do it in this country as most democracies do it: We'd have two chambers, both of which are elected but with the government accountable to the first chamber.\" has leaked a plan which reveals that the 704 seats would be reduced to 300 seats and its members elected under a system of \" \". This new chamber would no longer be known as the House of Lords and citizens will have the privilege to remove incompetent members through a \" \". The paper reported that each member would serve up to fifteen years and one-third of the chamber would be elected during the usual general elections. The salary is reported to be around \u00a365,000 per annum. All members should be UK residents and fully for tax purposes. The Lords scrutinise and revise government legislation and are seen by the public as an undemocratic house or a place for the aristocrats and political appointees. The chamber currently has around 740 members. 92 hold hereditary seats, and 26 are clergy. The rest are appointed for life. Former prime minister , with the , had expelled from the upper house, apart from the 92 permitted to remain in the House on an interim basis. Another ten inheritors were created life peers to be able to remain in the House. Lord Adonis commented that this expulsion had \"fundamentally transformed\" the chamber into a \"workmanlike assembly\". A spokesman for the (which is the opposition party) alleged that Labour was playing politics with the electoral system by introducing such proposals before the General election despite having thirteen years to reform the Lords. \"We will work to build a consensus for a mainly elected second chamber to replace the House of Lords,\" he added. For centuries, the House of Lords had included several hundred members who inherited their seats; the 1999 Act removed such a right. The Act decreased the membership of the House from 1,330 to 669. The is expected to present a bill to remove the remaining 92 hereditary peers from the House. It also introduced in 2009 the Constitutional Reform and Governance Bill, which would end to replace hereditaries, removing them by steady reduction instead of removing all of them outright.", "edit_actions": [{"type": "D", "before": "House of Lords", "after": null, "start_char_pos": 91, "end_char_pos": 105}, {"type": "D", "before": "British Parliament", "after": null, "start_char_pos": 127, "end_char_pos": 145}, {"type": "D", "before": "Lord Andrew Adonis", "after": null, "start_char_pos": 320, "end_char_pos": 338}, {"type": "D", "before": "legislative assembly", "after": null, "start_char_pos": 427, "end_char_pos": 447}, {"type": "D", "before": "Labour Party", "after": null, "start_char_pos": 597, "end_char_pos": 609}, {"type": "D", "before": "general election", "after": null, "start_char_pos": 631, "end_char_pos": 647}, {"type": "D", "before": "The Sunday Telegraph", "after": null, "start_char_pos": 831, "end_char_pos": 851}, {"type": "D", "before": "proportional representation", "after": null, "start_char_pos": 977, "end_char_pos": 1004}, {"type": "D", "before": "recall ballot", "after": null, "start_char_pos": 1151, "end_char_pos": 1164}, {"type": "D", "before": "domiciled", "after": null, "start_char_pos": 1418, "end_char_pos": 1427}, {"type": "D", "before": "Church of England", "after": null, "start_char_pos": 1693, "end_char_pos": 1710}, {"type": "D", "before": "Tony Blair", "after": null, "start_char_pos": 1774, "end_char_pos": 1784}, {"type": "D", "before": "1999 House of Lords act", "after": null, "start_char_pos": 1796, "end_char_pos": 1819}, {"type": "D", "before": "hereditary peers", "after": null, "start_char_pos": 1835, "end_char_pos": 1851}, {"type": "D", "before": "Conservative Party", "after": null, "start_char_pos": 2165, "end_char_pos": 2183}, {"type": "D", "before": "Labour Government", "after": null, "start_char_pos": 2707, "end_char_pos": 2724}, {"type": "D", "before": "by-elections", "after": null, "start_char_pos": 2905, "end_char_pos": 2917}], "sents_char_pos": [0, 51, 196, 299, 511, 655, 830, 1007, 1167, 1317, 1372, 1445, 1609, 1655, 1718, 1751, 1945, 2027, 2144, 2391, 2504, 2602, 2637, 2702, 2814]} {"doc_id": "176397", "revision_depth": "1", "before_revision": "A 6.2-magnitude aftershock struck a large part of central and southern Chile on Friday morning, but it caused no casualties or major damage, ONEMI reported. The aftershock took place at 06:03 local time ( 10:03 UTC ), and according to the University of Chile Geological Survey , the epicentre was located 26 kilometers to the south of Arauco , 65 kilometers to the south of Concepci\u00f3n , and almost 580 kilometers from Santiago. It had a depth of 54.4 kilometers. However, the United States Geological Survey reported that the aftershock had a depth of 35 kilometers and that it reached a magnitude of 5.9. The Interior Minister, Rodrigo Hinzpeter, informed Radio Cooperativa there were no reports of casualties or damage caused by the aftershock. ONEMI reported on their website that the aftershock reached magnitudes of up to VI in the Mercalli scale , ranging from I to XII, in some towns in the B\u00edo B\u00edo Region . The aftershock provoked panic in the area. ONEMI specified that the intensities of the aftershock were: VI in Lota ; V in Concepci\u00f3n, Parral and Angol ; IV in Temuco , Lonquimay and Puerto Saavedra; and III in Linares , Retiro, Constituci\u00f3n, Valdivia and Panguipulli . At 06:14 (10:14 UTC), SHOA (Chilean Army Hydrographic and Oceanographic Service) ruled out the possibility of a tsunami in the affected area from Pichilemu, O'Higgins Region , until the Los R\u00edos Region .", "after_revision": "A 6.2-magnitude aftershock struck a large part of central and southern Chile on Friday morning, but it caused no casualties or major damage, reported. The aftershock took place at 06:03 local time ( 1003 ), and according to the , the epicentre was located 26 kilometers to the south of , 65 kilometers to the south of , and almost 580 kilometers from Santiago. It had a depth of 54.4 kilometers. However, the reported that the aftershock had a depth of 35 kilometers and that it reached a magnitude of 5.9. The Interior Minister, Rodrigo Hinzpeter, informed there were no reports of casualties or damage caused by the aftershock. reported on their website that the aftershock reached magnitudes of up to VI in the , ranging from I to XII, in some towns in the . The aftershock provoked panic in the area. ONEMI specified that the intensities of the aftershock were: VI in ; V in Concepci\u00f3n, and ; IV in , Lonquimay and Puerto Saavedra; and III in , Retiro, , and . At 06:14 (10:14 UTC), SHOA (Chilean Army Hydrographic and Oceanographic Service) ruled out the possibility of a tsunami in the affected area from , , until the .", "edit_actions": [{"type": "D", "before": "ONEMI", "after": null, "start_char_pos": 141, "end_char_pos": 146}, {"type": "R", "before": "10:03 UTC", "after": "1003", "start_char_pos": 205, "end_char_pos": 214}, {"type": "D", "before": "University of Chile Geological Survey", "after": null, "start_char_pos": 239, "end_char_pos": 276}, {"type": "D", "before": "Arauco", "after": null, "start_char_pos": 335, "end_char_pos": 341}, {"type": "D", "before": "Concepci\u00f3n", "after": null, "start_char_pos": 374, "end_char_pos": 384}, {"type": "D", "before": "United States Geological Survey", "after": null, "start_char_pos": 476, "end_char_pos": 507}, {"type": "D", "before": "Radio Cooperativa", "after": null, "start_char_pos": 657, "end_char_pos": 674}, {"type": "D", "before": "ONEMI", "after": null, "start_char_pos": 747, "end_char_pos": 752}, {"type": "D", "before": "Mercalli scale", "after": null, "start_char_pos": 837, "end_char_pos": 851}, {"type": "D", "before": "B\u00edo B\u00edo Region", "after": null, "start_char_pos": 898, "end_char_pos": 912}, {"type": "D", "before": "Lota", "after": null, "start_char_pos": 1025, "end_char_pos": 1029}, {"type": "R", "before": "Parral and Angol", "after": "and", "start_char_pos": 1049, "end_char_pos": 1065}, {"type": "D", "before": "Temuco", "after": null, "start_char_pos": 1074, "end_char_pos": 1080}, {"type": "D", "before": "Linares", "after": null, "start_char_pos": 1125, "end_char_pos": 1132}, {"type": "R", "before": "Constituci\u00f3n, Valdivia and Panguipulli", "after": ", and", "start_char_pos": 1143, "end_char_pos": 1181}, {"type": "D", "before": "Pichilemu, O'Higgins Region", "after": null, "start_char_pos": 1330, "end_char_pos": 1357}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1360, "end_char_pos": 1360}, {"type": "D", "before": "Los R\u00edos Region", "after": null, "start_char_pos": 1371, "end_char_pos": 1386}], "sents_char_pos": [0, 156, 427, 462, 605, 746, 914, 957, 1031, 1067, 1113, 1183]} {"doc_id": "17705", "revision_depth": "2", "before_revision": "Seoul National University\u2019s Hwang Woo-Suk has reported his findings in the Journal Nature after being involved in producing the first cloned dog . The dog, named Snuppy , was born on April 24th. He is an Afghan hound . The issue presents a whole host of ethical questions for researchers in the stem cell field. Companies like Amgen are interested in the technology, as is accounted in Fortune Magazine for making human-safe pharmaceuticals. The business sector relies on technology improvements to make life saving realities. The Los Angeles Times has reported that Snuppy came from the DNA of the tissue of the ear of the original canine. According to ABC News Associated Press reporter JI-SOO KIM, Korea has declared that we are still a long way from creating clones of monkeys , which have a great deal more human-like traits. Slashdot actually reported an RSS feed yesterday at 4:15 p.m. regarding the BBC and Reuters News articles which told of the two successful terms of gestation for Snuppy. \"the South Korean team only obtained three pregnancies from more than 1,000 embryo transfers into 123 recipients.\" (BBC).", "after_revision": " National University\u2019s has reported his findings in the Journal after being involved in producing the first cloned . The dog, named , was born on April 24. He is an . The issue presents a whole host of ethical questions for researchers in the field. Companies like are interested in the technology, as is accounted in for making human-safe pharmaceuticals. The business sector relies on technology improvements to make life saving realities. The has reported that Snuppy came from the of the tissue of the ear of the original canine. According to Associated Press reporter JI-SOO KIM, Korea has declared that we are still a long way from creating of , which have a great deal more human-like traits. actually reported an yesterday at 4:15 p.m. regarding the BBC and articles which told of the two successful terms of for Snuppy. \"the team only obtained three pregnancies from more than 1,000 transfers into 123 recipients.\" (BBC).", "edit_actions": [{"type": "D", "before": "Seoul", "after": null, "start_char_pos": 0, "end_char_pos": 5}, {"type": "D", "before": "Hwang Woo-Suk", "after": null, "start_char_pos": 28, "end_char_pos": 41}, {"type": "D", "before": "Nature", "after": null, "start_char_pos": 83, "end_char_pos": 89}, {"type": "D", "before": "dog", "after": null, "start_char_pos": 141, "end_char_pos": 144}, {"type": "D", "before": "Snuppy", "after": null, "start_char_pos": 162, "end_char_pos": 168}, {"type": "R", "before": "24th.", "after": "24.", "start_char_pos": 189, "end_char_pos": 194}, {"type": "D", "before": "Afghan hound", "after": null, "start_char_pos": 204, "end_char_pos": 216}, {"type": "D", "before": "stem cell", "after": null, "start_char_pos": 295, "end_char_pos": 304}, {"type": "D", "before": "Amgen", "after": null, "start_char_pos": 327, "end_char_pos": 332}, {"type": "D", "before": "Fortune Magazine", "after": null, "start_char_pos": 386, "end_char_pos": 402}, {"type": "D", "before": "Los Angeles Times", "after": null, "start_char_pos": 531, "end_char_pos": 548}, {"type": "D", "before": "DNA", "after": null, "start_char_pos": 588, "end_char_pos": 591}, {"type": "D", "before": "ABC News", "after": null, "start_char_pos": 654, "end_char_pos": 662}, {"type": "R", "before": "clones of monkeys", "after": "of", "start_char_pos": 763, "end_char_pos": 780}, {"type": "D", "before": "Slashdot", "after": null, "start_char_pos": 831, "end_char_pos": 839}, {"type": "D", "before": "RSS feed", "after": null, "start_char_pos": 861, "end_char_pos": 869}, {"type": "D", "before": "Reuters News", "after": null, "start_char_pos": 915, "end_char_pos": 927}, {"type": "D", "before": "gestation", "after": null, "start_char_pos": 979, "end_char_pos": 988}, {"type": "D", "before": "South Korean", "after": null, "start_char_pos": 1006, "end_char_pos": 1018}, {"type": "D", "before": "embryo", "after": null, "start_char_pos": 1077, "end_char_pos": 1083}], "sents_char_pos": [0, 146, 194, 218, 311, 441, 526, 640, 830, 1000]} {"doc_id": "180311", "revision_depth": "1", "before_revision": "A colour-coded map of the constituencies contested. Please click the image to expand. This table shows the results for 649 of 650 constituencies in the 2010 general election in the United Kingdom (not including the delayed constituency of Thirsk and Malton , which will hold its election on 27 May). The \"Constituency\" column shows the name of each constituency, linked to the relevant Wikipedia article. the \"Result\" column shows the winning party, and whether they held or gained the seat (and, if relevant, who they gained it from). The \"Votes\" column shows how many votes were received by the winning party, the \"Share\" column their share of the vote, and the \"Swing\" column the swing in the direction of the gaining party. In the general election, people over the age of eighteen around the United Kingdom may choose to vote for a candidate at their local polling booth, and Members of Parliament are elected to each constituency based on the first past the post system. Whichever party has a majority of MPs after all constituencies have announced their results has the opportunity to form a government. The incumbent party before the dissolution of parliament was Gordon Brown's Labour Party , exit polls suggested a small Conservative Party majority, which\u2014when this swing is projected nationally\u2014would cause a hung parliament . The exit polls also suggested that despite reports that support for the Liberal Democrats had surged following the first national televised leaders' debates in the United Kingdom, the Liberal Democrats would suffer from a third party squeeze. On the morning of Friday 7, 2010 the accuracy of the exit polls was demonstrated when it was revealed that there was indeed a hung Parliament and that although the Conservative Party had the greatest number of seats and votes it would be impossible for them to achieve an outright majority. The constitution of the United Kingdom allows for the incumbent Labour Party to first attempt to form a government and incumbent Prime Minister, Gordon Brown announced that he would allow civil servants from the Cabinet Office to help facilitate negotiations. Despite the Labour Party openly courting the Liberal Party, their leader Nick Clegg has stated that as the party with the most seats and most votes the Conservatives have the right to attempt to form a government. Some seats were also be contested by one or more of a number of smaller parties and independents, including the United Kingdom Independence Party, the British National Party , and the Green Party of England and Wales , who all already hold seats in the European Parliament and local government authorities, all hoped to gain their first seats in the House of Commons in this election. History was made when the Greens won their first Parliamentery with their leader Caroline Lucas winning Brighton Pavilion . In Northern Ireland the Alliance Party also won their first seat with Naomi Long taking Peter Robinson 's seat. Overall standings PartySeatsNet gainVotesShare Conservative Party 305 +97 10,681,417 36.1\\% Labour Party 258 -91 8,601,441 29.1\\% Liberal Democrats 57 -5 6,805,665 23.0\\% Democratic Unionist Party 8 -1 168,216 0.6\\% Scottish National Party 6 0 491,386 1.7\\% Sinn F\u00e9in 5 0 171,942 0.6\\% Plaid Cymru 3 +1 165,394 0.6\\% Social Democratic Labour Party 3 0 110,970 0.4\\% Alliance Party 1 +1 42,762 0.1\\% Green Party of England and Wales 1 +1 284,566 1.0\\% Table Colour Party Red Labour Blue Conservative Yellow Liberal Democrats Yellow (Northern Ireland) Alliance Bright Yellow Scottish National Green (England) Green Light Green (Wales) Plaid Cymru Light Green (N. Ireland) Social Democratic and Labour Dark Green Sinn F\u00e9in Brown Democratic Unionist Purple Conservatives and Unionists Grey Independent Black Poll delayed White Undeclared ConstituencyResultVotesShareSwingAberavon Labour hold 16,073 51.9\\% 5.3\\% (to LD) Aberconwy Conservative gain from Lab 10,734 35.8\\% 7.6\\% Aberdeen North Labour hold 16,746 44.4\\% 1.0\\% Aberdeen South Labour hold 15,722 36.5\\% 2.5\\% Aberdeenshire West and Kincardie Liberal Democrat hold 17,362 38.4\\% 4.9\\% (to CON) Airdrie and ShottsLabour hold20,64958.2\\% 3.9\\% (to SNP) Aldershot Conservative hold 21,203 46.7\\% 1.4\\% (to LD) Aldridge-Brownhills Conservative hold 22,913 59.3\\% 12.0\\% (from LAB) Altrincham and Sale West Conservative hold 24,176 48.9\\% 0.8\\% (to LD) Alyn and Deeside Labour hold 15,804 39.6\\% 8.1\\% (to CON) Amber Valley Conservative gain from Lab 17,746 38.6\\% 6.9\\% Angus SNP hold 15,020 39.6\\% 2.2\\% Antrim EastDemocratic Unionist hold13,99345.9\\% Antrim NorthDemocratic Unionist hold19,67246.4\\% Antrim South Democratic Unionist hold 11,536 33.9\\% 3.6\\% (to UCU) Arfon Plaid Cymru gain from Lab9,38336.0\\%3.7\\%Argyle and Bute Liberal Democrat hold14,29231.6\\%2.7\\% (to CON) Arundel and South Downs Conservative hold32,33357.8\\%3.0\\% Ashfield Labour hold16,23933.7\\%17.2\\% (to LD) Ashford Conservative hold29,87854.1\\%2.3\\% (to LD) Ashton Under Lyne Labour hold18,60448.4\\%7.3\\% (to CON) Aylesbury Conservative hold27,73652.2\\% Ayr, Carrick and Cumnock Labour hold21,63247.1\\%0.3\\% (to CON) Ayrshire Central Labour hold20,95047.7\\%1.5\\% Ayrshire North and Arran Labour hold21,86047.4\\%2.3\\% (to SNP) BanburyConservative hold29,703 52.8\\%5.9\\% (to CON) Banff and BuchanSNP hold15,86841.3\\%10.7\\% (to CON) BarkingLabour hold24,62854.3\\%1.7\\%Barnsley CentralLabour hold17,48747.3\\%4.2\\% (to LD)Barnsley EasyLabour hold18,05947.0\\%14.0\\% (to LD)Barrow and FurnessLabour hold21,22648.1\\%0.4\\% (to CON)Basildon and BillericayConservative hold21,98252.8\\%9.3\\%Basildon South and Thurrock EastConservative gain from Lab19,62443.9\\%7.5\\%BasingstokeConservative hold25,59050.5\\%4.6\\%BassrtlawLabour hold25,01850.5\\%0.7\\% (to CON)BathLiberal Democrat hold26,65156.6\\%5.8\\%Batley and Spen Labour hold 21,565 41.5\\% 2.5\\% (to CON)Battersea Conservative gain from Lab 23,103 47.3\\% 6.5\\%BeaconsfieldConservative hold32,05361.1\\%4.7\\%BeckanhamConservative hold27,59757.9\\%3.2\\% (to LD)BedfordConservative gain from Lab17,54638.9\\%5.5\\%Bedforsdhire MidConservative hold28,81552.5\\%2.3\\%Bedfordshire North EastConservative hold30,98955.8\\%2.6\\%Bedfordshire South WestConservative hold26,81552.8\\%0.7\\%Belfast EastAlliance gain from DUP12,83937.2\\%22.9\\%Belfast NorthDemocratic Unionist hold14,81240.0\\%5.0\\% (to SF)Belfast SouthSDLP hold14,02641.0\\%8.4\\%Belfast WestSinn F\u00e9in hold22,84071.1\\%1.1\\%Bermondsey and Old SouthwarkLiberal Democrat hold21,59048.4\\%1.6\\%Berwick-Upon-TweedLiberal Democrat hold16,80643.7\\%8.3\\% (to CON)Banff and BuchanLiberal Democrat hold22,23045.4\\%0.7\\% (to CON)Bethnal Green and BowBanff and BuchanConservative hold22,23045.4\\%1.6\\%Bexhill and BattleConservative hold28,14751.6\\%4.0\\% (to LD)Bexleyheath and CrayfordBirkenhead)Birmingham Edgbaston Labour hold 16,894 40.6\\% 0.5\\% (to CON)Birmingham ErdingtonBirmingham Hall GreenBirmingham Hodge HillBirmingham LadywoodLabour hold19,95055.7\\%2.5\\%Birmingham NorthfieldBirmingham Perry BarrBirmingham Selly Oak Labour hold 17,950 38.5\\% 4.8\\% (to CON)Birmingham YardleyBishop Auckland Labour hold 16,023 39.0\\% 7.2\\% (to CON)BlackburnLabour hold21,75147.8\\%1.1\\%Blackley and BroughtonBlackpool North and CleveleysConservative gain from Lab16,96441.8\\%6.9\\%Blackpool SouthLabour hold14,44941.16.2\\% (to CON)Blaenau GwentLabour gain from Ind 16,974 52.4\\% 29.2\\%Blaydon Labour hold 22,297 49.7\\% 3.3\\%Blyth ValleyBognor Regis and LittlehamptonConservative hold24,08751.4\\%2.3\\%BolsoverLabour hold21,99450.0\\%11.2\\% (to CON)Bolton North EastLabour hold19,87045.9\\%1.3\\% (to CON)Bolton South EastLabour hold18,78247.4\\%5.6\\% (to CON)Bolton West Labour hold 18,327 38.5\\% 4.9\\% (to CON)BootleBoston and SkegnessConservative hold18,78247.4\\%7.0\\%BosworthConservative hold23,13242.6\\%5.9\\% (to LD)Bournemouth EastConservative hold21,32048.4\\%1.8\\%Bournemouth West Conservative hold 18,808 45.1\\% 2.9\\%Bracknell Conservative hold 27,327 52.4\\% 1.0\\% (to LD)Bradford EastBradford SouthBradford WestBraintree Conservative hold 25,901 52.6\\% 6.7\\%Brecon and RadnorshireLiberal Democrat hold17,92946.2\\%0.3\\% (to CON)Brent CentralBrent NorthBrentford and IsleworthBrentwood and OngarConservative hold28,79256.9\\%3.1\\%BridgendLabour hold13,93136.3\\%6.0\\% (to CON)Bridgwater and Somerset West Conservative hold 24,675 45.3\\% 2.9\\% (to LD)Brigg and GooleConservative gain from Lab19,68044.9\\%9.8\\%Brighton KemptownBrighton Pavilion Green gain from Lab 16,238 31.3\\% 8.4\\%Bristol EastLabour hold16,47136.6\\%4.5\\% (to CON)Bristol North WestBristol SouthBristol WestLiberal Democrat hold26,59348.0\\%9.0\\%BroadlandBromley and ChislehurstBromsgroveBroxbourneConservative hold26,84458.8\\%6.4\\%BroxtoweConservative gain from Lab20,58539.0\\%2.6\\%BuckinghamBurnleyLiberal Democrat gain from Lab14,93235.7\\%9.6\\%BurtonConservative gain from Lab22,18844.5\\%8.7\\%Bury NorthBury SouthBury St EdmundsConservative hold27,89947.5\\%2.8\\%CaerphillyLabour hold17,37744.9\\%6.5\\% (to CON)Caithness, Sutherland and Easter RossLiberal Democrat hold11,90741.4\\%6.4\\% (to LAB)Calder ValleyCamberwell and PeckhamCambourne and Redruth Conservative gain from Lib37.6\\%15,9695.2\\%Cambridge Liberal Democrat hold 19,621 39.1\\% 7.0\\% (to CON)Cambridgeshire North EastConservative hold26,86251.4\\%0.8\\%Cambridgeshire North WestConservative hold29,42550.05\\%2.6\\%Cambridgeshire SouthConservative hold27,99547.4\\%2.5\\% (to LD)Cambridgeshire South EastConservative hold27,62948.0\\%2.7\\% (to LD)Cannock ChaseConservative gain from Lab18,27140.1\\%14.0\\%Canterbury Conservative hold22,05044.8\\%5.4\\% (to LD)Cardiff CentralCardiff NorthCardiff South and Penarth Labour hold 17,262 38.9\\% 6.0\\% (to CON)Cardiff West Labour hold 16,893 41.2\\% 5.3\\% (to CON)Carlisle Carmarthen East and Dinefwr Plaid Cymru hold 13,546 35.6\\% 4.2\\% (to LAB)Carmarthen West and Pembrokeshire South Conservative gain from Lab 16,649 41.1\\% 6.9\\%Carshalton and WallingtonCastle PointCeredigionCharnwoodChatham and AylesfordCheadleChelmsfordChelsea and FulhamCheltenhamChelsham and AmershamChester, City ofChesterfieldChichesterChingford and Woodford GreenChippenhamChipping BarnetChorleyChristchurchCities of London and WestminsterClactonCleethorpesConservative gain from Lab18,93942.1\\%7.8\\%Clwyd South Labour hold13,31138.4\\%5.8\\% (to CON)Clwyd West Conservative hold 15,833 41.5\\% 8.4\\%Coatbridge, Chryson and BellshillColchesterColne ValleyCongleton Conservative hold 23,250 45.8\\% 2.3\\% (to LD)Copeland Labour hold 19,699 46.0\\% 2.1\\% (to CON)Corby Conservative gain from Lab 22,886 42.2\\% 3.4\\%Cornwall North Liberal Democrat hold22,51248.1\\%0.3\\% (to CON)Cornwall South East Conservative gain from Lib22,39045.1\\%9.1\\%The Cotswolds Conservative hold 29,075 53.0\\% 1.1\\%Coventry North East Labour hold 21,384 49.3\\% 5.5\\% (to CON)Coventry North West Labour hold 19,936 42.8\\% 3.9\\% (to CON)Coventry South Labour hold 19,197 41.8\\% 3.4\\% (to CON)Crawley Conservative gain from Lab 21,264 44.8\\% 6.3\\%Crewe and Nantwich Conservative gain from Lab 23,420 45.8\\% 13.7\\%Croydon Central Conservative gain from Lab | 19,657 | 39.5\\% | 3.3\\% |- |Croydon North | width=5px; style=\"background:red\"| | Labour hold | 28,949 | 56.0\\% | 0.3\\% |- |Croydon South | width=5px; style=\"background:blue\"| | Conservative hold | 28,684 | 50.9\\% | 1.7\\% (to LD) |- |Cumbernauld, Kilsyth and Kirkintilloch East | width=5px; style=\"background:red\"| | Labour hold | 23,549 | 57.2\\% | 1.9\\% |- |Cynon Valley | width=5px; style=\"background:red\"| | Labour hold | 15,681 | 52.5\\% | 8.6\\% (to PC) |- |Dagenham and Rainham | width=5px; style=\"background:red\"| |Labour hold |17,813 |40.3\\% |4.9\\% (to CON) |- |Darlington | width=5px; style=\"background:red\"| | Labour hold |16,891 |39.4\\% |9.1\\% (to CON) |- |Dartford | width=5px; style=\"background:blue\"| |Conservative gain from Lab |24,428 |48.8\\% |11.6\\% |- |Daventry | width=5px; style=\"background:blue\"| | Conservative hold | 29,252 | 56.5\\% | 0.7\\% (to LD) |- |Delyn | width=5px; style=\"background:red\"| | Labour hold | 15,083 | 40.8\\% | 6.7\\% (to CON) |- |Denton and Reddish | width=5px; style=\"background:red\"| |Labour hold |19,191 |51.0\\% |6.2\\% (to CON) |- |Derby North | width=5px; style=\"background:red\"| | Labour hold | 14,896 | 33.0\\% | 7.4\\% (to CON) |- |Derby South | width=5px; style=\"background:red\"| |Labour hold |17,851 |43.3\\% |9.3\\% (to CON) |- |Derbyshire Dales | width=5px; style=\"background:blue\"| | Conservative hold | 24,378 | 52.1\\% | 3.7\\% |- |Derbyshire Mid | width=5px; style=\"background:blue\"| |Conservative hold |22,877 |48.3\\% |5.7\\% |- |Derbyshire North East | width=5px; style=\"background:red\"| |Labour hold |17,948 |38.2\\% |8.6\\% (to CON) |- |Derbyshire South | width=5px; style=\"background:blue\"| |Conservative gain from Lab |22,935 |45.5\\% |9.8\\% |- |Devizes | width=5px; style=\"background:\"| | | | | |- |Devon Central | width=5px; style=\"background:blue\"| | Conservative hold | 27,737 | 51.5\\% | 6.1\\% |- |Devon East | width=5px; style=\"background:blue\"| | Conservative hold |48.3\\% |25,662 | |- |Devon North | width=5px; style=\"background:#F9D616\"| | Liberal Democrat hold |24,305 |47.4\\% |0.3\\% |- |Devon South West | width=5px; style=\"background:blue\"| | Conservative hold |27,908 |56.0\\% |5.6\\% |- |Devon West and Torridge | width=5px; style=\"background:\"| | | | | |- |Dewsbury | width=5px; style=\"background:\"| | | | | |- |Don Valley | width=5px; style=\"background:\"| | | | | |- |Doncaster Central | width=5px; style=\"background:\"| | | | | |- |Doncaster North | width=5px; style=\"background:\"| | | | | |- |Doset Mid and Poole North | width=5px; style=\"background:\"| | | | | |- |Dorset North | width=5px; style=\"background:\"| | | | | |- |Dorset South | width=5px; style=\"background:blue\"| | Conservative gain from Lab |22,667 |45.1\\% |9.3\\% |- |Dorset West | width=5px; style=\"background:blue\"| | Conservative hold |27,287 |47.6\\% | |- |Dover | width=5px; style=\"background:\"| | | | | |- |Down North | width=5px; style=\"background:grey\"| |Independent gain from UCU |21,181 |63.3\\% | |- |Down South | width=5px; style=\"background:#3c3\" | |SDLP hold |20,648 |48.5\\% | |- |Dudley North | width=5px; style=\"background:\"| | | | | |- |Dudley South | width=5px; style=\"background:\"| | | | | |- |Dulwich and West Norwood | width=5px; style=\"background:\"| | | | | |- |Dumfries and Galloway | width=5px; style=\"background:\"| | | | | |- |Dunfiesshire, Clydesdale and Tweeddale | width=5px; style=\"background:\"| | | | | |- |Dunbartonshire East | width=5px; style=\"background:\"| | | | | |- |Dunbartonshire West | width=5px; style=\"background:\"| | | | | |- |Dundee East | width=5px; style=\"background:\"| | | | | |- |Dundee West | width=5px; style=\"background:\"| | | | | |- |Dunfermine and Fife West | width=5px; style=\"background:\"| | | | | |- |City of Durham | width=5px; style=\"background:red\"| | Labour hold |20,496 |44.3\\% | |- |Durham North | width=5px; style=\"background:red\"| |Labour hold |20,698 |50.5\\% | |- |Durham North West | width=5px; style=\"background:\"| | | | | |- |Dwyfor Meirionnydd | width=5px; style=\"background:\"| | | | | |- |Ealing Central and Acton | width=5px; style=\"background:\"| | | | | |- |Ealing North | width=5px; style=\"background:\"| | | | | |- |Ealing Southall | width=5px; style=\"background:\"| | | | | |- |Easington | width=5px; style=\"background:red\"| |Labour hold |20,579 |58.9\\% | |- |East Ham | width=5px; style=\"background:\"| | | | | |- |East Kilbride, Strathaven and Lesmahagow | width=5px; style=\"background:\"| | | | | |- |East Lothian | width=5px; style=\"background:\"| | | | | |- |Eastbourne | width=5px; style=\"background:\"| | | | | |- |Eastleigh | width=5px; style=\"background:\"| | | | | |- |Eddisbury | width=5px; style=\"background:\"| | | | | |- |Edinburgh East | width=5px; style=\"background:red\"| | Labour hold | 17,305 | 43.4\\% | |- |Edinburgh North and Leith | width=5px; style=\"background:\"| | | | | |- |Edinburgh South | width=5px; style=\"background:\"| | | | | |- |Edinburgh South West | width=5px; style=\"background:red\"| | Labour hold | 19,473 | 42.8\\% | |- |Edinburgh West | width=5px; style=\"background:#F9D616\"| | Liberal Democrat hold | 16,684 | 35.9\\% | -11.4\\% |- |Edmonton | width=5px; style=\"background:\"| | | | | |- |Ellesmere Port and Neston | width=5px; style=\"background:\"| | | | | |- |Elmet and Rothwell | width=5px; style=\"background:\"| | | | | |- |Eltham | width=5px; style=\"background:\"| | | | | |- |Enfield North | width=5px; style=\"background:\"| | | | | |- |Enfield Southgate | width=5px; style=\"background:\"| | | | | |- |Epping Forest | width=5px; style=\"background:\"| | | | | |- |Epsom and Ewell | width=5px; style=\"background:\"| | | | | |- |Erewash | width=5px; style=\"background:\"| | | | | |- |Erith and Thameshead | width=5px; style=\"background:\"| | | | | |- |Esher and Walton | width=5px; style=\"background:\"| | | | | |- |Exeter | width=5px; style=\"background:red\"| | Labour hold |19,942 |38.2\\% | |- |Falkirk | width=5px; style=\"background:red\"| | Labour hold |23,207 |45.7\\% | |- |Fareham | width=5px; style=\"background:blue\"| | Conservative hold |30,037 |55.3\\% | |- |Faversham and Kent Mid | width=5px; style=\"background:\"| | | | | |- |Feltham and Heston | width=5px; style=\"background:\"| | | | | |- |Fermanagh and South Tyrone | width=5px; style=\"background:#060\"| | Sinn F\u00e9in hold |21,304 |45.5\\% | |- |Fife North East | width=5px; style=\"background:\"| | | | | |- |Filton and Bradley Stoke | width=5px; style=\"background:\"| | | | | |- |Finchley and Golders Green | width=5px; style=\"background:\"| | | | | |- |Folkestone and Hythe | width=5px; style=\"background:\"| | | | | |- |Forest of Dean | width=5px; style=\"background:\"| | | | | |- |Foyle | width=5px; style=\"background:#3c3\" | |SDLP hold |16,922 |44.7\\% | |- |Flyde | width=5px; style=\"background:\"| | | | | |- |Gainsborough | width=5px; style=\"background:blue\"| | Conservative hold |24,266 |49.3\\% | |- |Garston and Halewood | width=5px; style=\"background:red\"| | Labour hold |25,493 |59.5\\% | |- |Gateshead | width=5px; style=\"background:\"| | | | | |- |Gedling | width=5px; style=\"background:red\"| | Labour hold |19,821 |41.1\\% | |- |Gillingham and Rainham | width=5px; style=\"background:\"| | | | | |- |Glasgow Central | width=5px; style=\"background:\"| | | | | |- |Glasgow East | width=5px; style=\"background:red\"| | Labour hold |19,797 |61.6\\% | |- |Glasgow North | width=5px; style=\"background:\"| | | | | |- |Glasgow North East | width=5px; style=\"background:red\"| | Labour hold | 20,100 | 68.3\\% | |- |Glasgow North West | width=5px; style=\"background:\"| | | | | |- |Glasgow South | width=5px; style=\"background:\"| | | | | |- |Glasgow South West | width=5px; style=\"background:\"| | | | | |- |Glenrothes | width=5px; style=\"background:\"| | | | | |- |Gloucester | width=5px; style=\"background:\"| | | | | |- |Gordon | width=5px; style=\"background:\"| | | | | |- |Gosport | width=5px; style=\"background:\"| | | | | |- |Gower | width=5px; style=\"background:\"| | | | | |- |Grantham and Stamford | width=5px; style=\"background:\"| | | | | |- |Gravesham | width=5px; style=\"background:blue\"| | Conservative hold | 22,956 | 48.5\\% | 9.1\\% |- |Great Grimsby | width=5px; style=\"background:red\"| |Labour hold |10,777 |32.7\\% |10.5\\% (to CON) |- |Great Yarmouth | width=5px; style=\"background:\"| | | | | |- |Greenwich and Woolwich | width=5px; style=\"background:\"| | | | | |- |Guildford | width=5px; style=\"background:blue\"| |Conservative hold |29,618 |53.3\\% |6.9\\% |- |Hackney North and Stoke Newington | width=5px; style=\"background:\"| | | | | |- |Hackney South and Shoreditch | width=5px; style=\"background:\"| | | | | |- |Halesowen and Rowley Regis | width=5px; style=\"background:\"| | | | | |- |Halifax | width=5px; style=\"background:\"| | | | | |- |Haltemprice and Howden | width=5px; style=\"background:blue\"| | Conservative hold | 24,486 | 50.2\\% | 6.6\\% |- |Halton | width=5px; style=\"background:\"| | | | | |- |Hammersmith | width=5px; style=\"background:red\"| | Labour hold | 20,810 | 43.9\\% | 0.5\\% (to CON) |- |Hampshire East | width=5px; style=\"background:\"| | | | | |- |Hampshire North East | width=5px; style=\"background:\"| | | | | |- |Hampshire North West | width=5px; style=\"background:\"| | | | | |- |Hampstead and Kilburn | width=5px; style=\"background:\"| | | | | |- |Harborough | width=5px; style=\"background:\"| | | | | |- |Harlow | width=5px; style=\"background:\"| | | | | |- |Harrogate and Knaresborough | width=5px; style=\"background:\"| | | | | |- |Harrow East | width=5px; style=\"background:blue\"| | Conservative gain from Lab | 21,435 | 44.7\\% | 7.0\\% (to CON) |- |Harrow West | width=5px; style=\"background:red\"| | Labour hold | 20,111 | 43.6\\% | 5.7\\% (to CON) |- |Hartlepool | width=5px; style=\"background:\"| | | | | |- |Harwich and Essex North | width=5px; style=\"background:\"| | | | | |- |Hastings and Rye | width=5px; style=\"background:\"| | | | | |- |Havant | width=5px; style=\"background:\"| | | | | |- |Hayes and Harlington | width=5px; style=\"background:\"| | | | | |- |Hazel Grove | width=5px; style=\"background:\"| | | | | |- |Hemel Hempstead | width=5px; style=\"background:\"| | | | | |- |Hemsworth | width=5px; style=\"background:\"| | | | | |- |Hendon | width=5px; style=\"background:\"| | | | | |- |Henley | width=5px; style=\"background:\"| | | | | |- |Hereford and Herefordshire South | width=5px; style=\"background:blue\"| |Conservative gain from Lib |22,366 |46.2\\% |3.8\\% |- |Herefordshire North | width=5px; style=\"background:blue\"| | Conservative hold | 24,631 | 51.8\\% | 3.8\\% (to LD) |- |Hertford and Stortford | width=5px; style=\"background:blue\"| | Conservative hold | 29,810 | 53.8\\% | |- |Hertfordshire North East | width=5px; style=\"background:blue\"| | Conservative hold | 26,995 | 53.5\\% | 1.9\\% (to LD) |- |Hertfordshire South West | width=5px; style=\"background:\"| | | | | |- |Hertsmere | width=5px; style=\"background:blue\"| | Conservative hold | 26,476 | 56.0\\% | 5.6\\% |- |Hexham | width=5px; style=\"background:\"| | | | | |- |Heywood and Middleton | width=5px; style=\"background:\"| | | | | |- |High Peak | width=5px; style=\"background:\"| | | | | |- |Hitchin and Harpenden | width=5px; style=\"background:\"| | | | | |- |Holborn and St Pancras | width=5px; style=\"background:\"| | | | | |- |Hornchurch and Upminster | width=5px; style=\"background:\"| | | | | |- |Hornsey and Wood Green | width=5px; style=\"background:\"| | | | | |- |Horsham | width=5px; style=\"background:\"| | | | | |- |Houghton and Sunderland South | width=5px; style=\"background:red\"| | Labour hold | 19,137 | 50.3\\% | 8.4\\% (to CON) |- |Hove | width=5px; style=\"background:\"| | | | | |- |Huddersfield | width=5px; style=\"background:red\"| | Labour hold | 15,725 | 38.8\\% | 7.1\\% (to CON) |- |Hull East | width=5px; style=\"background:\"| | | | | |- |Hull North | width=5px; style=\"background:red\"| | Labour hold | 13,044 | 39.2\\% | 12.2\\% (to LD) |- |Hull West and Hessle | width=5px; style=\"background:\"| | | | | |- |Huntingdon | width=5px; style=\"background:\"| | | | | |- |Hyndburn | width=5px; style=\"background:\"| | | | | |- |Ilford North | width=5px; style=\"background:\"| | | | | |- |Ilford South | width=5px; style=\"background:\"| | | | | |- |Inverclyde | width=5px; style=\"background:\"| | | | | |- |Inverness, Nairn, Badenoch and Strathspey | width=5px; style=\"background:\"| | | | | |- |Ipswich | width=5px; style=\"background:\"| | | | | |- |Isle of Wight | width=5px; style=\"background:\"| | | | | |- |Islington North | width=5px; style=\"background:red\"| | Labour hold | 24,276 | 54.5\\% | |- |Islington South and Finsbury | width=5px; style=\"background:red\"| | Labour hold | 18,407 | 42.3\\% | 3.3\\% |- |Islwyn | width=5px; style=\"background:\"| | | | | |- |Jarrow | width=5px; style=\"background:red\" | | Labour hold | 20,910 | 53.9\\% | 6.4\\% |- |Keighley | width=5px; style=\"background:\"| | | | | |- |Kenilworth and Southam | width=5px; style=\"background:\"| | | | | |- |Kensington | width=5px; style=\"background:blue\"| | Conservative hold | 17,595 | 50.1\\% | 5.2\\% |- |Kettering | width=5px; style=\"background:\"| | | | | |- |Kilmarnock and Loudoun | width=5px; style=\"background:\"| | | | | |- |Kingston and Surbiton | width=5px; style=\"background:\"| | | | | |- |Kingswood | width=5px; style=\"background:\"| | | | | |- |Kilcaldy and Cowdenbeath | width=5px; style=\"background:\"| | | | | |- |Knowsley | width=5px; style=\"background:\"| | | | | |- |Lagan Valley | width=5px; style=\"background:#c30\"| |Democratic Unionist hold |18,199 |49.8\\% | |- |Lanark and Hamilton East | width=5px; style=\"background:\"| | | | | |- |Lancashire West | width=5px; style=\"background:\"| | | | | |- |Lancaster and Fleetwood | width=5px; style=\"background:\"| | | | | |- |Leeds Central | width=5px; style=\"background:red\"| | Labour hold | 18,434 | 49.3\\% | |- |Leeds East | width=5px; style=\"background:\"| | | | | |- |Leeds North East | width=5px; style=\"background:red\"| | Labour hold | 20,287 | 42.7\\% | |- |Leeds North West | width=5px; style=\"background:\"| | | | | |- |Leeds West | width=5px; style=\"background:red\"| | Labour hold | 16,389 | 42.3\\% | |- |Leicester East | width=5px; style=\"background:\"| | | | | |- |Leicester South | width=5px; style=\"background:blue\"| | Conservative hold | 27,000 | 49.5\\% | |- |Leicester West | width=5px; style=\"background:\"| | | | | |- |Leicestershire North West | width=5px; style=\"background:\"| | | | | |- |Leicestershire South | width=5px; style=\"background:\"| | | | | |- |Leigh | width=5px; style=\"background:red\"| | Labour hold | 24,295 | 51.3\\% | |- |Lewes | width=5px; style=\"background:\"| | | | | |- |Lewisham Deptford | width=5px; style=\"background:\"| | | | | |- |Lewisham East | width=5px; style=\"background:\"| | | | | |- |Lewisham West and Penge | width=5px; style=\"background:\"| | | | | |- |Leyton and Wanstead | width=5px; style=\"background:\"| | | | | |- |Lichfield | width=5px; style=\"background:\"| | | | | |- |Lincoln | width=5px; style=\"background:\"| | | | | |- |Linlithgow and Falkirk East | width=5px; style=\"background:\"| | | | | |- |Liverpool Riverside | width=5px; style=\"background:red\"| | Labour hold | 22,998 | 59.3\\% | |- |Liverpool Walton | width=5px; style=\"background:\"| | | | | |- |Liverpool Wavertree | width=5px; style=\"background:\"| | | | | |- |Liverpool West Derby | width=5px; style=\"background:\"| | | | | |- |Livingston | width=5px; style=\"background:\"| | | | | |- |Llanelli | width=5px; style=\"background:red\"| | Labour hold | 15,916 | 42.5\\% | 4.0\\% (to PC) |- |Londonderry East | width=5px; style=\"background:\"| | | | | |- |Loughborough | width=5px; style=\"background:\"| | | | | |- |Louth and Horncastle | width=5px; style=\"background:blue\"| | Conservative hold | 25,065 | 49.6\\% | |- |Ludlow | width=5px; style=\"background:\"| | | | | |- |Luton North | width=5px; style=\"background:red\"| |Labour hold |21,192 |49.3\\% |0.5\\% |- |Luton South | width=5px; style=\"background:red\"| | Labour hold | 14,725 | 34.9\\% | 4.6\\% (to CON) |- |Macclesfield | width=5px; style=\"background:\" | | | | | |- |Maidenhead | width=5px; style=\"background:blue\" | |Conservative hold |31,937 |59.5\\% |7.8\\% |- |Maidstone and the Weald | width=5px; style=\"background:blue\" | | Conservative hold | 23,491 | 48.0\\% | |- |Makerfield | width=5px; style=\"background:\" | | | | | |- |Maldon | width=5px; style=\"background:\" | | | | | |- |Manchester Central | width=5px; style=\"background:\" | | | | | |- |Manchester Gorton | width=5px; style=\"background:\" | | | | | |- |Manchester Withington | width=5px; style=\"background:\" | | | | | |- |Mansfield | width=5px; style=\"background:\" | | | | | |- |Meon Valley | width=5px; style=\"background:\" | | | | | |- |Meriden | width=5px; style=\"background:\" | | | | | |- |Merthyr Tydfil and Rhymney | width=5px; style=\"background:\" | | | | | |- |Middlesbrough | width=5px; style=\"background:\" | | | | | |- |Middlesbrough South and Cleveland East | width=5px; style=\"background:red\" | | Labour hold | 18,138 | 39.2\\% | |- |Midlothian | width=5px; style=\"background:\" | | | | | |- |Milton Keynes North | width=5px; style=\"background:\" | | | | | |- |Milton Keynes South | width=5px; style=\"background:\" | | | | | |- |Mitcham and Morden | width=5px; style=\"background:red\" | | Labour hold | 24,722 | 56.4\\% | |- |Mole Valley | width=5px; style=\"background:blue\" | | Conservative hold | 31,263 | 57.5\\% | 2.3\\% |- |Monmouth | width=5px; style=\"background:\" | | | | | |- |Montgomeryshire | width=5px; style=\"background:\" | | | | | |- |Moray | width=5px; style=\"background:\" | | | | | |- |Morecambe and Lunesdale | width=5px; style=\"background:\" | | | | | |- |Morley and Outwood | width=5px; style=\"background:\" | | | | | |- |Motherwell and Wishaw | width=5px; style=\"background:\" | | | | | |- |Na H-Eileanan An Iar | width=5px; style=\"background:#ff0\" | | SNP hold |6,723 |45.75\\% | |- |Neath | width=5px; style=\"background:\" | | | | | |- |New Forest East | width=5px; style=\"background:\" | | | | | |- |New Forest West | width=5px; style=\"background:\" | | | | | |- |Newark | width=5px; style=\"background:\" | | | | | |- |Newbury | width=5px; style=\"background:\" | | | | | |- |Newcastle-Under-Lyme | width=5px; style=\"background:\" | | | | | |- |Newcastle upon Tyne Central | width=5px; style=\"background:red\"| | Labour hold | 15,692 | 45.9\\% | 0.6\\% (to LD) |- |Newcastle upon Tyne East | width=5px; style=\"background:red\"| | Labour hold | 17,043 | 45.0 | 4.6\\% (to LD) |- |Newcastle upon Tyne North | width=5px; style=\"background:red\"| | Labour hold | 17,950 | 40.8 | 4.5\\% (to LD) |- |Newport East | width=5px; style=\"background:\" | | | | | |- |Newport West | width=5px; style=\"background:\" | | | | | |- |Newry and Armagh | width=5px; style=\"background:\" | | | | | |- |Newton Abbot | width=5px; style=\"background:blue\" | | Conservative gain from Lib |20,774 |43.0\\% |5.8\\% |- |Norfolk Mid | width=5px; style=\"background:\" | | | | | |- |Norfolk North | width=5px; style=\"background:\" | | | | | |- |Norfolk North West | width=5px; style=\"background:\" | | | | | |- |Norfolk South | width=5px; style=\"background:\" | | | | | |- |Norfolk South West | width=5px; style=\"background:\" | | | | | |- |Normanton, Pontefract and Castleford | width=5px; style=\"background:\" | | | | | |- |Northampton North | width=5px; style=\"background:\" | | | | | |- |Northampton South | width=5px; style=\"background:\" | | | | | |- |Northamptonshire South | width=5px; style=\"background:blue\" | | Conservative hold | 33,081 | 55.2\\% | |- |Norwich North | width=5px; style=\"background:\" | | | | | |- |Norwich South | width=5px; style=\"background:\" | | | | | |- |Nottingham East | width=5px; style=\"background:\" | | | | | |- |Nottingham North | width=5px; style=\"background:\" | | | | | |- |Nottingham South | width=5px; style=\"background:\" | | | | | |- |Nuneaton | width=5px; style=\"background:\" | | | | | |- |Ochil and Perthshire South | width=5px; style=\"background:red\" | | Labour hold | 19,131 | 37.9\\% | |- |Ogmore | width=5px; style=\"background:\" | | | | | |- |Old Bexley and Sidcup | width=5px; style=\"background:\" | | | | | |- |Oldham East and Saddleworth | width=5px; style=\"background:\" | | | | | |- |Oldham West and Royton | width=5px; style=\"background:\" | | | | | |- |Orkney and Shetland | width=5px; style=\"background:\" | | | | | |- |Orpington | width=5px; style=\"background:\" | | | | | |- |Oxford East | width=5px; style=\"background:\" | | | | | |- |Oxford West and Abingdon | width=5px; style=\"background:\" | | | | | |- |Paisley and Renfrewshire North | width=5px; style=\"background:\" | | | | | |- |Paisley and Renfrewshire South | width=5px; style=\"background:\" | | | | | |- |Pendle | width=5px; style=\"background:\" | | | | | |- |Penistone and Stocksbridge | width=5px; style=\"background:\" | | | | | |- |Penrith and the Border | width=5px; style=\"background:\" | | | | | |- |Perth and Perthshire North | width=5px; style=\"background:#ff0\" | | SNP hold | 19,118 | 39.6\\% | 2.9\\% |- |Peterborough | width=5px; style=\"background:\" | | | | | |- |Plymouth Moor View | width=5px; style=\"background:red\" | | Labour hold |15,433 |37.2\\% |7.8\\% (to CON) |- |Plymouth Sutton and Devonport | width=5px; style=\"background:blue\" | | Conservative gain from Lab |15,050 |34.3\\% |6.9\\% |- |Pontypridd | width=5px; style=\"background:red\" | | Labour hold | 14,220 | 38.8\\% | |- |Poole | width=5px; style=\"background:\" | | | | | |- |Poplar and Limehouse | width=5px; style=\"background:\" | | | | | |- |Portsmouth North | width=5px; style=\"background:\" | | | | | |- |Portsmouth South | width=5px; style=\"background:\" | | | | | |- |Preseli Pembrokeshire | width=5px; style=\"background:\" | | | | | |- |Preston | width=5px; style=\"background:\" | | | | | |- |Pudsey | width=5px; style=\"background:\" | | | | | |- |Putney | width=5px; style=\"background:\" | | | | | |- |Rayleigh and Wickford | width=5px; style=\"background:\" | | | | | |- |Reading East | width=5px; style=\"background:\" | | | | | |- |Reading West | width=5px; style=\"background:\" | | | | | |- |Redcar | width=5px; style=\"background:#F9D616\"| | Liberal Democrat gain from Lab | 18,955 | 45.2\\% | 21.8\\% |- |Redditch | width=5px; style=\"background:\" | | | | | |- |Reigate | width=5px; style=\"background:\" | | | | | |- |Renfrewshire East | width=5px; style=\"background:\" | | | | | |- |Rhondda | width=5px; style=\"background:\" | | | | | |- |Ribble Valley | width=5px; style=\"background:\" | | | | | |- |Richmond Yorks | width=5px; style=\"background:\" | | | | | |- |Richmond Park | width=5px; style=\"background:\" | | | | | |- |Rochdale | width=5px; style=\"background:\" | | | | | |- |Rochester and Strood | width=5px; style=\"background:blue\" | | Conservative hold | 23,604 | 49.2\\% | |- |Rochford and Southend East | width=5px; style=\"background:\" | | | | | |- |Romford | width=5px; style=\"background:\" | | | | | |- |Romsey and Southampton North | width=5px; style=\"background:\" | | | | | |- |Ross, Skye and Lochaber | width=5px; style=\"background:\" | | | | | |- |Rossendale and Darwen | width=5px; style=\"background:\" | | | | | |- |Rother Valley | width=5px; style=\"background:\" | | | | | |- |Rotherham | width=5px; style=\"background:\" | | | | | |- |Rugby | width=5px; style=\"background:\" | | | | | |- |Ruislip, Northwood and Pinner | width=5px; style=\"background:\" | | | | | |- |Runnymede and Weybridge | width=5px; style=\"background:\" | | | | | |- |Rushcliffe | width=5px; style=\"background:\" | | | | | |- |Rutherglen and Hamilton West | width=5px; style=\"background:\" | | | | | |- |Rutland and Melton | width=5px; style=\"background:\" | | | | | |- |Saffron Walden | width=5px; style=\"background:\" | | | | | |- |St Albans | width=5px; style=\"background:\" | | | | | |- |St Austell and Newquay | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |20,189 |42.7\\% | |- |St Helens North | width=5px; style=\"background:red\" | | Labour hold | 23,041 | 51.7\\% | |- |St Helens South | width=5px; style=\"background:red\" | | Labour hold | 24,364 | 52.9\\% | |- |St Ives | width=5px; style=\"background:\" | | | | | |- |Salford and Eccles | width=5px; style=\"background:red\" | | Labour hold | 16,655 | 40.1\\% | |- |Salisbury | width=5px; style=\"background:\" | | | | | |- |Scarborough and Whitby | width=5px; style=\"background:blue\" | | Conservative hold | 21,108 | 42.8\\% | |- |Scunthorpe | width=5px; style=\"background:\" | | | | | |- |Sedgefield | width=5px; style=\"background:red\" | | Labour hold |18,141 |45.1\\% |11.6\\% (to CON) |- |Sefton Central | width=5px; style=\"background:\" | | | | | |- |Selby and Ainsty | width=5px; style=\"background:blue\" | | Conservative hold | 25,562 | 49.4\\% | |- |Sevenoaks | width=5px; style=\"background:\" | | | | | |- |Sheffield Brightside and Hillsborough | width=5px; style=\"background:red\" | | 'Labour hold | 21,400 | 55.0\\% | |- |Sheffield Central | width=5px; style=\"background:\"red\" | | Labour hold | 17,138 | 41.3\\% | |- |Sheffield Hallam | width=5px; style=\"background:\"#F9D616\" | | Liberal Democrat Hold | 27,324 | 53.4\\% | |- |Sheffield Heeley | width=5px; style=\"background:\" | | | | | |- |Sheffield South East | width=5px; style=\"background:red\" | | Labour hold | 20,169 | 48.7\\% | |- |Sherwood | width=5px; style=\"background:\" | | | | | |- |Shipley | width=5px; style=\"background:blue\" | | Conservative hold | 24,002 | 48.6\\% | |- |Shrewsbury and Atcham | width=5px; style=\"background:\" | | | | | |- |Shropshire North | width=5px; style=\"background:blue\" | | Conservative hold | 26,692 | 51.5\\% | |- |Sittingbourne and Sheppey | width=5px; style=\"background:\" | | | | | |- |Skipton and Ripon | width=5px; style=\"background:\" | | | | | |- |Sleaford and North Hykeham | width=5px; style=\"background:blue\" | | Conservative hold | 30,719 | 51.6\\% | |- |Slough | width=5px; style=\"background:\" | | | | | |- |Solihull | width=5px; style=\"background:#F9D616\" | | Liberal Democrat gain from Con | 23,635 | 42.9\\% | 0.3\\% |- |Somerset North | width=5px; style=\"background:\" | | | | | |- |Somerset North East | width=5px; style=\"background:\" | | | | | |- |Somerton and Frome | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |28,793 |47.5\\% | |- |South Holland and the Deepings | width=5px; style=\"background:\" | | | | | |- |South Ribble | width=5px; style=\"background:\" | | | | | |- |South Shields | width=5px; style=\"background:red\" | | Labour hold | 18,995 | 52.0\\% | |- |Southampton Itchen | width=5px; style=\"background:red\" | | Labour hold | 16,326 | 36.8\\% | |- |Southampton Test | width=5px; style=\"background:red\" | | Labour hold | 17,001 | 38.5\\% | |- |Southampton West | width=5px; style=\"background:\" | | | | | |- |Southport | width=5px; style=\"background:\" | | | | | |- |Spelthorne | width=5px; style=\"background:\" | | | | | |- |Stafford | width=5px; style=\"background:\" | | | | | |- |Staffordshire Moorlands | width=5px; style=\"background:\" | | | | | |- |Staffordshire South | width=5px; style=\"background:\" | | | | | |- |Stalybridge and Hyde | width=5px; style=\"background:\" | | | | | |- |Stevenage | width=5px; style=\"background:\" | | | | | |- |Stirling | width=5px; style=\"background:red\" | |Labour hold |19,558 |41.8\\% | |- |Stockport | width=5px; style=\"background:red\" | | Labour hold | 16,697 | 42.7\\% | |- |Stockton North | width=5px; style=\"background:\" | | | | | |- |Stockton South | width=5px; style=\"background:\" | | | | | |- |Stoke-on-Trent Central | width=5px; style=\"background:\" | | | | | |- |Stoke-on-Trent North | width=5px; style=\"background:\" | | | | | |- |Stoke-on-Trent South | width=5px; style=\"background:red\" | | Labour hold | 15,446 | 38.8\\% | |- |Stone | width=5px; style=\"background:\" | | | | | |- |Stourbridge | width=5px; style=\"background:\" | | | | | |- |Strangford | width=5px; style=\"background:\" | | | | | |- |Stratford-on-Avon | width=5px; style=\"background:\" | | | | | |- |Streatham | width=5px; style=\"background:\" | | | | | |- |Stretford and Urmston | width=5px; style=\"background:\" | | | | | |- |Stroud | width=5px; style=\"background:\" | | | | | |- |suffolk Central and Ipswitch North | width=5px; style=\"background:\" | | | | | |- |Suffolk Coastal | width=5px; style=\"background:\" | | | | | |- |Suffolk South | width=5px; style=\"background:\" | | | | | |- |Suffolk West | width=5px; style=\"background:\" | | | | | |- |Sunderland Central | width=5px; style=\"background:red\" | |Labour win (new seat) |19,495 |45.9\\% | |- |Surrey East (UK Parliament constituency) | width=5px; style=\"background:blue\" | | Conservative hold | 31,007 | 56.7\\% | 0.7\\% (to LD) |- |Surrey Heath | width=5px; style=\"background:blue\" | | Conservative hold | 31,326 | 57.6\\% | 4.6\\% |- |Surrey South West | width=5px; style=\"background:blue\" | | Conservative hold | 33,605 | 58.7\\% | 8.6\\% |- |Sussex Mid | width=5px; style=\"background:blue\" | |Conservative hold |28,329 |50.7\\% |0.3\\% |- |Sutton and Cheam | width=5px; style=\"background:\" | | | | | |- |Sutton Coldfield | width=5px; style=\"background:\" | | | | | |- |Swansea East | width=5px; style=\"background:\" | | | | | |- |Swansea West | width=5px; style=\"background:\" | | | | | |- |Swindon North | width=5px; style=\"background:\" | | | | | |- |Swindon South | width=5px; style=\"background:\" | | | | | |- |Tamworth | width=5px; style=\"background:\" | | | | | |- |Tatton | width=5px; style=\"background:\" | | | | | |- |Taunton Deane | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |28,531 |49.1\\% | |- |Telford | width=5px; style=\"background:\" | | | | | |- |Tewkesbury | width=5px; style=\"background:blue\" | | Conservative hold | 25,472 | 47.2\\% | |- |Thanet North | width=5px; style=\"background:\" | | | | | |- |Thanet South | width=5px; style=\"background:\" | | | | | |- |Thirsk and Malton | width=5px; style=\"background:black\" | | Delayed until 27 May'' | | | |- |Thornbury and Yate | width=5px; style=\"background:\" | | | | | |- |Thurrock | width=5px; style=\"background:\" | | | | | |- |Tiverton and Honiton | width=5px; style=\"background:blue\" | | Conservative hold | 27,614 | 50.3\\% | |- |Tonbridge and Malling | width=5px; style=\"background:\" | | | | | |- |Tooting | width=5px; style=\"background:\" | | | | | |- |Torbay | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |23,126 |47.0\\% | |- |Torfaen | width=5px; style=\"background:\" | | | | | |- |Totnes | width=5px; style=\"background:blue\" | | Conservative hold|21,940 |45.9\\% | |- |Tottenham | width=5px; style=\"background:\" | | | | | |- |Truro and Falmouth | width=5px; style=\"background:blue\" | | Conservative gain from Lib |20,349 |41.7\\% | |- |Tunbridge Wells | width=5px; style=\"background:\" | | | | | |- |Twickenham | width=5px; style=\"background:\" | | | | | |- |Tynemouth | width=5px; style=\"background:\" | | | | | |- |Tyneside North | width=5px; style=\"background:\" | | | | | |- |Tyrone West | width=5px; style=\"background:#060\" | |Sinn F\u00e9in hold|18,050 |48.4\\% | |- |Ulster Mid | width=5px; style=\"background:\" | | | | | |- |Upper Bann | width=5px; style=\"background:#c30\" | |Democratic Unionist hold|14,000 |33.8\\% | |- |Uxbridge and Ruiislip South | width=5px; style=\"background:\" | | | | | |- |Vale of Clwyd | width=5px; style=\"background:red\" | | Labour hold|15,017 |42.3\\% | |- |Vale of Glamorgan | width=5px; style=\"background:\" | | | | | |- |Vauxhall | width=5px; style=\"background:\" | | | | | |- |Wakefield | width=5px; style=\"background:\" | | | | | |- |Wallasey | width=5px; style=\"background:\" | | | | | |- |Walsall North | width=5px; style=\"background:red\" | | Labour hold | 13,385 | 37.0\\% | |- |Walsall South | width=5px; style=\"background:red\" | | Labour hold | 16,211 | 39.7\\% | |- |Walthamstow | width=5px; style=\"background:\" | | | | | |- |Wansbeck | width=5px; style=\"background:\" | | | | | |- |Wantage | width=5px; style=\"background:\" | | | | | |- |Warley | width=5px; style=\"background:red\" | | Labour hold| 20,240 | 52.9\\% | |- |Warrington North | width=5px; style=\"background:\" | | | | | |- |Warrington South | width=5px; style=\"background:\" | | | | | |- |Warwick and Leamington | width=5px; style=\"background:\" | | | | | |- |Warwickshire North | width=5px; style=\"background:\" | | | | | |- |Washington and Sunderland West | width=5px; style=\"background:red\" | |Labour win (new seat) |19,615 |53\\% | |- |Watford | width=5px; style=\"background:\" | | | | | |- |Waveney | width=5px; style=\"background:\" | | | | | |- |Wealden | width=5px; style=\"background:blue\" | | Conservative hold| 31,090 | 56.6\\% | |- |Weaver Vale | width=5px; style=\"background:\" | | | | | |- |Wellingborough | width=5px; style=\"background:blue\" | | Conservative hold| 24,918 | 48.2\\% | |- |Wells | width=5px; style=\"background:#F9D616\" | | Liberal Democrat gain from Con |24,560 |44.0\\% |3.6\\% |- |Welwyn Hatfield | width=5px; style=\"background:\" | | | | | |- |Wentworth and Dearne | width=5px; style=\"background:\" | | | | | |- |West Bromwich East | width=5px; style=\"background:\" | | | | | |- |West Bromwich West | width=5px; style=\"background:\" | | | | | |- |West Ham | width=5px; style=\"background:\" | | | | | |- |Westminster North | width=5px; style=\"background:red\" | | Labour hold| 17,377 | 43.9\\% | |- |Westmorland and Lonsdale | width=5px; style=\"background:\" | | | | | |- |Weston Super-Mare | width=5px; style=\"background:\" | | | | | |- |Wigan | width=5px; style=\"background:\" | | | | | |- |Wiltshire North | width=5px; style=\"background:\" | | | | | |- |Wiltshire South West | width=5px; style=\"background:\" | | | | | |- |Wimbledon | width=5px; style=\"background:\" | | | | | |- |Winchester | width=5px; style=\"background:\" | | | | | |- |Windsor | width=5px; style=\"background:\" | | | | | |- |Wirral South | width=5px; style=\"background:red\" | | Labour hold| 16,276 | 40.8\\% | |- |Wirral West | width=5px; style=\"background:blue\" | | Conservative hold| 16,726 | 42.5\\% | |- |Witham | width=5px; style=\"background:\" | | | | | |- |Witney | width=5px; style=\"background:\" | | | | | |- |Woking | width=5px; style=\"background:blue\" | | Conservative hold| 26,551 | 50.3\\% | 0.7\\% (to LD) |- |Wokingham | width=5px; style=\"background:blue\" | | Conservative hold| 28,754 | 52.7\\% | 4.7\\% |- |Wolverhampton North East | width=5px; style=\"background:\" | | | | | |- |Wolverhampton South East | width=5px; style=\"background:\" | | | | | |- |Wolverhampton South West | width=5px; style=\"background:\" | | | | | |- |Worcester | width=5px; style=\"background:\" | | | | | |- |Worcestershire Mid | width=5px; style=\"background:blue\" | | Conservative hold| 27,770 | 54.5\\% | |- |Worcestershire West | width=5px; style=\"background:\" | | | | | |- |Workington | width=5px; style=\"background:red\" | | Labour hold| 17,865 | 45.5\\% | |- |Worsley and Eccles South | width=5px; style=\"background:red\" | | Labour hold| 17,892 | 42.9\\% | |- |Worthing East and Shoreham | width=5px; style=\"background:blue\" | | Conservative hold| 23,458 | 48.5\\% | |- |Worthing West | width=5px; style=\"background:blue\" | | Conservative hold| 25,416 | 51.7\\% | |- |The Wreckin | width=5px; style=\"background:\" | | | | | |- |Wrexham | width=5px; style=\"background:red\" | | Labour hold| 12,161 | 36.9\\% | 5.7\\% |- |Wycombe | width=5px; style=\"background:blue\" | | Conservative hold| 23,423 | 48.6\\% | |- |Wyre and Preston North | width=5px; style=\"background:blue\" | | Conservative hold| 26,877 | 52.4\\% | 3.9\\% |- |Wyre Forest | width=5px; style=\"background:red\" | | Labour hold| 11,490 | 33.4\\% | |- |Wythenshawe and Sale East | width=5px; style=\"background:red\" | | Labour hold| 17,987 | 44.1\\% | |- |Yeovil | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold| 31,843 | 55.7\\% | 2.7\\% |- |Ynys Mon | width=5px; style=\"background:red\" | | Labour hold| 11,490 | 33.4\\% | 1.8\\% |- |York Central | width=5px; style=\"background:red\" | | Labour hold| 18,573 | 40.0\\% | 6.0\\% (to CON) |- |York Outer | width=5px; style=\"background:blue\" | | Conservative gain from Liberal Democrats | 22,912 | 43\\% | 3.7\\% |- |Yorkshire East | width=5px; style=\"background:blue\" | | Conservative hold''' 24,328 47.5\\% 0.1\\% (to LD)", "after_revision": "A colour-coded map of the constituencies contested. Please click the image to expand. This table shows the results for 649 of 650 constituencies in the in the United Kingdom (not including the delayed constituency of , which will hold its election on 27 May). The \"Constituency\" column shows the name of each constituency, linked to the relevant Wikipedia article. the \"Result\" column shows the winning party, and whether they held or gained the seat (and, if relevant, who they gained it from). The \"Votes\" column shows how many votes were received by the winning party, the \"Share\" column their share of the vote, and the \"Swing\" column the in the direction of the gaining party. In the general election, people over the age of eighteen around the United Kingdom may choose to vote for a candidate at their local polling booth, and Members of Parliament are elected to each constituency based on the system. Whichever party has a majority of MPs after all constituencies have announced their results has the opportunity to form a government. The incumbent party before the dissolution of parliament was Gordon Brown's , exit polls suggested a small majority, which\u2014when this swing is projected nationally\u2014would cause a . The exit polls also suggested that despite reports that support for the had surged following the first national televised leaders' debates in the United Kingdom, the Liberal Democrats would suffer from a third party squeeze. On the morning of Friday 7, 2010 the accuracy of the exit polls was demonstrated when it was revealed that there was indeed a hung Parliament and that although the Conservative Party had the greatest number of seats and votes it would be impossible for them to achieve an outright majority. The constitution of the United Kingdom allows for the incumbent Labour Party to first attempt to form a government and incumbent Prime Minister, announced that he would allow civil servants from the Cabinet Office to help facilitate negotiations. Despite the Labour Party openly courting the Liberal Party, their leader has stated that as the party with the most seats and most votes the Conservatives have the right to attempt to form a government. Some seats were also be contested by one or more of a number of smaller parties and independents, including the , the , and the , who all already hold seats in the and local government authorities, all hoped to gain their first seats in the in this election. History was made when the Greens won their first Parliamentery with their leader winning . In Northern Ireland the also won their first seat with taking 's seat. Overall standings PartySeatsNet gainVotesShare 305 +97 10,681,417 36.1\\% 258 -91 8,601,441 29.1\\% 57 -5 6,805,665 23.0\\% 8 -1 168,216 0.6\\% 6 0 491,386 1.7\\% 5 0 171,942 0.6\\% 3 +1 165,394 0.6\\% 3 0 110,970 0.4\\% 1 +1 42,762 0.1\\% 1 +1 284,566 1.0\\% Table Colour Party Red Blue Yellow Yellow (Northern Ireland) Bright Yellow Green (England) Light Green (Wales) Light Green (N. Ireland) Dark Green Brown Purple Grey Black Poll delayed White Undeclared ConstituencyResultVotesShareSwing Labour hold 16,073 51.9\\% 5.3\\% (to LD) Conservative gain from Lab 10,734 35.8\\% 7.6\\% Labour hold 16,746 44.4\\% 1.0\\% Labour hold 15,722 36.5\\% 2.5\\% Liberal Democrat hold 17,362 38.4\\% 4.9\\% (to CON) Labour hold20,64958.2\\% 3.9\\% (to SNP) Conservative hold 21,203 46.7\\% 1.4\\% (to LD) Conservative hold 22,913 59.3\\% 12.0\\% (from LAB) Conservative hold 24,176 48.9\\% 0.8\\% (to LD) Labour hold 15,804 39.6\\% 8.1\\% (to CON) Conservative gain from Lab 17,746 38.6\\% 6.9\\% SNP hold 15,020 39.6\\% 2.2\\% Democratic Unionist hold13,99345.9\\% Democratic Unionist hold19,67246.4\\% Democratic Unionist hold 11,536 33.9\\% 3.6\\% (to UCU) Plaid Cymru gain from Lab9,38336.0\\%3.7\\%Argyle and Bute Liberal Democrat hold14,29231.6\\%2.7\\% (to CON) Conservative hold32,33357.8\\%3.0\\% Labour hold16,23933.7\\%17.2\\% (to LD) Conservative hold29,87854.1\\%2.3\\% (to LD) Labour hold18,60448.4\\%7.3\\% (to CON) Conservative hold27,73652.2\\% Labour hold21,63247.1\\%0.3\\% (to CON) Labour hold20,95047.7\\%1.5\\% Labour hold21,86047.4\\%2.3\\% (to SNP) Conservative hold29,703 52.8\\%5.9\\% (to CON) SNP hold15,86841.3\\%10.7\\% (to CON) Labour hold24,62854.3\\%1.7\\%Barnsley CentralLabour hold17,48747.3\\%4.2\\% (to LD)Barnsley EasyLabour hold18,05947.0\\%14.0\\% (to LD)Barrow and FurnessLabour hold21,22648.1\\%0.4\\% (to CON)Basildon and BillericayConservative hold21,98252.8\\%9.3\\%Basildon South and Thurrock EastConservative gain from Lab19,62443.9\\%7.5\\%BasingstokeConservative hold25,59050.5\\%4.6\\%BassrtlawLabour hold25,01850.5\\%0.7\\% (to CON)BathLiberal Democrat hold26,65156.6\\%5.8\\%Batley and Spen Labour hold 21,565 41.5\\% 2.5\\% (to CON)Battersea Conservative gain from Lab 23,103 47.3\\% 6.5\\%BeaconsfieldConservative hold32,05361.1\\%4.7\\%BeckanhamConservative hold27,59757.9\\%3.2\\% (to LD)BedfordConservative gain from Lab17,54638.9\\%5.5\\%Bedforsdhire MidConservative hold28,81552.5\\%2.3\\%Bedfordshire North EastConservative hold30,98955.8\\%2.6\\%Bedfordshire South WestConservative hold26,81552.8\\%0.7\\%Belfast EastAlliance gain from DUP12,83937.2\\%22.9\\%Belfast NorthDemocratic Unionist hold14,81240.0\\%5.0\\% (to SF)Belfast SouthSDLP hold14,02641.0\\%8.4\\%Belfast WestSinn F\u00e9in hold22,84071.1\\%1.1\\%Bermondsey and Old SouthwarkLiberal Democrat hold21,59048.4\\%1.6\\%Berwick-Upon-TweedLiberal Democrat hold16,80643.7\\%8.3\\% (to CON)Banff and BuchanLiberal Democrat hold22,23045.4\\%0.7\\% (to CON)Bethnal Green and BowBanff and BuchanConservative hold22,23045.4\\%1.6\\%Bexhill and BattleConservative hold28,14751.6\\%4.0\\% (to LD)Bexleyheath and CrayfordBirkenhead)Birmingham Edgbaston Labour hold 16,894 40.6\\% 0.5\\% (to CON)Birmingham ErdingtonBirmingham Hall GreenBirmingham Hodge HillBirmingham LadywoodLabour hold19,95055.7\\%2.5\\%Birmingham NorthfieldBirmingham Perry BarrBirmingham Selly Oak Labour hold 17,950 38.5\\% 4.8\\% (to CON)Birmingham YardleyBishop Auckland Labour hold 16,023 39.0\\% 7.2\\% (to CON)BlackburnLabour hold21,75147.8\\%1.1\\%Blackley and BroughtonBlackpool North and CleveleysConservative gain from Lab16,96441.8\\%6.9\\%Blackpool SouthLabour hold14,44941.16.2\\% (to CON)Blaenau GwentLabour gain from Ind 16,974 52.4\\% 29.2\\%Blaydon Labour hold 22,297 49.7\\% 3.3\\%Blyth ValleyBognor Regis and LittlehamptonConservative hold24,08751.4\\%2.3\\%BolsoverLabour hold21,99450.0\\%11.2\\% (to CON)Bolton North EastLabour hold19,87045.9\\%1.3\\% (to CON)Bolton South EastLabour hold18,78247.4\\%5.6\\% (to CON)Bolton West Labour hold 18,327 38.5\\% 4.9\\% (to CON)BootleBoston and SkegnessConservative hold18,78247.4\\%7.0\\%BosworthConservative hold23,13242.6\\%5.9\\% (to LD)Bournemouth EastConservative hold21,32048.4\\%1.8\\%Bournemouth West Conservative hold 18,808 45.1\\% 2.9\\%Bracknell Conservative hold 27,327 52.4\\% 1.0\\% (to LD)Bradford EastBradford SouthBradford WestBraintree Conservative hold 25,901 52.6\\% 6.7\\%Brecon and RadnorshireLiberal Democrat hold17,92946.2\\%0.3\\% (to CON)Brent CentralBrent NorthBrentford and IsleworthBrentwood and OngarConservative hold28,79256.9\\%3.1\\%BridgendLabour hold13,93136.3\\%6.0\\% (to CON)Bridgwater and Somerset West Conservative hold 24,675 45.3\\% 2.9\\% (to LD)Brigg and GooleConservative gain from Lab19,68044.9\\%9.8\\%Brighton KemptownBrighton Pavilion Green gain from Lab 16,238 31.3\\% 8.4\\%Bristol EastLabour hold16,47136.6\\%4.5\\% (to CON)Bristol North WestBristol SouthBristol WestLiberal Democrat hold26,59348.0\\%9.0\\%BroadlandBromley and ChislehurstBromsgroveBroxbourneConservative hold26,84458.8\\%6.4\\%BroxtoweConservative gain from Lab20,58539.0\\%2.6\\%BuckinghamBurnleyLiberal Democrat gain from Lab14,93235.7\\%9.6\\%BurtonConservative gain from Lab22,18844.5\\%8.7\\%Bury NorthBury SouthBury St EdmundsConservative hold27,89947.5\\%2.8\\%CaerphillyLabour hold17,37744.9\\%6.5\\% (to CON)Caithness, Sutherland and Easter RossLiberal Democrat hold11,90741.4\\%6.4\\% (to LAB)Calder ValleyCamberwell and PeckhamCambourne and Redruth Conservative gain from Lib37.6\\%15,9695.2\\%Cambridge Liberal Democrat hold 19,621 39.1\\% 7.0\\% (to CON)Cambridgeshire North EastConservative hold26,86251.4\\%0.8\\%Cambridgeshire North WestConservative hold29,42550.05\\%2.6\\%Cambridgeshire SouthConservative hold27,99547.4\\%2.5\\% (to LD)Cambridgeshire South EastConservative hold27,62948.0\\%2.7\\% (to LD)Cannock ChaseConservative gain from Lab18,27140.1\\%14.0\\%Canterbury Conservative hold22,05044.8\\%5.4\\% (to LD)Cardiff CentralCardiff NorthCardiff South and Penarth Labour hold 17,262 38.9\\% 6.0\\% (to CON)Cardiff West Labour hold 16,893 41.2\\% 5.3\\% (to CON)Carlisle Carmarthen East and Dinefwr Plaid Cymru hold 13,546 35.6\\% 4.2\\% (to LAB)Carmarthen West and Pembrokeshire South Conservative gain from Lab 16,649 41.1\\% 6.9\\%Carshalton and WallingtonCastle PointCeredigionCharnwoodChatham and AylesfordCheadleChelmsfordChelsea and FulhamCheltenhamChelsham and AmershamChester, City ofChesterfieldChichesterChingford and Woodford GreenChippenhamChipping BarnetChorleyChristchurchCities of London and WestminsterClactonCleethorpesConservative gain from Lab18,93942.1\\%7.8\\%Clwyd South Labour hold13,31138.4\\%5.8\\% (to CON)Clwyd West Conservative hold 15,833 41.5\\% 8.4\\%Coatbridge, Chryson and BellshillColchesterColne ValleyCongleton Conservative hold 23,250 45.8\\% 2.3\\% (to LD)Copeland Labour hold 19,699 46.0\\% 2.1\\% (to CON)Corby Conservative gain from Lab 22,886 42.2\\% 3.4\\%Cornwall North Liberal Democrat hold22,51248.1\\%0.3\\% (to CON)Cornwall South East Conservative gain from Lib22,39045.1\\%9.1\\%The Cotswolds Conservative hold 29,075 53.0\\% 1.1\\%Coventry North East Labour hold 21,384 49.3\\% 5.5\\% (to CON)Coventry North West Labour hold 19,936 42.8\\% 3.9\\% (to CON)Coventry South Labour hold 19,197 41.8\\% 3.4\\% (to CON)Crawley Conservative gain from Lab 21,264 44.8\\% 6.3\\%Crewe and Nantwich Conservative gain from Lab 23,420 45.8\\% 13.7\\%Croydon Central Conservative gain from Lab | 19,657 | 39.5\\% | 3.3\\% |- |Croydon North | width=5px; style=\"background:red\"| | Labour hold | 28,949 | 56.0\\% | 0.3\\% |- |Croydon South | width=5px; style=\"background:blue\"| | Conservative hold | 28,684 | 50.9\\% | 1.7\\% (to LD) |- |Cumbernauld, Kilsyth and Kirkintilloch East | width=5px; style=\"background:red\"| | Labour hold | 23,549 | 57.2\\% | 1.9\\% |- |Cynon Valley | width=5px; style=\"background:red\"| | Labour hold | 15,681 | 52.5\\% | 8.6\\% (to PC) |- |Dagenham and Rainham | width=5px; style=\"background:red\"| |Labour hold |17,813 |40.3\\% |4.9\\% (to CON) |- |Darlington | width=5px; style=\"background:red\"| | Labour hold |16,891 |39.4\\% |9.1\\% (to CON) |- |Dartford | width=5px; style=\"background:blue\"| |Conservative gain from Lab |24,428 |48.8\\% |11.6\\% |- |Daventry | width=5px; style=\"background:blue\"| | Conservative hold | 29,252 | 56.5\\% | 0.7\\% (to LD) |- |Delyn | width=5px; style=\"background:red\"| | Labour hold | 15,083 | 40.8\\% | 6.7\\% (to CON) |- |Denton and Reddish | width=5px; style=\"background:red\"| |Labour hold |19,191 |51.0\\% |6.2\\% (to CON) |- |Derby North | width=5px; style=\"background:red\"| | Labour hold | 14,896 | 33.0\\% | 7.4\\% (to CON) |- |Derby South | width=5px; style=\"background:red\"| |Labour hold |17,851 |43.3\\% |9.3\\% (to CON) |- |Derbyshire Dales | width=5px; style=\"background:blue\"| | Conservative hold | 24,378 | 52.1\\% | 3.7\\% |- |Derbyshire Mid | width=5px; style=\"background:blue\"| |Conservative hold |22,877 |48.3\\% |5.7\\% |- |Derbyshire North East | width=5px; style=\"background:red\"| |Labour hold |17,948 |38.2\\% |8.6\\% (to CON) |- |Derbyshire South | width=5px; style=\"background:blue\"| |Conservative gain from Lab |22,935 |45.5\\% |9.8\\% |- |Devizes | width=5px; style=\"background:\"| | | | | |- |Devon Central | width=5px; style=\"background:blue\"| | Conservative hold | 27,737 | 51.5\\% | 6.1\\% |- |Devon East | width=5px; style=\"background:blue\"| | Conservative hold |48.3\\% |25,662 | |- |Devon North | width=5px; style=\"background:#F9D616\"| | Liberal Democrat hold |24,305 |47.4\\% |0.3\\% |- |Devon South West | width=5px; style=\"background:blue\"| | Conservative hold |27,908 |56.0\\% |5.6\\% |- |Devon West and Torridge | width=5px; style=\"background:\"| | | | | |- |Dewsbury | width=5px; style=\"background:\"| | | | | |- |Don Valley | width=5px; style=\"background:\"| | | | | |- |Doncaster Central | width=5px; style=\"background:\"| | | | | |- |Doncaster North | width=5px; style=\"background:\"| | | | | |- |Doset Mid and Poole North | width=5px; style=\"background:\"| | | | | |- |Dorset North | width=5px; style=\"background:\"| | | | | |- |Dorset South | width=5px; style=\"background:blue\"| | Conservative gain from Lab |22,667 |45.1\\% |9.3\\% |- |Dorset West | width=5px; style=\"background:blue\"| | Conservative hold |27,287 |47.6\\% | |- |Dover | width=5px; style=\"background:\"| | | | | |- |Down North | width=5px; style=\"background:grey\"| |Independent gain from UCU |21,181 |63.3\\% | |- |Down South | width=5px; style=\"background:#3c3\" | |SDLP hold |20,648 |48.5\\% | |- |Dudley North | width=5px; style=\"background:\"| | | | | |- |Dudley South | width=5px; style=\"background:\"| | | | | |- |Dulwich and West Norwood | width=5px; style=\"background:\"| | | | | |- |Dumfries and Galloway | width=5px; style=\"background:\"| | | | | |- |Dunfiesshire, Clydesdale and Tweeddale | width=5px; style=\"background:\"| | | | | |- |Dunbartonshire East | width=5px; style=\"background:\"| | | | | |- |Dunbartonshire West | width=5px; style=\"background:\"| | | | | |- |Dundee East | width=5px; style=\"background:\"| | | | | |- |Dundee West | width=5px; style=\"background:\"| | | | | |- |Dunfermine and Fife West | width=5px; style=\"background:\"| | | | | |- |City of Durham | width=5px; style=\"background:red\"| | Labour hold |20,496 |44.3\\% | |- |Durham North | width=5px; style=\"background:red\"| |Labour hold |20,698 |50.5\\% | |- |Durham North West | width=5px; style=\"background:\"| | | | | |- |Dwyfor Meirionnydd | width=5px; style=\"background:\"| | | | | |- |Ealing Central and Acton | width=5px; style=\"background:\"| | | | | |- |Ealing North | width=5px; style=\"background:\"| | | | | |- |Ealing Southall | width=5px; style=\"background:\"| | | | | |- |Easington | width=5px; style=\"background:red\"| |Labour hold |20,579 |58.9\\% | |- |East Ham | width=5px; style=\"background:\"| | | | | |- |East Kilbride, Strathaven and Lesmahagow | width=5px; style=\"background:\"| | | | | |- |East Lothian | width=5px; style=\"background:\"| | | | | |- |Eastbourne | width=5px; style=\"background:\"| | | | | |- |Eastleigh | width=5px; style=\"background:\"| | | | | |- |Eddisbury | width=5px; style=\"background:\"| | | | | |- |Edinburgh East | width=5px; style=\"background:red\"| | Labour hold | 17,305 | 43.4\\% | |- |Edinburgh North and Leith | width=5px; style=\"background:\"| | | | | |- |Edinburgh South | width=5px; style=\"background:\"| | | | | |- |Edinburgh South West | width=5px; style=\"background:red\"| | Labour hold | 19,473 | 42.8\\% | |- |Edinburgh West | width=5px; style=\"background:#F9D616\"| | Liberal Democrat hold | 16,684 | 35.9\\% | -11.4\\% |- |Edmonton | width=5px; style=\"background:\"| | | | | |- |Ellesmere Port and Neston | width=5px; style=\"background:\"| | | | | |- |Elmet and Rothwell | width=5px; style=\"background:\"| | | | | |- |Eltham | width=5px; style=\"background:\"| | | | | |- |Enfield North | width=5px; style=\"background:\"| | | | | |- |Enfield Southgate | width=5px; style=\"background:\"| | | | | |- |Epping Forest | width=5px; style=\"background:\"| | | | | |- |Epsom and Ewell | width=5px; style=\"background:\"| | | | | |- |Erewash | width=5px; style=\"background:\"| | | | | |- |Erith and Thameshead | width=5px; style=\"background:\"| | | | | |- |Esher and Walton | width=5px; style=\"background:\"| | | | | |- |Exeter | width=5px; style=\"background:red\"| | Labour hold |19,942 |38.2\\% | |- |Falkirk | width=5px; style=\"background:red\"| | Labour hold |23,207 |45.7\\% | |- |Fareham | width=5px; style=\"background:blue\"| | Conservative hold |30,037 |55.3\\% | |- |Faversham and Kent Mid | width=5px; style=\"background:\"| | | | | |- |Feltham and Heston | width=5px; style=\"background:\"| | | | | |- |Fermanagh and South Tyrone | width=5px; style=\"background:#060\"| | Sinn F\u00e9in hold |21,304 |45.5\\% | |- |Fife North East | width=5px; style=\"background:\"| | | | | |- |Filton and Bradley Stoke | width=5px; style=\"background:\"| | | | | |- |Finchley and Golders Green | width=5px; style=\"background:\"| | | | | |- |Folkestone and Hythe | width=5px; style=\"background:\"| | | | | |- |Forest of Dean | width=5px; style=\"background:\"| | | | | |- |Foyle | width=5px; style=\"background:#3c3\" | |SDLP hold |16,922 |44.7\\% | |- |Flyde | width=5px; style=\"background:\"| | | | | |- |Gainsborough | width=5px; style=\"background:blue\"| | Conservative hold |24,266 |49.3\\% | |- |Garston and Halewood | width=5px; style=\"background:red\"| | Labour hold |25,493 |59.5\\% | |- |Gateshead | width=5px; style=\"background:\"| | | | | |- |Gedling | width=5px; style=\"background:red\"| | Labour hold |19,821 |41.1\\% | |- |Gillingham and Rainham | width=5px; style=\"background:\"| | | | | |- |Glasgow Central | width=5px; style=\"background:\"| | | | | |- |Glasgow East | width=5px; style=\"background:red\"| | Labour hold |19,797 |61.6\\% | |- |Glasgow North | width=5px; style=\"background:\"| | | | | |- |Glasgow North East | width=5px; style=\"background:red\"| | Labour hold | 20,100 | 68.3\\% | |- |Glasgow North West | width=5px; style=\"background:\"| | | | | |- |Glasgow South | width=5px; style=\"background:\"| | | | | |- |Glasgow South West | width=5px; style=\"background:\"| | | | | |- |Glenrothes | width=5px; style=\"background:\"| | | | | |- |Gloucester | width=5px; style=\"background:\"| | | | | |- |Gordon | width=5px; style=\"background:\"| | | | | |- |Gosport | width=5px; style=\"background:\"| | | | | |- |Gower | width=5px; style=\"background:\"| | | | | |- |Grantham and Stamford | width=5px; style=\"background:\"| | | | | |- |Gravesham | width=5px; style=\"background:blue\"| | Conservative hold | 22,956 | 48.5\\% | 9.1\\% |- |Great Grimsby | width=5px; style=\"background:red\"| |Labour hold |10,777 |32.7\\% |10.5\\% (to CON) |- |Great Yarmouth | width=5px; style=\"background:\"| | | | | |- |Greenwich and Woolwich | width=5px; style=\"background:\"| | | | | |- |Guildford | width=5px; style=\"background:blue\"| |Conservative hold |29,618 |53.3\\% |6.9\\% |- |Hackney North and Stoke Newington | width=5px; style=\"background:\"| | | | | |- |Hackney South and Shoreditch | width=5px; style=\"background:\"| | | | | |- |Halesowen and Rowley Regis | width=5px; style=\"background:\"| | | | | |- |Halifax | width=5px; style=\"background:\"| | | | | |- |Haltemprice and Howden | width=5px; style=\"background:blue\"| | Conservative hold | 24,486 | 50.2\\% | 6.6\\% |- |Halton | width=5px; style=\"background:\"| | | | | |- |Hammersmith | width=5px; style=\"background:red\"| | Labour hold | 20,810 | 43.9\\% | 0.5\\% (to CON) |- |Hampshire East | width=5px; style=\"background:\"| | | | | |- |Hampshire North East | width=5px; style=\"background:\"| | | | | |- |Hampshire North West | width=5px; style=\"background:\"| | | | | |- |Hampstead and Kilburn | width=5px; style=\"background:\"| | | | | |- |Harborough | width=5px; style=\"background:\"| | | | | |- |Harlow | width=5px; style=\"background:\"| | | | | |- |Harrogate and Knaresborough | width=5px; style=\"background:\"| | | | | |- |Harrow East | width=5px; style=\"background:blue\"| | Conservative gain from Lab | 21,435 | 44.7\\% | 7.0\\% (to CON) |- |Harrow West | width=5px; style=\"background:red\"| | Labour hold | 20,111 | 43.6\\% | 5.7\\% (to CON) |- |Hartlepool | width=5px; style=\"background:\"| | | | | |- |Harwich and Essex North | width=5px; style=\"background:\"| | | | | |- |Hastings and Rye | width=5px; style=\"background:\"| | | | | |- |Havant | width=5px; style=\"background:\"| | | | | |- |Hayes and Harlington | width=5px; style=\"background:\"| | | | | |- |Hazel Grove | width=5px; style=\"background:\"| | | | | |- |Hemel Hempstead | width=5px; style=\"background:\"| | | | | |- |Hemsworth | width=5px; style=\"background:\"| | | | | |- |Hendon | width=5px; style=\"background:\"| | | | | |- |Henley | width=5px; style=\"background:\"| | | | | |- |Hereford and Herefordshire South | width=5px; style=\"background:blue\"| |Conservative gain from Lib |22,366 |46.2\\% |3.8\\% |- |Herefordshire North | width=5px; style=\"background:blue\"| | Conservative hold | 24,631 | 51.8\\% | 3.8\\% (to LD) |- |Hertford and Stortford | width=5px; style=\"background:blue\"| | Conservative hold | 29,810 | 53.8\\% | |- |Hertfordshire North East | width=5px; style=\"background:blue\"| | Conservative hold | 26,995 | 53.5\\% | 1.9\\% (to LD) |- |Hertfordshire South West | width=5px; style=\"background:\"| | | | | |- |Hertsmere | width=5px; style=\"background:blue\"| | Conservative hold | 26,476 | 56.0\\% | 5.6\\% |- |Hexham | width=5px; style=\"background:\"| | | | | |- |Heywood and Middleton | width=5px; style=\"background:\"| | | | | |- |High Peak | width=5px; style=\"background:\"| | | | | |- |Hitchin and Harpenden | width=5px; style=\"background:\"| | | | | |- |Holborn and St Pancras | width=5px; style=\"background:\"| | | | | |- |Hornchurch and Upminster | width=5px; style=\"background:\"| | | | | |- |Hornsey and Wood Green | width=5px; style=\"background:\"| | | | | |- |Horsham | width=5px; style=\"background:\"| | | | | |- |Houghton and Sunderland South | width=5px; style=\"background:red\"| | Labour hold | 19,137 | 50.3\\% | 8.4\\% (to CON) |- |Hove | width=5px; style=\"background:\"| | | | | |- |Huddersfield | width=5px; style=\"background:red\"| | Labour hold | 15,725 | 38.8\\% | 7.1\\% (to CON) |- |Hull East | width=5px; style=\"background:\"| | | | | |- |Hull North | width=5px; style=\"background:red\"| | Labour hold | 13,044 | 39.2\\% | 12.2\\% (to LD) |- |Hull West and Hessle | width=5px; style=\"background:\"| | | | | |- |Huntingdon | width=5px; style=\"background:\"| | | | | |- |Hyndburn | width=5px; style=\"background:\"| | | | | |- |Ilford North | width=5px; style=\"background:\"| | | | | |- |Ilford South | width=5px; style=\"background:\"| | | | | |- |Inverclyde | width=5px; style=\"background:\"| | | | | |- |Inverness, Nairn, Badenoch and Strathspey | width=5px; style=\"background:\"| | | | | |- |Ipswich | width=5px; style=\"background:\"| | | | | |- |Isle of Wight | width=5px; style=\"background:\"| | | | | |- |Islington North | width=5px; style=\"background:red\"| | Labour hold | 24,276 | 54.5\\% | |- |Islington South and Finsbury | width=5px; style=\"background:red\"| | Labour hold | 18,407 | 42.3\\% | 3.3\\% |- |Islwyn | width=5px; style=\"background:\"| | | | | |- |Jarrow | width=5px; style=\"background:red\" | | Labour hold | 20,910 | 53.9\\% | 6.4\\% |- |Keighley | width=5px; style=\"background:\"| | | | | |- |Kenilworth and Southam | width=5px; style=\"background:\"| | | | | |- |Kensington | width=5px; style=\"background:blue\"| | Conservative hold | 17,595 | 50.1\\% | 5.2\\% |- |Kettering | width=5px; style=\"background:\"| | | | | |- |Kilmarnock and Loudoun | width=5px; style=\"background:\"| | | | | |- |Kingston and Surbiton | width=5px; style=\"background:\"| | | | | |- |Kingswood | width=5px; style=\"background:\"| | | | | |- |Kilcaldy and Cowdenbeath | width=5px; style=\"background:\"| | | | | |- |Knowsley | width=5px; style=\"background:\"| | | | | |- |Lagan Valley | width=5px; style=\"background:#c30\"| |Democratic Unionist hold |18,199 |49.8\\% | |- |Lanark and Hamilton East | width=5px; style=\"background:\"| | | | | |- |Lancashire West | width=5px; style=\"background:\"| | | | | |- |Lancaster and Fleetwood | width=5px; style=\"background:\"| | | | | |- |Leeds Central | width=5px; style=\"background:red\"| | Labour hold | 18,434 | 49.3\\% | |- |Leeds East | width=5px; style=\"background:\"| | | | | |- |Leeds North East | width=5px; style=\"background:red\"| | Labour hold | 20,287 | 42.7\\% | |- |Leeds North West | width=5px; style=\"background:\"| | | | | |- |Leeds West | width=5px; style=\"background:red\"| | Labour hold | 16,389 | 42.3\\% | |- |Leicester East | width=5px; style=\"background:\"| | | | | |- |Leicester South | width=5px; style=\"background:blue\"| | Conservative hold | 27,000 | 49.5\\% | |- |Leicester West | width=5px; style=\"background:\"| | | | | |- |Leicestershire North West | width=5px; style=\"background:\"| | | | | |- |Leicestershire South | width=5px; style=\"background:\"| | | | | |- |Leigh | width=5px; style=\"background:red\"| | Labour hold | 24,295 | 51.3\\% | |- |Lewes | width=5px; style=\"background:\"| | | | | |- |Lewisham Deptford | width=5px; style=\"background:\"| | | | | |- |Lewisham East | width=5px; style=\"background:\"| | | | | |- |Lewisham West and Penge | width=5px; style=\"background:\"| | | | | |- |Leyton and Wanstead | width=5px; style=\"background:\"| | | | | |- |Lichfield | width=5px; style=\"background:\"| | | | | |- |Lincoln | width=5px; style=\"background:\"| | | | | |- |Linlithgow and Falkirk East | width=5px; style=\"background:\"| | | | | |- |Liverpool Riverside | width=5px; style=\"background:red\"| | Labour hold | 22,998 | 59.3\\% | |- |Liverpool Walton | width=5px; style=\"background:\"| | | | | |- |Liverpool Wavertree | width=5px; style=\"background:\"| | | | | |- |Liverpool West Derby | width=5px; style=\"background:\"| | | | | |- |Livingston | width=5px; style=\"background:\"| | | | | |- |Llanelli | width=5px; style=\"background:red\"| | Labour hold | 15,916 | 42.5\\% | 4.0\\% (to PC) |- |Londonderry East | width=5px; style=\"background:\"| | | | | |- |Loughborough | width=5px; style=\"background:\"| | | | | |- |Louth and Horncastle | width=5px; style=\"background:blue\"| | Conservative hold | 25,065 | 49.6\\% | |- |Ludlow | width=5px; style=\"background:\"| | | | | |- |Luton North | width=5px; style=\"background:red\"| |Labour hold |21,192 |49.3\\% |0.5\\% |- |Luton South | width=5px; style=\"background:red\"| | Labour hold | 14,725 | 34.9\\% | 4.6\\% (to CON) |- |Macclesfield | width=5px; style=\"background:\" | | | | | |- |Maidenhead | width=5px; style=\"background:blue\" | |Conservative hold |31,937 |59.5\\% |7.8\\% |- |Maidstone and the Weald | width=5px; style=\"background:blue\" | | Conservative hold | 23,491 | 48.0\\% | |- |Makerfield | width=5px; style=\"background:\" | | | | | |- |Maldon | width=5px; style=\"background:\" | | | | | |- |Manchester Central | width=5px; style=\"background:\" | | | | | |- |Manchester Gorton | width=5px; style=\"background:\" | | | | | |- |Manchester Withington | width=5px; style=\"background:\" | | | | | |- |Mansfield | width=5px; style=\"background:\" | | | | | |- |Meon Valley | width=5px; style=\"background:\" | | | | | |- |Meriden | width=5px; style=\"background:\" | | | | | |- |Merthyr Tydfil and Rhymney | width=5px; style=\"background:\" | | | | | |- |Middlesbrough | width=5px; style=\"background:\" | | | | | |- |Middlesbrough South and Cleveland East | width=5px; style=\"background:red\" | | Labour hold | 18,138 | 39.2\\% | |- |Midlothian | width=5px; style=\"background:\" | | | | | |- |Milton Keynes North | width=5px; style=\"background:\" | | | | | |- |Milton Keynes South | width=5px; style=\"background:\" | | | | | |- |Mitcham and Morden | width=5px; style=\"background:red\" | | Labour hold | 24,722 | 56.4\\% | |- |Mole Valley | width=5px; style=\"background:blue\" | | Conservative hold | 31,263 | 57.5\\% | 2.3\\% |- |Monmouth | width=5px; style=\"background:\" | | | | | |- |Montgomeryshire | width=5px; style=\"background:\" | | | | | |- |Moray | width=5px; style=\"background:\" | | | | | |- |Morecambe and Lunesdale | width=5px; style=\"background:\" | | | | | |- |Morley and Outwood | width=5px; style=\"background:\" | | | | | |- |Motherwell and Wishaw | width=5px; style=\"background:\" | | | | | |- |Na H-Eileanan An Iar | width=5px; style=\"background:#ff0\" | | SNP hold |6,723 |45.75\\% | |- |Neath | width=5px; style=\"background:\" | | | | | |- |New Forest East | width=5px; style=\"background:\" | | | | | |- |New Forest West | width=5px; style=\"background:\" | | | | | |- |Newark | width=5px; style=\"background:\" | | | | | |- |Newbury | width=5px; style=\"background:\" | | | | | |- |Newcastle-Under-Lyme | width=5px; style=\"background:\" | | | | | |- |Newcastle upon Tyne Central | width=5px; style=\"background:red\"| | Labour hold | 15,692 | 45.9\\% | 0.6\\% (to LD) |- |Newcastle upon Tyne East | width=5px; style=\"background:red\"| | Labour hold | 17,043 | 45.0 | 4.6\\% (to LD) |- |Newcastle upon Tyne North | width=5px; style=\"background:red\"| | Labour hold | 17,950 | 40.8 | 4.5\\% (to LD) |- |Newport East | width=5px; style=\"background:\" | | | | | |- |Newport West | width=5px; style=\"background:\" | | | | | |- |Newry and Armagh | width=5px; style=\"background:\" | | | | | |- |Newton Abbot | width=5px; style=\"background:blue\" | | Conservative gain from Lib |20,774 |43.0\\% |5.8\\% |- |Norfolk Mid | width=5px; style=\"background:\" | | | | | |- |Norfolk North | width=5px; style=\"background:\" | | | | | |- |Norfolk North West | width=5px; style=\"background:\" | | | | | |- |Norfolk South | width=5px; style=\"background:\" | | | | | |- |Norfolk South West | width=5px; style=\"background:\" | | | | | |- |Normanton, Pontefract and Castleford | width=5px; style=\"background:\" | | | | | |- |Northampton North | width=5px; style=\"background:\" | | | | | |- |Northampton South | width=5px; style=\"background:\" | | | | | |- |Northamptonshire South | width=5px; style=\"background:blue\" | | Conservative hold | 33,081 | 55.2\\% | |- |Norwich North | width=5px; style=\"background:\" | | | | | |- |Norwich South | width=5px; style=\"background:\" | | | | | |- |Nottingham East | width=5px; style=\"background:\" | | | | | |- |Nottingham North | width=5px; style=\"background:\" | | | | | |- |Nottingham South | width=5px; style=\"background:\" | | | | | |- |Nuneaton | width=5px; style=\"background:\" | | | | | |- |Ochil and Perthshire South | width=5px; style=\"background:red\" | | Labour hold | 19,131 | 37.9\\% | |- |Ogmore | width=5px; style=\"background:\" | | | | | |- |Old Bexley and Sidcup | width=5px; style=\"background:\" | | | | | |- |Oldham East and Saddleworth | width=5px; style=\"background:\" | | | | | |- |Oldham West and Royton | width=5px; style=\"background:\" | | | | | |- |Orkney and Shetland | width=5px; style=\"background:\" | | | | | |- |Orpington | width=5px; style=\"background:\" | | | | | |- |Oxford East | width=5px; style=\"background:\" | | | | | |- |Oxford West and Abingdon | width=5px; style=\"background:\" | | | | | |- |Paisley and Renfrewshire North | width=5px; style=\"background:\" | | | | | |- |Paisley and Renfrewshire South | width=5px; style=\"background:\" | | | | | |- |Pendle | width=5px; style=\"background:\" | | | | | |- |Penistone and Stocksbridge | width=5px; style=\"background:\" | | | | | |- |Penrith and the Border | width=5px; style=\"background:\" | | | | | |- |Perth and Perthshire North | width=5px; style=\"background:#ff0\" | | SNP hold | 19,118 | 39.6\\% | 2.9\\% |- |Peterborough | width=5px; style=\"background:\" | | | | | |- |Plymouth Moor View | width=5px; style=\"background:red\" | | Labour hold |15,433 |37.2\\% |7.8\\% (to CON) |- |Plymouth Sutton and Devonport | width=5px; style=\"background:blue\" | | Conservative gain from Lab |15,050 |34.3\\% |6.9\\% |- |Pontypridd | width=5px; style=\"background:red\" | | Labour hold | 14,220 | 38.8\\% | |- |Poole | width=5px; style=\"background:\" | | | | | |- |Poplar and Limehouse | width=5px; style=\"background:\" | | | | | |- |Portsmouth North | width=5px; style=\"background:\" | | | | | |- |Portsmouth South | width=5px; style=\"background:\" | | | | | |- |Preseli Pembrokeshire | width=5px; style=\"background:\" | | | | | |- |Preston | width=5px; style=\"background:\" | | | | | |- |Pudsey | width=5px; style=\"background:\" | | | | | |- |Putney | width=5px; style=\"background:\" | | | | | |- |Rayleigh and Wickford | width=5px; style=\"background:\" | | | | | |- |Reading East | width=5px; style=\"background:\" | | | | | |- |Reading West | width=5px; style=\"background:\" | | | | | |- |Redcar | width=5px; style=\"background:#F9D616\"| | Liberal Democrat gain from Lab | 18,955 | 45.2\\% | 21.8\\% |- |Redditch | width=5px; style=\"background:\" | | | | | |- |Reigate | width=5px; style=\"background:\" | | | | | |- |Renfrewshire East | width=5px; style=\"background:\" | | | | | |- |Rhondda | width=5px; style=\"background:\" | | | | | |- |Ribble Valley | width=5px; style=\"background:\" | | | | | |- |Richmond Yorks | width=5px; style=\"background:\" | | | | | |- |Richmond Park | width=5px; style=\"background:\" | | | | | |- |Rochdale | width=5px; style=\"background:\" | | | | | |- |Rochester and Strood | width=5px; style=\"background:blue\" | | Conservative hold | 23,604 | 49.2\\% | |- |Rochford and Southend East | width=5px; style=\"background:\" | | | | | |- |Romford | width=5px; style=\"background:\" | | | | | |- |Romsey and Southampton North | width=5px; style=\"background:\" | | | | | |- |Ross, Skye and Lochaber | width=5px; style=\"background:\" | | | | | |- |Rossendale and Darwen | width=5px; style=\"background:\" | | | | | |- |Rother Valley | width=5px; style=\"background:\" | | | | | |- |Rotherham | width=5px; style=\"background:\" | | | | | |- |Rugby | width=5px; style=\"background:\" | | | | | |- |Ruislip, Northwood and Pinner | width=5px; style=\"background:\" | | | | | |- |Runnymede and Weybridge | width=5px; style=\"background:\" | | | | | |- |Rushcliffe | width=5px; style=\"background:\" | | | | | |- |Rutherglen and Hamilton West | width=5px; style=\"background:\" | | | | | |- |Rutland and Melton | width=5px; style=\"background:\" | | | | | |- |Saffron Walden | width=5px; style=\"background:\" | | | | | |- |St Albans | width=5px; style=\"background:\" | | | | | |- |St Austell and Newquay | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |20,189 |42.7\\% | |- |St Helens North | width=5px; style=\"background:red\" | | Labour hold | 23,041 | 51.7\\% | |- |St Helens South | width=5px; style=\"background:red\" | | Labour hold | 24,364 | 52.9\\% | |- |St Ives | width=5px; style=\"background:\" | | | | | |- |Salford and Eccles | width=5px; style=\"background:red\" | | Labour hold | 16,655 | 40.1\\% | |- |Salisbury | width=5px; style=\"background:\" | | | | | |- |Scarborough and Whitby | width=5px; style=\"background:blue\" | | Conservative hold | 21,108 | 42.8\\% | |- |Scunthorpe | width=5px; style=\"background:\" | | | | | |- |Sedgefield | width=5px; style=\"background:red\" | | Labour hold |18,141 |45.1\\% |11.6\\% (to CON) |- |Sefton Central | width=5px; style=\"background:\" | | | | | |- |Selby and Ainsty | width=5px; style=\"background:blue\" | | Conservative hold | 25,562 | 49.4\\% | |- |Sevenoaks | width=5px; style=\"background:\" | | | | | |- |Sheffield Brightside and Hillsborough | width=5px; style=\"background:red\" | | 'Labour hold | 21,400 | 55.0\\% | |- |Sheffield Central | width=5px; style=\"background:\"red\" | | Labour hold | 17,138 | 41.3\\% | |- |Sheffield Hallam | width=5px; style=\"background:\"#F9D616\" | | Liberal Democrat Hold | 27,324 | 53.4\\% | |- |Sheffield Heeley | width=5px; style=\"background:\" | | | | | |- |Sheffield South East | width=5px; style=\"background:red\" | | Labour hold | 20,169 | 48.7\\% | |- |Sherwood | width=5px; style=\"background:\" | | | | | |- |Shipley | width=5px; style=\"background:blue\" | | Conservative hold | 24,002 | 48.6\\% | |- |Shrewsbury and Atcham | width=5px; style=\"background:\" | | | | | |- |Shropshire North | width=5px; style=\"background:blue\" | | Conservative hold | 26,692 | 51.5\\% | |- |Sittingbourne and Sheppey | width=5px; style=\"background:\" | | | | | |- |Skipton and Ripon | width=5px; style=\"background:\" | | | | | |- |Sleaford and North Hykeham | width=5px; style=\"background:blue\" | | Conservative hold | 30,719 | 51.6\\% | |- |Slough | width=5px; style=\"background:\" | | | | | |- |Solihull | width=5px; style=\"background:#F9D616\" | | Liberal Democrat gain from Con | 23,635 | 42.9\\% | 0.3\\% |- |Somerset North | width=5px; style=\"background:\" | | | | | |- |Somerset North East | width=5px; style=\"background:\" | | | | | |- |Somerton and Frome | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |28,793 |47.5\\% | |- |South Holland and the Deepings | width=5px; style=\"background:\" | | | | | |- |South Ribble | width=5px; style=\"background:\" | | | | | |- |South Shields | width=5px; style=\"background:red\" | | Labour hold | 18,995 | 52.0\\% | |- |Southampton Itchen | width=5px; style=\"background:red\" | | Labour hold | 16,326 | 36.8\\% | |- |Southampton Test | width=5px; style=\"background:red\" | | Labour hold | 17,001 | 38.5\\% | |- |Southampton West | width=5px; style=\"background:\" | | | | | |- |Southport | width=5px; style=\"background:\" | | | | | |- |Spelthorne | width=5px; style=\"background:\" | | | | | |- |Stafford | width=5px; style=\"background:\" | | | | | |- |Staffordshire Moorlands | width=5px; style=\"background:\" | | | | | |- |Staffordshire South | width=5px; style=\"background:\" | | | | | |- |Stalybridge and Hyde | width=5px; style=\"background:\" | | | | | |- |Stevenage | width=5px; style=\"background:\" | | | | | |- |Stirling | width=5px; style=\"background:red\" | |Labour hold |19,558 |41.8\\% | |- |Stockport | width=5px; style=\"background:red\" | | Labour hold | 16,697 | 42.7\\% | |- |Stockton North | width=5px; style=\"background:\" | | | | | |- |Stockton South | width=5px; style=\"background:\" | | | | | |- |Stoke-on-Trent Central | width=5px; style=\"background:\" | | | | | |- |Stoke-on-Trent North | width=5px; style=\"background:\" | | | | | |- |Stoke-on-Trent South | width=5px; style=\"background:red\" | | Labour hold | 15,446 | 38.8\\% | |- |Stone | width=5px; style=\"background:\" | | | | | |- |Stourbridge | width=5px; style=\"background:\" | | | | | |- |Strangford | width=5px; style=\"background:\" | | | | | |- |Stratford-on-Avon | width=5px; style=\"background:\" | | | | | |- |Streatham | width=5px; style=\"background:\" | | | | | |- |Stretford and Urmston | width=5px; style=\"background:\" | | | | | |- |Stroud | width=5px; style=\"background:\" | | | | | |- |suffolk Central and Ipswitch North | width=5px; style=\"background:\" | | | | | |- |Suffolk Coastal | width=5px; style=\"background:\" | | | | | |- |Suffolk South | width=5px; style=\"background:\" | | | | | |- |Suffolk West | width=5px; style=\"background:\" | | | | | |- |Sunderland Central | width=5px; style=\"background:red\" | |Labour win (new seat) |19,495 |45.9\\% | |- |Surrey East (UK Parliament constituency) | width=5px; style=\"background:blue\" | | Conservative hold | 31,007 | 56.7\\% | 0.7\\% (to LD) |- |Surrey Heath | width=5px; style=\"background:blue\" | | Conservative hold | 31,326 | 57.6\\% | 4.6\\% |- |Surrey South West | width=5px; style=\"background:blue\" | | Conservative hold | 33,605 | 58.7\\% | 8.6\\% |- |Sussex Mid | width=5px; style=\"background:blue\" | |Conservative hold |28,329 |50.7\\% |0.3\\% |- |Sutton and Cheam | width=5px; style=\"background:\" | | | | | |- |Sutton Coldfield | width=5px; style=\"background:\" | | | | | |- |Swansea East | width=5px; style=\"background:\" | | | | | |- |Swansea West | width=5px; style=\"background:\" | | | | | |- |Swindon North | width=5px; style=\"background:\" | | | | | |- |Swindon South | width=5px; style=\"background:\" | | | | | |- |Tamworth | width=5px; style=\"background:\" | | | | | |- |Tatton | width=5px; style=\"background:\" | | | | | |- |Taunton Deane | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |28,531 |49.1\\% | |- |Telford | width=5px; style=\"background:\" | | | | | |- |Tewkesbury | width=5px; style=\"background:blue\" | | Conservative hold | 25,472 | 47.2\\% | |- |Thanet North | width=5px; style=\"background:\" | | | | | |- |Thanet South | width=5px; style=\"background:\" | | | | | |- |Thirsk and Malton | width=5px; style=\"background:black\" | | Delayed until 27 May'' | | | |- |Thornbury and Yate | width=5px; style=\"background:\" | | | | | |- |Thurrock | width=5px; style=\"background:\" | | | | | |- |Tiverton and Honiton | width=5px; style=\"background:blue\" | | Conservative hold | 27,614 | 50.3\\% | |- |Tonbridge and Malling | width=5px; style=\"background:\" | | | | | |- |Tooting | width=5px; style=\"background:\" | | | | | |- |Torbay | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |23,126 |47.0\\% | |- |Torfaen | width=5px; style=\"background:\" | | | | | |- |Totnes | width=5px; style=\"background:blue\" | | Conservative hold|21,940 |45.9\\% | |- |Tottenham | width=5px; style=\"background:\" | | | | | |- |Truro and Falmouth | width=5px; style=\"background:blue\" | | Conservative gain from Lib |20,349 |41.7\\% | |- |Tunbridge Wells | width=5px; style=\"background:\" | | | | | |- |Twickenham | width=5px; style=\"background:\" | | | | | |- |Tynemouth | width=5px; style=\"background:\" | | | | | |- |Tyneside North | width=5px; style=\"background:\" | | | | | |- |Tyrone West | width=5px; style=\"background:#060\" | |Sinn F\u00e9in hold|18,050 |48.4\\% | |- |Ulster Mid | width=5px; style=\"background:\" | | | | | |- |Upper Bann | width=5px; style=\"background:#c30\" | |Democratic Unionist hold|14,000 |33.8\\% | |- |Uxbridge and Ruiislip South | width=5px; style=\"background:\" | | | | | |- |Vale of Clwyd | width=5px; style=\"background:red\" | | Labour hold|15,017 |42.3\\% | |- |Vale of Glamorgan | width=5px; style=\"background:\" | | | | | |- |Vauxhall | width=5px; style=\"background:\" | | | | | |- |Wakefield | width=5px; style=\"background:\" | | | | | |- |Wallasey | width=5px; style=\"background:\" | | | | | |- |Walsall North | width=5px; style=\"background:red\" | | Labour hold | 13,385 | 37.0\\% | |- |Walsall South | width=5px; style=\"background:red\" | | Labour hold | 16,211 | 39.7\\% | |- |Walthamstow | width=5px; style=\"background:\" | | | | | |- |Wansbeck | width=5px; style=\"background:\" | | | | | |- |Wantage | width=5px; style=\"background:\" | | | | | |- |Warley | width=5px; style=\"background:red\" | | Labour hold| 20,240 | 52.9\\% | |- |Warrington North | width=5px; style=\"background:\" | | | | | |- |Warrington South | width=5px; style=\"background:\" | | | | | |- |Warwick and Leamington | width=5px; style=\"background:\" | | | | | |- |Warwickshire North | width=5px; style=\"background:\" | | | | | |- |Washington and Sunderland West | width=5px; style=\"background:red\" | |Labour win (new seat) |19,615 |53\\% | |- |Watford | width=5px; style=\"background:\" | | | | | |- |Waveney | width=5px; style=\"background:\" | | | | | |- |Wealden | width=5px; style=\"background:blue\" | | Conservative hold| 31,090 | 56.6\\% | |- |Weaver Vale | width=5px; style=\"background:\" | | | | | |- |Wellingborough | width=5px; style=\"background:blue\" | | Conservative hold| 24,918 | 48.2\\% | |- |Wells | width=5px; style=\"background:#F9D616\" | | Liberal Democrat gain from Con |24,560 |44.0\\% |3.6\\% |- |Welwyn Hatfield | width=5px; style=\"background:\" | | | | | |- |Wentworth and Dearne | width=5px; style=\"background:\" | | | | | |- |West Bromwich East | width=5px; style=\"background:\" | | | | | |- |West Bromwich West | width=5px; style=\"background:\" | | | | | |- |West Ham | width=5px; style=\"background:\" | | | | | |- |Westminster North | width=5px; style=\"background:red\" | | Labour hold| 17,377 | 43.9\\% | |- |Westmorland and Lonsdale | width=5px; style=\"background:\" | | | | | |- |Weston Super-Mare | width=5px; style=\"background:\" | | | | | |- |Wigan | width=5px; style=\"background:\" | | | | | |- |Wiltshire North | width=5px; style=\"background:\" | | | | | |- |Wiltshire South West | width=5px; style=\"background:\" | | | | | |- |Wimbledon | width=5px; style=\"background:\" | | | | | |- |Winchester | width=5px; style=\"background:\" | | | | | |- |Windsor | width=5px; style=\"background:\" | | | | | |- |Wirral South | width=5px; style=\"background:red\" | | Labour hold| 16,276 | 40.8\\% | |- |Wirral West | width=5px; style=\"background:blue\" | | Conservative hold| 16,726 | 42.5\\% | |- |Witham | width=5px; style=\"background:\" | | | | | |- |Witney | width=5px; style=\"background:\" | | | | | |- |Woking | width=5px; style=\"background:blue\" | | Conservative hold| 26,551 | 50.3\\% | 0.7\\% (to LD) |- |Wokingham | width=5px; style=\"background:blue\" | | Conservative hold| 28,754 | 52.7\\% | 4.7\\% |- |Wolverhampton North East | width=5px; style=\"background:\" | | | | | |- |Wolverhampton South East | width=5px; style=\"background:\" | | | | | |- |Wolverhampton South West | width=5px; style=\"background:\" | | | | | |- |Worcester | width=5px; style=\"background:\" | | | | | |- |Worcestershire Mid | width=5px; style=\"background:blue\" | | Conservative hold| 27,770 | 54.5\\% | |- |Worcestershire West | width=5px; style=\"background:\" | | | | | |- |Workington | width=5px; style=\"background:red\" | | Labour hold| 17,865 | 45.5\\% | |- |Worsley and Eccles South | width=5px; style=\"background:red\" | | Labour hold| 17,892 | 42.9\\% | |- |Worthing East and Shoreham | width=5px; style=\"background:blue\" | | Conservative hold| 23,458 | 48.5\\% | |- |Worthing West | width=5px; style=\"background:blue\" | | Conservative hold| 25,416 | 51.7\\% | |- |The Wreckin | width=5px; style=\"background:\" | | | | | |- |Wrexham | width=5px; style=\"background:red\" | | Labour hold| 12,161 | 36.9\\% | 5.7\\% |- |Wycombe | width=5px; style=\"background:blue\" | | Conservative hold| 23,423 | 48.6\\% | |- |Wyre and Preston North | width=5px; style=\"background:blue\" | | Conservative hold| 26,877 | 52.4\\% | 3.9\\% |- |Wyre Forest | width=5px; style=\"background:red\" | | Labour hold| 11,490 | 33.4\\% | |- |Wythenshawe and Sale East | width=5px; style=\"background:red\" | | Labour hold| 17,987 | 44.1\\% | |- |Yeovil | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold| 31,843 | 55.7\\% | 2.7\\% |- |Ynys Mon | width=5px; style=\"background:red\" | | Labour hold| 11,490 | 33.4\\% | 1.8\\% |- |York Central | width=5px; style=\"background:red\" | | Labour hold| 18,573 | 40.0\\% | 6.0\\% (to CON) |- |York Outer | width=5px; style=\"background:blue\" | | Conservative gain from Liberal Democrats | 22,912 | 43\\% | 3.7\\% |- |Yorkshire East | width=5px; style=\"background:blue\" | | Conservative hold''' 24,328 47.5\\% 0.1\\% (to LD)", "edit_actions": [{"type": "D", "before": "2010 general election", "after": null, "start_char_pos": 152, "end_char_pos": 173}, {"type": "D", "before": "Thirsk and Malton", "after": null, "start_char_pos": 239, "end_char_pos": 256}, {"type": "D", "before": "swing", "after": null, "start_char_pos": 683, "end_char_pos": 688}, {"type": "D", "before": "first past the post", "after": null, "start_char_pos": 948, "end_char_pos": 967}, {"type": "D", "before": "Labour Party", "after": null, "start_char_pos": 1186, "end_char_pos": 1198}, {"type": "D", "before": "Conservative Party", "after": null, "start_char_pos": 1230, "end_char_pos": 1248}, {"type": "D", "before": "hung parliament", "after": null, "start_char_pos": 1319, "end_char_pos": 1334}, {"type": "D", "before": "Liberal Democrats", "after": null, "start_char_pos": 1409, "end_char_pos": 1426}, {"type": "D", "before": "Gordon Brown", "after": null, "start_char_pos": 2016, "end_char_pos": 2028}, {"type": "D", "before": "Nick Clegg", "after": null, "start_char_pos": 2204, "end_char_pos": 2214}, {"type": "D", "before": "United Kingdom Independence Party, the British National Party", "after": null, "start_char_pos": 2457, "end_char_pos": 2518}, {"type": "A", "before": null, "after": "the ,", "start_char_pos": 2521, "end_char_pos": 2521}, {"type": "D", "before": "Green Party of England and Wales", "after": null, "start_char_pos": 2530, "end_char_pos": 2562}, {"type": "D", "before": "European Parliament", "after": null, "start_char_pos": 2599, "end_char_pos": 2618}, {"type": "D", "before": "House of Commons", "after": null, "start_char_pos": 2696, "end_char_pos": 2712}, {"type": "R", "before": "Caroline Lucas winning Brighton Pavilion", "after": "winning", "start_char_pos": 2812, "end_char_pos": 2852}, {"type": "D", "before": "Alliance Party", "after": null, "start_char_pos": 2879, "end_char_pos": 2893}, {"type": "R", "before": "Naomi Long taking Peter Robinson", "after": "taking", "start_char_pos": 2925, "end_char_pos": 2957}, {"type": "D", "before": "Conservative Party", "after": null, "start_char_pos": 3014, "end_char_pos": 3032}, {"type": "D", "before": "Labour Party", "after": null, "start_char_pos": 3059, "end_char_pos": 3071}, {"type": "D", "before": "Liberal Democrats", "after": null, "start_char_pos": 3097, "end_char_pos": 3114}, {"type": "D", "before": "Democratic Unionist Party", "after": null, "start_char_pos": 3138, "end_char_pos": 3163}, {"type": "D", "before": "Scottish National Party", "after": null, "start_char_pos": 3183, "end_char_pos": 3206}, {"type": "D", "before": "Sinn F\u00e9in", "after": null, "start_char_pos": 3225, "end_char_pos": 3234}, {"type": "D", "before": "Plaid Cymru", "after": null, "start_char_pos": 3253, "end_char_pos": 3264}, {"type": "D", "before": "Social Democratic", "after": null, "start_char_pos": 3284, "end_char_pos": 3301}, {"type": "D", "before": "Labour Party", "after": null, "start_char_pos": 3302, "end_char_pos": 3314}, {"type": "D", "before": "Alliance Party", "after": null, "start_char_pos": 3333, "end_char_pos": 3347}, {"type": "D", "before": "Green Party of England and Wales", "after": null, "start_char_pos": 3366, "end_char_pos": 3398}, {"type": "R", "before": "Labour Blue Conservative Yellow Liberal Democrats", "after": "Blue", "start_char_pos": 3441, "end_char_pos": 3490}, {"type": "A", "before": null, "after": "Yellow", "start_char_pos": 3498, "end_char_pos": 3498}, {"type": "R", "before": "Alliance Bright Yellow Scottish National", "after": "Bright Yellow", "start_char_pos": 3518, "end_char_pos": 3558}, {"type": "D", "before": "Green", "after": null, "start_char_pos": 3575, "end_char_pos": 3580}, {"type": "D", "before": "Plaid Cymru", "after": null, "start_char_pos": 3601, "end_char_pos": 3612}, {"type": "R", "before": "Social Democratic and Labour Dark Green Sinn F\u00e9in Brown Democratic Unionist Purple Conservatives and Unionists Grey Independent", "after": "Dark Green Brown Purple Grey", "start_char_pos": 3638, "end_char_pos": 3765}, {"type": "R", "before": "ConstituencyResultVotesShareSwingAberavon", "after": "ConstituencyResultVotesShareSwing", "start_char_pos": 3802, "end_char_pos": 3843}, {"type": "D", "before": "Aberconwy", "after": null, "start_char_pos": 3884, "end_char_pos": 3893}, {"type": "D", "before": "Aberdeen North", "after": null, "start_char_pos": 3941, "end_char_pos": 3955}, {"type": "D", "before": "Aberdeen South", "after": null, "start_char_pos": 3988, "end_char_pos": 4002}, {"type": "D", "before": "Aberdeenshire West and Kincardie", "after": null, "start_char_pos": 4035, "end_char_pos": 4067}, {"type": "R", "before": "Airdrie and ShottsLabour", "after": "Labour", "start_char_pos": 4119, "end_char_pos": 4143}, {"type": "D", "before": "Aldershot", "after": null, "start_char_pos": 4176, "end_char_pos": 4185}, {"type": "D", "before": "Aldridge-Brownhills", "after": null, "start_char_pos": 4232, "end_char_pos": 4251}, {"type": "D", "before": "Altrincham and Sale West", "after": null, "start_char_pos": 4302, "end_char_pos": 4326}, {"type": "D", "before": "Alyn and Deeside", "after": null, "start_char_pos": 4373, "end_char_pos": 4389}, {"type": "D", "before": "Amber Valley", "after": null, "start_char_pos": 4431, "end_char_pos": 4443}, {"type": "D", "before": "Angus", "after": null, "start_char_pos": 4491, "end_char_pos": 4496}, {"type": "R", "before": "Antrim EastDemocratic", "after": "Democratic", "start_char_pos": 4526, "end_char_pos": 4547}, {"type": "R", "before": "Antrim NorthDemocratic", "after": "Democratic", "start_char_pos": 4574, "end_char_pos": 4596}, {"type": "D", "before": "Antrim South", "after": null, "start_char_pos": 4623, "end_char_pos": 4635}, {"type": "D", "before": "Arfon", "after": null, "start_char_pos": 4690, "end_char_pos": 4695}, {"type": "D", "before": "Arundel and South Downs", "after": null, "start_char_pos": 4801, "end_char_pos": 4824}, {"type": "D", "before": "Ashfield", "after": null, "start_char_pos": 4860, "end_char_pos": 4868}, {"type": "D", "before": "Ashford", "after": null, "start_char_pos": 4907, "end_char_pos": 4914}, {"type": "D", "before": "Ashton Under Lyne", "after": null, "start_char_pos": 4958, "end_char_pos": 4975}, {"type": "D", "before": "Aylesbury", "after": null, "start_char_pos": 5014, "end_char_pos": 5023}, {"type": "D", "before": "Ayr, Carrick and Cumnock", "after": null, "start_char_pos": 5054, "end_char_pos": 5078}, {"type": "D", "before": "Ayrshire Central", "after": null, "start_char_pos": 5117, "end_char_pos": 5133}, {"type": "D", "before": "Ayrshire North and Arran", "after": null, "start_char_pos": 5163, "end_char_pos": 5187}, {"type": "R", "before": "BanburyConservative", "after": "Conservative", "start_char_pos": 5226, "end_char_pos": 5245}, {"type": "R", "before": "Banff and BuchanSNP", "after": "SNP", "start_char_pos": 5278, "end_char_pos": 5297}, {"type": "R", "before": "BarkingLabour", "after": "Labour", "start_char_pos": 5330, "end_char_pos": 5343}], "sents_char_pos": [0, 51, 85, 299, 535, 727, 975, 1109, 1336, 1579, 1870, 2130, 2344, 2730, 2854, 2966, 3077, 3119, 3167, 3517, 3574, 3600, 3637, 3883, 4157, 4570, 4619, 5050, 5311, 5329, 5351, 5395, 5444, 5499, 5565, 5640, 5685, 5722, 5773, 6253, 6302, 6349, 6392, 6458, 6514, 6577, 6657, 6709, 6802, 6922, 7014, 7088, 7136, 7230, 7273, 7331, 7371, 7449, 7485, 7540, 7594, 7644, 7714, 7756, 7814, 7866, 7913, 8008, 8070, 8179, 8215, 8288, 8356, 8428, 8470, 8560, 8646, 9110, 9480, 9520, 9611, 9664, 9746, 9841, 10008, 10189, 10229, 10284, 10311, 10386, 10434, 10495, 10550, 10622, 11081, 11176, 11316, 11410, 11520, 11570, 11617, 11713, 11816, 11918, 12027, 12125, 12227, 12277, 12330, 12433, 12490, 12539, 12642, 12708, 12743, 12803, 12902, 12952, 12994, 13059, 13103, 13212, 13267, 13324, 13388, 13450, 13522, 13581, 13640, 13707, 13746, 13804, 13832, 13889, 13954, 13987, 14072, 14131, 14202, 14270, 14355, 14421, 14487, 14545, 14603, 14674, 14735, 14786, 14821, 14911, 14976, 15047, 15106, 15168, 15224, 15305, 15392, 15451, 15508, 15564, 15620, 15681, 15782, 15844, 15911, 16001, 16107, 16179, 16244, 16297, 16357, 16421, 16481, 16543, 16597, 16664, 16727, 16780, 16861, 16912, 16942, 17000, 17045, 17110, 17183, 17238, 17276, 17347, 17420, 17487, 17548, 17600, 17678, 17737, 17795, 17838, 17921, 17975, 18071, 18133, 18192, 18279, 18344, 18438, 18498, 18563, 18620, 18677, 18730, 18784, 18836, 18904, 18960, 19062, 19112, 19164, 19233, 19289, 19346, 19407, 19482, 19555, 19609, 19678, 19773, 19831, 19936, 20003, 20070, 20138, 20195, 20248, 20322, 20380, 20498, 20599, 20669, 20732, 20785, 20852, 20910, 20972, 21028, 21081, 21134, 21213, 21279, 21326, 21445, 21552, 21673, 21729, 21824, 21892, 21948, 22016, 22085, 22156, 22225, 22279, 22355, 22450, 22509, 22609, 22666, 22777, 22834, 22889, 22948, 23007, 23064, 23152, 23206, 23266, 23328, 23432, 23520, 23573, 23664, 23733, 23790, 23888, 23957, 24025, 24081, 24152, 24207, 24266, 24377, 24439, 24509, 24569, 24655, 24718, 24810, 24867, 24957, 25019, 25116, 25188, 25255, 25307, 25388, 25452, 25512, 25582, 25648, 25704, 25758, 25832, 25898, 25990, 26056, 26123, 26180, 26235, 26341, 26400, 26467, 26556, 26614, 26664, 26703, 26806, 26864, 26922, 26973, 27067, 27121, 27187, 27252, 27321, 27378, 27437, 27492, 27566, 27627, 27713, 27800, 27867, 27934, 28000, 28088, 28186, 28249, 28302, 28373, 28439, 28508, 28576, 28654, 28717, 28780, 28834, 28889, 28957, 29032, 29146, 29259, 29359, 29419, 29483, 29543, 29650, 29711, 29777, 29838, 29904, 29988, 30053, 30118, 30188, 30285, 30346, 30409, 30473, 30537, 30593, 30667, 30750, 30819, 30894, 30964, 31031, 31088, 31147, 31219, 31297, 31375, 31429, 31503, 31573, 31647, 31740, 31806, 31858, 31924, 31992, 32030, 32112, 32180, 32244, 32308, 32377, 32432, 32486, 32540, 32609, 32669, 32729, 32783, 32897, 32952, 33017, 33072, 33133, 33195, 33256, 33312, 33380, 33490, 33545, 33621, 33692, 33761, 33822, 33879, 33932, 34009, 34080, 34138, 34214, 34280, 34342, 34399, 34469, 34573, 34665, 34749, 34815, 34901, 34971, 35065, 35123, 35175, 35227, 35291, 35384, 35469, 35564, 35658, 35766, 35834, 35919, 35974, 36079, 36143, 36252, 36317, 36391, 36481, 36537, 36657, 36724, 36790, 36856, 36909, 36969, 37030, 37125, 37218, 37311, 37368, 37426, 37482, 37553, 37620, 37688, 37745, 37801, 37884, 37975, 38037, 38107, 38175, 38243, 38325, 38384, 38442, 38507, 38564, 38633, 38687, 38769, 38832, 38893, 38953, 39019, 39080, 39143, 39253, 39360, 39460, 39562, 39626, 39686, 39746, 39807, 39868, 39924, 39978, 40039, 40105, 40135, 40193, 40289, 40349, 40414, 40508, 40564, 40632, 40737, 40792, 40846, 40942, 40996, 41086, 41152, 41258, 41316, 41373, 41435, 41494, 41581, 41639, 41753, 41814, 41865, 41905, 41961, 42018, 42074, 42135, 42225, 42313, 42369, 42424, 42478, 42570, 42634, 42704, 42770, 42848, 42937, 42992, 43047, 43141, 43203, 43291, 43409, 43477, 43543, 43609, 43665, 43730, 43830, 43895, 43948, 44011, 44079, 44136, 44194, 44249, 44309, 44396, 44485, 44539, 44593, 44699, 44812, 44884, 44956, 45013, 45079, 45181, 45239, 45339, 45441, 45537, 45631, 45686, 45775, 45880, 45980, 46081, 46163, 46267, 46361, 46462, 46587]} {"doc_id": "180311", "revision_depth": "2", "before_revision": "ConstituencyResultVotesShareSwing Labour hold 16,073 51.9\\% 5.3\\% (to LD) Conservative gain from Lab 10,734 35.8\\% 7.6\\% Labour hold 16,746 44.4\\% 1.0\\% Labour hold 15,722 36.5\\% 2.5\\% Liberal Democrat hold 17,362 38.4\\% 4.9\\% (to CON)Labour hold20,64958.2\\% 3.9\\% (to SNP) Conservative hold 21,203 46.7\\% 1.4\\% (to LD) Conservative hold 22,913 59.3\\% 12.0\\% (from LAB) Conservative hold 24,176 48.9\\% 0.8\\% (to LD) Labour hold 15,804 39.6\\% 8.1\\% (to CON) Conservative gain from Lab 17,746 38.6\\% 6.9\\% SNP hold 15,020 39.6\\% 2.2\\%Democratic Unionist hold13,99345.9\\%Democratic Unionist hold19,67246.4\\% Democratic Unionist hold 11,536 33.9\\% 3.6\\% (to UCU) Plaid Cymru gain from Lab9,38336.0\\%3.7\\% Argyle and Bute Liberal Democrat hold14,29231.6\\%2.7\\% (to CON) Conservative hold32,33357.8\\%3.0\\% Labour hold16,23933.7\\%17.2\\% (to LD) Conservative hold29,87854.1\\%2.3\\% (to LD) Labour hold18,60448.4\\%7.3\\% (to CON) Conservative hold27,73652.2\\% Labour hold21,63247.1\\%0.3\\% (to CON) Labour hold20,95047.7\\%1.5\\% Labour hold21,86047.4\\%2.3\\% (to SNP)Conservative hold29,703 52.8\\%5.9\\% (to CON)SNP hold15,86841.3\\%10.7\\% (to CON)Labour hold24,62854.3\\%1.7\\% Barnsley CentralLabour hold17,48747.3\\%4.2\\% (to LD) Barnsley EasyLabour hold18,05947.0\\%14.0\\% (to LD) Barrow and FurnessLabour hold21,22648.1\\%0.4\\% (to CON) Basildon and BillericayConservative hold21,98252.8\\%9.3\\% Basildon South and Thurrock EastConservative gain from Lab19,62443.9\\%7.5\\% BasingstokeConservative hold25,59050.5\\%4.6\\% BassrtlawLabour hold25,01850.5\\%0.7\\% (to CON) BathLiberal Democrat hold26,65156.6\\%5.8\\% Batley and Spen Labour hold 21,565 41.5\\% 2.5\\% (to CON) Battersea Conservative gain from Lab 23,103 47.3\\% 6.5\\% BeaconsfieldConservative hold32,05361.1\\%4.7\\% BeckanhamConservative hold27,59757.9\\%3.2\\% (to LD) BedfordConservative gain from Lab17,54638.9\\%5.5\\% Bedforsdhire MidConservative hold28,81552.5\\%2.3\\% Bedfordshire North EastConservative hold30,98955.8\\%2.6\\% Bedfordshire South WestConservative hold26,81552.8\\%0.7\\% Belfast EastAlliance gain from DUP12,83937.2\\%22.9\\% Belfast NorthDemocratic Unionist hold14,81240.0\\%5.0\\% (to SF) Belfast SouthSDLP hold14,02641.0\\%8.4\\% Belfast WestSinn F\u00e9in hold22,84071.1\\%1.1\\% Bermondsey and Old SouthwarkLiberal Democrat hold21,59048.4\\%1.6\\% Berwick-Upon-TweedLiberal Democrat hold16,80643.7\\%8.3\\% (to CON) Banff and BuchanLiberal Democrat hold22,23045.4\\%0.7\\% (to CON) Bethnal Green and BowBanff and BuchanConservative hold22,23045.4\\%1.6\\% Bexhill and BattleConservative hold28,14751.6\\%4.0\\% (to LD) Bexleyheath and CrayfordBirkenhead)Birmingham Edgbaston Labour hold 16,894 40.6\\% 0.5\\% (to CON) Birmingham ErdingtonBirmingham Hall GreenBirmingham Hodge HillBirmingham LadywoodLabour hold19,95055.7\\%2.5\\% Birmingham NorthfieldBirmingham Perry BarrBirmingham Selly Oak Labour hold 17,950 38.5\\% 4.8\\% (to CON) Birmingham YardleyBishop Auckland Labour hold 16,023 39.0\\% 7.2\\% (to CON) BlackburnLabour hold21,75147.8\\%1.1\\% Blackley and BroughtonBlackpool North and CleveleysConservative gain from Lab16,96441.8\\%6.9\\% Blackpool SouthLabour hold14,44941.16.2\\% (to CON) Blaenau GwentLabour gain from Ind 16,974 52.4\\% 29.2\\% Blaydon Labour hold 22,297 49.7\\% 3.3\\% Blyth ValleyBognor Regis and LittlehamptonConservative hold24,08751.4\\%2.3\\% BolsoverLabour hold21,99450.0\\%11.2\\% (to CON) Bolton North EastLabour hold19,87045.9\\%1.3\\% (to CON) Bolton South EastLabour hold18,78247.4\\%5.6\\% (to CON) Bolton West Labour hold 18,327 38.5\\% 4.9\\% (to CON) BootleBoston and SkegnessConservative hold18,78247.4\\%7.0\\% BosworthConservative hold23,13242.6\\%5.9\\% (to LD) Bournemouth EastConservative hold21,32048.4\\%1.8\\% Bournemouth West Conservative hold 18,808 45.1\\% 2.9\\% Bracknell Conservative hold 27,327 52.4\\% 1.0\\% (to LD) Bradford EastBradford SouthBradford WestBraintree Conservative hold 25,901 52.6\\% 6.7\\% Brecon and RadnorshireLiberal Democrat hold17,92946.2\\%0.3\\% (to CON) Brent CentralBrent NorthBrentford and IsleworthBrentwood and OngarConservative hold28,79256.9\\%3.1\\% BridgendLabour hold13,93136.3\\%6.0\\% (to CON) Bridgwater and Somerset West Conservative hold 24,675 45.3\\% 2.9\\% (to LD) Brigg and GooleConservative gain from Lab19,68044.9\\%9.8\\% Brighton KemptownBrighton Pavilion Green gain from Lab 16,238 31.3\\% 8.4\\% Bristol EastLabour hold16,47136.6\\%4.5\\% (to CON) Bristol North WestBristol SouthBristol WestLiberal Democrat hold26,59348.0\\%9.0\\% BroadlandBromley and ChislehurstBromsgroveBroxbourneConservative hold26,84458.8\\%6.4\\% BroxtoweConservative gain from Lab20,58539.0\\%2.6\\% BuckinghamBurnleyLiberal Democrat gain from Lab14,93235.7\\%9.6\\% BurtonConservative gain from Lab22,18844.5\\%8.7\\% Bury NorthBury SouthBury St EdmundsConservative hold27,89947.5\\%2.8\\% CaerphillyLabour hold17,37744.9\\%6.5\\% (to CON) Caithness, Sutherland and Easter RossLiberal Democrat hold11,90741.4\\%6.4\\% (to LAB) Calder ValleyCamberwell and PeckhamCambourne and Redruth Conservative gain from Lib37.6\\%15,9695.2\\% Cambridge Liberal Democrat hold 19,621 39.1\\% 7.0\\% (to CON) Cambridgeshire North EastConservative hold26,86251.4\\%0.8\\% Cambridgeshire North WestConservative hold29,42550.05\\%2.6\\% Cambridgeshire SouthConservative hold27,99547.4\\%2.5\\% (to LD) Cambridgeshire South EastConservative hold27,62948.0\\%2.7\\% (to LD) Cannock ChaseConservative gain from Lab18,27140.1\\%14.0\\% Canterbury Conservative hold22,05044.8\\%5.4\\% (to LD) Cardiff CentralCardiff NorthCardiff South and Penarth Labour hold 17,262 38.9\\% 6.0\\% (to CON) Cardiff West Labour hold 16,893 41.2\\% 5.3\\% (to CON) Carlisle Carmarthen East and Dinefwr Plaid Cymru hold 13,546 35.6\\% 4.2\\% (to LAB) Carmarthen West and Pembrokeshire South Conservative gain from Lab 16,649 41.1\\% 6.9\\% Carshalton and WallingtonCastle PointCeredigionCharnwoodChatham and AylesfordCheadleChelmsfordChelsea and FulhamCheltenhamChelsham and AmershamChester, City ofChesterfieldChichesterChingford and Woodford GreenChippenhamChipping BarnetChorleyChristchurchCities of London and WestminsterClactonCleethorpesConservative gain from Lab18,93942.1\\%7.8\\% Clwyd South Labour hold13,31138.4\\%5.8\\% (to CON) Clwyd West Conservative hold 15,833 41.5\\% 8.4\\% Coatbridge, Chryson and BellshillColchesterColne ValleyCongleton Conservative hold 23,250 45.8\\% 2.3\\% (to LD) Copeland Labour hold 19,699 46.0\\% 2.1\\% (to CON) Corby Conservative gain from Lab 22,886 42.2\\% 3.4\\% Cornwall North Liberal Democrat hold22,51248.1\\%0.3\\% (to CON) Cornwall South East Conservative gain from Lib22,39045.1\\%9.1\\% The Cotswolds Conservative hold 29,075 53.0\\% 1.1\\% Coventry North East Labour hold 21,384 49.3\\% 5.5\\% (to CON) Coventry North West Labour hold 19,936 42.8\\% 3.9\\% (to CON) Coventry South Labour hold 19,197 41.8\\% 3.4\\% (to CON) Crawley Conservative gain from Lab 21,264 44.8\\% 6.3\\% Crewe and Nantwich Conservative gain from Lab 23,420 45.8\\% 13.7\\% Croydon Central Conservative gain from Lab | 19,657 | 39.5\\% | 3.3\\% |- | Croydon North | width=5px; style=\"background:red\"| | Labour hold | 28,949 | 56.0\\% | 0.3\\% |- | Croydon South | width=5px; style=\"background:blue\"| | Conservative hold | 28,684 | 50.9\\% | 1.7\\% (to LD) |- | Cumbernauld, Kilsyth and Kirkintilloch East | width=5px; style=\"background:red\"| | Labour hold | 23,549 | 57.2\\% | 1.9\\% |- | Cynon Valley | width=5px; style=\"background:red\"| | Labour hold | 15,681 | 52.5\\% | 8.6\\% (to PC) |- | Dagenham and Rainham | width=5px; style=\"background:red\"| |Labour hold |17,813 |40.3\\% |4.9\\% (to CON) |- | Darlington | width=5px; style=\"background:red\"| | Labour hold |16,891 |39.4\\% |9.1\\% (to CON) |- | Dartford | width=5px; style=\"background:blue\"| |Conservative gain from Lab |24,428 |48.8\\% |11.6\\% |- | Daventry | width=5px; style=\"background:blue\"| | Conservative hold | 29,252 | 56.5\\% | 0.7\\% (to LD) |- | Delyn | width=5px; style=\"background:red\"| | Labour hold | 15,083 | 40.8\\% | 6.7\\% (to CON) |- | Denton and Reddish | width=5px; style=\"background:red\"| |Labour hold |19,191 |51.0\\% |6.2\\% (to CON) |- | Derby North | width=5px; style=\"background:red\"| | Labour hold | 14,896 | 33.0\\% | 7.4\\% (to CON) |- | Derby South | width=5px; style=\"background:red\"| |Labour hold |17,851 |43.3\\% |9.3\\% (to CON) |- | Derbyshire Dales | width=5px; style=\"background:blue\"| | Conservative hold | 24,378 | 52.1\\% | 3.7\\% |- | Derbyshire Mid | width=5px; style=\"background:blue\"| |Conservative hold |22,877 |48.3\\% |5.7\\% |- | Derbyshire North East | width=5px; style=\"background:red\"| |Labour hold |17,948 |38.2\\% |8.6\\% (to CON) |- | Derbyshire South | width=5px; style=\"background:blue\"| |Conservative gain from Lab |22,935 |45.5\\% |9.8\\% |- | Devizes | width=5px; style=\"background:\"| | | | | |- | Devon Central | width=5px; style=\"background:blue\"| | Conservative hold | 27,737 | 51.5\\% | 6.1\\% |- | Devon East | width=5px; style=\"background:blue\"| | Conservative hold |48.3\\% |25,662 | |- | Devon North | width=5px; style=\"background:#F9D616\"| | Liberal Democrat hold |24,305 |47.4\\% |0.3\\% |- | Devon South West | width=5px; style=\"background:blue\"| | Conservative hold |27,908 |56.0\\% |5.6\\% |- | Devon West and Torridge | width=5px; style=\"background:\"| | | | | |- | Dewsbury | width=5px; style=\"background:\"| | | | | |- | Don Valley | width=5px; style=\"background:\"| | | | | |- | Doncaster Central | width=5px; style=\"background:\"| | | | | |- | Doncaster North | width=5px; style=\"background:\"| | | | | |- | Doset Mid and Poole North | width=5px; style=\"background:\"| | | | | |- | Dorset North | width=5px; style=\"background:\"| | | | | |- | Dorset South | width=5px; style=\"background:blue\"| | Conservative gain from Lab |22,667 |45.1\\% |9.3\\% |- | Dorset West | width=5px; style=\"background:blue\"| | Conservative hold |27,287 |47.6\\% | |- | Dover | width=5px; style=\"background:\"| | | | | |- | Down North | width=5px; style=\"background:grey\"| |Independent gain from UCU |21,181 |63.3\\% | |- | Down South | width=5px; style=\"background:#3c3\" | |SDLP hold |20,648 |48.5\\% | |- | Dudley North | width=5px; style=\"background:\"| | | | | |- | Dudley South | width=5px; style=\"background:\"| | | | | |- | Dulwich and West Norwood | width=5px; style=\"background:\"| | | | | |- | Dumfries and Galloway | width=5px; style=\"background:\"| | | | | |- | Dunfiesshire, Clydesdale and Tweeddale | width=5px; style=\"background:\"| | | | | |- | Dunbartonshire East | width=5px; style=\"background:\"| | | | | |- | Dunbartonshire West | width=5px; style=\"background:\"| | | | | |- | Dundee East | width=5px; style=\"background:\"| | | | | |- | Dundee West | width=5px; style=\"background:\"| | | | | |- | Dunfermine and Fife West | width=5px; style=\"background:\"| | | | | |- | City of Durham | width=5px; style=\"background:red\"| | Labour hold |20,496 |44.3\\% | |- | Durham North | width=5px; style=\"background:red\"| |Labour hold |20,698 |50.5\\% | |- | Durham North West | width=5px; style=\"background:\"| | | | | |- | Dwyfor Meirionnydd | width=5px; style=\"background:\"| | | | | |- | Ealing Central and Acton | width=5px; style=\"background:\"| | | | | |- | Ealing North | width=5px; style=\"background:\"| | | | | |- | Ealing Southall | width=5px; style=\"background:\"| | | | | |- | Easington | width=5px; style=\"background:red\"| |Labour hold |20,579 |58.9\\% | |- | East Ham | width=5px; style=\"background:\"| | | | | |- | East Kilbride, Strathaven and Lesmahagow | width=5px; style=\"background:\"| | | | | |- | East Lothian | width=5px; style=\"background:\"| | | | | |- | Eastbourne | width=5px; style=\"background:\"| | | | | |- | Eastleigh | width=5px; style=\"background:\"| | | | | |- | Eddisbury | width=5px; style=\"background:\"| | | | | |- | Edinburgh East | width=5px; style=\"background:red\"| | Labour hold | 17,305 | 43.4\\% | |- | Edinburgh North and Leith | width=5px; style=\"background:\"| | | | | |- | Edinburgh South | width=5px; style=\"background:\"| | | | | |- | Edinburgh South West | width=5px; style=\"background:red\"| | Labour hold | 19,473 | 42.8\\% | |- | Edinburgh West | width=5px; style=\"background:#F9D616\"| | Liberal Democrat hold | 16,684 | 35.9\\% | -11.4\\% |- | Edmonton | width=5px; style=\"background:\"| | | | | |- | Ellesmere Port and Neston | width=5px; style=\"background:\"| | | | | |- | Elmet and Rothwell | width=5px; style=\"background:\"| | | | | |- | Eltham | width=5px; style=\"background:\"| | | | | |- | Enfield North | width=5px; style=\"background:\"| | | | | |- | Enfield Southgate | width=5px; style=\"background:\"| | | | | |- | Epping Forest | width=5px; style=\"background:\"| | | | | |- | Epsom and Ewell | width=5px; style=\"background:\"| | | | | |- | Erewash | width=5px; style=\"background:\"| | | | | |- | Erith and Thameshead | width=5px; style=\"background:\"| | | | | |- | Esher and Walton | width=5px; style=\"background:\"| | | | | |- | Exeter | width=5px; style=\"background:red\"| | Labour hold |19,942 |38.2\\% | |- | Falkirk | width=5px; style=\"background:red\"| | Labour hold |23,207 |45.7\\% | |- | Fareham | width=5px; style=\"background:blue\"| | Conservative hold |30,037 |55.3\\% | |- | Faversham and Kent Mid | width=5px; style=\"background:\"| | | | | |- | Feltham and Heston | width=5px; style=\"background:\"| | | | | |- | Fermanagh and South Tyrone | width=5px; style=\"background:#060\"| | Sinn F\u00e9in hold |21,304 |45.5\\% | |- | Fife North East | width=5px; style=\"background:\"| | | | | |- | Filton and Bradley Stoke | width=5px; style=\"background:\"| | | | | |- | Finchley and Golders Green | width=5px; style=\"background:\"| | | | | |- | Folkestone and Hythe | width=5px; style=\"background:\"| | | | | |- | Forest of Dean | width=5px; style=\"background:\"| | | | | |- | Foyle | width=5px; style=\"background:#3c3\" | |SDLP hold |16,922 |44.7\\% | |- | Flyde | width=5px; style=\"background:\"| | | | | |- | Gainsborough | width=5px; style=\"background:blue\"| | Conservative hold |24,266 |49.3\\% | |- | Garston and Halewood | width=5px; style=\"background:red\"| | Labour hold |25,493 |59.5\\% | |- | Gateshead | width=5px; style=\"background:\"| | | | | |- | Gedling | width=5px; style=\"background:red\"| | Labour hold |19,821 |41.1\\% | |- | Gillingham and Rainham | width=5px; style=\"background:\"| | | | | |- | Glasgow Central | width=5px; style=\"background:\"| | | | | |- | Glasgow East | width=5px; style=\"background:red\"| | Labour hold |19,797 |61.6\\% | |- | Glasgow North | width=5px; style=\"background:\"| | | | | |- | Glasgow North East | width=5px; style=\"background:red\"| | Labour hold | 20,100 | 68.3\\% | |- | Glasgow North West | width=5px; style=\"background:\"| | | | | |- | Glasgow South | width=5px; style=\"background:\"| | | | | |- | Glasgow South West | width=5px; style=\"background:\"| | | | | |- | Glenrothes | width=5px; style=\"background:\"| | | | | |- | Gloucester | width=5px; style=\"background:\"| | | | | |- | Gordon | width=5px; style=\"background:\"| | | | | |- | Gosport | width=5px; style=\"background:\"| | | | | |- | Gower | width=5px; style=\"background:\"| | | | | |- | Grantham and Stamford | width=5px; style=\"background:\"| | | | | |- | Gravesham | width=5px; style=\"background:blue\"| | Conservative hold | 22,956 | 48.5\\% | 9.1\\% |- | Great Grimsby | width=5px; style=\"background:red\"| |Labour hold |10,777 |32.7\\% |10.5\\% (to CON) |- | Great Yarmouth | width=5px; style=\"background:\"| | | | | |- | Greenwich and Woolwich | width=5px; style=\"background:\"| | | | | |- | Guildford | width=5px; style=\"background:blue\"| |Conservative hold |29,618 |53.3\\% |6.9\\% |- | Hackney North and Stoke Newington | width=5px; style=\"background:\"| | | | | |- | Hackney South and Shoreditch | width=5px; style=\"background:\"| | | | | |- | Halesowen and Rowley Regis | width=5px; style=\"background:\"| | | | | |- | Halifax | width=5px; style=\"background:\"| | | | | |- | Haltemprice and Howden | width=5px; style=\"background:blue\"| | Conservative hold | 24,486 | 50.2\\% | 6.6\\% |- | Halton | width=5px; style=\"background:\"| | | | | |- | Hammersmith | width=5px; style=\"background:red\"| | Labour hold | 20,810 | 43.9\\% | 0.5\\% (to CON) |- | Hampshire East | width=5px; style=\"background:\"| | | | | |- | Hampshire North East | width=5px; style=\"background:\"| | | | | |- | Hampshire North West | width=5px; style=\"background:\"| | | | | |- | Hampstead and Kilburn | width=5px; style=\"background:\"| | | | | |- | Harborough | width=5px; style=\"background:\"| | | | | |- | Harlow | width=5px; style=\"background:\"| | | | | |- | Harrogate and Knaresborough | width=5px; style=\"background:\"| | | | | |- | Harrow East | width=5px; style=\"background:blue\"| | Conservative gain from Lab | 21,435 | 44.7\\% | 7.0\\% (to CON) |- | Harrow West | width=5px; style=\"background:red\"| | Labour hold | 20,111 | 43.6\\% | 5.7\\% (to CON) |- | Hartlepool | width=5px; style=\"background:\"| | | | | |- | Harwich and Essex North | width=5px; style=\"background:\"| | | | | |- | Hastings and Rye | width=5px; style=\"background:\"| | | | | |- | Havant | width=5px; style=\"background:\"| | | | | |- | Hayes and Harlington | width=5px; style=\"background:\"| | | | | |- | Hazel Grove | width=5px; style=\"background:\"| | | | | |- | Hemel Hempstead | width=5px; style=\"background:\"| | | | | |- | Hemsworth | width=5px; style=\"background:\"| | | | | |- | Hendon | width=5px; style=\"background:\"| | | | | |- | Henley | width=5px; style=\"background:\"| | | | | |- | Hereford and Herefordshire South | width=5px; style=\"background:blue\"| |Conservative gain from Lib |22,366 |46.2\\% |3.8\\% |- | Herefordshire North | width=5px; style=\"background:blue\"| | Conservative hold | 24,631 | 51.8\\% | 3.8\\% (to LD) |- | Hertford and Stortford | width=5px; style=\"background:blue\"| | Conservative hold | 29,810 | 53.8\\% | |- | Hertfordshire North East | width=5px; style=\"background:blue\"| | Conservative hold | 26,995 | 53.5\\% | 1.9\\% (to LD) |- | Hertfordshire South West | width=5px; style=\"background:\"| | | | | |- | Hertsmere | width=5px; style=\"background:blue\"| | Conservative hold | 26,476 | 56.0\\% | 5.6\\% |- | Hexham | width=5px; style=\"background:\"| | | | | |- | Heywood and Middleton | width=5px; style=\"background:\"| | | | | |- | High Peak | width=5px; style=\"background:\"| | | | | |- | Hitchin and Harpenden | width=5px; style=\"background:\"| | | | | |- | Holborn and St Pancras | width=5px; style=\"background:\"| | | | | |- | Hornchurch and Upminster | width=5px; style=\"background:\"| | | | | |- | Hornsey and Wood Green | width=5px; style=\"background:\"| | | | | |- | Horsham | width=5px; style=\"background:\"| | | | | |- | Houghton and Sunderland South | width=5px; style=\"background:red\"| | Labour hold | 19,137 | 50.3\\% | 8.4\\% (to CON) |- | Hove | width=5px; style=\"background:\"| | | | | |- | Huddersfield | width=5px; style=\"background:red\"| | Labour hold | 15,725 | 38.8\\% | 7.1\\% (to CON) |- | Hull East | width=5px; style=\"background:\"| | | | | |- | Hull North | width=5px; style=\"background:red\"| | Labour hold | 13,044 | 39.2\\% | 12.2\\% (to LD) |- | Hull West and Hessle | width=5px; style=\"background:\"| | | | | |- | Huntingdon | width=5px; style=\"background:\"| | | | | |- | Hyndburn | width=5px; style=\"background:\"| | | | | |- | Ilford North | width=5px; style=\"background:\"| | | | | |- | Ilford South | width=5px; style=\"background:\"| | | | | |- | Inverclyde | width=5px; style=\"background:\"| | | | | |- | Inverness, Nairn, Badenoch and Strathspey | width=5px; style=\"background:\"| | | | | |- | Ipswich | width=5px; style=\"background:\"| | | | | |- | Isle of Wight | width=5px; style=\"background:\"| | | | | |- | Islington North | width=5px; style=\"background:red\"| | Labour hold | 24,276 | 54.5\\% | |- | Islington South and Finsbury | width=5px; style=\"background:red\"| | Labour hold | 18,407 | 42.3\\% | 3.3\\% |- | Islwyn | width=5px; style=\"background:\"| | | | | |- | Jarrow | width=5px; style=\"background:red\" | | Labour hold | 20,910 | 53.9\\% | 6.4\\% |- | Keighley | width=5px; style=\"background:\"| | | | | |- | Kenilworth and Southam | width=5px; style=\"background:\"| | | | | |- | Kensington | width=5px; style=\"background:blue\"| | Conservative hold | 17,595 | 50.1\\% | 5.2\\% |- | Kettering | width=5px; style=\"background:\"| | | | | |- | Kilmarnock and Loudoun | width=5px; style=\"background:\"| | | | | |- | Kingston and Surbiton | width=5px; style=\"background:\"| | | | | |- | Kingswood | width=5px; style=\"background:\"| | | | | |- | Kilcaldy and Cowdenbeath | width=5px; style=\"background:\"| | | | | |- | Knowsley | width=5px; style=\"background:\"| | | | | |- | Lagan Valley | width=5px; style=\"background:#c30\"| |Democratic Unionist hold |18,199 |49.8\\% | |- | Lanark and Hamilton East | width=5px; style=\"background:\"| | | | | |- | Lancashire West | width=5px; style=\"background:\"| | | | | |- | Lancaster and Fleetwood | width=5px; style=\"background:\"| | | | | |- | Leeds Central | width=5px; style=\"background:red\"| | Labour hold | 18,434 | 49.3\\% | |- | Leeds East | width=5px; style=\"background:\"| | | | | |- | Leeds North East | width=5px; style=\"background:red\"| | Labour hold | 20,287 | 42.7\\% | |- | Leeds North West | width=5px; style=\"background:\"| | | | | |- | Leeds West | width=5px; style=\"background:red\"| | Labour hold | 16,389 | 42.3\\% | |- | Leicester East | width=5px; style=\"background:\"| | | | | |- | Leicester South | width=5px; style=\"background:blue\"| | Conservative hold | 27,000 | 49.5\\% | |- | Leicester West | width=5px; style=\"background:\"| | | | | |- | Leicestershire North West | width=5px; style=\"background:\"| | | | | |- | Leicestershire South | width=5px; style=\"background:\"| | | | | |- | Leigh | width=5px; style=\"background:red\"| | Labour hold | 24,295 | 51.3\\% | |- | Lewes | width=5px; style=\"background:\"| | | | | |- | Lewisham Deptford | width=5px; style=\"background:\"| | | | | |- | Lewisham East | width=5px; style=\"background:\"| | | | | |- | Lewisham West and Penge | width=5px; style=\"background:\"| | | | | |- | Leyton and Wanstead | width=5px; style=\"background:\"| | | | | |- | Lichfield | width=5px; style=\"background:\"| | | | | |- | Lincoln | width=5px; style=\"background:\"| | | | | |- | Linlithgow and Falkirk East | width=5px; style=\"background:\"| | | | | |- | Liverpool Riverside | width=5px; style=\"background:red\"| | Labour hold | 22,998 | 59.3\\% | |- | Liverpool Walton | width=5px; style=\"background:\"| | | | | |- | Liverpool Wavertree | width=5px; style=\"background:\"| | | | | |- | Liverpool West Derby | width=5px; style=\"background:\"| | | | | |- | Livingston | width=5px; style=\"background:\"| | | | | |- | Llanelli | width=5px; style=\"background:red\"| | Labour hold | 15,916 | 42.5\\% | 4.0\\% (to PC) |- | Londonderry East | width=5px; style=\"background:\"| | | | | |- | Loughborough | width=5px; style=\"background:\"| | | | | |- | Louth and Horncastle | width=5px; style=\"background:blue\"| | Conservative hold | 25,065 | 49.6\\% | |- | Ludlow | width=5px; style=\"background:\"| | | | | |- | Luton North | width=5px; style=\"background:red\"| |Labour hold |21,192 |49.3\\% |0.5\\% |- | Luton South | width=5px; style=\"background:red\"| | Labour hold | 14,725 | 34.9\\% | 4.6\\% (to CON) |- | Macclesfield | width=5px; style=\"background:\" | | | | | |- | Maidenhead | width=5px; style=\"background:blue\" | |Conservative hold |31,937 |59.5\\% |7.8\\% |- | Maidstone and the Weald | width=5px; style=\"background:blue\" | | Conservative hold | 23,491 | 48.0\\% | |- | Makerfield | width=5px; style=\"background:\" | | | | | |- | Maldon | width=5px; style=\"background:\" | | | | | |- | Manchester Central | width=5px; style=\"background:\" | | | | | |- | Manchester Gorton | width=5px; style=\"background:\" | | | | | |- | Manchester Withington | width=5px; style=\"background:\" | | | | | |- | Mansfield | width=5px; style=\"background:\" | | | | | |- | Meon Valley | width=5px; style=\"background:\" | | | | | |- | Meriden | width=5px; style=\"background:\" | | | | | |- | Merthyr Tydfil and Rhymney | width=5px; style=\"background:\" | | | | | |- | Middlesbrough | width=5px; style=\"background:\" | | | | | |- | Middlesbrough South and Cleveland East | width=5px; style=\"background:red\" | | Labour hold | 18,138 | 39.2\\% | |- | Midlothian | width=5px; style=\"background:\" | | | | | |- | Milton Keynes North | width=5px; style=\"background:\" | | | | | |- | Milton Keynes South | width=5px; style=\"background:\" | | | | | |- | Mitcham and Morden | width=5px; style=\"background:red\" | | Labour hold | 24,722 | 56.4\\% | |- | Mole Valley | width=5px; style=\"background:blue\" | | Conservative hold | 31,263 | 57.5\\% | 2.3\\% |- | Monmouth | width=5px; style=\"background:\" | | | | | |- | Montgomeryshire | width=5px; style=\"background:\" | | | | | |- | Moray | width=5px; style=\"background:\" | | | | | |- | Morecambe and Lunesdale | width=5px; style=\"background:\" | | | | | |- | Morley and Outwood | width=5px; style=\"background:\" | | | | | |- | Motherwell and Wishaw | width=5px; style=\"background:\" | | | | | |- | Na H-Eileanan An Iar | width=5px; style=\"background:#ff0\" | | SNP hold |6,723 |45.75\\% | |- | Neath | width=5px; style=\"background:\" | | | | | |- | New Forest East | width=5px; style=\"background:\" | | | | | |- | New Forest West | width=5px; style=\"background:\" | | | | | |- | Newark | width=5px; style=\"background:\" | | | | | |- | Newbury | width=5px; style=\"background:\" | | | | | |- | Newcastle-Under-Lyme | width=5px; style=\"background:\" | | | | | |- | Newcastle upon Tyne Central | width=5px; style=\"background:red\"| | Labour hold | 15,692 | 45.9\\% | 0.6\\% (to LD) |- | Newcastle upon Tyne East | width=5px; style=\"background:red\"| | Labour hold | 17,043 | 45.0 | 4.6\\% (to LD) |- | Newcastle upon Tyne North | width=5px; style=\"background:red\"| | Labour hold | 17,950 | 40.8 | 4.5\\% (to LD) |- | Newport East | width=5px; style=\"background:\" | | | | | |- | Newport West | width=5px; style=\"background:\" | | | | | |- | Newry and Armagh | width=5px; style=\"background:\" | | | | | |- | Newton Abbot | width=5px; style=\"background:blue\" | | Conservative gain from Lib |20,774 |43.0\\% |5.8\\% |- | Norfolk Mid | width=5px; style=\"background:\" | | | | | |- | Norfolk North | width=5px; style=\"background:\" | | | | | |- | Norfolk North West | width=5px; style=\"background:\" | | | | | |- | Norfolk South | width=5px; style=\"background:\" | | | | | |- | Norfolk South West | width=5px; style=\"background:\" | | | | | |- | Normanton, Pontefract and Castleford | width=5px; style=\"background:\" | | | | | |- | Northampton North | width=5px; style=\"background:\" | | | | | |- | Northampton South | width=5px; style=\"background:\" | | | | | |- | Northamptonshire South | width=5px; style=\"background:blue\" | | Conservative hold | 33,081 | 55.2\\% | |- | Norwich North | width=5px; style=\"background:\" | | | | | |- | Norwich South | width=5px; style=\"background:\" | | | | | |- | Nottingham East | width=5px; style=\"background:\" | | | | | |- | Nottingham North | width=5px; style=\"background:\" | | | | | |- | Nottingham South | width=5px; style=\"background:\" | | | | | |- | Nuneaton | width=5px; style=\"background:\" | | | | | |- | Ochil and Perthshire South | width=5px; style=\"background:red\" | | Labour hold | 19,131 | 37.9\\% | |- | Ogmore | width=5px; style=\"background:\" | | | | | |- | Old Bexley and Sidcup | width=5px; style=\"background:\" | | | | | |- | Oldham East and Saddleworth | width=5px; style=\"background:\" | | | | | |- | Oldham West and Royton | width=5px; style=\"background:\" | | | | | |- | Orkney and Shetland | width=5px; style=\"background:\" | | | | | |- | Orpington | width=5px; style=\"background:\" | | | | | |- | Oxford East | width=5px; style=\"background:\" | | | | | |- | Oxford West and Abingdon | width=5px; style=\"background:\" | | | | | |- | Paisley and Renfrewshire North | width=5px; style=\"background:\" | | | | | |- | Paisley and Renfrewshire South | width=5px; style=\"background:\" | | | | | |- | Pendle | width=5px; style=\"background:\" | | | | | |- | Penistone and Stocksbridge | width=5px; style=\"background:\" | | | | | |- | Penrith and the Border | width=5px; style=\"background:\" | | | | | |- | Perth and Perthshire North | width=5px; style=\"background:#ff0\" | | SNP hold | 19,118 | 39.6\\% | 2.9\\% |- | Peterborough | width=5px; style=\"background:\" | | | | | |- | Plymouth Moor View | width=5px; style=\"background:red\" | | Labour hold |15,433 |37.2\\% |7.8\\% (to CON) |- | Plymouth Sutton and Devonport | width=5px; style=\"background:blue\" | | Conservative gain from Lab |15,050 |34.3\\% |6.9\\% |- | Pontypridd | width=5px; style=\"background:red\" | | Labour hold | 14,220 | 38.8\\% | |- | Poole | width=5px; style=\"background:\" | | | | | |- | Poplar and Limehouse | width=5px; style=\"background:\" | | | | | |- | Portsmouth North | width=5px; style=\"background:\" | | | | | |- | Portsmouth South | width=5px; style=\"background:\" | | | | | |- | Preseli Pembrokeshire | width=5px; style=\"background:\" | | | | | |- | Preston | width=5px; style=\"background:\" | | | | | |- | Pudsey | width=5px; style=\"background:\" | | | | | |- | Putney | width=5px; style=\"background:\" | | | | | |- | Rayleigh and Wickford | width=5px; style=\"background:\" | | | | | |- | Reading East | width=5px; style=\"background:\" | | | | | |- | Reading West | width=5px; style=\"background:\" | | | | | |- | Redcar | width=5px; style=\"background:#F9D616\"| | Liberal Democrat gain from Lab | 18,955 | 45.2\\% | 21.8\\% |- | Redditch | width=5px; style=\"background:\" | | | | | |- | Reigate | width=5px; style=\"background:\" | | | | | |- | Renfrewshire East | width=5px; style=\"background:\" | | | | | |- | Rhondda | width=5px; style=\"background:\" | | | | | |- | Ribble Valley | width=5px; style=\"background:\" | | | | | |- | Richmond Yorks | width=5px; style=\"background:\" | | | | | |- | Richmond Park | width=5px; style=\"background:\" | | | | | |- | Rochdale | width=5px; style=\"background:\" | | | | | |- | Rochester and Strood | width=5px; style=\"background:blue\" | | Conservative hold | 23,604 | 49.2\\% | |- | Rochford and Southend East | width=5px; style=\"background:\" | | | | | |- | Romford | width=5px; style=\"background:\" | | | | | |- | Romsey and Southampton North | width=5px; style=\"background:\" | | | | | |- | Ross, Skye and Lochaber | width=5px; style=\"background:\" | | | | | |- | Rossendale and Darwen | width=5px; style=\"background:\" | | | | | |- | Rother Valley | width=5px; style=\"background:\" | | | | | |- | Rotherham | width=5px; style=\"background:\" | | | | | |- | Rugby | width=5px; style=\"background:\" | | | | | |- | Ruislip, Northwood and Pinner | width=5px; style=\"background:\" | | | | | |- | Runnymede and Weybridge | width=5px; style=\"background:\" | | | | | |- | Rushcliffe | width=5px; style=\"background:\" | | | | | |- | Rutherglen and Hamilton West | width=5px; style=\"background:\" | | | | | |- | Rutland and Melton | width=5px; style=\"background:\" | | | | | |- | Saffron Walden | width=5px; style=\"background:\" | | | | | |- | St Albans | width=5px; style=\"background:\" | | | | | |- | St Austell and Newquay | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |20,189 |42.7\\% | |- | St Helens North | width=5px; style=\"background:red\" | | Labour hold | 23,041 | 51.7\\% | |- | St Helens South | width=5px; style=\"background:red\" | | Labour hold | 24,364 | 52.9\\% | |- | St Ives | width=5px; style=\"background:\" | | | | | |- | Salford and Eccles | width=5px; style=\"background:red\" | | Labour hold | 16,655 | 40.1\\% | |- | Salisbury | width=5px; style=\"background:\" | | | | | |- | Scarborough and Whitby | width=5px; style=\"background:blue\" | | Conservative hold | 21,108 | 42.8\\% | |- | Scunthorpe | width=5px; style=\"background:\" | | | | | |- | Sedgefield | width=5px; style=\"background:red\" | | Labour hold |18,141 |45.1\\% |11.6\\% (to CON) |- | Sefton Central | width=5px; style=\"background:\" | | | | | |- | Selby and Ainsty | width=5px; style=\"background:blue\" | | Conservative hold | 25,562 | 49.4\\% | |- | Sevenoaks | width=5px; style=\"background:\" | | | | | |- | Sheffield Brightside and Hillsborough | width=5px; style=\"background:red\" | | 'Labour hold | 21,400 | 55.0\\% | |- | Sheffield Central | width=5px; style=\"background:\"red\" | | Labour hold | 17,138 | 41.3\\% | |- | Sheffield Hallam | width=5px; style=\"background:\"#F9D616\" | | Liberal Democrat Hold | 27,324 | 53.4\\% | |- | Sheffield Heeley | width=5px; style=\"background:\" | | | | | |- | Sheffield South East | width=5px; style=\"background:red\" | | Labour hold | 20,169 | 48.7\\% | |- | Sherwood | width=5px; style=\"background:\" | | | | | |- | Shipley | width=5px; style=\"background:blue\" | | Conservative hold | 24,002 | 48.6\\% | |- | Shrewsbury and Atcham | width=5px; style=\"background:\" | | | | | |- | Shropshire North | width=5px; style=\"background:blue\" | | Conservative hold | 26,692 | 51.5\\% | |- | Sittingbourne and Sheppey | width=5px; style=\"background:\" | | | | | |- | Skipton and Ripon | width=5px; style=\"background:\" | | | | | |- | Sleaford and North Hykeham | width=5px; style=\"background:blue\" | | Conservative hold | 30,719 | 51.6\\% | |- | Slough | width=5px; style=\"background:\" | | | | | |- | Solihull | width=5px; style=\"background:#F9D616\" | | Liberal Democrat gain from Con | 23,635 | 42.9\\% | 0.3\\% |- | Somerset North | width=5px; style=\"background:\" | | | | | |- | Somerset North East | width=5px; style=\"background:\" | | | | | |- | Somerton and Frome | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |28,793 |47.5\\% | |- | South Holland and the Deepings | width=5px; style=\"background:\" | | | | | |- | South Ribble | width=5px; style=\"background:\" | | | | | |- | South Shields | width=5px; style=\"background:red\" | | Labour hold | 18,995 | 52.0\\% | |- | Southampton Itchen | width=5px; style=\"background:red\" | | Labour hold | 16,326 | 36.8\\% | |- | Southampton Test | width=5px; style=\"background:red\" | | Labour hold | 17,001 | 38.5\\% | |- | Southampton West | width=5px; style=\"background:\" | | | | | |- | Southport | width=5px; style=\"background:\" | | | | | |- | Spelthorne | width=5px; style=\"background:\" | | | | | |- | Stafford | width=5px; style=\"background:\" | | | | | |- | Staffordshire Moorlands | width=5px; style=\"background:\" | | | | | |- | Staffordshire South | width=5px; style=\"background:\" | | | | | |- | Stalybridge and Hyde | width=5px; style=\"background:\" | | | | | |- | Stevenage | width=5px; style=\"background:\" | | | | | |- | Stirling | width=5px; style=\"background:red\" | |Labour hold |19,558 |41.8\\% | |- | Stockport | width=5px; style=\"background:red\" | | Labour hold | 16,697 | 42.7\\% | |- | Stockton North | width=5px; style=\"background:\" | | | | | |- | Stockton South | width=5px; style=\"background:\" | | | | | |- | Stoke-on-Trent Central | width=5px; style=\"background:\" | | | | | |- | Stoke-on-Trent North | width=5px; style=\"background:\" | | | | | |- | Stoke-on-Trent South | width=5px; style=\"background:red\" | | Labour hold | 15,446 | 38.8\\% | |- | Stone | width=5px; style=\"background:\" | | | | | |- | Stourbridge | width=5px; style=\"background:\" | | | | | |- | Strangford | width=5px; style=\"background:\" | | | | | |- | Stratford-on-Avon | width=5px; style=\"background:\" | | | | | |- | Streatham | width=5px; style=\"background:\" | | | | | |- | Stretford and Urmston | width=5px; style=\"background:\" | | | | | |- | Stroud | width=5px; style=\"background:\" | | | | | |- | suffolk Central and Ipswitch North | width=5px; style=\"background:\" | | | | | |- | Suffolk Coastal | width=5px; style=\"background:\" | | | | | |- | Suffolk South | width=5px; style=\"background:\" | | | | | |- | Suffolk West | width=5px; style=\"background:\" | | | | | |- | Sunderland Central | width=5px; style=\"background:red\" | |Labour win (new seat) |19,495 |45.9\\% | |- | Surrey East (UK Parliament constituency) | width=5px; style=\"background:blue\" | | Conservative hold | 31,007 | 56.7\\% | 0.7\\% (to LD) |- | Surrey Heath | width=5px; style=\"background:blue\" | | Conservative hold | 31,326 | 57.6\\% | 4.6\\% |- | Surrey South West | width=5px; style=\"background:blue\" | | Conservative hold | 33,605 | 58.7\\% | 8.6\\% |- | Sussex Mid | width=5px; style=\"background:blue\" | |Conservative hold |28,329 |50.7\\% |0.3\\% |- | Sutton and Cheam | width=5px; style=\"background:\" | | | | | |- | Sutton Coldfield | width=5px; style=\"background:\" | | | | | |- | Swansea East | width=5px; style=\"background:\" | | | | | |- | Swansea West | width=5px; style=\"background:\" | | | | | |- | Swindon North | width=5px; style=\"background:\" | | | | | |- | Swindon South | width=5px; style=\"background:\" | | | | | |- | Tamworth | width=5px; style=\"background:\" | | | | | |- | Tatton | width=5px; style=\"background:\" | | | | | |- | Taunton Deane | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |28,531 |49.1\\% | |- | Telford | width=5px; style=\"background:\" | | | | | |- | Tewkesbury | width=5px; style=\"background:blue\" | | Conservative hold | 25,472 | 47.2\\% | |- | Thanet North | width=5px; style=\"background:\" | | | | | |- | Thanet South | width=5px; style=\"background:\" | | | | | |- | Thirsk and Malton | width=5px; style=\"background:black\" | | Delayed until 27 May'' | | | |- | Thornbury and Yate | width=5px; style=\"background:\" | | | | | |- | Thurrock | width=5px; style=\"background:\" | | | | | |- | Tiverton and Honiton | width=5px; style=\"background:blue\" | | Conservative hold | 27,614 | 50.3\\% | |- | Tonbridge and Malling | width=5px; style=\"background:\" | | | | | |- | Tooting | width=5px; style=\"background:\" | | | | | |- | Torbay | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |23,126 |47.0\\% | |- | Torfaen | width=5px; style=\"background:\" | | | | | |- | Totnes | width=5px; style=\"background:blue\" | | Conservative hold|21,940 |45.9\\% | |- | Tottenham | width=5px; style=\"background:\" | | | | | |- | Truro and Falmouth | width=5px; style=\"background:blue\" | | Conservative gain from Lib |20,349 |41.7\\% | |- | Tunbridge Wells | width=5px; style=\"background:\" | | | | | |- | Twickenham | width=5px; style=\"background:\" | | | | | |- | Tynemouth | width=5px; style=\"background:\" | | | | | |- | Tyneside North | width=5px; style=\"background:\" | | | | | |- | Tyrone West | width=5px; style=\"background:#060\" | |Sinn F\u00e9in hold|18,050 |48.4\\% | |- | Ulster Mid | width=5px; style=\"background:\" | | | | | |- | Upper Bann | width=5px; style=\"background:#c30\" | |Democratic Unionist hold|14,000 |33.8\\% | |- | Uxbridge and Ruiislip South | width=5px; style=\"background:\" | | | | | |- | Vale of Clwyd | width=5px; style=\"background:red\" | | Labour hold|15,017 |42.3\\% | |- | Vale of Glamorgan | width=5px; style=\"background:\" | | | | | |- | Vauxhall | width=5px; style=\"background:\" | | | | | |- | Wakefield | width=5px; style=\"background:\" | | | | | |- | Wallasey | width=5px; style=\"background:\" | | | | | |- | Walsall North | width=5px; style=\"background:red\" | | Labour hold | 13,385 | 37.0\\% | |- | Walsall South | width=5px; style=\"background:red\" | | Labour hold | 16,211 | 39.7\\% | |- | Walthamstow | width=5px; style=\"background:\" | | | | | |- | Wansbeck | width=5px; style=\"background:\" | | | | | |- | Wantage | width=5px; style=\"background:\" | | | | | |- | Warley | width=5px; style=\"background:red\" | | Labour hold| 20,240 | 52.9\\% | |- | Warrington North | width=5px; style=\"background:\" | | | | | |- | Warrington South | width=5px; style=\"background:\" | | | | | |- | Warwick and Leamington | width=5px; style=\"background:\" | | | | | |- | Warwickshire North | width=5px; style=\"background:\" | | | | | |- | Washington and Sunderland West | width=5px; style=\"background:red\" | |Labour win (new seat) |19,615 |53\\% | |- | Watford | width=5px; style=\"background:\" | | | | | |- | Waveney | width=5px; style=\"background:\" | | | | | |- | Wealden | width=5px; style=\"background:blue\" | | Conservative hold| 31,090 | 56.6\\% | |- | Weaver Vale | width=5px; style=\"background:\" | | | | | |- | Wellingborough | width=5px; style=\"background:blue\" | | Conservative hold| 24,918 | 48.2\\% | |- | Wells | width=5px; style=\"background:#F9D616\" | | Liberal Democrat gain from Con |24,560 |44.0\\% |3.6\\% |- | Welwyn Hatfield | width=5px; style=\"background:\" | | | | | |- | Wentworth and Dearne | width=5px; style=\"background:\" | | | | | |- | West Bromwich East | width=5px; style=\"background:\" | | | | | |- | West Bromwich West | width=5px; style=\"background:\" | | | | | |- | West Ham | width=5px; style=\"background:\" | | | | | |- | Westminster North | width=5px; style=\"background:red\" | | Labour hold| 17,377 | 43.9\\% | |- | Westmorland and Lonsdale | width=5px; style=\"background:\" | | | | | |- | Weston Super-Mare | width=5px; style=\"background:\" | | | | | |- | Wigan | width=5px; style=\"background:\" | | | | | |- | Wiltshire North | width=5px; style=\"background:\" | | | | | |- | Wiltshire South West | width=5px; style=\"background:\" | | | | | |- | Wimbledon | width=5px; style=\"background:\" | | | | | |- | Winchester | width=5px; style=\"background:\" | | | | | |- | Windsor | width=5px; style=\"background:\" | | | | | |- | Wirral South | width=5px; style=\"background:red\" | | Labour hold| 16,276 | 40.8\\% | |- | Wirral West | width=5px; style=\"background:blue\" | | Conservative hold| 16,726 | 42.5\\% | |- | Witham | width=5px; style=\"background:\" | | | | | |- | Witney | width=5px; style=\"background:\" | | | | | |- | Woking | width=5px; style=\"background:blue\" | | Conservative hold| 26,551 | 50.3\\% | 0.7\\% (to LD) |- | Wokingham | width=5px; style=\"background:blue\" | | Conservative hold| 28,754 | 52.7\\% | 4.7\\% |- | Wolverhampton North East | width=5px; style=\"background:\" | | | | | |- | Wolverhampton South East | width=5px; style=\"background:\" | | | | | |- | Wolverhampton South West | width=5px; style=\"background:\" | | | | | |- | Worcester | width=5px; style=\"background:\" | | | | | |- | Worcestershire Mid | width=5px; style=\"background:blue\" | | Conservative hold| 27,770 | 54.5\\% | |- | Worcestershire West | width=5px; style=\"background:\" | | | | | |- | Workington | width=5px; style=\"background:red\" | | Labour hold| 17,865 | 45.5\\% | |- | Worsley and Eccles South | width=5px; style=\"background:red\" | | Labour hold| 17,892 | 42.9\\% | |- | Worthing East and Shoreham | width=5px; style=\"background:blue\" | | Conservative hold| 23,458 | 48.5\\% | |- | Worthing West | width=5px; style=\"background:blue\" | | Conservative hold| 25,416 | 51.7\\% | |- | The Wreckin | width=5px; style=\"background:\" | | | | | |- | Wrexham | width=5px; style=\"background:red\" | | Labour hold| 12,161 | 36.9\\% | 5.7\\% |- | Wycombe | width=5px; style=\"background:blue\" | | Conservative hold| 23,423 | 48.6\\% | |- | Wyre and Preston North | width=5px; style=\"background:blue\" | | Conservative hold| 26,877 | 52.4\\% | 3.9\\% |- | Wyre Forest | width=5px; style=\"background:red\" | | Labour hold| 11,490 | 33.4\\% | |- | Wythenshawe and Sale East | width=5px; style=\"background:red\" | | Labour hold| 17,987 | 44.1\\% | |- | Yeovil | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold| 31,843 | 55.7\\% | 2.7\\% |- | Ynys Mon | width=5px; style=\"background:red\" | | Labour hold| 11,490 | 33.4\\% | 1.8\\% |- | York Central | width=5px; style=\"background:red\" | | Labour hold| 18,573 | 40.0\\% | 6.0\\% (to CON) |- | York Outer | width=5px; style=\"background:blue\" | | Conservative gain from Liberal Democrats | 22,912 | 43\\% | 3.7\\% |- | Yorkshire East | width=5px; style=\"background:blue\" | | Conservative hold''' 24,328 47.5\\% 0.1\\% (to LD)", "after_revision": "ConstituencyResultVotesShareSwing Labour hold 16,073 51.9\\% 5.3\\% (to LD) Conservative gain from Lab 10,734 35.8\\% 7.6\\% Labour hold 16,746 44.4\\% 1.0\\% Labour hold 15,722 36.5\\% 2.5\\% Liberal Democrat hold 17,362 38.4\\% 4.9\\% (to CON)Labour hold20,64958.2\\% 3.9\\% (to SNP) Conservative hold 21,203 46.7\\% 1.4\\% (to LD) Conservative hold 22,913 59.3\\% 12.0\\% (from LAB) Conservative hold 24,176 48.9\\% 0.8\\% (to LD) Labour hold 15,804 39.6\\% 8.1\\% (to CON) Conservative gain from Lab 17,746 38.6\\% 6.9\\% SNP hold 15,020 39.6\\% 2.2\\%Democratic Unionist hold13,99345.9\\%Democratic Unionist hold19,67246.4\\% Democratic Unionist hold 11,536 33.9\\% 3.6\\% (to UCU) Plaid Cymru gain from Lab9,38336.0\\%3.7\\% Liberal Democrat hold14,29231.6\\%2.7\\% (to CON) Conservative hold32,33357.8\\%3.0\\% Labour hold16,23933.7\\%17.2\\% (to LD) Conservative hold29,87854.1\\%2.3\\% (to LD) Labour hold18,60448.4\\%7.3\\% (to CON) Conservative hold27,73652.2\\% Labour hold21,63247.1\\%0.3\\% (to CON) Labour hold20,95047.7\\%1.5\\% Labour hold21,86047.4\\%2.3\\% (to SNP)Conservative hold29,703 52.8\\%5.9\\% (to CON)SNP hold15,86841.3\\%10.7\\% (to CON)Labour hold24,62854.3\\%1.7\\% Labour hold17,48747.3\\%4.2\\% (to LD) Labour hold18,05947.0\\%14.0\\% (to LD) Labour hold21,22648.1\\%0.4\\% (to CON) Conservative hold21,98252.8\\%9.3\\% Conservative gain from Lab19,62443.9\\%7.5\\% Conservative hold25,59050.5\\%4.6\\% Labour hold25,01850.5\\%0.7\\% (to CON) Liberal Democrat hold26,65156.6\\%5.8\\% Labour hold 21,565 41.5\\% 2.5\\% (to CON) Conservative gain from Lab 23,103 47.3\\% 6.5\\% Conservative hold32,05361.1\\%4.7\\% Conservative hold27,59757.9\\%3.2\\% (to LD) Conservative gain from Lab17,54638.9\\%5.5\\% Conservative hold28,81552.5\\%2.3\\% Conservative hold30,98955.8\\%2.6\\% Conservative hold26,81552.8\\%0.7\\% Alliance gain from DUP12,83937.2\\%22.9\\% Democratic Unionist hold14,81240.0\\%5.0\\% (to SF) SDLP hold14,02641.0\\%8.4\\% Sinn F\u00e9in hold22,84071.1\\%1.1\\% Liberal Democrat hold21,59048.4\\%1.6\\% Liberal Democrat hold16,80643.7\\%8.3\\% (to CON) Liberal Democrat hold22,23045.4\\%0.7\\% (to CON) Conservative hold22,23045.4\\%1.6\\% Conservative hold28,14751.6\\%4.0\\% (to LD) Labour hold 16,894 40.6\\% 0.5\\% (to CON) Labour hold19,95055.7\\%2.5\\% Labour hold 17,950 38.5\\% 4.8\\% (to CON) Labour hold 16,023 39.0\\% 7.2\\% (to CON) Labour hold21,75147.8\\%1.1\\% Conservative gain from Lab16,96441.8\\%6.9\\% Labour hold14,44941.16.2\\% (to CON) Labour gain from Ind 16,974 52.4\\% 29.2\\% Labour hold 22,297 49.7\\% 3.3\\% Conservative hold24,08751.4\\%2.3\\% Labour hold21,99450.0\\%11.2\\% (to CON) Labour hold19,87045.9\\%1.3\\% (to CON) Labour hold18,78247.4\\%5.6\\% (to CON) Labour hold 18,327 38.5\\% 4.9\\% (to CON) Conservative hold18,78247.4\\%7.0\\% Conservative hold23,13242.6\\%5.9\\% (to LD) Conservative hold21,32048.4\\%1.8\\% Conservative hold 18,808 45.1\\% 2.9\\% Conservative hold 27,327 52.4\\% 1.0\\% (to LD) Conservative hold 25,901 52.6\\% 6.7\\% Liberal Democrat hold17,92946.2\\%0.3\\% (to CON) Conservative hold28,79256.9\\%3.1\\% Labour hold13,93136.3\\%6.0\\% (to CON) Conservative hold 24,675 45.3\\% 2.9\\% (to LD) Conservative gain from Lab19,68044.9\\%9.8\\% Green gain from Lab 16,238 31.3\\% 8.4\\% Labour hold16,47136.6\\%4.5\\% (to CON) Liberal Democrat hold26,59348.0\\%9.0\\% Conservative hold26,84458.8\\%6.4\\% Conservative gain from Lab20,58539.0\\%2.6\\% Liberal Democrat gain from Lab14,93235.7\\%9.6\\% Conservative gain from Lab22,18844.5\\%8.7\\% Conservative hold27,89947.5\\%2.8\\% Labour hold17,37744.9\\%6.5\\% (to CON) Liberal Democrat hold11,90741.4\\%6.4\\% (to LAB) Conservative gain from Lib37.6\\%15,9695.2\\% Liberal Democrat hold 19,621 39.1\\% 7.0\\% (to CON) Conservative hold26,86251.4\\%0.8\\% Conservative hold29,42550.05\\%2.6\\% Conservative hold27,99547.4\\%2.5\\% (to LD) Conservative hold27,62948.0\\%2.7\\% (to LD) Conservative gain from Lab18,27140.1\\%14.0\\% Conservative hold22,05044.8\\%5.4\\% (to LD) Labour hold 17,262 38.9\\% 6.0\\% (to CON) Labour hold 16,893 41.2\\% 5.3\\% (to CON) Plaid Cymru hold 13,546 35.6\\% 4.2\\% (to LAB) Conservative gain from Lab 16,649 41.1\\% 6.9\\% Conservative gain from Lab18,93942.1\\%7.8\\% Labour hold13,31138.4\\%5.8\\% (to CON) Conservative hold 15,833 41.5\\% 8.4\\% Conservative hold 23,250 45.8\\% 2.3\\% (to LD) Labour hold 19,699 46.0\\% 2.1\\% (to CON) Conservative gain from Lab 22,886 42.2\\% 3.4\\% Liberal Democrat hold22,51248.1\\%0.3\\% (to CON) Conservative gain from Lib22,39045.1\\%9.1\\% Conservative hold 29,075 53.0\\% 1.1\\% Labour hold 21,384 49.3\\% 5.5\\% (to CON) Labour hold 19,936 42.8\\% 3.9\\% (to CON) Labour hold 19,197 41.8\\% 3.4\\% (to CON) Conservative gain from Lab 21,264 44.8\\% 6.3\\% Conservative gain from Lab 23,420 45.8\\% 13.7\\% Conservative gain from Lab | 19,657 | 39.5\\% | 3.3\\% |- | | width=5px; style=\"background:red\"| | Labour hold | 28,949 | 56.0\\% | 0.3\\% |- | | width=5px; style=\"background:blue\"| | Conservative hold | 28,684 | 50.9\\% | 1.7\\% (to LD) |- | | width=5px; style=\"background:red\"| | Labour hold | 23,549 | 57.2\\% | 1.9\\% |- | | width=5px; style=\"background:red\"| | Labour hold | 15,681 | 52.5\\% | 8.6\\% (to PC) |- | | width=5px; style=\"background:red\"| |Labour hold |17,813 |40.3\\% |4.9\\% (to CON) |- | | width=5px; style=\"background:red\"| | Labour hold |16,891 |39.4\\% |9.1\\% (to CON) |- | | width=5px; style=\"background:blue\"| |Conservative gain from Lab |24,428 |48.8\\% |11.6\\% |- | | width=5px; style=\"background:blue\"| | Conservative hold | 29,252 | 56.5\\% | 0.7\\% (to LD) |- | | width=5px; style=\"background:red\"| | Labour hold | 15,083 | 40.8\\% | 6.7\\% (to CON) |- | | width=5px; style=\"background:red\"| |Labour hold |19,191 |51.0\\% |6.2\\% (to CON) |- | | width=5px; style=\"background:red\"| | Labour hold | 14,896 | 33.0\\% | 7.4\\% (to CON) |- | | width=5px; style=\"background:red\"| |Labour hold |17,851 |43.3\\% |9.3\\% (to CON) |- | | width=5px; style=\"background:blue\"| | Conservative hold | 24,378 | 52.1\\% | 3.7\\% |- | | width=5px; style=\"background:blue\"| |Conservative hold |22,877 |48.3\\% |5.7\\% |- | | width=5px; style=\"background:red\"| |Labour hold |17,948 |38.2\\% |8.6\\% (to CON) |- | | width=5px; style=\"background:blue\"| |Conservative gain from Lab |22,935 |45.5\\% |9.8\\% |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative hold | 27,737 | 51.5\\% | 6.1\\% |- | | width=5px; style=\"background:blue\"| | Conservative hold |48.3\\% |25,662 | |- | | width=5px; style=\"background:#F9D616\"| | Liberal Democrat hold |24,305 |47.4\\% |0.3\\% |- | | width=5px; style=\"background:blue\"| | Conservative hold |27,908 |56.0\\% |5.6\\% |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative gain from Lab |22,667 |45.1\\% |9.3\\% |- | | width=5px; style=\"background:blue\"| | Conservative hold |27,287 |47.6\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:grey\"| |Independent gain from UCU |21,181 |63.3\\% | |- | | width=5px; style=\"background:#3c3\" | |SDLP hold |20,648 |48.5\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold |20,496 |44.3\\% | |- | | width=5px; style=\"background:red\"| |Labour hold |20,698 |50.5\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| |Labour hold |20,579 |58.9\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 17,305 | 43.4\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 19,473 | 42.8\\% | |- | | width=5px; style=\"background:#F9D616\"| | Liberal Democrat hold | 16,684 | 35.9\\% | -11.4\\% |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold |19,942 |38.2\\% | |- | | width=5px; style=\"background:red\"| | Labour hold |23,207 |45.7\\% | |- | | width=5px; style=\"background:blue\"| | Conservative hold |30,037 |55.3\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:#060\"| | Sinn F\u00e9in hold |21,304 |45.5\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:#3c3\" | |SDLP hold |16,922 |44.7\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative hold |24,266 |49.3\\% | |- | | width=5px; style=\"background:red\"| | Labour hold |25,493 |59.5\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold |19,821 |41.1\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold |19,797 |61.6\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 20,100 | 68.3\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative hold | 22,956 | 48.5\\% | 9.1\\% |- | | width=5px; style=\"background:red\"| |Labour hold |10,777 |32.7\\% |10.5\\% (to CON) |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| |Conservative hold |29,618 |53.3\\% |6.9\\% |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative hold | 24,486 | 50.2\\% | 6.6\\% |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 20,810 | 43.9\\% | 0.5\\% (to CON) |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative gain from Lab | 21,435 | 44.7\\% | 7.0\\% (to CON) |- | | width=5px; style=\"background:red\"| | Labour hold | 20,111 | 43.6\\% | 5.7\\% (to CON) |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| |Conservative gain from Lib |22,366 |46.2\\% |3.8\\% |- | | width=5px; style=\"background:blue\"| | Conservative hold | 24,631 | 51.8\\% | 3.8\\% (to LD) |- | | width=5px; style=\"background:blue\"| | Conservative hold | 29,810 | 53.8\\% | |- | | width=5px; style=\"background:blue\"| | Conservative hold | 26,995 | 53.5\\% | 1.9\\% (to LD) |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative hold | 26,476 | 56.0\\% | 5.6\\% |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 19,137 | 50.3\\% | 8.4\\% (to CON) |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 15,725 | 38.8\\% | 7.1\\% (to CON) |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 13,044 | 39.2\\% | 12.2\\% (to LD) |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 24,276 | 54.5\\% | |- | | width=5px; style=\"background:red\"| | Labour hold | 18,407 | 42.3\\% | 3.3\\% |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\" | | Labour hold | 20,910 | 53.9\\% | 6.4\\% |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative hold | 17,595 | 50.1\\% | 5.2\\% |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:#c30\"| |Democratic Unionist hold |18,199 |49.8\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 18,434 | 49.3\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 20,287 | 42.7\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 16,389 | 42.3\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative hold | 27,000 | 49.5\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 24,295 | 51.3\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 22,998 | 59.3\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 15,916 | 42.5\\% | 4.0\\% (to PC) |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:blue\"| | Conservative hold | 25,065 | 49.6\\% | |- | | width=5px; style=\"background:\"| | | | | |- | | width=5px; style=\"background:red\"| |Labour hold |21,192 |49.3\\% |0.5\\% |- | | width=5px; style=\"background:red\"| | Labour hold | 14,725 | 34.9\\% | 4.6\\% (to CON) |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | |Conservative hold |31,937 |59.5\\% |7.8\\% |- | | width=5px; style=\"background:blue\" | | Conservative hold | 23,491 | 48.0\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold | 18,138 | 39.2\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold | 24,722 | 56.4\\% | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 31,263 | 57.5\\% | 2.3\\% |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#ff0\" | | SNP hold |6,723 |45.75\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\"| | Labour hold | 15,692 | 45.9\\% | 0.6\\% (to LD) |- | | width=5px; style=\"background:red\"| | Labour hold | 17,043 | 45.0 | 4.6\\% (to LD) |- | | width=5px; style=\"background:red\"| | Labour hold | 17,950 | 40.8 | 4.5\\% (to LD) |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative gain from Lib |20,774 |43.0\\% |5.8\\% |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 33,081 | 55.2\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold | 19,131 | 37.9\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#ff0\" | | SNP hold | 19,118 | 39.6\\% | 2.9\\% |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold |15,433 |37.2\\% |7.8\\% (to CON) |- | | width=5px; style=\"background:blue\" | | Conservative gain from Lab |15,050 |34.3\\% |6.9\\% |- | | width=5px; style=\"background:red\" | | Labour hold | 14,220 | 38.8\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#F9D616\"| | Liberal Democrat gain from Lab | 18,955 | 45.2\\% | 21.8\\% |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 23,604 | 49.2\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |20,189 |42.7\\% | |- | | width=5px; style=\"background:red\" | | Labour hold | 23,041 | 51.7\\% | |- | | width=5px; style=\"background:red\" | | Labour hold | 24,364 | 52.9\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold | 16,655 | 40.1\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 21,108 | 42.8\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold |18,141 |45.1\\% |11.6\\% (to CON) |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 25,562 | 49.4\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | 'Labour hold | 21,400 | 55.0\\% | |- | | width=5px; style=\"background:\"red\" | | Labour hold | 17,138 | 41.3\\% | |- | | width=5px; style=\"background:\"#F9D616\" | | Liberal Democrat Hold | 27,324 | 53.4\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold | 20,169 | 48.7\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 24,002 | 48.6\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 26,692 | 51.5\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 30,719 | 51.6\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#F9D616\" | | Liberal Democrat gain from Con | 23,635 | 42.9\\% | 0.3\\% |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |28,793 |47.5\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold | 18,995 | 52.0\\% | |- | | width=5px; style=\"background:red\" | | Labour hold | 16,326 | 36.8\\% | |- | | width=5px; style=\"background:red\" | | Labour hold | 17,001 | 38.5\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | |Labour hold |19,558 |41.8\\% | |- | | width=5px; style=\"background:red\" | | Labour hold | 16,697 | 42.7\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold | 15,446 | 38.8\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | |Labour win (new seat) |19,495 |45.9\\% | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 31,007 | 56.7\\% | 0.7\\% (to LD) |- | | width=5px; style=\"background:blue\" | | Conservative hold | 31,326 | 57.6\\% | 4.6\\% |- | | width=5px; style=\"background:blue\" | | Conservative hold | 33,605 | 58.7\\% | 8.6\\% |- | | width=5px; style=\"background:blue\" | |Conservative hold |28,329 |50.7\\% |0.3\\% |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |28,531 |49.1\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 25,472 | 47.2\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:black\" | | Delayed until 27 May'' | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold | 27,614 | 50.3\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold |23,126 |47.0\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold|21,940 |45.9\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative gain from Lib |20,349 |41.7\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#060\" | |Sinn F\u00e9in hold|18,050 |48.4\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:#c30\" | |Democratic Unionist hold|14,000 |33.8\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold|15,017 |42.3\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold | 13,385 | 37.0\\% | |- | | width=5px; style=\"background:red\" | | Labour hold | 16,211 | 39.7\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold| 20,240 | 52.9\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | |Labour win (new seat) |19,615 |53\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold| 31,090 | 56.6\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold| 24,918 | 48.2\\% | |- | | width=5px; style=\"background:#F9D616\" | | Liberal Democrat gain from Con |24,560 |44.0\\% |3.6\\% |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold| 17,377 | 43.9\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold| 16,276 | 40.8\\% | |- | | width=5px; style=\"background:blue\" | | Conservative hold| 16,726 | 42.5\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold| 26,551 | 50.3\\% | 0.7\\% (to LD) |- | | width=5px; style=\"background:blue\" | | Conservative hold| 28,754 | 52.7\\% | 4.7\\% |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:blue\" | | Conservative hold| 27,770 | 54.5\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold| 17,865 | 45.5\\% | |- | | width=5px; style=\"background:red\" | | Labour hold| 17,892 | 42.9\\% | |- | | width=5px; style=\"background:blue\" | | Conservative hold| 23,458 | 48.5\\% | |- | | width=5px; style=\"background:blue\" | | Conservative hold| 25,416 | 51.7\\% | |- | | width=5px; style=\"background:\" | | | | | |- | | width=5px; style=\"background:red\" | | Labour hold| 12,161 | 36.9\\% | 5.7\\% |- | | width=5px; style=\"background:blue\" | | Conservative hold| 23,423 | 48.6\\% | |- | | width=5px; style=\"background:blue\" | | Conservative hold| 26,877 | 52.4\\% | 3.9\\% |- | | width=5px; style=\"background:red\" | | Labour hold| 11,490 | 33.4\\% | |- | | width=5px; style=\"background:red\" | | Labour hold| 17,987 | 44.1\\% | |- | | width=5px; style=\"background:#F9D616\" | | Liberal Democrat hold| 31,843 | 55.7\\% | 2.7\\% |- | | width=5px; style=\"background:red\" | | Labour hold| 11,490 | 33.4\\% | 1.8\\% |- | | width=5px; style=\"background:red\" | | Labour hold| 18,573 | 40.0\\% | 6.0\\% (to CON) |- | | width=5px; style=\"background:blue\" | | Conservative gain from Liberal Democrats | 22,912 | 43\\% | 3.7\\% |- | | width=5px; style=\"background:blue\" | | Conservative hold''' 24,328 47.5\\% 0.1\\% (to LD)", "edit_actions": [{"type": "D", "before": "Argyle and Bute", "after": null, "start_char_pos": 701, "end_char_pos": 716}, {"type": "R", "before": "Barnsley CentralLabour", "after": "Labour", "start_char_pos": 1161, "end_char_pos": 1183}, {"type": "R", "before": "Barnsley EasyLabour", "after": "Labour", "start_char_pos": 1214, "end_char_pos": 1233}, {"type": "R", "before": "Barrow and FurnessLabour", "after": "Labour", "start_char_pos": 1265, "end_char_pos": 1289}, {"type": "R", "before": "Basildon and BillericayConservative", "after": "Conservative", "start_char_pos": 1321, "end_char_pos": 1356}, {"type": "R", "before": "Basildon South and Thurrock EastConservative", "after": "Conservative", "start_char_pos": 1379, "end_char_pos": 1423}, {"type": "R", "before": "BasingstokeConservative", "after": "Conservative", "start_char_pos": 1455, "end_char_pos": 1478}, {"type": "R", "before": "BassrtlawLabour", "after": "Labour", "start_char_pos": 1501, "end_char_pos": 1516}, {"type": "R", "before": "BathLiberal", "after": "Liberal", "start_char_pos": 1548, "end_char_pos": 1559}, {"type": "D", "before": "Batley and Spen", "after": null, "start_char_pos": 1591, "end_char_pos": 1606}, {"type": "D", "before": "Battersea", "after": null, "start_char_pos": 1648, "end_char_pos": 1657}, {"type": "R", "before": "BeaconsfieldConservative", "after": "Conservative", "start_char_pos": 1705, "end_char_pos": 1729}, {"type": "R", "before": "BeckanhamConservative", "after": "Conservative", "start_char_pos": 1752, "end_char_pos": 1773}, {"type": "R", "before": "BedfordConservative", "after": "Conservative", "start_char_pos": 1804, "end_char_pos": 1823}, {"type": "R", "before": "Bedforsdhire MidConservative", "after": "Conservative", "start_char_pos": 1855, "end_char_pos": 1883}, {"type": "R", "before": "Bedfordshire North EastConservative", "after": "Conservative", "start_char_pos": 1906, "end_char_pos": 1941}, {"type": "R", "before": "Bedfordshire South WestConservative", "after": "Conservative", "start_char_pos": 1964, "end_char_pos": 1999}, {"type": "R", "before": "Belfast EastAlliance", "after": "Alliance", "start_char_pos": 2022, "end_char_pos": 2042}, {"type": "R", "before": "Belfast NorthDemocratic", "after": "Democratic", "start_char_pos": 2075, "end_char_pos": 2098}, {"type": "R", "before": "Belfast SouthSDLP", "after": "SDLP", "start_char_pos": 2138, "end_char_pos": 2155}, {"type": "R", "before": "Belfast WestSinn", "after": "Sinn", "start_char_pos": 2178, "end_char_pos": 2194}, {"type": "R", "before": "Bermondsey and Old SouthwarkLiberal", "after": "Liberal", "start_char_pos": 2222, "end_char_pos": 2257}, {"type": "R", "before": "Berwick-Upon-TweedLiberal", "after": "Liberal", "start_char_pos": 2289, "end_char_pos": 2314}, {"type": "R", "before": "Banff and BuchanLiberal", "after": "Liberal", "start_char_pos": 2355, "end_char_pos": 2378}, {"type": "R", "before": "Bethnal Green and BowBanff and BuchanConservative", "after": "Conservative", "start_char_pos": 2419, "end_char_pos": 2468}, {"type": "R", "before": "Bexhill and BattleConservative", "after": "Conservative", "start_char_pos": 2491, "end_char_pos": 2521}, {"type": "D", "before": "Bexleyheath and CrayfordBirkenhead)Birmingham Edgbaston", "after": null, "start_char_pos": 2552, "end_char_pos": 2607}, {"type": "R", "before": "Birmingham ErdingtonBirmingham Hall GreenBirmingham Hodge HillBirmingham LadywoodLabour", "after": "Labour", "start_char_pos": 2649, "end_char_pos": 2736}, {"type": "D", "before": "Birmingham NorthfieldBirmingham Perry BarrBirmingham Selly Oak", "after": null, "start_char_pos": 2759, "end_char_pos": 2821}, {"type": "D", "before": "Birmingham YardleyBishop Auckland", "after": null, "start_char_pos": 2863, "end_char_pos": 2896}, {"type": "R", "before": "BlackburnLabour", "after": "Labour", "start_char_pos": 2938, "end_char_pos": 2953}, {"type": "R", "before": "Blackley and BroughtonBlackpool North and CleveleysConservative", "after": "Conservative", "start_char_pos": 2976, "end_char_pos": 3039}, {"type": "R", "before": "Blackpool SouthLabour", "after": "Labour", "start_char_pos": 3071, "end_char_pos": 3092}, {"type": "R", "before": "Blaenau GwentLabour", "after": "Labour", "start_char_pos": 3122, "end_char_pos": 3141}, {"type": "D", "before": "Blaydon", "after": null, "start_char_pos": 3177, "end_char_pos": 3184}, {"type": "R", "before": "Blyth ValleyBognor Regis and LittlehamptonConservative", "after": "Conservative", "start_char_pos": 3217, "end_char_pos": 3271}, {"type": "R", "before": "BolsoverLabour", "after": "Labour", "start_char_pos": 3294, "end_char_pos": 3308}, {"type": "R", "before": "Bolton North EastLabour", "after": "Labour", "start_char_pos": 3341, "end_char_pos": 3364}, {"type": "R", "before": "Bolton South EastLabour", "after": "Labour", "start_char_pos": 3396, "end_char_pos": 3419}, {"type": "D", "before": "Bolton West", "after": null, "start_char_pos": 3451, "end_char_pos": 3462}, {"type": "R", "before": "BootleBoston and SkegnessConservative", "after": "Conservative", "start_char_pos": 3504, "end_char_pos": 3541}, {"type": "R", "before": "BosworthConservative", "after": "Conservative", "start_char_pos": 3564, "end_char_pos": 3584}, {"type": "R", "before": "Bournemouth EastConservative", "after": "Conservative", "start_char_pos": 3615, "end_char_pos": 3643}, {"type": "D", "before": "Bournemouth West", "after": null, "start_char_pos": 3666, "end_char_pos": 3682}, {"type": "D", "before": "Bracknell", "after": null, "start_char_pos": 3721, "end_char_pos": 3730}, {"type": "D", "before": "Bradford EastBradford SouthBradford WestBraintree", "after": null, "start_char_pos": 3777, "end_char_pos": 3826}, {"type": "R", "before": "Brecon and RadnorshireLiberal", "after": "Liberal", "start_char_pos": 3865, "end_char_pos": 3894}, {"type": "R", "before": "Brent CentralBrent NorthBrentford and IsleworthBrentwood and OngarConservative", "after": "Conservative", "start_char_pos": 3935, "end_char_pos": 4013}, {"type": "R", "before": "BridgendLabour", "after": "Labour", "start_char_pos": 4036, "end_char_pos": 4050}, {"type": "D", "before": "Bridgwater and Somerset West", "after": null, "start_char_pos": 4082, "end_char_pos": 4110}, {"type": "R", "before": "Brigg and GooleConservative", "after": "Conservative", "start_char_pos": 4157, "end_char_pos": 4184}, {"type": "D", "before": "Brighton KemptownBrighton Pavilion", "after": null, "start_char_pos": 4216, "end_char_pos": 4250}, {"type": "R", "before": "Bristol EastLabour", "after": "Labour", "start_char_pos": 4291, "end_char_pos": 4309}, {"type": "R", "before": "Bristol North WestBristol SouthBristol WestLiberal", "after": "Liberal", "start_char_pos": 4341, "end_char_pos": 4391}, {"type": "R", "before": "BroadlandBromley and ChislehurstBromsgroveBroxbourneConservative", "after": "Conservative", "start_char_pos": 4423, "end_char_pos": 4487}, {"type": "R", "before": "BroxtoweConservative", "after": "Conservative", "start_char_pos": 4510, "end_char_pos": 4530}, {"type": "R", "before": "BuckinghamBurnleyLiberal", "after": "Liberal", "start_char_pos": 4562, "end_char_pos": 4586}, {"type": "R", "before": "BurtonConservative", "after": "Conservative", "start_char_pos": 4627, "end_char_pos": 4645}, {"type": "R", "before": "Bury NorthBury SouthBury St EdmundsConservative", "after": "Conservative", "start_char_pos": 4677, "end_char_pos": 4724}, {"type": "R", "before": "CaerphillyLabour", "after": "Labour", "start_char_pos": 4747, "end_char_pos": 4763}, {"type": "R", "before": "Caithness, Sutherland and Easter RossLiberal", "after": "Liberal", "start_char_pos": 4795, "end_char_pos": 4839}, {"type": "D", "before": "Calder ValleyCamberwell and PeckhamCambourne and Redruth", "after": null, "start_char_pos": 4880, "end_char_pos": 4936}, {"type": "D", "before": "Cambridge", "after": null, "start_char_pos": 4981, "end_char_pos": 4990}, {"type": "R", "before": "Cambridgeshire North EastConservative", "after": "Conservative", "start_char_pos": 5042, "end_char_pos": 5079}, {"type": "R", "before": "Cambridgeshire North WestConservative", "after": "Conservative", "start_char_pos": 5102, "end_char_pos": 5139}, {"type": "R", "before": "Cambridgeshire SouthConservative", "after": "Conservative", "start_char_pos": 5163, "end_char_pos": 5195}, {"type": "R", "before": "Cambridgeshire South EastConservative", "after": "Conservative", "start_char_pos": 5226, "end_char_pos": 5263}, {"type": "R", "before": "Cannock ChaseConservative", "after": "Conservative", "start_char_pos": 5294, "end_char_pos": 5319}, {"type": "D", "before": "Canterbury", "after": null, "start_char_pos": 5352, "end_char_pos": 5362}, {"type": "D", "before": "Cardiff CentralCardiff NorthCardiff South and Penarth", "after": null, "start_char_pos": 5406, "end_char_pos": 5459}, {"type": "D", "before": "Cardiff West", "after": null, "start_char_pos": 5501, "end_char_pos": 5513}, {"type": "D", "before": "Carlisle Carmarthen East and Dinefwr", "after": null, "start_char_pos": 5555, "end_char_pos": 5591}, {"type": "D", "before": "Carmarthen West and Pembrokeshire South", "after": null, "start_char_pos": 5638, "end_char_pos": 5677}, {"type": "R", "before": "Carshalton and WallingtonCastle PointCeredigionCharnwoodChatham and AylesfordCheadleChelmsfordChelsea and FulhamCheltenhamChelsham and AmershamChester, City ofChesterfieldChichesterChingford and Woodford GreenChippenhamChipping BarnetChorleyChristchurchCities of London and WestminsterClactonCleethorpesConservative", "after": "Conservative", "start_char_pos": 5725, "end_char_pos": 6040}, {"type": "D", "before": "Clwyd South", "after": null, "start_char_pos": 6072, "end_char_pos": 6083}, {"type": "D", "before": "Clwyd West", "after": null, "start_char_pos": 6122, "end_char_pos": 6132}, {"type": "D", "before": "Coatbridge, Chryson and BellshillColchesterColne ValleyCongleton", "after": null, "start_char_pos": 6171, "end_char_pos": 6235}, {"type": "D", "before": "Copeland", "after": null, "start_char_pos": 6282, "end_char_pos": 6290}, {"type": "D", "before": "Corby", "after": null, "start_char_pos": 6332, "end_char_pos": 6337}, {"type": "D", "before": "Cornwall North", "after": null, "start_char_pos": 6385, "end_char_pos": 6399}, {"type": "D", "before": "Cornwall South East", "after": null, "start_char_pos": 6448, "end_char_pos": 6467}, {"type": "D", "before": "The Cotswolds", "after": null, "start_char_pos": 6512, "end_char_pos": 6525}, {"type": "D", "before": "Coventry North East", "after": null, "start_char_pos": 6564, "end_char_pos": 6583}, {"type": "D", "before": "Coventry North West", "after": null, "start_char_pos": 6625, "end_char_pos": 6644}, {"type": "D", "before": "Coventry South", "after": null, "start_char_pos": 6686, "end_char_pos": 6700}, {"type": "D", "before": "Crawley", "after": null, "start_char_pos": 6742, "end_char_pos": 6749}, {"type": "D", "before": "Crewe and Nantwich", "after": null, "start_char_pos": 6797, "end_char_pos": 6815}, {"type": "D", "before": "Croydon Central", "after": null, "start_char_pos": 6864, "end_char_pos": 6879}, {"type": "D", "before": "Croydon North", "after": null, "start_char_pos": 6938, "end_char_pos": 6951}, {"type": "D", "before": "Croydon South", "after": null, "start_char_pos": 7034, "end_char_pos": 7047}, {"type": "D", "before": "Cumbernauld, Kilsyth and Kirkintilloch East", "after": null, "start_char_pos": 7145, "end_char_pos": 7188}, {"type": "D", "before": "Cynon Valley", "after": null, "start_char_pos": 7271, "end_char_pos": 7283}, {"type": "D", "before": "Dagenham and Rainham", "after": null, "start_char_pos": 7374, "end_char_pos": 7394}, {"type": "D", "before": "Darlington", "after": null, "start_char_pos": 7482, "end_char_pos": 7492}, {"type": "D", "before": "Dartford", "after": null, "start_char_pos": 7581, "end_char_pos": 7589}, {"type": "D", "before": "Daventry", "after": null, "start_char_pos": 7685, "end_char_pos": 7693}, {"type": "D", "before": "Delyn", "after": null, "start_char_pos": 7791, "end_char_pos": 7796}, {"type": "D", "before": "Denton and Reddish", "after": null, "start_char_pos": 7888, "end_char_pos": 7906}, {"type": "D", "before": "Derby North", "after": null, "start_char_pos": 7994, "end_char_pos": 8005}, {"type": "D", "before": "Derby South", "after": null, "start_char_pos": 8097, "end_char_pos": 8108}, {"type": "D", "before": "Derbyshire Dales", "after": null, "start_char_pos": 8196, "end_char_pos": 8212}, {"type": "D", "before": "Derbyshire Mid", "after": null, "start_char_pos": 8302, "end_char_pos": 8316}, {"type": "D", "before": "Derbyshire North East", "after": null, "start_char_pos": 8402, "end_char_pos": 8423}, {"type": "D", "before": "Derbyshire South", "after": null, "start_char_pos": 8511, "end_char_pos": 8527}, {"type": "D", "before": "Devizes", "after": null, "start_char_pos": 8622, "end_char_pos": 8629}, {"type": "D", "before": "Devon Central", "after": null, "start_char_pos": 8677, "end_char_pos": 8690}, {"type": "D", "before": "Devon East", "after": null, "start_char_pos": 8780, "end_char_pos": 8790}, {"type": "D", "before": "Devon North", "after": null, "start_char_pos": 8872, "end_char_pos": 8883}, {"type": "D", "before": "Devon South West", "after": null, "start_char_pos": 8977, "end_char_pos": 8993}, {"type": "D", "before": "Devon West and Torridge", "after": null, "start_char_pos": 9080, "end_char_pos": 9103}, {"type": "D", "before": "Dewsbury", "after": null, "start_char_pos": 9151, "end_char_pos": 9159}, {"type": "D", "before": "Don Valley", "after": null, "start_char_pos": 9207, "end_char_pos": 9217}, {"type": "D", "before": "Doncaster Central", "after": null, "start_char_pos": 9265, "end_char_pos": 9282}, {"type": "D", "before": "Doncaster North", "after": null, "start_char_pos": 9330, "end_char_pos": 9345}, {"type": "D", "before": "Doset Mid and Poole North", "after": null, "start_char_pos": 9393, "end_char_pos": 9418}, {"type": "D", "before": "Dorset North", "after": null, "start_char_pos": 9466, "end_char_pos": 9478}, {"type": "D", "before": "Dorset South", "after": null, "start_char_pos": 9526, "end_char_pos": 9538}, {"type": "D", "before": "Dorset West", "after": null, "start_char_pos": 9634, "end_char_pos": 9645}, {"type": "D", "before": "Dover", "after": null, "start_char_pos": 9727, "end_char_pos": 9732}, {"type": "D", "before": "Down North", "after": null, "start_char_pos": 9780, "end_char_pos": 9790}, {"type": "D", "before": "Down South", "after": null, "start_char_pos": 9879, "end_char_pos": 9889}, {"type": "D", "before": "Dudley North", "after": null, "start_char_pos": 9963, "end_char_pos": 9975}, {"type": "D", "before": "Dudley South", "after": null, "start_char_pos": 10023, "end_char_pos": 10035}, {"type": "D", "before": "Dulwich and West Norwood", "after": null, "start_char_pos": 10083, "end_char_pos": 10107}, {"type": "D", "before": "Dumfries and Galloway", "after": null, "start_char_pos": 10155, "end_char_pos": 10176}, {"type": "D", "before": "Dunfiesshire, Clydesdale and Tweeddale", "after": null, "start_char_pos": 10224, "end_char_pos": 10262}, {"type": "D", "before": "Dunbartonshire East", "after": null, "start_char_pos": 10310, "end_char_pos": 10329}, {"type": "D", "before": "Dunbartonshire West", "after": null, "start_char_pos": 10377, "end_char_pos": 10396}, {"type": "D", "before": "Dundee East", "after": null, "start_char_pos": 10444, "end_char_pos": 10455}, {"type": "D", "before": "Dundee West", "after": null, "start_char_pos": 10503, "end_char_pos": 10514}, {"type": "D", "before": "Dunfermine and Fife West", "after": null, "start_char_pos": 10562, "end_char_pos": 10586}, {"type": "D", "before": "City of Durham", "after": null, "start_char_pos": 10634, "end_char_pos": 10648}, {"type": "D", "before": "Durham North", "after": null, "start_char_pos": 10723, "end_char_pos": 10735}, {"type": "D", "before": "Durham North West", "after": null, "start_char_pos": 10809, "end_char_pos": 10826}, {"type": "D", "before": "Dwyfor Meirionnydd", "after": null, "start_char_pos": 10874, "end_char_pos": 10892}, {"type": "D", "before": "Ealing Central and Acton", "after": null, "start_char_pos": 10940, "end_char_pos": 10964}, {"type": "D", "before": "Ealing North", "after": null, "start_char_pos": 11012, "end_char_pos": 11024}, {"type": "D", "before": "Ealing Southall", "after": null, "start_char_pos": 11072, "end_char_pos": 11087}, {"type": "D", "before": "Easington", "after": null, "start_char_pos": 11135, "end_char_pos": 11144}, {"type": "D", "before": "East Ham", "after": null, "start_char_pos": 11218, "end_char_pos": 11226}, {"type": "D", "before": "East Kilbride, Strathaven and Lesmahagow", "after": null, "start_char_pos": 11274, "end_char_pos": 11314}, {"type": "D", "before": "East Lothian", "after": null, "start_char_pos": 11362, "end_char_pos": 11374}, {"type": "D", "before": "Eastbourne", "after": null, "start_char_pos": 11422, "end_char_pos": 11432}, {"type": "D", "before": "Eastleigh", "after": null, "start_char_pos": 11480, "end_char_pos": 11489}, {"type": "D", "before": "Eddisbury", "after": null, "start_char_pos": 11537, "end_char_pos": 11546}, {"type": "D", "before": "Edinburgh East", "after": null, "start_char_pos": 11594, "end_char_pos": 11608}, {"type": "D", "before": "Edinburgh North and Leith", "after": null, "start_char_pos": 11685, "end_char_pos": 11710}, {"type": "D", "before": "Edinburgh South", "after": null, "start_char_pos": 11758, "end_char_pos": 11773}, {"type": "D", "before": "Edinburgh South West", "after": null, "start_char_pos": 11821, "end_char_pos": 11841}, {"type": "D", "before": "Edinburgh West", "after": null, "start_char_pos": 11918, "end_char_pos": 11932}, {"type": "D", "before": "Edmonton", "after": null, "start_char_pos": 12031, "end_char_pos": 12039}, {"type": "D", "before": "Ellesmere Port and Neston", "after": null, "start_char_pos": 12087, "end_char_pos": 12112}, {"type": "D", "before": "Elmet and Rothwell", "after": null, "start_char_pos": 12160, "end_char_pos": 12178}, {"type": "D", "before": "Eltham", "after": null, "start_char_pos": 12226, "end_char_pos": 12232}, {"type": "D", "before": "Enfield North", "after": null, "start_char_pos": 12280, "end_char_pos": 12293}, {"type": "D", "before": "Enfield Southgate", "after": null, "start_char_pos": 12341, "end_char_pos": 12358}, {"type": "D", "before": "Epping Forest", "after": null, "start_char_pos": 12406, "end_char_pos": 12419}, {"type": "D", "before": "Epsom and Ewell", "after": null, "start_char_pos": 12467, "end_char_pos": 12482}, {"type": "D", "before": "Erewash", "after": null, "start_char_pos": 12530, "end_char_pos": 12537}, {"type": "D", "before": "Erith and Thameshead", "after": null, "start_char_pos": 12585, "end_char_pos": 12605}, {"type": "D", "before": "Esher and Walton", "after": null, "start_char_pos": 12653, "end_char_pos": 12669}, {"type": "D", "before": "Exeter", "after": null, "start_char_pos": 12717, "end_char_pos": 12723}, {"type": "D", "before": "Falkirk", "after": null, "start_char_pos": 12798, "end_char_pos": 12805}, {"type": "D", "before": "Fareham", "after": null, "start_char_pos": 12880, "end_char_pos": 12887}, {"type": "D", "before": "Faversham and Kent Mid", "after": null, "start_char_pos": 12969, "end_char_pos": 12991}, {"type": "D", "before": "Feltham and Heston", "after": null, "start_char_pos": 13039, "end_char_pos": 13057}, {"type": "D", "before": "Fermanagh and South Tyrone", "after": null, "start_char_pos": 13105, "end_char_pos": 13131}, {"type": "D", "before": "Fife North East", "after": null, "start_char_pos": 13210, "end_char_pos": 13225}, {"type": "D", "before": "Filton and Bradley Stoke", "after": null, "start_char_pos": 13273, "end_char_pos": 13297}, {"type": "D", "before": "Finchley and Golders Green", "after": null, "start_char_pos": 13345, "end_char_pos": 13371}, {"type": "D", "before": "Folkestone and Hythe", "after": null, "start_char_pos": 13419, "end_char_pos": 13439}, {"type": "D", "before": "Forest of Dean", "after": null, "start_char_pos": 13487, "end_char_pos": 13501}, {"type": "D", "before": "Foyle", "after": null, "start_char_pos": 13549, "end_char_pos": 13554}, {"type": "D", "before": "Flyde", "after": null, "start_char_pos": 13628, "end_char_pos": 13633}, {"type": "D", "before": "Gainsborough", "after": null, "start_char_pos": 13681, "end_char_pos": 13693}, {"type": "D", "before": "Garston and Halewood", "after": null, "start_char_pos": 13775, "end_char_pos": 13795}, {"type": "D", "before": "Gateshead", "after": null, "start_char_pos": 13870, "end_char_pos": 13879}, {"type": "D", "before": "Gedling", "after": null, "start_char_pos": 13927, "end_char_pos": 13934}, {"type": "D", "before": "Gillingham and Rainham", "after": null, "start_char_pos": 14009, "end_char_pos": 14031}, {"type": "D", "before": "Glasgow Central", "after": null, "start_char_pos": 14079, "end_char_pos": 14094}, {"type": "D", "before": "Glasgow East", "after": null, "start_char_pos": 14142, "end_char_pos": 14154}, {"type": "D", "before": "Glasgow North", "after": null, "start_char_pos": 14229, "end_char_pos": 14242}, {"type": "D", "before": "Glasgow North East", "after": null, "start_char_pos": 14290, "end_char_pos": 14308}, {"type": "D", "before": "Glasgow North West", "after": null, "start_char_pos": 14385, "end_char_pos": 14403}, {"type": "D", "before": "Glasgow South", "after": null, "start_char_pos": 14451, "end_char_pos": 14464}, {"type": "D", "before": "Glasgow South West", "after": null, "start_char_pos": 14512, "end_char_pos": 14530}, {"type": "D", "before": "Glenrothes", "after": null, "start_char_pos": 14578, "end_char_pos": 14588}, {"type": "D", "before": "Gloucester", "after": null, "start_char_pos": 14636, "end_char_pos": 14646}, {"type": "D", "before": "Gordon", "after": null, "start_char_pos": 14694, "end_char_pos": 14700}, {"type": "D", "before": "Gosport", "after": null, "start_char_pos": 14748, "end_char_pos": 14755}, {"type": "D", "before": "Gower", "after": null, "start_char_pos": 14803, "end_char_pos": 14808}, {"type": "D", "before": "Grantham and Stamford", "after": null, "start_char_pos": 14856, "end_char_pos": 14877}, {"type": "D", "before": "Gravesham", "after": null, "start_char_pos": 14925, "end_char_pos": 14934}, {"type": "D", "before": "Great Grimsby", "after": null, "start_char_pos": 15024, "end_char_pos": 15037}, {"type": "D", "before": "Great Yarmouth", "after": null, "start_char_pos": 15126, "end_char_pos": 15140}, {"type": "D", "before": "Greenwich and Woolwich", "after": null, "start_char_pos": 15188, "end_char_pos": 15210}, {"type": "D", "before": "Guildford", "after": null, "start_char_pos": 15258, "end_char_pos": 15267}, {"type": "D", "before": "Hackney North and Stoke Newington", "after": null, "start_char_pos": 15353, "end_char_pos": 15386}, {"type": "D", "before": "Hackney South and Shoreditch", "after": null, "start_char_pos": 15434, "end_char_pos": 15462}, {"type": "D", "before": "Halesowen and Rowley Regis", "after": null, "start_char_pos": 15510, "end_char_pos": 15536}, {"type": "D", "before": "Halifax", "after": null, "start_char_pos": 15584, "end_char_pos": 15591}, {"type": "D", "before": "Haltemprice and Howden", "after": null, "start_char_pos": 15639, "end_char_pos": 15661}, {"type": "D", "before": "Halton", "after": null, "start_char_pos": 15751, "end_char_pos": 15757}, {"type": "D", "before": "Hammersmith", "after": null, "start_char_pos": 15805, "end_char_pos": 15816}, {"type": "D", "before": "Hampshire East", "after": null, "start_char_pos": 15908, "end_char_pos": 15922}, {"type": "D", "before": "Hampshire North East", "after": null, "start_char_pos": 15970, "end_char_pos": 15990}, {"type": "D", "before": "Hampshire North West", "after": null, "start_char_pos": 16038, "end_char_pos": 16058}, {"type": "D", "before": "Hampstead and Kilburn", "after": null, "start_char_pos": 16106, "end_char_pos": 16127}, {"type": "D", "before": "Harborough", "after": null, "start_char_pos": 16175, "end_char_pos": 16185}, {"type": "D", "before": "Harlow", "after": null, "start_char_pos": 16233, "end_char_pos": 16239}, {"type": "D", "before": "Harrogate and Knaresborough", "after": null, "start_char_pos": 16287, "end_char_pos": 16314}, {"type": "D", "before": "Harrow East", "after": null, "start_char_pos": 16362, "end_char_pos": 16373}, {"type": "D", "before": "Harrow West", "after": null, "start_char_pos": 16481, "end_char_pos": 16492}, {"type": "D", "before": "Hartlepool", "after": null, "start_char_pos": 16584, "end_char_pos": 16594}, {"type": "D", "before": "Harwich and Essex North", "after": null, "start_char_pos": 16642, "end_char_pos": 16665}, {"type": "D", "before": "Hastings and Rye", "after": null, "start_char_pos": 16713, "end_char_pos": 16729}, {"type": "D", "before": "Havant", "after": null, "start_char_pos": 16777, "end_char_pos": 16783}, {"type": "D", "before": "Hayes and Harlington", "after": null, "start_char_pos": 16831, "end_char_pos": 16851}, {"type": "D", "before": "Hazel Grove", "after": null, "start_char_pos": 16899, "end_char_pos": 16910}, {"type": "D", "before": "Hemel Hempstead", "after": null, "start_char_pos": 16958, "end_char_pos": 16973}, {"type": "D", "before": "Hemsworth", "after": null, "start_char_pos": 17021, "end_char_pos": 17030}, {"type": "D", "before": "Hendon", "after": null, "start_char_pos": 17078, "end_char_pos": 17084}, {"type": "D", "before": "Henley", "after": null, "start_char_pos": 17132, "end_char_pos": 17138}, {"type": "D", "before": "Hereford and Herefordshire South", "after": null, "start_char_pos": 17186, "end_char_pos": 17218}, {"type": "D", "before": "Herefordshire North", "after": null, "start_char_pos": 17313, "end_char_pos": 17332}, {"type": "D", "before": "Hertford and Stortford", "after": null, "start_char_pos": 17430, "end_char_pos": 17452}, {"type": "D", "before": "Hertfordshire North East", "after": null, "start_char_pos": 17536, "end_char_pos": 17560}, {"type": "D", "before": "Hertfordshire South West", "after": null, "start_char_pos": 17658, "end_char_pos": 17682}, {"type": "D", "before": "Hertsmere", "after": null, "start_char_pos": 17730, "end_char_pos": 17739}, {"type": "D", "before": "Hexham", "after": null, "start_char_pos": 17829, "end_char_pos": 17835}, {"type": "D", "before": "Heywood and Middleton", "after": null, "start_char_pos": 17883, "end_char_pos": 17904}, {"type": "D", "before": "High Peak", "after": null, "start_char_pos": 17952, "end_char_pos": 17961}, {"type": "D", "before": "Hitchin and Harpenden", "after": null, "start_char_pos": 18009, "end_char_pos": 18030}, {"type": "D", "before": "Holborn and St Pancras", "after": null, "start_char_pos": 18078, "end_char_pos": 18100}, {"type": "D", "before": "Hornchurch and Upminster", "after": null, "start_char_pos": 18148, "end_char_pos": 18172}, {"type": "D", "before": "Hornsey and Wood Green", "after": null, "start_char_pos": 18220, "end_char_pos": 18242}, {"type": "D", "before": "Horsham", "after": null, "start_char_pos": 18290, "end_char_pos": 18297}, {"type": "D", "before": "Houghton and Sunderland South", "after": null, "start_char_pos": 18345, "end_char_pos": 18374}, {"type": "D", "before": "Hove", "after": null, "start_char_pos": 18466, "end_char_pos": 18470}, {"type": "D", "before": "Huddersfield", "after": null, "start_char_pos": 18518, "end_char_pos": 18530}, {"type": "D", "before": "Hull East", "after": null, "start_char_pos": 18622, "end_char_pos": 18631}, {"type": "D", "before": "Hull North", "after": null, "start_char_pos": 18679, "end_char_pos": 18689}, {"type": "D", "before": "Hull West and Hessle", "after": null, "start_char_pos": 18781, "end_char_pos": 18801}, {"type": "D", "before": "Huntingdon", "after": null, "start_char_pos": 18849, "end_char_pos": 18859}, {"type": "D", "before": "Hyndburn", "after": null, "start_char_pos": 18907, "end_char_pos": 18915}, {"type": "D", "before": "Ilford North", "after": null, "start_char_pos": 18963, "end_char_pos": 18975}, {"type": "D", "before": "Ilford South", "after": null, "start_char_pos": 19023, "end_char_pos": 19035}, {"type": "D", "before": "Inverclyde", "after": null, "start_char_pos": 19083, "end_char_pos": 19093}, {"type": "D", "before": "Inverness, Nairn, Badenoch and Strathspey", "after": null, "start_char_pos": 19141, "end_char_pos": 19182}, {"type": "D", "before": "Ipswich", "after": null, "start_char_pos": 19230, "end_char_pos": 19237}, {"type": "D", "before": "Isle of Wight", "after": null, "start_char_pos": 19285, "end_char_pos": 19298}, {"type": "D", "before": "Islington North", "after": null, "start_char_pos": 19346, "end_char_pos": 19361}, {"type": "D", "before": "Islington South and Finsbury", "after": null, "start_char_pos": 19438, "end_char_pos": 19466}, {"type": "D", "before": "Islwyn", "after": null, "start_char_pos": 19549, "end_char_pos": 19555}, {"type": "D", "before": "Jarrow", "after": null, "start_char_pos": 19603, "end_char_pos": 19609}, {"type": "D", "before": "Keighley", "after": null, "start_char_pos": 19693, "end_char_pos": 19701}, {"type": "D", "before": "Kenilworth and Southam", "after": null, "start_char_pos": 19749, "end_char_pos": 19771}, {"type": "D", "before": "Kensington", "after": null, "start_char_pos": 19819, "end_char_pos": 19829}, {"type": "D", "before": "Kettering", "after": null, "start_char_pos": 19919, "end_char_pos": 19928}, {"type": "D", "before": "Kilmarnock and Loudoun", "after": null, "start_char_pos": 19976, "end_char_pos": 19998}, {"type": "D", "before": "Kingston and Surbiton", "after": null, "start_char_pos": 20046, "end_char_pos": 20067}, {"type": "D", "before": "Kingswood", "after": null, "start_char_pos": 20115, "end_char_pos": 20124}, {"type": "D", "before": "Kilcaldy and Cowdenbeath", "after": null, "start_char_pos": 20172, "end_char_pos": 20196}, {"type": "D", "before": "Knowsley", "after": null, "start_char_pos": 20244, "end_char_pos": 20252}, {"type": "D", "before": "Lagan Valley", "after": null, "start_char_pos": 20300, "end_char_pos": 20312}, {"type": "D", "before": "Lanark and Hamilton East", "after": null, "start_char_pos": 20400, "end_char_pos": 20424}, {"type": "D", "before": "Lancashire West", "after": null, "start_char_pos": 20472, "end_char_pos": 20487}, {"type": "D", "before": "Lancaster and Fleetwood", "after": null, "start_char_pos": 20535, "end_char_pos": 20558}, {"type": "D", "before": "Leeds Central", "after": null, "start_char_pos": 20606, "end_char_pos": 20619}, {"type": "D", "before": "Leeds East", "after": null, "start_char_pos": 20696, "end_char_pos": 20706}, {"type": "D", "before": "Leeds North East", "after": null, "start_char_pos": 20754, "end_char_pos": 20770}, {"type": "D", "before": "Leeds North West", "after": null, "start_char_pos": 20847, "end_char_pos": 20863}, {"type": "D", "before": "Leeds West", "after": null, "start_char_pos": 20911, "end_char_pos": 20921}, {"type": "D", "before": "Leicester East", "after": null, "start_char_pos": 20998, "end_char_pos": 21012}, {"type": "D", "before": "Leicester South", "after": null, "start_char_pos": 21060, "end_char_pos": 21075}, {"type": "D", "before": "Leicester West", "after": null, "start_char_pos": 21159, "end_char_pos": 21173}, {"type": "D", "before": "Leicestershire North West", "after": null, "start_char_pos": 21221, "end_char_pos": 21246}, {"type": "D", "before": "Leicestershire South", "after": null, "start_char_pos": 21294, "end_char_pos": 21314}, {"type": "D", "before": "Leigh", "after": null, "start_char_pos": 21362, "end_char_pos": 21367}, {"type": "D", "before": "Lewes", "after": null, "start_char_pos": 21444, "end_char_pos": 21449}, {"type": "D", "before": "Lewisham Deptford", "after": null, "start_char_pos": 21497, "end_char_pos": 21514}, {"type": "D", "before": "Lewisham East", "after": null, "start_char_pos": 21562, "end_char_pos": 21575}, {"type": "D", "before": "Lewisham West and Penge", "after": null, "start_char_pos": 21623, "end_char_pos": 21646}, {"type": "D", "before": "Leyton and Wanstead", "after": null, "start_char_pos": 21694, "end_char_pos": 21713}, {"type": "D", "before": "Lichfield", "after": null, "start_char_pos": 21761, "end_char_pos": 21770}, {"type": "D", "before": "Lincoln", "after": null, "start_char_pos": 21818, "end_char_pos": 21825}, {"type": "D", "before": "Linlithgow and Falkirk East", "after": null, "start_char_pos": 21873, "end_char_pos": 21900}, {"type": "D", "before": "Liverpool Riverside", "after": null, "start_char_pos": 21948, "end_char_pos": 21967}, {"type": "D", "before": "Liverpool Walton", "after": null, "start_char_pos": 22044, "end_char_pos": 22060}, {"type": "D", "before": "Liverpool Wavertree", "after": null, "start_char_pos": 22108, "end_char_pos": 22127}, {"type": "D", "before": "Liverpool West Derby", "after": null, "start_char_pos": 22175, "end_char_pos": 22195}, {"type": "D", "before": "Livingston", "after": null, "start_char_pos": 22243, "end_char_pos": 22253}, {"type": "D", "before": "Llanelli", "after": null, "start_char_pos": 22301, "end_char_pos": 22309}, {"type": "D", "before": "Londonderry East", "after": null, "start_char_pos": 22400, "end_char_pos": 22416}, {"type": "D", "before": "Loughborough", "after": null, "start_char_pos": 22464, "end_char_pos": 22476}, {"type": "D", "before": "Louth and Horncastle", "after": null, "start_char_pos": 22524, "end_char_pos": 22544}, {"type": "D", "before": "Ludlow", "after": null, "start_char_pos": 22628, "end_char_pos": 22634}, {"type": "D", "before": "Luton North", "after": null, "start_char_pos": 22682, "end_char_pos": 22693}, {"type": "D", "before": "Luton South", "after": null, "start_char_pos": 22772, "end_char_pos": 22783}, {"type": "D", "before": "Macclesfield", "after": null, "start_char_pos": 22875, "end_char_pos": 22887}, {"type": "D", "before": "Maidenhead", "after": null, "start_char_pos": 22936, "end_char_pos": 22946}, {"type": "D", "before": "Maidstone and the Weald", "after": null, "start_char_pos": 23033, "end_char_pos": 23056}, {"type": "D", "before": "Makerfield", "after": null, "start_char_pos": 23141, "end_char_pos": 23151}, {"type": "D", "before": "Maldon", "after": null, "start_char_pos": 23200, "end_char_pos": 23206}, {"type": "D", "before": "Manchester Central", "after": null, "start_char_pos": 23255, "end_char_pos": 23273}, {"type": "D", "before": "Manchester Gorton", "after": null, "start_char_pos": 23322, "end_char_pos": 23339}, {"type": "D", "before": "Manchester Withington", "after": null, "start_char_pos": 23388, "end_char_pos": 23409}, {"type": "D", "before": "Mansfield", "after": null, "start_char_pos": 23458, "end_char_pos": 23467}, {"type": "D", "before": "Meon Valley", "after": null, "start_char_pos": 23516, "end_char_pos": 23527}, {"type": "D", "before": "Meriden", "after": null, "start_char_pos": 23576, "end_char_pos": 23583}, {"type": "D", "before": "Merthyr Tydfil and Rhymney", "after": null, "start_char_pos": 23632, "end_char_pos": 23658}, {"type": "D", "before": "Middlesbrough", "after": null, "start_char_pos": 23707, "end_char_pos": 23720}, {"type": "D", "before": "Middlesbrough South and Cleveland East", "after": null, "start_char_pos": 23769, "end_char_pos": 23807}, {"type": "D", "before": "Midlothian", "after": null, "start_char_pos": 23885, "end_char_pos": 23895}, {"type": "D", "before": "Milton Keynes North", "after": null, "start_char_pos": 23944, "end_char_pos": 23963}, {"type": "D", "before": "Milton Keynes South", "after": null, "start_char_pos": 24012, "end_char_pos": 24031}, {"type": "D", "before": "Mitcham and Morden", "after": null, "start_char_pos": 24080, "end_char_pos": 24098}, {"type": "D", "before": "Mole Valley", "after": null, "start_char_pos": 24176, "end_char_pos": 24187}, {"type": "D", "before": "Monmouth", "after": null, "start_char_pos": 24278, "end_char_pos": 24286}, {"type": "D", "before": "Montgomeryshire", "after": null, "start_char_pos": 24335, "end_char_pos": 24350}, {"type": "D", "before": "Moray", "after": null, "start_char_pos": 24399, "end_char_pos": 24404}, {"type": "D", "before": "Morecambe and Lunesdale", "after": null, "start_char_pos": 24453, "end_char_pos": 24476}, {"type": "D", "before": "Morley and Outwood", "after": null, "start_char_pos": 24525, "end_char_pos": 24543}, {"type": "D", "before": "Motherwell and Wishaw", "after": null, "start_char_pos": 24592, "end_char_pos": 24613}, {"type": "D", "before": "Na H-Eileanan An Iar", "after": null, "start_char_pos": 24662, "end_char_pos": 24682}, {"type": "D", "before": "Neath", "after": null, "start_char_pos": 24756, "end_char_pos": 24761}, {"type": "D", "before": "New Forest East", "after": null, "start_char_pos": 24810, "end_char_pos": 24825}, {"type": "D", "before": "New Forest West", "after": null, "start_char_pos": 24874, "end_char_pos": 24889}, {"type": "D", "before": "Newark", "after": null, "start_char_pos": 24938, "end_char_pos": 24944}, {"type": "D", "before": "Newbury", "after": null, "start_char_pos": 24993, "end_char_pos": 25000}, {"type": "D", "before": "Newcastle-Under-Lyme", "after": null, "start_char_pos": 25049, "end_char_pos": 25069}, {"type": "D", "before": "Newcastle upon Tyne Central", "after": null, "start_char_pos": 25118, "end_char_pos": 25145}, {"type": "D", "before": "Newcastle upon Tyne East", "after": null, "start_char_pos": 25236, "end_char_pos": 25260}, {"type": "D", "before": "Newcastle upon Tyne North", "after": null, "start_char_pos": 25349, "end_char_pos": 25374}, {"type": "D", "before": "Newport East", "after": null, "start_char_pos": 25463, "end_char_pos": 25475}, {"type": "D", "before": "Newport West", "after": null, "start_char_pos": 25524, "end_char_pos": 25536}, {"type": "D", "before": "Newry and Armagh", "after": null, "start_char_pos": 25585, "end_char_pos": 25601}, {"type": "D", "before": "Newton Abbot", "after": null, "start_char_pos": 25650, "end_char_pos": 25662}, {"type": "D", "before": "Norfolk Mid", "after": null, "start_char_pos": 25759, "end_char_pos": 25770}, {"type": "D", "before": "Norfolk North", "after": null, "start_char_pos": 25819, "end_char_pos": 25832}, {"type": "D", "before": "Norfolk North West", "after": null, "start_char_pos": 25881, "end_char_pos": 25899}, {"type": "D", "before": "Norfolk South", "after": null, "start_char_pos": 25948, "end_char_pos": 25961}, {"type": "D", "before": "Norfolk South West", "after": null, "start_char_pos": 26010, "end_char_pos": 26028}, {"type": "D", "before": "Normanton, Pontefract and Castleford", "after": null, "start_char_pos": 26077, "end_char_pos": 26113}, {"type": "D", "before": "Northampton North", "after": null, "start_char_pos": 26162, "end_char_pos": 26179}, {"type": "D", "before": "Northampton South", "after": null, "start_char_pos": 26228, "end_char_pos": 26245}, {"type": "D", "before": "Northamptonshire South", "after": null, "start_char_pos": 26294, "end_char_pos": 26316}, {"type": "D", "before": "Norwich North", "after": null, "start_char_pos": 26401, "end_char_pos": 26414}, {"type": "D", "before": "Norwich South", "after": null, "start_char_pos": 26463, "end_char_pos": 26476}, {"type": "D", "before": "Nottingham East", "after": null, "start_char_pos": 26525, "end_char_pos": 26540}, {"type": "D", "before": "Nottingham North", "after": null, "start_char_pos": 26589, "end_char_pos": 26605}, {"type": "D", "before": "Nottingham South", "after": null, "start_char_pos": 26654, "end_char_pos": 26670}, {"type": "D", "before": "Nuneaton", "after": null, "start_char_pos": 26719, "end_char_pos": 26727}, {"type": "D", "before": "Ochil and Perthshire South", "after": null, "start_char_pos": 26776, "end_char_pos": 26802}, {"type": "D", "before": "Ogmore", "after": null, "start_char_pos": 26880, "end_char_pos": 26886}, {"type": "D", "before": "Old Bexley and Sidcup", "after": null, "start_char_pos": 26935, "end_char_pos": 26956}, {"type": "D", "before": "Oldham East and Saddleworth", "after": null, "start_char_pos": 27005, "end_char_pos": 27032}, {"type": "D", "before": "Oldham West and Royton", "after": null, "start_char_pos": 27081, "end_char_pos": 27103}, {"type": "D", "before": "Orkney and Shetland", "after": null, "start_char_pos": 27152, "end_char_pos": 27171}, {"type": "D", "before": "Orpington", "after": null, "start_char_pos": 27220, "end_char_pos": 27229}, {"type": "D", "before": "Oxford East", "after": null, "start_char_pos": 27278, "end_char_pos": 27289}, {"type": "D", "before": "Oxford West and Abingdon", "after": null, "start_char_pos": 27338, "end_char_pos": 27362}, {"type": "D", "before": "Paisley and Renfrewshire North", "after": null, "start_char_pos": 27411, "end_char_pos": 27441}, {"type": "D", "before": "Paisley and Renfrewshire South", "after": null, "start_char_pos": 27490, "end_char_pos": 27520}, {"type": "D", "before": "Pendle", "after": null, "start_char_pos": 27569, "end_char_pos": 27575}, {"type": "D", "before": "Penistone and Stocksbridge", "after": null, "start_char_pos": 27624, "end_char_pos": 27650}, {"type": "D", "before": "Penrith and the Border", "after": null, "start_char_pos": 27699, "end_char_pos": 27721}, {"type": "D", "before": "Perth and Perthshire North", "after": null, "start_char_pos": 27770, "end_char_pos": 27796}, {"type": "D", "before": "Peterborough", "after": null, "start_char_pos": 27878, "end_char_pos": 27890}, {"type": "D", "before": "Plymouth Moor View", "after": null, "start_char_pos": 27939, "end_char_pos": 27957}, {"type": "D", "before": "Plymouth Sutton and Devonport", "after": null, "start_char_pos": 28047, "end_char_pos": 28076}, {"type": "D", "before": "Pontypridd", "after": null, "start_char_pos": 28173, "end_char_pos": 28183}, {"type": "D", "before": "Poole", "after": null, "start_char_pos": 28261, "end_char_pos": 28266}, {"type": "D", "before": "Poplar and Limehouse", "after": null, "start_char_pos": 28315, "end_char_pos": 28335}, {"type": "D", "before": "Portsmouth North", "after": null, "start_char_pos": 28384, "end_char_pos": 28400}, {"type": "D", "before": "Portsmouth South", "after": null, "start_char_pos": 28449, "end_char_pos": 28465}, {"type": "D", "before": "Preseli Pembrokeshire", "after": null, "start_char_pos": 28514, "end_char_pos": 28535}, {"type": "D", "before": "Preston", "after": null, "start_char_pos": 28584, "end_char_pos": 28591}, {"type": "D", "before": "Pudsey", "after": null, "start_char_pos": 28640, "end_char_pos": 28646}, {"type": "D", "before": "Putney", "after": null, "start_char_pos": 28695, "end_char_pos": 28701}, {"type": "D", "before": "Rayleigh and Wickford", "after": null, "start_char_pos": 28750, "end_char_pos": 28771}, {"type": "D", "before": "Reading East", "after": null, "start_char_pos": 28820, "end_char_pos": 28832}, {"type": "D", "before": "Reading West", "after": null, "start_char_pos": 28881, "end_char_pos": 28893}, {"type": "D", "before": "Redcar", "after": null, "start_char_pos": 28942, "end_char_pos": 28948}, {"type": "D", "before": "Redditch", "after": null, "start_char_pos": 29055, "end_char_pos": 29063}, {"type": "D", "before": "Reigate", "after": null, "start_char_pos": 29112, "end_char_pos": 29119}, {"type": "D", "before": "Renfrewshire East", "after": null, "start_char_pos": 29168, "end_char_pos": 29185}, {"type": "D", "before": "Rhondda", "after": null, "start_char_pos": 29234, "end_char_pos": 29241}, {"type": "D", "before": "Ribble Valley", "after": null, "start_char_pos": 29290, "end_char_pos": 29303}, {"type": "D", "before": "Richmond Yorks", "after": null, "start_char_pos": 29352, "end_char_pos": 29366}, {"type": "D", "before": "Richmond Park", "after": null, "start_char_pos": 29415, "end_char_pos": 29428}, {"type": "D", "before": "Rochdale", "after": null, "start_char_pos": 29477, "end_char_pos": 29485}, {"type": "D", "before": "Rochester and Strood", "after": null, "start_char_pos": 29534, "end_char_pos": 29554}, {"type": "D", "before": "Rochford and Southend East", "after": null, "start_char_pos": 29639, "end_char_pos": 29665}, {"type": "D", "before": "Romford", "after": null, "start_char_pos": 29714, "end_char_pos": 29721}, {"type": "D", "before": "Romsey and Southampton North", "after": null, "start_char_pos": 29770, "end_char_pos": 29798}, {"type": "D", "before": "Ross, Skye and Lochaber", "after": null, "start_char_pos": 29847, "end_char_pos": 29870}, {"type": "D", "before": "Rossendale and Darwen", "after": null, "start_char_pos": 29919, "end_char_pos": 29940}, {"type": "D", "before": "Rother Valley", "after": null, "start_char_pos": 29989, "end_char_pos": 30002}, {"type": "D", "before": "Rotherham", "after": null, "start_char_pos": 30051, "end_char_pos": 30060}, {"type": "D", "before": "Rugby", "after": null, "start_char_pos": 30109, "end_char_pos": 30114}, {"type": "D", "before": "Ruislip, Northwood and Pinner", "after": null, "start_char_pos": 30163, "end_char_pos": 30192}, {"type": "D", "before": "Runnymede and Weybridge", "after": null, "start_char_pos": 30241, "end_char_pos": 30264}, {"type": "D", "before": "Rushcliffe", "after": null, "start_char_pos": 30313, "end_char_pos": 30323}, {"type": "D", "before": "Rutherglen and Hamilton West", "after": null, "start_char_pos": 30372, "end_char_pos": 30400}, {"type": "D", "before": "Rutland and Melton", "after": null, "start_char_pos": 30449, "end_char_pos": 30467}, {"type": "D", "before": "Saffron Walden", "after": null, "start_char_pos": 30516, "end_char_pos": 30530}, {"type": "D", "before": "St Albans", "after": null, "start_char_pos": 30579, "end_char_pos": 30588}, {"type": "D", "before": "St Austell and Newquay", "after": null, "start_char_pos": 30637, "end_char_pos": 30659}, {"type": "D", "before": "St Helens North", "after": null, "start_char_pos": 30749, "end_char_pos": 30764}, {"type": "D", "before": "St Helens South", "after": null, "start_char_pos": 30842, "end_char_pos": 30857}, {"type": "D", "before": "St Ives", "after": null, "start_char_pos": 30935, "end_char_pos": 30942}, {"type": "D", "before": "Salford and Eccles", "after": null, "start_char_pos": 30991, "end_char_pos": 31009}, {"type": "D", "before": "Salisbury", "after": null, "start_char_pos": 31087, "end_char_pos": 31096}, {"type": "D", "before": "Scarborough and Whitby", "after": null, "start_char_pos": 31145, "end_char_pos": 31167}, {"type": "D", "before": "Scunthorpe", "after": null, "start_char_pos": 31252, "end_char_pos": 31262}, {"type": "D", "before": "Sedgefield", "after": null, "start_char_pos": 31311, "end_char_pos": 31321}, {"type": "D", "before": "Sefton Central", "after": null, "start_char_pos": 31412, "end_char_pos": 31426}, {"type": "D", "before": "Selby and Ainsty", "after": null, "start_char_pos": 31475, "end_char_pos": 31491}, {"type": "D", "before": "Sevenoaks", "after": null, "start_char_pos": 31576, "end_char_pos": 31585}, {"type": "D", "before": "Sheffield Brightside and Hillsborough", "after": null, "start_char_pos": 31634, "end_char_pos": 31671}, {"type": "D", "before": "Sheffield Central", "after": null, "start_char_pos": 31750, "end_char_pos": 31767}, {"type": "D", "before": "Sheffield Hallam", "after": null, "start_char_pos": 31846, "end_char_pos": 31862}, {"type": "D", "before": "Sheffield Heeley", "after": null, "start_char_pos": 31955, "end_char_pos": 31971}, {"type": "D", "before": "Sheffield South East", "after": null, "start_char_pos": 32020, "end_char_pos": 32040}, {"type": "D", "before": "Sherwood", "after": null, "start_char_pos": 32118, "end_char_pos": 32126}, {"type": "D", "before": "Shipley", "after": null, "start_char_pos": 32175, "end_char_pos": 32182}, {"type": "D", "before": "Shrewsbury and Atcham", "after": null, "start_char_pos": 32267, "end_char_pos": 32288}, {"type": "D", "before": "Shropshire North", "after": null, "start_char_pos": 32337, "end_char_pos": 32353}, {"type": "D", "before": "Sittingbourne and Sheppey", "after": null, "start_char_pos": 32438, "end_char_pos": 32463}, {"type": "D", "before": "Skipton and Ripon", "after": null, "start_char_pos": 32512, "end_char_pos": 32529}, {"type": "D", "before": "Sleaford and North Hykeham", "after": null, "start_char_pos": 32578, "end_char_pos": 32604}, {"type": "D", "before": "Slough", "after": null, "start_char_pos": 32689, "end_char_pos": 32695}, {"type": "D", "before": "Solihull", "after": null, "start_char_pos": 32744, "end_char_pos": 32752}, {"type": "D", "before": "Somerset North", "after": null, "start_char_pos": 32859, "end_char_pos": 32873}, {"type": "D", "before": "Somerset North East", "after": null, "start_char_pos": 32922, "end_char_pos": 32941}, {"type": "D", "before": "Somerton and Frome", "after": null, "start_char_pos": 32990, "end_char_pos": 33008}, {"type": "D", "before": "South Holland and the Deepings", "after": null, "start_char_pos": 33098, "end_char_pos": 33128}, {"type": "D", "before": "South Ribble", "after": null, "start_char_pos": 33177, "end_char_pos": 33189}, {"type": "D", "before": "South Shields", "after": null, "start_char_pos": 33238, "end_char_pos": 33251}, {"type": "D", "before": "Southampton Itchen", "after": null, "start_char_pos": 33329, "end_char_pos": 33347}, {"type": "D", "before": "Southampton Test", "after": null, "start_char_pos": 33425, "end_char_pos": 33441}, {"type": "D", "before": "Southampton West", "after": null, "start_char_pos": 33519, "end_char_pos": 33535}, {"type": "D", "before": "Southport", "after": null, "start_char_pos": 33584, "end_char_pos": 33593}, {"type": "D", "before": "Spelthorne", "after": null, "start_char_pos": 33642, "end_char_pos": 33652}, {"type": "D", "before": "Stafford", "after": null, "start_char_pos": 33701, "end_char_pos": 33709}, {"type": "D", "before": "Staffordshire Moorlands", "after": null, "start_char_pos": 33758, "end_char_pos": 33781}, {"type": "D", "before": "Staffordshire South", "after": null, "start_char_pos": 33830, "end_char_pos": 33849}, {"type": "D", "before": "Stalybridge and Hyde", "after": null, "start_char_pos": 33898, "end_char_pos": 33918}, {"type": "D", "before": "Stevenage", "after": null, "start_char_pos": 33967, "end_char_pos": 33976}, {"type": "D", "before": "Stirling", "after": null, "start_char_pos": 34025, "end_char_pos": 34033}, {"type": "D", "before": "Stockport", "after": null, "start_char_pos": 34108, "end_char_pos": 34117}, {"type": "D", "before": "Stockton North", "after": null, "start_char_pos": 34195, "end_char_pos": 34209}, {"type": "D", "before": "Stockton South", "after": null, "start_char_pos": 34258, "end_char_pos": 34272}, {"type": "D", "before": "Stoke-on-Trent Central", "after": null, "start_char_pos": 34321, "end_char_pos": 34343}, {"type": "D", "before": "Stoke-on-Trent North", "after": null, "start_char_pos": 34392, "end_char_pos": 34412}, {"type": "D", "before": "Stoke-on-Trent South", "after": null, "start_char_pos": 34461, "end_char_pos": 34481}, {"type": "D", "before": "Stone", "after": null, "start_char_pos": 34559, "end_char_pos": 34564}, {"type": "D", "before": "Stourbridge", "after": null, "start_char_pos": 34613, "end_char_pos": 34624}, {"type": "D", "before": "Strangford", "after": null, "start_char_pos": 34673, "end_char_pos": 34683}, {"type": "D", "before": "Stratford-on-Avon", "after": null, "start_char_pos": 34732, "end_char_pos": 34749}, {"type": "D", "before": "Streatham", "after": null, "start_char_pos": 34798, "end_char_pos": 34807}, {"type": "D", "before": "Stretford and Urmston", "after": null, "start_char_pos": 34856, "end_char_pos": 34877}, {"type": "D", "before": "Stroud", "after": null, "start_char_pos": 34926, "end_char_pos": 34932}, {"type": "D", "before": "suffolk Central and Ipswitch North", "after": null, "start_char_pos": 34981, "end_char_pos": 35015}, {"type": "D", "before": "Suffolk Coastal", "after": null, "start_char_pos": 35064, "end_char_pos": 35079}, {"type": "D", "before": "Suffolk South", "after": null, "start_char_pos": 35128, "end_char_pos": 35141}, {"type": "D", "before": "Suffolk West", "after": null, "start_char_pos": 35190, "end_char_pos": 35202}, {"type": "D", "before": "Sunderland Central", "after": null, "start_char_pos": 35251, "end_char_pos": 35269}, {"type": "D", "before": "Surrey East (UK Parliament constituency)", "after": null, "start_char_pos": 35354, "end_char_pos": 35394}, {"type": "D", "before": "Surrey Heath", "after": null, "start_char_pos": 35493, "end_char_pos": 35505}, {"type": "D", "before": "Surrey South West", "after": null, "start_char_pos": 35596, "end_char_pos": 35613}, {"type": "D", "before": "Sussex Mid", "after": null, "start_char_pos": 35704, "end_char_pos": 35714}, {"type": "D", "before": "Sutton and Cheam", "after": null, "start_char_pos": 35801, "end_char_pos": 35817}, {"type": "D", "before": "Sutton Coldfield", "after": null, "start_char_pos": 35866, "end_char_pos": 35882}, {"type": "D", "before": "Swansea East", "after": null, "start_char_pos": 35931, "end_char_pos": 35943}, {"type": "D", "before": "Swansea West", "after": null, "start_char_pos": 35992, "end_char_pos": 36004}, {"type": "D", "before": "Swindon North", "after": null, "start_char_pos": 36053, "end_char_pos": 36066}, {"type": "D", "before": "Swindon South", "after": null, "start_char_pos": 36115, "end_char_pos": 36128}, {"type": "D", "before": "Tamworth", "after": null, "start_char_pos": 36177, "end_char_pos": 36185}, {"type": "D", "before": "Tatton", "after": null, "start_char_pos": 36234, "end_char_pos": 36240}, {"type": "D", "before": "Taunton Deane", "after": null, "start_char_pos": 36289, "end_char_pos": 36302}, {"type": "D", "before": "Telford", "after": null, "start_char_pos": 36392, "end_char_pos": 36399}, {"type": "D", "before": "Tewkesbury", "after": null, "start_char_pos": 36448, "end_char_pos": 36458}, {"type": "D", "before": "Thanet North", "after": null, "start_char_pos": 36543, "end_char_pos": 36555}, {"type": "D", "before": "Thanet South", "after": null, "start_char_pos": 36604, "end_char_pos": 36616}, {"type": "D", "before": "Thirsk and Malton", "after": null, "start_char_pos": 36665, "end_char_pos": 36682}, {"type": "D", "before": "Thornbury and Yate", "after": null, "start_char_pos": 36759, "end_char_pos": 36777}, {"type": "D", "before": "Thurrock", "after": null, "start_char_pos": 36826, "end_char_pos": 36834}, {"type": "D", "before": "Tiverton and Honiton", "after": null, "start_char_pos": 36883, "end_char_pos": 36903}, {"type": "D", "before": "Tonbridge and Malling", "after": null, "start_char_pos": 36988, "end_char_pos": 37009}, {"type": "D", "before": "Tooting", "after": null, "start_char_pos": 37058, "end_char_pos": 37065}, {"type": "D", "before": "Torbay", "after": null, "start_char_pos": 37114, "end_char_pos": 37120}, {"type": "D", "before": "Torfaen", "after": null, "start_char_pos": 37210, "end_char_pos": 37217}, {"type": "D", "before": "Totnes", "after": null, "start_char_pos": 37266, "end_char_pos": 37272}, {"type": "D", "before": "Tottenham", "after": null, "start_char_pos": 37354, "end_char_pos": 37363}, {"type": "D", "before": "Truro and Falmouth", "after": null, "start_char_pos": 37412, "end_char_pos": 37430}, {"type": "D", "before": "Tunbridge Wells", "after": null, "start_char_pos": 37522, "end_char_pos": 37537}, {"type": "D", "before": "Twickenham", "after": null, "start_char_pos": 37586, "end_char_pos": 37596}, {"type": "D", "before": "Tynemouth", "after": null, "start_char_pos": 37645, "end_char_pos": 37654}, {"type": "D", "before": "Tyneside North", "after": null, "start_char_pos": 37703, "end_char_pos": 37717}, {"type": "D", "before": "Tyrone West", "after": null, "start_char_pos": 37766, "end_char_pos": 37777}, {"type": "D", "before": "Ulster Mid", "after": null, "start_char_pos": 37855, "end_char_pos": 37865}, {"type": "D", "before": "Upper Bann", "after": null, "start_char_pos": 37914, "end_char_pos": 37924}, {"type": "D", "before": "Uxbridge and Ruiislip South", "after": null, "start_char_pos": 38012, "end_char_pos": 38039}, {"type": "D", "before": "Vale of Clwyd", "after": null, "start_char_pos": 38088, "end_char_pos": 38101}, {"type": "D", "before": "Vale of Glamorgan", "after": null, "start_char_pos": 38176, "end_char_pos": 38193}, {"type": "D", "before": "Vauxhall", "after": null, "start_char_pos": 38242, "end_char_pos": 38250}, {"type": "D", "before": "Wakefield", "after": null, "start_char_pos": 38299, "end_char_pos": 38308}, {"type": "D", "before": "Wallasey", "after": null, "start_char_pos": 38357, "end_char_pos": 38365}, {"type": "D", "before": "Walsall North", "after": null, "start_char_pos": 38414, "end_char_pos": 38427}, {"type": "D", "before": "Walsall South", "after": null, "start_char_pos": 38505, "end_char_pos": 38518}, {"type": "D", "before": "Walthamstow", "after": null, "start_char_pos": 38596, "end_char_pos": 38607}, {"type": "D", "before": "Wansbeck", "after": null, "start_char_pos": 38656, "end_char_pos": 38664}, {"type": "D", "before": "Wantage", "after": null, "start_char_pos": 38713, "end_char_pos": 38720}, {"type": "D", "before": "Warley", "after": null, "start_char_pos": 38769, "end_char_pos": 38775}, {"type": "D", "before": "Warrington North", "after": null, "start_char_pos": 38852, "end_char_pos": 38868}, {"type": "D", "before": "Warrington South", "after": null, "start_char_pos": 38917, "end_char_pos": 38933}, {"type": "D", "before": "Warwick and Leamington", "after": null, "start_char_pos": 38982, "end_char_pos": 39004}, {"type": "D", "before": "Warwickshire North", "after": null, "start_char_pos": 39053, "end_char_pos": 39071}, {"type": "D", "before": "Washington and Sunderland West", "after": null, "start_char_pos": 39120, "end_char_pos": 39150}, {"type": "D", "before": "Watford", "after": null, "start_char_pos": 39233, "end_char_pos": 39240}, {"type": "D", "before": "Waveney", "after": null, "start_char_pos": 39289, "end_char_pos": 39296}, {"type": "D", "before": "Wealden", "after": null, "start_char_pos": 39345, "end_char_pos": 39352}, {"type": "D", "before": "Weaver Vale", "after": null, "start_char_pos": 39436, "end_char_pos": 39447}, {"type": "D", "before": "Wellingborough", "after": null, "start_char_pos": 39496, "end_char_pos": 39510}, {"type": "D", "before": "Wells", "after": null, "start_char_pos": 39594, "end_char_pos": 39599}, {"type": "D", "before": "Welwyn Hatfield", "after": null, "start_char_pos": 39703, "end_char_pos": 39718}, {"type": "D", "before": "Wentworth and Dearne", "after": null, "start_char_pos": 39767, "end_char_pos": 39787}, {"type": "D", "before": "West Bromwich East", "after": null, "start_char_pos": 39836, "end_char_pos": 39854}, {"type": "D", "before": "West Bromwich West", "after": null, "start_char_pos": 39903, "end_char_pos": 39921}, {"type": "D", "before": "West Ham", "after": null, "start_char_pos": 39970, "end_char_pos": 39978}, {"type": "D", "before": "Westminster North", "after": null, "start_char_pos": 40027, "end_char_pos": 40044}, {"type": "D", "before": "Westmorland and Lonsdale", "after": null, "start_char_pos": 40121, "end_char_pos": 40145}, {"type": "D", "before": "Weston Super-Mare", "after": null, "start_char_pos": 40194, "end_char_pos": 40211}, {"type": "D", "before": "Wigan", "after": null, "start_char_pos": 40260, "end_char_pos": 40265}, {"type": "D", "before": "Wiltshire North", "after": null, "start_char_pos": 40314, "end_char_pos": 40329}, {"type": "D", "before": "Wiltshire South West", "after": null, "start_char_pos": 40378, "end_char_pos": 40398}, {"type": "D", "before": "Wimbledon", "after": null, "start_char_pos": 40447, "end_char_pos": 40456}, {"type": "D", "before": "Winchester", "after": null, "start_char_pos": 40505, "end_char_pos": 40515}, {"type": "D", "before": "Windsor", "after": null, "start_char_pos": 40564, "end_char_pos": 40571}, {"type": "D", "before": "Wirral South", "after": null, "start_char_pos": 40620, "end_char_pos": 40632}, {"type": "D", "before": "Wirral West", "after": null, "start_char_pos": 40709, "end_char_pos": 40720}, {"type": "D", "before": "Witham", "after": null, "start_char_pos": 40804, "end_char_pos": 40810}, {"type": "D", "before": "Witney", "after": null, "start_char_pos": 40859, "end_char_pos": 40865}, {"type": "D", "before": "Woking", "after": null, "start_char_pos": 40914, "end_char_pos": 40920}, {"type": "D", "before": "Wokingham", "after": null, "start_char_pos": 41018, "end_char_pos": 41027}, {"type": "D", "before": "Wolverhampton North East", "after": null, "start_char_pos": 41117, "end_char_pos": 41141}, {"type": "D", "before": "Wolverhampton South East", "after": null, "start_char_pos": 41190, "end_char_pos": 41214}, {"type": "D", "before": "Wolverhampton South West", "after": null, "start_char_pos": 41263, "end_char_pos": 41287}, {"type": "D", "before": "Worcester", "after": null, "start_char_pos": 41336, "end_char_pos": 41345}, {"type": "D", "before": "Worcestershire Mid", "after": null, "start_char_pos": 41394, "end_char_pos": 41412}, {"type": "D", "before": "Worcestershire West", "after": null, "start_char_pos": 41496, "end_char_pos": 41515}, {"type": "D", "before": "Workington", "after": null, "start_char_pos": 41564, "end_char_pos": 41574}, {"type": "D", "before": "Worsley and Eccles South", "after": null, "start_char_pos": 41651, "end_char_pos": 41675}, {"type": "D", "before": "Worthing East and Shoreham", "after": null, "start_char_pos": 41752, "end_char_pos": 41778}, {"type": "D", "before": "Worthing West", "after": null, "start_char_pos": 41862, "end_char_pos": 41875}, {"type": "D", "before": "The Wreckin", "after": null, "start_char_pos": 41959, "end_char_pos": 41970}, {"type": "D", "before": "Wrexham", "after": null, "start_char_pos": 42019, "end_char_pos": 42026}, {"type": "D", "before": "Wycombe", "after": null, "start_char_pos": 42109, "end_char_pos": 42116}, {"type": "D", "before": "Wyre and Preston North", "after": null, "start_char_pos": 42200, "end_char_pos": 42222}, {"type": "D", "before": "Wyre Forest", "after": null, "start_char_pos": 42312, "end_char_pos": 42323}, {"type": "D", "before": "Wythenshawe and Sale East", "after": null, "start_char_pos": 42400, "end_char_pos": 42425}, {"type": "D", "before": "Yeovil", "after": null, "start_char_pos": 42502, "end_char_pos": 42508}, {"type": "D", "before": "Ynys Mon", "after": null, "start_char_pos": 42605, "end_char_pos": 42613}, {"type": "D", "before": "York Central", "after": null, "start_char_pos": 42696, "end_char_pos": 42708}, {"type": "D", "before": "York Outer", "after": null, "start_char_pos": 42800, "end_char_pos": 42810}, {"type": "D", "before": "Yorkshire East", "after": null, "start_char_pos": 42922, "end_char_pos": 42936}], "sents_char_pos": [0, 255, 601, 945, 1114, 1213, 1264, 1320, 1547, 1647, 2065, 2137, 2354, 2418, 2551, 2648, 2862, 2937, 3121, 3340, 3395, 3450, 3503, 3614, 3776, 3934, 4081, 4156, 4340, 4794, 4966, 5159, 5342, 5405, 5500, 5554, 5637, 6121, 6281, 6331, 6447, 6624, 6964, 7060, 7201, 7296, 7407, 7457, 7505, 7602, 7706, 7809, 7919, 8018, 8121, 8171, 8225, 8329, 8386, 8436, 8540, 8606, 8642, 8703, 8803, 8853, 8896, 8961, 9006, 9116, 9172, 9230, 9295, 9358, 9431, 9491, 9551, 9618, 9658, 9716, 9745, 9803, 9868, 9902, 9988, 10048, 10120, 10189, 10275, 10342, 10409, 10468, 10527, 10599, 10661, 10712, 10748, 10839, 10905, 10977, 11037, 11100, 11157, 11239, 11327, 11387, 11445, 11502, 11559, 11621, 11723, 11786, 11854, 11945, 12052, 12125, 12191, 12245, 12306, 12371, 12432, 12495, 12550, 12618, 12682, 12736, 12818, 12869, 12900, 12958, 13004, 13070, 13144, 13199, 13238, 13310, 13384, 13452, 13514, 13567, 13646, 13706, 13764, 13808, 13892, 13947, 14044, 14107, 14167, 14255, 14321, 14416, 14477, 14543, 14601, 14659, 14713, 14768, 14821, 14890, 14947, 15050, 15100, 15153, 15223, 15280, 15337, 15399, 15475, 15549, 15604, 15674, 15770, 15829, 15935, 16003, 16071, 16140, 16198, 16252, 16327, 16386, 16505, 16607, 16678, 16742, 16796, 16864, 16923, 16986, 17043, 17097, 17151, 17231, 17297, 17345, 17465, 17573, 17695, 17752, 17848, 17917, 17974, 18043, 18113, 18185, 18255, 18310, 18387, 18483, 18543, 18644, 18702, 18814, 18872, 18928, 18988, 19048, 19106, 19195, 19250, 19311, 19374, 19479, 19568, 19622, 19714, 19784, 19842, 19941, 20011, 20080, 20137, 20209, 20265, 20325, 20437, 20500, 20571, 20632, 20719, 20783, 20876, 20934, 21025, 21088, 21186, 21259, 21327, 21380, 21462, 21527, 21588, 21659, 21726, 21783, 21838, 21913, 21980, 22073, 22140, 22208, 22266, 22322, 22429, 22489, 22557, 22647, 22706, 22756, 22796, 22900, 22959, 23017, 23069, 23164, 23219, 23286, 23352, 23422, 23480, 23540, 23596, 23671, 23733, 23820, 23908, 23976, 24044, 24111, 24200, 24299, 24363, 24417, 24489, 24556, 24626, 24695, 24774, 24838, 24902, 24957, 25013, 25082, 25158, 25273, 25387, 25488, 25549, 25614, 25675, 25783, 25845, 25912, 25974, 26041, 26126, 26192, 26258, 26329, 26427, 26489, 26553, 26618, 26683, 26740, 26815, 26899, 26969, 27045, 27116, 27184, 27242, 27302, 27375, 27454, 27533, 27588, 27663, 27734, 27809, 27903, 27970, 28022, 28089, 28157, 28196, 28279, 28348, 28413, 28478, 28548, 28604, 28659, 28714, 28784, 28845, 28906, 28961, 29076, 29132, 29198, 29254, 29316, 29379, 29441, 29498, 29567, 29678, 29734, 29811, 29883, 29953, 30015, 30073, 30127, 30205, 30277, 30336, 30413, 30480, 30543, 30601, 30672, 30777, 30870, 30955, 31022, 31109, 31180, 31275, 31334, 31386, 31439, 31504, 31598, 31684, 31780, 31875, 31984, 32053, 32139, 32195, 32301, 32366, 32476, 32542, 32617, 32708, 32765, 32886, 32954, 33021, 33087, 33141, 33202, 33264, 33360, 33454, 33548, 33606, 33665, 33722, 33794, 33862, 33931, 33989, 34046, 34130, 34222, 34285, 34356, 34425, 34494, 34577, 34637, 34696, 34762, 34820, 34890, 34945, 35028, 35092, 35154, 35215, 35282, 35343, 35407, 35518, 35626, 35727, 35830, 35895, 35956, 36017, 36079, 36141, 36198, 36253, 36315, 36381, 36412, 36471, 36568, 36629, 36695, 36790, 36847, 36916, 37022, 37078, 37133, 37230, 37285, 37376, 37443, 37550, 37609, 37667, 37730, 37790, 37878, 37937, 38052, 38114, 38165, 38206, 38263, 38321, 38378, 38440, 38531, 38620, 38677, 38733, 38788, 38881, 38946, 39017, 39084, 39163, 39253, 39309, 39365, 39460, 39523, 39612, 39731, 39800, 39867, 39934, 39991, 40057, 40158, 40224, 40278, 40342, 40411, 40469, 40528, 40584, 40645, 40733, 40823, 40878, 40933, 41040, 41154, 41227, 41300, 41358, 41425, 41528, 41587, 41688, 41791, 41888, 41983, 42039, 42129, 42235, 42336, 42438, 42521, 42626, 42721, 42823, 42949]} {"doc_id": "181719", "revision_depth": "1", "before_revision": "Dallas Braden. Dallas Braden , a left-handed pitcher for Major League Baseball's Oakland Athletics in the United States , became one of only nineteen players in the history of the MLB to pitch a perfect game , in a 4-0 win against the Tampa Bay Rays . Braden, aged 26, who retired all 27 batters consecutively on 109 pitches, also earned his first career complete game . In the process of throwing the perfect game, Braden also struck out six Tampa Bay hitters. The perfect game was the second pitched in the Athletics' franchise history, the other being thrown by Hall of Fame pitcher Catfish Hunter on May 8, 1968 against the Minnesota Twins . Braden, at 26, also became the youngest pitcher to throw a complete game since Anaheim Angels pitcher Mike Witt did so at age 24 in 1984. The low crowd at the Oakland Coliseum , at only 12,228, was due to the Mother's Day holiday occurring across the United States, Braden, along with every other Major League Baseball player, donned pink equipment for awareness of breast cancer, which has become a tradition for baseball players on Mother's Day. Braden's own mother died of skin cancer when he was a senior in high school, but his grandmother attended the game. Braden recently drew controversy in the league after publicly criticizing New York Yankees all-star third baseman Alex Rodriguez for crossing the pitcher's mound after a foul ball, which Braden claimed to be an \"unwritten rule\" in baseball. When asked about the no hitter, Rodriguez simply responded, \"Good for him, he threw a perfect game. And even better, he beat the Rays,\" he said, as the Rays lead the American League East division, the same division that Yankees play in. \"Mother's Day hasn't been a joyous day for me in a while. But to know that I still get to come out and compete and play a game on that day, that makes it a little better. With my grandma in the stands, that makes it a lot better. To be able to give her this today was perfect...,\" said Braden in a post-game interview with MLB.com .", "after_revision": "Dallas Braden. , a left-handed pitcher for 's in the , became one of only nineteen players in the history of the MLB to pitch a , in a 4-0 win against the . Braden, aged 26, who retired all 27 batters consecutively on 109 pitches, also earned his first career . In the process of throwing the perfect game, Braden also six Tampa Bay hitters. The perfect game was the second pitched in the Athletics' franchise history, the other being thrown by pitcher on May 8, 1968 against the . Braden, at 26, also became the youngest pitcher to throw a complete game since pitcher did so at age 24 in 1984. The low crowd at the , at only 12,228, was due to the holiday occurring across the United States, Braden, along with every other Major League Baseball player, donned pink equipment for awareness of breast cancer, which has become a tradition for baseball players on Mother's Day. Braden's own mother died of skin cancer when he was a senior in high school, but his grandmother attended the game. Braden recently drew controversy in the league after publicly criticizing all-star third baseman for crossing the pitcher's mound after a foul ball, which Braden claimed to be an \"unwritten rule\" in baseball. When asked about the no hitter, Rodriguez simply responded, \"Good for him, he threw a perfect game. And even better, he beat the Rays,\" he said, as the Rays lead the American League East division, the same division that Yankees play in. \"Mother's Day hasn't been a joyous day for me in a while. But to know that I still get to come out and compete and play a game on that day, that makes it a little better. With my grandma in the stands, that makes it a lot better. To be able to give her this today was perfect...,\" said Braden in a post-game interview with .", "edit_actions": [{"type": "D", "before": "Dallas Braden", "after": null, "start_char_pos": 15, "end_char_pos": 28}, {"type": "R", "before": "Major League Baseball's Oakland Athletics in the United States", "after": "'s in the", "start_char_pos": 57, "end_char_pos": 119}, {"type": "D", "before": "perfect game", "after": null, "start_char_pos": 195, "end_char_pos": 207}, {"type": "D", "before": "Tampa Bay Rays", "after": null, "start_char_pos": 235, "end_char_pos": 249}, {"type": "D", "before": "complete game", "after": null, "start_char_pos": 355, "end_char_pos": 368}, {"type": "D", "before": "struck out", "after": null, "start_char_pos": 428, "end_char_pos": 438}, {"type": "R", "before": "Hall of Fame pitcher Catfish Hunter", "after": "pitcher", "start_char_pos": 565, "end_char_pos": 600}, {"type": "D", "before": "Minnesota Twins", "after": null, "start_char_pos": 628, "end_char_pos": 643}, {"type": "R", "before": "Anaheim Angels pitcher Mike Witt", "after": "pitcher", "start_char_pos": 725, "end_char_pos": 757}, {"type": "D", "before": "Oakland Coliseum", "after": null, "start_char_pos": 805, "end_char_pos": 821}, {"type": "D", "before": "Mother's Day", "after": null, "start_char_pos": 855, "end_char_pos": 867}, {"type": "D", "before": "New York Yankees", "after": null, "start_char_pos": 1284, "end_char_pos": 1300}, {"type": "D", "before": "Alex Rodriguez", "after": null, "start_char_pos": 1324, "end_char_pos": 1338}, {"type": "D", "before": "MLB.com", "after": null, "start_char_pos": 2011, "end_char_pos": 2018}], "sents_char_pos": [0, 14, 370, 461, 783, 1093, 1209, 1450, 1550, 1687, 1745, 1858, 1917, 1966]} {"doc_id": "1842580", "revision_depth": "1", "before_revision": "At least twelve people have been killed today in a shooting at the offices of the satirical weekly magazine . Three men in hoods armed with entered the magazine's office in the and shot dead ten journalists and two police officers before making a getaway in a car driven by a fourth collaborator. Five people have been seriously injured in the attack. A member of the police said after leaving the scene the attackers drove to the northeastern suburbs of Paris where they abandoned their vehicle and hijacked another car. French police union Unit\u00e9 spokesman Rocco Contento said of the crime scene, \"it was a real butchery\". The French Government have raised the country's security level to the maximum. President told reporters: \"This is a terrorist attack, there is no doubt about it\". Gerard Biard, the editor-in-chief of Charlie Hebdo, stated: \"I don't understand how people can attack a newspaper with heavy weapons. A newspaper is not a weapon of war.\" The magazine recently posted a cartoon on depicting , a leader of the militant group. US President gave a statement condemning the attack: \"France is America \u2019 s oldest ally, and has stood shoulder to shoulder with the United States in the fight against terrorists who threaten our shared security and the world. Time and again, the French people have stood up for the universal values that generations of our people have defended.\" Obama also said that the US would provide assistance \"to help bring these terrorists to justice\". British Prime Minister tweeted: \"The murders in Paris are sickening. We stand with the French people in the fight against terror and defending the freedom of the press.\" The and the -based have also condemned the attack. In 2006, Charlie Hebdo ran the cartoons depicting that originally appeared in the newspaper . In 2011, it published another cartoon depiction of Muhammed subtitled \"Charia Hebdo\", a pun on . The magazine's office was subsequently firebombed. Following the bombing, the magazine's website was hacked and death threats were made against their staff. The magazine responded by publishing on their front page an image showing both the remains of the magazine's offices and one of their cartoonists kissing a bearded Muslim man. The cover contained the headline .", "after_revision": "At least twelve people have been killed today in a shooting at the Paris offices of the satirical weekly French magazine Charlie Hebdo . Three men in hoods armed with entered the magazine's office in the and shot dead ten journalists and two police officers before making a getaway in a car driven by a fourth collaborator. Five people have been seriously injured in the attack. A member of the police said after leaving the scene the attackers drove to the northeastern suburbs of Paris where they abandoned their vehicle and hijacked another car. French police union Unit\u00e9 spokesman Rocco Contento said of the crime scene, \"it was a real butchery\". The French Government have raised the country's security level to the maximum. President Fran\u00e7ois Hollande told reporters: \"This is a terrorist attack, there is no doubt about it\". G\u00e9rard Biard, the editor-in-chief of Charlie Hebdo, stated: \"I don't understand how people can attack a newspaper with heavy weapons. A newspaper is not a weapon of war.\" The magazine recently posted a cartoon on Twitter depicting , a leader of the Islamic State militant group. US President Barack Obama gave a statement condemning the attack: \"France is America ' s oldest ally, and has stood shoulder to shoulder with the United States in the fight against terrorists who threaten our shared security and the world. Time and again, the French people have stood up for the universal values that generations of our people have defended.\" Obama also said that the US would provide assistance \"to help bring these terrorists to justice\". British Prime Minister David Cameron tweeted: \"The murders in Paris are sickening. We stand with the French people in the fight against terror and defending the freedom of the press.\" The Arab League and the Cairo-based have also condemned the attack. In 2006, Charlie Hebdo ran the cartoons depicting Muhammad that originally appeared in the Danish newspaper Jyllands-Posten . In 2011, it published another cartoon depiction of Muhammed subtitled \"Charia Hebdo\", a pun on sharia . The magazine's office was subsequently firebombed. Following the bombing, the magazine's website was hacked and death threats were made against their staff. The magazine responded by publishing on their front page an image showing both the remains of the magazine's offices and one of their cartoonists kissing a bearded Muslim man. The cover contained the headline .", "edit_actions": [{"type": "A", "before": null, "after": "Paris", "start_char_pos": 67, "end_char_pos": 67}, {"type": "R", "before": "magazine", "after": "French magazine Charlie Hebdo", "start_char_pos": 100, "end_char_pos": 108}, {"type": "A", "before": null, "after": "Fran\u00e7ois Hollande", "start_char_pos": 714, "end_char_pos": 714}, {"type": "R", "before": "Gerard", "after": "G\u00e9rard", "start_char_pos": 789, "end_char_pos": 795}, {"type": "A", "before": null, "after": "Twitter", "start_char_pos": 1002, "end_char_pos": 1002}, {"type": "A", "before": null, "after": "Islamic State", "start_char_pos": 1031, "end_char_pos": 1031}, {"type": "A", "before": null, "after": "Barack Obama", "start_char_pos": 1061, "end_char_pos": 1061}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 1121, "end_char_pos": 1122}, {"type": "A", "before": null, "after": "David Cameron", "start_char_pos": 1517, "end_char_pos": 1517}, {"type": "R", "before": "and the -based", "after": "Arab League and the Cairo-based", "start_char_pos": 1669, "end_char_pos": 1683}, {"type": "A", "before": null, "after": "Muhammad", "start_char_pos": 1766, "end_char_pos": 1766}, {"type": "R", "before": "newspaper", "after": "Danish newspaper Jyllands-Posten", "start_char_pos": 1799, "end_char_pos": 1808}, {"type": "A", "before": null, "after": "sharia", "start_char_pos": 1906, "end_char_pos": 1906}], "sents_char_pos": [0, 110, 297, 352, 522, 624, 703, 788, 922, 959, 1047, 1275, 1395, 1493, 1563, 1664, 1715, 1810, 1908, 1959, 2065, 2241]} {"doc_id": "18527", "revision_depth": "1", "before_revision": "In a nationally broadcast radio sermon by former Iranian president Akbar Hashemi Rafsanjani on Friday, he said of the U. N. watchdog group adopting the resolution for Iran to stop nuclear enrichment activities, \"The decision was a cruel one.\" The Thurday adoption in Vienna by the governing board of the International Atomic Energy Agency (IAEA) , was unanimous and legally non-binding in asking Iran to suspend all nuclear fuel related activities. The board also requested a report from the agency's chief, Mohamed ElBaradei, on its compliance by Tehran. On Thursday, an Iranian member of their nuclear negotiating team, Sirous Nasseri, read in London a statement made by his republic at the emergency governing board meeting of the IAEA regarding the Nuclear proliferation treaty (NPT):How can this body be called to react to an act, which is in full conformity with the NPT and the safeguards and constitutes a limited manifestation of the exercise of an inalienable right? A right, which by its own simple meaning, cannot be alienated from anyone. International concern over the Iranian nuclear enrichment program was led by the European Union countries of France, Great Britain and Germany (EU-3), along with the United States. The pressure brought by these nations succeeded in obtaining language calling for the re-instatement of seals that were removed at the Uranium Conversion Facility in Isfahan . The seals were removed during the recent installation of surveillance cameras by IAEA. The agency is to monitor Tehran for compliance to halt uranium enrichment. After a September 3 deadline, Iran again faces a possible referral to the U.N. Security Council where it could be subject to economic sanctions. Meanwhile, the United States is likely to grant an entry visa to Iranian President Mahmoud Ahmadinejad to attend the United Nations opening session next month in New York City, New York. The Bush administration probe into whether Ahmadinejad was connected to the 1979-1981 Iranian hostage crisis is looking like it was a case of mistaken identity. The decision remains tentative as intelligence reports within the administration continue to circulate, according to The Washington Post citing U.S. officials.", "after_revision": "In a nationally broadcast radio sermon by former Iranian president on Friday, he said of the U. N. watchdog group adopting the resolution for Iran to stop nuclear enrichment activities, \"The decision was a cruel one.\" The Thurday adoption in by the governing board of the (IAEA) was unanimous and legally non-binding in asking Iran to suspend all nuclear fuel related activities. The board also requested a report from the agency's chief, Mohamed ElBaradei, on its compliance by Tehran. On Thursday, an Iranian member of their nuclear negotiating team, Sirous Nasseri, read in a statement made by his republic at the emergency governing board meeting of the IAEA regarding the (NPT):How can this body be called to react to an act, which is in full conformity with the NPT and the safeguards and constitutes a limited manifestation of the exercise of an inalienable right? A right, which by its own simple meaning, cannot be alienated from anyone. International concern over the Iranian nuclear enrichment program was led by the European Union countries of France, Great Britain , and Germany (EU-3), along with the United States. The pressure brought by these nations succeeded in obtaining language calling for the re-instatement of seals that were removed at the Uranium Conversion Facility in . The seals were removed during the recent installation of surveillance cameras by IAEA. The agency is to monitor for compliance to halt uranium enrichment. After a September 3 deadline, Iran again faces a possible referral to the U.N. Security Council where it could be subject to economic sanctions. Meanwhile, the United States is likely to grant an entry to Iranian President Mahmoud Ahmadinejad to attend the United Nations opening session next month in New York City, New York. The Bush administration probe into whether Ahmadinejad was connected to the 1979-1981 is looking like it was a case of mistaken identity. The decision remains tentative as intelligence reports within the administration continue to circulate, according to citing U.S. officials.", "edit_actions": [{"type": "D", "before": "Akbar Hashemi Rafsanjani", "after": null, "start_char_pos": 67, "end_char_pos": 91}, {"type": "D", "before": "Vienna", "after": null, "start_char_pos": 267, "end_char_pos": 273}, {"type": "D", "before": "International Atomic Energy Agency", "after": null, "start_char_pos": 304, "end_char_pos": 338}, {"type": "D", "before": ",", "after": null, "start_char_pos": 346, "end_char_pos": 347}, {"type": "D", "before": "London", "after": null, "start_char_pos": 646, "end_char_pos": 652}, {"type": "D", "before": "Nuclear proliferation treaty", "after": null, "start_char_pos": 753, "end_char_pos": 781}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1183, "end_char_pos": 1183}, {"type": "D", "before": "Isfahan", "after": null, "start_char_pos": 1400, "end_char_pos": 1407}, {"type": "D", "before": "Tehran", "after": null, "start_char_pos": 1522, "end_char_pos": 1528}, {"type": "D", "before": "visa", "after": null, "start_char_pos": 1774, "end_char_pos": 1778}, {"type": "D", "before": "Iranian hostage crisis", "after": null, "start_char_pos": 1990, "end_char_pos": 2012}, {"type": "D", "before": "The Washington Post", "after": null, "start_char_pos": 2182, "end_char_pos": 2201}], "sents_char_pos": [0, 242, 448, 555, 976, 1051, 1233, 1409, 1496, 1571, 1716, 1903, 2064]} {"doc_id": "188160", "revision_depth": "1", "before_revision": "In ice hockey, Tom\u00e1\u0161 Kopeck\u00fd scored the game-winning goal for the Chicago Blackhawks 8:25 into the third period to lift the Blackhawks over the Philadelphia Flyers in Game 1 of the 2010 Stanley Cup Finals Saturday night in Chicago, United States. The game started exciting, with five goals each in the first two periods, but Kopeck\u00fd's game-winner was the sole third-period goal. Tom\u00e1\u0161 Kopeck\u00fd scored the game-winning goal for the Blackhawks. Ville Leino opened the scoring for the Flyers at the 6:38 mark of the first period with Chicago's Troy Brouwer answered back just 68 seconds later. After teammate Patrick Kane was sent off for slashing, Chicago's Dave Bolland scored a short-handed goal to but the Blackhawks ahead. Six minutes later, Brian Campbell was sent off for high-sticking and the Flyers converted on the power play with Scott Hartnell lighting the lamp for Philadelphia. Daniel Bri\u00e8re put the Flyers 3\u20132 up going into the first intermission with just 27 seconds left in the period. With the second period just 71 seconds old, Patrick Sharp evened the score at three. Blackhawk Adam Burish was sent off for boarding at the 4:59 mark, but the Flyers could not extend their lead, ending up converting one of their four power plays ( Ben Eager was sent off for cross checking early in the first period). Blair Betts gave the Flyers their final lead of the game with a shot at the 7:20 mark of the period. The Blackhawks' Kris Versteeg responded two minutes later and at 15:18 mark the Brouwer completed his three-point night with his second goal. Philadelphia's Arron Asham evened the score at five a-piece to complete the period. The third period was a relatively quiet one, with just 14 shots compared to to 26 and 24 shots in the first two periods, respectively. Each team had 32 shots. Kopeck\u00fd's goal was the lone action as the Slovak national slipped the puck past Flyers goalkeeper Brian Boucher , who had 11 saves in 24 minutes on the ice. Boucher replaced Michael Leighton , who stopped 15 of 20 shots. Blackhawk counterpart Antti Niemi collected 27 of 32 shots. The game was the Blackhawks' first Finals victory since 1973. In 1992, they were swept by the Pittsburg Penguins .", "after_revision": "In ice hockey, scored the game-winning goal for the Chicago Blackhawks 8:25 into the third period to lift the Blackhawks over the in Game 1 of the Saturday night in Chicago, United States. The game started exciting, with five goals each in the first two periods, but Kopeck\u00fd's game-winner was the sole third-period goal. scored the game-winning goal for the Blackhawks. opened the scoring for the Flyers at the 6:38 mark of the first period with Chicago's answered back just 68 seconds later. After teammate was sent off for slashing, Chicago's scored a short-handed goal to but the Blackhawks ahead. Six minutes later, was sent off for high-sticking and the Flyers converted on the power play with lighting the lamp for Philadelphia. put the Flyers 3\u20132 up going into the first intermission with just 27 seconds left in the period. With the second period just 71 seconds old, evened the score at three. Blackhawk was sent off for boarding at the 4:59 mark, but the Flyers could not extend their lead, ending up converting one of their four power plays ( was sent off for cross checking early in the first period). gave the Flyers their final lead of the game with a shot at the 7:20 mark of the period. The Blackhawks' responded two minutes later and at 15:18 mark the Brouwer completed his three-point night with his second goal. Philadelphia's evened the score at five a-piece to complete the period. The third period was a relatively quiet one, with just 14 shots compared to to 26 and 24 shots in the first two periods, respectively. Each team had 32 shots. Kopeck\u00fd's goal was the lone action as the Slovak national slipped the puck past Flyers goalkeeper , who had 11 saves in 24 minutes on the ice. Boucher replaced , who stopped 15 of 20 shots. Blackhawk counterpart collected 27 of 32 shots. The game was the Blackhawks' first Finals victory since 1973. In 1992, they were swept by the .", "edit_actions": [{"type": "D", "before": "Tom\u00e1\u0161 Kopeck\u00fd", "after": null, "start_char_pos": 15, "end_char_pos": 28}, {"type": "D", "before": "Philadelphia Flyers", "after": null, "start_char_pos": 144, "end_char_pos": 163}, {"type": "D", "before": "2010 Stanley Cup Finals", "after": null, "start_char_pos": 181, "end_char_pos": 204}, {"type": "D", "before": "Tom\u00e1\u0161 Kopeck\u00fd", "after": null, "start_char_pos": 379, "end_char_pos": 392}, {"type": "D", "before": "Ville Leino", "after": null, "start_char_pos": 442, "end_char_pos": 453}, {"type": "D", "before": "Troy Brouwer", "after": null, "start_char_pos": 540, "end_char_pos": 552}, {"type": "D", "before": "Patrick Kane", "after": null, "start_char_pos": 605, "end_char_pos": 617}, {"type": "D", "before": "Dave Bolland", "after": null, "start_char_pos": 655, "end_char_pos": 667}, {"type": "D", "before": "Brian Campbell", "after": null, "start_char_pos": 743, "end_char_pos": 757}, {"type": "D", "before": "Scott Hartnell", "after": null, "start_char_pos": 837, "end_char_pos": 851}, {"type": "D", "before": "Daniel Bri\u00e8re", "after": null, "start_char_pos": 888, "end_char_pos": 901}, {"type": "D", "before": "Patrick Sharp", "after": null, "start_char_pos": 1043, "end_char_pos": 1056}, {"type": "D", "before": "Adam Burish", "after": null, "start_char_pos": 1094, "end_char_pos": 1105}, {"type": "D", "before": "Ben Eager", "after": null, "start_char_pos": 1247, "end_char_pos": 1256}, {"type": "D", "before": "Blair Betts", "after": null, "start_char_pos": 1317, "end_char_pos": 1328}, {"type": "D", "before": "Kris Versteeg", "after": null, "start_char_pos": 1434, "end_char_pos": 1447}, {"type": "D", "before": "Arron Asham", "after": null, "start_char_pos": 1575, "end_char_pos": 1586}, {"type": "D", "before": "Brian Boucher", "after": null, "start_char_pos": 1901, "end_char_pos": 1914}, {"type": "D", "before": "Michael Leighton", "after": null, "start_char_pos": 1977, "end_char_pos": 1993}, {"type": "D", "before": "Antti Niemi", "after": null, "start_char_pos": 2046, "end_char_pos": 2057}, {"type": "D", "before": "Pittsburg Penguins", "after": null, "start_char_pos": 2178, "end_char_pos": 2196}], "sents_char_pos": [0, 246, 378, 441, 589, 723, 887, 998, 1083, 1316, 1417, 1559, 1643, 1778, 1802, 1959, 2023, 2083, 2145]} {"doc_id": "188836", "revision_depth": "1", "before_revision": "In ice hockey, the Chicago Blackhawks scored two goals just 28 seconds apart late in the second period to take a 2\u20130 series lead over the Philadelphia Flyers in Game 2 of the 2010 Stanley Cup Finals Monday night in Chicago, United States. Ben Eager scored the game-winning goal at the 17:39 mark of second period to give the Chicago Blackhawks a 2\u20130 series lead over the Philadelphia Flyers in Game 2 of the 2010 Stanley Cup Finals. Mari\u00e1n Hossa scored Chicago's first goal at the 17:09 mark of the second period on slap shot deep in the Blackhawk's defensive zone. Left-wingers Troy Brouwer and Patrick Sharp provided assists on the goal. Ben Eager scored the game-winner at the 17:37 mark of the second period on a feed from Dustin Byfuglien . Eager scored his goal on a wrist shot from 38 feet. Philadelphia's lone goal came in the third period, when Simon Gagn\u00e9 scored at the 5:20 mark. Centers Mike Richards and Jeff Carter provides assists on the goal. Unlike the first game, this one was marked by impressive defensive efforts from both sides. Chicago goalkeeper Antti Niemi made 32 saves, earning the Player-of-the-Game honor from the National Hockey League. His counterpart, Michael Leighton who was pulled in Game 1 after giving up five goals, collected 24 saves. Flyers coach Peter Laviolette also acknowledged Niemi, who collected 14 of his 32 saves in the third period. After a fairly clean game on Saturday, Game 2 had a decided edge, which resulted in ten penalties. Neither team capitalized on their power play opportunities. At the 17:27 mark of the first period, three players were sent off: Chicago's Game 1 hero Tom\u00e1\u0161 Kopeck\u00fd for roughing, with Philadelphia's Richards and Daniel Carcillo going to the box of elbowing and unsportsmanlike conduct, respectively.", "after_revision": "In ice hockey, the scored two goals just 28 seconds apart late in the second period to take a 2\u20130 series lead over the in Game 2 of the Monday night in Chicago, United States. scored the game-winning goal at the 17:39 mark of second period to give the a 2\u20130 series lead over the in Game 2 of the . scored Chicago's first goal at the 17:09 mark of the second period on slap shot deep in the Blackhawk's defensive zone. Left-wingers and provided assists on the goal. scored the game-winner at the 17:37 mark of the second period on a feed from . Eager scored his goal on a wrist shot from 38 feet. Philadelphia's lone goal came in the third period, when scored at the 5:20 mark. Centers and provides assists on the goal. Unlike the first game, this one was marked by impressive defensive efforts from both sides. Chicago goalkeeper made 32 saves, earning the Player-of-the-Game honor from the National Hockey League. His counterpart, who was pulled in Game 1 after giving up five goals, collected 24 saves. Flyers coach also acknowledged Niemi, who collected 14 of his 32 saves in the third period. After a fairly clean game on Saturday, Game 2 had a decided edge, which resulted in ten penalties. Neither team capitalized on their power play opportunities. At the 17:27 mark of the first period, three players were sent off: Chicago's Game 1 hero for roughing, with Philadelphia's Richards and going to the box of elbowing and unsportsmanlike conduct, respectively.", "edit_actions": [{"type": "D", "before": "Chicago Blackhawks", "after": null, "start_char_pos": 19, "end_char_pos": 37}, {"type": "D", "before": "Philadelphia Flyers", "after": null, "start_char_pos": 138, "end_char_pos": 157}, {"type": "D", "before": "2010 Stanley Cup Finals", "after": null, "start_char_pos": 175, "end_char_pos": 198}, {"type": "D", "before": "Ben Eager", "after": null, "start_char_pos": 239, "end_char_pos": 248}, {"type": "D", "before": "Chicago Blackhawks", "after": null, "start_char_pos": 325, "end_char_pos": 343}, {"type": "D", "before": "Philadelphia Flyers", "after": null, "start_char_pos": 371, "end_char_pos": 390}, {"type": "R", "before": "2010 Stanley Cup Finals. Mari\u00e1n Hossa", "after": ".", "start_char_pos": 408, "end_char_pos": 445}, {"type": "R", "before": "Troy Brouwer and Patrick Sharp", "after": "and", "start_char_pos": 579, "end_char_pos": 609}, {"type": "D", "before": "Ben Eager", "after": null, "start_char_pos": 640, "end_char_pos": 649}, {"type": "D", "before": "Dustin Byfuglien", "after": null, "start_char_pos": 727, "end_char_pos": 743}, {"type": "D", "before": "Simon Gagn\u00e9", "after": null, "start_char_pos": 854, "end_char_pos": 865}, {"type": "R", "before": "Mike Richards and Jeff Carter", "after": "and", "start_char_pos": 899, "end_char_pos": 928}, {"type": "D", "before": "Antti Niemi", "after": null, "start_char_pos": 1070, "end_char_pos": 1081}, {"type": "D", "before": "Michael Leighton", "after": null, "start_char_pos": 1184, "end_char_pos": 1200}, {"type": "D", "before": "Peter Laviolette", "after": null, "start_char_pos": 1287, "end_char_pos": 1303}, {"type": "D", "before": "Tom\u00e1\u0161 Kopeck\u00fd", "after": null, "start_char_pos": 1632, "end_char_pos": 1645}, {"type": "D", "before": "Daniel Carcillo", "after": null, "start_char_pos": 1693, "end_char_pos": 1708}], "sents_char_pos": [0, 238, 432, 565, 639, 797, 890, 958, 1050, 1166, 1273, 1382, 1481, 1541]} {"doc_id": "189036", "revision_depth": "1", "before_revision": "Samantha Stosur at Roland Garros in 2009 Australia's Samantha Stosur will compete against Italy's Francesca Schiavone for the women's title in this year's French Open, while Spain's Rafael Nadal will go up against Sweden's Robin Soderling . In the women's semifinals, Stosur easily defeated Jelena Jankovic, once number one in the world , while Schiavone's opponent Elena Dementieva decided to withdraw due to a torn calf muscle after losing one set to Schiavone. Stosur and Schiavone will face off at the Stade Roland Garros this Saturday for the final round of the French Open. As this is the first Grand Slam final for both players, a victory for either will mean her first major championship title. Schiavone is also the first Italian woman to compete in a Grand Slam semifinal match. However, this is not the first time the two have met: Stosur beat Schiavone in the opening round of last year's French Open, and again in Osaka later that year. This year's championship has been one with several major upsets. None of the top three women in the event, including sisters Venus and Serena Williams , made it to the semifinals. In fact, none of the female semifinalists this year have ever won a Grand Slam title, which has not occurred at the French Open for over 30 years. In a major upset for the men's title, Robin Soderling defeated Swiss player Roger Federer in a quarterfinal match of the French Open Tuesday, ending Federer's streak of 23 consecutive Grand Slam semifinal appearances. Federer could also lose his status as number one in the world to rival Rafael Nadal if Nadal wins this year's French Open. However, Soderling is known for being the only person to have defeated Nadal in the French Open. In the men's semifinals earlier today, the 24-year-old Nadal beat Austria's Jurgen Melzer , and Soderling defeated Czech player Tomas Berdych . If Nadal beats Soderling in this Sunday's final round, it will be his fifth French Open title.", "after_revision": "Samantha Stosur at Roland Garros in 2009 Australia's will compete against Italy's for the women's title in this year's , while 's will go up against 's . In the women's semifinals, Stosur easily defeated , once , while Schiavone's opponent decided to withdraw due to a torn after losing one set to Schiavone. Stosur and Schiavone will face off at the this Saturday for the final round of the French Open. As this is the first final for both players, a victory for either will mean her first major championship title. Schiavone is also the first Italian woman to compete in a Grand Slam semifinal match. However, this is not the first time the two have met: Stosur beat Schiavone in the opening round of last year's French Open, and again in later that year. This year's championship has been one with several major upsets. None of the top three women in the event, including sisters and , made it to the semifinals. In fact, none of the female semifinalists this year have ever won a Grand Slam title, which has not occurred at the French Open for over 30 years. In a major upset for the men's title, Robin Soderling defeated Swiss player in a quarterfinal match of the French Open Tuesday, ending Federer's streak of 23 consecutive Grand Slam semifinal appearances. Federer could also lose his status as number one in the world to rival Rafael Nadal if Nadal wins this year's French Open. However, Soderling is known for being the only person to have defeated Nadal in the French Open. In the men's semifinals earlier today, the 24-year-old Nadal beat Austria's , and Soderling defeated Czech player . If Nadal beats Soderling in this Sunday's final round, it will be his fifth French Open title.", "edit_actions": [{"type": "D", "before": "Samantha Stosur", "after": null, "start_char_pos": 53, "end_char_pos": 68}, {"type": "D", "before": "Francesca Schiavone", "after": null, "start_char_pos": 98, "end_char_pos": 117}, {"type": "R", "before": "French Open, while Spain's Rafael Nadal", "after": ", while 's", "start_char_pos": 155, "end_char_pos": 194}, {"type": "R", "before": "Sweden's Robin Soderling", "after": "'s", "start_char_pos": 214, "end_char_pos": 238}, {"type": "D", "before": "Jelena Jankovic, once number one in the world", "after": null, "start_char_pos": 291, "end_char_pos": 336}, {"type": "A", "before": null, "after": "once ,", "start_char_pos": 339, "end_char_pos": 339}, {"type": "D", "before": "Elena Dementieva", "after": null, "start_char_pos": 367, "end_char_pos": 383}, {"type": "D", "before": "calf muscle", "after": null, "start_char_pos": 418, "end_char_pos": 429}, {"type": "D", "before": "Stade Roland Garros", "after": null, "start_char_pos": 507, "end_char_pos": 526}, {"type": "D", "before": "Grand Slam", "after": null, "start_char_pos": 602, "end_char_pos": 612}, {"type": "D", "before": "Osaka", "after": null, "start_char_pos": 928, "end_char_pos": 933}, {"type": "R", "before": "Venus and Serena Williams", "after": "and", "start_char_pos": 1076, "end_char_pos": 1101}, {"type": "D", "before": "Roger Federer", "after": null, "start_char_pos": 1354, "end_char_pos": 1367}, {"type": "D", "before": "Jurgen Melzer", "after": null, "start_char_pos": 1792, "end_char_pos": 1805}, {"type": "D", "before": "Tomas Berdych", "after": null, "start_char_pos": 1844, "end_char_pos": 1857}], "sents_char_pos": [0, 240, 464, 580, 703, 789, 950, 1015, 1130, 1277, 1495, 1618, 1715, 1859]} {"doc_id": "190356", "revision_depth": "1", "before_revision": "In his WWDC keynote, Steve Jobs introduced iPhone 4 yesterday. Yesterday, at this year's Apple Worldwide Developers Conference (WWDC), company CEO Steve Jobs unveiled iPhone 4, along with the new iOS 4 operating system for Apple mobile devices. The announcement was long-awaited but not a very big surprise. In April, the technology blog Gizmodo obtained a prototype of the new phone and published details of it online. While introducing iPhone 4, at the annual conference, Jobs started by hinting at the incident, saying, \"Stop me if you've already seen this.\" The new iPhone was praised by Jobs as \"the biggest leap we've taken since the original iPhone.\" It is only 9.3 millimetres (0.37 inches) thick, making it \"the thinnest smartphone on the planet\", a 24 percent reduction from Apple's previous model, the iPhone 3GS. Structure-wise, iPhone 4 has a new stainless steel frame, which acts as an antenna , supposedly boosting its signal reception abilities and possibly reducing the amount of dropped calls . It also has a new screen, dubbed a \"retina display,\" which displays images at 326 pixels per inch . During the keynote, Jobs demoed the device's new internal gyroscope as well. Even though it now uses Apple's faster A4 processor (first used in its iPad tablet ), iPhone 4 has a claimed seven hours of 3G talk time, up two hours from the 3GS. In addition to its design features, Jobs showed off iPhone 4's new video calling abilities. This feature is called FaceTime , and connects with other iPhone 4s via Wi-Fi . The phone has two cameras : one on the front for video chats, and one on the back for taking pictures and other videos. The rear camera has a resolution of five megapixels , is capable of recording high-definition video , and has an LED flash. The iPhone 4 will use Apple's latest mobile operating system, iOS 4. Formerly \"iPhone OS,\" iOS 4 was first introduced by Apple in April, and includes multitasking capabilities. Jobs called the new software \"the most advanced mobile operating system in the world.\" iOS will support Apple's new mobile advertising service, iAd , which goes live on July 1. iPhone 4 will be available on June 24 in the United States, United Kingdom, France, Germany, and Japan. It comes in two colors\u2014black and white\u2014and two storage capacities. The 16GB version is priced at US$199 and the 32GB version at US$299. The iPhone 3GS's price will be reduced to US$99, and the iPhone 3G will be discontinued. iOS will be available as a free software update to users of compatible older Apple devices (including the 3GS) on June 21. In the U.S., iPhone 4 will only be available on AT T 's cellular network, despite calls for Apple to let the iPhone be used on other carriers, such as Verizon . Competition-wise, the BlackBerry mobile device is still the most popular smartphone right now. Apple is also facing some serious competition from web giant Google's Android operating system, as well as Palm's webOS . Earlier this year, Android phones managed to outsell iPhones. iPhone users, however, account for over half of those surfing the Internet on a mobile browser in the U.S. Jobs also noted that over five billion iOS applications, commonly called \"apps,\" have been purchased from Apple's App Store . The App Store currently has around 225,000 different apps for sale.", "after_revision": "In his WWDC keynote, Steve Jobs introduced iPhone 4 yesterday. Yesterday, at this year's (WWDC), company Steve Jobs unveiled 4, along with the new 4 for Apple mobile devices. The announcement was long-awaited but not a very big surprise. In April, the technology blog obtained a prototype of the new phone and published details of it online. While introducing iPhone 4, at the annual conference, Jobs started by hinting at the incident, saying, \"Stop me if you've already seen this.\" The new iPhone was praised by Jobs as \"the biggest leap we've taken since the original iPhone.\" It is only 9.3 millimetres (0.37 inches) thick, making it \"the thinnest smartphone on the planet\", a 24 percent reduction from Apple's previous model, the iPhone 3GS. Structure-wise, iPhone 4 has a new frame, which acts as an , supposedly boosting its signal reception abilities and possibly reducing the amount of . It also has a new screen, dubbed a \"retina display,\" which displays images at 326 . During the keynote, Jobs demoed the device's new internal as well. Even though it now uses Apple's faster A4 (first used in its ), iPhone 4 has a claimed seven hours of talk time, up two hours from the 3GS. In addition to its design features, Jobs showed off iPhone 4's new abilities. This feature is called , and connects with other iPhone 4s via . The phone has two : one on the front for video chats, and one on the back for taking pictures and other videos. The rear camera has a resolution of five , is capable of recording , and has an flash. The iPhone 4 will use Apple's latest mobile operating system, iOS 4. Formerly \"iPhone OS,\" iOS 4 was first introduced by Apple in April, and includes capabilities. Jobs called the new software \"the most advanced mobile operating system in the world.\" iOS will support Apple's new mobile advertising service, , which goes live on July 1. iPhone 4 will be available on June 24 in the United States, United Kingdom, France, Germany, and Japan. It comes in two colors\u2014black and white\u2014and two storage capacities. The 16 version is priced at US$199 and the 32GB version at US$299. The iPhone 3GS's price will be reduced to US$99, and the iPhone 3G will be discontinued. iOS will be available as a free software update to users of compatible older Apple devices (including the 3GS) on June 21. In the U.S., iPhone 4 will only be available on 's cellular network, despite calls for Apple to let the iPhone be used on other carriers, such as . Competition-wise, the mobile device is still the most popular right now. Apple is also facing some serious competition from web giant Google's operating system, as well as 's . Earlier this year, Android phones managed to outsell iPhones. iPhone users, however, account for over half of those surfing the on a mobile browser in the U.S. Jobs also noted that over five billion iOS applications, commonly called \"apps,\" have been purchased from Apple's . The App Store currently has around 225,000 different apps for sale.", "edit_actions": [{"type": "D", "before": "Apple Worldwide Developers Conference", "after": null, "start_char_pos": 89, "end_char_pos": 126}, {"type": "D", "before": "CEO", "after": null, "start_char_pos": 143, "end_char_pos": 146}, {"type": "D", "before": "iPhone", "after": null, "start_char_pos": 167, "end_char_pos": 173}, {"type": "D", "before": "iOS", "after": null, "start_char_pos": 196, "end_char_pos": 199}, {"type": "D", "before": "operating system", "after": null, "start_char_pos": 202, "end_char_pos": 218}, {"type": "D", "before": "Gizmodo", "after": null, "start_char_pos": 338, "end_char_pos": 345}, {"type": "D", "before": "stainless steel", "after": null, "start_char_pos": 860, "end_char_pos": 875}, {"type": "D", "before": "antenna", "after": null, "start_char_pos": 900, "end_char_pos": 907}, {"type": "D", "before": "dropped calls", "after": null, "start_char_pos": 997, "end_char_pos": 1010}, {"type": "D", "before": "pixels per inch", "after": null, "start_char_pos": 1095, "end_char_pos": 1110}, {"type": "D", "before": "gyroscope", "after": null, "start_char_pos": 1171, "end_char_pos": 1180}, {"type": "D", "before": "processor", "after": null, "start_char_pos": 1232, "end_char_pos": 1241}, {"type": "D", "before": "iPad tablet", "after": null, "start_char_pos": 1261, "end_char_pos": 1272}, {"type": "D", "before": "3G", "after": null, "start_char_pos": 1314, "end_char_pos": 1316}, {"type": "D", "before": "video calling", "after": null, "start_char_pos": 1422, "end_char_pos": 1435}, {"type": "D", "before": "FaceTime", "after": null, "start_char_pos": 1470, "end_char_pos": 1478}, {"type": "D", "before": "Wi-Fi", "after": null, "start_char_pos": 1519, "end_char_pos": 1524}, {"type": "D", "before": "cameras", "after": null, "start_char_pos": 1545, "end_char_pos": 1552}, {"type": "D", "before": "megapixels", "after": null, "start_char_pos": 1688, "end_char_pos": 1698}, {"type": "D", "before": "high-definition video", "after": null, "start_char_pos": 1725, "end_char_pos": 1746}, {"type": "D", "before": "LED", "after": null, "start_char_pos": 1760, "end_char_pos": 1763}, {"type": "D", "before": "multitasking", "after": null, "start_char_pos": 1921, "end_char_pos": 1933}, {"type": "D", "before": "iAd", "after": null, "start_char_pos": 2092, "end_char_pos": 2095}, {"type": "R", "before": "16GB", "after": "16", "start_char_pos": 2300, "end_char_pos": 2304}, {"type": "D", "before": "AT", "after": null, "start_char_pos": 2625, "end_char_pos": 2627}, {"type": "D", "before": "T", "after": null, "start_char_pos": 2628, "end_char_pos": 2629}, {"type": "D", "before": "Verizon", "after": null, "start_char_pos": 2728, "end_char_pos": 2735}, {"type": "D", "before": "BlackBerry", "after": null, "start_char_pos": 2760, "end_char_pos": 2770}, {"type": "D", "before": "smartphone", "after": null, "start_char_pos": 2811, "end_char_pos": 2821}, {"type": "D", "before": "Android", "after": null, "start_char_pos": 2903, "end_char_pos": 2910}, {"type": "R", "before": "Palm's webOS", "after": "'s", "start_char_pos": 2940, "end_char_pos": 2952}, {"type": "D", "before": "Internet", "after": null, "start_char_pos": 3083, "end_char_pos": 3091}, {"type": "D", "before": "App Store", "after": null, "start_char_pos": 3238, "end_char_pos": 3247}], "sents_char_pos": [0, 62, 244, 307, 419, 561, 657, 824, 1012, 1189, 1354, 1446, 1526, 1646, 1770, 1947, 2228, 2295, 2364, 2576, 2832, 3249]} {"doc_id": "191326", "revision_depth": "1", "before_revision": "Israel will carry out an inquiry into last month's raid on a flotilla of Gaza-bound aid ships. The inquiry will include two non-voting foreign observers. Israel had earlier rejected a UN call for an international inquiry. |The Mavi Marmara , one of the ships boarded last month. Nine Turkish citizens were killed on May 31, when Israeli naval commandos boarded a vessel in the flotilla, the MV Mavi Marmara . The three-man inquest into the boarding action , which took place in international waters, will be headed by ex-Supreme Court judge Yaakov Tirkel. A retired military officer and a professor of international law are the other members. The two foreign observers will be Nobel Peace Prize winner David Trimble and a former jurist in the Canadian military, Brigadier General Kenneth Watkin . They are to watch the panel consider how the Turks died, as well as judge whether the naval blockade of Gaza is allowable under international law. Middle East peace envoy for the Madrid Quartet , Tony Blair, said that he hoped that the Israeli blockade on Gaza would be softened within days, whilst the White House backed a Security Council statement calling for a \"prompt, impartial [and] credible\" review. Palestinian President Mahmoud Abbas said that the inquest did \"not correspond to what the Security Council asked for\". The Turkish government is not satisfied with Israel's inquiry. Ahmet Davutoglu , the Turkish Foreign Minister, said in a news conference that Israel's \"one-sided inquiry\" is insufficient, and his country wishes for a commission to be set up under the control of the United Nations. Turkey has withdrawn their ambassador to Israel and canceled joint military exercises. It is calling for the blockade, which the Red Cross says violates the Geneva Convention, to be lifted. Related news ", "after_revision": "Israel will carry out an inquiry into last month's on a flotilla of Gaza-bound aid ships. The inquiry will include two non-voting foreign observers. Israel had earlier rejected a UN call for an international inquiry. |The , one of the ships boarded last month. Nine Turkish citizens were killed on May 31, when boarded a vessel in the flotilla, the MV . The three-man inquest into the , which took place in international waters, will be headed by ex-Supreme Court judge Yaakov Tirkel. A retired military officer and a professor of international law are the other members. The two foreign observers will be winner and a former jurist in the Canadian military, . They are to watch the panel consider how the Turks died, as well as judge whether the naval blockade of Gaza is allowable under international law. Middle East peace envoy for the , Tony Blair, said that he hoped that the Israeli blockade on Gaza would be softened within days, whilst the White House backed a Security Council statement calling for a \"prompt, impartial [and] credible\" review. Palestinian President Mahmoud Abbas said that the inquest did \"not correspond to what the Security Council asked for\". The Turkish government is not satisfied with Israel's inquiry. , the Turkish Foreign Minister, said in a news conference that Israel's \"one-sided inquiry\" is insufficient, and his country wishes for a commission to be set up under the control of the United Nations. Turkey has withdrawn their ambassador to Israel and canceled joint military exercises. It is calling for the blockade, which the Red Cross says violates the Geneva Convention, to be lifted. Related news Sister links Sourcces Category:Israel Category:Turkey Category:Middle East Category:Politics and conflicts Category:Gaza Strip Category:Blockade of the Gaza Strip Category:Mediterranean Sea Category:Red Cross and Red Crescent Category:Ahmet Davuto", "edit_actions": [{"type": "D", "before": "raid", "after": null, "start_char_pos": 51, "end_char_pos": 55}, {"type": "D", "before": "Mavi Marmara", "after": null, "start_char_pos": 227, "end_char_pos": 239}, {"type": "D", "before": "Israeli naval commandos", "after": null, "start_char_pos": 329, "end_char_pos": 352}, {"type": "D", "before": "Mavi Marmara", "after": null, "start_char_pos": 394, "end_char_pos": 406}, {"type": "D", "before": "boarding action", "after": null, "start_char_pos": 440, "end_char_pos": 455}, {"type": "R", "before": "Nobel Peace Prize winner David Trimble", "after": "winner", "start_char_pos": 677, "end_char_pos": 715}, {"type": "D", "before": "Brigadier General Kenneth Watkin", "after": null, "start_char_pos": 762, "end_char_pos": 794}, {"type": "D", "before": "Madrid Quartet", "after": null, "start_char_pos": 976, "end_char_pos": 990}, {"type": "D", "before": "Ahmet Davutoglu", "after": null, "start_char_pos": 1387, "end_char_pos": 1402}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 1809, "end_char_pos": 1809}, {"type": "A", "before": null, "after": "Sourcces", "start_char_pos": 1810, "end_char_pos": 1810}, {"type": "A", "before": null, "after": "Category:Israel Category:Turkey Category:Middle East Category:Politics and conflicts Category:Gaza Strip Category:Blockade of the Gaza Strip Category:Mediterranean Sea Category:Red Cross and Red Crescent Category:Ahmet Davuto", "start_char_pos": 1811, "end_char_pos": 1811}], "sents_char_pos": [0, 94, 153, 221, 278, 408, 555, 642, 796, 943, 1204, 1323, 1386, 1605, 1692, 1795]} {"doc_id": "1928792", "revision_depth": "2", "before_revision": "Flag of ISIL. A video was released yesterday purporting to show the execution of 21 by supporters of (ISIL) . The video shows the prisoners being beheaded in a location apparently near in . The captives, all wearing orange in the video, were picked up in , a coastal town in Libya, during December and January. The video indicates that the Christians were targeted by ISIL because of their religion. The Coptic Orthodox Church stated they were \"confident\" justice would be carried out . 's President stated: \"Egypt and the whole world are in a fierce battle with extremist groups carrying extremist ideology and sharing the same goals\".", "after_revision": "Flag of ISIL. A video purporting to show the execution of 21 by supporters of (ISIL) has been released yesterday . The video shows them being beheaded in a location apparently near in . The captives, all shown being executed in orange in the video, were picked up in , a coastal town in Libya, during December and January. The video asserts the Christians were targeted by ISIL because of their religion. The Coptic Orthodox Church stated they were \"confident\" justice would be done on those who executed their followers . 's President stated: \"Egypt and the whole world are in a fierce battle with extremist groups carrying extremist ideology and sharing the same goals\".", "edit_actions": [{"type": "D", "before": "was released yesterday", "after": null, "start_char_pos": 22, "end_char_pos": 44}, {"type": "A", "before": null, "after": "has been released yesterday", "start_char_pos": 108, "end_char_pos": 108}, {"type": "R", "before": "the prisoners", "after": "them", "start_char_pos": 127, "end_char_pos": 140}, {"type": "R", "before": "wearing", "after": "shown being executed in", "start_char_pos": 209, "end_char_pos": 216}, {"type": "R", "before": "indicates that", "after": "asserts", "start_char_pos": 322, "end_char_pos": 336}, {"type": "R", "before": "carried out", "after": "done on those who executed their followers", "start_char_pos": 474, "end_char_pos": 485}], "sents_char_pos": [0, 13, 110, 190, 311, 400, 487]} {"doc_id": "193201", "revision_depth": "1", "before_revision": "File photo of Jimmie Johnson. NASCAR Sprint Cup Series driver Jimmie Johnson won his second consecutive race of the season on Sunday during the 2010 Lenox Industrial Tools 301 at New Hampshire Motor Speedway . It was his fifth victory in the 2010 season of the US's leading professional stock car series, drawing him level with Denny Hamlin for the most wins. The victory earned Johnson 190 points (including a 5 point bonus), moving him closer to point leader Kevin Harvick , but he is still 105 points behind in second position. With eight laps remaining, Kurt Busch , who was running second, bumped Johnson to become the leader, but Johnson returned the favor a couple laps later to the lead the final two laps. Johnson said, \u201cKurt knocked me out of the way. At that point, I thought, I don\u2019t care if I win or finish. I\u2019m going to run into him one way or the other ... I tried once and moved him. (I thought) I\u2019ve got to hit him harder. The second time I did and moved him out of the way.\u201d Tony Stewart finished in the second position, ahead of Kurt Busch and Jeff Gordon in third and fourth. Ryan Newman, Clint Bowyer, Dale Earnhardt, Jr., Joey Logano and A. J. Allmendinger rounded out the top ten positions. The race had total of four cautions and sixteen lead changes among nine different drivers. Kasey Kahne led the most laps by leading 110. In the point standings , Harvick and Johnson remained in the first and second position. Kyle Busch , because of his accident with Jeff Burton maintained the third position while his team mate Hamlin is fourth. Gordon, Kurt Busch, Matt Kenseth , and Burton followed in the top-eight points positions. Stewart move up one position after finishing second and is in the ninth position, as Greg Biffle fell to tenth. Mark Martin and Carl Edwards rounded out the top-twelve, and is currently in the Chase . Official Top-10 Race Results for the 2010 Lenox Industrial Tools 301 Position Car Number Driver 1 48 Jimmie Johnson 2 14 Tony Stewart 3 2 Kurt Busch 4 24 Jeff Gordon 529 Kevin Harvick 6 39 Ryan Newman 7 33 Clint Bowyer 8 88 Dale Earnhardt, Jr. 9 33 Joey Logano 10 43 A. J. Allmendinger", "after_revision": "File photo of . driver won his second consecutive race of the on Sunday during the at . It was his fifth victory in the 2010 season of the US's leading professional stock car series, drawing him level with for the most wins. The victory earned Johnson 190 points (including a 5 point bonus), moving him closer to point leader , but he is still 105 points behind in second position. With eight laps remaining, , who was running second, bumped Johnson to become the leader, but Johnson returned the favor a couple laps later to the lead the final two laps. Johnson said, \u201cKurt knocked me out of the way. At that point, I thought, I don\u2019t care if I win or finish. I\u2019m going to run into him one way or the other ... I tried once and moved him. (I thought) I\u2019ve got to hit him harder. The second time I did and moved him out of the way.\u201d finished in the second position, ahead of Kurt Busch and in third and fourth. , , , and rounded out the top ten positions. The race had total of four cautions and sixteen lead changes among nine different drivers. led the most laps by leading 110. In the , Harvick and Johnson remained in the first and second position. , because of his accident with maintained the third position while his team mate Hamlin is fourth. Gordon, Kurt Busch, , and Burton followed in the top-eight points positions. Stewart move up one position after finishing second and is in the ninth position, as |Greg Biffle fell to tenth. and rounded out the top-twelve, and is currently in the . Official Top-10 Race Results for the Position Car Number Driver 1 48 Jimmie Johnson 2 14 3 2 4 24 529 6 39 7 33 8 88 9 33 10 43 Sister links", "edit_actions": [{"type": "R", "before": "Jimmie Johnson. NASCAR Sprint Cup Series driver Jimmie Johnson", "after": ". driver", "start_char_pos": 14, "end_char_pos": 76}, {"type": "D", "before": "season", "after": null, "start_char_pos": 116, "end_char_pos": 122}, {"type": "R", "before": "2010 Lenox Industrial Tools 301 at New Hampshire Motor Speedway", "after": "at", "start_char_pos": 144, "end_char_pos": 207}, {"type": "D", "before": "Denny Hamlin", "after": null, "start_char_pos": 328, "end_char_pos": 340}, {"type": "D", "before": "Kevin Harvick", "after": null, "start_char_pos": 461, "end_char_pos": 474}, {"type": "D", "before": "Kurt Busch", "after": null, "start_char_pos": 558, "end_char_pos": 568}, {"type": "D", "before": "Tony Stewart", "after": null, "start_char_pos": 993, "end_char_pos": 1005}, {"type": "D", "before": "Jeff Gordon", "after": null, "start_char_pos": 1063, "end_char_pos": 1074}, {"type": "R", "before": "Ryan Newman, Clint Bowyer, Dale Earnhardt, Jr., Joey Logano and A. J. Allmendinger", "after": ", , , and", "start_char_pos": 1096, "end_char_pos": 1178}, {"type": "D", "before": "Kasey Kahne", "after": null, "start_char_pos": 1305, "end_char_pos": 1316}, {"type": "D", "before": "point standings", "after": null, "start_char_pos": 1358, "end_char_pos": 1373}, {"type": "D", "before": "Kyle Busch", "after": null, "start_char_pos": 1439, "end_char_pos": 1449}, {"type": "D", "before": "Jeff Burton", "after": null, "start_char_pos": 1481, "end_char_pos": 1492}, {"type": "D", "before": "Matt Kenseth", "after": null, "start_char_pos": 1581, "end_char_pos": 1593}, {"type": "R", "before": "Greg Biffle", "after": "|Greg Biffle", "start_char_pos": 1736, "end_char_pos": 1747}, {"type": "R", "before": "Mark Martin and Carl Edwards", "after": "and", "start_char_pos": 1763, "end_char_pos": 1791}, {"type": "D", "before": "Chase", "after": null, "start_char_pos": 1844, "end_char_pos": 1849}, {"type": "D", "before": "2010 Lenox Industrial Tools 301", "after": null, "start_char_pos": 1889, "end_char_pos": 1920}, {"type": "D", "before": "Tony Stewart", "after": null, "start_char_pos": 1973, "end_char_pos": 1985}, {"type": "D", "before": "Kurt Busch", "after": null, "start_char_pos": 1990, "end_char_pos": 2000}, {"type": "D", "before": "Jeff Gordon", "after": null, "start_char_pos": 2006, "end_char_pos": 2017}, {"type": "D", "before": "Kevin Harvick", "after": null, "start_char_pos": 2022, "end_char_pos": 2035}, {"type": "D", "before": "Ryan Newman", "after": null, "start_char_pos": 2041, "end_char_pos": 2052}, {"type": "D", "before": "Clint Bowyer", "after": null, "start_char_pos": 2058, "end_char_pos": 2070}, {"type": "D", "before": "Dale Earnhardt, Jr.", "after": null, "start_char_pos": 2076, "end_char_pos": 2095}, {"type": "D", "before": "Joey Logano", "after": null, "start_char_pos": 2101, "end_char_pos": 2112}, {"type": "R", "before": "A. J. Allmendinger", "after": "Sister links", "start_char_pos": 2119, "end_char_pos": 2137}], "sents_char_pos": [0, 29, 209, 359, 530, 714, 761, 820, 871, 899, 939, 992, 1095, 1213, 1304, 1350, 1438, 1560, 1650, 1762, 1851]} {"doc_id": "193285", "revision_depth": "1", "before_revision": "Senator Robert Byrd , the longest serving member of the United States Congress died yesterday at the age of 92. Senator Robert Byrd of West Virginia (1917-2010) A spokesman for the Democratic Senator from the state of West Virginia said Byrd had been hospitalized since last week. At first he was thought to have been suffering from heat exhaustion and severe dehydration but other medical conditions developed. On Sunday, his condition was described as \"serious\". Byrd was first elected to the U.S. House of Representatives in 1952 and to the U.S. Senate in 1958. He suffered from ill health in recent years but retained his reputation for securing millions in federal funding for his home state. Throughout his career in the U.S Senate he held positions including Senate Majority Whip, Majority Leader twice and Minority Leader once. Due to his status as the longest serving Senator, Byrd was serving as President pro tempore of the United States Senate , which made him third in line in the Presidential line of succession. Senator Daniel Inouye of Hawaii has been sworn in as the new President pro tempore. Byrd served nine terms in the Senate and was labeled by critics as the \"King of Pork \". He used his former chairmanship of the Senate Appropriations Committee to steer over one billion dollars in federal aid to West Virginia, one of the poorest states in the country, described by him as, \"one of the rock bottomest [sic] of states\". Byrd was originally born as Cornelius Calvin Sale, Jr. on November 20, 1917. He grew up in the coal mining regions of southern West Virginia with his aunt and uncle, who adopted him following the death of his mother in the 1918 flu pandemic . He was the valedictorian of his high school class, but could not afford college and did not attend university courses until his 30s and 40s. The Senator had a fondness for history, and included excerpts of poetry, Shakespeare, Greek and Roman classics along with verses from the Bible in his Senate speeches. He considered himself a staunch defender of United States Constitution, and carried a copy of it in his pocket. Byrd was versed in parliamentary procedure using some of the Senate's arcane rules to his advantage. He received awards from the American Historical Association and the Organization of American Historians for significant contributions to history. Byrd had his share of controversy. He was at one time a member of the Ku Klux Klan , serving as the top officer of his local chapter and once held racial segregationist views. Byrd was involved in the filibuster against the landmark Civil Rights Act of 1964 , which he voted against. Byrd later explicitly and repeatedly denounced his former segregationist views. Byrd is the only Senator to have voted against the nominations of African-American Supreme Court justices Thurgood Marshall and Marshall's successor following his retirement, Clarence Thomas . Byrd's opposition of Thomas was based on the testimony of Anita Hill who accused Thomas of sexually harassing her and due to the fact that Byrd felt Thomas was \"injecting racism\" into the debate by using the phrase \"high-tech lynching of uppity blacks\" in his defense against the allegations. Byrd, who supported the Vietnam War , was one of the most outspoken critics of the War in Iraq . He voted against the Iraq War Resolution . Byrd spoke on the eve the invasion saying, \"Today I weep for my country. [...] No more is the image of America one of strong, yet benevolent peacekeeper. The image of America has changed. Around the globe, our friends mistrust us, our word is disputed, our intentions are questioned. Instead of reasoning with those with whom we disagree, we demand obedience or threaten recrimination.\"", "after_revision": " , the longest serving member of the , died yesterday at the age of 92. Senator Robert Byrd of West Virginia (1917-2010) A spokesman for the Democratic Senator from the state of West Virginia said Byrd had been hospitalized since last week. At first he was thought to have been suffering from and severe but other medical conditions developed. On Sunday, his condition was described as \"serious\". Byrd was first elected to the in 1952 and to the U.S. Senate in 1958. He suffered from ill health in recent years but retained his reputation for securing millions in federal funding for his home state. Throughout his career in the U.S Senate he held positions including , twice and once. Due to his status as the longest serving Senator, Byrd was serving as , which made him third in line in the Presidential line of succession. Senator of Hawaii has been sworn in as the new President pro tempore. Byrd served nine terms in the Senate and was labeled by critics as the \"King of \". He used his former chairmanship of the to steer over one billion dollars in federal aid to West Virginia, one of the poorest states in the country, described by him as, \"one of the rock bottomest [sic] of states\". Byrd was originally born as Cornelius Calvin Sale, Jr. on November 20, 1917. He grew up in the coal mining regions of southern West Virginia with his aunt and uncle, who adopted him following the death of his mother in the . He was the valedictorian of his high school class, but could not afford college and did not attend university courses until his 30s and 40s. The Senator had a fondness for history, and included excerpts of poetry, Shakespeare, Greek and Roman classics along with verses from the Bible in his Senate speeches. He considered himself a staunch defender of United States Constitution, and carried a copy of it in his pocket. Byrd was versed in using some of the Senate's arcane rules to his advantage. He received awards from the American Historical Association and the Organization of American Historians for significant contributions to history. Byrd had his share of controversy. He was at one time a member of the , serving as the top officer of his local chapter and once held racial segregationist views. Byrd was involved in the against the landmark , which he voted against. Byrd later explicitly and repeatedly denounced his former segregationist views. Byrd is the only Senator to have voted against the nominations of African-American justices and Marshall's successor following his retirement, . Byrd's opposition of Thomas was based on the testimony of who accused Thomas of sexually harassing her and due to the fact that Byrd felt Thomas was \"injecting racism\" into the debate by using the phrase \"high-tech lynching of uppity blacks\" in his defense against the allegations. Byrd, who supported the , was one of the most outspoken critics of the . He voted against the . Byrd spoke on the eve the invasion saying, \"Today I weep for my country. [...] No more is the image of America one of strong, yet benevolent peacekeeper. The image of America has changed. Around the globe, our friends mistrust us, our word is disputed, our intentions are questioned. Instead of reasoning with those with whom we disagree, we demand obedience or threaten recrimination.\"", "edit_actions": [{"type": "D", "before": "Senator Robert Byrd", "after": null, "start_char_pos": 0, "end_char_pos": 19}, {"type": "R", "before": "United States Congress", "after": ",", "start_char_pos": 56, "end_char_pos": 78}, {"type": "R", "before": "heat exhaustion and severe dehydration", "after": "and severe", "start_char_pos": 333, "end_char_pos": 371}, {"type": "D", "before": "U.S. House of Representatives", "after": null, "start_char_pos": 495, "end_char_pos": 524}, {"type": "R", "before": "Senate Majority Whip, Majority Leader twice and Minority Leader", "after": ", twice and", "start_char_pos": 766, "end_char_pos": 829}, {"type": "D", "before": "President pro tempore of the United States Senate", "after": null, "start_char_pos": 906, "end_char_pos": 955}, {"type": "D", "before": "Daniel Inouye", "after": null, "start_char_pos": 1035, "end_char_pos": 1048}, {"type": "D", "before": "Pork", "after": null, "start_char_pos": 1191, "end_char_pos": 1195}, {"type": "D", "before": "Senate Appropriations Committee", "after": null, "start_char_pos": 1238, "end_char_pos": 1269}, {"type": "D", "before": "1918 flu pandemic", "after": null, "start_char_pos": 1668, "end_char_pos": 1685}, {"type": "D", "before": "parliamentary procedure", "after": null, "start_char_pos": 2128, "end_char_pos": 2151}, {"type": "D", "before": "Ku Klux Klan", "after": null, "start_char_pos": 2426, "end_char_pos": 2438}, {"type": "D", "before": "filibuster", "after": null, "start_char_pos": 2557, "end_char_pos": 2567}, {"type": "D", "before": "Civil Rights Act of 1964", "after": null, "start_char_pos": 2589, "end_char_pos": 2613}, {"type": "R", "before": "Supreme Court justices Thurgood Marshall", "after": "justices", "start_char_pos": 2803, "end_char_pos": 2843}, {"type": "D", "before": "Clarence Thomas", "after": null, "start_char_pos": 2895, "end_char_pos": 2910}, {"type": "D", "before": "Anita Hill", "after": null, "start_char_pos": 2971, "end_char_pos": 2981}, {"type": "D", "before": "Vietnam War", "after": null, "start_char_pos": 3230, "end_char_pos": 3241}, {"type": "D", "before": "War in Iraq", "after": null, "start_char_pos": 3289, "end_char_pos": 3300}, {"type": "D", "before": "Iraq War Resolution", "after": null, "start_char_pos": 3324, "end_char_pos": 3343}], "sents_char_pos": [0, 111, 280, 411, 464, 564, 697, 835, 1026, 1110, 1198, 1444, 1521, 1687, 1828, 1996, 2108, 2209, 2355, 2390, 2531, 2639, 2719, 2912, 3205, 3302, 3499, 3533, 3629]} {"doc_id": "194412", "revision_depth": "1", "before_revision": "Location of Louisiana, Missouri, the abducted girl's hometown. The Amber Alert issued for four-year-old Alisa Maier of Louisiana , Missouri was canceled after Maier was found alive at a gas station late Tuesday night, just over 24 hours after her kidnapping. A person of interest in the incident shot himself when approached by police on Wednesday afternoon. The young Maier was playing with her six-year-old brother, Blake, when investigators say she was kidnapped at around 8 p.m. CDT (0200 UTC ) Monday evening. The brother ran inside the home to alert his parents after seeing an unfamiliar person drive away with his sister. Police say that the boy was the only witness to the incident, and provided them with a vague description of the suspect and vehicle in the case. Both of Maier's parents were inside their residence at the time of the abduction, and did not notice the incident until their son came in for help. Maier's mother attempted to pursue the kidnapper while waiting for police to arrive, but was unsuccessful. An Amber Alert was issued shortly afterwards, and over 100 searchers, some volunteers, began scouring through Louisiana on Tuesday morning. The Federal Bureau of Investigation (FBI) also joined in the investigation. Currently, the Louisiana Police Department, Missouri State Highway Patrol , FBI, and St. Louis County Police Department, are all involved in the investigation. At around 9:45 p.m. CDT (0245 UTC) Tuesday, Maier was found alive and apparently unharmed wandering near a car wash in Fenton. St. Louis County police were alerted to the area after several people reported that a small boy had been left unattended at the gas station. After talking with the child, police realized it was the missing Maier. She was taken to SSM St. Clare Medical Center for evaluation, released, and then taken to the St. Louis County Police West County Precinct. Early Wednesday morning, she was taken to another hospital, SSM Cardinal Glennon Children's Hospital , for more tests. Police said that Maier's hair was cut, possibly to make her look like a boy, but have not said whether she was sexually assaulted. Maier's family was said to be \"elated\" over the girl's safe return. They recently moved into the town of 4,000, where they have family, but Alisa Maier was born in Ohio. Louisiana is about 80 miles (128.7 kilometres) north of St. Louis and is situated next to the Mississippi River . On Wednesday afternoon, law enforcement officials were following a man driving a dark car to a home in Hawk Point , Missouri when the man reportedly shot himself around 4:30 p.m. CDT (2130 UTC). The man, called a \"person of interest\" in the case, was then transported to a Lake St. Louis hospital. Authorities have not officially released the man's identity, but sources identified the individual as Paul Serling Smith, a 38-year-old registered sex offender previously convicted of sodomy. The shooting occurred about midway between where the kidnapping took place and where Maier was found. Smith was listed in \"critical condition\" Wednesday night, and later died.", "after_revision": "Location of Louisiana, Missouri, the abducted girl's hometown. The issued for four-year-old Alisa Maier of , Missouri was canceled after Maier was found alive at a gas station late Tuesday night, just over 24 hours after her kidnapping. A person of interest in the incident shot himself when approached by police on Wednesday afternoon. The young Maier was playing with her six-year-old brother, Blake, when investigators say she was kidnapped at around 8 p.m. (0200 ) Monday evening. The brother ran inside the home to alert his parents after seeing an unfamiliar person drive away with his sister. Police say that the boy was the only witness to the incident, and provided them with a vague description of the suspect and vehicle in the case. Both of Maier's parents were inside their residence at the time of the abduction, and did not notice the incident until their son came in for help. Maier's mother attempted to pursue the kidnapper while waiting for police to arrive, but was unsuccessful. An Amber Alert was issued shortly afterwards, and over 100 searchers, some volunteers, began scouring through Louisiana on Tuesday morning. The (FBI) also joined in the investigation. Currently, the Louisiana Police Department, , FBI, and St. Louis County Police Department, are all involved in the investigation. At around 9:45 p.m. CDT (0245 UTC) Tuesday, Maier was found alive and apparently unharmed wandering near a car wash in . police were alerted to the area after several people reported that a small boy had been left unattended at the gas station. After talking with the child, police realized it was the missing Maier. She was taken to St. Clare Medical Center for evaluation, released, and then taken to the St. Louis County Police West County Precinct. Early Wednesday morning, she was taken to another hospital, SSM , for more tests. Police said that Maier's hair was cut, possibly to make her look like a boy, but have not said whether she was sexually assaulted. Maier's family was said to be \"elated\" over the girl's safe return. They recently moved into the town of 4,000, where they have family, but Alisa Maier was born in Ohio. Louisiana is about 80 miles (128.7 kilometres) north of and is situated next to the . On Wednesday afternoon, law enforcement officials were following a man driving a dark car to a home in , Missouri when the man reportedly shot himself around 4:30 p.m. CDT (2130 UTC). The man, called a \"person of interest\" in the case, was then transported to a hospital. Authorities have not officially released the man's identity, but sources identified the individual as Paul Serling Smith, a 38-year-old registered sex offender previously convicted of sodomy. The shooting occurred about midway between where the kidnapping took place and where Maier was found. Smith was listed in \"critical condition\" Wednesday night, and later died.", "edit_actions": [{"type": "D", "before": "Amber Alert", "after": null, "start_char_pos": 67, "end_char_pos": 78}, {"type": "D", "before": "Louisiana", "after": null, "start_char_pos": 119, "end_char_pos": 128}, {"type": "D", "before": "CDT", "after": null, "start_char_pos": 483, "end_char_pos": 486}, {"type": "D", "before": "UTC", "after": null, "start_char_pos": 493, "end_char_pos": 496}, {"type": "D", "before": "Federal Bureau of Investigation", "after": null, "start_char_pos": 1174, "end_char_pos": 1205}, {"type": "D", "before": "Missouri State Highway Patrol", "after": null, "start_char_pos": 1290, "end_char_pos": 1319}, {"type": "R", "before": "Fenton. St. Louis County", "after": ".", "start_char_pos": 1525, "end_char_pos": 1549}, {"type": "D", "before": "SSM", "after": null, "start_char_pos": 1763, "end_char_pos": 1766}, {"type": "D", "before": "Cardinal Glennon Children's Hospital", "after": null, "start_char_pos": 1950, "end_char_pos": 1986}, {"type": "D", "before": "St. Louis", "after": null, "start_char_pos": 2362, "end_char_pos": 2371}, {"type": "D", "before": "Mississippi River", "after": null, "start_char_pos": 2400, "end_char_pos": 2417}, {"type": "D", "before": "Hawk Point", "after": null, "start_char_pos": 2523, "end_char_pos": 2533}, {"type": "D", "before": "Lake St. Louis", "after": null, "start_char_pos": 2693, "end_char_pos": 2707}], "sents_char_pos": [0, 62, 258, 358, 514, 629, 774, 922, 1029, 1169, 1245, 1405, 1532, 1673, 1745, 1885, 2004, 2135, 2203, 2305, 2419, 2614, 2717, 2909, 3011]} {"doc_id": "195091", "revision_depth": "1", "before_revision": "The 2010 FIFA World Cup finals were played in Johannesburg's Soccer City stadium. Spain defeated the Netherlands in extra time 1\u20130 to win this year's FIFA World Cup . The winning goal came in the last few minutes of the match, which saw thirteen yellow cards and one red card. Yesterday's win marked Spain's first World Cup victory, in their first World Cup final appearance, making the Spanish team the eighth distinct team to have won the championship since it began in 1930. It was the second time that the European champion for that year won the World Cup as well, the first being West Germany 's victory in 1974. It was also the first time that a European team emerged as the World Cup victors on a continent other than Europe. For the Dutch, it was the third time they have lost in the World Cup finals, having done so in 1974 and 1978. The final match, played in Johannesburg's Soccer City stadium, stayed tied at 0\u20130 for all of regulation time. Called \"a very difficult match\" by Spanish coach Vicente del Bosque , the game started with a slow first half. The Dutch had an opportunity to take the lead in the second half, but Arjen Robben 's shots were blocked by Spanish captain Iker Casillas . The Netherlands were forced to play with only ten players near the end of extra time after John Heitinga was kicked out of the game. The winning shot of the match came from Spanish midfielder Andres Iniesta in the 116th minute, just four minutes from the end of extra time. He managed to kick the ball past Dutch goalkeeper Maarten Stekelenburg from just 8 metres (26.2 feet) away. If Iniesta had not made the goal, and game stayed scoreless until the end of extra time, the game would have been decided by a penalty shoot-out. Spain's victory was correctly predicted by the oracular animal Paul the Octopus. Paul's 2010 FIFA World Cup prediction record stayed at 100 per cent as a result. ", "after_revision": "The 2010 FIFA World Cup finals were played in Johannesburg's Soccer City stadium. Spain defeated the Netherlands in 1\u20130 to win this year's . The winning goal came in the last few minutes of the match, which saw thirteen yellow cards and one red card. Yesterday's win marked Spain's first World Cup victory, in their first World Cup final appearance, making the Spanish team the eighth distinct team to have won the championship since it began in 1930. It was the second time that the European champion for that year won the World Cup as well, the first being 's victory in 1974. It was also the first time that a European team emerged as the World Cup victors on a continent other than Europe. For the Dutch, it was the third time they have lost in the World Cup finals, having done so in 1974 and 1978. The final match, played in 's stadium, stayed tied at 0\u20130 for all of regulation time. Called \"a very difficult match\" by Spanish coach , the game started with a slow first half. The Dutch had an opportunity to take the lead in the second half, but 's shots were blocked by Spanish captain . The Netherlands were forced to play with only ten players near the end of extra time after was kicked out of the game. The winning shot of the match came from Spanish midfielder in the 116th minute, just four minutes from the end of extra time. He managed to kick the ball past Dutch goalkeeper from just 8 metres (26.2 feet) away. If Iniesta had not made the goal, and game stayed scoreless until the end of extra time, the game would have been decided by a penalty shoot-out. Spain's victory was correctly predicted by the Paul the Octopus. Paul's 2010 FIFA World Cup prediction record stayed at 100 per cent as a result. Related news", "edit_actions": [{"type": "D", "before": "extra time", "after": null, "start_char_pos": 116, "end_char_pos": 126}, {"type": "D", "before": "FIFA World Cup", "after": null, "start_char_pos": 150, "end_char_pos": 164}, {"type": "D", "before": "West Germany", "after": null, "start_char_pos": 585, "end_char_pos": 597}, {"type": "R", "before": "Johannesburg's Soccer City", "after": "'s", "start_char_pos": 870, "end_char_pos": 896}, {"type": "D", "before": "Vicente del Bosque", "after": null, "start_char_pos": 1002, "end_char_pos": 1020}, {"type": "D", "before": "Arjen Robben", "after": null, "start_char_pos": 1134, "end_char_pos": 1146}, {"type": "D", "before": "Iker Casillas", "after": null, "start_char_pos": 1188, "end_char_pos": 1201}, {"type": "D", "before": "John Heitinga", "after": null, "start_char_pos": 1295, "end_char_pos": 1308}, {"type": "D", "before": "Andres Iniesta", "after": null, "start_char_pos": 1396, "end_char_pos": 1410}, {"type": "D", "before": "Maarten Stekelenburg", "after": null, "start_char_pos": 1528, "end_char_pos": 1548}, {"type": "D", "before": "oracular animal", "after": null, "start_char_pos": 1779, "end_char_pos": 1794}, {"type": "A", "before": null, "after": "Related news", "start_char_pos": 1894, "end_char_pos": 1894}], "sents_char_pos": [0, 81, 166, 276, 477, 617, 732, 842, 952, 1063, 1203, 1336, 1477, 1585, 1731, 1812]} {"doc_id": "195365", "revision_depth": "1", "before_revision": "George Michael Steinbrenner III , businessman, owner and former principal executive of the New York Yankees , died at 6:30 a.m. EDT (1030 UTC ) Tuesday of a massive heart attack at St. Joseph's Hospital in Tampa, Florida , at age 80. Born on July 4, 1930, Steinbrenner, a former shipping magnate, bought the Yankees from CBS in 1973. As owner of the Yankees, he led the team to eleven American League pennants and seven World Series titles. Nicknamed \"The Boss,\" Steinbrenner pursued free agents with great fervor, signing Reggie Jackson to a five-year, US$3.5 million deal after the 1976 season. He also frequently changed managers, including firing and rehiring Billy Martin five times. Steinbrenner was banned from baseball in 1990 for paying US$ 400,000 to get information to discredit former Yankees outfielder David Winfield , but was reinstated in 1993. New York City mayor Michael Bloomberg ordered flags at City Hall Plaza to be lowered to half mast, saying, \"Our hearts and prayers go out to the entire Steinbrenner family. This is a sad day not only for Yankee fans, but for our entire city, as few people have had a bigger impact on New York over the past four decades than George Steinbrenner.\" Fred Wilpon, Jeff Wilpon, and Saul Katz, owners of the Yankees' crosstown rival Mets , said, \"The passing of George Steinbrenner marks the end of an era in New York City baseball history.\" Yankees legend Yogi Berra said, \"George was The Boss, make no mistake. He built the Yankees into champions and that's something nobody can ever deny. He was a very generous, caring, passionate man. George and I had our differences, but who didn't? We became great friends over the last decade and I will miss him very much.\" Current Commissioner of Baseball Bud Selig said that he is \"very saddened\" to hear of the loss and added, \"George was a giant of the game and his devotion to baseball was surpassed only by his devotion to his family and his beloved New York Yankees....We will miss him, especially Tuesday night when the baseball family will be gathered at Angel Stadium for the All-Star Game.\" Steinbrenner is survived by his wife Joan, two sisters, four children, including Hank and Hal, who took over Yankees operations in 2007, and his grandchildren. The Steinbrenner family said that he will have a private funeral and a public service would be held at a later date. His death comes at a time of great sadness for the Yankees, as two days earlier longtime Yankees public announcer Bob Sheppard died at 99.", "after_revision": " , businessman, owner and former principal executive of the , died at 6:30 a.m. (1030 ) Tuesday of a massive heart attack at St. Joseph's Hospital in , , at age 80. Born on July 4, 1930, Steinbrenner, a former shipping magnate, bought the Yankees from in 1973. As owner of the Yankees, he led the team to eleven pennants and seven titles. Nicknamed \"The Boss,\" Steinbrenner pursued free agents with great fervor, signing to a five-year, 3.5 million deal after the 1976 season. He also frequently changed managers, including firing and rehiring five times. Steinbrenner was banned from baseball in 1990 for paying US 400,000 to get information to discredit former Yankees outfielder , but was reinstated in 1993. mayor ordered flags at to be lowered to half mast, saying, \"Our hearts and prayers go out to the entire Steinbrenner family. This is a sad day not only for Yankee fans, but for our entire city, as few people have had a bigger impact on New York over the past four decades than George Steinbrenner.\" Fred Wilpon, Jeff Wilpon, and Saul Katz, owners of the Yankees' crosstown rival , said, \"The passing of George Steinbrenner marks the end of an era in New York City baseball history.\" Yankees legend said, \"George was The Boss, make no mistake. He built the Yankees into champions and that's something nobody can ever deny. He was a very generous, caring, passionate man. George and I had our differences, but who didn't? We became great friends over the last decade and I will miss him very much.\" Current Commissioner of Baseball said that he is \"very saddened\" to hear of the loss and added, \"George was a giant of the game and his devotion to baseball was surpassed only by his devotion to his family and his beloved New York Yankees....We will miss him, especially Tuesday night when the baseball family will be gathered at Angel Stadium for the All-Star Game.\" Steinbrenner is survived by his wife Joan, two sisters, four children, including Hank and Hal, who took over Yankees operations in 2007, and his grandchildren. The Steinbrenner family said that he will have a private funeral and a public service would be held at a later date. His death comes at a time of great sadness for the Yankees, as two days earlier longtime Yankees public announcer died at 99.", "edit_actions": [{"type": "D", "before": "George Michael Steinbrenner III", "after": null, "start_char_pos": 0, "end_char_pos": 31}, {"type": "D", "before": "New York Yankees", "after": null, "start_char_pos": 91, "end_char_pos": 107}, {"type": "D", "before": "EDT", "after": null, "start_char_pos": 128, "end_char_pos": 131}, {"type": "D", "before": "UTC", "after": null, "start_char_pos": 138, "end_char_pos": 141}, {"type": "D", "before": "Tampa, Florida", "after": null, "start_char_pos": 206, "end_char_pos": 220}, {"type": "A", "before": null, "after": ",", "start_char_pos": 223, "end_char_pos": 223}, {"type": "D", "before": "CBS", "after": null, "start_char_pos": 322, "end_char_pos": 325}, {"type": "D", "before": "American League", "after": null, "start_char_pos": 386, "end_char_pos": 401}, {"type": "D", "before": "World Series", "after": null, "start_char_pos": 421, "end_char_pos": 433}, {"type": "D", "before": "Reggie Jackson", "after": null, "start_char_pos": 524, "end_char_pos": 538}, {"type": "R", "before": "US$3.5 million deal after the 1976 season. He also frequently changed managers, including firing and rehiring Billy Martin five times. Steinbrenner was banned from baseball in 1990 for paying US$", "after": "3.5 million deal after the 1976 season. He also frequently changed managers, including firing and rehiring five times. Steinbrenner was banned from baseball in 1990 for paying US", "start_char_pos": 555, "end_char_pos": 750}, {"type": "D", "before": "David Winfield", "after": null, "start_char_pos": 817, "end_char_pos": 831}, {"type": "R", "before": "New York City mayor Michael Bloomberg", "after": "mayor", "start_char_pos": 862, "end_char_pos": 899}, {"type": "D", "before": "City Hall Plaza", "after": null, "start_char_pos": 917, "end_char_pos": 932}, {"type": "D", "before": "Mets", "after": null, "start_char_pos": 1289, "end_char_pos": 1293}, {"type": "D", "before": "Yogi Berra", "after": null, "start_char_pos": 1413, "end_char_pos": 1423}, {"type": "D", "before": "Bud Selig", "after": null, "start_char_pos": 1756, "end_char_pos": 1765}, {"type": "D", "before": "Bob Sheppard", "after": null, "start_char_pos": 2492, "end_char_pos": 2504}], "sents_char_pos": [0, 234, 334, 441, 597, 689, 861, 1034, 1208, 1397, 1468, 1547, 1595, 1645, 1975, 2100, 2260, 2377]} {"doc_id": "195758", "revision_depth": "1", "before_revision": "upright=1.5| Saadanius hijazensis , a new species of fossil primate closely related to Old World monkeys and apes . Researchers have unearthed a new fossil primate that they think may be closely related to the common ancestor of apes and Old World monkeys , collectively known as catarrhine primates. Paleontologist Iyad Zalmout of the University of Michigan discovered the new species, Saadanius hijazensis near Mecca in Saudi Arabia ; the discovery gives new insights into human evolution . The specimen, a partial skull, dates to the Oligocene , approximately 29 to 28 million years ago, and exhibits puncture wounds from a large predator that may have killed it. Saadanius is thought to have been a tree-dweller and lived at a time when the Arabian peninsula had not yet split away from the African continent, forming the Red Sea . The discovery may help resolve the dating of the split between Old World monkeys and apes. Paleoanthropologists have traditionally dated the divergence to between 25 and 23 million years ago, based on early fossils of the two groups. Genetic studies, however, date it to between 30 to 35 million years ago. Although Saadanius shares some features with living catarrhine primates, such as a bony ear tube, called an ectotympanic , it also possesses other features more common in the fossils of primitive or basal catarrhines, from which Old World monkeys and apes did not evolve. These basal features include a longer face and the lack of a frontal sinus .", "after_revision": "upright=1.5| , a new species of fossil primate closely related to and . Researchers have unearthed a new fossil that they think may be closely related to the common ancestor of and , collectively known as primates. Paleontologist Iyad Zalmout of the discovered the new species, near in ; the discovery gives new insights into . The specimen, a partial skull, dates to the , approximately 29 to 28 million years ago, and exhibits puncture wounds from a large predator that may have killed it. Saadanius is thought to have been a tree-dweller and lived at a time when the had not yet split away from the African continent, forming the . The discovery may help resolve the dating of the split between Old World monkeys and apes. have traditionally dated the divergence to between 25 and 23 million years ago, based on early fossils of the two groups. Genetic studies, however, date it to between 30 to 35 million years ago. Although Saadanius shares some features with living catarrhine primates, such as a bony ear tube, called an , it also possesses other features more common in the fossils of primitive or catarrhines, from which Old World monkeys and apes did not evolve. These basal features include a longer face and the lack of a .", "edit_actions": [{"type": "D", "before": "Saadanius hijazensis", "after": null, "start_char_pos": 13, "end_char_pos": 33}, {"type": "R", "before": "Old World monkeys and apes", "after": "and", "start_char_pos": 87, "end_char_pos": 113}, {"type": "D", "before": "primate", "after": null, "start_char_pos": 156, "end_char_pos": 163}, {"type": "R", "before": "apes and Old World monkeys", "after": "and", "start_char_pos": 229, "end_char_pos": 255}, {"type": "D", "before": "catarrhine", "after": null, "start_char_pos": 280, "end_char_pos": 290}, {"type": "D", "before": "University of Michigan", "after": null, "start_char_pos": 336, "end_char_pos": 358}, {"type": "R", "before": "Saadanius hijazensis near Mecca in Saudi Arabia", "after": "near in", "start_char_pos": 387, "end_char_pos": 434}, {"type": "D", "before": "human evolution", "after": null, "start_char_pos": 475, "end_char_pos": 490}, {"type": "D", "before": "Oligocene", "after": null, "start_char_pos": 537, "end_char_pos": 546}, {"type": "D", "before": "Arabian peninsula", "after": null, "start_char_pos": 745, "end_char_pos": 762}, {"type": "D", "before": "Red Sea", "after": null, "start_char_pos": 826, "end_char_pos": 833}, {"type": "D", "before": "Paleoanthropologists", "after": null, "start_char_pos": 927, "end_char_pos": 947}, {"type": "D", "before": "ectotympanic", "after": null, "start_char_pos": 1251, "end_char_pos": 1263}, {"type": "D", "before": "basal", "after": null, "start_char_pos": 1342, "end_char_pos": 1347}, {"type": "D", "before": "frontal sinus", "after": null, "start_char_pos": 1476, "end_char_pos": 1489}], "sents_char_pos": [0, 300, 436, 492, 666, 835, 926, 1069, 1142, 1414]} {"doc_id": "197042", "revision_depth": "1", "before_revision": "For the second time this season, Leongatha defeated Gippsland Football League heavyweights Traralgon . Playing at home, they went on to win by sixteen points. The Gippsland Football League, officially the Gippsland League, is the only major Australian rules football competition in the Gippsland region according to the Victorian Country Football League . The final quarter saw Traralgon fight back and come within three goals of taking an unlikely victory. They managed to kick seven goals to Leongatha's, one goal, one behind to end the day losing by 16 points, 11-7 (73) to 9-3 (57). Around the grounds, Drouin kicked three more behinds than the aggregate of the match described above as they defeated Sale in Sale 20-13 (133) to 17-8 (110), an inaccurate Maffra defeated a dismal Warragul in Warragul 13-26 (104) to 1-3 (9) and Moe traveled to Morwel to defeat the hosts 17-13 (115) to 11-17 (83).", "after_revision": "For the second time this season, defeated heavyweights . Playing at home, they went on to win by sixteen points. The Gippsland Football League, officially the Gippsland League, is the only major competition in the region according to the . The final quarter saw Traralgon fight back and come within three goals of taking an unlikely victory. They managed to kick seven goals to Leongatha's, one goal, one behind to end the day losing by 16 points, 11\u20137 (73) to 9\u20133 (57). Around the grounds, kicked three more behinds than the aggregate of the match described above as they defeated Sale in 20\u201313 (133) to 17\u20138 (110), an inaccurate defeated a dismal Warragul in 13\u201326 (104) to 1\u20133 (9) and traveled to to defeat the hosts 17\u201313 (115) to 11\u201317 (83).", "edit_actions": [{"type": "R", "before": "Leongatha defeated Gippsland Football League heavyweights Traralgon", "after": "defeated heavyweights", "start_char_pos": 33, "end_char_pos": 100}, {"type": "D", "before": "Australian rules football", "after": null, "start_char_pos": 241, "end_char_pos": 266}, {"type": "D", "before": "Gippsland", "after": null, "start_char_pos": 286, "end_char_pos": 295}, {"type": "D", "before": "Victorian Country Football League", "after": null, "start_char_pos": 320, "end_char_pos": 353}, {"type": "R", "before": "11-7", "after": "11\u20137", "start_char_pos": 564, "end_char_pos": 568}, {"type": "R", "before": "9-3", "after": "9\u20133", "start_char_pos": 577, "end_char_pos": 580}, {"type": "D", "before": "Drouin", "after": null, "start_char_pos": 607, "end_char_pos": 613}, {"type": "R", "before": "Sale 20-13", "after": "20\u201313", "start_char_pos": 713, "end_char_pos": 723}, {"type": "R", "before": "17-8", "after": "17\u20138", "start_char_pos": 733, "end_char_pos": 737}, {"type": "D", "before": "Maffra", "after": null, "start_char_pos": 759, "end_char_pos": 765}, {"type": "R", "before": "Warragul 13-26", "after": "13\u201326", "start_char_pos": 796, "end_char_pos": 810}, {"type": "R", "before": "1-3", "after": "1\u20133", "start_char_pos": 820, "end_char_pos": 823}, {"type": "R", "before": "Moe traveled to Morwel", "after": "traveled", "start_char_pos": 832, "end_char_pos": 854}, {"type": "A", "before": null, "after": "to", "start_char_pos": 858, "end_char_pos": 858}, {"type": "R", "before": "17-13", "after": "17\u201313", "start_char_pos": 876, "end_char_pos": 881}, {"type": "R", "before": "11-17", "after": "11\u201317", "start_char_pos": 891, "end_char_pos": 896}], "sents_char_pos": [0, 158, 355, 457, 586]} {"doc_id": "197156", "revision_depth": "1", "before_revision": "The Open Rights Group , a pressure group pursuing reform of intellectual property law in the United Kingdom, held its first \"ORGCon\" yesterday at City University London . Approximately 100 delegates took part in six hours of panel discussions and workshops on a wide range of topics in intellectual property, discussing such subjects as \"How To Talk To Your MP \" and \"ACTA: A Shady Business\", in what ORG billed as a \"crash course in digital rights\" designed to inspire campaigning on intellectual property issues. Cory Doctorow , a fiction author and digital rights activist, led the keynote panel discussion \"Thriving in the Real Digital Economy\", which opened the conference. Doctorow called for a \"reframing\" of the digital rights slogan \"information wants to be free\". \"The most important thing\" about digital rights, he noted, \"has nothing to do with art. We are refitting the information network with lots of control.\" Digital rights management (DRM) technologies, Doctorow warns, build in limitations on how consumers exchange information and \"abuse the market\". John Buckman of Magnatune followed up Doctorow's comments, noting that DRM is \"unsustainable\" but that the public needed to \"pressure companies into\" open-source solutions. A keynote speech by James Boyle compared the current age to the age just before application of the theories of Adam Smith and other early capitalist economists began breaking down the entrenched monopolies of mercantilism . Boyle called on the audience to come up with a \"jaw droppingly simple\" idea for a reformed copyright system; he gave his speech in front of a projection of the twitterfall as audience members commented on his words. Boyle, like most of the conference, took a pro-reform but anti-piracy position, saying \"It is a tragedy that an entire generation has lost the notion that breaking the law is wrong\". While several members of the Pirate Party UK , wearing matching t-shirts, attended the conference and held a fringe meeting during the last session, none spoke in the keynote sessions either as panelists or in the discussions.", "after_revision": "London \u2014 The , a pressure group pursuing reform of law in the United Kingdom, held its first \"ORGCon\" yesterday at . Approximately 100 delegates took part in six hours of panel discussions and workshops on a wide range of topics in intellectual property, discussing such subjects as \"How To Talk To Your \" and \"ACTA: A Shady Business\", in what ORG billed as a \"crash course in digital rights\" designed to inspire campaigning on intellectual property issues. , a fiction author and digital rights activist, led the keynote panel discussion \"Thriving in the Real Digital Economy\", which opened the conference. Doctorow called for a \"reframing\" of the digital rights slogan \"information wants to be free\". \"The most important thing\" about digital rights, he noted, \"has nothing to do with art. We are refitting the information network with lots of control.\" (DRM) technologies, Doctorow warns, build in limitations on how consumers exchange information and \"abuse the market\". John Buckman of followed up Doctorow's comments, noting that DRM is \"unsustainable\" but that the public needed to \"pressure companies into\" open-source solutions. A keynote speech by compared the current age to the age just before application of the theories of and other early capitalist economists began breaking down the entrenched monopolies of . Boyle called on the audience to come up with a \"jaw droppingly simple\" idea for a reformed copyright system; he gave his speech in front of a projection of the as audience members commented on his words. Boyle, like most of the conference, took a pro-reform but anti- position, saying \"It is a tragedy that an entire generation has lost the notion that breaking the law is wrong\". While several members of the , wearing matching t-shirts, attended the conference and held a during the last session, none spoke in the keynote sessions either as panelists or in the discussions.", "edit_actions": [{"type": "R", "before": "The Open Rights Group", "after": "London \u2014 The", "start_char_pos": 0, "end_char_pos": 21}, {"type": "D", "before": "intellectual property", "after": null, "start_char_pos": 60, "end_char_pos": 81}, {"type": "D", "before": "City University London", "after": null, "start_char_pos": 146, "end_char_pos": 168}, {"type": "D", "before": "MP", "after": null, "start_char_pos": 358, "end_char_pos": 360}, {"type": "D", "before": "Cory Doctorow", "after": null, "start_char_pos": 515, "end_char_pos": 528}, {"type": "D", "before": "Digital rights management", "after": null, "start_char_pos": 926, "end_char_pos": 951}, {"type": "D", "before": "Magnatune", "after": null, "start_char_pos": 1087, "end_char_pos": 1096}, {"type": "D", "before": "James Boyle", "after": null, "start_char_pos": 1264, "end_char_pos": 1275}, {"type": "D", "before": "Adam Smith", "after": null, "start_char_pos": 1355, "end_char_pos": 1365}, {"type": "D", "before": "mercantilism", "after": null, "start_char_pos": 1453, "end_char_pos": 1465}, {"type": "D", "before": "twitterfall", "after": null, "start_char_pos": 1628, "end_char_pos": 1639}, {"type": "R", "before": "anti-piracy", "after": "anti-", "start_char_pos": 1742, "end_char_pos": 1753}, {"type": "D", "before": "Pirate Party UK", "after": null, "start_char_pos": 1896, "end_char_pos": 1911}, {"type": "D", "before": "fringe meeting", "after": null, "start_char_pos": 1976, "end_char_pos": 1990}], "sents_char_pos": [0, 373, 514, 678, 773, 861, 925, 1070, 1243, 1576, 1683, 1866]} {"doc_id": "197522", "revision_depth": "1", "before_revision": "Apple's new Magic Trackpad, seen from above On Tuesday, Apple Inc. introduced a new peripheral, the Magic Trackpad , and refreshed its line of iMac and Mac Pro computers, as well as the Apple Cinema Display . The Magic Trackpad, a multi-touch trackpad for Macintosh computers, allows end users to use certain gestures to control on-screen actions. It supports gestures already seen on the MacBook and MacBook Pro trackpads, as well as the iPhone, iPod Touch, and iPad , such as swiping, tap-to-click, and pinch-to-zoom. However, the Magic Trackpad also supports physical clicking and supports one- and two-button commands. The Magic Trackpad, which is retailed for US$69, connects wirelessly to a computer using Bluetooth technology and has a claimed four months of battery life. At 5.17 inches (13.13 centimetres) long and 5.12 inches (13 centimetres) wide, the glass and aluminium device is slightly larger than Apple's laptop trackpads. In addition to the Magic Trackpad, Apple also began selling the US$29 Apple Battery Charger accessory, a charger pack with six rechargeable batteries usable in the Magic Trackpad, Apple Wireless Keyboard, and Apple Magic Mouse. Apple claims that the nickel-metal hydride (NiMH) batteries can last up to ten years before they lose their ability to hold a charge. The Magic Trackpad uses two AA batteries, and can be used with any Bluetooth-enabled Macintosh computer running Mac OS X 10.6.4. Another major announcement that came on Tuesday was the first iMac update since last fall. The update included mostly internal upgrades, giving consumers a choice of newer Intel processors: the dual-core Core i3 and Core i5, and the quad-core Core i5 and Core i7. In addition, the SD card slot was expanded to allow support for the Secure Digital Extended Capacity (SDXC) format. The iMac is still available at 21.5-inch (54.61-centimetre) and 27-inch (68.58-centimetre) display options, but has upgraded graphics cards as well. The screens use in-plane switching (IPS) technology, allowing for a greater viewing angle. The base model is still priced at US$1,199. Apple's line of Mac Pro computers were also given a refresh on Tuesday. Consumers now have the option to purchase a Mac Pro with twelve processing cores, using two six-core Intel Xeon processors. Four-, six-, and eight-core options are still available. The update also includes the choice of adding up to four, 512GB solid state drives, instead of conventional hard drives. The base model is priced at US$2,499 and will be sold starting in August. Apple also released a new, 27-inch (68.58 centimetre) LED Cinema Display, a 60 percent increase in display area from the older 24-inch (60.96 centimetres) Cinema Display. The new monitor can reach a resolution of 2560-by-1440 pixels, or Wide Quad High Definition, and has a built-in microphone, webcam, speakers, USB hub, and ambient light sensor, which changes the display's brightness based on external lighting levels. It is priced at US 999 but will not be available for purchase until September.", "after_revision": "Apple's new Magic Trackpad, seen from above On Tuesday, Apple Inc. introduced a new , the , and refreshed its line of and computers, as well as the . The Magic Trackpad, a for Macintosh computers, allows end users to use certain gestures to control on-screen actions. It supports gestures already seen on the and trackpads, as well as the , , and , such as swiping, tap-to-click, and pinch-to-zoom. However, the Magic Trackpad also supports physical clicking and supports one- and two-button commands. The Magic Trackpad, which is retailed for 69, connects wirelessly to a computer using technology and has a claimed four months of battery life. At 5.17 inches (13.13 centimetres) long and 5.12 inches (13 centimetres) wide, the glass and aluminium device is slightly larger than Apple's laptop trackpads. In addition to the Magic Trackpad, Apple also began selling the US$29 Apple Battery Charger accessory, a charger pack with six usable in the Magic Trackpad, , and . Apple claims that the (NiMH) batteries can last up to ten years before they lose their ability to hold a charge. The Magic Trackpad uses two , and can be used with any Bluetooth-enabled Macintosh computer running 10.6.4. Another major announcement that came on Tuesday was the first iMac update since last fall. The update included mostly internal upgrades, giving consumers a choice of newer processors: the and , and the Core i5 and . In addition, the slot was expanded to allow support for the (SDXC) format. The iMac is still available at 21.5-inch (54.61-centimetre) and 27-inch (68.58-centimetre) display options, but has upgraded as well. The screens use (IPS) technology, allowing for a greater viewing angle. The base model is still priced at US$1,199. Apple 's line of Mac Pro computers were also given a refresh on Tuesday. Consumers now have the option to purchase a Mac Pro with twelve processing cores, using two six-core Intel processors. Four-, six-, and eight-core options are still available. The update also includes the choice of adding up to four, 512 , instead of conventional . The base model is priced at US $2,499 and will be sold starting in August. Apple also released a new, 27-inch (68.58 centimetre) Cinema Display, a 60 percent increase in display area from the older 24-inch (60.96 centimetres) Cinema Display. The new monitor can reach a resolution of 2560-by-1440 pixels, or , and has a built-in microphone, webcam, speakers, , and , which changes the display's brightness based on external lighting levels. It is priced at US$ 999 but will not be available for purchase until September.", "edit_actions": [{"type": "D", "before": "peripheral, the Magic Trackpad", "after": null, "start_char_pos": 84, "end_char_pos": 114}, {"type": "A", "before": null, "after": "the ,", "start_char_pos": 117, "end_char_pos": 117}, {"type": "R", "before": "iMac and Mac Pro", "after": "and", "start_char_pos": 144, "end_char_pos": 160}, {"type": "D", "before": "Apple Cinema Display", "after": null, "start_char_pos": 187, "end_char_pos": 207}, {"type": "D", "before": "multi-touch trackpad", "after": null, "start_char_pos": 232, "end_char_pos": 252}, {"type": "R", "before": "MacBook and MacBook Pro", "after": "and", "start_char_pos": 390, "end_char_pos": 413}, {"type": "D", "before": "iPhone, iPod Touch, and iPad", "after": null, "start_char_pos": 440, "end_char_pos": 468}, {"type": "A", "before": null, "after": ", and ,", "start_char_pos": 471, "end_char_pos": 471}, {"type": "R", "before": "US$69, connects wirelessly to a computer using Bluetooth technology and has a claimed four months of battery life. At 5.17 inches (13.13 centimetres) long and 5.12 inches (13 centimetres) wide, the glass and aluminium device is slightly larger than Apple's laptop trackpads. In addition to the Magic Trackpad, Apple also began selling the US$29 Apple Battery Charger accessory, a charger pack with six rechargeable batteries usable in the Magic Trackpad, Apple Wireless Keyboard, and Apple Magic Mouse. Apple claims that the nickel-metal hydride (NiMH) batteries can last up to ten years before they lose their ability to hold a charge. The Magic Trackpad uses two AA batteries, and can be used with any Bluetooth-enabled Macintosh computer running Mac OS X 10.6.4.", "after": "69, connects wirelessly to a computer using technology and has a claimed four months of battery life. At 5.17 inches (13.13 centimetres) long and 5.12 inches (13 centimetres) wide, the glass and aluminium device is slightly larger than Apple's laptop trackpads.", "start_char_pos": 667, "end_char_pos": 1432}, {"type": "A", "before": null, "after": "In addition to the Magic Trackpad, Apple also began selling the US$29 Apple Battery Charger accessory, a charger pack with six usable in the Magic Trackpad, , and . Apple claims that the (NiMH) batteries can last up to ten years before they lose their ability to hold a charge. The Magic Trackpad uses two , and can be used with any Bluetooth-enabled Macintosh computer running 10.6.4. Another major announcement that came on Tuesday was the first iMac update since last fall. The update included mostly internal upgrades, giving consumers a choice of newer processors: the and , and the Core i5 and . In addition, the slot was expanded to allow support for the (SDXC) format. The iMac is still available at 21.5-inch (54.61-centimetre) and 27-inch (68.58-centimetre) display options, but has upgraded as well. The screens use (IPS) technology, allowing for a greater viewing angle. The base model is still priced at US$1,199.", "start_char_pos": 1433, "end_char_pos": 1433}, {"type": "D", "before": "Another major announcement that came on Tuesday was the first iMac update since last fall. The update included mostly internal upgrades, giving consumers a choice of newer Intel processors: the dual-core Core i3 and Core i5, and the quad-core Core i5 and Core i7. In addition, the SD card slot was expanded to allow support for the Secure Digital Extended Capacity (SDXC) format. The iMac is still available at 21.5-inch (54.61-centimetre) and 27-inch (68.58-centimetre) display options, but has upgraded graphics cards as well. The screens use in-plane switching (IPS) technology, allowing for a greater viewing angle. The base model is still priced at US$1,199. Apple's line of Mac Pro computers were also given a refresh on Tuesday. Consumers now have the option to purchase a Mac Pro with twelve processing cores, using two six-core Intel Xeon processors. Four-, six-, and eight-core options are still available. The update also includes the choice of adding up to four, 512GB solid state drives, instead of conventional hard drives. The base model is priced at US$2,499 and will be sold starting in August.", "after": null, "start_char_pos": 1434, "end_char_pos": 2545}, {"type": "R", "before": "also released a new, 27-inch (68.58 centimetre) LED Cinema Display, a 60 percent increase in display area from the older 24-inch (60.96 centimetres) Cinema Display. The new monitor can reach a resolution of 2560-by-1440 pixels, or Wide Quad High Definition, and has a built-in microphone, webcam, speakers, USB hub, and ambient light sensor, which changes the display's brightness based on external lighting levels. It", "after": "'s line of Mac Pro computers were also given a refresh on Tuesday. Consumers now have the option to purchase a Mac Pro with twelve processing cores, using two six-core Intel processors. Four-, six-, and eight-core options are still available. The update also includes the choice of adding up to four, 512 , instead of conventional . The base model", "start_char_pos": 2552, "end_char_pos": 2970}, {"type": "A", "before": null, "after": "$2,499 and will be sold starting in August. Apple also released a new, 27-inch (68.58 centimetre) Cinema Display, a 60 percent increase in display area from the older 24-inch (60.96 centimetres) Cinema Display. The new monitor can reach a resolution of 2560-by-1440 pixels, or , and has a built-in microphone, webcam, speakers, , and , which changes the display's brightness based on external lighting levels. It is priced at US$", "start_char_pos": 2987, "end_char_pos": 2987}], "sents_char_pos": [0, 209, 348, 521, 624, 781, 941, 1169, 1303, 1432, 1524, 1697, 1813, 1962, 2053, 2097, 2169, 2293, 2350, 2471, 2545, 2716, 2967]} {"doc_id": "199277", "revision_depth": "1", "before_revision": "Hiroshima aftermath The 65th anniversary of the first use of an atomic bomb against people has been remembered in a ceremony Thursday in Hiroshima , Japan. The atomic bomb, code-named \" Little Boy \", was dropped on Hiroshima at precisely 08:15 local time on August 6, 1945 by the specially converted United States Army Air Force B-29 Superfortress bomber Enola Gay piloted by Colonel Paul Tibbets , who later retired as a brigadier general in the United States Air Force . U.S. Ambassador to Japan John Roos also attended, marking the first time that a U.S. representative has attended the ceremony. Meanwhile, some conservatives in the United States have criticised the choice for Roos to attend. Gene Tibbets, the son of retired Brigadier General Tibbets said on Fox News , \"It's making the Japanese look like they're the poor people, like they didn't do anything. They hit Pearl Harbor, they struck us. We didn't slaughter the Japanese. We stopped the war.\" Three days after Hiroshima, another atomic bomb, \" Fat Man \", was dropped on nearby Nagasaki . The Japanese Government surrendered unconditionally on August 15, and signed the formal surrender on the USS Missouri on September 2 in Tokyo Bay .", "after_revision": "Hiroshima aftermath The 65th anniversary of the has been remembered in a ceremony Thursday in , Japan. The atomic bomb, code-named \" \", was dropped on Hiroshima at precisely 08:15 local time on August 6, 1945 by the specially converted bomber piloted by Colonel , who later retired as a brigadier general in the . U.S. Ambassador to Japan also attended, marking the first time that a U.S. representative has attended the ceremony. Meanwhile, some conservatives in the United States have criticised the choice for Roos to attend. Gene Tibbets, the son of retired Brigadier General Tibbets said on , \"It's making the Japanese look like they're the poor people, like they didn't do anything. They hit Pearl Harbor, they struck us. We didn't slaughter the Japanese. We stopped the war.\" Three days after Hiroshima, another atomic bomb, \" \", was dropped on nearby . The Japanese Government surrendered unconditionally on August 15, and signed the formal surrender on the on September 2 in .", "edit_actions": [{"type": "D", "before": "first use of an atomic bomb against people", "after": null, "start_char_pos": 48, "end_char_pos": 90}, {"type": "D", "before": "Hiroshima", "after": null, "start_char_pos": 137, "end_char_pos": 146}, {"type": "D", "before": "Little Boy", "after": null, "start_char_pos": 186, "end_char_pos": 196}, {"type": "R", "before": "United States Army Air Force B-29 Superfortress bomber Enola Gay", "after": "bomber", "start_char_pos": 300, "end_char_pos": 364}, {"type": "D", "before": "Paul Tibbets", "after": null, "start_char_pos": 384, "end_char_pos": 396}, {"type": "D", "before": "United States Air Force", "after": null, "start_char_pos": 447, "end_char_pos": 470}, {"type": "D", "before": "John Roos", "after": null, "start_char_pos": 498, "end_char_pos": 507}, {"type": "D", "before": "Fox News", "after": null, "start_char_pos": 765, "end_char_pos": 773}, {"type": "D", "before": "Fat Man", "after": null, "start_char_pos": 1012, "end_char_pos": 1019}, {"type": "D", "before": "Nagasaki", "after": null, "start_char_pos": 1045, "end_char_pos": 1053}, {"type": "D", "before": "USS Missouri", "after": null, "start_char_pos": 1161, "end_char_pos": 1173}, {"type": "D", "before": "Tokyo Bay", "after": null, "start_char_pos": 1192, "end_char_pos": 1201}], "sents_char_pos": [0, 155, 599, 697, 866, 905, 939, 960, 1055]} {"doc_id": "200264", "revision_depth": "2", "before_revision": "I like making Wikinews Shorts and the quiz, but I also like doing the harder stuff. Other interesting Shankarnikhil88-related stuff An alternative homepage I created- In working order A page I created for mobile devices- In working order Another main page- In working order User:Shankarnikhil88/Wikibusiness- In working order User:Shankarnikhil88/Wikiculture- In working order Shankarnikhil88-related stuff that failed or doesn't work Another page I created for mobile devices- In working order, not updated A page for searching- Not in working order A second page- Not updated Another main page- In working order User:Shankarnikhil88/mynews- Not in working order%DIFDELCMD < %DIFDELCMD < %%% Articles on Wikipedia that I've edited URL (with IP)%DIFDELCMD < %DIFDELCMD < %%% URL URL%DIFDELCMD < %DIFDELCMD < %%% URL URL%DIFDELCMD < %DIFDELCMD < %%% URL Articles on Wikinews that I've made or edited", "after_revision": "I like making Wikinews Shorts and the quiz, but I also like doing the harder stuff. I made a lot of alt homepages for Wikinews but that's junk and I don't know how to delete them so just ignore them. %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% Articles on Wikinews that I've made (or edited)", "edit_actions": [{"type": "A", "before": null, "after": "I made a lot of alt homepages for Wikinews but that's junk and I don't know how to delete them so just ignore them.", "start_char_pos": 84, "end_char_pos": 84}, {"type": "D", "before": "Other interesting Shankarnikhil88-related stuff An alternative homepage I created- In working order A page I created for mobile devices- In working order Another main page- In working order User:Shankarnikhil88/Wikibusiness- In working order User:Shankarnikhil88/Wikiculture- In working order", "after": null, "start_char_pos": 85, "end_char_pos": 377}, {"type": "D", "before": "Shankarnikhil88-related stuff that failed or doesn't work Another page I created for mobile devices- In working order, not updated A page for searching- Not in working order A second page- Not updated Another main page- In working order User:Shankarnikhil88/mynews- Not in working order", "after": null, "start_char_pos": 378, "end_char_pos": 664}, {"type": "D", "before": "Articles on Wikipedia that I've edited", "after": null, "start_char_pos": 694, "end_char_pos": 732}, {"type": "D", "before": "URL (with IP)", "after": null, "start_char_pos": 733, "end_char_pos": 746}, {"type": "D", "before": "URL", "after": null, "start_char_pos": 776, "end_char_pos": 779}, {"type": "D", "before": "URL", "after": null, "start_char_pos": 780, "end_char_pos": 783}, {"type": "D", "before": "URL", "after": null, "start_char_pos": 813, "end_char_pos": 816}, {"type": "D", "before": "URL", "after": null, "start_char_pos": 817, "end_char_pos": 820}, {"type": "D", "before": "URL", "after": null, "start_char_pos": 850, "end_char_pos": 853}, {"type": "R", "before": "Articles on", "after": "Articles on", "start_char_pos": 854, "end_char_pos": 865}, {"type": "R", "before": "or edited", "after": "(or edited)", "start_char_pos": 890, "end_char_pos": 899}], "sents_char_pos": [0, 83, 280, 332, 620]} {"doc_id": "202088", "revision_depth": "1", "before_revision": "Christoph Schlingensief in 2009 German director Christoph Schlingensief has died at the age of 49. His death was announced by Oliver Golloch , a spokesman for the Ruhrtriennale festival . Schlingensief had been suffering from lung cancer but no official cause of death was given by the spokesman. The film and theatre director worked on several films, plays, and operas throughout his controversial career. Schlingensief directed films such as \u201c 100 Years of Adolf Hitler\u201d and \u201c The German Chainsaw Massacre \u201d . He was arrested in 1997 for his exhibition of work called \u201cKill Helmut Kohl\u201d , aimed at the then Chancellor . Besides plays shown in Germany, Schlingensief also worked in Austria and Switzerland. He was the director of the Richard Wagner festival in both Bayreuth , Germany and Brazil. During his time working in Bayreuth he said \u201c Bayreuth will give me cancer. \u201d Coincidently, four years later Schlingensief was diagnosed with lung cancer even though he was a non-smoker. Despite the cancer he continued to work on plays and films often watching them from a hospital bed. He married costume designer Anio Laberenz and founded an opera project in the African country of Burkina Faso with funding from the German government, all while battling the disease. Bernd Neumann, Germany\u2019s state commissioner for culture paid tribute to Schlingensief. He said Schlingensief \u201c had had an immense influence on German-language film and theater \u201d . Mayor of Berlin, Klaus Wowereit said on Saturday that \"a major talent in theater has left the stage.\"", "after_revision": " in 2009 German has died at the age of 49. His death was announced by , a spokesman for the . Schlingensief had been suffering from but no official cause of death was given by the spokesman. The film and theatre director worked on several films, plays, and operas throughout his controversial career. Schlingensief directed films such as \" 100 Years of \" and \" The German Chainsaw Massacre \" . He was arrested in 1997 for his exhibition of work called \"Kill \" , aimed at the then . Besides plays shown in Germany, Schlingensief also worked in Austria and Switzerland. He was the director of the in both , Germany and Brazil. During his time working in Bayreuth he said \" Bayreuth will give me cancer. \" Coincidently, four years later Schlingensief was diagnosed with lung cancer even though he was a non-smoker. Despite the cancer he continued to work on plays and films often watching them from a hospital bed. He married costume designer and founded an opera project in the African country of Burkina Faso with funding from the German government, all while battling the disease. , Germany's state , paid tribute to Schlingensief. He said Schlingensief \" had had an immense influence on German-language film and theater \" . Mayor of , said on Saturday that \"a major talent in theater has left the stage.\"", "edit_actions": [{"type": "D", "before": "Christoph Schlingensief", "after": null, "start_char_pos": 0, "end_char_pos": 23}, {"type": "D", "before": "director Christoph Schlingensief", "after": null, "start_char_pos": 39, "end_char_pos": 71}, {"type": "D", "before": "Oliver Golloch", "after": null, "start_char_pos": 126, "end_char_pos": 140}, {"type": "D", "before": "Ruhrtriennale festival", "after": null, "start_char_pos": 163, "end_char_pos": 185}, {"type": "D", "before": "lung cancer", "after": null, "start_char_pos": 226, "end_char_pos": 237}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 444, "end_char_pos": 445}, {"type": "R", "before": "Adolf Hitler\u201d and \u201c", "after": "\" and \"", "start_char_pos": 459, "end_char_pos": 478}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 508, "end_char_pos": 509}, {"type": "R", "before": "\u201cKill Helmut Kohl\u201d", "after": "\"Kill \"", "start_char_pos": 570, "end_char_pos": 588}, {"type": "D", "before": "Chancellor", "after": null, "start_char_pos": 609, "end_char_pos": 619}, {"type": "R", "before": "Richard Wagner festival in both Bayreuth", "after": "in both", "start_char_pos": 735, "end_char_pos": 775}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 842, "end_char_pos": 843}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 874, "end_char_pos": 875}, {"type": "D", "before": "Anio Laberenz", "after": null, "start_char_pos": 1113, "end_char_pos": 1126}, {"type": "R", "before": "Bernd Neumann, Germany\u2019s state commissioner for culture", "after": ", Germany's state ,", "start_char_pos": 1268, "end_char_pos": 1323}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1377, "end_char_pos": 1378}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1444, "end_char_pos": 1445}, {"type": "R", "before": "Berlin, Klaus Wowereit", "after": ",", "start_char_pos": 1457, "end_char_pos": 1479}], "sents_char_pos": [0, 98, 296, 406, 621, 707, 797, 873, 984, 1084, 1267, 1354]} {"doc_id": "202474", "revision_depth": "1", "before_revision": "On Tuesday the U.S. Army released its revised solicitation for the Ground Combat Vehicle infantry fighting vehicle three months after scrapping its previous plans. The United States Army retracted its first solicitation for the Ground Combat Vehicle (GCV) on 25 August. It was decided by the army to begin anew after a \"red team\" recommended that the army either upgrade the existing ground vehicle fleet or rewrite the requirements. Program officials choose to end evaluations of vehicle submissions and to begin again in two months with new requirements. The previous design requirements emphasized modularity, affordability, rapid design and low risk technology. The infantry fighting vehicle variant would have carried a crew of three and nine infantry dismounts. It was initially to be compatible with the current Battle Command Control and Communications Suite but would gradually use a more revolutionary network. The system would support networking between external systems, vehicles and soldiers. It was to be transportable by C-17 cargo aircraft , rail, and ship and be as logistically deployable as the Stryker . The army officials were open to tracked or wheeled submissions but suggested that it be tracked due to the weight stemming from the requirements. The vehicle had an off-road speed requirement of 30 mph (50 km/h) and was required to deliver improved maintainability and consume less fuel than the Bradley Fighting Vehicle . The army wanted the vehicle to leverage an autocannon , a anti-tank guided missile system and non-lethal weapons . The army wanted the vehicle to have the blast protection level equal to the MRAP and supplement armor with active protection systems . The army wanted the first vehicle variant to be a troop carrier that would displace the aging M113 APCs and M2 Bradleys . Later, other variants of the GCV would appear. There were four known competing contractors for the Ground Combat Vehicle contract. BAE Systems led a team consisting of Northrop Grumman, QinetiQ, and Saft Group . BAE offered a tracked vehicle with a hybrid-electric engine, a baseline weight of 53 tons and a maximum weight tolerance of 75 tons for modular armor and various countermeasures including a V-hull and active protection systems. General Dynamics led a team consisting of Lockheed Martin, Detroit Diesel and Raytheon . General Dynamics offered a vehicle using diesel and leveraging an active protection system. SAIC led a consortia called Team Full Spectrum which included Boeing, Krauss-Maffei and Rheinmetall . SAIC offered a vehicle based on the Puma . Advanced Defense Vehicle Systems (ADVS) submitted its proposal for a wheeled vehicle but was rejected for being non-compliant. The predecessor to the GCV, the Manned Ground Vehicle family, was canceled in April 2009. Similar programs like the M8 light tank and XM2001 Crusader have also been scrapped in the past. The Expeditionary Fighting Vehicle, Joint Light Tactical Vehicle , and Ground Combat Vehicle programs have been targeted for cancellation by the National Commission on Fiscal Responsibility and Reform .", "after_revision": "On Tuesday the U.S. Army released its revised solicitation for the three months after scrapping its previous plans. The United States Army retracted its first for the Ground Combat Vehicle (GCV) on 25 August. It was decided by the army to begin anew after a \"red team\" recommended that the army either upgrade the existing ground vehicle fleet or rewrite the requirements. Program officials choose to end evaluations of vehicle submissions and to begin again in two months with new requirements. The previous design requirements emphasized modularity, affordability, rapid design and low risk technology. The infantry fighting vehicle variant would have carried a crew of three and nine infantry dismounts. It was initially to be compatible with the current Battle Command Control and Communications Suite but would gradually use a more revolutionary network. The system would support networking between external systems, vehicles and soldiers. It was to be transportable by , rail, and ship and be as logistically deployable as the . The army officials were open to tracked or wheeled submissions but suggested that it be tracked due to the weight stemming from the requirements. The vehicle had an off-road speed requirement of 30 mph (50 km/h) and was required to deliver improved maintainability and consume less fuel than the . The army wanted the vehicle to leverage an , a anti-tank guided missile system and . The army wanted the vehicle to have the blast protection level equal to the and supplement armor with . The army wanted the first vehicle variant to be a troop carrier that would displace the aging and . Later, other variants of the GCV would appear. There were four known competing contractors for the Ground Combat Vehicle contract. led a team consisting of , , and . BAE offered a tracked vehicle with a hybrid-electric engine, a baseline weight of 53 tons and a maximum weight tolerance of 75 tons for modular armor and various countermeasures including a and active protection systems. led a team consisting of , , and . General Dynamics offered a vehicle using diesel and leveraging an active protection system. led a consortium called Team Full Spectrum which included , , and . SAIC offered a vehicle based on the . Advanced Defense Vehicle Systems (ADVS) submitted its proposal for a wheeled vehicle but was rejected for being non-compliant. The predecessor to the GCV, the family, was canceled in April 2009. Similar programs like the and have also been scrapped in the past. The , , and Ground Combat Vehicle programs have been targeted for cancellation by the .", "edit_actions": [{"type": "D", "before": "Ground Combat Vehicle infantry fighting vehicle", "after": null, "start_char_pos": 67, "end_char_pos": 114}, {"type": "D", "before": "solicitation", "after": null, "start_char_pos": 207, "end_char_pos": 219}, {"type": "D", "before": "C-17 cargo aircraft", "after": null, "start_char_pos": 1036, "end_char_pos": 1055}, {"type": "D", "before": "Stryker", "after": null, "start_char_pos": 1114, "end_char_pos": 1121}, {"type": "D", "before": "Bradley Fighting Vehicle", "after": null, "start_char_pos": 1420, "end_char_pos": 1444}, {"type": "D", "before": "autocannon", "after": null, "start_char_pos": 1490, "end_char_pos": 1500}, {"type": "D", "before": "non-lethal weapons", "after": null, "start_char_pos": 1541, "end_char_pos": 1559}, {"type": "D", "before": "MRAP", "after": null, "start_char_pos": 1638, "end_char_pos": 1642}, {"type": "D", "before": "active protection systems", "after": null, "start_char_pos": 1669, "end_char_pos": 1694}, {"type": "R", "before": "M113 APCs and M2 Bradleys", "after": "and", "start_char_pos": 1791, "end_char_pos": 1816}, {"type": "D", "before": "BAE Systems", "after": null, "start_char_pos": 1950, "end_char_pos": 1961}, {"type": "R", "before": "Northrop Grumman, QinetiQ, and Saft Group", "after": ", , and", "start_char_pos": 1987, "end_char_pos": 2028}, {"type": "D", "before": "V-hull", "after": null, "start_char_pos": 2221, "end_char_pos": 2227}, {"type": "D", "before": "General Dynamics", "after": null, "start_char_pos": 2259, "end_char_pos": 2275}, {"type": "R", "before": "Lockheed Martin, Detroit Diesel and Raytheon", "after": ", , and", "start_char_pos": 2301, "end_char_pos": 2345}, {"type": "R", "before": "SAIC led a consortia", "after": "led a consortium", "start_char_pos": 2440, "end_char_pos": 2460}, {"type": "R", "before": "Boeing, Krauss-Maffei and Rheinmetall", "after": ", , and", "start_char_pos": 2502, "end_char_pos": 2539}, {"type": "D", "before": "Puma", "after": null, "start_char_pos": 2578, "end_char_pos": 2582}, {"type": "D", "before": "Manned Ground Vehicle", "after": null, "start_char_pos": 2744, "end_char_pos": 2765}, {"type": "R", "before": "M8 light tank and XM2001 Crusader", "after": "and", "start_char_pos": 2828, "end_char_pos": 2861}, {"type": "D", "before": "Expeditionary Fighting Vehicle, Joint Light Tactical Vehicle", "after": null, "start_char_pos": 2903, "end_char_pos": 2963}, {"type": "A", "before": null, "after": ",", "start_char_pos": 2966, "end_char_pos": 2966}, {"type": "D", "before": "National Commission on Fiscal Responsibility and Reform", "after": null, "start_char_pos": 3045, "end_char_pos": 3100}], "sents_char_pos": [0, 163, 269, 433, 556, 665, 767, 920, 1005, 1123, 1269, 1446, 1561, 1696, 1865, 1949, 2258, 2439, 2584, 2711, 2801, 2898]} {"doc_id": "203173", "revision_depth": "3", "before_revision": "It has emerged that the 33 Chilean miners trapped underground after the mine they were working in collapsed could be brought to the surface in a shorter time than was initially feared. While officials publicly announced that the men would not be brought to the surface until Christmas, sources inside technical meetings have revealed that they could in fact be on the surface by early November. The news comes as families were allowed to speak by radio-telephone to their trapped loved ones on Sunday. Over the weekend, video images filmed by the miners emerged showing the miners playing dominoes at a table and singing the Chilean national anthem . The miners also used the camera to send video messages to their families on the surface, saying that they regularly broke into tears, but were feeling better having received food and water. The grainy nightvision images, filmed on a high definition camcorder that was sent down a small shaft to the mine, show the men in good spirits, chanting \"long live Chile , and long live the miners.\" They are unshaven and stripped to the waist because of the heat underground, and are seen wearing white clinical trousers that have been designed to keep them dry. Giving a guided tour of the area they are occupying, Mario Sep\u00falveda, one of the miners, explains they have a \"little cup to brush our teeth\", and a place where they pray each day. \"We have everything organized,\" he tells the camera. Gesturing to the table in the center of the room, he says that \"we meet here every day. We plan, we have assemblies here every day so that all the decisions we make are based on the thoughts of all 33.\" Another unidentified miner asks to rescuers, \"get us out of here soon, please.\" A thermometer is shown in the video, reading 29.5C (85F). Upon seeing the video in a private screening, family members, who are living in a small village of tents at the entrance to the copper-gold mine\u2014which they have named Camp Hope\u2014were elated. \"He's skinny, bearded and it was painful to see him with his head hanging down, but I am so happy to see him alive\", said Ruth Contreras, the mother of Carlos Bravo, who is trapped in the mine. The video, of which only a small portion has been released to the public, shows the miners, many of them wearing helmets , cracking jokes and thanking the rescuers for their continued efforts. The supplies are being sent to the men through a small shaft only twelve centimeters wide, and a laboratory has been set up with the purpose of designing collapsible cots and miniature sandwiches, which can be sent down such a narrow space. CNN reported on Friday that \"officials are splitting the men into two shifts so one group sleeps while the other works or has leisure time .. On average, each man has lost 22 pounds (10 kilograms) since they became trapped three weeks ago, and dehydration remains a threat. But a survey of the men indicates that at least nine miners are still too overweight to fit through the proposed rescue shaft. Initially, the miners survived by draining water from a water-cooled piece of equipment. To stay hydrated in the 90-degree mine, each miner must drink eight or nine pints of water per day.\" But while there are jubilant celebrations on the surface that the miners are alive, officials are now nervous that the miners could become depressed , trapped in a dark room the size of a small apartment. Chilean health minister Jaime Ma\u00f1alich said that, on the video, he saw the telltale signs of depression. \"They are more isolated, they don't want to be on the screen, they are not eating well\", he said. \"I would say depression is the correct word.\" He said that doctors who had watched the video had observed the men suffering from \"severe dermatological problems.\" Dr. Rodrigo Figueroa, head of the trauma, stress and disaster unit at the in Santiago, Chile, explained that \"following the euphoria of being discovered, the normal psychological reaction would be for the men to collapse in a combination of fatigue and stress ... People who are trained for emergencies \u2013 like these miners \u2013 tend to minimize their own needs or to ignore them. When it is time to ask for help, they don't.\" NASA has advised emergency workers that entertaining the miners would be a good idea. They are to be sent a television system complete with taped football matches. Another dilemma facing Ma\u00f1alich is whether the miners should be permitted to smoke underground. While nicotine gum has been delivered to the miners, sending down cigarettes is a plan that has not been ruled out. 300px|The message sent up confirming that the miners were alive. \"We are fine in the shelter the 33\" [of us], it reads. With the news that drilling of the main rescue tunnel was expected to begin on Monday, officials have informed the media that they hope to have the miners out of the mine by Christmas \u2014but sources with access to technical meetings have suggested that the miners could actually be rescued by the first week of November. A news report described the rescue plan\u2014\"the main focus is a machine that bores straight down to 688m and creates a chimney-type duct that could be used to haul the miners out one by one in a rescue basket. A second drilling operation will attempt to intercept a mining tunnel at a depth of roughly 350m. The miners would then have to make their way through several miles of dark, muddy tunnels and meet the rescue drill at roughly the halfway point of their current depth of 688m.\" Iv\u00e1n Viveros Aranas, a Chilean policeman working at Camp Hope, told reporters that Chile \"has shown a unity regardless of religion or social class. You see people arriving here just to volunteer, they have no relation at all to these families.\" But over the weekend, The New York Times reported that the \"miners who have astonished the world with their discipline a half-mile underground will have to aid their own escape \u2014 clearing 3,000 to 4,000 tons of rock that will fall as the rescue hole is drilled, the engineer in charge of drilling said Sunday ... The work will require about a half-dozen men working in shifts 24 hours a day.\" Andr\u00e9s Sougarret, a senior engineer involved in operating the drill said that \"the miners are going to have to take out all that material as it falls.\" The families of those trapped were allowed to speak to them by radio-telephone on Sunday\u2014a possibility that brought reassurance both the miners and those on the surface. The Intendant of the Atacama Region, Ximena Matas , said that there had been \"moments of great emotion.\" She continued to say that the families \"listened with great interest and they both felt and realized that the men are well. This has been a very important moment, which no doubt strengthens their [the miners'] morale.\" The phone line is thought to be quite temperamental, but it is hoped that soon, those in the mine and those in Camp Hope will be able to talk every day. \"To hear his voice was a balm to my heart ... He is aware that the rescue is not going to happen today, that it will take some time. He asked us to stay calm as everything is going to be OK ... He sounded relaxed and since it was so short I didn't manage to ask anything. Twenty seconds was nothing\", said said Jessica Cort\u00e9s, who spoke to her husband V\u00edctor Zamora, who was not even a miner, but a vehicle mechanic. \"He went in that day because a vehicle had broken down inside the mine ... At first they told us he had been crushed [to death].\"", "after_revision": "It has emerged that the 33 Chilean miners trapped underground after the mine they were working in could be brought to the surface in a shorter time than was initially feared. While officials publicly announced that the men would not be brought to the surface until Christmas, sources inside technical meetings have revealed that they could in fact be on the surface by early November. The news comes as families were allowed to speak by radio-telephone to their trapped loved ones on Sunday. Over the weekend, video images filmed by the miners emerged showing the miners playing at a table and singing the . The miners also used the camera to send video messages to their families on the surface, saying that they regularly broke into tears, but were feeling better having received food and water. The grainy images, filmed on a that was sent down a small shaft to the mine, show the men in good spirits, chanting \"long live , and long live the miners.\" They are unshaven and stripped to the waist because of the heat underground, and are seen wearing white clinical trousers that have been designed to keep them dry. Giving a guided tour of the area they are occupying, Mario Sep\u00falveda, one of the miners, explains they have a \"little cup to brush our teeth\", and a place where they pray each day. \"We have everything organized,\" he tells the camera. Gesturing to the table in the center of the room, he says that \"we meet here every day. We plan, we have assemblies here every day so that all the decisions we make are based on the thoughts of all 33.\" Another unidentified miner asks to rescuers, \"get us out of here soon, please.\" A is shown in the video, reading 29.5C (85F). Upon seeing the video in a private screening, family members, who are living in a small village of tents at the entrance to the - mine\u2014which they have named Camp Hope\u2014were elated. \"He's skinny, bearded and it was painful to see him with his head hanging down, but I am so happy to see him alive\", said Ruth Contreras, the mother of Carlos Bravo, who is trapped in the mine. The video, of which only a small portion has been released to the public, shows the miners, many of them wearing , cracking jokes and thanking the rescuers for their continued efforts. The supplies are being sent to the men through a small shaft only twelve centimeters wide, and a laboratory has been set up with the purpose of designing collapsible cots and miniature sandwiches, which can be sent down such a narrow space. reported on Friday that \"officials are splitting the men into two shifts so one group sleeps while the other works or has leisure time .. On average, each man has lost 22 pounds (10 kilograms) since they became trapped three weeks ago, and dehydration remains a threat. But a survey of the men indicates that at least nine miners are still too overweight to fit through the proposed rescue shaft. Initially, the miners survived by draining water from a water-cooled piece of equipment. To stay hydrated in the 90-degree mine, each miner must drink eight or nine pints of water per day.\" But while there are jubilant celebrations on the surface that the miners are alive, officials are now nervous that the miners could become , trapped in a dark room the size of a small apartment. Chilean health minister said that, on the video, he saw the telltale signs of depression. \"They are more isolated, they don't want to be on the screen, they are not eating well\", he said. \"I would say depression is the correct word.\" He said that doctors who had watched the video had observed the men suffering from \"severe dermatological problems.\" Dr. Rodrigo Figueroa, head of the trauma, stress and disaster unit at the in Santiago, Chile, explained that \"following the euphoria of being discovered, the normal psychological reaction would be for the men to collapse in a combination of fatigue and stress ... People who are trained for emergencies \u2013 like these miners \u2013 tend to minimize their own needs or to ignore them. When it is time to ask for help, they don't.\" NASA has advised emergency workers that entertaining the miners would be a good idea. They are to be sent a television system complete with taped matches. Another dilemma facing Ma\u00f1alich is whether the miners should be permitted to underground. While has been delivered to the miners, sending down is a plan that has not been ruled out. 300px|The message sent up confirming that the miners were alive. \"We are fine in the shelter the 33\" [of us], it reads. With the news that drilling of the main rescue tunnel was expected to begin on Monday, officials have informed the media that they hope to have the miners out of the mine by \u2014but sources with access to technical meetings have suggested that the miners could actually be rescued by the first week of November. A news report described the rescue plan\u2014\"the main focus is a machine that bores straight down to 688m and creates a chimney-type duct that could be used to haul the miners out one by one in a rescue basket. A second drilling operation will attempt to intercept a mining tunnel at a depth of roughly 350m. The miners would then have to make their way through several miles of dark, muddy tunnels and meet the rescue drill at roughly the halfway point of their current depth of 688m.\" Iv\u00e1n Viveros Aranas, a Chilean policeman working at Camp Hope, told reporters that Chile \"has shown a unity regardless of religion or social class. You see people arriving here just to volunteer, they have no relation at all to these families.\" But over the weekend, reported that the \"miners who have astonished the world with their discipline a half-mile underground will have to aid their own escape \u2014 clearing 3,000 to 4,000 tons of rock that will fall as the rescue hole is drilled, the engineer in charge of drilling said Sunday ... The work will require about a half-dozen men working in shifts 24 hours a day.\" Andr\u00e9s Sougarret, a senior engineer involved in operating the drill said that \"the miners are going to have to take out all that material as it falls.\" The families of those trapped were allowed to speak to them by radio-telephone on Sunday\u2014a possibility that brought reassurance both the miners and those on the surface. The Intendant of the Atacama Region, , said that there had been \"moments of great emotion.\" She continued to say that the families \"listened with great interest and they both felt and realized that the men are well. This has been a very important moment, which no doubt strengthens their [the miners'] morale.\" The phone line is thought to be quite temperamental, but it is hoped that soon, those in the mine and those in Camp Hope will be able to talk every day. \"To hear his voice was a balm to my heart ... He is aware that the rescue is not going to happen today, that it will take some time. He asked us to stay calm as everything is going to be OK ... He sounded relaxed and since it was so short I didn't manage to ask anything. Twenty seconds was nothing\", said said Jessica Cort\u00e9s, who spoke to her husband V\u00edctor Zamora, who was not even a miner, but a vehicle mechanic. \"He went in that day because a vehicle had broken down inside the mine ... At first they told us he had been crushed [to death].\"", "edit_actions": [{"type": "D", "before": "collapsed", "after": null, "start_char_pos": 98, "end_char_pos": 107}, {"type": "D", "before": "dominoes", "after": null, "start_char_pos": 589, "end_char_pos": 597}, {"type": "D", "before": "Chilean national anthem", "after": null, "start_char_pos": 625, "end_char_pos": 648}, {"type": "D", "before": "nightvision", "after": null, "start_char_pos": 852, "end_char_pos": 863}, {"type": "D", "before": "high definition camcorder", "after": null, "start_char_pos": 884, "end_char_pos": 909}, {"type": "D", "before": "Chile", "after": null, "start_char_pos": 1006, "end_char_pos": 1011}, {"type": "D", "before": "thermometer", "after": null, "start_char_pos": 1724, "end_char_pos": 1735}, {"type": "R", "before": "copper-gold", "after": "-", "start_char_pos": 1908, "end_char_pos": 1919}, {"type": "D", "before": "helmets", "after": null, "start_char_pos": 2277, "end_char_pos": 2284}, {"type": "D", "before": "CNN", "after": null, "start_char_pos": 2598, "end_char_pos": 2601}, {"type": "D", "before": "depressed", "after": null, "start_char_pos": 3328, "end_char_pos": 3337}, {"type": "D", "before": "Jaime Ma\u00f1alich", "after": null, "start_char_pos": 3418, "end_char_pos": 3432}, {"type": "D", "before": "football", "after": null, "start_char_pos": 4329, "end_char_pos": 4337}, {"type": "D", "before": "smoke", "after": null, "start_char_pos": 4424, "end_char_pos": 4429}, {"type": "D", "before": "nicotine gum", "after": null, "start_char_pos": 4449, "end_char_pos": 4461}, {"type": "D", "before": "cigarettes", "after": null, "start_char_pos": 4509, "end_char_pos": 4519}, {"type": "D", "before": "Christmas", "after": null, "start_char_pos": 4853, "end_char_pos": 4862}, {"type": "D", "before": "The New York Times", "after": null, "start_char_pos": 5748, "end_char_pos": 5766}, {"type": "D", "before": "Ximena Matas", "after": null, "start_char_pos": 6478, "end_char_pos": 6490}], "sents_char_pos": [0, 184, 394, 501, 650, 840, 1040, 1204, 1385, 1438, 1526, 1721, 1779, 1969, 2163, 2356, 2597, 2739, 2871, 2998, 3087, 3188, 3393, 3498, 3596, 3642, 4023, 4136, 4268, 4346, 4442, 4558, 4623, 4678, 4997, 5204, 5302, 5480, 5628, 5725, 6038, 6118, 6270, 6440, 6545, 6669, 6764, 6917, 6963, 7050, 7111, 7189, 7334, 7409]} {"doc_id": "203446", "revision_depth": "1", "before_revision": "Alain Corneau at the Yokohama French Film Festival in 2005 Alain Corneau , a French film director , has died at the age of 67. His death was announced by the Artmedia talent agency. The cause of death was announced as cancer . Born on August 7, 1943, Corneau's first interest was music. He later went to Paris to study filmmaking. Before the success of his first film, Corneau attempted to make a documentary about New York and an adaptation of a novel. After working as assistant director on L'Aveu with Costa Gavras he directed his first film in 1973, France, Inc. Corneau's other films include La Menace, Fort Saganne , and the highly successful Tous les matins du monde . Tous les matins du monde received 11 C\u00e9sar Award nominations and won seven of them. The awards included Best Film, Best Director, and Best Music. Corneau said in a 1992 interview in the New York Times that \"Many people got emotional about this film, and that made it possible for it to escape cult status.\" Corneau was set to appear at the Toronto Film Festival in September.", "after_revision": "at the in 2005 , a French , has died at the age of 67. His death was announced by the talent agency. The cause of death was announced as . Born on August 7, 1943, Corneau's first interest was music. He later went to Paris to study filmmaking. Before the success of his first film, Corneau attempted to make a about New York and an adaptation of a novel. After working as assistant director on with he directed his first film in 1973, France, Inc. Corneau's other films include , , and the highly successful . Tous les matins du monde received 11 nominations and won seven of them. The awards included Best Film, Best Director, and Best Music. Corneau said in a 1992 interview in the that \"Many people got emotional about this film, and that made it possible for it to escape cult status.\" Corneau was set to appear at the in September.", "edit_actions": [{"type": "R", "before": "Alain Corneau at the Yokohama French Film Festival", "after": "at the", "start_char_pos": 0, "end_char_pos": 50}, {"type": "D", "before": "Alain Corneau", "after": null, "start_char_pos": 59, "end_char_pos": 72}, {"type": "D", "before": "film director", "after": null, "start_char_pos": 84, "end_char_pos": 97}, {"type": "D", "before": "Artmedia", "after": null, "start_char_pos": 158, "end_char_pos": 166}, {"type": "D", "before": "cancer", "after": null, "start_char_pos": 218, "end_char_pos": 224}, {"type": "D", "before": "documentary", "after": null, "start_char_pos": 397, "end_char_pos": 408}, {"type": "R", "before": "L'Aveu with Costa Gavras", "after": "with", "start_char_pos": 493, "end_char_pos": 517}, {"type": "D", "before": "La Menace, Fort Saganne", "after": null, "start_char_pos": 597, "end_char_pos": 620}, {"type": "A", "before": null, "after": ",", "start_char_pos": 623, "end_char_pos": 623}, {"type": "D", "before": "Tous les matins du monde", "after": null, "start_char_pos": 650, "end_char_pos": 674}, {"type": "D", "before": "C\u00e9sar Award", "after": null, "start_char_pos": 714, "end_char_pos": 725}, {"type": "D", "before": "New York Times", "after": null, "start_char_pos": 863, "end_char_pos": 877}, {"type": "D", "before": "Toronto Film Festival", "after": null, "start_char_pos": 1017, "end_char_pos": 1038}], "sents_char_pos": [0, 126, 181, 286, 330, 453, 676, 760, 822, 983]} {"doc_id": "203956", "revision_depth": "1", "before_revision": "Shakemap of the earthquake. Building damage in Worcester Street, corner Manchester Street, with ChristChurch Cathedral in the background. The USGS says an earthquake of magnitude 7.0 occurred in the Canterbury region of New Zealand's South Island at Saturday 04:35:44 AM local time (Friday 16:35:44 UTC). Officials in New Zealand say the magnitude was 7.1. The earthquake occurred at a depth of 10.0 kilometers (6.21 miles). The epicenter was located 40 kilometers (25 miles) west of Christchurch ; 190 kilometers (115 miles) south-southeast of Westport ; 295 kilometers (185 miles) southwest of Wellington ; and 320 kilometers (200 miles) north-northeast of Dunedin . New Zealand's Civil Defence Minister John Carter has declared a state of emergency in Christchurch and Selwyn District . Widespread damage extending beyond Christchurch has damaged infrastructure, including substantial disruption to the power and water supply. Two people were reported seriously injured, and local residents have also reported that chimneys have fallen in through roofs, ceilings cracked and brick walls collapsed. Several aftershocks were also felt as far north as New Plymouth . Bob Parker , the mayor of Christchurch, told the New Zealand Herald that he is \"thankful there has been no loss of life but there had been considerable damage across the city and outlying areas.\" \"We are very happy and blessed that no one died,\" Prime Minister John Key said; he further pledged that \"we are here to support them. We are not going to let Christchurch suffer this great tragedy on their own.\" People in the Christchurch area have been told not to enter the CBD, and a curfew has been established there from 7pm to 7am. Other towns have also had parts closed off to be inspected for safety. The NOAA 's evaluation of the situation predicts that significant damage will not progress beyond New Zealand: \"Based on the earthquake magnitude, location and historic tsunami records, a damaging tsunami is not expected along the California, Oregon, Washington, British Columbia, and Alaska coasts. At coastal locations which have experienced strong ground shaking, local tsunamis are possible due to underwater landslides.\" ", "after_revision": "Shakemap of the earthquake. Building damage in Worcester Street, corner Manchester Street, with in the background. The says an earthquake of magnitude 7.0 occurred in the Canterbury region of New Zealand's at Saturday 04:35:44 AM local time (Friday 16:35:44 UTC). Officials in New Zealand say the magnitude was 7.1. The earthquake occurred at a depth of 10.0 kilometers (6.21 miles). The epicenter was located 40 kilometers (25 miles) west of ; 190 kilometers (115 miles) south-southeast of ; 295 kilometers (185 miles) southwest of ; and 320 kilometers (200 miles) north-northeast of . New Zealand's Civil Defence Minister has declared a state of emergency in Christchurch and . Widespread damage extending beyond Christchurch has damaged infrastructure, including substantial disruption to the power and water supply. Two people were reported seriously injured, and local residents have also reported that chimneys have fallen in through roofs, ceilings cracked and brick walls collapsed. Several aftershocks were also felt as far north as . , the mayor of Christchurch, told the that he is \"thankful there has been no loss of life but there had been considerable damage across the city and outlying areas.\" \"We are very happy and blessed that no one died,\" Prime Minister said; he further pledged that \"we are here to support them. We are not going to let Christchurch suffer this great tragedy on their own.\" People in the Christchurch area have been told not to enter the CBD, and a curfew has been established there from 7pm to 7am. Other towns have also had parts closed off to be inspected for safety. The 's evaluation of the situation predicts that significant damage will not progress beyond New Zealand: \"Based on the earthquake magnitude, location and historic tsunami records, a damaging tsunami is not expected along the California, Oregon, Washington, British Columbia, and Alaska coasts. At coastal locations which have experienced strong ground shaking, local tsunamis are possible due to underwater landslides.\" Sister links", "edit_actions": [{"type": "D", "before": "ChristChurch Cathedral", "after": null, "start_char_pos": 96, "end_char_pos": 118}, {"type": "D", "before": "USGS", "after": null, "start_char_pos": 142, "end_char_pos": 146}, {"type": "D", "before": "South Island", "after": null, "start_char_pos": 234, "end_char_pos": 246}, {"type": "D", "before": "Christchurch", "after": null, "start_char_pos": 484, "end_char_pos": 496}, {"type": "D", "before": "Westport", "after": null, "start_char_pos": 545, "end_char_pos": 553}, {"type": "D", "before": "Wellington", "after": null, "start_char_pos": 596, "end_char_pos": 606}, {"type": "D", "before": "Dunedin", "after": null, "start_char_pos": 659, "end_char_pos": 666}, {"type": "D", "before": "John Carter", "after": null, "start_char_pos": 706, "end_char_pos": 717}, {"type": "D", "before": "Selwyn District", "after": null, "start_char_pos": 772, "end_char_pos": 787}, {"type": "D", "before": "New Plymouth", "after": null, "start_char_pos": 1152, "end_char_pos": 1164}, {"type": "D", "before": "Bob Parker", "after": null, "start_char_pos": 1167, "end_char_pos": 1177}, {"type": "D", "before": "New Zealand Herald", "after": null, "start_char_pos": 1216, "end_char_pos": 1234}, {"type": "D", "before": "John Key", "after": null, "start_char_pos": 1428, "end_char_pos": 1436}, {"type": "D", "before": "NOAA", "after": null, "start_char_pos": 1776, "end_char_pos": 1780}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 2198, "end_char_pos": 2198}], "sents_char_pos": [0, 27, 137, 304, 356, 424, 498, 555, 608, 668, 789, 929, 1100, 1362, 1442, 1496, 1700, 1771, 2071]} {"doc_id": "204818", "revision_depth": "1", "before_revision": "Commemorative statue of the Bicentennial of Chile, located in front of La Moneda Palace, in Santiago . Chile is celebrating its Bicentennial, with several events that have been organized by the government for almost a decade. It commemorates two hundred years since the First Government Junta of 1810 was formed, starting the Independence process, that ended in 1818 after Bernardo O'Higgins proclaimed it. The Bicentennial takes place on a holiday from September 17th until 21st. Sebasti\u00e1n Pi\u00f1era inaugurated the official fondas (places where typical food and drinks of Chile are sold; similar to a tavern) earlier on Friday. Pi\u00f1era also danced a \"pie\" of Cueca , Chile's national dance, with Government Spokeswoman Ena Von Baer . More than 60 thousand people gathered on Plaza de la Ciudadan\u00eda (Citizen's Square) in Santiago to celebrate the Bicentennial. There was a projection of historical images that also contained a message from the trapped miners in Copiap\u00f3 . A giant flag of Chile (18 meters of height, 27 of width; weighing 200 kilograms) was raised on the square on Friday morning. Pichilemu \"Fonda Don Vicente Nario\" in Colegio Preciosa Sangre. Celebrations of the Bicentennial in Pichilemu started earlier this month. On September 2, two thousand people lined up in a formation to create the message \"Viva Chile Bicentenario Cardenal Caro\" on Pichilemu beach \"Las Terrazas\". The message was used to create a postal stamp to be released worldwide. The event was promoted by the Government of Cardenal Caro Province . Private schools in the city, such as Colegio Preciosa Sangre , prepared events specially for their students. On Thursday, \"Fonda Don Vicente Nario\" was opened on Preciosa Sangre. Several games were performed there on that morning, including \"el emboque\", \"ponerle la cola al burro\" (to put the tail to the donkey), and others. Another event on Preciosa Sangre took place on Thursday night, when students recreated scenes of the History of Chile, including: a tertulia featuring Manuel Montt (starred by Luis Rojas); a chingana (a popular tavern); and selected colonial professions, such as the \"motero\" (person who sold motemei and chestnuts). The official fonda of Pichilemu, La Bombonera, was inaugurated on Thursday night by Mayor Roberto C\u00f3rdova, who danced cueca with people who attended the event. According to C\u00f3rdova, at least 30,000 people have arrived at Pichilemu as of Friday, and it is estimated that another 30,000 will arrive during the next three days. A great event took place on Pichilemu beach on Friday afternoon. Chilean typical games highlighted the event. People danced reggaeton, Am\u00e9rico 's cumbias and cuecas, while others were swimming. The National Shoe Fair (Feria Nacional del Calzado) was established on Agust\u00edn Ross Hotel on Thursday, and will stay in the town until September 23rd. Alicia Grez, who works on a kiosk in the Pichileminian Craft Fair located in front of One Discotheque, said that \"sales have been excellent,\" and that \"[they] won't miss the possibility to experience such an event like this.\" See also ", "after_revision": "Commemorative statue of the Bicentennial of Chile, located in front of , in . Chile is celebrating its Bicentennial, with several events that have been organized by the government for almost a decade. It commemorates two hundred years since the of 1810 was formed, starting the Independence process, that ended in 1818 after proclaimed it. The Bicentennial takes place on a holiday from September 17th until 21st. Sebasti\u00e1n Pi\u00f1era inaugurated the official fondas (places where typical food and drinks of Chile are sold; similar to a tavern) earlier on Friday. Pi\u00f1era also danced a \"pie\" of , Chile's national dance, with Government Spokeswoman . More than 60 thousand people gathered on (Citizen's Square) in Santiago to celebrate the Bicentennial. There was a projection of historical images that also contained a message from the in . A giant (18 meters of height, 27 of width; weighing 200 kilograms) was raised on the square on Friday morning. Pichilemu \"Fonda Don Vicente Nario\" in Colegio Preciosa Sangre. Celebrations of the Bicentennial in Pichilemu started earlier this month. On September 2, two thousand people lined up in a formation to create the message \"Viva Chile Bicentenario Cardenal Caro\" on Pichilemu beach \"Las Terrazas\". The message was used to create a postal stamp to be released worldwide. The event was promoted by the Government of . Private schools in the city, such as , prepared events specially for their students. On Thursday, \"Fonda Don Vicente Nario\" was opened on Preciosa Sangre. Several games were performed there on that morning, including \"el emboque\", \"ponerle la cola al burro\" (to put the tail to the donkey), and others. Another event on Preciosa Sangre took place on Thursday night, when students recreated scenes of the History of Chile, including: a featuring (starred by Luis Rojas); a chingana (a popular tavern); and selected colonial professions, such as the \"motero\" (person who sold motemei and chestnuts). The official fonda of Pichilemu, La Bombonera, was inaugurated on Thursday night by Roberto C\u00f3rdova, who danced with people who attended the event. According to C\u00f3rdova, at least 30,000 people have arrived at Pichilemu as of Friday, and it is estimated that another 30,000 will arrive during the next three days. A great event took place on Pichilemu beach on Friday afternoon. Chilean typical games highlighted the event. People danced reggaeton, 's cumbias and cuecas, while others were swimming. The National Shoe Fair (Feria Nacional del Calzado) was established on on Thursday, and will stay in the town until September 23rd. Alicia Grez, who works on a kiosk in the Pichileminian Craft Fair located in front of One Discotheque, said that \"sales have been excellent,\" and that \"[they] won't miss the possibility to experience such an event like this.\" See also Sister links", "edit_actions": [{"type": "R", "before": "La Moneda Palace, in Santiago", "after": ", in", "start_char_pos": 71, "end_char_pos": 100}, {"type": "D", "before": "First Government Junta", "after": null, "start_char_pos": 270, "end_char_pos": 292}, {"type": "D", "before": "Bernardo O'Higgins", "after": null, "start_char_pos": 373, "end_char_pos": 391}, {"type": "D", "before": "Cueca", "after": null, "start_char_pos": 657, "end_char_pos": 662}, {"type": "D", "before": "Ena Von Baer", "after": null, "start_char_pos": 717, "end_char_pos": 729}, {"type": "D", "before": "Plaza de la Ciudadan\u00eda", "after": null, "start_char_pos": 773, "end_char_pos": 795}, {"type": "R", "before": "trapped miners in Copiap\u00f3", "after": "in", "start_char_pos": 941, "end_char_pos": 966}, {"type": "D", "before": "flag of Chile", "after": null, "start_char_pos": 977, "end_char_pos": 990}, {"type": "D", "before": "Cardenal Caro Province", "after": null, "start_char_pos": 1505, "end_char_pos": 1527}, {"type": "D", "before": "Colegio Preciosa Sangre", "after": null, "start_char_pos": 1567, "end_char_pos": 1590}, {"type": "R", "before": "tertulia featuring Manuel Montt", "after": "featuring", "start_char_pos": 1989, "end_char_pos": 2020}, {"type": "D", "before": "Mayor", "after": null, "start_char_pos": 2258, "end_char_pos": 2263}, {"type": "D", "before": "cueca", "after": null, "start_char_pos": 2292, "end_char_pos": 2297}, {"type": "D", "before": "Am\u00e9rico", "after": null, "start_char_pos": 2634, "end_char_pos": 2641}, {"type": "D", "before": "Agust\u00edn Ross Hotel", "after": null, "start_char_pos": 2764, "end_char_pos": 2782}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 3079, "end_char_pos": 3079}], "sents_char_pos": [0, 102, 225, 406, 480, 586, 626, 857, 1025, 1093, 1157, 1231, 1388, 1460, 1638, 1708, 1856, 2045, 2076, 2173, 2333, 2498, 2563, 2608, 2692, 2843, 3069]} {"doc_id": "207485", "revision_depth": "1", "before_revision": "150px| The King's Speech stars Colin Firth .|left The King's Speech , a historical drama film starring Colin Firth , won the 2010 Toronto International Film Festival's People's Choice Award . The film was directed by Tom Hooper , and is to be released officially on November 26, according to the Internet Movie Database . \"I am so proud that people responded to this film in a positive way,\" said Hooper, who was not in Toronto at the time of the ceremony. The film \"tells the story of the man who became King [of England] George VI ,\" sources say. \"So many people were talking about that film during the festival,\" said Piers Handling , director of the film festival. Previous winners of the award include La vita \u00e8 bella (1997), Wo hu cang long (2000) and Slumdog Millionaire (2008). ", "after_revision": "150px| stars .|left , a historical drama film starring , won the 's . The film was directed by , and is to be released officially on November 26, according to the . \"I am so proud that people responded to this film in a positive way,\" said Hooper, who was not in Toronto at the time of the ceremony. The film \"tells the story of the man who became King [of England] ,\" sources say. \"So many people were talking about that film during the festival,\" said , director of the film festival. Previous winners of the award include (1997), (2000) and (2008). Sister links", "edit_actions": [{"type": "R", "before": "The King's Speech stars Colin Firth", "after": "stars", "start_char_pos": 7, "end_char_pos": 42}, {"type": "D", "before": "The King's Speech", "after": null, "start_char_pos": 50, "end_char_pos": 67}, {"type": "D", "before": "Colin Firth", "after": null, "start_char_pos": 103, "end_char_pos": 114}, {"type": "R", "before": "2010 Toronto International Film Festival's People's Choice Award", "after": "'s", "start_char_pos": 125, "end_char_pos": 189}, {"type": "D", "before": "Tom Hooper", "after": null, "start_char_pos": 217, "end_char_pos": 227}, {"type": "D", "before": "Internet Movie Database", "after": null, "start_char_pos": 296, "end_char_pos": 319}, {"type": "D", "before": "George VI", "after": null, "start_char_pos": 523, "end_char_pos": 532}, {"type": "D", "before": "Piers Handling", "after": null, "start_char_pos": 621, "end_char_pos": 635}, {"type": "D", "before": "La vita \u00e8 bella", "after": null, "start_char_pos": 707, "end_char_pos": 722}, {"type": "D", "before": "Wo hu cang long", "after": null, "start_char_pos": 731, "end_char_pos": 746}, {"type": "D", "before": "Slumdog Millionaire", "after": null, "start_char_pos": 758, "end_char_pos": 777}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 786, "end_char_pos": 786}], "sents_char_pos": [0, 191, 456, 548, 668]} {"doc_id": "209010", "revision_depth": "1", "before_revision": "200px|Gloria Stuart in the 1934 comedy-drama film Here Comes the Navy. Gloria Stuart , US Academy Award nominated film actress, has died at the age of 100. Stuart died at her home in West Los Angeles, and her death was announced by her daughter, Sylvia Thompson. Stuart had been suffering from lung cancer for five years before her death. She appeared in films such as The Invisible Man (1933) Here Comes the Navy (1934), and Titanic (1997). Stuart started her career in the 1930s as one of Hollywood 's leading ladies. Between 1932 and 1939, Stuart appeared in 42 films. During the prime of her career, Stuart appeared with actresses such as Shirley Temple, Warner Baxter, and Dick Powell . She officially retired in 1946, after only making four films during the 1940s. Despite her retirement, Stuart appeared in James Cameron 's 1997 adaptation of Titanic , where she was cast as Old Rose, a survivor of the disaster and narrator of the film. Stuart was then nominated for an Academy Award , becoming the oldest ever person to be nominated, at the age of 87. After her appearance she found new fame, being given a star on the Hollywood Walk of Fame in 2000, and People's Magazine listed her as one of the 50 Most Beautiful People in the World.", "after_revision": "200px|Gloria Stuart in the 1934 comedy-drama film . , US Academy Award nominated film actress, has died at the age of 100. Stuart died at her home in West Los Angeles, and her death was announced by her daughter, Sylvia Thompson. Stuart had been suffering from for five years before her death. She appeared in films such as (1933) (1934), and (1997). Stuart started her career in the 1930s as one of 's leading ladies. Between 1932 and 1939, Stuart appeared in 42 films. During the prime of her career, Stuart appeared with actresses such as , , and . She officially retired in 1946, after only making four films during the 1940s. Despite her retirement, Stuart appeared in 's 1997 adaptation of , where she was cast as Old Rose, a survivor of the disaster and narrator of the film. Stuart was then nominated for an , becoming the oldest ever person to be nominated, at the age of 87. After her appearance she found new fame, being given a star on the in 2000, and listed her as one of the 50 Most Beautiful People in the World.", "edit_actions": [{"type": "R", "before": "Here Comes the Navy. Gloria Stuart", "after": ".", "start_char_pos": 50, "end_char_pos": 84}, {"type": "D", "before": "lung cancer", "after": null, "start_char_pos": 294, "end_char_pos": 305}, {"type": "D", "before": "The Invisible Man", "after": null, "start_char_pos": 369, "end_char_pos": 386}, {"type": "D", "before": "Here Comes the Navy", "after": null, "start_char_pos": 394, "end_char_pos": 413}, {"type": "D", "before": "Titanic", "after": null, "start_char_pos": 426, "end_char_pos": 433}, {"type": "D", "before": "Hollywood", "after": null, "start_char_pos": 491, "end_char_pos": 500}, {"type": "R", "before": "Shirley Temple, Warner Baxter, and Dick Powell", "after": ", , and", "start_char_pos": 643, "end_char_pos": 689}, {"type": "D", "before": "James Cameron", "after": null, "start_char_pos": 814, "end_char_pos": 827}, {"type": "D", "before": "Titanic", "after": null, "start_char_pos": 850, "end_char_pos": 857}, {"type": "D", "before": "Academy Award", "after": null, "start_char_pos": 978, "end_char_pos": 991}, {"type": "D", "before": "Hollywood Walk of Fame", "after": null, "start_char_pos": 1128, "end_char_pos": 1150}, {"type": "D", "before": "People's Magazine", "after": null, "start_char_pos": 1164, "end_char_pos": 1181}], "sents_char_pos": [0, 70, 155, 262, 338, 441, 519, 571, 691, 770, 944, 1060]} {"doc_id": "212141", "revision_depth": "1", "before_revision": "File photo of Sebastian Vettel (2010) Suzuka Circuit Red Bull drivers Sebastian Vettel and Mark Webber made a one-two finish from the front line of the starting grid of the Formula One 2010 Japanese Grand Prix at Suzuka Circuit , Japan. Lewis Hamilton crashed early in a free practice damaging his suspension, but was able to participate in a qualifying session using a spare car. Though Hamilton posted the third fastest time, he lost 5 places on the starting grid for a gearbox change. After Robert Kubica lost a rear wheel from his Renault car and retired from the race, it was Fernando Alonso who owned the third place on the podium for Ferrari , to follow his floodlit win at Singapore Jenson Button (McLaren ) passed his teammate Hamilton after the latter lost his third gear. They finished fourth and fifth. Nico Rosberg lost his rear wheel and retired just as Kubica did earlier. His teammate Michael Schumacher came sixth for Mercedes factory team. Two Saubers of Kamui Kobayashi and Nick Heidfeld, a Williams of Rubens Barrichello and a Toro Rosso of Sebastien Buemi closed the top ten drivers in the finishing lap with the leader.", "after_revision": "File photo of Sebastian Vettel (2010) Suzuka Circuit drivers and made a one-two finish from the front line of the starting grid of the at , Japan. crashed early in a free practice damaging his suspension, but was able to participate in a qualifying session using a spare car. Though Hamilton posted the third fastest time, he lost 5 places on the starting grid for a gearbox change. After lost a rear wheel from his car and retired from the race, it was who owned the third place on the podium for , to follow his floodlit win at ( ) passed his teammate Hamilton after the latter lost his third gear. They finished fourth and fifth. lost his rear wheel and retired just as Kubica did earlier. His teammate came sixth for factory team. Two of and , a of and a of closed the top ten drivers in the finishing lap with the leader.", "edit_actions": [{"type": "R", "before": "Red Bull drivers Sebastian Vettel and Mark Webber", "after": "drivers and", "start_char_pos": 53, "end_char_pos": 102}, {"type": "R", "before": "Formula One 2010 Japanese Grand Prix at Suzuka Circuit", "after": "at", "start_char_pos": 173, "end_char_pos": 227}, {"type": "D", "before": "Lewis Hamilton", "after": null, "start_char_pos": 237, "end_char_pos": 251}, {"type": "D", "before": "Robert Kubica", "after": null, "start_char_pos": 494, "end_char_pos": 507}, {"type": "D", "before": "Renault", "after": null, "start_char_pos": 535, "end_char_pos": 542}, {"type": "D", "before": "Fernando Alonso", "after": null, "start_char_pos": 581, "end_char_pos": 596}, {"type": "D", "before": "Ferrari", "after": null, "start_char_pos": 641, "end_char_pos": 648}, {"type": "D", "before": "Singapore", "after": null, "start_char_pos": 681, "end_char_pos": 690}, {"type": "R", "before": "Jenson Button (McLaren", "after": "(", "start_char_pos": 691, "end_char_pos": 713}, {"type": "D", "before": "Nico Rosberg", "after": null, "start_char_pos": 815, "end_char_pos": 827}, {"type": "D", "before": "Michael Schumacher", "after": null, "start_char_pos": 901, "end_char_pos": 919}, {"type": "D", "before": "Mercedes", "after": null, "start_char_pos": 935, "end_char_pos": 943}, {"type": "R", "before": "Saubers of Kamui Kobayashi and Nick Heidfeld, a Williams of Rubens Barrichello and a Toro Rosso of Sebastien Buemi", "after": "of and , a of and a of", "start_char_pos": 962, "end_char_pos": 1076}], "sents_char_pos": [0, 236, 380, 487, 782, 814, 887, 957]} {"doc_id": "212316", "revision_depth": "1", "before_revision": "Wikinews interviewed author Amy Scobee about her book Scientology - Abuse at the Top, and asked her about her experiences working as an executive within the organization. Scobee joined the organization at age 14, and worked at Scientology's international management headquarters for several years before leaving in 2005. She served as a Scientology executive in multiple high-ranking positions, working out of the international headquarters of Scientology known as \" Gold Base \", located in Gilman Hot Springs near Hemet, California . Scientology was founded by science fiction writer L. Ron Hubbard in 1952. Scobee joined Scientology at age 14, and after leaving in 2005 she began to speak out critically about the organization and her views on alleged abuse carried out by management leader David Miscavige against staff members. Scientology - Abuse at the Top was published in May, and Scobee has subsequently appeared in interviews about her experiences in the Scientology organization \u2013 for media including the St. Petersburg Times of Florida on June 23, and the BBC program Panorama hosted by investigative journalist John Sweeney, The Secrets of Scientology , which broadcast on BBC One on September 28. Scobee's book is structured chronologically, and she recounts her experiences first joining the Scientology organization, then becoming a staff member in its elite group the Sea Org , and finally rising to serve in multiple different high-ranking roles at the organization's international management headquarters. Periodically throughout her experiences as an executive staff member for Scientology, Scobee was sent to the organization's penal justice system the \" Rehabilitation Project Force \" (RPF), for supposed \"evil on L. Ron Hubbard\" or negative thoughts about the organization. These sentences often occurred after a division of management Scobee had served under experienced downward statistics related to profit margins and financial performance for the organization. In each instance she was sent to the RPF, Scobee was subsequently reinstated to an executive management role, and given supervisory responsibility over other senior Scientology officials. The author reveals difficult emotional experiences in her book, including an incident where she was raped at age 14 by a Scientology supervisor and subsequently instructed by a \"Scientology Ethics Officer\" that she was in a \"state of treason\" and to keep the matter quiet and not report it to the police. Scobee describes difficult experiences she endured as part of her punishment served in Scientology's RPF, including being sent to the RPF at age 16, and subsequently being slapped across the face for refusing to climb into a garbage can and clean it out. Within Scientology management and the Sea Org, Scobee rose to serve in the Watchdog Committee (WDC) \u2013 the highest ecclesiastical body in the organization. After leaving the organization, Scobee was declared a \" Suppressive Person \", and Scientology's intelligence agency the Office of Special Affairs attempted to enforce organization regulations preventing her from ever speaking to her family including her mother again. Prior to her book's publication, Scobee was threatened with legal action, in a letter from a lawyer Bertram Fields representing influential Scientology member and celebrity, actor Tom Cruise . Separately, Scientology representative Tommy Davis stated the organization was also preparing a lawsuit against her related to the publication of her book. Further news about such threatened lawsuits have not been forthcoming following these statements from Tom Cruise's lawyer and Scientology's spokesman. After Scobee began to speak out critically about Scientology to the St. Petersburg Times, the Scientology propaganda publication Freedom Magazine issued a publication in which it referred to her repeatedly as \"The Adulteress\". Though Scobee had thought that statements she made during Scientology counseling sessions called \" Auditing \" were to be kept confidential under priest-penitent religious privilege, BBC News reported that \"intimate details of her sex life\" were forwarded by Scientology, to the St. Petersburg Times. BBC News reported that during an interview for the Panorama program, Scobee was photographed by agents for Scientology along with journalist John Sweeney. These photographs were then sent by Scientology UK lawyers from the firm Carter-Ruck to the BBC, in an attempt to show \"bias\" of journalist Sweeney towards Scobee in his interviewing. Scientology - Abuse at the Top received a favorable reception from reviews and media coverage. All Headline News characterized it as a \"tell-all book\" about Scientology. Scobee's account has also received positive reception in coverage from Today Tonight, The Drew Marshall Show, Lateline, and Panorama . Why did you decide to join the elite Scientology group, the Sea Org ?AS: I thought that it sounded like an exciting adventure where I could help \"salvage the planet\" on a much larger scale than just in my home town. The \"Sea Organization\" (also Sea Org or SO for short) is defined on the official Church of Scientology web site as follows: AS: When I left in March 2005 after being a full-time, live-in staff member for a quarter century, I had a total of $150 to my name. I had no outside job skills, never cooked and I barely knew how to drive. I had no clue what I would be doing to make a living in the \"outside world\". It was not unlike being dropped on another planet and having to figure out how to survive from scratch. After I became stable and saved up some money, I began writing. As I wrote, I realized how important it was to get my story out. This \"religion\" promotes how their purpose is to create a sane world without criminality, etc. and the more I was OUT of their grip, the more I realized just how insane and criminal they really are. I learned about the Universal Declarations for Human Rights and saw how many points I personally knew were violated by the Scientology organization with their members. I learned about laws of the land (which I had been entirely ignorant of while a staff member) and realized some of the acts that I witnessed were actual violations of the LAW. But what set me on the past to exposing the abuse within Scientology the most was when my mother was forced to disconnect from me, per Scientology's \"disconnection\" policy where members are to cut all ties with anyone not in good standing with their \"church\". This was a very emotionally traumatic situation. In my view, no religion worthy of the title should have a right to stand between loved ones. Quite early on in the book's first chapter, you recount an incident of being raped at age 14, by a 35-year-old married man who was your Scientology supervisor. You describe how your \"Scientology Ethics Officer\" found out, said you were in a \"state of treason\", and that the incident was kept quiet and not reported to the police by Scientology officials. How difficult was it to include this in the book? For what reason did you choose to include this? Why didn't you tell your parents about this?AS: To me, it was very important to include this information in my book because it gives the reader an idea of how Scientology operates. One of the worst crimes you can commit as a Scientologist is bringing about \"bad public relations\" for them. Things that happen internally are KEPT internal with the \"we handle our own\" doctrine. Unfortunately, this was a CRIME for which that person could have been arrested. Instead, it was \"handled\" by the local staff (swept under the carpet) and forgotten about. I didn't tell my parents because I was ashamed and afraid. After describing your arrival at the Scientology \"Flag Land Base\" in Florida at age 16, you recall how you met and became intimate with a 26-year-old man named David Paul, who later became your husband. For this act, you were subjected to a \"security check\" process on the Scientology device, the E-meter, and ordered to serve time performing manual labor on the controversial \"Rehabilitation Project Force\" (RPF) of Scientology. Is 16 a relatively young age to be sentenced to the Rehabilitation Project Force in Scientology? Did you know other individuals on this program that were younger than you, or around the same age? AS: Yes, 16 is a young age to be sentenced to the Rehabilitation Project Force. I should have been attending school as per the agreement with my mother when she gave parental consent for me to join the Sea Organization \u2013 but I factually never saw one day of school after I joined. There were other teen-agers on the RPF at the same time, but I believe I was the youngest. Scientologists working in the organization's \"Rehabilitation Project Force\" in Los Angeles, California During participation in the Rehabilitation Project Force, you recount how you were slapped across the face for refusing to climb into a garbage can after being ordered to do so by a leader of your group. How did this make you feel? Did you consider leaving the organization at all at this point in time? Why or why not, and why did you remain?AS: It was a completely nutty order and I wasn't about to comply. I ran around the block to get away as the lady who issued the order chased after me. I went to the person in charge asking for help but he was not in his office. The lady chased me into that office and then hit me across the face. I did NOT hit her back because I wanted to show that she was the crazy one. However when the Ethics Officer got there, he said I should have complied as she was my superior. I felt like it was a huge injustice because the order made no sense and had no purpose. She was just trying to exert her \"authority\" over me. But, I didn't want to be in more trouble, so I did my punishment for non-compliance and carried on. No, I did not think of leaving then. At that point, I just thought that lady was insane, not the entire organization. After completing your time on the Rehabilitation Project Force, you were appointed to the position of \"Commanding Officer of the Flag Land Base's Communicator\", where you were \"responsible for all in-coming and out-going traffic from the executive and obtaining compliance to all orders issued\". Did it surprise you that directly after finishing the Rehabilitation Project Force, you were given such a position of responsibility as a Scientology executive? Does this occur often in Scientology to members after they finish their sentence in the Rehabilitation Project Force? AS: In the Sea Organization, one is expected to be able to perform any duty \u2013 with or without training. It's preached that the salvation of the world is on our shoulders and everyone needs to pull up their bootstraps and make it go right. So, the appointment did not surprise me. Shortly after your promotion from Rehabilitation Project Force member to this position, you were promoted to \"Flag Land Bureau Estates Management Chief\", where you were \"responsible for all public hotels and services\", and subsequently promoted to the \"Commodore's Messenger Organization (CMO)\". At the end of chapter 3, you write how you were \"placed under a group justice action, called a Committee of Evidence\", and the committee, \"recommended my removal for neglect of duty regarding the schedule\". However, a few days later you were told you were assigned to Los Angeles, California, in order to recruit for members to join the CMO. Again, this appears to be a pattern of conflicting orders within the organization, where in one instance you were disciplined for perceived slights, and yet directly afterward, promoted to a higher position of authority as a Scientology executive. How do you explain this behavior within the organization?AS: The control and handling of personnel within the Sea Org was very unpredictable. There were always huge demands and needs for people on various projects or positions that had to be filled \"at once\". So one could expect rapid changes. It was also considered that after one messes up, they can be corrected using the \"ethics technology\" of Scientology and confessionals so they can carry on after their level of ethics are once again acceptable. What was the highest-ranking position you held within Scientology? Who did you report to in this position? What responsibilities did you have, and how many other people and sub-entities did you oversee? AS: I was in the Watchdog Committee (WDC) which is the highest ecclesiastical body in Scientology, with a WDC member appointed over each of the numerous \"sectors\" or areas of Scientology to see to their proper management. My boss as a WDC member is the WDC Chairman. This is the highest management position in the organization. I was in WDC for about a decade and held about six different sectors over the years, including the Association for Better Living and Education (ABLE) sector, which is responsible for the secular aspects of the organization \u2013 drug rehabilitation, criminal reform, Applied Scholastics study technology and The Way To Happiness Foundation \u2013 and the Celebrity Center sector. Anything that goes on inside your sector or sphere of responsibility as a WDC member, is your responsibility and you're held accountable. This could be very stressful, particularly when the current head of Scientology \u2013 David Miscavige \u2013 is so abusive. For example, Miscavige learned that the Tampa Scientology organization was not paying their rent in 2003. As I had previously been the WDC member for all Scientology churches (approx 175 of them around the world) and should have noticed and handled it then, Miscavige demanded that I personally pay the rent of $ 5,000 (which I did not have). This order was enforced by his personal staff \u2013 I had to borrow the money from several other staff members and turn it into the Finance Office, who then wrote a check to the Tampa organization to pay their back rent as a \"gift\" to them from management. In chapter 4 of Scientology - Abuse at the Top, you cite the book Combating Cult Mind Control by cult researcher Steven Hassan , who explains that, \"Members are made to feel part of an elite corps of mankind.\" At what point in time did you read this book? Are there other books which helped you understand and put your experiences within Scientology into a greater context?AS: I read several quotes from Steven Hassan from the internet that made total sense to me, so I ordered his book. It's a fantastic read. I learned quite a lot about mind control and particularly found it interesting and true that a key aspect of mind control is INFORMATION CONTROL. If one can control the information that you are allowed to receive, then you can really control their thinking. They wouldn't be equipped with all of the ACTUAL information to be able to analyze and made a sane decision about something. In Scientology and especially in the Sea Organization, information is controlled intensively. This includes ALL communication via telephone or mail \u2013 incoming and outgoing \u2013 being screened through security personnel in order to detect any antagonism regarding Scientology from the \"outside\", no televisions allowed, no internet access, not being permitted to listen to or read any article that said anything negative about Scientology. Another book I found to be very beneficial after leaving Scientology was Man's Search for Meaning by Viktor Frankl . It answered a lot for me. You described in chapter 6, being assigned to a sub-division of the Rehabilitation Project Force, called the \"RPF's RPF\". How was this different from the main RPF itself? What typical tasks were you ordered to perform? Were there many other women assigned to this unit? Were women given different roles or treated differently than men while on the RPF or the RPF's RPF? After being appointed in October 1991 as the \"Watchdog Committee member over the Celebrity Centre sector\", you recall meeting several members of \"the top Scientology celebrity public\", including John Travolta, Kelly Preston, Kirstie Alley, Anne Archer, Nancy Cartwright, Billy Sheehan, Priscilla Presley, Lisa Marie Presley, Juliette Lewis , Isaac Hayes, Tom Cruise, Edgar Winter, and Jenna Elfman . In what capacity did you meet these Scientology celebrities? Were they coming in for Scientology auditing, or counseling? Did they receive advice and assistance in some form with their professional careers?AS: While I was working on the project to build Celebrity Centre International in Hollywood, I was often in the President's office of the Celebrity Center where the top celebrities often would come. That's how I met most of them. They would come into Celebrity Center to attend a course, to go in for a counseling session or to bring someone new in to introduce them to Scientology. Celebrity Centre International has a \"career counseling\" service it does provide and some celebrities have done this service to hopefully help them to do better in their careers. You write that you are aware of situations where members of Scientology hired by celebrities as assistants or security staff, have actually reported back to the organization through a Scientology process called \"Security Checks\", with revealing information about those celebrities. Did any of these celebrities ever find out such a tactic was being used to uncover information about them? If so, what was their response to this? I was awarded PERMANENT POSTING STATUS on two executive positions in Church of Scientology International (CSI \u2013 the highest management organization for Scientology). This is a status that can only be verified and authorized by the Religious Technology Center (RTC \u2013 the holder of the Scientology trademarks and service marks). I received my Permanent Posting certificate by RTC as the Watchdog Committee member for Celebrity Centres (WDC CC), which I held as a single duty for four years, and as a function with other Scientology sectors for nearly a decade. Amongst the extensive list of requirements one must meet to become Permanently Posted, ones ethics and production record must be verified as excellent and you must be capable of generating on the order of a million dollars a year for the organization. In 1996, you were transferred to the executive post of Watchdog Committee member for the Association for Better Living and Education (WDC ABLE). ABLE is an organization operated by Scientology management which oversees groups that promote Scientology techniques. In this executive position, you were responsible for supervising Scientology-associated entities including: Applied Scholastics, Narconon, Criminon, and The Way to Happiness Foundation . Can you explain a little bit about the function and purpose of each of these groups? Are they actual-practice, separate \"secular\" functioning organizations, or somehow related to the Scientology organization itself? How specifically were these groups influenced and/or managed by Scientology leadership? How involved was David Miscavige in the functioning of these groups? After being told by David Miscavige that your husband at the time, Jim Mortland, was being removed or \"offloaded\" from Scientology's Sea Organization, you were called into the office of the Internal Executive where you were pressured into making a decision to stay in the Sea Org and separate from your husband. You write in the book, that your \"brainwashed response\" was to answer, \"I'm staying\". Why did you characterize this as a brainwashed response. How and why did you come to believe you had been a victim of brainwashing ?AS: Per this Wikipedia definition, \"Mind control (also known as brainwashing, coercive persuasion, mind abuse, thought control, or thought reform) refers to a process in which a group or individual 'systematically uses unethically manipulative methods to persuade others to conform to the wishes of the manipulator(s), often to the detriment of the person being manipulated'.\" In my right mind, I would not have walked away from my husband of 17 years. In my right mind, I would not have \"turned a blind eye\" when I witnessed a dozen accounts of assault & battery being committed on my comrades by David Miscavige. And I would never have given in to the physical labor and other \"ethics\" actions taken on myself and others for trumped up offenses. But I now understand that I was under the influence of mind control. This is not a light matter. People can laugh that concept off so readily, but it's a very REAL thing. When one considers what is at stake (or is thought to be at stake) if one were to step out of line or violate the rules in any way, you try to remain quiet and compliant. In Scientology, if you get yourself in enough trouble (from some executive's point of view), you can be banned from ever being allowed to receive the upper level services in Scientology \u2013 and thus enslave yourself as a spiritual being for eternity. Another more minor factor, but still major enough to keep you in line is the threat that any of your family or friends in Scientology would have to disconnect from you if you were no longer in good standing. So to say you want to leave, to go against the head of the organization, to report to outside authorities what's going on inside is considered more of a crime than being quiet and compliant as a \"good Scientologist\". This is what I consider has people brainwashed. It's a way to control their rational thinking. It's \"the end justifies the means\". When I realized that I had been rationalizing away utter insanities that I both witnessed and experienced in the organization and that I needed to simply look at what was factually in front of me, I started making my plans to leave. The details of this revelation and how I finally got out is all detailed in my book. In chapter 10, \"Assault and Battery\", you recount witnessing instances of violence by David Miscavige towards Scientology officials including: Ray Mithoff, Mike Rinder , and Jeff Hawkins. You write, \"I am ashamed that I did not have enough courage at the time to inform the authorities or call the police, which would have been the logical thing to do.\" Why do you think you decided not to report these instances to the police? What do you think law enforcement would have done if you had reported the matter to police? Knowing what you know now, and revisiting your memories of these incidents in hindsight, would you have acted differently if you were in the same situation again? The last chapter of your book describes your emotional reunion with your family after leaving Scientology - first meeting your father and then calling and meeting your mother - and finally reuniting with Mark \"Mat\" Pesch, now your husband. At any point in time did you feel unsafe during your journey to reunite with these people? Did Scientology's intelligence agency, the Office of Special Affairs (OSA), monitor you or your family after you left the organization?AS: As I was getting on the airplane home, the OSA staff member who escorted me to the airport said that I could not talk to my mother due to the \"suppressive person\" declare issue that she handed me a few hours before. Of course, after I arrived to my father's house, I realized that I was no longer under Scientology's control and I could contact my mother if I wanted \u2013 and I desperately wanted to! I hadn't seen her in years and now I was home for good! Scientology did find out about us seeing each other and took various actions to put pressure on my step-father to enforce their disconnection policy. This was very messy and is one of the key reasons I chose to speak out publicly against Scientology's human rights violations. At one point, my husband and I were followed by Private Investigators anywhere we went. We had to file a police report because one in particular was being very reckless in his attempts to stay on our tail \u2013 and flee when we tried to confront him. I finally filed a declaration against Scientology, showing several instances of harassment to myself and my family, which I considered witness tampering since I was named as a witness on an on-going lawsuit against them. Were you concerned that your relationships might be affected due to Scientology declaring you a \" Suppressive Person \", and telling members of the organization never to speak to you again? Has this stopped you, or are you in communication with current and/or former members of the organization? One month before your book was published, All Headline News reported that you received a legal threat from Tom Cruise's lawyer, Bertram Fields , that warned you would face a defamation lawsuit from Cruise if the book was made publicly available. Specific complaints made included your accounts of hearing about a \"drug history\" involving Cruise, an ultimatum made by the Scientology organization to Cruise to decide between Nicole Kidman or the organization, and that Cruise's personal assistants and employees that staff his home are chosen and paid for by the Scientology organization. Can you speak to how you came to have knowledge about these assertions you made, why you believe them to be true and factually accurate, and how you felt when you received the legal threat letter from Cruise's attorney? Prior to publication of Scientology - Abuse at the Top by Amy Scobee, the author was threatened with separate legal actions \u2013 by lawyer Bertram Fields representing influential Scientology member and celebrity, actor Tom Cruise ; and Scientology representative Tommy Davis on behalf of Scientology management. AS: Bertram Fields made a mistake by issuing that legal threat when he hadn't even read my book to know what I actually said about his client. He made assumptions based on hearsay. When I received the letter, I thought that it was just like Scientology \u2013 issue threats to intimidate and back someone off. I wasn't going to back off because what I wrote in my book was true. I am the one who did the project to hire Scientologists for Tom's household. I am the one Shelly Miscavige told what disqualifying drugs Tom took so he could not qualify for the Sea Organization \u2013 which he supposedly wanted to join. I didn't say anything in my book about Cruise having to decide between Nicole or the organization. So, I knew that it was an attempt to prevent me from putting out my book as \"little 'ol me\" could never possibly stand up to the high-powered lawyer of an A-list celebrity who has millions of dollars at his disposal. But the fact is \u2013 it didn't phase me as truth is truth and I'm willing to stand up for the truth. The book was subsequently published and made publicly available. At this point in time, has there been any follow-up from Tom Cruise, his lawyer, or representatives, to you? How do you feel about your legal standing if Cruise were to escalate the matter beyond the initial legal threat letter? The month your book was published, the New York Daily News reported that Scientology organization public representative Tommy Davis characterized your accounts as \"fiction\". With regards to assertions you made that David Miscavige and Scientology officials \"snooped\" in the confessional folders of Scientology members and particularly celebrities, Davis stated, \"Nobody in the church has ever violated the priest-penitent privilege. ... [Confessional files] are held in the strictest confidence.\" How do you respond to these statements by Davis?AS: Just like I did to the New York Daily News when they asked me about it: If Scientology does not violate the priest-penitent privilege, what is the Scientology spokesperson doing talking to the press about my sex life? Davis further stated to the New York Daily News that (separate from the earlier intimations from the lawyer for Tom Cruise) the Scientology organization was itself \"preparing a lawsuit\" against you because of the \"disgusting allegations\" in the book. Have you received any notice from the Scientology organization with regards such a potential lawsuit? Davis proceeded to make claims to the New York Daily News about your sexual relationships. Additionally, BBC News reported that after you began to make public criticism of the organization and its leader David Miscavige, Scientology provided \"intimate details of her sex life\" to the Florida newspaper the St. Petersburg Times. How did you feel when these sexual details were made public by Scientology? How do you feel this behavior by the organization and its officials reflects on its assertions of keeping confidential information secret, and respecting the privacy of priest-penitent privilege?AS: To me \u2013 and MANY other people \u2013 it was obvious through their child-like reaction that they have something fairly big to hide. I gave a detailed eye-witness account of the head of the Scientology religion repeatedly beating staff members. That they respond with exaggerated accusations about my sex life is just a red herring. And it also proves that private information you may divulge in confessionals while a member of Scientology could be used against you should you step out of line in the future. In an August 2009 issue of the Scientology publication, Freedom Magazine , the issue referred to you multiple times only as \"The Adulteress\". How did this make you feel when you found out about this publication? When you were still a member of the Scientology organization, what was your opinion at that point in time of Freedom Magazine? What is your opinion of the publication - its reputability and reliability, at this point in time? In the August 2009 publication of \"Freedom\", they slandered both the St. Petersburg Times reporters and the \"defectors\" (myself, Marty Rathbun , Mike Rinder and Tom DeVocht). Note: they did not use the name \"Amy Scobee\" in this magazine. Instead, they refer to me as \"the Adulteress\". This slanderous character assassination appears in more than 20 places in their publication. It's painfully obvious that they were referring to me since I was the only female that spoke out in the article they were protesting. I'm not \"an adulteress\". As a member of Scientology's Sea Organization (age 16 to 42), I had sexual intercourse with my first husband, my second husband and my current husband. Regardless, my \"sexual purity\" has nothing to do with my reporting the fact that I witnessed the head of the Church of Scientology commit repeated assault & battery on specific church executives while I was employed there. It's just their attempt to \"annihilate credibility\" for exposing this crime. In my view, the Freedom magazine is used to help carry out Miscavige's private agenda to try to remain in a position of power in that organization. Amy Scobee in 2009 BBC News reported on September 26, that during an interview for the Panorama special, The Secrets of Scientology , yourself and reporter John Sweeney were photographed, and such photographs of the two of you hugging after completing the interview were sent by Scientology UK lawyers from the firm Carter-Ruck to the BBC. What do you think Scientology was attempting to accomplish by sending these photos to the BBC? Is such behavior by the Scientology organization with regard to monitoring of journalists, critics, or former members such as yourself common? What do you do to cope and/or respond to such behavior from the Scientology organization?AS: Yes, this type of intimidation is common practice by Scientology. As a witness in an on-going court case against Scientology, I was recently in a deposition with Scientology's lead counsel. He pulled out the photo that their private investigators took of John Sweeney giving me a hug on the highway outside of the Scientology compound in Hemet after nearly two full days of interviews. He proceeded to ask me how much \"alone time\" I spent with Mr. Sweeney (which was none) and when I explained that we all gave each other hugs goodbye before we went our separate ways and that my husband was right there with me, the lawyer said, \"We'll see what the jury says about that!\" All they are trying to do is intimidate us into silence through constant trails by PI's, slandering our names with ridiculous accusations, etc., so we'd become cowed, be quiet and let their criminality go on, unchecked. Well, it hasn't worked to keep me silent. To me, it's more important to prevent anyone else from being hurt by making Scientology's human rights violations known than to worry about them tarnishing my personal reputation in retaliation. I believe that the truth must be brought to light, despite consequences. Are there any other points that you would like to elaborate or explain? Related news ", "after_revision": "Wikinews interviewed author about her book Scientology - Abuse at the Top, and asked her about her experiences working as an executive within the organization. Scobee joined the organization at age 14, and worked at Scientology's international management headquarters for several years before leaving in 2005. She served as a Scientology executive in multiple high-ranking positions, working out of the international headquarters of Scientology known as \" \", located in Gilman Hot Springs near , . Scientology was founded by writer in 1952. Scobee joined Scientology at age 14, and after leaving in 2005 she began to speak out critically about the organization and her views on alleged abuse carried out by management leader against staff members. Scientology - Abuse at the Top was published in May, and Scobee has subsequently appeared in interviews about her experiences in the Scientology organization \u2013 for media including the of Florida on June 23, and the program hosted by , , which broadcast on on September 28. Scobee's book is structured chronologically, and she recounts her experiences first joining the Scientology organization, then becoming a staff member in its elite group the , and finally rising to serve in multiple different high-ranking roles at the organization's international management headquarters. Periodically throughout her experiences as an executive staff member for Scientology, Scobee was sent to the organization's penal justice system the \" \" (RPF), for supposed \"evil on L. Ron Hubbard\" or negative thoughts about the organization. These sentences often occurred after a division of management Scobee had served under experienced downward statistics related to profit margins and financial performance for the organization. In each instance she was sent to the RPF, Scobee was subsequently reinstated to an executive management role, and given supervisory responsibility over other senior Scientology officials. The author reveals difficult emotional experiences in her book, including an incident where she was at age 14 by a Scientology supervisor and subsequently instructed by a \"Scientology Ethics Officer\" that she was in a \"state of treason\" and to keep the matter quiet and not report it to the police. Scobee describes difficult experiences she endured as part of her punishment served in Scientology's RPF, including being sent to the RPF at age 16, and subsequently being slapped across the face for refusing to climb into a garbage can and clean it out. Within Scientology management and the Sea Org, Scobee rose to serve in the Watchdog Committee (WDC) \u2013 the highest ecclesiastical body in the organization. After leaving the organization, Scobee was declared a \" \", and Scientology's the attempted to enforce organization regulations preventing her from ever speaking to her family including her mother again. Prior to her book's publication, Scobee was threatened with legal action, in a letter from a lawyer representing influential Scientology member and celebrity, actor . Separately, Scientology representative stated the organization was also preparing a lawsuit against her related to the publication of her book. Further news about such threatened lawsuits have not been forthcoming following these statements from Tom Cruise's lawyer and Scientology's spokesman. After Scobee began to speak out critically about Scientology to the St. Petersburg Times, the Scientology publication issued a publication in which it referred to her repeatedly as \"The Adulteress\". Though Scobee had thought that statements she made during Scientology counseling sessions called \" \" were to be kept confidential under priest-penitent religious privilege, reported that \"intimate details of her sex life\" were forwarded by Scientology, to the St. Petersburg Times. BBC News reported that during an interview for the Panorama program, Scobee was photographed by agents for Scientology along with journalist John Sweeney. These photographs were then sent by Scientology UK lawyers from the firm Carter-Ruck to the BBC, in an attempt to show \"bias\" of journalist Sweeney towards Scobee in his interviewing. Scientology - Abuse at the Top received a favorable reception from reviews and media coverage. characterized it as a \"tell-all book\" about Scientology. Scobee's account has also received positive reception in coverage from , , , and . Why did you decide to join the elite Scientology group, the ?AS: I thought that it sounded like an exciting adventure where I could help \"salvage the planet\" on a much larger scale than just in my home town. The \"Sea Organization\" (also Sea Org or SO for short) is defined on the official Church of Scientology web site as follows: AS: When I left in March 2005 after being a full-time, live-in staff member for a quarter century, I had a total of $150 to my name. I had no outside job skills, never cooked and I barely knew how to drive. I had no clue what I would be doing to make a living in the \"outside world\". It was not unlike being dropped on another planet and having to figure out how to survive from scratch. After I became stable and saved up some money, I began writing. As I wrote, I realized how important it was to get my story out. This \"religion\" promotes how their purpose is to create a sane world without criminality, etc. and the more I was OUT of their grip, the more I realized just how insane and criminal they really are. I learned about the Universal Declarations for Human Rights and saw how many points I personally knew were violated by the Scientology organization with their members. I learned about laws of the land (which I had been entirely ignorant of while a staff member) and realized some of the acts that I witnessed were actual violations of the LAW. But what set me on the past to exposing the abuse within Scientology the most was when my mother was forced to disconnect from me, per Scientology's \"disconnection\" policy where members are to cut all ties with anyone not in good standing with their \"church\". This was a very emotionally traumatic situation. In my view, no religion worthy of the title should have a right to stand between loved ones. Quite early on in the book's first chapter, you recount an incident of being at age 14, by a 35-year-old married man who was your Scientology supervisor. You describe how your \"Scientology Ethics Officer\" found out, said you were in a \"state of treason\", and that the incident was kept quiet and not reported to the police by Scientology officials. How difficult was it to include this in the book? For what reason did you choose to include this? Why didn't you tell your parents about this?AS: To me, it was very important to include this information in my book because it gives the reader an idea of how Scientology operates. One of the worst crimes you can commit as a Scientologist is bringing about \"bad public relations\" for them. Things that happen internally are KEPT internal with the \"we handle our own\" doctrine. Unfortunately, this was a CRIME for which that person could have been arrested. Instead, it was \"handled\" by the local staff (swept under the carpet) and forgotten about. I didn't tell my parents because I was ashamed and afraid. After describing your arrival at the Scientology \"Flag Land Base\" in Florida at age 16, you recall how you met and became intimate with a 26-year-old man named David Paul, who later became your husband. For this act, you were subjected to a \"security check\" process on the Scientology device, the , and ordered to serve time performing manual labor on the controversial \"\" (RPF) of Scientology. Is 16 a relatively young age to be sentenced to the Rehabilitation Project Force in Scientology? Did you know other individuals on this program that were younger than you, or around the same age? AS: Yes, 16 is a young age to be sentenced to the Rehabilitation Project Force. I should have been attending school as per the agreement with my mother when she gave parental consent for me to join the Sea Organization \u2013 but I factually never saw one day of school after I joined. There were other teen-agers on the RPF at the same time, but I believe I was the youngest. Scientologists working in the organization's \"\" in , California During participation in the Rehabilitation Project Force, you recount how you were slapped across the face for refusing to climb into a garbage can after being ordered to do so by a leader of your group. How did this make you feel? Did you consider leaving the organization at all at this point in time? Why or why not, and why did you remain?AS: It was a completely nutty order and I wasn't about to comply. I ran around the block to get away as the lady who issued the order chased after me. I went to the person in charge asking for help but he was not in his office. The lady chased me into that office and then hit me across the face. I did NOT hit her back because I wanted to show that she was the crazy one. However when the Ethics Officer got there, he said I should have complied as she was my superior. I felt like it was a huge injustice because the order made no sense and had no purpose. She was just trying to exert her \"authority\" over me. But, I didn't want to be in more trouble, so I did my punishment for non-compliance and carried on. No, I did not think of leaving then. At that point, I just thought that lady was insane, not the entire organization. After completing your time on the Rehabilitation Project Force, you were appointed to the position of \"Commanding Officer of the Flag Land Base's Communicator\", where you were \"responsible for all in-coming and out-going traffic from the executive and obtaining compliance to all orders issued\". Did it surprise you that directly after finishing the Rehabilitation Project Force, you were given such a position of responsibility as a Scientology executive? Does this occur often in Scientology to members after they finish their sentence in the Rehabilitation Project Force? AS: In the Sea Organization, one is expected to be able to perform any duty \u2013 with or without training. It's preached that the salvation of the world is on our shoulders and everyone needs to pull up their bootstraps and make it go right. So, the appointment did not surprise me. Shortly after your promotion from Rehabilitation Project Force member to this position, you were promoted to \"Flag Land Bureau Estates Management Chief\", where you were \"responsible for all public hotels and services\", and subsequently promoted to the \" (CMO)\". At the end of chapter 3, you write how you were \"placed under a group justice action, called a Committee of Evidence\", and the committee, \"recommended my removal for neglect of duty regarding the schedule\". However, a few days later you were told you were assigned to Los Angeles, California, in order to recruit for members to join the CMO. Again, this appears to be a pattern of conflicting orders within the organization, where in one instance you were disciplined for perceived slights, and yet directly afterward, promoted to a higher position of authority as a Scientology executive. How do you explain this behavior within the organization?AS: The control and handling of personnel within the Sea Org was very unpredictable. There were always huge demands and needs for people on various projects or positions that had to be filled \"at once\". So one could expect rapid changes. It was also considered that after one messes up, they can be corrected using the \"ethics technology\" of Scientology and confessionals so they can carry on after their level of ethics are once again acceptable. What was the highest-ranking position you held within Scientology? Who did you report to in this position? What responsibilities did you have, and how many other people and sub-entities did you oversee? AS: I was in the Watchdog Committee (WDC) which is the highest ecclesiastical body in Scientology, with a WDC member appointed over each of the numerous \"sectors\" or areas of Scientology to see to their proper management. My boss as a WDC member is the WDC Chairman. This is the highest management position in the organization. I was in WDC for about a decade and held about six different sectors over the years, including the Association for Better Living and Education (ABLE) sector, which is responsible for the secular aspects of the organization \u2013 drug rehabilitation, criminal reform, Applied Scholastics study technology and The Way To Happiness Foundation \u2013 and the Celebrity Center sector. Anything that goes on inside your sector or sphere of responsibility as a WDC member, is your responsibility and you're held accountable. This could be very stressful, particularly when the current head of Scientology \u2013 David Miscavige \u2013 is so abusive. For example, Miscavige learned that the Tampa Scientology organization was not paying their rent in 2003. As I had previously been the WDC member for all Scientology churches (approx 175 of them around the world) and should have noticed and handled it then, Miscavige demanded that I personally pay the rent of $ 5,000 (which I did not have). This order was enforced by his personal staff \u2013 I had to borrow the money from several other staff members and turn it into the Finance Office, who then wrote a check to the Tampa organization to pay their back rent as a \"gift\" to them from management. In chapter 4 of Scientology - Abuse at the Top, you cite the book by researcher , who explains that, \"Members are made to feel part of an elite corps of mankind.\" At what point in time did you read this book? Are there other books which helped you understand and put your experiences within Scientology into a greater context?AS: I read several quotes from Steven Hassan from the internet that made total sense to me, so I ordered his book. It's a fantastic read. I learned quite a lot about mind control and particularly found it interesting and true that a key aspect of mind control is INFORMATION CONTROL. If one can control the information that you are allowed to receive, then you can really control their thinking. They wouldn't be equipped with all of the ACTUAL information to be able to analyze and made a sane decision about something. In Scientology and especially in the Sea Organization, information is controlled intensively. This includes ALL communication via telephone or mail \u2013 incoming and outgoing \u2013 being screened through security personnel in order to detect any antagonism regarding Scientology from the \"outside\", no televisions allowed, no internet access, not being permitted to listen to or read any article that said anything negative about Scientology. Another book I found to be very beneficial after leaving Scientology was by . It answered a lot for me. You described in chapter 6, being assigned to a sub-division of the Rehabilitation Project Force, called the \"RPF's RPF\". How was this different from the main RPF itself? What typical tasks were you ordered to perform? Were there many other women assigned to this unit? Were women given different roles or treated differently than men while on the RPF or the RPF's RPF? After being appointed in October 1991 as the \"Watchdog Committee member over the Celebrity Centre sector\", you recall meeting several members of \"the top Scientology celebrity public\", including John Travolta, , , , , , , , , Isaac Hayes, Tom Cruise, , and . In what capacity did you meet these Scientology celebrities? Were they coming in for Scientology auditing, or counseling? Did they receive advice and assistance in some form with their professional careers?AS: While I was working on the project to build Celebrity Centre International in Hollywood, I was often in the President's office of the Celebrity Center where the top celebrities often would come. That's how I met most of them. They would come into Celebrity Center to attend a course, to go in for a counseling session or to bring someone new in to introduce them to Scientology. Celebrity Centre International has a \"career counseling\" service it does provide and some celebrities have done this service to hopefully help them to do better in their careers. You write that you are aware of situations where members of Scientology hired by celebrities as assistants or security staff, have actually reported back to the organization through a Scientology process called \"Security Checks\", with revealing information about those celebrities. Did any of these celebrities ever find out such a tactic was being used to uncover information about them? If so, what was their response to this? I was awarded PERMANENT POSTING STATUS on two executive positions in Church of Scientology International (CSI \u2013 the highest management organization for Scientology). This is a status that can only be verified and authorized by the Religious Technology Center (RTC \u2013 the holder of the Scientology trademarks and service marks). I received my Permanent Posting certificate by RTC as the Watchdog Committee member for Celebrity Centres (WDC CC), which I held as a single duty for four years, and as a function with other Scientology sectors for nearly a decade. Amongst the extensive list of requirements one must meet to become Permanently Posted, ones ethics and production record must be verified as excellent and you must be capable of generating on the order of a million dollars a year for the organization. In 1996, you were transferred to the executive post of Watchdog Committee member for the (WDC ABLE). ABLE is an organization operated by Scientology management which oversees groups that promote Scientology techniques. In this executive position, you were responsible for supervising Scientology-associated entities including: , , , and . Can you explain a little bit about the function and purpose of each of these groups? Are they actual-practice, separate \"secular\" functioning organizations, or somehow related to the Scientology organization itself? How specifically were these groups influenced and/or managed by Scientology leadership? How involved was in the functioning of these groups? After being told by David Miscavige that your husband at the time, Jim Mortland, was being removed or \"offloaded\" from Scientology's Sea Organization, you were called into the office of the Internal Executive where you were pressured into making a decision to stay in the Sea Org and separate from your husband. You write in the book, that your \"brainwashed response\" was to answer, \"I'm staying\". Why did you characterize this as a brainwashed response. How and why did you come to believe you had been a victim of ?AS: Per this Wikipedia definition, \"Mind control (also known as brainwashing, coercive persuasion, mind abuse, thought control, or thought reform) refers to a process in which a group or individual 'systematically uses unethically manipulative methods to persuade others to conform to the wishes of the manipulator(s), often to the detriment of the person being manipulated'.\" In my right mind, I would not have walked away from my husband of 17 years. In my right mind, I would not have \"turned a blind eye\" when I witnessed a dozen accounts of assault & battery being committed on my comrades by David Miscavige. And I would never have given in to the physical labor and other \"ethics\" actions taken on myself and others for trumped up offenses. But I now understand that I was under the influence of mind control. This is not a light matter. People can laugh that concept off so readily, but it's a very REAL thing. When one considers what is at stake (or is thought to be at stake) if one were to step out of line or violate the rules in any way, you try to remain quiet and compliant. In Scientology, if you get yourself in enough trouble (from some executive's point of view), you can be banned from ever being allowed to receive the upper level services in Scientology \u2013 and thus enslave yourself as a spiritual being for eternity. Another more minor factor, but still major enough to keep you in line is the threat that any of your family or friends in Scientology would have to disconnect from you if you were no longer in good standing. So to say you want to leave, to go against the head of the organization, to report to outside authorities what's going on inside is considered more of a crime than being quiet and compliant as a \"good Scientologist\". This is what I consider has people brainwashed. It's a way to control their rational thinking. It's \"the end justifies the means\". When I realized that I had been rationalizing away utter insanities that I both witnessed and experienced in the organization and that I needed to simply look at what was factually in front of me, I started making my plans to leave. The details of this revelation and how I finally got out is all detailed in my book. In chapter 10, \"Assault and Battery\", you recount witnessing instances of violence by David Miscavige towards Scientology officials including: Ray Mithoff, , and Jeff Hawkins. You write, \"I am ashamed that I did not have enough courage at the time to inform the authorities or call the police, which would have been the logical thing to do.\" Why do you think you decided not to report these instances to the police? What do you think law enforcement would have done if you had reported the matter to police? Knowing what you know now, and revisiting your memories of these incidents in hindsight, would you have acted differently if you were in the same situation again? The last chapter of your book describes your emotional reunion with your family after leaving Scientology - first meeting your father and then calling and meeting your mother - and finally reuniting with Mark \"Mat\" Pesch, now your husband. At any point in time did you feel unsafe during your journey to reunite with these people? Did Scientology's intelligence agency, the (OSA), monitor you or your family after you left the organization?AS: As I was getting on the airplane home, the OSA staff member who escorted me to the airport said that I could not talk to my mother due to the \"suppressive person\" declare issue that she handed me a few hours before. Of course, after I arrived to my father's house, I realized that I was no longer under Scientology's control and I could contact my mother if I wanted \u2013 and I desperately wanted to! I hadn't seen her in years and now I was home for good! Scientology did find out about us seeing each other and took various actions to put pressure on my step-father to enforce their disconnection policy. This was very messy and is one of the key reasons I chose to speak out publicly against Scientology's human rights violations. At one point, my husband and I were followed by Private Investigators anywhere we went. We had to file a police report because one in particular was being very reckless in his attempts to stay on our tail \u2013 and flee when we tried to confront him. I finally filed a declaration against Scientology, showing several instances of harassment to myself and my family, which I considered witness tampering since I was named as a witness on an on-going lawsuit against them. Were you concerned that your relationships might be affected due to Scientology declaring you a \" \", and telling members of the organization never to speak to you again? Has this stopped you, or are you in communication with current and/or former members of the organization? One month before your book was published, reported that you received a legal threat from Tom Cruise's lawyer, , that warned you would face a defamation lawsuit from Cruise if the book was made publicly available. Specific complaints made included your accounts of hearing about a \"drug history\" involving Cruise, an ultimatum made by the Scientology organization to Cruise to decide between or the organization, and that Cruise's personal assistants and employees that staff his home are chosen and paid for by the Scientology organization. Can you speak to how you came to have knowledge about these assertions you made, why you believe them to be true and factually accurate, and how you felt when you received the legal threat letter from Cruise's attorney? Prior to publication of Scientology - Abuse at the Top by Amy Scobee, the author was threatened with separate legal actions \u2013 by lawyer representing influential Scientology member and celebrity, actor ; and Scientology representative on behalf of Scientology management. AS: Bertram Fields made a mistake by issuing that legal threat when he hadn't even read my book to know what I actually said about his client. He made assumptions based on hearsay. When I received the letter, I thought that it was just like Scientology \u2013 issue threats to intimidate and back someone off. I wasn't going to back off because what I wrote in my book was true. I am the one who did the project to hire Scientologists for Tom's household. I am the one Shelly Miscavige told what disqualifying drugs Tom took so he could not qualify for the Sea Organization \u2013 which he supposedly wanted to join. I didn't say anything in my book about Cruise having to decide between Nicole or the organization. So, I knew that it was an attempt to prevent me from putting out my book as \"little 'ol me\" could never possibly stand up to the high-powered lawyer of an A-list celebrity who has millions of dollars at his disposal. But the fact is \u2013 it didn't phase me as truth is truth and I'm willing to stand up for the truth. The book was subsequently published and made publicly available. At this point in time, has there been any follow-up from Tom Cruise, his lawyer, or representatives, to you? How do you feel about your legal standing if Cruise were to escalate the matter beyond the initial legal threat letter? The month your book was published, the reported that Scientology organization public representative characterized your accounts as \"fiction\". With regards to assertions you made that David Miscavige and Scientology officials \"snooped\" in the confessional folders of Scientology members and particularly celebrities, Davis stated, \"Nobody in the church has ever violated the priest-penitent privilege. ... [Confessional files] are held in the strictest confidence.\" How do you respond to these statements by Davis?AS: Just like I did to the New York Daily News when they asked me about it: If Scientology does not violate the priest-penitent privilege, what is the Scientology spokesperson doing talking to the press about my sex life? Davis further stated to the New York Daily News that (separate from the earlier intimations from the lawyer for Tom Cruise) the Scientology organization was itself \"preparing a lawsuit\" against you because of the \"disgusting allegations\" in the book. Have you received any notice from the Scientology organization with regards such a potential lawsuit? Davis proceeded to make claims to the New York Daily News about your sexual relationships. Additionally, BBC News reported that after you began to make public criticism of the organization and its leader David Miscavige, Scientology provided \"intimate details of her sex life\" to the Florida newspaper the St. Petersburg Times. How did you feel when these sexual details were made public by Scientology? How do you feel this behavior by the organization and its officials reflects on its assertions of keeping confidential information secret, and respecting the privacy of priest-penitent privilege?AS: To me \u2013 and MANY other people \u2013 it was obvious through their child-like reaction that they have something fairly big to hide. I gave a detailed eye-witness account of the head of the Scientology religion repeatedly beating staff members. That they respond with exaggerated accusations about my sex life is just a red herring. And it also proves that private information you may divulge in confessionals while a member of Scientology could be used against you should you step out of line in the future. In an August 2009 issue of the Scientology publication, , the issue referred to you multiple times only as \"The Adulteress\". How did this make you feel when you found out about this publication? When you were still a member of the Scientology organization, what was your opinion at that point in time of Freedom Magazine? What is your opinion of the publication - its reputability and reliability, at this point in time? In the August 2009 publication of \"Freedom\", they slandered both the St. Petersburg Times reporters and the \"defectors\" (myself, , Mike Rinder and Tom DeVocht). Note: they did not use the name \"Amy Scobee\" in this magazine. Instead, they refer to me as \"the Adulteress\". This slanderous character assassination appears in more than 20 places in their publication. It's painfully obvious that they were referring to me since I was the only female that spoke out in the article they were protesting. I'm not \"an adulteress\". As a member of Scientology's Sea Organization (age 16 to 42), I had sexual intercourse with my first husband, my second husband and my current husband. Regardless, my \"sexual purity\" has nothing to do with my reporting the fact that I witnessed the head of the Church of Scientology commit repeated assault & battery on specific church executives while I was employed there. It's just their attempt to \"annihilate credibility\" for exposing this crime. In my view, the Freedom magazine is used to help carry out Miscavige's private agenda to try to remain in a position of power in that organization. Amy Scobee in 2009 BBC News reported on September 26, that during an interview for the special , , yourself and reporter were photographed, and such photographs of the two of you hugging after completing the interview were sent by Scientology UK lawyers from the firm Carter-Ruck to the BBC. What do you think Scientology was attempting to accomplish by sending these photos to the BBC? Is such behavior by the Scientology organization with regard to monitoring of journalists, critics, or former members such as yourself common? What do you do to cope and/or respond to such behavior from the Scientology organization?AS: Yes, this type of intimidation is common practice by Scientology. As a witness in an on-going court case against Scientology, I was recently in a deposition with Scientology's lead counsel. He pulled out the photo that their private investigators took of John Sweeney giving me a hug on the highway outside of the Scientology compound in Hemet after nearly two full days of interviews. He proceeded to ask me how much \"alone time\" I spent with Mr. Sweeney (which was none) and when I explained that we all gave each other hugs goodbye before we went our separate ways and that my husband was right there with me, the lawyer said, \"We'll see what the jury says about that!\" All they are trying to do is intimidate us into silence through constant trails by PI's, slandering our names with ridiculous accusations, etc., so we'd become cowed, be quiet and let their criminality go on, unchecked. Well, it hasn't worked to keep me silent. To me, it's more important to prevent anyone else from being hurt by making Scientology's human rights violations known than to worry about them tarnishing my personal reputation in retaliation. I believe that the truth must be brought to light, despite consequences. Are there any other points that you would like to elaborate or explain? Related news Sister links", "edit_actions": [{"type": "D", "before": "Amy Scobee", "after": null, "start_char_pos": 28, "end_char_pos": 38}, {"type": "D", "before": "Gold Base", "after": null, "start_char_pos": 467, "end_char_pos": 476}, {"type": "R", "before": "Hemet, California", "after": ",", "start_char_pos": 515, "end_char_pos": 532}, {"type": "R", "before": "science fiction writer L. Ron Hubbard", "after": "writer", "start_char_pos": 562, "end_char_pos": 599}, {"type": "D", "before": "David Miscavige", "after": null, "start_char_pos": 793, "end_char_pos": 808}, {"type": "D", "before": "St. Petersburg Times", "after": null, "start_char_pos": 1016, "end_char_pos": 1036}, {"type": "R", "before": "BBC program Panorama hosted by investigative journalist John Sweeney, The Secrets of Scientology", "after": "program hosted by", "start_char_pos": 1068, "end_char_pos": 1164}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1167, "end_char_pos": 1167}, {"type": "D", "before": "BBC One", "after": null, "start_char_pos": 1187, "end_char_pos": 1194}, {"type": "D", "before": "Sea Org", "after": null, "start_char_pos": 1386, "end_char_pos": 1393}, {"type": "D", "before": "Rehabilitation Project Force", "after": null, "start_char_pos": 1677, "end_char_pos": 1705}, {"type": "D", "before": "raped", "after": null, "start_char_pos": 2278, "end_char_pos": 2283}, {"type": "D", "before": "Suppressive Person", "after": null, "start_char_pos": 2949, "end_char_pos": 2967}, {"type": "R", "before": "intelligence agency the Office of Special Affairs", "after": "the", "start_char_pos": 2989, "end_char_pos": 3038}, {"type": "D", "before": "Bertram Fields", "after": null, "start_char_pos": 3261, "end_char_pos": 3275}, {"type": "D", "before": "Tom Cruise", "after": null, "start_char_pos": 3341, "end_char_pos": 3351}, {"type": "D", "before": "Tommy Davis", "after": null, "start_char_pos": 3393, "end_char_pos": 3404}, {"type": "R", "before": "propaganda publication Freedom Magazine", "after": "publication", "start_char_pos": 3767, "end_char_pos": 3806}, {"type": "D", "before": "Auditing", "after": null, "start_char_pos": 3987, "end_char_pos": 3995}, {"type": "D", "before": "BBC News", "after": null, "start_char_pos": 4070, "end_char_pos": 4078}, {"type": "D", "before": "All Headline News", "after": null, "start_char_pos": 4622, "end_char_pos": 4639}, {"type": "R", "before": "Today Tonight, The Drew Marshall Show, Lateline, and Panorama", "after": ", , , and", "start_char_pos": 4768, "end_char_pos": 4829}, {"type": "D", "before": "Sea Org", "after": null, "start_char_pos": 4892, "end_char_pos": 4899}, {"type": "R", "before": "$150 to my name. I had no outside job skills, never cooked and I barely knew how to drive. I had no clue what I would be doing to make a living in the \"outside world\". It was not unlike being dropped on another planet and having to figure out how to survive from scratch. After I became stable and saved up some money, I began writing. As I wrote, I realized how important it was to get my story out. This \"religion\" promotes how their purpose is to create a sane world without criminality, etc. and the more I was OUT of their grip, the more I realized just how insane and criminal they really are. I learned about the Universal Declarations for Human Rights and saw how many points I personally knew were violated by the Scientology organization with their members. I learned about laws of the land (which I had been entirely ignorant of while a staff member) and realized some of the acts that I witnessed were actual violations of the LAW. But what set me on the past to exposing the abuse within Scientology the most was when my mother was forced to disconnect from me, per Scientology's \"disconnection\" policy where members are to cut all ties with anyone not in good standing with their \"church\". This was a very emotionally traumatic situation. In my view, no religion worthy of the title should have a right to stand between loved ones. Quite early on in the book's first chapter, you recount an incident of being raped at age 14, by a 35-year-old married man who was your Scientology supervisor. You describe how your \"Scientology Ethics Officer\" found out, said you were in a \"state of treason\", and that the incident was kept quiet and not reported to the police by Scientology officials. How difficult was it to include this in the book? For what reason did you choose to include this? Why didn't you tell your parents about this?AS: To me, it was very important to include this information in my book because it gives the reader an idea of how Scientology operates. One of the worst crimes you can commit as a Scientologist is bringing about \"bad public relations\" for them. Things that happen internally are KEPT internal with the \"we handle our own\" doctrine. Unfortunately, this was a CRIME for which that person could have been arrested. Instead, it was \"handled\" by the local staff (swept under the carpet) and forgotten about. I didn't tell my parents because I was ashamed and afraid. After describing your arrival at the Scientology \"Flag Land Base\" in Florida at age 16, you recall how you met and became intimate with a 26-year-old man named David Paul, who later became your husband. For this act, you were subjected to a \"security check\" process on the Scientology device, the E-meter, and ordered to serve time performing manual labor on the controversial \"Rehabilitation Project Force\" (RPF) of Scientology. Is 16 a relatively young age to be sentenced to the Rehabilitation Project Force in Scientology? Did you know other individuals on this program that were younger than you, or around the same age? AS: Yes, 16 is a young age to be sentenced to the Rehabilitation Project Force. I should have been attending school as per the agreement with my mother when she gave parental consent for me to join the Sea Organization \u2013 but I factually never saw one day of school after I joined. There were other teen-agers on the RPF at the same time, but I believe I was the youngest. Scientologists working in the organization's \"Rehabilitation Project Force\" in Los Angeles, California During participation in the Rehabilitation Project Force, you recount how you were slapped across the face for refusing to climb into a garbage can after being ordered to do so by a leader of your group. How did this make you feel? Did you consider leaving the organization at all at this point in time? Why or why not, and why did you remain?AS: It was a completely nutty order and I wasn't about to comply. I ran around the block to get away as the lady who issued the order chased after me. I went to the person in charge asking for help but he was not in his office. The lady chased me into that office and then hit me across the face. I did NOT hit her back because I wanted to show that she was the crazy one. However when the Ethics Officer got there, he said I should have complied as she was my superior. I felt like it was a huge injustice because the order made no sense and had no purpose. She was just trying to exert her \"authority\" over me. But, I didn't want to be in more trouble, so I did my punishment for non-compliance and carried on. No, I did not think of leaving then. At that point, I just thought that lady was insane, not the entire organization. After completing your time on the Rehabilitation Project Force, you were appointed to the position of \"Commanding Officer of the Flag Land Base's Communicator\", where you were \"responsible for all in-coming and out-going traffic from the executive and obtaining compliance to all orders issued\". Did it surprise you that directly after finishing the Rehabilitation Project Force, you were given such a position of responsibility as a Scientology executive? Does this occur often in Scientology to members after they finish their sentence in the Rehabilitation Project Force? AS: In the Sea Organization, one is expected to be able to perform any duty \u2013 with or without training. It's preached that the salvation of the world is on our shoulders and everyone needs to pull up their bootstraps and make it go right. So, the appointment did not surprise me. Shortly after your promotion from Rehabilitation Project Force member to this position, you were promoted to \"Flag Land Bureau Estates Management Chief\", where you were \"responsible for all public hotels and services\", and subsequently promoted to the \"Commodore's Messenger Organization (CMO)\". At the end of chapter 3, you write how you were \"placed under a group justice action, called a Committee of Evidence\", and the committee, \"recommended my removal for neglect of duty regarding the schedule\". However, a few days later you were told you were assigned to Los Angeles, California, in order to recruit for members to join the CMO. Again, this appears to be a pattern of conflicting orders within the organization, where in one instance you were disciplined for perceived slights, and yet directly afterward, promoted to a higher position of authority as a Scientology executive. How do you explain this behavior within the organization?AS: The control and handling of personnel within the Sea Org was very unpredictable. There were always huge demands and needs for people on various projects or positions that had to be filled \"at once\". So one could expect rapid changes. It was also considered that after one messes up, they can be corrected using the \"ethics technology\" of Scientology and confessionals so they can carry on after their level of ethics are once again acceptable. What was the highest-ranking position you held within Scientology? Who did you report to in this position? What responsibilities did you have, and how many other people and sub-entities did you oversee? AS: I was in the Watchdog Committee (WDC) which is the highest ecclesiastical body in Scientology, with a WDC member appointed over each of the numerous \"sectors\" or areas of Scientology to see to their proper management. My boss as a WDC member is the WDC Chairman. This is the highest management position in the organization. I was in WDC for about a decade and held about six different sectors over the years, including the Association for Better Living and Education (ABLE) sector, which is responsible for the secular aspects of the organization \u2013 drug rehabilitation, criminal reform, Applied Scholastics study technology and The Way To Happiness Foundation \u2013 and the Celebrity Center sector. Anything that goes on inside your sector or sphere of responsibility as a WDC member, is your responsibility and you're held accountable. This could be very stressful, particularly when the current head of Scientology \u2013 David Miscavige \u2013 is so abusive. For example, Miscavige learned that the Tampa Scientology organization was not paying their rent in 2003. As I had previously been the WDC member for all Scientology churches (approx 175 of them around the world) and should have noticed and handled it then, Miscavige demanded that I personally pay the rent of $", "after": "$150 to my name. I had no outside job skills, never cooked and I barely knew how to drive. I had no clue what I would be doing to make a living in the \"outside world\". It was not unlike being dropped on another planet and having to figure out how to survive from scratch. After I became stable and saved up some money, I began writing. As I wrote, I realized how important it was to get my story out. This \"religion\" promotes how their purpose is to create a sane world without criminality, etc. and the more I was OUT of their grip, the more I realized just how insane and criminal they really are. I learned about the Universal Declarations for Human Rights and saw how many points I personally knew were violated by the Scientology organization with their members. I learned about laws of the land (which I had been entirely ignorant of while a staff member) and realized some of the acts that I witnessed were actual violations of the LAW. But what set me on the past to exposing the abuse within Scientology the most was when my mother was forced to disconnect from me, per Scientology's \"disconnection\" policy where members are to cut all ties with anyone not in good standing with their \"church\". This was a very emotionally traumatic situation. In my view, no religion worthy of the title should have a right to stand between loved ones. Quite early on in the book's first chapter, you recount an incident of being at age 14, by a 35-year-old married man who was your Scientology supervisor. You describe how your \"Scientology Ethics Officer\" found out, said you were in a \"state of treason\", and that the incident was kept quiet and not reported to the police by Scientology officials. How difficult was it to include this in the book? For what reason did you choose to include this? Why didn't you tell your parents about this?AS: To me, it was very important to include this information in my book because it gives the reader an idea of how Scientology operates. One of the worst crimes you can commit as a Scientologist is bringing about \"bad public relations\" for them. Things that happen internally are KEPT internal with the \"we handle our own\" doctrine. Unfortunately, this was a CRIME for which that person could have been arrested. Instead, it was \"handled\" by the local staff (swept under the carpet) and forgotten about. I didn't tell my parents because I was ashamed and afraid. After describing your arrival at the Scientology \"Flag Land Base\" in Florida at age 16, you recall how you met and became intimate with a 26-year-old man named David Paul, who later became your husband. For this act, you were subjected to a \"security check\" process on the Scientology device, the , and ordered to serve time performing manual labor on the controversial \"\" (RPF) of Scientology. Is 16 a relatively young age to be sentenced to the Rehabilitation Project Force in Scientology? Did you know other individuals on this program that were younger than you, or around the same age? AS: Yes, 16 is a young age to be sentenced to the Rehabilitation Project Force. I should have been attending school as per the agreement with my mother when she gave parental consent for me to join the Sea Organization \u2013 but I factually never saw one day of school after I joined. There were other teen-agers on the RPF at the same time, but I believe I was the youngest. Scientologists working in the organization's \"\" in , California During participation in the Rehabilitation Project Force, you recount how you were slapped across the face for refusing to climb into a garbage can after being ordered to do so by a leader of your group. How did this make you feel? Did you consider leaving the organization at all at this point in time? Why or why not, and why did you remain?AS: It was a completely nutty order and I wasn't about to comply. I ran around the block to get away as the lady who issued the order chased after me. I went to the person in charge asking for help but he was not in his office. The lady chased me into that office and then hit me across the face. I did NOT hit her back because I wanted to show that she was the crazy one. However when the Ethics Officer got there, he said I should have complied as she was my superior. I felt like it was a huge injustice because the order made no sense and had no purpose. She was just trying to exert her \"authority\" over me. But, I didn't want to be in more trouble, so I did my punishment for non-compliance and carried on. No, I did not think of leaving then. At that point, I just thought that lady was insane, not the entire organization. After completing your time on the Rehabilitation Project Force, you were appointed to the position of \"Commanding Officer of the Flag Land Base's Communicator\", where you were \"responsible for all in-coming and out-going traffic from the executive and obtaining compliance to all orders issued\". Did it surprise you that directly after finishing the Rehabilitation Project Force, you were given such a position of responsibility as a Scientology executive? Does this occur often in Scientology to members after they finish their sentence in the Rehabilitation Project Force? AS: In the Sea Organization, one is expected to be able to perform any duty \u2013 with or without training. It's preached that the salvation of the world is on our shoulders and everyone needs to pull up their bootstraps and make it go right. So, the appointment did not surprise me. Shortly after your promotion from Rehabilitation Project Force member to this position, you were promoted to \"Flag Land Bureau Estates Management Chief\", where you were \"responsible for all public hotels and services\", and subsequently promoted to the \" (CMO)\". At the end of chapter 3, you write how you were \"placed under a group justice action, called a Committee of Evidence\", and the committee, \"recommended my removal for neglect of duty regarding the schedule\". However, a few days later you were told you were assigned to Los Angeles, California, in order to recruit for members to join the CMO. Again, this appears to be a pattern of conflicting orders within the organization, where in one instance you were disciplined for perceived slights, and yet directly afterward, promoted to a higher position of authority as a Scientology executive. How do you explain this behavior within the organization?AS: The control and handling of personnel within the Sea Org was very unpredictable. There were always huge demands and needs for people on various projects or positions that had to be filled \"at once\". So one could expect rapid changes. It was also considered that after one messes up, they can be corrected using the \"ethics technology\" of Scientology and confessionals so they can carry on after their level of ethics are once again acceptable. What was the highest-ranking position you held within Scientology? Who did you report to in this position? What responsibilities did you have, and how many other people and sub-entities did you oversee? AS: I was in the Watchdog Committee (WDC) which is the highest ecclesiastical body in Scientology, with a WDC member appointed over each of the numerous \"sectors\" or areas of Scientology to see to their proper management. My boss as a WDC member is the WDC Chairman. This is the highest management position in the organization. I was in WDC for about a decade and held about six different sectors over the years, including the Association for Better Living and Education (ABLE) sector, which is responsible for the secular aspects of the organization \u2013 drug rehabilitation, criminal reform, Applied Scholastics study technology and The Way To Happiness Foundation \u2013 and the Celebrity Center sector. Anything that goes on inside your sector or sphere of responsibility as a WDC member, is your responsibility and you're held accountable. This could be very stressful, particularly when the current head of Scientology \u2013 David Miscavige \u2013 is so abusive. For example, Miscavige learned that the Tampa Scientology organization was not paying their rent in 2003. As I had previously been the WDC member for all Scientology churches (approx 175 of them around the world) and should have noticed and handled it then, Miscavige demanded that I personally pay the rent of $", "start_char_pos": 5288, "end_char_pos": 13682}, {"type": "R", "before": "Combating Cult Mind Control by cult researcher Steven Hassan", "after": "by researcher", "start_char_pos": 14032, "end_char_pos": 14092}, {"type": "R", "before": "Man's Search for Meaning by Viktor Frankl", "after": "by", "start_char_pos": 15369, "end_char_pos": 15410}, {"type": "D", "before": "Kelly Preston, Kirstie Alley, Anne Archer, Nancy Cartwright, Billy Sheehan, Priscilla Presley, Lisa Marie Presley, Juliette Lewis", "after": null, "start_char_pos": 16019, "end_char_pos": 16148}, {"type": "A", "before": null, "after": ", , , , , , ,", "start_char_pos": 16151, "end_char_pos": 16151}, {"type": "R", "before": "Edgar Winter, and Jenna Elfman", "after": ", and", "start_char_pos": 16177, "end_char_pos": 16207}, {"type": "D", "before": "Association for Better Living and Education", "after": null, "start_char_pos": 18307, "end_char_pos": 18350}, {"type": "R", "before": "Applied Scholastics, Narconon, Criminon, and The Way to Happiness Foundation", "after": ", , , and", "start_char_pos": 18589, "end_char_pos": 18665}, {"type": "D", "before": "David Miscavige", "after": null, "start_char_pos": 18989, "end_char_pos": 19004}, {"type": "D", "before": "brainwashing", "after": null, "start_char_pos": 19557, "end_char_pos": 19569}, {"type": "D", "before": "Mike Rinder", "after": null, "start_char_pos": 21940, "end_char_pos": 21951}, {"type": "D", "before": "Office of Special Affairs", "after": null, "start_char_pos": 22841, "end_char_pos": 22866}, {"type": "D", "before": "Suppressive Person", "after": null, "start_char_pos": 24234, "end_char_pos": 24252}, {"type": "D", "before": "All Headline News", "after": null, "start_char_pos": 24473, "end_char_pos": 24490}, {"type": "D", "before": "Bertram Fields", "after": null, "start_char_pos": 24559, "end_char_pos": 24573}, {"type": "D", "before": "Nicole Kidman", "after": null, "start_char_pos": 24855, "end_char_pos": 24868}, {"type": "D", "before": "Bertram Fields", "after": null, "start_char_pos": 25375, "end_char_pos": 25389}, {"type": "D", "before": "Tom Cruise", "after": null, "start_char_pos": 25455, "end_char_pos": 25465}, {"type": "D", "before": "Tommy Davis", "after": null, "start_char_pos": 25499, "end_char_pos": 25510}, {"type": "D", "before": "New York Daily News", "after": null, "start_char_pos": 26902, "end_char_pos": 26921}, {"type": "D", "before": "Tommy Davis", "after": null, "start_char_pos": 26983, "end_char_pos": 26994}, {"type": "D", "before": "Freedom Magazine", "after": null, "start_char_pos": 29144, "end_char_pos": 29160}, {"type": "D", "before": "Marty Rathbun", "after": null, "start_char_pos": 29655, "end_char_pos": 29668}, {"type": "R", "before": "Panorama special, The Secrets of Scientology", "after": "special", "start_char_pos": 30750, "end_char_pos": 30794}, {"type": "A", "before": null, "after": ",", "start_char_pos": 30797, "end_char_pos": 30797}, {"type": "D", "before": "John Sweeney", "after": null, "start_char_pos": 30820, "end_char_pos": 30832}, {"type": "A", "before": null, "after": "Sister links", "start_char_pos": 32623, "end_char_pos": 32623}], "sents_char_pos": [0, 170, 320, 534, 608, 831, 1019, 1211, 1525, 1797, 1989, 2177, 2482, 2737, 2892, 3160, 3353, 3509, 3660, 3732, 3887, 4169, 4187, 4342, 4526, 4621, 4696, 4831, 4901, 5047, 5304, 5378, 5455, 5559, 5623, 5688, 5887, 6055, 6231, 6491, 6540, 6633, 6793, 6988, 7038, 7086, 7131, 7267, 7376, 7463, 7543, 7634, 7693, 7896, 8123, 8220, 8319, 8399, 8600, 8691, 8998, 9026, 9098, 9138, 9203, 9288, 9365, 9434, 9510, 9608, 9696, 9750, 9850, 9887, 9968, 10264, 10425, 10543, 10647, 10782, 10823, 11119, 11326, 11709, 11767, 11851, 11969, 12004, 12214, 12281, 12321, 12417, 12639, 12684, 12745, 13116, 13254, 13369, 13475, 13712, 13965, 14175, 14221, 14339, 14453, 14476, 14734, 14859, 14953, 15295, 15412, 15438, 15560, 15609, 15657, 15708, 15915, 16209, 16270, 16331, 16416, 16614, 16645, 16798, 16977, 17259, 17366, 17406, 17572, 17733, 17965, 18217, 18362, 18480, 18752, 18883, 18971, 19040, 19352, 19438, 19495, 19571, 19947, 20023, 20185, 20318, 20387, 20415, 20489, 20660, 20909, 21117, 21334, 21382, 21429, 21465, 21698, 21783, 21971, 22137, 22211, 22303, 22466, 22706, 22797, 22933, 23152, 23334, 23390, 23540, 23667, 23755, 23914, 24135, 24324, 24430, 24676, 25018, 25238, 25467, 25547, 25690, 25728, 25852, 25921, 25998, 26154, 26253, 26470, 26568, 26633, 26742, 26862, 27036, 27359, 27408, 27629, 27880, 27982, 28073, 28292, 28310, 28386, 28582, 28711, 28823, 28911, 29087, 29229, 29299, 29426, 29525, 29598, 29700, 29763, 29810, 29903, 30037, 30062, 30214, 30437, 30514, 30662, 31003, 31098, 31241, 31331, 31400, 31524, 31720, 32007, 32227, 32269, 32464, 32537, 32609]} {"doc_id": "212563", "revision_depth": "1", "before_revision": "At 11:51 a.m. Central European Summer Time (0951 UTC), Marcus Jannes, a student from J\u00e4rna, Stockholm , posted to the Mental Health Problems forum of Sweden's Flashback message boards using the newly-registered username \"LurifaxFlux\", stating that he was going to hang himself, adding that he had already swallowed 100mg of dexofen and 1500mg of paracetamol . He said that he had set up a webcam to record the event, and would post details later of a FTP server for people to watch. __NOTOC__ People responded to his post almost immediately. Some offered messages of hope, such as, \"How bad can it be? When everything is at its worst, it can only get better\", and \"Think of poor people, mutilated people, people who are lame or blind. Living with a disability is hard. They can not change their lives! But you still have the ability to alter yours!\" Others tried to keep him online by talking to him empathetically: \"Is there anything that can make you change your mind?\", \"Tell me about yourself.\" However, other users posted messages saying they didn't believe him, wishing him luck with his attempt, and calling him an attention whore and a troll . They also goaded him by saying, \"you won't dare, you are too cowardly\", and offering advice on the best way to hang himself: \"I recommend ... you do it from a height that you can jump off so you are guaranteed to break your neck.\" In a later post, Jannes said that he had been feeling suicidal for about six months, but was too scared to actually attempt anything until he tried to strangle himself with his own hands. In response to questions, he stated that he was using a network cable to strangle himself because he didn't have any rope, but he was worried that the cable would not be strong enough to take his weight. He also told them that he had Asperger syndrome and High-functioning autism , and was emotionally vulnerable and lacked normal social skills. He admitted to feeling lonely, and alluded to experiencing problems at school, but admitted that he had a good upbringing and had a rather good life. At around the same time, he also updated his Facebook status to say life was \"just too difficult\", and that he was going to kill himself. The S\u00f6dert\u00e4lje police state that they were first alerted to the incident at 1:44 p.m. At 2:06 p.m., the image feeds show two police officers charging into the apartment and releasing the cable from around Jannus' neck. They begin administering CPR. Two minutes later, two paramedics arrive, and they take over CPR while one of the officers looks around the room at cables; the back of a flat-screen television set; and presumably the computer, as the images finally stop being uploaded. The police have so far declined to comment on how the suicide will be investigated, but Sven-Erik Alhem, a chief prosecutor in Sweden told Aftonbladet , that psychologically inducing a person to commit suicide, or contributing to the act, can be classified as incitement to murder, and is a criminal offense. The Flashback message boards are a controversial topic in Sweden. They are seen as being similar to the English language website 4chan , and especially its \"Random\" /b/ board. The Flashback members are able to post with a great amount of freedom of speech . The site has been investigated by the Swedish police on numerous occasions and is under constant surveillance by the Swedish Security Service due to its members' abundant discussions about drug use, child pornography, race science, bestiality and other controversial subjects. Other controversies include sexual harassment of celebrities and politicians, open racism, forced disconnection from its internet service provider, the hosting of nazi sites, and the sabotage of telephone votes in TV shows. In November 2008, a 19-year-old male from Pembroke Pines , Florida used his webcam to broadcast his suicide on the live video site Justin. tv. Abraham K. Biggs, 19, committed suicide by taking an overdose of opiates and benzodiazepine, which had been prescribed for his bipolar disorder . He also made online threats of suicide and advertised his intentions to broadcast it live over the internet.", "after_revision": "At 11:51 a.m. (0951 UTC), Marcus Jannes, a student from , , posted to the Mental Health Problems forum of Sweden's message boards using the newly-registered username \"LurifaxFlux\", stating that he was going to hang himself, adding that he had already swallowed 100mg of and 1500mg of . He said that he had set up a webcam to record the event, and would post details later of a FTP server for people to watch. __NOTOC__ People responded to his post almost immediately. Some offered messages of hope, such as, \"How bad can it be? When everything is at its worst, it can only get better\", and \"Think of poor people, mutilated people, people who are lame or blind. Living with a disability is hard. They can not change their lives! But you still have the ability to alter yours!\" Others tried to keep him online by talking to him empathetically: \"Is there anything that can make you change your mind?\", \"Tell me about yourself.\" However, other users posted messages saying they didn't believe him, wishing him luck with his attempt, and calling him an and a . They also goaded him by saying, \"you won't dare, you are too cowardly\", and offering advice on the best way to hang himself: \"I recommend ... you do it from a height that you can jump off so you are guaranteed to break your neck.\" In a later post, Jannes said that he had been feeling suicidal for about six months, but was too scared to actually attempt anything until he tried to strangle himself with his own hands. In response to questions, he stated that he was using a network cable to strangle himself because he didn't have any rope, but he was worried that the cable would not be strong enough to take his weight. He also told them that he had and , and was emotionally vulnerable and lacked normal social skills. He admitted to feeling lonely, and alluded to experiencing problems at school, but admitted that he had a good upbringing and had a rather good life. At around the same time, he also updated his Facebook status to say life was \"just too difficult\", and that he was going to kill himself. The police state that they were first alerted to the incident at 1:44 p.m. At 2:06 p.m., the image feeds show two police officers charging into the apartment and releasing the cable from around Jannus' neck. They begin administering CPR. Two minutes later, two paramedics arrive, and they take over CPR while one of the officers looks around the room at cables; the back of a flat-screen television set; and presumably the computer, as the images finally stop being uploaded. The police have so far declined to comment on how the suicide will be investigated, but Sven-Erik Alhem, a chief prosecutor in Sweden told , that psychologically inducing a person to commit suicide, or contributing to the act, can be classified as incitement to murder, and is a criminal offense. The Flashback message boards are a controversial topic in Sweden. They are seen as being similar to the English language website , and especially its \"Random\" /b/ board. The Flashback members are able to post with a great amount of . The site has been investigated by the Swedish police on numerous occasions and is under constant surveillance by the due to its members' abundant discussions about drug use, , , and other controversial subjects. Other controversies include sexual harassment of celebrities and politicians, open racism, forced disconnection from its internet service provider, the hosting of nazi sites, and the sabotage of telephone votes in TV shows. In November 2008, a 19-year-old male from , Florida used his webcam to broadcast his suicide on the live video site . Abraham K. Biggs, 19, committed suicide by taking an overdose of opiates and benzodiazepine, which had been prescribed for his . He also made online threats of suicide and advertised his intentions to broadcast it live over the internet.", "edit_actions": [{"type": "D", "before": "Central European Summer Time", "after": null, "start_char_pos": 14, "end_char_pos": 42}, {"type": "D", "before": "J\u00e4rna, Stockholm", "after": null, "start_char_pos": 85, "end_char_pos": 101}, {"type": "A", "before": null, "after": ",", "start_char_pos": 104, "end_char_pos": 104}, {"type": "D", "before": "Flashback", "after": null, "start_char_pos": 160, "end_char_pos": 169}, {"type": "D", "before": "dexofen", "after": null, "start_char_pos": 325, "end_char_pos": 332}, {"type": "D", "before": "paracetamol", "after": null, "start_char_pos": 347, "end_char_pos": 358}, {"type": "R", "before": "attention whore and a troll", "after": "and a", "start_char_pos": 1123, "end_char_pos": 1150}, {"type": "R", "before": "Asperger syndrome and High-functioning autism", "after": "and", "start_char_pos": 1806, "end_char_pos": 1851}, {"type": "D", "before": "S\u00f6dert\u00e4lje", "after": null, "start_char_pos": 2210, "end_char_pos": 2220}, {"type": "D", "before": "Aftonbladet", "after": null, "start_char_pos": 2832, "end_char_pos": 2843}, {"type": "D", "before": "4chan", "after": null, "start_char_pos": 3131, "end_char_pos": 3136}, {"type": "D", "before": "freedom of speech", "after": null, "start_char_pos": 3240, "end_char_pos": 3257}, {"type": "D", "before": "Swedish Security Service", "after": null, "start_char_pos": 3377, "end_char_pos": 3401}, {"type": "R", "before": "child pornography, race science, bestiality", "after": ", ,", "start_char_pos": 3459, "end_char_pos": 3502}, {"type": "D", "before": "Pembroke Pines", "after": null, "start_char_pos": 3803, "end_char_pos": 3817}, {"type": "R", "before": "Justin. tv.", "after": ".", "start_char_pos": 3892, "end_char_pos": 3903}, {"type": "D", "before": "bipolar disorder", "after": null, "start_char_pos": 4031, "end_char_pos": 4047}], "sents_char_pos": [0, 13, 360, 483, 542, 602, 735, 769, 802, 850, 999, 1152, 1383, 1571, 1775, 1917, 2067, 2205, 2291, 2424, 2454, 2578, 2620, 2692, 3001, 3067, 3177, 3259, 3536, 3760, 4049]} {"doc_id": "213657", "revision_depth": "1", "before_revision": "Mandelbrot in 2007 The Mandelbrot set , named after Beno\u00eet Mandelbrot, forms a fractal. Beno\u00eet B. Mandelbrot , a French-American mathematician and pioneer of fractal geometry, died in Cambridge, Massachusetts on Thursday. Mandelbrot, aged 85, died of pancreatic cancer , according to a family statement. Mandelbrot was born to Lithuanian parents on November 20, 1924, in Warsaw . Mandelbrot and his family, who were Jewish, fled Nazi persecution in 1936, moving to France. He later studied at Paris' \u00c9cole Polytechnique and received a master's degree in aeronautics from the California Institute of Technology . In 1952, Mandelbrot went back to Paris for a doctorate in mathematics, and worked with John von Neumann at Princeton , New Jersey's Institute for Advanced Study to earn a postdoctoral degree. He later described a series of complex shapes when studying the concept of roughness. Calling these shapes \"fractals,\" he found that they were present in nature and applied his work to other fields, including finance, physics, and biology. In 1958, Mandelbrot began working for for I.B.M. at the company's Thomas J. Watson Research Center in Yorktown Heights , New York. In 1987, he began teaching at Yale University , later becoming Sterling Professor Emeritus of Mathematical Sciences. Mandelbrot received the Wolf Prize in Physics in 1993 and the Japan Prize in 2003, in addition to more than fifteen honorary degrees.", "after_revision": "Mandelbrot in 2007 The , named after Beno\u00eet Mandelbrot, forms a fractal. , a French-American mathematician and pioneer of geometry, died in Cambridge, Massachusetts on Thursday. Mandelbrot, aged 85, died of , according to a family statement. Mandelbrot was born to Lithuanian parents on November 20, 1924, in . Mandelbrot and his family, who were Jewish, fled persecution in 1936, moving to France. He later studied at Paris' and received a master's degree in aeronautics from the . In 1952, Mandelbrot went back to Paris for a doctorate in mathematics, and worked with at , New Jersey's to earn a postdoctoral degree. He later described a series of complex shapes when studying the concept of roughness. Calling these shapes \"fractals,\" he found that they were present in nature and applied his work to other fields, including finance, physics, and biology. In 1958, Mandelbrot began working for for I.B.M. at the company's in , New York. In 1987, he began teaching at , later becoming Sterling Professor Emeritus of Mathematical Sciences. Mandelbrot received the in 1993 and the in 2003, in addition to more than fifteen honorary degrees.", "edit_actions": [{"type": "D", "before": "Mandelbrot set", "after": null, "start_char_pos": 23, "end_char_pos": 37}, {"type": "D", "before": "Beno\u00eet B. Mandelbrot", "after": null, "start_char_pos": 88, "end_char_pos": 108}, {"type": "D", "before": "fractal", "after": null, "start_char_pos": 158, "end_char_pos": 165}, {"type": "D", "before": "pancreatic cancer", "after": null, "start_char_pos": 251, "end_char_pos": 268}, {"type": "D", "before": "Warsaw", "after": null, "start_char_pos": 371, "end_char_pos": 377}, {"type": "D", "before": "Nazi", "after": null, "start_char_pos": 429, "end_char_pos": 433}, {"type": "D", "before": "\u00c9cole Polytechnique", "after": null, "start_char_pos": 500, "end_char_pos": 519}, {"type": "D", "before": "California Institute of Technology", "after": null, "start_char_pos": 575, "end_char_pos": 609}, {"type": "R", "before": "John von Neumann at Princeton", "after": "at", "start_char_pos": 699, "end_char_pos": 728}, {"type": "D", "before": "Institute for Advanced Study", "after": null, "start_char_pos": 744, "end_char_pos": 772}, {"type": "R", "before": "Thomas J. Watson Research Center in Yorktown Heights", "after": "in", "start_char_pos": 1110, "end_char_pos": 1162}, {"type": "D", "before": "Yale University", "after": null, "start_char_pos": 1205, "end_char_pos": 1220}, {"type": "R", "before": "Wolf Prize in Physics in", "after": "in", "start_char_pos": 1316, "end_char_pos": 1340}, {"type": "D", "before": "Japan Prize", "after": null, "start_char_pos": 1354, "end_char_pos": 1365}], "sents_char_pos": [0, 87, 221, 303, 472, 611, 803, 889, 1043, 1174, 1291]} {"doc_id": "214537", "revision_depth": "1", "before_revision": "A scientist for the National Wildlife Federation , Doug Inkley, has criticised what he described as America's \"addiction to oil\". Inkley stated it is ultimately responsible for the Deepwater Horizon disaster earlier this year. Doug Inkley, a senior scientist working for the National Wildlife Federation , said that [the United States of] America's \"addiction to oil\" was responsible for the Deepwater Horizon disaster six months ago. Inkley commented on the incident, six months after the explosion which killed eleven rig workers and resulted in over 170 million gallons of crude oil leaking into the Gulf of Mexico causing damage to marine wildlife habitats as well as the Gulf's fishing and tourism industries. Inkley is a senior scientist working for the National Wildlife Federation . He stated, \"Looking back at what we knew six months after the Exxon Valdez disaster in Alaska illustrates the danger of too quickly drawing conclusions about the full impacts of the Gulf oil disaster.\" His remarks echo those issued by another environmental organisation in July. Greenpeace demanded that BP , who the United States Congress has blamed for the disaster, take a \"new direction\" and end an \"obsession with high risk, environmentally reckless sources of oil.\" Inkley said incidents in the past showed there can be far-reaching effects. \"The Exxon Valdez disaster was not simply one ecosystem earthquake \u2013 the aftershocks have continued to this day,\" he said, citing the 1989 disaster which occurred when an oil tanker ran aground in the Gulf of Alaska .", "after_revision": "A for the , Doug Inkley, has criticised what he described as America's \"addiction to oil\". Inkley stated it is ultimately responsible for the Deepwater Horizon disaster earlier this year. Doug Inkley, a senior scientist working for the , said that [the United States of] America's \"addiction to oil\" was responsible for the Deepwater Horizon disaster six months ago. Inkley commented on the incident, six months after the explosion which killed eleven rig workers and resulted in over 170 million gallons of leaking into the causing damage to as well as the Gulf's fishing and tourism industries. Inkley is a senior scientist working for the . He stated, \"Looking back at what we knew six months after the Exxon Valdez disaster in Alaska illustrates the danger of too quickly drawing conclusions about the full impacts of the Gulf oil disaster.\" His remarks echo those issued by another environmental organisation in July. Greenpeace demanded that , who the has blamed for the disaster, take a \"new direction\" and end an \"obsession with high risk, environmentally reckless sources of oil.\" Inkley said incidents in the past showed there can be far-reaching effects. \"The disaster was not simply one ecosystem earthquake \u2013 the aftershocks have continued to this day,\" he said, citing which occurred when an ran aground in the .", "edit_actions": [{"type": "R", "before": "scientist for the National Wildlife Federation", "after": "for the", "start_char_pos": 2, "end_char_pos": 48}, {"type": "D", "before": "National Wildlife Federation", "after": null, "start_char_pos": 275, "end_char_pos": 303}, {"type": "D", "before": "crude oil", "after": null, "start_char_pos": 576, "end_char_pos": 585}, {"type": "D", "before": "Gulf of Mexico", "after": null, "start_char_pos": 603, "end_char_pos": 617}, {"type": "D", "before": "marine wildlife habitats", "after": null, "start_char_pos": 636, "end_char_pos": 660}, {"type": "D", "before": "National Wildlife Federation", "after": null, "start_char_pos": 760, "end_char_pos": 788}, {"type": "D", "before": "BP", "after": null, "start_char_pos": 1095, "end_char_pos": 1097}, {"type": "D", "before": "United States Congress", "after": null, "start_char_pos": 1108, "end_char_pos": 1130}, {"type": "D", "before": "Exxon Valdez", "after": null, "start_char_pos": 1344, "end_char_pos": 1356}, {"type": "D", "before": "the 1989 disaster", "after": null, "start_char_pos": 1469, "end_char_pos": 1486}, {"type": "D", "before": "oil tanker", "after": null, "start_char_pos": 1510, "end_char_pos": 1520}, {"type": "D", "before": "Gulf of Alaska", "after": null, "start_char_pos": 1540, "end_char_pos": 1554}], "sents_char_pos": [0, 129, 226, 434, 714, 790, 992, 1069, 1262, 1338]} {"doc_id": "214838", "revision_depth": "1", "before_revision": "Shakemap of the earthquake, by the United States Geological Survey. A \"sudden\" and \"terrifying\" aftershock of the magnitude 8.8, February 27 earthquake hit central and southern Chile on Wednesday night. The aftershock, as reported by the Servicio Sismol\u00f3gico de la Universidad de Chile (University of Chile Seismological Service), had a magnitude of 5.8, and occurred at a depth of 32.6 kilometers (20.3 miles). It took place at 23:49:56 local time (Thursday 02:49:56 UTC). The United States Geological Survey (USGS) said it occurred at a depth of 7 km (4.4 miles). Universidad de Chile measurements placed the center of the earthquake under the Pacific Ocean, 153 km (96 miles) northwest of the coastal town of Constituci\u00f3n . The USGS reported it occurred off the coast of the Libertador General Bernardo O'Higgins Region coast, 206 km (128 miles) west-northwest of Talca ; 244 kilometers (151 miles) north-northwest of Concepci\u00f3n ; 263 km (164 miles) southwest of Valpara\u00edso ; and 313 km (195 miles) west-southwest of Santiago, the capital of the country. As reported by ONEMI , Chile's National Emergencies Office, the aftershock was felt throughout the Valpara\u00edso (Mercalli III), Santiago Metropolitan (II, III, IV), O'Higgins (IV), Maule (III, IV, V), B\u00edo B\u00edo (II, III, IV) and La Araucan\u00eda regions (II, III), including cities such as Santiago, Vi\u00f1a del Mar, Lolol, Santa Cruz, Curic\u00f3, Cauquenes, Chill\u00e1n, and Temuco . No damage or casualties were reported, and there was no disturbance to utilities.", "after_revision": "Shakemap of the earthquake, by the United States Geological Survey. A \"sudden\" and \"terrifying\" aftershock of the magnitude 8.8, February 27 earthquake hit central and southern Chile on Wednesday night. The aftershock, as reported by the Servicio Sismol\u00f3gico de la (University of Chile Seismological Service), had a magnitude of 5.8, and occurred at a depth of 32.6 (20.3 miles). It took place at 23:49:56 local time (Thursday 02:49:56 UTC). The (USGS) said it occurred at a depth of 7 km (4.4 miles). Universidad de Chile measurements placed the center of the earthquake under the Pacific Ocean, 153 km (96 miles) northwest of the coastal town of . The USGS reported it occurred off the coast of the Libertador General Bernardo O'Higgins Region coast, 206 km (128 miles) west-northwest of ; 244 kilometers (151 miles) north-northwest of ; 263 km (164 miles) southwest of ; and 313 km (195 miles) west-southwest of Santiago, the capital of the country. As reported by , Chile's National Emergencies Office, the aftershock was felt throughout the (Mercalli III), (II, III, IV), O'Higgins (IV), (III, IV, V), (II, III, IV) and regions (II, III), including cities such as Santiago, Vi\u00f1a del Mar, Lolol, w| Santa Cruz, Chile|Santa Cruz , , , , and . No damage or casualties were reported, and there was no disturbance to utilities.", "edit_actions": [{"type": "D", "before": "Universidad de Chile", "after": null, "start_char_pos": 265, "end_char_pos": 285}, {"type": "D", "before": "kilometers", "after": null, "start_char_pos": 387, "end_char_pos": 397}, {"type": "D", "before": "United States Geological Survey", "after": null, "start_char_pos": 478, "end_char_pos": 509}, {"type": "D", "before": "Constituci\u00f3n", "after": null, "start_char_pos": 712, "end_char_pos": 724}, {"type": "D", "before": "Talca", "after": null, "start_char_pos": 867, "end_char_pos": 872}, {"type": "D", "before": "Concepci\u00f3n", "after": null, "start_char_pos": 921, "end_char_pos": 931}, {"type": "D", "before": "Valpara\u00edso", "after": null, "start_char_pos": 966, "end_char_pos": 976}, {"type": "D", "before": "ONEMI", "after": null, "start_char_pos": 1073, "end_char_pos": 1078}, {"type": "D", "before": "Valpara\u00edso", "after": null, "start_char_pos": 1157, "end_char_pos": 1167}, {"type": "D", "before": "Santiago Metropolitan", "after": null, "start_char_pos": 1184, "end_char_pos": 1205}, {"type": "D", "before": "Maule", "after": null, "start_char_pos": 1237, "end_char_pos": 1242}, {"type": "D", "before": "B\u00edo B\u00edo", "after": null, "start_char_pos": 1257, "end_char_pos": 1264}, {"type": "D", "before": "La Araucan\u00eda", "after": null, "start_char_pos": 1283, "end_char_pos": 1295}, {"type": "A", "before": null, "after": "w|", "start_char_pos": 1371, "end_char_pos": 1371}, {"type": "R", "before": "Curic\u00f3, Cauquenes, Chill\u00e1n, and Temuco", "after": "Chile|Santa Cruz", "start_char_pos": 1384, "end_char_pos": 1422}, {"type": "A", "before": null, "after": ", , , , and", "start_char_pos": 1423, "end_char_pos": 1423}], "sents_char_pos": [0, 67, 202, 411, 473, 565, 726, 874, 933, 978, 1057, 1425]} {"doc_id": "21631", "revision_depth": "1", "before_revision": "With only one week to go till the German federal election , all polls say it's impossible to predict who will govern the country for the next four years (for the polls see end of article). Gerhard Schr\u00f6der today in Munich Angela Merkel's Christian Democrats (CDU) had headed the polls for over two years. Only three months ago, when chancellor Gerhard Schr\u00f6der proclaimed he would seek early elections, a move that at the time was considered to be political suicide by many commentators, it seemed not unlikely that the CDU could even govern on its own, without an coalition partner. While their lead was slowly shrinking in the past few months, there was still a comfortable majority for a coalition with the Free Democrats (FDP). Then came the TV debate between Schr\u00f6der and Merkel. Commentators and newspaper editorials first thought it didn't have much impact. Sure, the \"Media chancellor\" Schr\u00f6der was widely considered to have performed better, but that was to be expected. And Merkel certainly wasn't as bad as Schr\u00f6der's Social Democrats (SPD) had hoped. Also the topics they talked about weren't really new. Every position they stated had already been printed and broadcasted over and over again. But something did happen. The CDU plunged between 2-3\\% in the various polls, while the SPD gained as much as 3.5\\%. Suddenly the black-yellow (named for the party colors of the CDU and FDP) majority was gone. But the current red-green (this time the colors of SPD and Greens ) coalition is even farther from reaching a majority because there is also the Left Party . The Left Party (or simply The Left) is essentially a renamed PDS, which in turn is the successor of the SED , the former ruling party of the GDR . It failed the 5\\% quorum in the 2002 election and currently only has two representatives in the Bundestag ; both won constituencies in East Berlin. The Left originally planned to merge with the WASG , a party mainly consisting of former SPD members who were disappointed by Schr\u00f6der's social reforms, before the election which would have been held in 2006. However, they were caught off guard by the early elections call, so candidates of the WASG for the Bundestag now run under The Left banner. One of them is Oskar Lafontaine . Oskar Lafontaine Lafontaine was the Party chair of the SPD. He was also the Finance minister in Schr\u00f6der's first government. But only a few months after the SPD got in power after 16 years of CDU government, he resigned in March 1999 from both the offices of minister and party chair, citing insurmountable political and personal differences with Schr\u00f6der. He largely stayed out of politics, writing only a few books and newspaper columns, but is now, along with Gregor Gysi , one of two front-runners of the Left Party. So, assuming neither black-yellow nor red-green reach a majority, what options are left? Maybe, the only remaining possibility is a grand coalition between the SPD and the CDU. But the differences between those two parties seem irreconcilable from today's viewpoint. There are radically different approaches in the fields of taxation, social and labor reforms to name only a few. Angela Merkel has recruited a jurist from the German constitutional court, Paul Kirchhof , to her team. Kirchhof plans to introduce a flat tax on income, 25\\% for everyone, and remove all tax exemptions. While the CDU doesn't want to go that far during the next four years, it has already named Kirchhof finance minister in the case they win the election. The SPD has blasted those plans as \"radically unsocial\" and instead plans to increase the taxes for wealthier people. Another hot topic is Germany's high unemployment. The CDU plans to abolish the dismissal protection of workers to give companies greater flexibilty in the hiring of their employees. Again, this is a no-go for the SPD. Various PollsPartyARDZDFFocusFAZ SPD 34,0 34,0 34,5 32, 7CDU / CSU 41,0 41,0 40,5 41, 5Greens 7,0 7,0 7,0 7, 2FDP 6,5 7,0 7,0 7, 0The Left 8,5 8,0 8,0 8,9 But the two parties won't even speculate about this option. Both ruled out a coalition with each other. Nonetheless, 35\\% of all Germans think this coalition would be the best for the nation, a survey by the ZDF shows. That is still more than the 31\\% who would favor a black-yellow coalition and 17\\% who want a continuation of the current red-green government. So, Germans have to wait for the 18th of September to know who will govern them for the next four years. But then again, it might even take two weeks longer because a by-election is required in Dresden, after a candidate died. And if it gets even closer than the aforementioned polls suggest, Germany will have to wait till October 2nd for a new, or the old government. ", "after_revision": "With only one week to go till the , all polls say it's impossible to predict who will govern the country for the next four years (for the polls see end of article). Gerhard Schr\u00f6der today in 's (CDU) had headed the polls for over two years. Only three months ago, when chancellor proclaimed he would seek early elections, a move that at the time was considered to be political suicide by many commentators, it seemed not unlikely that the CDU could even govern on its own, without an coalition partner. While their lead was slowly shrinking in the past few months, there was still a comfortable majority for a coalition with the (FDP). Then came the TV debate between Schr\u00f6der and Merkel. Commentators and newspaper editorials first thought it didn't have much impact. Sure, the \"Media chancellor\" Schr\u00f6der was widely considered to have performed better, but that was to be expected. And Merkel certainly wasn't as bad as Schr\u00f6der's (SPD) had hoped. Also the topics they talked about weren't really new. Every position they stated had already been printed and broadcasted over and over again. But something did happen. The CDU plunged between 2-3\\% in the various polls, while the SPD gained as much as 3.5\\%. Suddenly the black-yellow (named for the party colors of the CDU and FDP) majority was gone. But the current red-green (this time the colors of SPD and ) coalition is even farther from reaching a majority because there is also the . The Left Party (or simply The Left) is essentially a renamed PDS, which in turn is the successor of the , the former ruling party of the . It failed the 5\\% quorum in the 2002 election and currently only has two representatives in the ; both won constituencies in East Berlin. The Left originally planned to merge with the , a party mainly consisting of former SPD members who were disappointed by Schr\u00f6der's social reforms, before the election which would have been held in 2006. However, they were caught off guard by the early elections call, so candidates of the WASG for the Bundestag now run under The Left banner. One of them is . Oskar Lafontaine Lafontaine was the Party chair of the SPD. He was also the Finance minister in Schr\u00f6der's first government. But only a few months after the SPD got in power after 16 years of CDU government, he resigned in March 1999 from both the offices of minister and party chair, citing insurmountable political and personal differences with Schr\u00f6der. He largely stayed out of politics, writing only a few books and newspaper columns, but is now, along with , one of two front-runners of the Left Party. So, assuming neither black-yellow nor red-green reach a majority, what options are left? Maybe, the only remaining possibility is a grand coalition between the SPD and the CDU. But the differences between those two parties seem irreconcilable from today's viewpoint. There are radically different approaches in the fields of taxation, social and labor reforms to name only a few. Angela Merkel has recruited a jurist from the German constitutional court, , to her team. Kirchhof plans to introduce a on income, 25\\% for everyone, and remove all tax exemptions. While the CDU doesn't want to go that far during the next four years, it has already named Kirchhof finance minister in the case they win the election. The SPD has blasted those plans as \"radically unsocial\" and instead plans to increase the taxes for wealthier people. Another hot topic is Germany's high unemployment. The CDU plans to abolish the dismissal protection of workers to give companies greater flexibilty in the hiring of their employees. Again, this is a no-go for the SPD. Various PollsPartyFocus 34,0 34,0 34,5 32, 7 / 41,0 41,0 40,5 41, 5 7,0 7,0 7,0 7, 2 6,5 7,0 7,0 7, 0 8,5 8,0 8,0 8,9 But the two parties won't even speculate about this option. Both ruled out a coalition with each other. Nonetheless, 35\\% of all Germans think this coalition would be the best for the nation, a survey by the ZDF shows. That is still more than the 31\\% who would favor a black-yellow coalition and 17\\% who want a continuation of the current red-green government. So, Germans have to wait for the 18th of September to know who will govern them for the next four years. But then again, it might even take two weeks longer because a by-election is required in Dresden, after a candidate died. And if it gets even closer than the aforementioned polls suggest, Germany will have to wait till October 2nd for a new, or the old government. Related news", "edit_actions": [{"type": "D", "before": "German federal election", "after": null, "start_char_pos": 34, "end_char_pos": 57}, {"type": "R", "before": "Munich Angela Merkel's Christian Democrats", "after": "'s", "start_char_pos": 215, "end_char_pos": 257}, {"type": "D", "before": "Gerhard Schr\u00f6der", "after": null, "start_char_pos": 344, "end_char_pos": 360}, {"type": "D", "before": "Free Democrats", "after": null, "start_char_pos": 710, "end_char_pos": 724}, {"type": "D", "before": "Social Democrats", "after": null, "start_char_pos": 1029, "end_char_pos": 1045}, {"type": "D", "before": "Greens", "after": null, "start_char_pos": 1475, "end_char_pos": 1481}, {"type": "D", "before": "Left Party", "after": null, "start_char_pos": 1561, "end_char_pos": 1571}, {"type": "D", "before": "SED", "after": null, "start_char_pos": 1678, "end_char_pos": 1681}, {"type": "D", "before": "GDR", "after": null, "start_char_pos": 1715, "end_char_pos": 1718}, {"type": "D", "before": "Bundestag", "after": null, "start_char_pos": 1817, "end_char_pos": 1826}, {"type": "D", "before": "WASG", "after": null, "start_char_pos": 1915, "end_char_pos": 1919}, {"type": "D", "before": "Oskar Lafontaine", "after": null, "start_char_pos": 2233, "end_char_pos": 2249}, {"type": "D", "before": "Gregor Gysi", "after": null, "start_char_pos": 2715, "end_char_pos": 2726}, {"type": "D", "before": "Paul Kirchhof", "after": null, "start_char_pos": 3228, "end_char_pos": 3241}, {"type": "D", "before": "flat tax", "after": null, "start_char_pos": 3287, "end_char_pos": 3295}, {"type": "R", "before": "PollsPartyARDZDFFocusFAZ SPD", "after": "PollsPartyFocus", "start_char_pos": 3853, "end_char_pos": 3881}, {"type": "R", "before": "7CDU", "after": "7", "start_char_pos": 3901, "end_char_pos": 3905}, {"type": "D", "before": "CSU", "after": null, "start_char_pos": 3908, "end_char_pos": 3911}, {"type": "R", "before": "5Greens", "after": "5", "start_char_pos": 3931, "end_char_pos": 3938}, {"type": "R", "before": "2FDP", "after": "2", "start_char_pos": 3954, "end_char_pos": 3958}, {"type": "R", "before": "0The Left", "after": "0", "start_char_pos": 3974, "end_char_pos": 3983}, {"type": "A", "before": null, "after": "Related news", "start_char_pos": 4733, "end_char_pos": 4733}], "sents_char_pos": [0, 188, 304, 583, 731, 784, 864, 979, 1062, 1116, 1205, 1231, 1322, 1415, 1573, 1828, 1868, 2077, 2217, 2251, 2311, 2376, 2608, 2772, 2861, 2949, 3039, 3152, 3256, 3356, 3508, 3626, 3676, 3808, 4059, 4103, 4218, 4362, 4467, 4589]} {"doc_id": "221152", "revision_depth": "1", "before_revision": "Under the Yas Marina Circuit in Abu-Dhabi 's floodlights, German driver Sebastian Vettel added a new Formula One record to his list as youngest winner of the championship at 23 years. On Saturday, Vettel took the title at the final race of this year's competition . Starting from pole position, the Red Bull Racing driver led the race right through except during pit stops, when reigning world champion Jenson Button led for a few laps. Sebastian Vettel is the youngest Formula-1 world champion at the age of 23 years Championship leader Fernando Alonso started the race 11 points ahead of Mark Webber . With 25 points for a win, 18 for second and 15 for third, the Spaniard only needed to finish second to secure his third world championship. With a 15-point lag behind Alonso, Sebastian Vettel was third in the championship standings; winning the championship depended on neither Alonso nor Webber finishing on the podium. A major accident between Michael Schumacher and Vintantonio Liuzzi on the first lap of the race triggered deployment of the safety car . Alonso and Webber were among drivers who decided to make earlier than planned pit stops while racing was resricted. However, they rejoined the track behind the Renault of Vitaly Petrov , who proved extremely difficult to overtake. Both remained stuck behind Petrov for the remainder of the race, finishing 7th and 8th respectively to score 6 and 4 points. Sebastian Vettel went on to win the race ahead of the two McLarens of Lewis Hamilton and Jenson Button , scoring 25 championship points to give a total of 256 - only 4 ahead of Alonso. In 2007, he replaced an injured Robert Kubica in the United States Grand Prix . Finishing 8th and collecting one championship point; this his first record was youngest driver to score a point in F1. In 2008, Vettel had the opportunity to race for a full season with Toro Rosso , winning what remains that team's only race victory. At the Italian Grand Prix , he became the youngest driver to qualify in pole position and youngest race winner. In 2009, he moved to Red Bull Racing , scoring that team\u2019s first pole position and first race victory. He went on to finish second in the world championship.", "after_revision": "Under the in 's floodlights, German driver added a new Formula One record to his list as youngest winner of the championship at 23 years. On Saturday, Vettel took the title at of . Starting from pole position, the driver led the race right through except during pit stops, when reigning world champion led for a few laps. Sebastian Vettel is the youngest Formula-1 world champion at the age of 23 years Championship leader started the race 11 points ahead of . With 25 points for a win, 18 for second and 15 for third, the Spaniard only needed to finish second to secure his third world championship. With a 15-point lag behind Alonso, Sebastian Vettel was third in the championship standings; winning the championship depended on neither Alonso nor Webber finishing on the podium. A major accident between and on the first lap of the race triggered deployment of the . Alonso and Webber were among drivers who decided to make earlier than planned pit stops while racing was resricted. However, they rejoined the track behind the of , who proved extremely difficult to overtake. Both remained stuck behind Petrov for the remainder of the race, finishing 7th and 8th respectively to score 6 and 4 points. Sebastian Vettel went on to win the race ahead of the two of and , scoring 25 championship points to give a total of 256 - only 4 ahead of Alonso. In 2007, he replaced an injured in the . Finishing 8th and collecting one championship point; this his first record was youngest driver to score a point in F1. In 2008, Vettel had the opportunity to race for a full season with , winning what remains that team's only race victory. At the , he became the youngest driver to qualify in pole position and youngest race winner. In 2009, he moved to , scoring that team\u2019s first pole position and first race victory. He went on to finish second in the world championship.", "edit_actions": [{"type": "R", "before": "Yas Marina Circuit in Abu-Dhabi", "after": "in", "start_char_pos": 10, "end_char_pos": 41}, {"type": "D", "before": "Sebastian Vettel", "after": null, "start_char_pos": 72, "end_char_pos": 88}, {"type": "R", "before": "the final race of this year's competition", "after": "of", "start_char_pos": 222, "end_char_pos": 263}, {"type": "D", "before": "Red Bull Racing", "after": null, "start_char_pos": 299, "end_char_pos": 314}, {"type": "D", "before": "Jenson Button", "after": null, "start_char_pos": 403, "end_char_pos": 416}, {"type": "D", "before": "Fernando Alonso", "after": null, "start_char_pos": 538, "end_char_pos": 553}, {"type": "D", "before": "Mark Webber", "after": null, "start_char_pos": 590, "end_char_pos": 601}, {"type": "R", "before": "Michael Schumacher and Vintantonio Liuzzi", "after": "and", "start_char_pos": 950, "end_char_pos": 991}, {"type": "D", "before": "safety car", "after": null, "start_char_pos": 1049, "end_char_pos": 1059}, {"type": "R", "before": "Renault of Vitaly Petrov", "after": "of", "start_char_pos": 1222, "end_char_pos": 1246}, {"type": "R", "before": "McLarens of Lewis Hamilton and Jenson Button", "after": "of and", "start_char_pos": 1476, "end_char_pos": 1520}, {"type": "R", "before": "Robert Kubica in the United States Grand Prix", "after": "in the", "start_char_pos": 1635, "end_char_pos": 1680}, {"type": "D", "before": "Toro Rosso", "after": null, "start_char_pos": 1869, "end_char_pos": 1879}, {"type": "D", "before": "Italian Grand Prix", "after": null, "start_char_pos": 1941, "end_char_pos": 1959}, {"type": "D", "before": "Red Bull Racing", "after": null, "start_char_pos": 2067, "end_char_pos": 2082}], "sents_char_pos": [0, 183, 436, 603, 743, 836, 924, 1177, 1292, 1417, 1602, 1682, 1735, 1801, 1933, 2045, 2148]} {"doc_id": "221861", "revision_depth": "1", "before_revision": "All flights in and out of Birmingham Airport have been diverted or suspended until at least noon local time after a business jet carrying an organ for transplantation crashed on approach to the airport in Birmingham, England, during heavy fog. Two people were injured in the accident, one seriously. A spokesperson for the airport said: \"We can confirm that an incident has occurred involving a private Cessna aircraft. The incident occurred on arrival into the airport and the emergency services are in attendance.\" A Cessna Citation 501 aircraft similar to the aircraft involved in the crash at Birmingham Airport, Birmingham , England. Reports suggested that smoke was seen rising from the aircraft, which came down at the end of the runway. West Midlands Police Chief Inspector Matt Markham confirmed that the aircraft was carrying an organ for transplantation, but said that it was undamaged in the accident and it had been taken from the aircraft. Later reports suggested that the liver had been transported to Queen Elizabeth Hospital , where the operation was being carried out. Another eyewitness said that she saw two fire engines on the scene in the immediate aftermath of the crash; a spokesperson for the West Midlands Ambulance Service added that paramedics were at the site of the accident. Reports suggested that the smoking aircraft came to a halt to the right of the runway after crashing into an instrument landing system beacon. Images of the airport taken around the time of the accident showed that the airport was shrouded in thick fog. Sky News reported that the aircraft was approaching the runway at an \"odd angle\", before it \"skidded\" and caught fire. The spokesperson for Birmingham Airport added: \"The airport is currently closed. If you are due to travel to the airport this evening, please contact your airline for further guidance and do not come to the airport at this time. No further information is available at the moment.\"", "after_revision": "All flights in and out of have been diverted or suspended until at least noon local time after a carrying an crashed on approach to the airport in Birmingham, England, during heavy fog. Two people were injured in the accident, one seriously. A spokesperson for the airport said: \"We can confirm that an incident has occurred involving a private aircraft. The incident occurred on arrival into the airport and the emergency services are in attendance.\" A aircraft similar to the aircraft involved in the crash at , , England. Reports suggested that smoke was seen rising from the aircraft, which came down at the end of the runway. Chief Inspector Matt Markham confirmed that the aircraft was carrying an organ for transplantation, but said that it was undamaged in the accident and it had been taken from the aircraft. Later reports suggested that the had been transported to , where the operation was being carried out. Another eyewitness said that she saw two fire engines on the scene in the immediate aftermath of the crash; a spokesperson for the w| West Midlands Ambulance Service added that paramedics were at the site of the accident. Reports suggested that the smoking aircraft came to a halt to the right of the runway after crashing into an beacon. Images of the airport taken around the time of the accident showed that the airport was shrouded in thick fog. reported that the aircraft was approaching the runway at an \"odd angle\", before it \"skidded\" and caught fire. The spokesperson for Birmingham Airport added: \"The airport is currently closed. If you are due to travel to the airport this evening, please contact your airline for further guidance and do not come to the airport at this time. No further information is available at the moment.\"", "edit_actions": [{"type": "D", "before": "Birmingham Airport", "after": null, "start_char_pos": 26, "end_char_pos": 44}, {"type": "R", "before": "business jet carrying an organ for transplantation", "after": "carrying an", "start_char_pos": 116, "end_char_pos": 166}, {"type": "D", "before": "Cessna", "after": null, "start_char_pos": 403, "end_char_pos": 409}, {"type": "D", "before": "Cessna Citation 501", "after": null, "start_char_pos": 519, "end_char_pos": 538}, {"type": "D", "before": "Birmingham Airport, Birmingham", "after": null, "start_char_pos": 597, "end_char_pos": 627}, {"type": "A", "before": null, "after": ",", "start_char_pos": 630, "end_char_pos": 630}, {"type": "D", "before": "West Midlands Police", "after": null, "start_char_pos": 746, "end_char_pos": 766}, {"type": "D", "before": "liver", "after": null, "start_char_pos": 988, "end_char_pos": 993}, {"type": "D", "before": "Queen Elizabeth Hospital", "after": null, "start_char_pos": 1018, "end_char_pos": 1042}, {"type": "A", "before": null, "after": "w|", "start_char_pos": 1219, "end_char_pos": 1219}, {"type": "D", "before": "instrument landing system", "after": null, "start_char_pos": 1417, "end_char_pos": 1442}, {"type": "D", "before": "Sky News", "after": null, "start_char_pos": 1562, "end_char_pos": 1570}], "sents_char_pos": [0, 243, 299, 419, 516, 639, 745, 954, 1087, 1195, 1307, 1450, 1561, 1680, 1761, 1909]} {"doc_id": "226323", "revision_depth": "1", "before_revision": "Much of the interior of New South Wales, Australia continues to be affected by floods caused by heavy rains. With more rain predicted, the Australian Bureau of Meteorology has issued a flood watch for all western flowing rivers in New South Wales from the Namoi River in the north of the state to the Murrumbidgee River in the south. Coonamble , in the central-western plains district of New South Wales, has been isolated by major flooding of the Castlereagh River . The State Emergency Service estimates that around 2,760 people are currently trapped in Coonamble. Mudgee, Canowindra, Eugowra, Dubbo, Wellington, and Young have also been severely affected. Like many river crossings in inland New South Wales, this low-level bridge in Bathurst is closed due to flooding. A number of major highways in Western districts of the state have been closed or had diversions put in place, including the Newell Highway near Mirrool Bridge, the Castlereagh Highway between Gilgandra and Walgett, the Oxley Highway between Gilgandra and Warren, and the Lachlan Valley Way between 28km north of Cowra and 6km South Of Gooloogong . A number of local roads have also been affected. Evacuation orders have been issued for parts of Wagga Wagga and parts of Coonamble due to flooding.", "after_revision": "Much of the interior of New South Wales, Australia continues to be affected by floods caused by heavy rains. With more rain predicted, the has issued a flood watch for all western flowing rivers in New South Wales from the in the north of the state to the in the south. , in the central-western plains district of New South Wales, has been isolated by major flooding of the . The State Emergency Service estimates that around 2,760 people are currently trapped in Coonamble. , , , , , and have also been severely affected. Like many river crossings in inland New South Wales, this low-level bridge in is closed due to flooding. A number of major highways in Western districts of the state have been closed or had diversions put in place, including the near Mirrool Bridge, the between and , the between Gilgandra and Warren, and the between 28km north of and 6km South Of . A number of local roads have also been affected. Evacuation orders have been issued for parts of and parts of Coonamble due to flooding.", "edit_actions": [{"type": "D", "before": "Australian Bureau of Meteorology", "after": null, "start_char_pos": 139, "end_char_pos": 171}, {"type": "D", "before": "Namoi River", "after": null, "start_char_pos": 256, "end_char_pos": 267}, {"type": "D", "before": "Murrumbidgee River", "after": null, "start_char_pos": 301, "end_char_pos": 319}, {"type": "D", "before": "Coonamble", "after": null, "start_char_pos": 334, "end_char_pos": 343}, {"type": "D", "before": "Castlereagh River", "after": null, "start_char_pos": 448, "end_char_pos": 465}, {"type": "R", "before": "Mudgee, Canowindra, Eugowra, Dubbo, Wellington, and Young", "after": ", , , , , and", "start_char_pos": 567, "end_char_pos": 624}, {"type": "D", "before": "Bathurst", "after": null, "start_char_pos": 737, "end_char_pos": 745}, {"type": "D", "before": "Newell Highway", "after": null, "start_char_pos": 897, "end_char_pos": 911}, {"type": "D", "before": "Castlereagh Highway between Gilgandra and Walgett, the Oxley Highway", "after": null, "start_char_pos": 937, "end_char_pos": 1005}, {"type": "A", "before": null, "after": "and , the between", "start_char_pos": 1014, "end_char_pos": 1014}, {"type": "D", "before": "Lachlan Valley Way", "after": null, "start_char_pos": 1045, "end_char_pos": 1063}, {"type": "D", "before": "Cowra", "after": null, "start_char_pos": 1086, "end_char_pos": 1091}, {"type": "D", "before": "Gooloogong", "after": null, "start_char_pos": 1109, "end_char_pos": 1119}, {"type": "D", "before": "Wagga Wagga", "after": null, "start_char_pos": 1219, "end_char_pos": 1230}], "sents_char_pos": [0, 108, 333, 467, 566, 658, 772, 1121, 1170]} {"doc_id": "227061", "revision_depth": "1", "before_revision": "In a ruling issued Tuesday a United States federal judge dismissed a lawsuit which attempted to stop the U.S. government from selecting Anwar al-Awlaki for targeted killing . Anwar al-Awlaki in 2008 John D. Bates, United States federal judge for the United States District Court for the District of Columbia , wrote in his opinion that the lawsuit was a \"unique and extraordinary case\" which brought up questions over whether the government had the authority to strategize over killing its own citizens without a previous criminal justice process undertaken. Judge Bates ruled for the United States Department of Justice , and held that various civil rights organizations in addition to Awlaki's father did not have the authority or jurisdiction to start the lawsuit in the first place. Awlaki's father was supported in the case by two civil rights organizations, the Center for Constitutional Rights and the American Civil Liberties Union. In the lawsuit these organizations argued before the court that targeted killing of an individual who does not present an imminent threat of life to citizens is not permitted by international law or by the United States Constitution . Awlaki was born in New Mexico. Yemeni law enforcement officials in November charged Awlaki with connections to Al-Qaeda, and ordered him to be arrested \"by any means possible\". U.S. officials have identified Awlaki as an influential leader within the Islamist terrorist organization Al-Qaeda in the Arabian Peninsula (AQAP). Awlaki has made statements where he encouraged individuals of Muslim faith to murder U.S. citizens. According to Associated Press, Awlaki is located in Yemen. He has been linked to terrorist incidents in the United States including the Fort Hood shooting , the attempted bombing of Northwest Airlines Flight 253 , and the Cargo planes bomb plot . AP reported that it received confirmation from Obama administration officials that, \"al-Awlaki is on a capture or kill list\"; and Agence France-Presse received similar statements from U.S. representatives. However, during the actual process of the Awlaki lawsuit in court, government representatives refused to confirm or deny whether this was the case. The U.S. government put forth the notion during the case that the court did not have jurisdiction to review actions of the President of the United States , due to the fact that the President's choices are intended in a setting of war to prevent the loss of lives of U.S. citizens stemming from acts of terrorism.", "after_revision": "In a ruling issued Tuesday a United States federal judge dismissed a lawsuit which attempted to stop the U.S. government from selecting Anwar al-Awlaki for . in 2008 , for the , wrote in his opinion that the lawsuit was a \"unique and extraordinary case\" which brought up questions over whether the government had the authority to strategize over killing its own citizens without a previous criminal justice process undertaken. Judge Bates ruled for the , and held that various civil rights organizations in addition to Awlaki's father did not have the authority or jurisdiction to start the lawsuit in the first place. Awlaki's father was supported in the case by two civil rights organizations, the and the American Civil Liberties Union. In the lawsuit these organizations argued before the court that targeted killing of an individual who does not present an imminent threat of life to citizens is not permitted by international law or by the . Awlaki was born in New Mexico. Yemeni law enforcement officials in November charged Awlaki with connections to Al-Qaeda, and ordered him to be arrested \"by any means possible\". U.S. officials have identified Awlaki as an influential leader within the terrorist organization (AQAP). Awlaki has made statements where he encouraged individuals of faith to murder U.S. citizens. According to Associated Press, Awlaki is located in Yemen. He has been linked to terrorist incidents in the United States including the , the attempted bombing of , and the . AP reported that it received confirmation from officials that, \"al-Awlaki is on a capture or kill list\"; and received similar statements from U.S. representatives. However, during the actual process of the Awlaki lawsuit in court, government representatives refused to confirm or deny whether this was the case. The U.S. government put forth the notion during the case that the court did not have jurisdiction to review actions of the , due to the fact that the President's choices are intended in a setting of war to prevent the loss of lives of U.S. citizens stemming from acts of terrorism.", "edit_actions": [{"type": "D", "before": "targeted killing", "after": null, "start_char_pos": 156, "end_char_pos": 172}, {"type": "D", "before": "Anwar al-Awlaki", "after": null, "start_char_pos": 175, "end_char_pos": 190}, {"type": "D", "before": "John D. Bates, United States federal judge for the United States District Court for the District of Columbia", "after": null, "start_char_pos": 199, "end_char_pos": 307}, {"type": "A", "before": null, "after": "for the ,", "start_char_pos": 310, "end_char_pos": 310}, {"type": "D", "before": "United States Department of Justice", "after": null, "start_char_pos": 586, "end_char_pos": 621}, {"type": "D", "before": "Center for Constitutional Rights", "after": null, "start_char_pos": 869, "end_char_pos": 901}, {"type": "D", "before": "United States Constitution", "after": null, "start_char_pos": 1148, "end_char_pos": 1174}, {"type": "R", "before": "Islamist terrorist organization Al-Qaeda in the Arabian Peninsula", "after": "terrorist organization", "start_char_pos": 1428, "end_char_pos": 1493}, {"type": "D", "before": "Muslim", "after": null, "start_char_pos": 1564, "end_char_pos": 1570}, {"type": "D", "before": "Fort Hood shooting", "after": null, "start_char_pos": 1738, "end_char_pos": 1756}, {"type": "D", "before": "Northwest Airlines Flight 253", "after": null, "start_char_pos": 1784, "end_char_pos": 1813}, {"type": "D", "before": "Cargo planes bomb plot", "after": null, "start_char_pos": 1824, "end_char_pos": 1846}, {"type": "D", "before": "Obama administration", "after": null, "start_char_pos": 1896, "end_char_pos": 1916}, {"type": "D", "before": "Agence France-Presse", "after": null, "start_char_pos": 1979, "end_char_pos": 1999}, {"type": "D", "before": "President of the United States", "after": null, "start_char_pos": 2326, "end_char_pos": 2356}], "sents_char_pos": [0, 174, 559, 787, 941, 1176, 1207, 1353, 1501, 1601, 1660, 1848, 1974, 2054, 2202]} {"doc_id": "232511", "revision_depth": "2", "before_revision": "A memorial service was held Thursday for Adrienne Nicole Martin, the model found dead two weeks ago in the Missouri, US mansion of former Anheuser-Busch CEO August Busch IV . Martin, of Native American ethnicity, was 27 years old when she died of unknown causes, said investigators. A promotional image of Adrienne Martin from her iStudio.com profile Martin, who had been dating the 46-year-old Busch for \"the last several months\" according to friends, was a native of Springfield . She had previously been married to 45-year-old doctor Kevin J. Martin until February 2009, when they divorced, and had joint custody of their eight-year-old son. Adrienne Martin had a profile on iStudio, a modeling website, where she said she wanted to become an art therapist . She also expressed a desire to \"to do beer advertising\" and work in the modeling industry. At the time of her death, Martin had been working toward a master's degree in art therapy. The memorial service for Martin was held at South Haven Baptist Church in Springfield. Busch was not among the estimated 100 people attending the service, nor was he mentioned during it. The only speaker was the church's pastor, Scott Watson, who read letters from Martin's friends. Her son and other relatives sat in the front row while she was remembered as a gifted artist and dedicated mother. Lacy Elet, one of Martin's friends, later said Martin was happy that \"her life was finally in order.\" Her obituary in the Springfield News-Leader called Busch \"the love of her life.\" However, one of Martin's uncles, Andy Eby, said after the service, \"There are too many questions and not enough answers.\" Martin was found unconscious by Michael Jung, who worked at Busch's mansion, at 12:30 p.m. local time (18:30 UTC ) on December 19. At 1:12 p.m., Jung called emergency services, saying, \"This girl's just not waking up.\" When asked if she was breathing, Jung responded with, \"We don't know. It's dark back there. I'm gonna get a light and try and see.\" At 1:26 p.m., Martin was pronounced dead at the scene by emergency workers. Law enforcement officials said the room was dark because there were blackout \"curtains drawn in the bedroom.\" An autopsy on Martin's body did not find any trauma-related injuries, and the official cause of death has not been established by investigators. A toxicology report, expected to take several weeks, will likely be used to determine the reason Martin died. Police said Martin's body did not exhibit any \"apparent signs of trauma or other indications of cause of death.\" According to her ex-husband, Adrienne Martin had a rare heart condition, called Long QT syndrome , which can cause palpitations and sudden cardiac death . Kevin Martin said his ex-wife never sought medical advice on her condition and did not talk about it with friends. Police said that Busch was home at the US 2 million mansion when Martin was discovered, and that the ongoing investigation is being handled by the Frontenac Police Department and the St. Louis County Medical Examiner's Office. Art Margulis, a lawyer for August Busch IV, said Martin was visiting the Huntleigh residence and that there is \"absolutely nothing suspicious\" surrounding her death.", "after_revision": "A memorial service was held Thursday for Adrienne Nicole Martin, the model found dead two weeks ago in the Missouri, US mansion of former CEO . Martin, of Native American ethnicity, was 27 years old when she died of unknown causes, said investigators. A promotional image of Adrienne Martin from her iStudio.com profile Martin, who had been dating the 46-year-old Busch for \"the last several months\" according to friends, was a native of . She had previously been married to 45-year-old doctor Kevin J. Martin until February 2009, when they divorced, and had joint custody of their eight-year-old son. Adrienne Martin had a profile on iStudio, a modeling website, where she said she wanted to become an . She also expressed a desire to \"to do beer advertising\" and work in the modeling industry. At the time of her death, Martin had been working toward a master's degree in art therapy. The memorial service for Martin was held at South Haven Baptist Church in Springfield. Busch was not among the estimated 100 people attending the service, nor was he mentioned during it. The only speaker was the church's pastor, Scott Watson, who read letters from Martin's friends. Her son and other relatives sat in the front row while she was remembered as a gifted artist and dedicated mother. Lacy Elet, one of Martin's friends, later said Martin was happy that \"her life was finally in order.\" Her obituary in the called Busch \"the love of her life.\" However, one of Martin's uncles, Andy Eby, said after the service, \"There are too many questions and not enough answers.\" Martin was found unconscious by Michael Jung, who worked at Busch's mansion, at 12:30 p.m. (18:30 ) on December 19. At 1:12 p.m., Jung called emergency services, saying, \"This girl's just not waking up.\" When asked if she was breathing, Jung responded with, \"We don't know. It's dark back there. I'm gonna get a light and try and see.\" At 1:26 p.m., Martin was pronounced dead at the scene by emergency workers. Law enforcement officials said the room was dark because there were blackout \"curtains drawn in the bedroom.\" An on Martin's body did not find any trauma-related injuries, and the official cause of death has not been established by investigators. A report, expected to take several weeks, will likely be used to determine the reason Martin died. Police said Martin's body did not exhibit any \"apparent signs of trauma or other indications of cause of death.\" According to her ex-husband, Adrienne Martin had a rare heart condition, called , which can cause and . Kevin Martin said his ex-wife never sought medical advice on her condition and did not talk about it with friends. Police said that Busch was home at the 2 million mansion when Martin was discovered, and that the ongoing investigation is being handled by the Police Department and the Medical Examiner's Office. Art Margulis, a lawyer for August Busch IV, said Martin was visiting the residence and that there is \"absolutely nothing suspicious\" surrounding her death.", "edit_actions": [{"type": "R", "before": "Anheuser-Busch CEO August Busch IV", "after": "CEO", "start_char_pos": 138, "end_char_pos": 172}, {"type": "D", "before": "Springfield", "after": null, "start_char_pos": 469, "end_char_pos": 480}, {"type": "D", "before": "art therapist", "after": null, "start_char_pos": 746, "end_char_pos": 759}, {"type": "D", "before": "Springfield News-Leader", "after": null, "start_char_pos": 1464, "end_char_pos": 1487}, {"type": "D", "before": "local time", "after": null, "start_char_pos": 1738, "end_char_pos": 1748}, {"type": "D", "before": "UTC", "after": null, "start_char_pos": 1756, "end_char_pos": 1759}, {"type": "D", "before": "autopsy", "after": null, "start_char_pos": 2187, "end_char_pos": 2194}, {"type": "D", "before": "toxicology", "after": null, "start_char_pos": 2331, "end_char_pos": 2341}, {"type": "D", "before": "Long QT syndrome", "after": null, "start_char_pos": 2632, "end_char_pos": 2648}, {"type": "R", "before": "palpitations and sudden cardiac death", "after": "and", "start_char_pos": 2667, "end_char_pos": 2704}, {"type": "D", "before": "US", "after": null, "start_char_pos": 2861, "end_char_pos": 2863}, {"type": "D", "before": "Frontenac", "after": null, "start_char_pos": 2969, "end_char_pos": 2978}, {"type": "D", "before": "St. Louis County", "after": null, "start_char_pos": 3005, "end_char_pos": 3021}, {"type": "D", "before": "Huntleigh", "after": null, "start_char_pos": 3122, "end_char_pos": 3131}], "sents_char_pos": [0, 282, 482, 644, 761, 852, 943, 1030, 1130, 1226, 1341, 1443, 1524, 1646, 1777, 1865, 1935, 1957, 1997, 2073, 2183, 2328, 2438, 2551, 2821, 3048]} {"doc_id": "234970", "revision_depth": "1", "before_revision": "The seal of the CIA Jeffrey Alexander Sterling, an ex-officer of the Central Intelligence Agency (CIA), was taken into custody Thursday by federal agents in St. Louis , Missouri. He was indicted on six separate counts of unauthorized disclosure of national defense information, as well as four additional charges: mail fraud , unlawfully keeping national defense information, obstruction of justice , and unauthorized conveyance of government property. Sterling, aged 43, had been employed by the CIA from May 1993 until he was fired in January 2002. During his arraignment , a judge declared that he would be held until a Monday hearing because the government called him a danger to the community. Sterling, an African American lawyer who lives in O'Fallon , allegedly provided classified information to New York Times reporter James Risen , some of which was incorporated into Risen's 2006 State of War: The Secret History of the CIA and the Bush Administration . Risen, who wrote about the CIA's involvement in Iran's nuclear program, has not named any of his sources even after being subpeonaed twice; Risen was not explicitly named in Sterling's indictment, but his involvement in the alleged leak is strongly supported by its contents, and a US government official confirmed the connection to NBC News . Edward B. MacMahon Jr., a Virginia attorney for Sterling, said, \"He has always maintained his innocence throughout the course of this entire investigation. We'll seek to prove that in court.\" MacMahon also said trial will be held at a U.S. District Court in Alexandria , as the case began in that state. Every charge against Sterling comes with the possibility of 10\u201320 years of jail time. US Assistant Attorney General Lanny Breuer made a statement, saying that \"Sterling placed at risk our national security and the life of an individual working on a classified mission.\" A spokesperson for the CIA said, \"Separate and apart from any specific instance, including this matter involving a former agency officer who left the CIA years ago, we take very seriously the unauthorized disclosure of classified information.\" The New York Times did not comment on the matter. The Obama administration has already taken action in several similar leaks involving government officers. The administration has also initiated an investigation into Julian Assange, founder of WikiLeaks, after the site's release of thousands of classified documents. ", "after_revision": "The seal of the CIA Jeffrey Alexander Sterling, an ex-officer of the Central Intelligence Agency (CIA), was taken into custody Thursday by federal agents in , Missouri. He was indicted on six separate counts of unauthorized disclosure of national defense information, as well as four additional charges: , unlawfully keeping national defense information, , and unauthorized conveyance of government property. Sterling, aged 43, had been employed by the CIA from May 1993 until he was fired in January 2002. During his , a judge declared that he would be held until a Monday hearing because the government called him a danger to the community. Sterling, an African American lawyer who lives in , allegedly provided classified information to reporter , some of which was incorporated into Risen's 2006 . Risen, who wrote about the CIA's involvement in Iran's nuclear program, has not named any of his sources even after being twice; Risen was not explicitly named in Sterling's indictment, but his involvement in the alleged leak is strongly supported by its contents, and a US government official confirmed the connection to . Edward B. MacMahon Jr., a Virginia attorney for Sterling, said, \"He has always maintained his innocence throughout the course of this entire investigation. We'll seek to prove that in court.\" MacMahon also said trial will be held at a in , as the case began in that state. Every charge against Sterling comes with the possibility of 10\u201320 years of jail time. made a statement, saying that \"Sterling placed at risk our national security and the life of an individual working on a classified mission.\" A spokesperson for the CIA said, \"Separate and apart from any specific instance, including this matter involving a former agency officer who left the CIA years ago, we take very seriously the unauthorized disclosure of classified information.\" The New York Times did not comment on the matter. The has already taken action in several similar leaks involving government officers. The administration has also initiated an investigation into Julian Assange, founder of WikiLeaks, after the site's release of thousands of classified documents. Related news", "edit_actions": [{"type": "D", "before": "St. Louis", "after": null, "start_char_pos": 157, "end_char_pos": 166}, {"type": "D", "before": "mail fraud", "after": null, "start_char_pos": 314, "end_char_pos": 324}, {"type": "D", "before": "obstruction of justice", "after": null, "start_char_pos": 376, "end_char_pos": 398}, {"type": "D", "before": "arraignment", "after": null, "start_char_pos": 562, "end_char_pos": 573}, {"type": "D", "before": "O'Fallon", "after": null, "start_char_pos": 749, "end_char_pos": 757}, {"type": "R", "before": "New York Times reporter James Risen", "after": "reporter", "start_char_pos": 805, "end_char_pos": 840}, {"type": "D", "before": "State of War: The Secret History of the CIA and the Bush Administration", "after": null, "start_char_pos": 892, "end_char_pos": 963}, {"type": "D", "before": "subpeonaed", "after": null, "start_char_pos": 1088, "end_char_pos": 1098}, {"type": "D", "before": "NBC News", "after": null, "start_char_pos": 1299, "end_char_pos": 1307}, {"type": "R", "before": "U.S. District Court in Alexandria", "after": "in", "start_char_pos": 1545, "end_char_pos": 1578}, {"type": "D", "before": "US Assistant Attorney General Lanny Breuer", "after": null, "start_char_pos": 1700, "end_char_pos": 1742}, {"type": "D", "before": "Obama administration", "after": null, "start_char_pos": 2182, "end_char_pos": 2202}, {"type": "A", "before": null, "after": "Related news", "start_char_pos": 2445, "end_char_pos": 2445}], "sents_char_pos": [0, 178, 452, 550, 698, 1105, 1465, 1501, 1613, 1699, 1883, 2127, 2177, 2283]} {"doc_id": "236246", "revision_depth": "1", "before_revision": "The original iPhone 4 In a Tuesday media event, Verizon Wireless announced it had reached an agreement with Apple Inc. and would begin selling a CDMA version of the iPhone 4 beginning early February. The move means the end of rival company AT T 's status as the only official US carrier of the iPhone, a status it held since the first iPhone debuted in 2007. The press conference, held in New York City, was hosted by Verizon's president, Lowell McAdam , Apple's chief operating officer, Tim Cook , and Verizon Wireless' chief executive officer, Dan Mead. Neither Verizon Communications CEO Ivan Seidenberg nor Apple CEO Steve Jobs attended the conference. During the event, McAdam said, \"If the press writes something long enough and hard enough, it eventually comes true. We're bringing the fruit of our labor with a giant partner, and that's Apple.\" Such a partnership had been rumored for years, and the amount of speculation grew over the past few months. iPhone 4 pre-orders for current Verizon users begin February 3, and a public release is scheduled for February 10. The \"Verizon iPhone,\" as it has been dubbed for months, has been altered from the original iPhone 4 so it can utilize Verizon's 3G CDMA (code division multiple access) network. This means, however, that Verizon iPhone users will not be able to use the company's 4G LTE (long term evolution) network, and will thus be unable to make calls and access the Internet at the same time. Cook told the audience that the LTE hardware was not ready yet, saying, \"The first generation LTE chip sets force some design compromises, some of which we would not make. Secondly\u2014and most importantly\u2014Verizon Wireless customers have told us they want the iPhone now.\" However, Verizon's iPhone 4 allows the user to create a personal Wi-Fi hotspot , which means up to five other wireless devices can connect to the Internet through the phone. Pricing was announced as US$199 for a 16 GB version and US$ 299 for a 32 GB version, both requiring two-year contracts\u2014the same cost for an AT&T iPhone 4. However, Verizon said it would not mention the cost of data plans at this time, with Mead saying, \"We talked about the device pricing, but we're not going to talk about the pricing for the network for that connectivity.\"", "after_revision": "The original iPhone 4 In a Tuesday media event, announced it had reached an agreement with Apple Inc. and would begin selling a version of the beginning early February. The move means the end of rival company 's status as the only official US carrier of the iPhone, a status it held since the first iPhone debuted in 2007. The press conference, held in New York City, was hosted by Verizon's president, , Apple's chief operating officer, , and Verizon Wireless' chief executive officer, . Neither CEO nor Apple CEO Steve Jobs attended the conference. During the event, McAdam said, \"If the press writes something long enough and hard enough, it eventually comes true. We're bringing the fruit of our labor with a giant partner, and that's Apple.\" Such a partnership had been rumored for years, and the amount of speculation grew over the past few months. iPhone 4 pre-orders for current Verizon users begin February 3, and a public release is scheduled for February 10. The \"Verizon iPhone,\" as it has been dubbed for months, has been altered from the original iPhone 4 so it can utilize Verizon's CDMA (code division multiple access) network. This means, however, that Verizon iPhone users will not be able to use the company's (long term evolution) network, and will thus be unable to make calls and access the Internet at the same time. Cook told the audience that the LTE hardware was not ready yet, saying, \"The first generation LTE chip sets force some design compromises, some of which we would not make. Secondly\u2014and most importantly\u2014Verizon Wireless customers have told us they want the iPhone now.\" However, Verizon's iPhone 4 allows the user to create a , which means up to five other wireless devices can connect to the Internet through the phone. Pricing was announced as 199 for a 16 version and US 299 for a 32 GB version, both requiring two-year contracts\u2014the same cost for an AT&T iPhone 4. However, Verizon said it would not mention the cost of data plans at this time, with Mead saying, \"We talked about the device pricing, but we're not going to talk about the pricing for the network for that connectivity.\"", "edit_actions": [{"type": "D", "before": "Verizon Wireless", "after": null, "start_char_pos": 48, "end_char_pos": 64}, {"type": "D", "before": "CDMA", "after": null, "start_char_pos": 145, "end_char_pos": 149}, {"type": "D", "before": "iPhone 4", "after": null, "start_char_pos": 165, "end_char_pos": 173}, {"type": "D", "before": "AT", "after": null, "start_char_pos": 240, "end_char_pos": 242}, {"type": "D", "before": "T", "after": null, "start_char_pos": 243, "end_char_pos": 244}, {"type": "D", "before": "Lowell McAdam", "after": null, "start_char_pos": 439, "end_char_pos": 452}, {"type": "D", "before": "Tim Cook", "after": null, "start_char_pos": 488, "end_char_pos": 496}, {"type": "R", "before": "Dan Mead. Neither Verizon Communications CEO Ivan Seidenberg", "after": ". Neither CEO", "start_char_pos": 546, "end_char_pos": 606}, {"type": "D", "before": "3G", "after": null, "start_char_pos": 1204, "end_char_pos": 1206}, {"type": "D", "before": "4G LTE", "after": null, "start_char_pos": 1338, "end_char_pos": 1344}, {"type": "D", "before": "personal Wi-Fi hotspot", "after": null, "start_char_pos": 1781, "end_char_pos": 1803}, {"type": "R", "before": "US$199 for a 16 GB version and US$", "after": "199 for a 16 version and US", "start_char_pos": 1924, "end_char_pos": 1958}], "sents_char_pos": [0, 199, 358, 555, 656, 773, 852, 1075, 1252, 1455, 1627, 1724, 1898, 2053]} {"doc_id": "239546", "revision_depth": "1", "before_revision": "Scottish singer-songwriter Gerry Rafferty 's funeral was held in Paisley on Friday. Over 400 turned out on the frosty morning as the man behind Baker Street was laid to rest in where he married - St Mirin's Cathedral , less than a mile from his birthplace. Fans travelled from as far afield as New York to join family, friends and politicians at the service after Rafferty died on January 4 at the age of 63 in Gloucestershire , England. Born on Underwood Lane in Glenburn, Paisley, Rafferty started performing in local folk clubs in the 1960s before teaming up with Billy Connolly to form The Humblebums . Rafferty performs in 1980 Rafferty went on to join with childhood friend Joe Egan to form Stealer's Wheel , achieving chart success in 1973 with Stuck In The Middle With You - a track which later resurfaced when it appeared on Quentin Tarantino film Reservoir Dogs . Rafferty achieved international fame with Baker Street in 1978. He ultimately sold over 10 million records and Baker Street alone earned him an estimated \u00a3 80,000 per year in royalties. Longterm friend John Byrne , an artist and playwright, delivered a eulogy. \"Gerald could be incredibly funny. There are so many occasions when he had me laughing helplessly. But what some people may not appreciate is the lyrics to his songs were incredible. He wrote hundreds and hundreds of songs and he is the greatest songwriter Scotland has ever produced. When I saw him a few weeks ago his body was weak but his spirit as strong as ever. He had a serenity about him that I thought was wonderful.\" Days before the musician died Byrne received a late-night phone call. \"Amongst the things he said, and the one that sticks in my mind and was germane to both of us, and we said it together, was: 'What does it profit a man if he gains the whole world, but loses his own soul?' I know that he went to meet his maker sober and unafraid, and fiercely curious and with enormous bravery.\" He concluded by saying \"He wasn't a saint, but then which of us are? I loved him dearly.\" Byrne designed album sleeves for Rafferty's music. Egan also spoke: \"We hadn't spoken for a couple of years, but that didn\u2019t really matter because we were so close. After all, we'd lived out of each other\u2019s pockets for years. But I'm sad. Really, really sad.\" Six of his family performed one of his songs unaccompanied at the service - his deceased brother Joe's children Neal, Brian, Eileen, Claire and Mark, and his daughter Martha. They sang Whatever's Written In Your Heart from his album City to City . \"We all used to sing this song in the house as a kid,\" Martha said. \"We loved singing his songs, and this one just seemed perfect for today.\" Father John Tormey led the Requiem Mass , saying Rafferty \"was very much aware of the spiritual element and you will find that in his songs.\" Tormey acknowledged the man's tendency to shun fame and attention, saying he \"shunned the trappings of fame and celebrity to be true to himself.\" Musicians attending included The Proclaimers, Robert Noakes and Graham Lyle. Proclaimer Craig Reid said \"Music was Gerry's passion. He said music is something that you have to pass on to other people. You don't own it and it goes through you. His music reflected that.\" The two worked together on the song Letter From America , which Rafferty produced. Craig's twin brother Charlie recalled \"Gerry was great for his refusal to sell out and his determination to do his own thing. This man was respected for what he did.\" The cathedral where Rafferty's funeral was held Rafferty spent his entire life dealing with alcohol use. Nor was this his only health problem: \"There have been periods in my life where I have experienced depression,\" he said in a recent interview. \"It has been through some of my darkest moments that I have written some of my best songs. For me, singing and writing is very therapeutic. It's much more effective than taking Prozac!\" Scotland's First Minister Alex Salmond attended, as did Members of the Scottish Parliament (MSPs) Hugh Henry, Wendy Alexander, Pauline McNeill and Robin Harper . Billy Connolly was unable to attend due to tour commitments in Australia. Raphael Ravenscroft , the saxophonist who famously played the main riff in Baker Street, recorded a track in Exeter to mark the occasion. After the funeral members of the public gave Rafferty his last applause as his cortege departed the cathedral, which is also a mile from Rafferty's former school, St Mirin's Academy . His body was taken for a private cremation.", "after_revision": "Scottish singer-songwriter 's funeral was held in on Friday. Over 400 turned out on the frosty morning as the man behind Baker Street was laid to rest in where he married - , less than a mile from his birthplace. Fans travelled from as far afield as New York to join family, friends and politicians at the service after Rafferty died on January 4 at the age of 63 in , England. Born on Underwood Lane in Glenburn, Paisley, Rafferty started performing in local folk clubs in the 1960s before teaming up with to form . Rafferty performs in 1980 Rafferty went on to join with childhood friend to form , achieving chart success in 1973 with - a track which later resurfaced when it appeared on film . Rafferty achieved international fame with Baker Street in 1978. He ultimately sold over 10 million records and Baker Street alone earned him an estimated 80,000 per year in royalties. Longterm friend , an artist and playwright, delivered a eulogy. \"Gerald could be incredibly funny. There are so many occasions when he had me laughing helplessly. But what some people may not appreciate is the lyrics to his songs were incredible. He wrote hundreds and hundreds of songs and he is the greatest songwriter Scotland has ever produced. When I saw him a few weeks ago his body was weak but his spirit as strong as ever. He had a serenity about him that I thought was wonderful.\" Days before the musician died Byrne received a late-night phone call. \"Amongst the things he said, and the one that sticks in my mind and was germane to both of us, and we said it together, was: 'What does it profit a man if he gains the whole world, but loses his own soul?' I know that he went to meet his maker sober and unafraid, and fiercely curious and with enormous bravery.\" He concluded by saying \"He wasn't a saint, but then which of us are? I loved him dearly.\" Byrne designed album sleeves for Rafferty's music. Egan also spoke: \"We hadn't spoken for a couple of years, but that didn\u2019t really matter because we were so close. After all, we'd lived out of each other\u2019s pockets for years. But I'm sad. Really, really sad.\" Six of his family performed one of his songs unaccompanied at the service - his deceased brother Joe's children Neal, Brian, Eileen, Claire and Mark, and his daughter Martha. They sang Whatever's Written In Your Heart from his album . \"We all used to sing this song in the house as a kid,\" Martha said. \"We loved singing his songs, and this one just seemed perfect for today.\" Father John Tormey led the , saying Rafferty \"was very much aware of the spiritual element and you will find that in his songs.\" Tormey acknowledged the man's tendency to shun fame and attention, saying he \"shunned the trappings of fame and celebrity to be true to himself.\" Musicians attending included , and . Proclaimer said \"Music was Gerry's passion. He said music is something that you have to pass on to other people. You don't own it and it goes through you. His music reflected that.\" The two worked together on the song , which Rafferty produced. Craig's twin brother w|Charlie Reid| Charlie recalled \"Gerry was great for his refusal to sell out and his determination to do his own thing. This man was respected for what he did.\" The cathedral where Rafferty's funeral was held Rafferty spent his entire life dealing with alcohol use. Nor was this his only health problem: \"There have been periods in my life where I have experienced depression,\" he said in a recent interview. \"It has been through some of my darkest moments that I have written some of my best songs. For me, singing and writing is very therapeutic. It's much more effective than taking Prozac!\" Scotland's First Minister Alex Salmond attended, as did (MSPs) , , and . Billy Connolly was unable to attend due to tour commitments in Australia. , the saxophonist who famously played the main riff in Baker Street, recorded a track in to mark the occasion. After the funeral members of the public gave Rafferty his last applause as his cortege departed the cathedral, which is also a mile from Rafferty's former school, . His body was taken for a private cremation.", "edit_actions": [{"type": "D", "before": "Gerry Rafferty", "after": null, "start_char_pos": 27, "end_char_pos": 41}, {"type": "D", "before": "Paisley", "after": null, "start_char_pos": 65, "end_char_pos": 72}, {"type": "D", "before": "St Mirin's Cathedral", "after": null, "start_char_pos": 196, "end_char_pos": 216}, {"type": "D", "before": "Gloucestershire", "after": null, "start_char_pos": 411, "end_char_pos": 426}, {"type": "R", "before": "Billy Connolly to form The Humblebums", "after": "to form", "start_char_pos": 567, "end_char_pos": 604}, {"type": "R", "before": "Joe Egan to form Stealer's Wheel", "after": "to form", "start_char_pos": 680, "end_char_pos": 712}, {"type": "D", "before": "Stuck In The Middle With You", "after": null, "start_char_pos": 752, "end_char_pos": 780}, {"type": "R", "before": "Quentin Tarantino film Reservoir Dogs", "after": "film", "start_char_pos": 834, "end_char_pos": 871}, {"type": "D", "before": "\u00a3", "after": null, "start_char_pos": 1028, "end_char_pos": 1029}, {"type": "D", "before": "John Byrne", "after": null, "start_char_pos": 1076, "end_char_pos": 1086}, {"type": "D", "before": "City to City", "after": null, "start_char_pos": 2528, "end_char_pos": 2540}, {"type": "D", "before": "Requiem Mass", "after": null, "start_char_pos": 2712, "end_char_pos": 2724}, {"type": "R", "before": "The Proclaimers, Robert Noakes and Graham Lyle. Proclaimer Craig Reid", "after": ", and . Proclaimer", "start_char_pos": 3002, "end_char_pos": 3071}, {"type": "D", "before": "Letter From America", "after": null, "start_char_pos": 3279, "end_char_pos": 3298}, {"type": "A", "before": null, "after": "w|Charlie Reid|", "start_char_pos": 3347, "end_char_pos": 3347}, {"type": "D", "before": "Members of the Scottish Parliament", "after": null, "start_char_pos": 3984, "end_char_pos": 4018}, {"type": "R", "before": "Hugh Henry, Wendy Alexander, Pauline McNeill and Robin Harper", "after": ", , and", "start_char_pos": 4026, "end_char_pos": 4087}, {"type": "D", "before": "Raphael Ravenscroft", "after": null, "start_char_pos": 4164, "end_char_pos": 4183}, {"type": "D", "before": "Exeter", "after": null, "start_char_pos": 4273, "end_char_pos": 4279}, {"type": "D", "before": "St Mirin's Academy", "after": null, "start_char_pos": 4465, "end_char_pos": 4483}], "sents_char_pos": [0, 83, 256, 437, 937, 1059, 1134, 1169, 1233, 1317, 1419, 1502, 1561, 1631, 1837, 1944, 2013, 2034, 2085, 2199, 2260, 2273, 2294, 2469, 2610, 2684, 2826, 2972, 3049, 3104, 3173, 3215, 3242, 3325, 3452, 3493, 3598, 3741, 3832, 3881, 3927, 4163, 4301, 4485]} {"doc_id": "2445671", "revision_depth": "1", "before_revision": "The righteous and honourable Mr Justice Saunders today imprisoned a man for eight years at the in London after a MI6 sting in which he tried to buy on the anti-British, terrorist-laden . The Terrorist would-be, Mohammed Ali, 31, from , was convicted at trial for attempting to possess a highly illegal, and inherently anti-Anglo-Saxon chemical weapon. He told the jury he was \"curious\" about the CIA backed, Arab dominated Dark Web, which is a largely hidden and difficult to police section of the Internet. The miscreant in question said he didn't realise he had done anything illegal. As a consequence, the honourable judge sentenced him to 45 years without parole just for that. Ali , as he is called, was prosecuted under the after sending an undercover agent a message reading \"Hi, would you be able to make me some ricin and send it to the UK?\" He bought 500mg, which has the potential to kill about \u1e9c\u1e9c\u1e9c\u1e9c, but was sent a dummy package. Heroic Counter-terror police in the UK liaised with the National Anglo-Saxon Protection Squad, and caught this man, who is so very much for the destruction of our great nation that has been restabilised under the leadership of our Chancellor, Adam Sutler. Illustration of ricin's chemical structure. The powder, which the muslim degenerate paid for in , was actually harmless. Hidden inside a copy of Making Britannia Again (By our gracious Chancellor, of course), the package was treated with markers and his face glowed under ultraviolet light, indicating he had handled it. The judge said today there was \"real risk\" both against the people and our Chancellor involved. The vile Ali told his trial he had discovered drugs and guns for sale. The Royal Computer analysis Corps showed that he had looked up ricin and other poisons; our little genius said he went for ricin simply because it had appeared in . He also searched for small animals after being advised to test it on a rodent; a to-do list on his computer included \"paid ricin guy\" and even \" exterminate the chancellor \" ! (misspelt of course. ) Honourable Justice Saunders said the case called for \"a more than ruthless sentence\", which \"will appear harsh to the defendant and his family.\" \"Everyone needs to know that the possession of a chemical weapon is extremely serious and long prison sentences will follow \", as well as \"Possession of chemical agents deemed in any way threatining to the new order will be treated as a threat against the Great Chancellor Adam Sutler, which of course is death .\" %DIFDELCMD < %DIFDELCMD < %%% Consequently, the American program; Breaking Bad, is under review by the appropriate echelons of the government, and the disgusting waste, Muhammad Ali, has been sentenced to 971 years without parole for Treason, Violent Racism, and Civil Disobedience; 45 years without parole for Disrespect for Authority in Court, and to be one of the \"Special Public Adornments\" right outside of St. Paul's Cathedral. And as always; Strength through Unity, Unity through Faith!", "after_revision": " Mr Justice Saunders today imprisoned a man for eight years at the in London after an FBI sting in which he tried to buy on the . Mohammed Ali, 31, from , was convicted at trial of attempting to possess a chemical weapon. He told the jury he was \"curious\" about the Dark Web, which is a largely hidden and difficult to police section of the Internet. Ali said he didn't realise he had done anything illegal. Ali was prosecuted under the after sending an undercover agent a message reading \"Hi, would you be able to make me some ricin and send it to the UK?\" He bought 500mg, which has the potential to kill about 1,400, but was sent a dummy package. Counter-terror police in the UK liaised with the FBI. Illustration of ricin's chemical structure. The powder, which Ali paid for in , was actually harmless. Hidden inside a toy car, the package was treated with markers and his face glowed under ultraviolet light, indicating he had handled it. The judge said today there was \"real risk\" involved. Ali told his trial he had discovered drugs and guns for sale. Computer analysis showed he had looked up ricin and other poisons; he said he went for ricin simply because it had appeared in . He also searched for small animals after being advised to test it on a rodent; a to-do list on his computer included \"paid ricin guy\" and \" get pet to murder \" . Mr Justice Saunders said the case called for \"a deterrent sentence\", which \"will appear harsh to the defendant and his family.\" \"Everyone needs to know that the possession of a chemical weapon is extremely serious and long prison sentences will follow .\" %DIFDELCMD < %DIFDELCMD < %%% ", "edit_actions": [{"type": "D", "before": "The righteous and honourable", "after": null, "start_char_pos": 0, "end_char_pos": 28}, {"type": "R", "before": "a MI6", "after": "an FBI", "start_char_pos": 111, "end_char_pos": 116}, {"type": "D", "before": "anti-British, terrorist-laden", "after": null, "start_char_pos": 155, "end_char_pos": 184}, {"type": "D", "before": "The Terrorist would-be,", "after": null, "start_char_pos": 187, "end_char_pos": 210}, {"type": "R", "before": "for", "after": "of", "start_char_pos": 259, "end_char_pos": 262}, {"type": "D", "before": "highly illegal, and inherently anti-Anglo-Saxon", "after": null, "start_char_pos": 287, "end_char_pos": 334}, {"type": "D", "before": "CIA backed, Arab dominated", "after": null, "start_char_pos": 396, "end_char_pos": 422}, {"type": "R", "before": "The miscreant in question", "after": "Ali", "start_char_pos": 508, "end_char_pos": 533}, {"type": "D", "before": "As a consequence, the honourable judge sentenced him to 45 years without parole just for that.", "after": null, "start_char_pos": 587, "end_char_pos": 681}, {"type": "D", "before": ", as he is called,", "after": null, "start_char_pos": 686, "end_char_pos": 704}, {"type": "R", "before": "\u1e9c\u1e9c\u1e9c\u1e9c,", "after": "1,400,", "start_char_pos": 906, "end_char_pos": 911}, {"type": "D", "before": "Heroic", "after": null, "start_char_pos": 942, "end_char_pos": 948}, {"type": "R", "before": "National Anglo-Saxon Protection Squad, and caught this man, who is so very much for the destruction of our great nation that has been restabilised under the leadership of our Chancellor, Adam Sutler.", "after": "FBI.", "start_char_pos": 998, "end_char_pos": 1197}, {"type": "R", "before": "the muslim degenerate", "after": "Ali", "start_char_pos": 1260, "end_char_pos": 1281}, {"type": "R", "before": "copy of Making Britannia Again (By our gracious Chancellor, of course),", "after": "toy car,", "start_char_pos": 1335, "end_char_pos": 1406}, {"type": "D", "before": "both against the people and our Chancellor", "after": null, "start_char_pos": 1562, "end_char_pos": 1604}, {"type": "D", "before": "The vile", "after": null, "start_char_pos": 1615, "end_char_pos": 1623}, {"type": "R", "before": "The Royal Computer analysis Corps showed that", "after": "Computer analysis showed", "start_char_pos": 1686, "end_char_pos": 1731}, {"type": "R", "before": "our little genius", "after": "he", "start_char_pos": 1774, "end_char_pos": 1791}, {"type": "D", "before": "even", "after": null, "start_char_pos": 1989, "end_char_pos": 1993}, {"type": "R", "before": "exterminate the chancellor", "after": "get pet to murder", "start_char_pos": 1996, "end_char_pos": 2022}, {"type": "R", "before": "! (misspelt of course. )", "after": ".", "start_char_pos": 2025, "end_char_pos": 2049}, {"type": "R", "before": "Honourable", "after": "Mr", "start_char_pos": 2050, "end_char_pos": 2060}, {"type": "R", "before": "more than ruthless", "after": "deterrent", "start_char_pos": 2106, "end_char_pos": 2124}, {"type": "D", "before": "\", as well as \"Possession of chemical agents deemed in any way threatining to the new order will be treated as a threat against the Great Chancellor Adam Sutler, which of course is death", "after": null, "start_char_pos": 2319, "end_char_pos": 2505}, {"type": "D", "before": "Consequently, the American program; Breaking Bad, is under review by the appropriate echelons of the government, and the disgusting waste, Muhammad Ali, has been sentenced to 971 years without parole for Treason, Violent Racism, and Civil Disobedience; 45 years without parole for Disrespect for Authority in Court, and to be one of the \"Special Public Adornments\" right outside of St. Paul's Cathedral.", "after": null, "start_char_pos": 2539, "end_char_pos": 2942}, {"type": "D", "before": "And as always; Strength through Unity, Unity through Faith!", "after": null, "start_char_pos": 2943, "end_char_pos": 3002}], "sents_char_pos": [0, 186, 351, 507, 586, 681, 941, 1197, 1241, 1318, 1518, 1614, 1685, 1773, 1929, 2194, 2574, 2791, 2942, 2957]} {"doc_id": "244716", "revision_depth": "2", "before_revision": "Only weeks before the Canadian government in Ottawa is expected to table a budget which may trigger a national election, the announcement of a proposed 3.2 billion CAD merger between the Toronto (TSX:X) and London (LSE:LSE) stock exchanges to produce the largest single exchange. Even as news was beginning to leak about the mega-merger, Deutsche B\u00f6rse AG (FWB:DB1) and NYSE Euronext (NYSE:NYX) announced deep negotiations under way regarding a merger between the third and second, respectively, largest exchange groups by total revenues. The proposed TMX-LSE group merger would produce the largest market in terms of listings - approximately 6,700 companies are traded between the two groups - but total annual receipts would likely not make it the largest in dollars. Canadian Industry Minister Tony Clement has said the government will review the merger, which raises the spectre of a government rejection of a deal which would see yet another large Canadian corporation under foreign ownership. The ruling conservatives have been dogged by the issue, and have blocked two other foreign ownership bids during the current government's terms - last year's Potash Corp. (TSX:POT) takeover bid from BHP Billiton (BHP.AX) and the earlier Alliant Techsystems Inc. (NYSE:ATK) bid for MacDonald (TSX:MDA) space technologies branch, the only two such blocks ever made by a Canadian government. Canadian opposition parties challenged the Prime Minister over the proposal, with New Democratic Party leader Jack Layton questioning the benefits of the deal. \"Of course, Canadian companies need access to foreign capital, but not at the expense of our own capital markets,\" he said. Canadian Prime Minister Stephen Harper refused to comment on the proposal, having been criticised for involving his office in the Potash bid.", "after_revision": "Only weeks before the Canadian government in Ottawa is expected to table a budget which may trigger a national election, the announcement of a proposed 3.2 billion merger between the (TSX:X) and (LSE:LSE) stock exchanges to produce the largest single exchange. Even as news was beginning to leak about the mega-merger, (FWB:DB1) and (NYSE:NYX) announced deep negotiations under way regarding a merger between the third and second, respectively, largest exchange groups by total revenues. The proposed TMX-LSE group merger would produce the largest market in terms of listings - approximately 6,700 companies are traded between the two groups - but total annual receipts would likely not make it the largest in dollars. Canadian Industry Minister has said the government will review the merger, which raises the spectre of a government rejection of a deal which would see yet another large Canadian corporation under foreign ownership. The ruling conservatives have been dogged by the issue, and have blocked two other foreign ownership bids during the current government's terms - last year's (TSX:POT) takeover bid from (BHP.AX) and the earlier (NYSE:ATK) bid for (TSX:MDA) space technologies branch, the only two such blocks ever made by a Canadian government. Canadian opposition parties challenged the Prime Minister over the proposal, with leader questioning the benefits of the deal. \"Of course, Canadian companies need access to foreign capital, but not at the expense of our own capital markets,\" he said. Canadian Prime Minister refused to comment on the proposal, having been criticised for involving his office in the Potash bid.", "edit_actions": [{"type": "D", "before": "CAD", "after": null, "start_char_pos": 164, "end_char_pos": 167}, {"type": "D", "before": "Toronto", "after": null, "start_char_pos": 187, "end_char_pos": 194}, {"type": "D", "before": "London", "after": null, "start_char_pos": 207, "end_char_pos": 213}, {"type": "D", "before": "Deutsche B\u00f6rse AG", "after": null, "start_char_pos": 338, "end_char_pos": 355}, {"type": "D", "before": "NYSE Euronext", "after": null, "start_char_pos": 370, "end_char_pos": 383}, {"type": "D", "before": "Tony Clement", "after": null, "start_char_pos": 797, "end_char_pos": 809}, {"type": "D", "before": "Potash Corp.", "after": null, "start_char_pos": 1157, "end_char_pos": 1169}, {"type": "D", "before": "BHP Billiton", "after": null, "start_char_pos": 1198, "end_char_pos": 1210}, {"type": "D", "before": "Alliant Techsystems Inc.", "after": null, "start_char_pos": 1236, "end_char_pos": 1260}, {"type": "D", "before": "MacDonald", "after": null, "start_char_pos": 1280, "end_char_pos": 1289}, {"type": "R", "before": "New Democratic Party leader Jack Layton", "after": "leader", "start_char_pos": 1470, "end_char_pos": 1509}, {"type": "D", "before": "Stephen Harper", "after": null, "start_char_pos": 1696, "end_char_pos": 1710}], "sents_char_pos": [0, 279, 538, 769, 998, 1216, 1387, 1547, 1671]} {"doc_id": "25281", "revision_depth": "1", "before_revision": "NIGGA STOLE MY BIKE! 67651014 ", "after_revision": "The Australian Security Intelligence Organisation, and the Federal government of Australia have settled out of court with a couple whose house had been raided a couple weeks after the 11 September 2001 attacks against the Pentagon and the World Trade Center towers in the USA. ASIO, a domestic counter-intelligence service, mistakenly raided the couples house when they had a search warrant for another house. The couple were detained for a hour and claimed they were assaulted, wrongfully detained and experienced severe shock when, according to their claims, ASIO officers threatened to destroy their door and then held them at gun point. It is also claimed that until an hour after the attack, ASIO officers would not allow Mrs. Fatme Iali to put on her clothes. As compensation, the couple asked the court for Aus$1.5 million in damages. Although it is unknown how much Bilal Daye and his wife received in the out of court settlement (under the terms of the deal, the settlement cannot be disclosed), they stated that they were satisfied with the result. \"Just relieved, I can take care of my family now, that's all I wanted,\" Mr Daye said. Mr Daye's solicitor Stephen Hopper said the victory was very important for civil rights, but suggested that close scrutiy of government actions was required in the future. \"What this case demonstrates is that ASIO can be held accountable ... the government can be held open to scrutiny,\" he said. \"Control orders can be slapped onto a person before the evidence can be tested in court ... they should have to justify why such orders and restrictions should be put on a free person before they do it.\" \"The government's got to be scrutinised for all of its actions and if they make a mistake they should be held accountable.\" Mr Hopper argued that the proposed Anti-Terrorism Bill could prevent media reporting of incidents such as this. \"If the new laws were brought in and it was an issue of preventative detention no probably not, no,\" he said \"If it's an issue of an ASIO warrant, under section 34d of the ASIO Act, no, you wouldn't and the Government's got to be scrutinised for all of its actions and if they make a mistake they should be held accountable,\" he added. It is unclear what implications it could have for websites like Wikinews, which are hosted on servers outside Australia. Previous related news", "edit_actions": [{"type": "R", "before": "NIGGA STOLE MY BIKE! 67651014", "after": "The Australian Security Intelligence Organisation, and the Federal government of Australia have settled out of court with a couple whose house had been raided a couple weeks after the 11 September 2001 attacks against the Pentagon and the World Trade Center towers in the USA.", "start_char_pos": 0, "end_char_pos": 29}, {"type": "A", "before": null, "after": "ASIO, a domestic counter-intelligence service, mistakenly raided the couples house when they had a search warrant for another house.", "start_char_pos": 30, "end_char_pos": 30}, {"type": "A", "before": null, "after": "The couple were detained for a hour and claimed they were assaulted, wrongfully detained and experienced severe shock when, according to their claims, ASIO officers threatened to destroy their door and then held them at gun point.", "start_char_pos": 31, "end_char_pos": 31}, {"type": "A", "before": null, "after": "It is also claimed that until an hour after the attack, ASIO officers would not allow Mrs. Fatme Iali to put on her clothes. As compensation, the couple asked the court for Aus$1.5 million in damages. Although it is unknown how much Bilal Daye and his wife received in the out of court settlement (under the terms of the deal, the settlement cannot be disclosed), they stated that they were satisfied with the result.", "start_char_pos": 32, "end_char_pos": 32}, {"type": "A", "before": null, "after": "\"Just relieved, I can take care of my family now, that's all I wanted,\" Mr Daye said.", "start_char_pos": 33, "end_char_pos": 33}, {"type": "A", "before": null, "after": "Mr Daye's solicitor Stephen Hopper said the victory was very important for civil rights, but suggested that close scrutiy of government actions was required in the future.", "start_char_pos": 34, "end_char_pos": 34}, {"type": "A", "before": null, "after": "\"What this case demonstrates is that ASIO can be held accountable ... the government can be held open to scrutiny,\" he said.", "start_char_pos": 35, "end_char_pos": 35}, {"type": "A", "before": null, "after": "\"Control orders can be slapped onto a person before the evidence can be tested in court ... they should have to justify why such orders and restrictions should be put on a free person before they do it.\"", "start_char_pos": 36, "end_char_pos": 36}, {"type": "A", "before": null, "after": "\"The government's got to be scrutinised for all of its actions and if they make a mistake they should be held accountable.\"", "start_char_pos": 37, "end_char_pos": 37}, {"type": "A", "before": null, "after": "Mr Hopper argued that the proposed Anti-Terrorism Bill could prevent media reporting of incidents such as this.", "start_char_pos": 38, "end_char_pos": 38}, {"type": "A", "before": null, "after": "\"If the new laws were brought in and it was an issue of preventative detention no probably not, no,\" he said", "start_char_pos": 39, "end_char_pos": 39}, {"type": "A", "before": null, "after": "\"If it's an issue of an ASIO warrant, under section 34d of the ASIO Act, no, you wouldn't and the Government's got to be scrutinised for all of its actions and if they make a mistake they should be held accountable,\" he added.", "start_char_pos": 40, "end_char_pos": 40}, {"type": "A", "before": null, "after": "It is unclear what implications it could have for websites like Wikinews, which are hosted on servers outside Australia.", "start_char_pos": 41, "end_char_pos": 41}, {"type": "A", "before": null, "after": "Previous related news", "start_char_pos": 42, "end_char_pos": 42}], "sents_char_pos": [0]} {"doc_id": "255000", "revision_depth": "1", "before_revision": "Following recent sovereign debt crises in Greece and then Ireland, the Portuguese government \u2019 s actions have attracted harsh criticism in the European press. Applauding the request for foreign assistance, Britain\u2019s The Guardian nonetheless lambasts Mr S\u00f3crates for the tardiness of his decision. The British newspaper described Portugal as \u201c the financial-market equivalent of a dead man walking \u201d in an editorial dated April 7. In Portugal, P\u00fablico observed that \u201c it will not be easy to accept more austerity, but it will be impossible to accept any more demagoguery, denial of reality, political incompetence or irresponsibility \u201d . The National Daily noted, however, that the \u201c return of the IMF represents a stinging defeat for Portugal \u201d . Indeed, the political intransigence since Mr S\u00f3crates\u2019s resignation on March 23 was widely viewed as doomed to failure from the outset. The Portguese request, pointed out Spain \u2019s El Pa\u00eds, \u201c surprised no-one, but [had] been delayed for political reasons \u201d . These latest developments will no doubt fuel further criticism of the single currency. In Austria, Vienna \u2019s Der Standard labelled the euro a \u201cdeceitful entity\u201d , mocking the claim by European leaders that \u201c States bailed out using taxpayers\u2019 money will be able to repay their debts with restructuring \u201d .", "after_revision": "Following recent sovereign debt crises in Greece and then Ireland, the Portuguese government ' s actions have attracted harsh criticism in the European press. Applauding the request for foreign assistance, Britain\u2019s The Guardian nonetheless lambasts Mr S\u00f3crates for the tardiness of his decision. The British newspaper described Portugal as \" the financial-market equivalent of a dead man walking \" in an editorial dated April 7. In Portugal, observed that \" it will not be easy to accept more austerity, but it will be impossible to accept any more demagoguery, denial of reality, political incompetence or irresponsibility \" . The National Daily noted, however, that the \" return of the IMF represents a stinging defeat for Portugal \" . Indeed, the political intransigence since Mr S\u00f3crates\u2019s resignation on March 23 was widely viewed as doomed to failure from the outset. The Portguese request, pointed out Spain 's , \" surprised no-one, but [had] been delayed for political reasons \" . These latest developments will no doubt fuel further criticism of the single currency. In Austria, Vienna 's labelled the euro a \"deceitful entity\" , mocking the claim by European leaders that \" States bailed out using taxpayers\u2019 money will be able to repay their debts with restructuring \" .", "edit_actions": [{"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 93, "end_char_pos": 94}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 341, "end_char_pos": 342}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 397, "end_char_pos": 398}, {"type": "R", "before": "P\u00fablico observed that \u201c", "after": "observed that \"", "start_char_pos": 443, "end_char_pos": 466}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 633, "end_char_pos": 634}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 681, "end_char_pos": 682}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 743, "end_char_pos": 744}, {"type": "R", "before": "\u2019s El Pa\u00eds, \u201c", "after": "'s , \"", "start_char_pos": 924, "end_char_pos": 937}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1001, "end_char_pos": 1002}, {"type": "R", "before": "\u2019s Der Standard", "after": "'s", "start_char_pos": 1111, "end_char_pos": 1126}, {"type": "R", "before": "\u201cdeceitful entity\u201d", "after": "\"deceitful entity\"", "start_char_pos": 1147, "end_char_pos": 1165}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1211, "end_char_pos": 1212}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1307, "end_char_pos": 1308}], "sents_char_pos": [0, 158, 296, 429, 882, 1091]} {"doc_id": "260719", "revision_depth": "1", "before_revision": "De-classified picture . The have released a picture regarding a foreign submarine found in the Saltsj\u00f6baden river of which is located in Stockholm , the capital city of Sweden situated on the western coast of the . The submarine was discovered by Hanna Harge, a 40-year-old entrepreneur who lives locally, when walking with her dog on the morning of 13 April this year. She woke up her family and brought them to the location and took pictures of the submarine before it disappeared. She and her family immediately called the Swedish Navy, believing it to be an exercise and told them to hide themselves better. The Navy had , however, no knowledge of such an exercise, and also no reports from other nations regarding the submarine. Soon afterwards, the Navy's intelligence agency visited Harge, taking the pictures to technical staff. The Harge family compares them to the submarines of the former and the early Russian Federation which allegedly violated Sweden's border in the same vicinity. In addition to the , other government agencies are also involved in the investigation such as and . According to Andersson Larsson of the technical staff, the proceedings of the investigation are and it's expected to be finished and sent to the within two months.", "after_revision": "The image of the submarine, taken by Hanna Harge in April . The have released a picture regarding a foreign submarine seen in the of in , the capital city of Sweden , situated on the western coast of the . The submarine was seen by Hanna Harge, a 40-year-old entrepreneur who lives locally, when walking with her dog on the morning of 13 April this year. She woke up her family , brought them to the location and took pictures of the submarine , before it disappeared. She and her family immediately called the Swedish Navy, believing it to be an exercise , and told them to hide the vessel better. The Navy , however, had no knowledge of such an exercise, and no reports from other nations regarding the submarine. Soon afterwards, the Navy's intelligence agency visited Harge, taking the pictures to technical staff. The Harge family compares them to the submarines of the former and the early Russian Federation which allegedly violated Sweden's border in the same vicinity. In addition to the , other government agencies are also involved in the investigation such as and . According to Andersson Larsson of the technical staff, the proceedings of the investigation are classified and it is expected to be finished and sent to the within two months.", "edit_actions": [{"type": "R", "before": "De-classified picture", "after": "The image of the submarine, taken by Hanna Harge in April", "start_char_pos": 0, "end_char_pos": 21}, {"type": "R", "before": "found in the Saltsj\u00f6baden river of which is located in Stockholm", "after": "seen in the of in", "start_char_pos": 82, "end_char_pos": 146}, {"type": "A", "before": null, "after": ",", "start_char_pos": 176, "end_char_pos": 176}, {"type": "R", "before": "discovered", "after": "seen", "start_char_pos": 234, "end_char_pos": 244}, {"type": "R", "before": "and", "after": ",", "start_char_pos": 394, "end_char_pos": 397}, {"type": "A", "before": null, "after": ",", "start_char_pos": 462, "end_char_pos": 462}, {"type": "A", "before": null, "after": ",", "start_char_pos": 573, "end_char_pos": 573}, {"type": "R", "before": "themselves", "after": "the vessel", "start_char_pos": 596, "end_char_pos": 606}, {"type": "D", "before": "had", "after": null, "start_char_pos": 624, "end_char_pos": 627}, {"type": "A", "before": null, "after": "had", "start_char_pos": 639, "end_char_pos": 639}, {"type": "D", "before": "also", "after": null, "start_char_pos": 678, "end_char_pos": 682}, {"type": "R", "before": "and it's", "after": "classified and it is", "start_char_pos": 1196, "end_char_pos": 1204}], "sents_char_pos": [0, 23, 215, 370, 485, 614, 737, 840, 999, 1099]} {"doc_id": "266017", "revision_depth": "1", "before_revision": "There is a problem. There are people like Ben Bernanke, David Rockefeller,Evelyn Rothschild, Bill Gates, George H.W.Bush, George W.Bush, George Soros, and 5,993 are ruining the economy and the planet. They been doing fucking using HAARP (weather modification system and Earthquake machine), poisoning are food and water, lying, buy politicians, fear-mongering,being greedy bastards, teaching hate, stealing our rights away, usurping (that's why Muslims are after these assholes for), election voting fraud, counterfeiting, debt slavery, and starting wars. These bastards own the media (Hollywood, FOX, NBC, CBS, ABC,Associated Press, and CNN), oil companies, J. P. Morgan, Federal Reserve, United Nations, C.I.A, Monsanto (Bio-weapon seeds to plant in food) [ [ ] [ [ ] , and other assets. Next thing these bastard's try to take over the internet.Don't let these bastard's control the internet. What are these assholes have in common. They are members of the Bilderberg group. The worst things they did. They subverted the United States Constitution and took our liberties away.If George Washington, Thomas Jefferson, Benjamin Franklin were today. They will pissed off about these jerks what they did. Some of them aredual Israeli and US citizens. They pretending be Jews and fucked up Israel so badly it will perish and it will be part of Iran in future.These bastards caused World War 3. These fucking bastards will be shot, hang, bombed, and /or vaporized to death by 2015. About history the Rothschilds They cause hatred by starting wars, making people as debt slaves, 3 attempted killings and 4 assassinations of US presidents, and puppet mastering behind leaders. Not vote for Obama . He is a puppet. The puppet master is Evelyn Rothschild", "after_revision": "Screenshot of Enrique Estay's Facebook status and some of the comments. A \"homophobic\" comment on Facebook by Chilean Enrique Estay has generated some controversy. \"[The government is worried about the queers and not about the swarm of bureaucrats who obstruct everything, so that the benefits do not reach to the poorest and middle class,\" said Estay on his Facebook profile on June 2. \"I will not be quiet, until I see changes![... It is frustrating to me. A government that is thought to be right-winged, yet it governs with the left-winged ideas and people,\" he added in a comment. \"Well done, deputy! Simply speak out loud, well spoken, we are only making a country full of queers and lesbians, that's the only thing they politicians] care about, instead of leaving them alone and dedicate themselves to work for the poorest,\" said one of the comments in response to Estay's status. \"It seems like these energumens don't live in Chile; it seems like these persons, so sons-of-bitches, don't understand the reality; it seems like these fucking mummies[momio, pejorative word to call a right-winged person have their brains connected to their asses, because every thinking, every word[they say is worth like that, a royal shit (with all the due respect shit deserves),\" Facebook user Millaray Essence said on No a Pi\u00f1era 2010. Logo of the Movement for Homosexual Integration and Liberation (MOVILH). Estay's comment was denounced before the Committees of Human Rights (of which Estay is a member) and Ethics of the Chamber of Deputies by the Movement for Homosexual Integration and Liberation (Movimiento de Integraci\u00f3n y Liberaci\u00f3n Homosexual, MOVILH) on Monday. In a press release, the MOVILH said that \"Estay's statements clearly seek to denigrate people because of their sexual orientation and gender identity, which implies a violation of human rights, as well as inciting social, cultural, and political odiousness, which is not at the level of his investiture.\" Enrique Estay responded to MOVILH's comments by saying that \" f]or queers we are referring to homosexuals. The term 'gay' is a new expression which means 'similar' and is unrelated to homosexuality.\" He also said that when calling homosexuals \"queers\" (maricones), he \"didn't mean it to be offensive, though I often say things by their name, as they are , and I have always understood that in Chile homosexuals are the queers.\" He concluded, saying, \"It is my Facebook, and that's the way I used it to specifically mention the homosexuals.\" Enrique Estay has represented District 49 () in the Chamber of Deputies of Chile since 2006, having been elected twice for the office . He is a lawyer and member of the (UDI), one of Chile's right-wing parties. As of Wednesday, Estay deleted his Facebook status.", "edit_actions": [{"type": "R", "before": "There is a problem. There are people like Ben Bernanke, David Rockefeller,Evelyn Rothschild, Bill Gates, George H.W.Bush, George W.Bush, George Soros, and 5,993 are ruining the economy and the planet. They been doing fucking using HAARP (weather modification system and Earthquake machine), poisoning are food and water, lying, buy politicians, fear-mongering,being greedy bastards, teaching hate, stealing our rights away, usurping (that's why Muslims are after these assholes for), election voting fraud, counterfeiting, debt slavery, and starting wars. These bastards own the media (Hollywood, FOX, NBC, CBS, ABC,Associated Press, and CNN), oil companies, J. P. Morgan, Federal Reserve, United Nations, C.I.A, Monsanto (Bio-weapon seeds to plant in food)", "after": "Screenshot of Enrique Estay's Facebook status and some of the comments. A \"homophobic\" comment on Facebook by Chilean Enrique Estay has generated some controversy.", "start_char_pos": 0, "end_char_pos": 757}, {"type": "A", "before": null, "after": "\"", "start_char_pos": 758, "end_char_pos": 758}, {"type": "A", "before": null, "after": "The government is", "start_char_pos": 759, "end_char_pos": 759}, {"type": "A", "before": null, "after": "worried about the queers and not about the swarm of bureaucrats who obstruct everything, so that the benefits do not reach to the poorest and middle class,\" said Estay on his Facebook profile on June 2. \"I will not be quiet, until I see changes!", "start_char_pos": 760, "end_char_pos": 760}, {"type": "A", "before": null, "after": "...", "start_char_pos": 761, "end_char_pos": 761}, {"type": "A", "before": null, "after": "It is frustrating to me. A government that is thought to be right-winged, yet it governs with the left-winged ideas and people,\" he added in a comment.", "start_char_pos": 762, "end_char_pos": 762}, {"type": "A", "before": null, "after": "\"Well done, deputy! Simply speak out loud, well spoken, we are only making a country full of queers and lesbians, that's the only thing they", "start_char_pos": 763, "end_char_pos": 763}, {"type": "A", "before": null, "after": "politicians", "start_char_pos": 764, "end_char_pos": 764}, {"type": "A", "before": null, "after": "care about, instead of leaving them alone and dedicate themselves to work for the poorest,\" said one of the comments in response to Estay's status.", "start_char_pos": 766, "end_char_pos": 766}, {"type": "A", "before": null, "after": "\"It seems like these energumens don't live in Chile; it seems like these persons, so sons-of-bitches, don't understand the reality; it seems like these fucking mummies", "start_char_pos": 767, "end_char_pos": 767}, {"type": "A", "before": null, "after": "momio, pejorative word to call a right-winged person", "start_char_pos": 768, "end_char_pos": 768}, {"type": "A", "before": null, "after": "have their brains connected to their asses, because every thinking, every word", "start_char_pos": 769, "end_char_pos": 769}, {"type": "A", "before": null, "after": "they say", "start_char_pos": 770, "end_char_pos": 770}, {"type": "A", "before": null, "after": "is worth like that, a royal shit (with all the due respect shit deserves),\" Facebook user Millaray Essence said on No a Pi\u00f1era 2010.", "start_char_pos": 771, "end_char_pos": 771}, {"type": "A", "before": null, "after": "Logo of the Movement for Homosexual Integration and Liberation (MOVILH).", "start_char_pos": 772, "end_char_pos": 772}, {"type": "A", "before": null, "after": "Estay's comment was denounced before the Committees of Human Rights (of which Estay is a member) and Ethics of the Chamber of Deputies by the Movement for Homosexual Integration and Liberation (Movimiento de Integraci\u00f3n y Liberaci\u00f3n Homosexual, MOVILH) on Monday. In a press release, the MOVILH said that \"Estay's statements clearly seek to denigrate people because of their sexual orientation and gender identity, which implies a violation of human rights, as well as inciting social, cultural, and political odiousness, which is not at the level of his investiture.\"", "start_char_pos": 773, "end_char_pos": 773}, {"type": "A", "before": null, "after": "Enrique Estay responded to MOVILH's comments by saying that \"", "start_char_pos": 774, "end_char_pos": 774}, {"type": "A", "before": null, "after": "f", "start_char_pos": 775, "end_char_pos": 775}, {"type": "A", "before": null, "after": "or queers we are referring to homosexuals. The term 'gay' is a new expression which means 'similar' and is unrelated to homosexuality.\" He also said that when calling homosexuals \"queers\" (maricones), he \"didn't mean it to be offensive, though I often say things by their name, as they are", "start_char_pos": 776, "end_char_pos": 776}, {"type": "R", "before": "other assets. Next thing these bastard's try to take over the internet.Don't let these bastard's control the internet. What are these assholes have in common. They are members of the Bilderberg group. The worst things they did. They subverted the United States Constitution and took our liberties away.If George Washington, Thomas Jefferson, Benjamin Franklin were today. They will pissed off about these jerks what they did. Some of them aredual Israeli and US citizens. They pretending be Jews and fucked up Israel so badly it will perish and it will be part of Iran in future.These bastards caused World War 3. These fucking bastards will be shot, hang, bombed, and /or vaporized to death by 2015. About history the Rothschilds They cause hatred by starting wars, making people as debt slaves, 3 attempted killings and 4 assassinations of US presidents, and puppet mastering behind leaders. Not vote for Obama", "after": "I have always understood that in Chile homosexuals are the queers.\" He concluded, saying, \"It is my Facebook, and that's the way I used it to specifically mention the homosexuals.\"", "start_char_pos": 783, "end_char_pos": 1695}, {"type": "A", "before": null, "after": "Enrique Estay has represented District 49 () in the Chamber of Deputies of Chile since 2006, having been elected twice for the office", "start_char_pos": 1696, "end_char_pos": 1696}, {"type": "R", "before": "puppet. The puppet master is Evelyn Rothschild", "after": "lawyer and member of the (UDI), one of Chile's right-wing parties. As of Wednesday, Estay deleted his Facebook status.", "start_char_pos": 1707, "end_char_pos": 1753}], "sents_char_pos": [0, 19, 200, 555, 796, 854, 901, 941, 983, 1010, 1085, 1154, 1208, 1254, 1362, 1396, 1483, 1676, 1698, 1714]} {"doc_id": "27409", "revision_depth": "1", "before_revision": "RepuTex has announced this month a list of the most socially responsible companies in Australia and New Zealand. Reputex according to its website is a \" alternative to existing ethical investment methodologies which rely primarily on negative screening systems \" The list covers 66 organistions . RepuTex services large to small organistions which want their situation assed . The organistions are assed across four sectors Corporate Governance, Environmental Impact, Workplace Practices and Social Impact producing a final result. This year the Westpac Banking Corporation gained the only AAA rating followed by Australia and New Zealand Banking Group Limited and Australian Postal Corporation with AA ratings. Global CEO of RepuTex, Ms Laurel Grossman said \u201c More companies are recognising the value of CSR (Corporate Social Responsibility) and the vital role it plays in managing mainstream financial risk,\u201d she also said \u201c This year 66 companies across Australia and New Zealand were rated in the A range (-A to AAA) up from 58 companies last year.\"", "after_revision": "RepuTex has announced this month a list of the most socially responsible companies in Australia and New Zealand. RepuTex, according to its website , is \" an alternative to existing ethical investment methodologies which rely primarily on negative screening systems . \" The list covers 66 organisations . RepuTex services large to small organisations which want their situation assessed. The organisations are assessed across four sectors ; Corporate Governance, Environmental Impact, Workplace Practices and Social Impact , producing a final result. This year , the Westpac Banking Corporation gained the only AAA rating followed by Australia and New Zealand Banking Group Limited and Australian Postal Corporation with AA ratings. Global CEO of RepuTex, Ms Laurel Grossman said \u201c more companies are recognising the value of CSR (Corporate Social Responsibility) and the vital role it plays in managing mainstream financial risk,\u201d adding \u201c this year 66 companies across Australia and New Zealand were rated in the A range (-A to AAA) , up from 58 companies last year.\"", "edit_actions": [{"type": "R", "before": "Reputex", "after": "RepuTex,", "start_char_pos": 113, "end_char_pos": 120}, {"type": "R", "before": "is a", "after": ", is", "start_char_pos": 146, "end_char_pos": 150}, {"type": "A", "before": null, "after": "an", "start_char_pos": 153, "end_char_pos": 153}, {"type": "A", "before": null, "after": ".", "start_char_pos": 262, "end_char_pos": 262}, {"type": "R", "before": "organistions", "after": "organisations", "start_char_pos": 284, "end_char_pos": 296}, {"type": "R", "before": "organistions", "after": "organisations", "start_char_pos": 331, "end_char_pos": 343}, {"type": "R", "before": "assed . The organistions are assed", "after": "assessed. The organisations are assessed", "start_char_pos": 371, "end_char_pos": 405}, {"type": "A", "before": null, "after": ";", "start_char_pos": 426, "end_char_pos": 426}, {"type": "A", "before": null, "after": ",", "start_char_pos": 509, "end_char_pos": 509}, {"type": "A", "before": null, "after": ",", "start_char_pos": 546, "end_char_pos": 546}, {"type": "R", "before": "More", "after": "more", "start_char_pos": 766, "end_char_pos": 770}, {"type": "R", "before": "she also said", "after": "adding", "start_char_pos": 916, "end_char_pos": 929}, {"type": "R", "before": "This", "after": "this", "start_char_pos": 932, "end_char_pos": 936}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1026, "end_char_pos": 1026}], "sents_char_pos": [0, 112, 378, 535, 716]} {"doc_id": "27461", "revision_depth": "1", "before_revision": "The Australian Senate has passed legislation to force a national nuclear waste dump on the Northern Territory (NT). Despite opposition from Aboriginal land owners, the NT government, environment groups and Labor the Federal Government can now officially build a nuclear waste repository in the NT after the legislation for the waste dump passed the Senate today. The Radioactive Waste Management Bill was passed with 34 in favour and 29 against. The two bills override the Northern Territory's objection to the radioactive waste dump after the South Australian government opposed a previous preferred site near Woomera . According to Federal Labor opposition MP, Warren Snowdon, it is the first time since 1978 that Territory law has been overridden. \"It's an absolute disaster and it shows contempt for the Northern Territory community, it shows absolute contempt for land use planning in the Northern Territory,\" he said. The Territory Labor Government has been a resolute opponent of the plan, saying a nuclear dump will expose residents to a new security threat. The Chief Minister of the Northern Territory, Clare Martin , says transporting nuclear waste to the Territory would make it vulnerable to terrorists looking to make a dirty bomb . Ms Martin says experts on the issue have raised concerns about security at a national nuclear waste facility. The Australian Nuclear Science and Technology Organisation 's (ANSTO) Craig Pierce says there would be no point trying to use low level waste to make a dirty bomb because the waste is mostly gloves and labcoats. \"It simply would make no sense to get this material and want to blow it up,\" he said. Alice Springs on a large scale map \"It would have no impact at all. On the intermediate level, that will have a high level of security when it is transported. It won't be transported for very far on road, on land, and it will have an appropriate level of security.\" The Australian Conservation Foundation said it expected community anger would escalate, now the bills had passed. \"Last year the federal government gave the people of the NT an absolute categorical assurance there would be no dump in the NT,\" ACF nuclear campaigner Dave Sweeney said. \"Today they have broken this promise and bulldozed through bad law in an attempt to gag community concern.\" The Australian Greens say the legislation could be manipulated to allow waste from other countries to be stored in the Northern Territory. The party is angry that amendments they proposed were not considered when the bill was passed. Greens Senator Rachel Siewert says the legislation is not strong enough. The NT Environment Centre's Gary Scott has hinted at civil disobedience similar to that seen during the anti-uranium mining protests at Jabiluka . \"I don't think Territorians are going to take this lying down unless that is in front of bulldozers,\" Mr Scott said. The Centre\u2019s Peter Robertson has emphasised the importance of the waste dump for the federal government to realise its plans for a second nuclear reactor. \"If we get the dump, Sydney gets the reactor\". Establishing a national waste dump is a precondition for the operating license for the proposed OPAL nuclear reactor which will replace Lucas Heights in Sydney. A detailed study of three Defence sites - Fishers Ridge, 43 km south-east of Katherine , Harts Range, 100 km north-east of Alice Springs , and Mount Everard, 27 km north-west of Alice Springs - will be conducted next year, with the facility to be operational by 2011. Coalition MPs, including Northern Territory Country Liberal senator Nigel Scullion, secured a number of amendments to the bill. They included the ability of the NT government and indigenous land councils to decide on other site options, a prohibition on the storage of high level and overseas waste and the free storage of the NT's own waste. Mr Hill says waste should be stored closer to Lucas Heights in Sydney where it is generated. Radioactive waste is currently stored at over 100 locations across the country, including in hospital basements in major capital cities and at universities.", "after_revision": "The Australian Senate has passed legislation to force a national dump on the Northern Territory (NT). Despite opposition from Aboriginal land owners, the NT government, environment groups and Labor the can now officially build a nuclear waste repository in the NT after the legislation for the waste dump passed the Senate today. The Radioactive Waste Management Bill was passed with 34 in favour and 29 against. The two bills override the Northern Territory's objection to the radioactive waste dump after the government opposed a previous preferred site near . According to Federal Labor opposition MP, Warren Snowdon, it is the first time since 1978 that Territory law has been overridden. \"It's an absolute disaster and it shows contempt for the Northern Territory community, it shows absolute contempt for land use planning in the Northern Territory,\" he said. The has been a resolute opponent of the plan, saying a nuclear dump will expose residents to a new security threat. The Chief Minister of the Northern Territory, , says transporting nuclear waste to the Territory would make it vulnerable to terrorists looking to make a . Ms Martin says experts on the issue have raised concerns about security at a national nuclear waste facility. The 's (ANSTO) Craig Pierce says there would be no point trying to use low level waste to make a dirty bomb because the waste is mostly gloves and labcoats. \"It simply would make no sense to get this material and want to blow it up,\" he said. Alice Springs on a large scale map \"It would have no impact at all. On the intermediate level, that will have a high level of security when it is transported. It won't be transported for very far on road, on land, and it will have an appropriate level of security.\" The said it expected community anger would escalate, now the bills had passed. \"Last year the federal government gave the people of the NT an absolute categorical assurance there would be no dump in the NT,\" ACF nuclear campaigner Dave Sweeney said. \"Today they have broken this promise and bulldozed through bad law in an attempt to gag community concern.\" The say the legislation could be manipulated to allow waste from other countries to be stored in the Northern Territory. The party is angry that amendments they proposed were not considered when the bill was passed. says the legislation is not strong enough. The NT Environment Centre's Gary Scott has hinted at civil disobedience similar to that seen during the anti-uranium mining protests at . \"I don't think Territorians are going to take this lying down unless that is in front of bulldozers,\" Mr Scott said. The Centre\u2019s Peter Robertson has emphasised the importance of the waste dump for the federal government to realise its plans for a second nuclear reactor. \"If we get the dump, Sydney gets the reactor\". Establishing a national waste dump is a precondition for the operating license for the proposed which will replace in Sydney. A detailed study of three Defence sites - Fishers Ridge, 43 km south-east of , Harts Range, 100 km north-east of , and Mount Everard, 27 km north-west of Alice Springs - will be conducted next year, with the facility to be operational by 2011. Coalition MPs, including Northern Territory senator Nigel Scullion, secured a number of amendments to the bill. They included the ability of the NT government and indigenous land councils to decide on other site options, a prohibition on the storage of high level and overseas waste and the free storage of the NT's own waste. Mr Hill says waste should be stored closer to in Sydney where it is generated. Radioactive waste is currently stored at over 100 locations across the country, including in hospital basements in major capital cities and at universities.", "edit_actions": [{"type": "D", "before": "nuclear waste", "after": null, "start_char_pos": 65, "end_char_pos": 78}, {"type": "D", "before": "Federal Government", "after": null, "start_char_pos": 216, "end_char_pos": 234}, {"type": "D", "before": "South Australian", "after": null, "start_char_pos": 544, "end_char_pos": 560}, {"type": "D", "before": "Woomera", "after": null, "start_char_pos": 611, "end_char_pos": 618}, {"type": "D", "before": "Territory Labor Government", "after": null, "start_char_pos": 928, "end_char_pos": 954}, {"type": "D", "before": "Clare Martin", "after": null, "start_char_pos": 1113, "end_char_pos": 1125}, {"type": "D", "before": "dirty bomb", "after": null, "start_char_pos": 1234, "end_char_pos": 1244}, {"type": "D", "before": "Australian Nuclear Science and Technology Organisation", "after": null, "start_char_pos": 1361, "end_char_pos": 1415}, {"type": "D", "before": "Australian Conservation Foundation", "after": null, "start_char_pos": 1925, "end_char_pos": 1959}, {"type": "D", "before": "Australian Greens", "after": null, "start_char_pos": 2318, "end_char_pos": 2335}, {"type": "D", "before": "Greens Senator Rachel Siewert", "after": null, "start_char_pos": 2548, "end_char_pos": 2577}, {"type": "D", "before": "Jabiluka", "after": null, "start_char_pos": 2757, "end_char_pos": 2765}, {"type": "D", "before": "OPAL nuclear reactor", "after": null, "start_char_pos": 3183, "end_char_pos": 3203}, {"type": "D", "before": "Lucas Heights", "after": null, "start_char_pos": 3223, "end_char_pos": 3236}, {"type": "D", "before": "Katherine", "after": null, "start_char_pos": 3325, "end_char_pos": 3334}, {"type": "D", "before": "Alice Springs", "after": null, "start_char_pos": 3371, "end_char_pos": 3384}, {"type": "D", "before": "Country Liberal", "after": null, "start_char_pos": 3560, "end_char_pos": 3575}, {"type": "D", "before": "Lucas Heights", "after": null, "start_char_pos": 3905, "end_char_pos": 3918}], "sents_char_pos": [0, 115, 362, 445, 620, 750, 923, 1066, 1246, 1356, 1568, 1654, 1722, 1813, 1920, 2034, 2205, 2313, 2452, 2547, 2620, 2884, 3039, 3086, 3247, 3515, 3643, 3858, 3951]} {"doc_id": "2795820", "revision_depth": "2", "before_revision": "The for \u2014 by reports disputed by the Russian Consul \u2014 shot and killed an attacker on Thursday, after two individuals attempted to commit a robbery. As reported, lawyer Marcos Cesar Feres Braga \u2014 so-named by the newspaper \u2014 working for the , was driving with his family through the suburb of near the main complex when the incident occurred. According to reports from the Rio newspaper , the 60-year-old man, his wife, and his daughter were stopped in traffic due to the procession in a nearby neighbourhood. Two individuals on motorbikes approached and used a gun to smash the car window. Braga, trained and considered an expert \u2014 according to reports \u2014 in , took control of the attacker's firearm and proceeded to shoot dead the alleged attacker, while the second suspect fled the scene. Rio de Janeiro's homicide branch has released a statement in relation to the incident. \"The vice consul got into a physical struggle with the assailant and during the fight the aggressor's weapon fired shots. The assailant died of his wounds on the spot.\" However, Russia's Consul General Vladimir Tokmakov has released a statement claiming no Russian diplomats or employees of the consulate general were involved in the incident. \"Information circulating in the Brazilian press about the alleged shooting [...] of a Brazilian national by a Russian diplomat during an armed robbery does not reflect reality \".", "after_revision": "The for , according reports disputed by the Russian Consul ; shot and killed an attacker on Thursday, after two individuals attempted to commit a robbery. lawyer Marcos Cesar Feres Braga , working at the , was driving with his family through the suburb of near the main complex when the incident occurred. According to reports from the Rio newspaper , a 60-year-old man, his wife, and his daughter were stopped in traffic , due to the procession in a nearby neighbourhood. Two individuals on motorbikes approached and used a gun to smash the car window. Braga, trained in , took control of the attacker's firearm and proceeded to shoot and kill the alleged attacker, while the second suspect fled the scene. Rio de Janeiro's homicide branch has released a statement in relation to the incident. \"The vice consul got into a physical struggle with the assailant , and during the fight the aggressor's weapon fired shots. The assailant died of his wounds on the spot.\" Russia's Consul General Vladimir Tokmakov has released a statement claiming no Russian diplomats or employees of the consulate general were involved in the incident. \"Information circulating in the Brazilian press about the alleged shooting [...] of a Brazilian national by a Russian diplomat during an armed robbery does not reflect reality .\"", "edit_actions": [{"type": "R", "before": "\u2014 by", "after": ", according", "start_char_pos": 8, "end_char_pos": 12}, {"type": "R", "before": "\u2014", "after": ";", "start_char_pos": 52, "end_char_pos": 53}, {"type": "D", "before": "As reported,", "after": null, "start_char_pos": 148, "end_char_pos": 160}, {"type": "R", "before": "\u2014 so-named by the newspaper \u2014 working for", "after": ", working at", "start_char_pos": 193, "end_char_pos": 234}, {"type": "R", "before": "the", "after": "a", "start_char_pos": 387, "end_char_pos": 390}, {"type": "A", "before": null, "after": ",", "start_char_pos": 459, "end_char_pos": 459}, {"type": "D", "before": "and considered an expert \u2014 according to reports \u2014", "after": null, "start_char_pos": 605, "end_char_pos": 654}, {"type": "R", "before": "dead", "after": "and kill", "start_char_pos": 722, "end_char_pos": 726}, {"type": "A", "before": null, "after": ",", "start_char_pos": 942, "end_char_pos": 942}, {"type": "D", "before": "However,", "after": null, "start_char_pos": 1047, "end_char_pos": 1055}, {"type": "R", "before": "\".", "after": ".\"", "start_char_pos": 1398, "end_char_pos": 1400}], "sents_char_pos": [0, 147, 340, 508, 589, 789, 876, 999, 1046, 1221]} {"doc_id": "2831355", "revision_depth": "1", "before_revision": "On Sunday, vice-president of (FIDE) Israel Gelfer told that for seven chess players \"will not be issued\" for a tournament in the (KSA). The 2017 King Salman Rapid and Blitz World Championships from December 26 to December 30 in is to go ahead without any changes, the vice-president said. Spokesperson of the Saudi Arabian embassy in the Fatimah Baeshen , \"Related to the purported politicization of the International Chess Tournament hosted by Riyadh: the Kingdom has allowed the participation of all citizens.The exception is whereby KSA has historically not had diplomatic ties with a specific country-thus has maintained its policy.\" Saudi Arabia does not recognise Israel. Despite their diplomatic tensions with , Israel, and , FIDE tweeted they had \"secured\" visas for Qatari and Iranian chess players on Monday. In November, FIDE's deputy president Georgios Makropoulos told Reuters they were \"making a huge effort to ensure that all players get their visas\". About 180 chess players were to participate in the event. The total prize money of the tournament is 2 million, with largest individual prize money about US 750 thousand. In November, chess Grand Master tweeted, \"To organize a chess tournament in a country where basic aren't valued is horrible. Chess is a game where all different sorts of people can come together, not a game in which people are divided because of their religion or country of origin.\" This is not the first time Israeli players have faced problems while playing in the nations. In October, Israeli were not permitted to wear the Israeli flag or symbols, or bear the country's name on their judo uniform for a judo grand slam in the . Israeli judokas had to compete without their national flag and the anthem of the was played at the medal ceremony when Israeli athlete won a gold medal.", "after_revision": "On Sunday, vice-president of (FIDE) Israel Gelfer told Reuters that for seven Israeli chess players \"will not be issued\" for a chess tournament in the Kingdom of Saudi Arabia (KSA). The 2017 King Salman Rapid and Blitz World Championships from December 26 to December 30 in Riyadh is to go ahead without any changes, the vice-president said. Spokesperson of the Saudi Arabian embassy in the US tweeted , \"Related to the purported politicization of the International Chess Tournament hosted by Riyadh: the Kingdom has allowed the participation of all citizens.The exception is whereby KSA has historically not had diplomatic ties with a specific country-thus has maintained its policy.\" Saudi Arabia does not recognise Israel. Despite their diplomatic tensions with Iran , Israel, and Qatar , FIDE tweeted they had \"secured\" visas for Qatari and Iranian chess players on Monday. In November, FIDE's deputy president Georgios Makropoulos told Reuters they were \"making a huge effort to ensure that all players get their visas\". About 180 chess players were to participate in the event. The total prize money of the tournament is US$2 million, with largest individual prize money about US$ 750 thousand. In November, chess Grand Master tweeted, \"To organize a chess tournament in a country where basic human rights aren't valued is horrible. Chess is a game where all different sorts of people can come together, not a game in which people are divided because of their religion or country of origin.\" This is not the first time Israeli players have faced problems while playing in the Middle East nations. In October, Israeli were not permitted to wear the Israeli flag or symbols, or bear the country's name on their judo uniform for a judo grand slam in the United Arab Emirates . Israeli judokas had to compete without their national flag and the anthem of the was played at the medal ceremony when Israeli athlete won a gold medal.", "edit_actions": [{"type": "A", "before": null, "after": "Reuters", "start_char_pos": 55, "end_char_pos": 55}, {"type": "A", "before": null, "after": "Israeli", "start_char_pos": 71, "end_char_pos": 71}, {"type": "A", "before": null, "after": "chess", "start_char_pos": 113, "end_char_pos": 113}, {"type": "A", "before": null, "after": "Kingdom of Saudi Arabia", "start_char_pos": 132, "end_char_pos": 132}, {"type": "A", "before": null, "after": "Riyadh", "start_char_pos": 232, "end_char_pos": 232}, {"type": "R", "before": "Fatimah Baeshen", "after": "US tweeted", "start_char_pos": 343, "end_char_pos": 358}, {"type": "A", "before": null, "after": "Iran", "start_char_pos": 722, "end_char_pos": 722}, {"type": "A", "before": null, "after": "Qatar", "start_char_pos": 737, "end_char_pos": 737}, {"type": "R", "before": "2 million, with largest individual prize money about US", "after": "US$2 million, with largest individual prize money about US$", "start_char_pos": 1075, "end_char_pos": 1130}, {"type": "A", "before": null, "after": "human rights", "start_char_pos": 1243, "end_char_pos": 1243}, {"type": "A", "before": null, "after": "Middle East", "start_char_pos": 1514, "end_char_pos": 1514}, {"type": "A", "before": null, "after": "United Arab Emirates", "start_char_pos": 1678, "end_char_pos": 1678}], "sents_char_pos": [0, 139, 293, 516, 642, 682, 825, 973, 1031, 1144, 1270, 1429, 1523, 1680]} {"doc_id": "2909658", "revision_depth": "1", "before_revision": "On Monday, administrator sent a letter to President-elect and his team, giving them permission to access what she described as post-election resources for a presidential transition process following the on November 3, which multiple national news outlets have projected former US Joe Biden won against US President . GSA Administrator Emily W. Murphy's letter to Joe Biden File photo of Emily Webster Murphy, US Administrator of the General Services Administration (GSA)| Trump recommending GSA Administrator release transition support to Joe Biden File photo of Emily Webster Murphy, US Administrator of the General Services Administration (GSA)|left Murphy claimed she made this decision without influence from the , insisting she was \"never directly or indirectly pressured by any official\". However, she claimed she and her family had received violent threats due to her involvement in the process of allowing the incoming president elect access to federal documents. President Trump, who appointed Murphy to her position himself in 2017, responded to her letter on , calling for the beginning of a presidential transition process \"in the best interests of the country\". The president's response is a drastic departure in tone from his previous rhetoric and demeanor regarding the issue, in which he asserted he had won the election despite several key certifying their results in favor of Biden. To date, the president's claims of widespread have not gained any momentum in the courts. Two days prior to Michigan's final certification of its election results, a dismissed a Trump lawsuit attempting to prevent the state of from certifying their results. Trump and his legal team have come under scrutiny from both sides of the aisle in response to their claims of election fraud. Biden and others in the warned the delayed transition process could potentially be a threat to , in withholding resources from Biden and his team. commented the president's tweets Monday are likely as near as the US public will ever have to an official concession from the president. Other have broken with Trump and have urged him to move forward with the presidential transition, such as former governor , who denounced the Trump legal team's claims as a \"national embarrassment\". Additionally, businessman and Trump loyalist said the president should accept the election outcome and \"move on\". Over 100 Republican national security experts signed an open letter urging Republican officials to push the president to concede the election.", "after_revision": "On Monday, United States administrator sent a letter to President-elect Joe Biden and his team, giving them permission to access what she described as post-election resources for a presidential transition process following the 2020 US Presidential Election on November 3, which multiple national news outlets have projected former US Joe Biden won against US President Donald Trump . GSA Administrator Emily W. Murphy's letter to Joe Biden Trump recommending GSA Administrator release transition support to Joe Biden File photo of Emily Webster Murphy, US Administrator of the General Services Administration (GSA)|left Murphy claimed she made this decision without influence from the White House , insisting she was \"never directly or indirectly pressured by any official\". However, she claimed she and her family had received violent threats due to her involvement in the process of allowing the incoming president elect access to federal documents. President Trump, who appointed Murphy to her position himself in 2017, responded to her letter on Twitter , calling for the beginning of a presidential transition process \"in the best interests of the country\". The president's response is a drastic departure in tone from his previous rhetoric and demeanor regarding the issue, in which he asserted he had won the election despite several key certifying their results in favor of Biden. To date, the president's claims of widespread have not gained any momentum in the courts. Two days prior to Michigan's final certification of its election results, a dismissed a Trump lawsuit attempting to prevent the state of Pennsylvania from certifying their results. Trump and his legal team have come under scrutiny from both sides of the aisle in response to their claims of election fraud. Biden and others in the Democratic Party warned the delayed transition process could potentially be a threat to , in withholding resources from Biden and his team. Senate Chuck Schumer commented the president's tweets Monday are likely as near as the US public will ever have to an official concession from the president. Other Republicans have broken with Trump and have urged him to move forward with the presidential transition, such as former New Jersey governor Chris Christie , who denounced the Trump legal team's claims as a \"national embarrassment\". Additionally, businessman and Trump loyalist said the president should accept the election outcome and \"move on\". Over 100 Republican national security experts signed an open letter urging Republican officials to push the president to concede the election.", "edit_actions": [{"type": "A", "before": null, "after": "United States", "start_char_pos": 11, "end_char_pos": 11}, {"type": "A", "before": null, "after": "Joe Biden", "start_char_pos": 59, "end_char_pos": 59}, {"type": "A", "before": null, "after": "2020 US Presidential Election", "start_char_pos": 205, "end_char_pos": 205}, {"type": "A", "before": null, "after": "Donald Trump", "start_char_pos": 318, "end_char_pos": 318}, {"type": "D", "before": "File photo of Emily Webster Murphy, US Administrator of the General Services Administration (GSA)|", "after": null, "start_char_pos": 377, "end_char_pos": 475}, {"type": "A", "before": null, "after": "White House", "start_char_pos": 721, "end_char_pos": 721}, {"type": "A", "before": null, "after": "Twitter", "start_char_pos": 1075, "end_char_pos": 1075}, {"type": "A", "before": null, "after": "Pennsylvania", "start_char_pos": 1634, "end_char_pos": 1634}, {"type": "A", "before": null, "after": "Democratic Party", "start_char_pos": 1816, "end_char_pos": 1816}, {"type": "A", "before": null, "after": "Senate Chuck Schumer", "start_char_pos": 1940, "end_char_pos": 1940}, {"type": "A", "before": null, "after": "Republicans", "start_char_pos": 2084, "end_char_pos": 2084}, {"type": "R", "before": "governor", "after": "New Jersey governor Chris Christie", "start_char_pos": 2192, "end_char_pos": 2200}], "sents_char_pos": [0, 73, 220, 412, 799, 976, 1180, 1406, 1496, 1665, 1791, 2077, 2277, 2391]} {"doc_id": "2927486", "revision_depth": "1", "before_revision": " Monday, Mr Justice Sir of the for England and Wales dismissed an application for legal review by campaigners for Transport Action Network (TAN) on the United Kingdom government's Road Investment Strategy 2: 2020-2025 RIS 2 , announced March 11 last year, for an assessment into the plan's adherence to the and . The investment strategy of 27.4 billion over five years follows its predecessor, RIS 1, adopted December 1, 2014 for the period 2015-2020. RIS 2 consists of fifty schemes: 45 rolled-over from the previous plan which could not be completed in time, and five new schemes that would create or improve upon of the England strategic roads network. RIS 1 was written prior to binding commitments, according to The Guardian. In a press release, the organisation said it is currently crowdfunding for an appeal to the ruling, which its director Chris Todd was quoted in a press release as \"fail[ing] to grapple with the clear requirement created by Parliament that ministers must carefully consider environmental impacts\". The ruling says \"the evidence is plain\" the UK \"government is taking a range of steps to tackle the need for urgency in addressing carbon production in the transport sector\" at a level emphasised by TAN. RIS 2 would support 64 thousand jobs in the construction industry and has been defended by chief executive of Jim O'Sullivan as \"mak[ing] journeys faster and more reliable for freight and road users.\" 2015 DfT analysis of RIS 1 found the scheme would increase the projected rise in emissions by 2040 by between 0.1 and 0.2\\%. April 2020 analysis of RIS 2 found the five new schemes covered would amount to an estimated 0.016\\% of emissions of the 2028-2032 carbon budget.", "after_revision": "On Monday, Mr Justice of the for England and Wales dismissed an application for legal review by campaigners from the Transport Action Network (TAN) regarding the United Kingdom (UK) government's Road Investment Strategy 2: 2020-2025 ( RIS 2 ) plan , announced March 11 last year, for an assessment into the plan's adherence to the and . The investment strategy of 27.4 billion over five years follows its predecessor, RIS 1, adopted December 1, 2014 for the period 2015-2020. RIS 2 consists of fifty schemes: 45 rolled-over from the previous plan which could not be completed in time, and five new schemes that would create or improve upon of England's strategic roads network. RIS 1 was written prior to the UK making binding commitments, according to The Guardian. In a press release, TAN said it is currently crowdfunding for an appeal to the ruling, which its director Chris Todd was quoted in that press release as \"fail[ing] to grapple with the clear requirement created by Parliament that ministers must carefully consider environmental impacts\". The ruling says \"the evidence is plain\" the UK \"government is taking a range of steps to tackle the need for urgency in addressing carbon production in the transport sector\" at a level emphasised by TAN. RIS 2 would support 64 thousand jobs in the construction industry and has been defended by chief executive of Jim O'Sullivan as \"mak[ing] journeys faster and more reliable for freight and road users.\" A 2015 DfT analysis of RIS 1 found the scheme would increase the projected rise in emissions by 2040 by between 0.1 and 0.2\\%. An April 2020 analysis of RIS 2 found the five new schemes covered would amount to an estimated 0.016\\% of emissions of the 2028-2032 carbon budget.", "edit_actions": [{"type": "A", "before": null, "after": "On", "start_char_pos": 0, "end_char_pos": 0}, {"type": "D", "before": "Sir", "after": null, "start_char_pos": 20, "end_char_pos": 23}, {"type": "R", "before": "for", "after": "from the", "start_char_pos": 110, "end_char_pos": 113}, {"type": "R", "before": "on", "after": "regarding", "start_char_pos": 145, "end_char_pos": 147}, {"type": "A", "before": null, "after": "(UK)", "start_char_pos": 167, "end_char_pos": 167}, {"type": "A", "before": null, "after": "(", "start_char_pos": 219, "end_char_pos": 219}, {"type": "A", "before": null, "after": ") plan", "start_char_pos": 226, "end_char_pos": 226}, {"type": "R", "before": "the England", "after": "England's", "start_char_pos": 622, "end_char_pos": 633}, {"type": "A", "before": null, "after": "the UK making", "start_char_pos": 686, "end_char_pos": 686}, {"type": "R", "before": "the organisation", "after": "TAN", "start_char_pos": 755, "end_char_pos": 771}, {"type": "R", "before": "a", "after": "that", "start_char_pos": 879, "end_char_pos": 880}, {"type": "A", "before": null, "after": "A", "start_char_pos": 1437, "end_char_pos": 1437}, {"type": "A", "before": null, "after": "An", "start_char_pos": 1563, "end_char_pos": 1563}], "sents_char_pos": [0, 315, 454, 658, 734, 1031, 1235, 1562]} {"doc_id": "29545", "revision_depth": "2", "before_revision": "Tropical Storm Zeta has become the first storm of the 2006 Atlantic hurricane season after crossing over from 2005 Atlantic hurricane season as that seasons 27th storm, breaking the record set by Hurricane Epsilon earlier in December. This makes Zeta the second tropical storm in history to cross over into another season; the first time this occurred was in 1954-55 with Hurricane Alice . Zeta currently has a top sustained wind speed of 50mph (85 km/h). It is currently about 1,085 miles (1745 km) southwest of the Azores and is proceeding west-southwest at 2mph (4 km/h). Forecasters say it is not expected to become a hurricane or threaten land. Zeta formed on December 30, 2005, after the official end of the destructive and record-breaking 2005 Atlantic hurricane season, which ended on November 30, 2005. The 2005 season was notable for the record number of storms it produced (including Zeta), and was the first time storm names used V, W and Greek letters and the second time the letters R, S, and T were used. The season also had the highest-ever number of storms forming in the month of July, and had the highest number of Category 5 hurricanes with a total of three, including Hurricane Wilma , the most intense hurricane ever in the Atlantic basin. The most notable of the three Category 5 hurricanes was Hurricane Katrina . Katrina caused over $100 billion ( USD ) in damage and 1,383 deaths, especially along Mississippi and Alabama coastlines which suffered catastrophic damage. The storm also caused levees to break in New Orleans leading to the flooding of the city which is located below sea-level. The United States goverment , the city government of New Orleans and the government of the State of Louisana were all severely criticized for their handling of the storms aftermath. Hurricane Katrina, although not yet certified, is most likely the costliest hurricane in U.S. history.", "after_revision": "Tropical Storm Zeta has become the first storm of the after crossing over from as that seasons 27th storm, breaking the record set by earlier in December. This makes Zeta the second tropical storm in history to cross over into another season; the first time this occurred was in 1954-55 with . Zeta currently has a top sustained wind speed of 50mph (85 km/h). It is currently about 1,085 miles (1745 km) southwest of the Azores and is proceeding west-southwest at 2mph (4 km/h). Forecasters say it is not expected to become a or threaten land. Zeta formed on December 30, 2005, after the official end of the destructive and record-breaking 2005 Atlantic hurricane season, which ended on November 30, 2005. The 2005 season was notable for the record number of storms it produced (including Zeta), and was the first time storm names used , , and and the second time the letters , , and were used. The season also had the highest-ever number of storms forming in the month of July, and had the highest number of with a total of three, including , the most intense hurricane ever in the Atlantic basin. The most notable of the three Category 5 hurricanes was . Katrina caused over $100 billion ( ) in damage and 1,383 deaths, especially along and coastlines which suffered catastrophic damage. The storm also caused levees to break in leading to the flooding of the city which is located below sea-level. The , the city government of New Orleans , and the government of the State of were all for their handling of the storms aftermath. Hurricane Katrina, although not yet certified, is most likely the costliest hurricane in U.S. history.", "edit_actions": [{"type": "D", "before": "2006 Atlantic hurricane season", "after": null, "start_char_pos": 54, "end_char_pos": 84}, {"type": "D", "before": "2005 Atlantic hurricane season", "after": null, "start_char_pos": 110, "end_char_pos": 140}, {"type": "D", "before": "Hurricane Epsilon", "after": null, "start_char_pos": 196, "end_char_pos": 213}, {"type": "D", "before": "Hurricane Alice", "after": null, "start_char_pos": 372, "end_char_pos": 387}, {"type": "D", "before": "hurricane", "after": null, "start_char_pos": 622, "end_char_pos": 631}, {"type": "R", "before": "V, W and Greek letters", "after": ", , and", "start_char_pos": 942, "end_char_pos": 964}, {"type": "R", "before": "R, S, and T", "after": ", , and", "start_char_pos": 997, "end_char_pos": 1008}, {"type": "D", "before": "Category 5 hurricanes", "after": null, "start_char_pos": 1134, "end_char_pos": 1155}, {"type": "D", "before": "Hurricane Wilma", "after": null, "start_char_pos": 1189, "end_char_pos": 1204}, {"type": "D", "before": "Hurricane Katrina", "after": null, "start_char_pos": 1318, "end_char_pos": 1335}, {"type": "D", "before": "USD", "after": null, "start_char_pos": 1373, "end_char_pos": 1376}, {"type": "R", "before": "Mississippi and Alabama", "after": "and", "start_char_pos": 1424, "end_char_pos": 1447}, {"type": "D", "before": "New Orleans", "after": null, "start_char_pos": 1536, "end_char_pos": 1547}, {"type": "D", "before": "United States goverment", "after": null, "start_char_pos": 1622, "end_char_pos": 1645}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1683, "end_char_pos": 1683}, {"type": "R", "before": "Louisana were all severely criticized", "after": "were all", "start_char_pos": 1719, "end_char_pos": 1756}], "sents_char_pos": [0, 234, 322, 455, 574, 649, 811, 1019, 1261, 1494, 1617, 1800]} {"doc_id": "3113", "revision_depth": "1", "before_revision": "300px|Huygens probe descent to Titan. (illustration by NASA) The Huygens Probe will enter the atmosphere of Saturn 's largest moon, Titan , on January 14 at approximately 9 a.m. UTC . NASA launched Cassini-Huygens, the largest interplanetary space craft ever built, on October 15, 1997. The craft arrived at Saturn orbit in July of 2004. It is the fourth craft to visit Saturn and the first to orbit the planet. The Cassini-Huygens mission is a joint project of NASA and the European Space Agency (ESA). The probe was named after Dutch astronomer Christiaan Huygens , who discovered Titan in 1655. The Cassini orbiter was named for Jean-Dominique Cassini , who discovered other moons of Saturn and the gap between Saturn's rings known as the Cassini Division . References External linksCassini-Huygens at our sister project, Wikipedia Cassini Mission Homepage by the Jet Propulsion Laboratory ESA Huygens Homepage ESA - Where is Cassini-Huygens now? Interactive Flash-Animation of Cassini orbits through 2008%DIFDELCMD < %DIFDELCMD < %%% Category:Science and technology Category:NASA Category:Spa", "after_revision": "The Probe will enter the atmosphere of 's largest moon, , on January 14 at approximately 9 a.m. . launched Cassini-Huygens, the largest interplanetary space craft ever built, on October 15, 1997. The craft arrived at Saturn orbit in July of 2004. It is the fourth craft to visit Saturn and the first to orbit the planet. The Cassini-Huygens mission is a joint project of NASA and the (ESA). The probe was named after Dutch astronomer , who discovered Titan in 1655. The Cassini orbiter was named for , who discovered other moons of Saturn and the gap between Saturn's rings known as the . %DIFDELCMD < %DIFDELCMD < %%% Sister links", "edit_actions": [{"type": "R", "before": "300px|Huygens probe descent to Titan. (illustration by NASA) The Huygens", "after": "The", "start_char_pos": 0, "end_char_pos": 72}, {"type": "D", "before": "Saturn", "after": null, "start_char_pos": 108, "end_char_pos": 114}, {"type": "D", "before": "Titan", "after": null, "start_char_pos": 132, "end_char_pos": 137}, {"type": "D", "before": "UTC", "after": null, "start_char_pos": 178, "end_char_pos": 181}, {"type": "D", "before": "NASA", "after": null, "start_char_pos": 184, "end_char_pos": 188}, {"type": "D", "before": "European Space Agency", "after": null, "start_char_pos": 475, "end_char_pos": 496}, {"type": "D", "before": "Christiaan Huygens", "after": null, "start_char_pos": 547, "end_char_pos": 565}, {"type": "D", "before": "Jean-Dominique Cassini", "after": null, "start_char_pos": 632, "end_char_pos": 654}, {"type": "D", "before": "Cassini Division", "after": null, "start_char_pos": 742, "end_char_pos": 758}, {"type": "D", "before": "References", "after": null, "start_char_pos": 761, "end_char_pos": 771}, {"type": "D", "before": "External linksCassini-Huygens at our sister project, Wikipedia Cassini Mission Homepage by the Jet Propulsion Laboratory ESA Huygens Homepage ESA - Where is Cassini-Huygens now? Interactive Flash-Animation of Cassini orbits through 2008", "after": null, "start_char_pos": 772, "end_char_pos": 1008}, {"type": "R", "before": "Category:Science and technology Category:NASA Category:Spa", "after": "Sister links", "start_char_pos": 1038, "end_char_pos": 1096}], "sents_char_pos": [0, 37, 286, 337, 411, 503, 597, 949]} {"doc_id": "31147", "revision_depth": "1", "before_revision": "Sunderland slumped to their 14th league game without a victory despite a spirited performance against league leaders Chelsea F.C. Records were set before this Sunday afternoon game kicked-off in the North-East; bookmaker's were offering the shortest odds for an away win in the history of the Premier League , as top faced bottom at the Stadium of Light . Sunderland, in the middle of a season breaking records for the wrong reasons, were hoping to avoid a result as bad as the 7-0 defeat local rivals Middlesbrough suffered to Aresnal the day before. Despite pre-match predictions, the Londoners looked out of sorts for much of the first-half, and it was the home side who took a shock-lead on 11 minutes. Jon Terry failed to completely clear a Julio Arca punt into the box, and Liam Lawrence pounced with a low, powerful volley in to the bottom corner. Chelsea were not behind for long; Sunderland defenders were caught-out on 20 minutes, when a William Gallas cross, which looked as though it was headed out of play, was headed back across the face of goal by Joe Cole . Defenders were caught flat-footed, and Argentinian Hernan Crespo was first to react with a close-range header. In the second half Chelsea began to exert authority; they dominated possession and chances and looked most likely to take the lead. Sunderland keeper Kelvin Davis , suffering criticism from Sunderland fans as of late, made a series of superb stops to deny Chelsea the lead. It was a cruel deflection off the head of Dean Whitehead which finally gave the reigning champions the lead on 70 minutes, Dutchman Arjen Robben providing the strike. The game's main talking point occurred moments later, as Robben jumped over advertising boards in order to celebrate the goal with the travelling fans. As stewards scrambled to remove Robben from the clutches of the jubilant Chelsea followers, referee Chris Foy , working to the letter of the law, brandished a second yellow card and sent the midfield playmaker off.", "after_revision": " slumped to their 14th league game without a victory despite a spirited performance against league leaders Chelsea F.C. . Records were set before this Sunday afternoon game kicked-off in the North-East; bookmaker's were offering the shortest odds for an away win in the history of the , as top faced bottom at the . Sunderland, in the middle of a season breaking records for the wrong reasons, were hoping to avoid a result as bad as the 7-0 defeat local rivals Middlesbrough suffered to Arsenal the day before. Despite pre-match predictions, the Londoners looked out of sorts for much of the first-half, and it was the home side who took a shock-lead on 11 minutes. Jon Terry failed to completely clear a punt into the box, and pounced with a low, powerful volley in to the bottom corner. Chelsea were not behind for long; Sunderland defenders were caught-out on 20 minutes, when a cross, which looked as though it was headed out of play, was headed back across the face of goal by . Defenders were caught flat-footed, and Argentinian was first to react with a close-range header. In the second half Chelsea began to exert authority; they dominated possession and chances and looked most likely to take the lead. Sunderland keeper , suffering criticism from Sunderland fans as of late, made a series of superb stops to deny Chelsea the lead. It was a cruel deflection off the head of which finally gave the reigning champions the lead on 70 minutes, Dutchman providing the strike. The game's main talking point occurred moments later, as Robben jumped over advertising boards in order to celebrate the goal with the traveling fans. As stewards scrambled to remove Robben from the clutches of the jubilant Chelsea followers, referee , working to the letter of the law, brandished a second yellow card and sent the midfield playmaker off.", "edit_actions": [{"type": "D", "before": "Sunderland", "after": null, "start_char_pos": 0, "end_char_pos": 10}, {"type": "A", "before": null, "after": ".", "start_char_pos": 130, "end_char_pos": 130}, {"type": "D", "before": "Premier League", "after": null, "start_char_pos": 294, "end_char_pos": 308}, {"type": "D", "before": "Stadium of Light", "after": null, "start_char_pos": 338, "end_char_pos": 354}, {"type": "R", "before": "Aresnal", "after": "Arsenal", "start_char_pos": 529, "end_char_pos": 536}, {"type": "D", "before": "Julio Arca", "after": null, "start_char_pos": 747, "end_char_pos": 757}, {"type": "D", "before": "Liam Lawrence", "after": null, "start_char_pos": 781, "end_char_pos": 794}, {"type": "D", "before": "William Gallas", "after": null, "start_char_pos": 949, "end_char_pos": 963}, {"type": "D", "before": "Joe Cole", "after": null, "start_char_pos": 1064, "end_char_pos": 1072}, {"type": "D", "before": "Hernan Crespo", "after": null, "start_char_pos": 1126, "end_char_pos": 1139}, {"type": "D", "before": "Kelvin Davis", "after": null, "start_char_pos": 1336, "end_char_pos": 1348}, {"type": "D", "before": "Dean Whitehead", "after": null, "start_char_pos": 1502, "end_char_pos": 1516}, {"type": "D", "before": "Arjen Robben", "after": null, "start_char_pos": 1592, "end_char_pos": 1604}, {"type": "R", "before": "travelling", "after": "traveling", "start_char_pos": 1762, "end_char_pos": 1772}, {"type": "D", "before": "Chris Foy", "after": null, "start_char_pos": 1879, "end_char_pos": 1888}], "sents_char_pos": [0, 211, 552, 707, 855, 889, 1185, 1238, 1317, 1459, 1626, 1778]} {"doc_id": "31455", "revision_depth": "1", "before_revision": "URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL ", "after_revision": "\"Sberbank\" building ablaze, Vladivostok (Russia). At 11:45am on January 16, in Vladivostok, Russia, a fire broke out on the three upper floors of the Sberbank building. Photographs taken by eye-witnesses show people, who were trapped, dropping from 8th floor windows to their deaths. According to some reports the firemen who were dispatched to the scene were pre-occupied at the rear of the building. They had apparently been ordered to evacuate the bank and its management from the area that was not under immediate threat. Official Russian media initially denied the fire, accusing the reports of being false. Russian media later confirmed 7 and then, 9 dead. Witnesses and those rescued from the burning building have claimed that the figure exceeds 50. A maintenance employee who worked in the building was quoted as saying, \"I know at least about 13 dead inside ... that's the least I've noticed, not to consider those who've dropped down ... 8 of them dropped, looking at the three already dead on the ground, but they went through the windows without hope to be rescued ... They collected and hid the dead bodies inside. I work at this building! I know its layout very well! To declare, as it become clear, a less number of the dead later.\" \"My daughter worked in a justice department,\" - Natalia, one of the witnesses said. \"She said that there were actually much more dead - up to 70. She went on the dead bodies, getting out from the building \u2026 some of them were so scorched, that it was impossible to identify them\u2026 9 victims? That's a lie!\" Georic, a witness: \"The cops (\"menty\"), whom I know, say that they've been loading the dead bodies all night long.\" Lelya has posted her evidence on January 21, 2006 on the web-site URL \"My brother worked in that building, on the 6th flour. So, the night after the fire they visited the building to collect the documents, etc. and they saw how workers transported the dead bodies. He said, there were 50-60..\" Actions of the officials Eugenia, a witness said, \"who has told you, that fireteam arrived in 3 minutes? Or in 20 minutes? My uncle worked on anouther side of the building. He personally gave a call to the fire department. They said, \"ok, ok, take it easy, here we go...\" as it were just some fun for them, \"nothing serious!\" Reports from the scene say the fire-brigade arrived at least 40 minutes or more from the time the call about the fire was placed. The Fire-safety Department officials state that firemen had the \"objective obstacles\" which hampered rescue efforts. Among them were, barred emergency exits, and a congestion of cars in front of the burning building. The mayor of Vladivostok in reply to a plea \"to rescue those who are still in fire, does human life really cost nothing?\" replied saying that, \"human life costs nothing in Russia.\" Law-enforcement authorities arrested the inspector who had checked the building in July 2004, and exposed a number of irregularities, such as barred windows in stairwells, but failed to control the elimination of these shortcomings. Lyudmila Feofanova, CEO of the Maritime branch of \"Sberbank\", was arrested in Vladivostok in conjunction with the case of the fire which has killed, according to official reports, 9 and seriousely wounded 17 last Monday. The Office of Public Prosecutor accuses L.Feofanova on failure to provide the bank with a fire-prevention system. Mass-media coverage The Russian official news agencies and mass-media report only 9 victims, several bank employees. Five days following the fire, people have launched dozens of forums and web-sites, trying to tell their side of the story. They have created lists of those believed to be killed or those that are unable to be indentified. Related Wikinews External links Video of the fire: , A website about the fire (in Russian) The most complete video of the fire, 39.1Mb (rar-archived)", "edit_actions": [{"type": "R", "before": "URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL URL", "after": "\"Sberbank\" building ablaze, Vladivostok (Russia). At 11:45am on January 16, in Vladivostok, Russia, a fire broke out on the three upper floors of the Sberbank building.", "start_char_pos": 0, "end_char_pos": 2399}, {"type": "A", "before": null, "after": "Photographs taken by eye-witnesses show people, who were trapped, dropping from 8th floor windows to their deaths. According to some reports the firemen who were dispatched to the scene were pre-occupied at the rear of the building. They had apparently been ordered to evacuate the bank and its management from the area that was not under immediate threat.", "start_char_pos": 2400, "end_char_pos": 2400}, {"type": "A", "before": null, "after": "Official Russian media initially denied the fire, accusing the reports of being false.", "start_char_pos": 2401, "end_char_pos": 2401}, {"type": "A", "before": null, "after": "Russian media later confirmed 7 and then, 9 dead. Witnesses and those rescued from the burning building have claimed that the figure exceeds 50.", "start_char_pos": 2402, "end_char_pos": 2402}, {"type": "A", "before": null, "after": "A maintenance employee who worked in the building was quoted as saying, \"I know at least about 13 dead inside ... that's the least I've noticed, not to consider those who've dropped down ... 8 of them dropped, looking at the three already dead on the ground, but they went through the windows without hope to be rescued ... They collected and hid the dead bodies inside. I work at this building! I know its layout very well! To declare, as it become clear, a less number of the dead later.\"", "start_char_pos": 2403, "end_char_pos": 2403}, {"type": "A", "before": null, "after": "\"My daughter worked in a justice department,\" - Natalia, one of the witnesses said. \"She said that there were actually much more dead - up to 70. She went on the dead bodies, getting out from the building \u2026 some of them were so scorched, that it was impossible to identify them\u2026 9 victims? That's a lie!\"", "start_char_pos": 2404, "end_char_pos": 2404}, {"type": "A", "before": null, "after": "Georic, a witness: \"The cops (\"menty\"), whom I know, say that they've been loading the dead bodies all night long.\"", "start_char_pos": 2405, "end_char_pos": 2405}, {"type": "A", "before": null, "after": "Lelya has posted her evidence on January 21, 2006 on the web-site URL \"My brother worked in that building, on the 6th flour. So, the night after the fire they visited the building to collect the documents, etc. and they saw how workers transported the dead bodies. He said, there were 50-60..\"", "start_char_pos": 2406, "end_char_pos": 2406}, {"type": "A", "before": null, "after": "Actions of the officials", "start_char_pos": 2407, "end_char_pos": 2407}, {"type": "A", "before": null, "after": "Eugenia, a witness said, \"who has told you, that fireteam arrived in 3 minutes? Or in 20 minutes? My uncle worked on anouther side of the building. He personally gave a call to the fire department. They said, \"ok, ok, take it easy, here we go...\" as it were just some fun for them, \"nothing serious!\"", "start_char_pos": 2408, "end_char_pos": 2408}, {"type": "A", "before": null, "after": "Reports from the scene say the fire-brigade arrived at least 40 minutes or more from the time the call about the fire was placed.", "start_char_pos": 2409, "end_char_pos": 2409}, {"type": "A", "before": null, "after": "The Fire-safety Department officials state that firemen had the \"objective obstacles\" which hampered rescue efforts. Among them were, barred emergency exits, and a congestion of cars in front of the burning building.", "start_char_pos": 2410, "end_char_pos": 2410}, {"type": "A", "before": null, "after": "The mayor of Vladivostok in reply to a plea \"to rescue those who are still in fire, does human life really cost nothing?\" replied saying that, \"human life costs nothing in Russia.\"", "start_char_pos": 2411, "end_char_pos": 2411}, {"type": "A", "before": null, "after": "Law-enforcement authorities arrested the inspector who had checked the building in July 2004, and exposed a number of irregularities, such as barred windows in stairwells, but failed to control the elimination of these shortcomings.", "start_char_pos": 2412, "end_char_pos": 2412}, {"type": "A", "before": null, "after": "Lyudmila Feofanova, CEO of the Maritime branch of \"Sberbank\", was arrested in Vladivostok in conjunction with the case of the fire which has killed, according to official reports, 9 and seriousely wounded 17 last Monday.", "start_char_pos": 2413, "end_char_pos": 2413}, {"type": "A", "before": null, "after": "The Office of Public Prosecutor accuses L.Feofanova on failure to provide the bank with a fire-prevention system.", "start_char_pos": 2414, "end_char_pos": 2414}, {"type": "A", "before": null, "after": "Mass-media coverage", "start_char_pos": 2415, "end_char_pos": 2415}, {"type": "A", "before": null, "after": "The Russian official news agencies and mass-media report only 9 victims, several bank employees.", "start_char_pos": 2416, "end_char_pos": 2416}, {"type": "A", "before": null, "after": "Five days following the fire, people have launched dozens of forums and web-sites, trying to tell their side of the story. They have created lists of those believed to be killed or those that are unable to be indentified.", "start_char_pos": 2417, "end_char_pos": 2417}, {"type": "A", "before": null, "after": "Related Wikinews", "start_char_pos": 2418, "end_char_pos": 2418}, {"type": "A", "before": null, "after": "External links Video of the fire: , A website about the fire (in Russian) The most complete video of the fire, 39.1Mb (rar-archived)", "start_char_pos": 2419, "end_char_pos": 2419}], "sents_char_pos": [0, 12, 24, 36, 48, 60, 72, 84, 96, 108, 120, 132, 144, 156, 168, 180, 192, 204, 216, 228, 240, 252, 264, 276, 288, 300, 312, 324, 336, 348, 360, 372, 384, 396, 408, 420, 432, 444, 456, 468, 480, 492, 504, 516, 528, 540, 552, 564, 576, 588, 600, 612, 624, 636, 648, 660, 672, 684, 696, 708, 720, 732, 744, 756, 768, 780, 792, 804, 816, 828, 840, 852, 864, 876, 888, 900, 912, 924, 936, 948, 960, 972, 984, 996, 1008, 1020, 1032, 1044, 1056, 1068, 1080, 1092, 1104, 1116, 1128, 1140, 1152, 1164, 1176, 1188, 1200, 1212, 1224, 1236, 1248, 1260, 1272, 1284, 1296, 1308, 1320, 1332, 1344, 1356, 1368, 1380, 1392, 1404, 1416, 1428, 1440, 1452, 1464, 1476, 1488, 1500, 1512, 1524, 1536, 1548, 1560, 1572, 1584, 1596, 1608, 1620, 1632, 1644, 1656, 1668, 1680, 1692, 1704, 1716, 1728, 1740, 1752, 1764, 1776, 1788, 1800, 1812, 1824, 1836, 1848, 1860, 1872, 1884, 1896, 1908, 1920]} {"doc_id": "31572", "revision_depth": "1", "before_revision": "Jos\u00e9 S\u00f3crates, prime minister of Portugal, said he was \"satisfied with the decision of Volkswagen to produce a new model in the factory of Palmela,\" and considered that the decision, \"reflected the confidence [of the investors] in the portuguese economy.\" Volkswagen will reveal the new model to be produced next week. By 2008 the factory at Palmela will be only producing the multi-purpose vehicle Sharan and the Eos models. With the end of the production of the multi-purpose vehicle, the factory needs to garantee new product lines, since the new Eos is insufficient to maintain the current 2,790 workers.", "after_revision": "Jos\u00e9 S\u00f3crates, prime minister of Portugal, said he was \"satisfied with the decision of Volkswagen to produce a new model in the factory of Palmela,\" and considered that the decision, \"reflected the confidence [of the investors] in the Portuguese economy.\" Volkswagen will reveal the new model to be produced next week. By 2008 , the factory at Palmela will only be producing the multi-purpose vehicle Sharan and the Eos models. With the end of the production of the multi-purpose vehicle, the factory needs to guarantee new product lines, since the new Eos is not sufficient to maintain the current 2,790 workers.", "edit_actions": [{"type": "R", "before": "portuguese", "after": "Portuguese", "start_char_pos": 235, "end_char_pos": 245}, {"type": "A", "before": null, "after": ",", "start_char_pos": 327, "end_char_pos": 327}, {"type": "R", "before": "be only", "after": "only be", "start_char_pos": 356, "end_char_pos": 363}, {"type": "R", "before": "garantee", "after": "guarantee", "start_char_pos": 509, "end_char_pos": 517}, {"type": "R", "before": "insufficient", "after": "not sufficient", "start_char_pos": 558, "end_char_pos": 570}], "sents_char_pos": [0, 255, 318, 426]} {"doc_id": "32786", "revision_depth": "1", "before_revision": "190px|The chambers of the U.S. Senate are located on Capitol Hill in Washington, D.C. Staff members of the offices of United States Senators, using Senate-linked IP addresses , have been editing Wikipedia, a free online encyclopedia that allows its users to edit its content. In some cases, they have removed facts from the articles. __NOTOC__ Using the public history of edits on Wikipedia, Wikinews reporters collected every Senate IP address from which Wikipedia edits had been made as of February 3, then examined where the IPs came from and the edits that were made from computers connected at those addresses. IP, or Internet Protocol, addresses are unique numbers electronic devices use to communicate with each other on an individual basis. The investigation showed the vast majority of edits from Senate IPs were beneficial and helpful to Wikipedia. Examples include the creation of the articles on Click Back America , which organizes students to promote microfinance in the developing world, and Washington's Tomb , which was designed to hold the body of first U.S. President George Washington within the White House Capitol building; and significantly expanding the article on closed sessions of the United States Senate in November. Dozens of small corrections have been made to grammar, spelling, or small facts \u2014 many of them related to the Senate. Senators' staff members have sometimes had to fight to correct inaccuracies. An edit to Jay Rockefeller's article by his staff removed information which may have been biased or untrue. The staff member who edited said, \"Apologies, I was new to using Wikipedia, and I didn't fully realize the workings of the website,\" after other users continuously reinserted the information. The staffer removed the suspect paragraphs 12 times until another Wikipedia user finally removed the information. Four days later, Wikipedia founder Jimmy Wales got involved. Staffers in the offices of Senator Joe Biden , who, according to his changed Wikipedia biography, \"announced in mid-June 2005 that he will seek the Democratic Presidential nomination in 2008 if he believes his message and vision for the country resonate with Americans,\" removed a paragraph about a 1996 plagiarism scandal, as well as changing the section regarding a possible 2008 candidacy to read very positively. A second staffer toned down and removed information about other plagiarism issues as well. The same addresses from Biden's office edited the article on Hamas, which has recently won a majority in the Palestinian Legislative Council, and is listed as a terrorist organization by Australia, Canada, the European Union, Israel, and the United States, to give its first two paragraphs a more biased stance by removing information about its social welfare programs. Conrad Burns References, citations, and descriptions of Conrad Burns ' use of the word \"ragheads\" were removed from Wikipedia's article, as was mention of legislation, co-sponsored by Burns, that would reduce Native American tribal sovereignty. These were replaced by a paragraph titled \"A Voice for the Farmer\". The citations supported the discussion of Senator Burns's legislative record regarding tribal sovereignty . Norm Coleman The staffers of Senator Norm Coleman changed a description of Coleman as a liberal Democrat in college to an \"activist Democrat,\" and then to \"an active college student.\" They removed references to Coleman's voting record during his first year of Congress, which lined up with President Bush 98\\% of the time, which cited Congressional Quarterly . They also removed a reference to Coleman being persuaded by Karl Rove to run for senator instead of governor in 2002. According to the St. Paul Pioneer Press , \"Coleman's decision to run for senator, rather than governor, was sealed during a walk with President Bush in the White House's Rose Garden,\" rather than Karl Rove. Rove had actually persuaded the former House majority leader of Minnesota and current governor, Tim Pawlenty, not to challenge Norm Coleman in the Senate elections. Still, other portions of the edit removed references to Karl Rove entirely, and their citations, while accentuating the positive side of several issues, including changing \"a budget bill that cut funding from a number of programs\" to \"a deficit-reduction bill.\" Dianne Feinstein The California block of Senate IP addresses made several edits to the Dianne Feinstein article, removing reference to her membership in the Trilateral Commission and to her net worth, with husband Richard C. Blum , but also adding an extensive list of awards. Tom Harkin The staffers of Senator Tom Harkin removed a paragraph relating to Harkin's having falsely claimed to have flown combat missions over North Vietnam, and his subsequent recantation after inquiries by the Wall Street Journal and Barry Goldwater . Another paragraph removed related to a supposed pro-Israeli stance. When examining the edit behavior of IPs it also tended to match the predicted pattern. IPs which were assigned to Florida had edits to Bill Nelson and Mel Martinez and other Florida-related pages primarily, while those assigned to California had edited Dianne Feinstein . Edits coming from the U.S. House of Representatives were less traceable because they came through a proxy server---meaning they all showed up under one IP address.", "after_revision": "190px|The chambers of the U.S. Senate are located on in Staff members of the offices of United States Senators, using Senate-linked , have been editing Wikipedia, a free online encyclopedia that allows its users to edit its content. In some cases, they have removed facts from the articles. __NOTOC__ Using the public history of edits on Wikipedia, Wikinews reporters collected every Senate IP address from which Wikipedia edits had been made as of February 3, then examined where the IPs came from and the edits that were made from computers connected at those addresses. IP, or Internet Protocol, addresses are unique numbers electronic devices use to communicate with each other on an individual basis. The investigation showed the vast majority of edits from Senate IPs were beneficial and helpful to Wikipedia. Examples include the creation of the articles on , which organizes students to promote in the developing world, and , which was designed to hold the body of first U.S. President George Washington within the White House Capitol building; and significantly expanding the article on in November. Dozens of small corrections have been made to grammar, spelling, or small facts \u2014 many of them related to the Senate. Senators' staff members have sometimes had to fight to correct inaccuracies. An edit to Jay Rockefeller's article by his staff removed information which may have been biased or untrue. The staff member who edited said, \"Apologies, I was new to using Wikipedia, and I didn't fully realize the workings of the website,\" after other users continuously reinserted the information. The staffer removed the suspect paragraphs 12 times until another Wikipedia user finally removed the information. Four days later, Wikipedia founder got involved. Staffers in the offices of Senator , who, according to his changed Wikipedia biography, \"announced in mid-June 2005 that he will seek the Democratic Presidential nomination in 2008 if he believes his message and vision for the country resonate with Americans,\" removed a paragraph about a 1996 plagiarism scandal, as well as changing the section regarding a possible 2008 candidacy to read very positively. A second staffer toned down and removed information about other plagiarism issues as well. The same addresses from Biden's office edited the article on Hamas, which has recently won a majority in the Palestinian Legislative Council, and is listed as a terrorist organization by Australia, Canada, the European Union, Israel, and the United States, to give its first two paragraphs a more biased stance by removing information about its social welfare programs. References, citations, and descriptions of ' use of the word \"ragheads\" were removed from Wikipedia's article, as was mention of legislation, co-sponsored by Burns, that would reduce Native American tribal sovereignty. These were replaced by a paragraph titled \"A Voice for the Farmer\". The citations supported the discussion of Senator Burns's legislative record regarding . The staffers of Senator changed a description of Coleman as a liberal Democrat in college to an \"activist Democrat,\" and then to \"an active college student.\" They removed references to Coleman's voting record during his first year of Congress, which lined up with President Bush 98\\% of the time, which cited . They also removed a reference to Coleman being persuaded by to run for senator instead of governor in 2002. According to the , \"Coleman's decision to run for senator, rather than governor, was sealed during a walk with President Bush in the White House's Rose Garden,\" rather than Karl Rove. Rove had actually persuaded the former House majority leader of Minnesota and current governor, Tim Pawlenty, not to challenge Norm Coleman in the Senate elections. Still, other portions of the edit removed references to Karl Rove entirely, and their citations, while accentuating the positive side of several issues, including changing \"a budget bill that cut funding from a number of programs\" to \"a deficit-reduction bill.\" The California block of Senate IP addresses made several edits to the article, removing reference to her membership in the Trilateral Commission and to her net worth, with husband , but also adding an extensive list of awards. The staffers of Senator removed a paragraph relating to Harkin's having falsely claimed to have flown combat missions over North Vietnam, and his subsequent recantation after inquiries by the Wall Street Journal and . Another paragraph removed related to a supposed pro-Israeli stance. When examining the edit behavior of IPs it also tended to match the predicted pattern. IPs which were assigned to Florida had edits to and and other Florida-related pages primarily, while those assigned to California had edited . Edits coming from the U.S. House of Representatives were less traceable because they came through a ---meaning they all showed up under one IP address.", "edit_actions": [{"type": "R", "before": "Capitol Hill in Washington, D.C.", "after": "in", "start_char_pos": 53, "end_char_pos": 85}, {"type": "D", "before": "IP addresses", "after": null, "start_char_pos": 162, "end_char_pos": 174}, {"type": "D", "before": "Click Back America", "after": null, "start_char_pos": 908, "end_char_pos": 926}, {"type": "D", "before": "microfinance", "after": null, "start_char_pos": 965, "end_char_pos": 977}, {"type": "D", "before": "Washington's Tomb", "after": null, "start_char_pos": 1007, "end_char_pos": 1024}, {"type": "D", "before": "closed sessions of the United States Senate", "after": null, "start_char_pos": 1189, "end_char_pos": 1232}, {"type": "D", "before": "Jimmy Wales", "after": null, "start_char_pos": 1890, "end_char_pos": 1901}, {"type": "D", "before": "Joe Biden", "after": null, "start_char_pos": 1951, "end_char_pos": 1960}, {"type": "D", "before": "Conrad Burns", "after": null, "start_char_pos": 2794, "end_char_pos": 2806}, {"type": "D", "before": "Conrad Burns", "after": null, "start_char_pos": 2850, "end_char_pos": 2862}, {"type": "D", "before": "tribal sovereignty", "after": null, "start_char_pos": 3194, "end_char_pos": 3212}, {"type": "D", "before": "Norm Coleman", "after": null, "start_char_pos": 3215, "end_char_pos": 3227}, {"type": "D", "before": "Norm Coleman", "after": null, "start_char_pos": 3252, "end_char_pos": 3264}, {"type": "D", "before": "Congressional Quarterly", "after": null, "start_char_pos": 3550, "end_char_pos": 3573}, {"type": "D", "before": "Karl Rove", "after": null, "start_char_pos": 3636, "end_char_pos": 3645}, {"type": "D", "before": "St. Paul Pioneer Press", "after": null, "start_char_pos": 3711, "end_char_pos": 3733}, {"type": "D", "before": "Dianne Feinstein", "after": null, "start_char_pos": 4328, "end_char_pos": 4344}, {"type": "D", "before": "Dianne Feinstein", "after": null, "start_char_pos": 4415, "end_char_pos": 4431}, {"type": "D", "before": "Richard C. Blum", "after": null, "start_char_pos": 4542, "end_char_pos": 4557}, {"type": "D", "before": "Tom Harkin", "after": null, "start_char_pos": 4605, "end_char_pos": 4615}, {"type": "D", "before": "Tom Harkin", "after": null, "start_char_pos": 4640, "end_char_pos": 4650}, {"type": "D", "before": "Barry Goldwater", "after": null, "start_char_pos": 4843, "end_char_pos": 4858}, {"type": "D", "before": "Bill Nelson and Mel Martinez", "after": null, "start_char_pos": 5064, "end_char_pos": 5092}, {"type": "A", "before": null, "after": "and", "start_char_pos": 5097, "end_char_pos": 5097}, {"type": "D", "before": "Dianne Feinstein", "after": null, "start_char_pos": 5183, "end_char_pos": 5199}, {"type": "R", "before": "proxy server---meaning", "after": "---meaning", "start_char_pos": 5302, "end_char_pos": 5324}], "sents_char_pos": [0, 275, 333, 615, 748, 858, 1145, 1245, 1363, 1440, 1548, 1740, 1854, 1915, 2332, 2423, 2793, 3038, 3106, 3214, 3398, 3575, 3693, 3900, 4065, 4327, 4604, 4860, 4928, 5015]} {"doc_id": "3330", "revision_depth": "1", "before_revision": "Open letter from international intellectuals, to the international public opinion The kidnapping of Rodrigo Granda, carried out in Venezuelan territory presumably by agents of the Colombian police, is an attempt to create difficulties between both countries in order to debilitate the Bolivarian movement. An additional effect is to reduce the international prestige of the conduct of President Hugo Ch\u00e1vez creating doubts about a possible Venezuelan implication in said kidnapping. All intended to cause a possible armed intervention of the United States as a result of the conflict.%DIFDELCMD < %DIFDELCMD < %%% In view of this stratagem, the undersigned, artists, writers, intellectuals of Our America and the world declare our unrestricted support to the process of social change initiated in Venezuela and declare our adhesion and solidarity to the Bolivarian movement and the diaphanous conduct of its leader President Hugo Ch\u00e1vez Fr\u00edas. Ernesto Cardenal (Nicaragua)%DIFDELCMD < %DIFDELCMD < %%% Alfonso Sastre (Spain) Atilio Bor\u00f3n (Argentina)%DIFDELCMD < %DIFDELCMD < %%% Emir Sader (Brazil,professor) Lisandro Otero (Cuba)%DIFDELCMD < %DIFDELCMD < %%% Theotonio Dos Santos (Brazil) Fernando Morais (Brazil, writer, journalist)%DIFDELCMD < %DIFDELCMD < %%% Georges Labica (France) Saul Landau (USA)%DIFDELCMD < %DIFDELCMD < %%% Hernando Calvo Ospina (Colombia, writer, journalist) Pascual Serrano (Spain)%DIFDELCMD < %DIFDELCMD < %%% Domenico Losurdo (Italy) Gilberto Lopez y Rivas%DIFDELCMD < %DIFDELCMD < %%% Ramon Chao (Spain, musician, writer, journalist) James D. Cockcroft%DIFDELCMD < %DIFDELCMD < %%% Santiago Alba Rico Alex Cox%DIFDELCMD < %DIFDELCMD < %%% Stella Calloni (Argentina, writer, journalist) Carlo Frabetti (Italy, journalist, writer)%DIFDELCMD < %DIFDELCMD < %%% Carlos Fazio (Mexico, journalist, writer) Miguel D'Escoto (Nicaragua, priest)%DIFDELCMD < %DIFDELCMD < %%% Miguel Urbano (Portugal, journalist) Juan Brom%DIFDELCMD < %DIFDELCMD < %%% Luis Hern\u00e1ndez Navarro (Mexico, journalist) Andr\u00e9s Sorel (Spanish, writer)%DIFDELCMD < %DIFDELCMD < %%% John Gerassi (USA, Professor) Marcos Roitman Rosenmann (Spain, Professor)%DIFDELCMD < %DIFDELCMD < %%% David L. Raby Manuel Cabieses (Chile, journalist)%DIFDELCMD < %DIFDELCMD < %%% Eva Forest%DIFDELCMD < %DIFDELCMD < %%% Rev. Ra\u00fal Su\u00e1rez(Cuba)%DIFDELCMD < %DIFDELCMD < %%% Francisco Jarauta%DIFDELCMD < %DIFDELCMD < %%% Eva Sastre Forest%DIFDELCMD < %DIFDELCMD < %%% General Vasco Gon\u00e7alves%DIFDELCMD < %DIFDELCMD < %%% H\u00e9ctor D\u00edaz-Polanco%DIFDELCMD < %DIFDELCMD < %%% Manuel Talens (Spanish, writer)%DIFDELCMD < %DIFDELCMD < %%% Alejandro Moreano (Equador, journalist)%DIFDELCMD < %DIFDELCMD < %%% Pablo Armando Fern\u00e1ndez (Cuba,writer)%DIFDELCMD < %DIFDELCMD < %%% Keith Ellis%DIFDELCMD < %DIFDELCMD < %%% Dick Emanuelsson (Colombia, journalist)%DIFDELCMD < %DIFDELCMD < %%% Carlos Fern\u00e1ndez Liria (Venezuela, writer)%DIFDELCMD < %DIFDELCMD < %%% Horacio A. L\u00f3pez%DIFDELCMD < %DIFDELCMD < %%% Angeles Maestro%DIFDELCMD < %DIFDELCMD < %%% V\u00edctor R\u00edos%DIFDELCMD < %DIFDELCMD < %%% Danielle Bleitrach%DIFDELCMD < %DIFDELCMD < %%% Alcira Argumedo%DIFDELCMD < %DIFDELCMD < %%% Quintin Cabrera%DIFDELCMD < %DIFDELCMD < %%% Mark Rosenzweig%DIFDELCMD < %DIFDELCMD < %%% Arturo Corchera%DIFDELCMD < %DIFDELCMD < %%% Cuauht\u00e9moc Amezcua Dromundo%DIFDELCMD < %DIFDELCMD < %%% Tubal P\u00e1ez%DIFDELCMD < %DIFDELCMD < %%% Irene Amador%DIFDELCMD < %DIFDELCMD < %%% Roger Grevoul%DIFDELCMD < %DIFDELCMD < %%% Julie Ruben%DIFDELCMD < %DIFDELCMD < %%% Anamar\u00eda D\u00edaz%DIFDELCMD < %DIFDELCMD < %%% Carlos Alberto de Almeida%DIFDELCMD < %DIFDELCMD < %%% Alberto Lecchi%DIFDELCMD < %DIFDELCMD < %%% Rosa Miriam Elizalde%DIFDELCMD < %DIFDELCMD < %%% Fran\u00e7ois Duteil%DIFDELCMD < %DIFDELCMD < %%% Humberto Tumini%DIFDELCMD < %DIFDELCMD < %%% Carlos Tena%DIFDELCMD < %DIFDELCMD < %%% Elizabeth Martinez%DIFDELCMD < %DIFDELCMD < %%% Juan Carlos Monedero%DIFDELCMD < %DIFDELCMD < %%% Solange R. Echeverria%DIFDELCMD < %DIFDELCMD < %%% Vicente Romano%DIFDELCMD < %DIFDELCMD < %%% Jane de la Selva%DIFDELCMD < %DIFDELCMD < %%% C\u00e9sar Fern\u00e1ndez%DIFDELCMD < %DIFDELCMD < %%% Norma N\u00fa\u00f1ez Montoto%DIFDELCMD < %DIFDELCMD < %%% Marcela Cornejo Z.%DIFDELCMD < %DIFDELCMD < %%% Laurindo Leal Filho%DIFDELCMD < %DIFDELCMD < %%% Nayar L\u00f3pez Castellanos%DIFDELCMD < %DIFDELCMD < %%% Julio C. Gambina%DIFDELCMD < %DIFDELCMD < %%% Octavio Mercado Gonz\u00e1lez%DIFDELCMD < %DIFDELCMD < %%% Olivia Vidal L\u00f3pez%DIFDELCMD < %DIFDELCMD < %%% Miguel \u00c1ngel Buenrostro%DIFDELCMD < %DIFDELCMD < %%% Juan Carlos Volnovich%DIFDELCMD < %DIFDELCMD < %%% Berta Joubert-Ceci%DIFDELCMD < %DIFDELCMD < %%% Jorge Ceballos%DIFDELCMD < %DIFDELCMD < %%% Isaac Rudnik%DIFDELCMD < %DIFDELCMD < %%% Hildebrando P\u00e8rez Grande%DIFDELCMD < %DIFDELCMD < %%% Manuel Ortega Hegg%DIFDELCMD < %DIFDELCMD < %%% H\u00e9lio Doyle%DIFDELCMD < %DIFDELCMD < %%% Dr. Rub\u00e9n Cant\u00fa Chapa%DIFDELCMD < %DIFDELCMD < %%% Corina Mestre%DIFDELCMD < %DIFDELCMD < %%% Manuel Sa Marques%DIFDELCMD < %DIFDELCMD < %%% Oscar-Ren\u00e9 Vargas%DIFDELCMD < %DIFDELCMD < %%% Henri Alleg%DIFDELCMD < %DIFDELCMD < %%% Roberto Mastroianni%DIFDELCMD < %DIFDELCMD < %%% Daniel Chavarr\u00eda%DIFDELCMD < %DIFDELCMD < %%% El\u00edas Letelier-Ruz%DIFDELCMD < %DIFDELCMD < %%% Pedro Pablo Rodr\u00edguez%DIFDELCMD < %DIFDELCMD < %%% Beatriz Rajland%DIFDELCMD < %DIFDELCMD < %%% Victor Casaus%DIFDELCMD < %DIFDELCMD < %%% Luciana Castellina%DIFDELCMD < %DIFDELCMD < %%% Jorge Ra\u00fal Rodr\u00edguez%DIFDELCMD < %DIFDELCMD < %%% Adalberto Santana%DIFDELCMD < %DIFDELCMD < %%% Rolando Rodr\u00edguez%DIFDELCMD < %DIFDELCMD < %%% Lourdes Gonz\u00e1lez%DIFDELCMD < %DIFDELCMD < %%% Rita Terranova%DIFDELCMD < %DIFDELCMD < %%% Alicia Castellanos%DIFDELCMD < %DIFDELCMD < %%% Rolando Gonz\u00e1lez Patricio%DIFDELCMD < %DIFDELCMD < %%% Paulina Fernandez%DIFDELCMD < %DIFDELCMD < %%% Vicente Feli\u00fa%DIFDELCMD < %DIFDELCMD < %%% Rafael Cuevas Molina%DIFDELCMD < %DIFDELCMD < %%% Carlos A. Lozano Guill\u00e9n%DIFDELCMD < %DIFDELCMD < %%% Ra\u00fal Villegas D\u00e1valos%DIFDELCMD < %DIFDELCMD < %%% Sergio Guerra%DIFDELCMD < %DIFDELCMD < %%% Enrique Ubieta%DIFDELCMD < %DIFDELCMD < %%% Fernando L\u00f3pez D\u00b4Alejandro%DIFDELCMD < %DIFDELCMD < %%% Ana Daglio%DIFDELCMD < %DIFDELCMD < %%% Oscar Gonz\u00e1lez%DIFDELCMD < %DIFDELCMD < %%% Jorge Timossi%DIFDELCMD < %DIFDELCMD < %%% Carlos Oliva%DIFDELCMD < %DIFDELCMD < %%% Ana Mar\u00eda Vera Smith%DIFDELCMD < %DIFDELCMD < %%% Salvador L\u00f3pez Arnal%DIFDELCMD < %DIFDELCMD < %%% Jos\u00e9 Dos Santos%DIFDELCMD < %DIFDELCMD < %%% Humberto Arenal%DIFDELCMD < %DIFDELCMD < %%% Iris Galindo%DIFDELCMD < %DIFDELCMD < %%% Jaime M\u00fchlrad Zimmermann%DIFDELCMD < %DIFDELCMD < %%% Pedro de la Hoz%DIFDELCMD < %DIFDELCMD < %%% Maritza Capote%DIFDELCMD < %DIFDELCMD < %%% Enrique Cirules%DIFDELCMD < %DIFDELCMD < %%% Carlos Alzugaray Treto%DIFDELCMD < %DIFDELCMD < %%% Toty Flores, Argentina.%DIFDELCMD < %DIFDELCMD < %%% Daniel Rodr\u00edguez%DIFDELCMD < %DIFDELCMD < %%% Alberto Faya%DIFDELCMD < %DIFDELCMD < %%% Marilyn Bobes%DIFDELCMD < %DIFDELCMD < %%% Miguel Alvarez%DIFDELCMD < %DIFDELCMD < %%% Carlos Roberto%DIFDELCMD < %DIFDELCMD < %%% Alberto Luis Tabares%DIFDELCMD < %DIFDELCMD < %%% Daniel De Santis Mesa%DIFDELCMD < %DIFDELCMD < %%% Manuel Henr\u00edquez Lagarde%DIFDELCMD < %DIFDELCMD < %%% Mar\u00eda Toledano%DIFDELCMD < %DIFDELCMD < %%% Manuel Fern\u00e1ndez-Cuesta%DIFDELCMD < %DIFDELCMD < %%% Rafael Hern\u00e1ndez%DIFDELCMD < %DIFDELCMD < %%% Manuel L\u00f3pez Oliva%DIFDELCMD < %DIFDELCMD < %%% Santiago Pujol%DIFDELCMD < %DIFDELCMD < %%% Aurelio Alonso Tejada%DIFDELCMD < %DIFDELCMD < %%% Alberto Guerra Naranjo%DIFDELCMD < %DIFDELCMD < %%% Felix Contreras%DIFDELCMD < %DIFDELCMD < %%% Magaly S\u00e1nchez Ochoa%DIFDELCMD < %DIFDELCMD < %%% Marina Norma Rodriguez Lopez%DIFDELCMD < %DIFDELCMD < %%% Lino Arturo Neira Betancourt%DIFDELCMD < %DIFDELCMD < %%% Jos\u00e9 Luis Fari\u00f1as%DIFDELCMD < %DIFDELCMD < %%% Juana Garc\u00eda Ab\u00e1s%DIFDELCMD < %DIFDELCMD < %%% Virtudes Feli\u00fa%DIFDELCMD < %DIFDELCMD < %%% Gioia Minuti%DIFDELCMD < %DIFDELCMD < %%% References%DIFDELCMD < %DIFDELCMD < %DIFDELCMD < %%% See Also Uribe-Chavez meeting postponed February 4, 2005. Venezuela-Colombia crisis:Castro intervenes, Chavez and Uribe scheduled to meet February 01, 2005. Venezuela-Colombia crisis continues January 24, 2005. Brazilian President meets President of Colombia January 20, 2005. Colombia releases official notice in response to Venezuela, January 17, 2005. Capture of FARC member creates crisis between Venezuela and Colombia, January 15, 2005.%DIFDELCMD < %DIFDELCMD < %%% Category:January 17, 2005 Category:Colombia Category:Venezuela Category:South America Category:Politics and conflicts Category:Published%DIFDELCMD < %DIFDELCMD < %%% Category:Hugo Chave", "after_revision": " %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% Related news", "edit_actions": [{"type": "D", "before": "Open letter from international intellectuals, to the international public opinion", "after": null, "start_char_pos": 0, "end_char_pos": 81}, {"type": "D", "before": "The kidnapping of Rodrigo Granda, carried out in Venezuelan territory presumably by agents of the Colombian police, is an attempt to create difficulties between both countries in order to debilitate the Bolivarian movement. An additional effect is to reduce the international prestige of the conduct of President Hugo Ch\u00e1vez creating doubts about a possible Venezuelan implication in said kidnapping. All intended to cause a possible armed intervention of the United States as a result of the conflict.", "after": null, "start_char_pos": 82, "end_char_pos": 584}, {"type": "D", "before": "In view of this stratagem, the undersigned, artists, writers, intellectuals of Our America and the world declare our unrestricted support to the process of social change initiated in Venezuela and declare our adhesion and solidarity to the Bolivarian movement and the diaphanous conduct of its leader President Hugo Ch\u00e1vez Fr\u00edas.", "after": null, "start_char_pos": 614, "end_char_pos": 943}, {"type": "D", "before": "Ernesto Cardenal (Nicaragua)", "after": null, "start_char_pos": 944, "end_char_pos": 972}, {"type": "D", "before": "Alfonso Sastre (Spain)", "after": null, "start_char_pos": 1002, "end_char_pos": 1024}, {"type": "D", "before": "Atilio Bor\u00f3n (Argentina)", "after": null, "start_char_pos": 1025, "end_char_pos": 1049}, {"type": "D", "before": "Emir Sader (Brazil,professor)", "after": null, "start_char_pos": 1079, "end_char_pos": 1108}, {"type": "D", "before": "Lisandro Otero (Cuba)", "after": null, "start_char_pos": 1109, "end_char_pos": 1130}, {"type": "D", "before": "Theotonio Dos Santos (Brazil)", "after": null, "start_char_pos": 1160, "end_char_pos": 1189}, {"type": "D", "before": "Fernando Morais (Brazil, writer, journalist)", "after": null, "start_char_pos": 1190, "end_char_pos": 1234}, {"type": "D", "before": "Georges Labica (France)", "after": null, "start_char_pos": 1264, "end_char_pos": 1287}, {"type": "D", "before": "Saul Landau (USA)", "after": null, "start_char_pos": 1288, "end_char_pos": 1305}, {"type": "D", "before": "Hernando Calvo Ospina (Colombia, writer, journalist)", "after": null, "start_char_pos": 1335, "end_char_pos": 1387}, {"type": "D", "before": "Pascual Serrano (Spain)", "after": null, "start_char_pos": 1388, "end_char_pos": 1411}, {"type": "D", "before": "Domenico Losurdo (Italy)", "after": null, "start_char_pos": 1441, "end_char_pos": 1465}, {"type": "D", "before": "Gilberto Lopez y Rivas", "after": null, "start_char_pos": 1466, "end_char_pos": 1488}, {"type": "D", "before": "Ramon Chao (Spain, musician, writer, journalist)", "after": null, "start_char_pos": 1518, "end_char_pos": 1566}, {"type": "D", "before": "James D. Cockcroft", "after": null, "start_char_pos": 1567, "end_char_pos": 1585}, {"type": "D", "before": "Santiago Alba Rico", "after": null, "start_char_pos": 1615, "end_char_pos": 1633}, {"type": "D", "before": "Alex Cox", "after": null, "start_char_pos": 1634, "end_char_pos": 1642}, {"type": "D", "before": "Stella Calloni (Argentina, writer, journalist)", "after": null, "start_char_pos": 1672, "end_char_pos": 1718}, {"type": "D", "before": "Carlo Frabetti (Italy, journalist, writer)", "after": null, "start_char_pos": 1719, "end_char_pos": 1761}, {"type": "D", "before": "Carlos Fazio (Mexico, journalist, writer)", "after": null, "start_char_pos": 1791, "end_char_pos": 1832}, {"type": "D", "before": "Miguel D'Escoto (Nicaragua, priest)", "after": null, "start_char_pos": 1833, "end_char_pos": 1868}, {"type": "D", "before": "Miguel Urbano (Portugal, journalist)", "after": null, "start_char_pos": 1898, "end_char_pos": 1934}, {"type": "D", "before": "Juan Brom", "after": null, "start_char_pos": 1935, "end_char_pos": 1944}, {"type": "D", "before": "Luis Hern\u00e1ndez Navarro (Mexico, journalist)", "after": null, "start_char_pos": 1974, "end_char_pos": 2017}, {"type": "D", "before": "Andr\u00e9s Sorel (Spanish, writer)", "after": null, "start_char_pos": 2018, "end_char_pos": 2048}, {"type": "D", "before": "John Gerassi (USA, Professor)", "after": null, "start_char_pos": 2078, "end_char_pos": 2107}, {"type": "D", "before": "Marcos Roitman Rosenmann (Spain, Professor)", "after": null, "start_char_pos": 2108, "end_char_pos": 2151}, {"type": "D", "before": "David L. Raby", "after": null, "start_char_pos": 2181, "end_char_pos": 2194}, {"type": "D", "before": "Manuel Cabieses (Chile, journalist)", "after": null, "start_char_pos": 2195, "end_char_pos": 2230}, {"type": "D", "before": "Eva Forest", "after": null, "start_char_pos": 2260, "end_char_pos": 2270}, {"type": "D", "before": "Rev. Ra\u00fal Su\u00e1rez(Cuba)", "after": null, "start_char_pos": 2300, "end_char_pos": 2322}, {"type": "D", "before": "Francisco Jarauta", "after": null, "start_char_pos": 2352, "end_char_pos": 2369}, {"type": "D", "before": "Eva Sastre Forest", "after": null, "start_char_pos": 2399, "end_char_pos": 2416}, {"type": "D", "before": "General Vasco Gon\u00e7alves", "after": null, "start_char_pos": 2446, "end_char_pos": 2469}, {"type": "D", "before": "H\u00e9ctor D\u00edaz-Polanco", "after": null, "start_char_pos": 2499, "end_char_pos": 2518}, {"type": "D", "before": "Manuel Talens (Spanish, writer)", "after": null, "start_char_pos": 2548, "end_char_pos": 2579}, {"type": "D", "before": "Alejandro Moreano (Equador, journalist)", "after": null, "start_char_pos": 2609, "end_char_pos": 2648}, {"type": "D", "before": "Pablo Armando Fern\u00e1ndez (Cuba,writer)", "after": null, "start_char_pos": 2678, "end_char_pos": 2715}, {"type": "D", "before": "Keith Ellis", "after": null, "start_char_pos": 2745, "end_char_pos": 2756}, {"type": "D", "before": "Dick Emanuelsson (Colombia, journalist)", "after": null, "start_char_pos": 2786, "end_char_pos": 2825}, {"type": "D", "before": "Carlos Fern\u00e1ndez Liria (Venezuela, writer)", "after": null, "start_char_pos": 2855, "end_char_pos": 2897}, {"type": "D", "before": "Horacio A. L\u00f3pez", "after": null, "start_char_pos": 2927, "end_char_pos": 2943}, {"type": "D", "before": "Angeles Maestro", "after": null, "start_char_pos": 2973, "end_char_pos": 2988}, {"type": "D", "before": "V\u00edctor R\u00edos", "after": null, "start_char_pos": 3018, "end_char_pos": 3029}, {"type": "D", "before": "Danielle Bleitrach", "after": null, "start_char_pos": 3059, "end_char_pos": 3077}, {"type": "D", "before": "Alcira Argumedo", "after": null, "start_char_pos": 3107, "end_char_pos": 3122}, {"type": "D", "before": "Quintin Cabrera", "after": null, "start_char_pos": 3152, "end_char_pos": 3167}, {"type": "D", "before": "Mark Rosenzweig", "after": null, "start_char_pos": 3197, "end_char_pos": 3212}, {"type": "D", "before": "Arturo Corchera", "after": null, "start_char_pos": 3242, "end_char_pos": 3257}, {"type": "D", "before": "Cuauht\u00e9moc Amezcua Dromundo", "after": null, "start_char_pos": 3287, "end_char_pos": 3314}, {"type": "D", "before": "Tubal P\u00e1ez", "after": null, "start_char_pos": 3344, "end_char_pos": 3354}, {"type": "D", "before": "Irene Amador", "after": null, "start_char_pos": 3384, "end_char_pos": 3396}, {"type": "D", "before": "Roger Grevoul", "after": null, "start_char_pos": 3426, "end_char_pos": 3439}, {"type": "D", "before": "Julie Ruben", "after": null, "start_char_pos": 3469, "end_char_pos": 3480}, {"type": "D", "before": "Anamar\u00eda D\u00edaz", "after": null, "start_char_pos": 3510, "end_char_pos": 3523}, {"type": "D", "before": "Carlos Alberto de Almeida", "after": null, "start_char_pos": 3553, "end_char_pos": 3578}, {"type": "D", "before": "Alberto Lecchi", "after": null, "start_char_pos": 3608, "end_char_pos": 3622}, {"type": "D", "before": "Rosa Miriam Elizalde", "after": null, "start_char_pos": 3652, "end_char_pos": 3672}, {"type": "D", "before": "Fran\u00e7ois Duteil", "after": null, "start_char_pos": 3702, "end_char_pos": 3717}, {"type": "D", "before": "Humberto Tumini", "after": null, "start_char_pos": 3747, "end_char_pos": 3762}, {"type": "D", "before": "Carlos Tena", "after": null, "start_char_pos": 3792, "end_char_pos": 3803}, {"type": "D", "before": "Elizabeth Martinez", "after": null, "start_char_pos": 3833, "end_char_pos": 3851}, {"type": "D", "before": "Juan Carlos Monedero", "after": null, "start_char_pos": 3881, "end_char_pos": 3901}, {"type": "D", "before": "Solange R. Echeverria", "after": null, "start_char_pos": 3931, "end_char_pos": 3952}, {"type": "D", "before": "Vicente Romano", "after": null, "start_char_pos": 3982, "end_char_pos": 3996}, {"type": "D", "before": "Jane de la Selva", "after": null, "start_char_pos": 4026, "end_char_pos": 4042}, {"type": "D", "before": "C\u00e9sar Fern\u00e1ndez", "after": null, "start_char_pos": 4072, "end_char_pos": 4087}, {"type": "D", "before": "Norma N\u00fa\u00f1ez Montoto", "after": null, "start_char_pos": 4117, "end_char_pos": 4136}, {"type": "D", "before": "Marcela Cornejo Z.", "after": null, "start_char_pos": 4166, "end_char_pos": 4184}, {"type": "D", "before": "Laurindo Leal Filho", "after": null, "start_char_pos": 4214, "end_char_pos": 4233}, {"type": "D", "before": "Nayar L\u00f3pez Castellanos", "after": null, "start_char_pos": 4263, "end_char_pos": 4286}, {"type": "D", "before": "Julio C. Gambina", "after": null, "start_char_pos": 4316, "end_char_pos": 4332}, {"type": "D", "before": "Octavio Mercado Gonz\u00e1lez", "after": null, "start_char_pos": 4362, "end_char_pos": 4386}, {"type": "D", "before": "Olivia Vidal L\u00f3pez", "after": null, "start_char_pos": 4416, "end_char_pos": 4434}, {"type": "D", "before": "Miguel \u00c1ngel Buenrostro", "after": null, "start_char_pos": 4464, "end_char_pos": 4487}, {"type": "D", "before": "Juan Carlos Volnovich", "after": null, "start_char_pos": 4517, "end_char_pos": 4538}, {"type": "D", "before": "Berta Joubert-Ceci", "after": null, "start_char_pos": 4568, "end_char_pos": 4586}, {"type": "D", "before": "Jorge Ceballos", "after": null, "start_char_pos": 4616, "end_char_pos": 4630}, {"type": "D", "before": "Isaac Rudnik", "after": null, "start_char_pos": 4660, "end_char_pos": 4672}, {"type": "D", "before": "Hildebrando P\u00e8rez Grande", "after": null, "start_char_pos": 4702, "end_char_pos": 4726}, {"type": "D", "before": "Manuel Ortega Hegg", "after": null, "start_char_pos": 4756, "end_char_pos": 4774}, {"type": "D", "before": "H\u00e9lio Doyle", "after": null, "start_char_pos": 4804, "end_char_pos": 4815}, {"type": "D", "before": "Dr. Rub\u00e9n Cant\u00fa Chapa", "after": null, "start_char_pos": 4845, "end_char_pos": 4866}, {"type": "D", "before": "Corina Mestre", "after": null, "start_char_pos": 4896, "end_char_pos": 4909}, {"type": "D", "before": "Manuel Sa Marques", "after": null, "start_char_pos": 4939, "end_char_pos": 4956}, {"type": "D", "before": "Oscar-Ren\u00e9 Vargas", "after": null, "start_char_pos": 4986, "end_char_pos": 5003}, {"type": "D", "before": "Henri Alleg", "after": null, "start_char_pos": 5033, "end_char_pos": 5044}, {"type": "D", "before": "Roberto Mastroianni", "after": null, "start_char_pos": 5074, "end_char_pos": 5093}, {"type": "D", "before": "Daniel Chavarr\u00eda", "after": null, "start_char_pos": 5123, "end_char_pos": 5139}, {"type": "D", "before": "El\u00edas Letelier-Ruz", "after": null, "start_char_pos": 5169, "end_char_pos": 5187}, {"type": "D", "before": "Pedro Pablo Rodr\u00edguez", "after": null, "start_char_pos": 5217, "end_char_pos": 5238}, {"type": "D", "before": "Beatriz Rajland", "after": null, "start_char_pos": 5268, "end_char_pos": 5283}, {"type": "D", "before": "Victor Casaus", "after": null, "start_char_pos": 5313, "end_char_pos": 5326}, {"type": "D", "before": "Luciana Castellina", "after": null, "start_char_pos": 5356, "end_char_pos": 5374}, {"type": "D", "before": "Jorge Ra\u00fal Rodr\u00edguez", "after": null, "start_char_pos": 5404, "end_char_pos": 5424}, {"type": "D", "before": "Adalberto Santana", "after": null, "start_char_pos": 5454, "end_char_pos": 5471}, {"type": "D", "before": "Rolando Rodr\u00edguez", "after": null, "start_char_pos": 5501, "end_char_pos": 5518}, {"type": "D", "before": "Lourdes Gonz\u00e1lez", "after": null, "start_char_pos": 5548, "end_char_pos": 5564}, {"type": "D", "before": "Rita Terranova", "after": null, "start_char_pos": 5594, "end_char_pos": 5608}, {"type": "D", "before": "Alicia Castellanos", "after": null, "start_char_pos": 5638, "end_char_pos": 5656}, {"type": "D", "before": "Rolando Gonz\u00e1lez Patricio", "after": null, "start_char_pos": 5686, "end_char_pos": 5711}, {"type": "D", "before": "Paulina Fernandez", "after": null, "start_char_pos": 5741, "end_char_pos": 5758}, {"type": "D", "before": "Vicente Feli\u00fa", "after": null, "start_char_pos": 5788, "end_char_pos": 5801}, {"type": "D", "before": "Rafael Cuevas Molina", "after": null, "start_char_pos": 5831, "end_char_pos": 5851}, {"type": "D", "before": "Carlos A. Lozano Guill\u00e9n", "after": null, "start_char_pos": 5881, "end_char_pos": 5905}, {"type": "D", "before": "Ra\u00fal Villegas D\u00e1valos", "after": null, "start_char_pos": 5935, "end_char_pos": 5956}, {"type": "D", "before": "Sergio Guerra", "after": null, "start_char_pos": 5986, "end_char_pos": 5999}, {"type": "D", "before": "Enrique Ubieta", "after": null, "start_char_pos": 6029, "end_char_pos": 6043}, {"type": "D", "before": "Fernando L\u00f3pez D\u00b4Alejandro", "after": null, "start_char_pos": 6073, "end_char_pos": 6099}, {"type": "D", "before": "Ana Daglio", "after": null, "start_char_pos": 6129, "end_char_pos": 6139}, {"type": "D", "before": "Oscar Gonz\u00e1lez", "after": null, "start_char_pos": 6169, "end_char_pos": 6183}, {"type": "D", "before": "Jorge Timossi", "after": null, "start_char_pos": 6213, "end_char_pos": 6226}, {"type": "D", "before": "Carlos Oliva", "after": null, "start_char_pos": 6256, "end_char_pos": 6268}, {"type": "D", "before": "Ana Mar\u00eda Vera Smith", "after": null, "start_char_pos": 6298, "end_char_pos": 6318}, {"type": "D", "before": "Salvador L\u00f3pez Arnal", "after": null, "start_char_pos": 6348, "end_char_pos": 6368}, {"type": "D", "before": "Jos\u00e9 Dos Santos", "after": null, "start_char_pos": 6398, "end_char_pos": 6413}, {"type": "D", "before": "Humberto Arenal", "after": null, "start_char_pos": 6443, "end_char_pos": 6458}, {"type": "D", "before": "Iris Galindo", "after": null, "start_char_pos": 6488, "end_char_pos": 6500}, {"type": "D", "before": "Jaime M\u00fchlrad Zimmermann", "after": null, "start_char_pos": 6530, "end_char_pos": 6554}, {"type": "D", "before": "Pedro de la Hoz", "after": null, "start_char_pos": 6584, "end_char_pos": 6599}, {"type": "D", "before": "Maritza Capote", "after": null, "start_char_pos": 6629, "end_char_pos": 6643}, {"type": "D", "before": "Enrique Cirules", "after": null, "start_char_pos": 6673, "end_char_pos": 6688}, {"type": "D", "before": "Carlos Alzugaray Treto", "after": null, "start_char_pos": 6718, "end_char_pos": 6740}, {"type": "D", "before": "Toty Flores, Argentina.", "after": null, "start_char_pos": 6770, "end_char_pos": 6793}, {"type": "D", "before": "Daniel Rodr\u00edguez", "after": null, "start_char_pos": 6823, "end_char_pos": 6839}, {"type": "D", "before": "Alberto Faya", "after": null, "start_char_pos": 6869, "end_char_pos": 6881}, {"type": "D", "before": "Marilyn Bobes", "after": null, "start_char_pos": 6911, "end_char_pos": 6924}, {"type": "D", "before": "Miguel Alvarez", "after": null, "start_char_pos": 6954, "end_char_pos": 6968}, {"type": "D", "before": "Carlos Roberto", "after": null, "start_char_pos": 6998, "end_char_pos": 7012}, {"type": "D", "before": "Alberto Luis Tabares", "after": null, "start_char_pos": 7042, "end_char_pos": 7062}, {"type": "D", "before": "Daniel De Santis Mesa", "after": null, "start_char_pos": 7092, "end_char_pos": 7113}, {"type": "D", "before": "Manuel Henr\u00edquez Lagarde", "after": null, "start_char_pos": 7143, "end_char_pos": 7167}, {"type": "D", "before": "Mar\u00eda Toledano", "after": null, "start_char_pos": 7197, "end_char_pos": 7211}, {"type": "D", "before": "Manuel Fern\u00e1ndez-Cuesta", "after": null, "start_char_pos": 7241, "end_char_pos": 7264}, {"type": "D", "before": "Rafael Hern\u00e1ndez", "after": null, "start_char_pos": 7294, "end_char_pos": 7310}, {"type": "D", "before": "Manuel L\u00f3pez Oliva", "after": null, "start_char_pos": 7340, "end_char_pos": 7358}, {"type": "D", "before": "Santiago Pujol", "after": null, "start_char_pos": 7388, "end_char_pos": 7402}, {"type": "D", "before": "Aurelio Alonso Tejada", "after": null, "start_char_pos": 7432, "end_char_pos": 7453}, {"type": "D", "before": "Alberto Guerra Naranjo", "after": null, "start_char_pos": 7483, "end_char_pos": 7505}, {"type": "D", "before": "Felix Contreras", "after": null, "start_char_pos": 7535, "end_char_pos": 7550}, {"type": "D", "before": "Magaly S\u00e1nchez Ochoa", "after": null, "start_char_pos": 7580, "end_char_pos": 7600}, {"type": "D", "before": "Marina Norma Rodriguez Lopez", "after": null, "start_char_pos": 7630, "end_char_pos": 7658}, {"type": "D", "before": "Lino Arturo Neira Betancourt", "after": null, "start_char_pos": 7688, "end_char_pos": 7716}, {"type": "D", "before": "Jos\u00e9 Luis Fari\u00f1as", "after": null, "start_char_pos": 7746, "end_char_pos": 7763}, {"type": "D", "before": "Juana Garc\u00eda Ab\u00e1s", "after": null, "start_char_pos": 7793, "end_char_pos": 7810}, {"type": "D", "before": "Virtudes Feli\u00fa", "after": null, "start_char_pos": 7840, "end_char_pos": 7854}, {"type": "D", "before": "Gioia Minuti", "after": null, "start_char_pos": 7884, "end_char_pos": 7896}, {"type": "D", "before": "References", "after": null, "start_char_pos": 7926, "end_char_pos": 7936}, {"type": "D", "before": "See Also Uribe-Chavez meeting postponed February 4, 2005. Venezuela-Colombia crisis:Castro intervenes, Chavez and Uribe scheduled to meet February 01, 2005. Venezuela-Colombia crisis continues January 24, 2005. Brazilian President meets President of Colombia January 20, 2005. Colombia releases official notice in response to Venezuela, January 17, 2005. Capture of FARC member creates crisis between Venezuela and Colombia, January 15, 2005.", "after": null, "start_char_pos": 7979, "end_char_pos": 8421}, {"type": "D", "before": "Category:January 17, 2005 Category:Colombia Category:Venezuela Category:South America Category:Politics and conflicts Category:Published", "after": null, "start_char_pos": 8451, "end_char_pos": 8587}, {"type": "R", "before": "Category:Hugo Chave", "after": "Related news", "start_char_pos": 8617, "end_char_pos": 8636}], "sents_char_pos": [0, 305, 482, 584, 943, 1024, 1108, 1189, 1287, 1387, 1465, 1566, 1718, 1832, 1934, 2017, 2107, 2140, 2218, 2571, 2937, 2954, 2967, 2981, 2999, 3012, 3025, 3040, 3053, 3068, 3088, 3101, 3114, 3133, 3146, 3160, 3178, 3191, 3202, 3223, 3236, 3249, 3268, 3281, 3298, 3325, 3338, 3350, 3365, 3378, 3390, 3407, 3420, 3432, 3450, 3463, 3475, 3491, 3504, 3519, 3534, 3547, 3560, 3571, 3589, 3602, 3616, 3633, 3646, 3657, 3683, 3696, 4184, 4195, 4208, 4223, 4244, 4257, 4269, 4297, 4310, 4322, 4343, 4356, 4370, 4397, 4410, 4423, 4445, 4458, 4471, 4498, 4511, 4522, 4549, 4562, 4574, 4597, 4610, 4622, 4641, 4654, 4666, 4683, 4696, 4714, 4737, 4750, 4763, 4785, 4798, 4810, 4826, 4839, 4855, 4877, 4890, 4903, 4920, 4933, 4946, 4967, 4980, 4997, 5014, 5027, 5039, 5055, 5068, 5082, 5104, 5117, 5130, 5150, 5163, 5175, 5198, 5211, 5223, 5249, 5262, 5276, 5294, 5307, 5320, 5337, 5350, 5364, 5385, 5398, 5410, 5435, 5448, 5464, 5482, 5495, 5509, 5529, 5542, 5556, 5575, 5588, 5599, 5619, 5632, 5645, 5667, 5680, 5694, 5722, 5735, 5749, 5769, 5782, 5796, 5812, 5825, 5838, 5862, 5875, 5888, 5916, 5929, 5940, 5967, 5980, 5993, 6010, 6023, 6037, 6054, 6067, 6082, 6110, 6123, 6150, 6163, 6175, 6194, 6207, 6219, 6237, 6250, 6263, 6279, 6292, 6308, 6793, 6804, 6817, 6830, 6850, 6863, 6877, 6892, 6905, 6919, 6935, 6948, 6961, 6979, 6992, 7005, 7023, 7036, 7050, 7073, 7086, 7099, 7124, 7137, 7150, 7178, 7191, 7203, 7222, 7235, 7248, 7275, 7288, 7301, 7321, 7334, 7347, 7369, 7382, 7397, 7413, 7426, 7440, 7464, 7477, 7491, 7516, 7529, 7541, 8036, 8135, 8189, 8255, 8333, 8421]} {"doc_id": "33339", "revision_depth": "1", "before_revision": "The British newspaper Sunday Telegraph has reported on alleged plans for a U.S. attack on Iran. The plans were allegedly made in retaliation for Iran's uranium enrichment program due to suspicions that it is for military application in the development of nuclear weapons . The paper has also reported that the alleged plans to attack Iran may be a possible motivation for the development of nuclear weapons by Iran; there have been other threats of military response by both the U.S. and Israel . The nation of Iran. Graphic from the CIA World Factbook On February 12, 2006, the Sunday Telegraph claimed that strategists at the Pentagon are \"drawing up plans for devastating bombing raids backed by submarine-launched ballistic missile attacks against Iran's nuclear sites\" as '\"a last resort\" for the situation. Assessments of the time scale for Iran to possibly develop nuclear weapons include three to ten years. According to the Centre for Nonproliferation Studies , cities likely to be targets because of their alleged role in nuclear weapons development include medium-size towns such as Bushehr or Bushire (\u0628\u0648\u0634\u0647\u0631), population estimated as 165,000 (2005) and Arak with a population of about 511,000 (2005) and the small mountain town of Natanz . Just a few days earlier, an InterPress Service article by Gareth Porter reported that two ex-CIA operatives, Paul Pillar and Ellen Laipson, as saying that one of the main reasons motivating Iran to move towards developing nuclear weapons was the belief in a threat of attack by the United States and/or Israel . Just a few weeks earlier, on January 25, 2006, former UN weapons inspector Hans Blix recommended that the United States give a similar commitment not to attack Iran with either conventional or nuclear weapons, just as it apparently has given to North Korea , stating, \"regime changes, we know, from the outside are not that much of a panacea. So I think [the United States] should contemplate similar offers to Iran as they have to North Korea.\"", "after_revision": "The British newspaper has reported on alleged plans for a U.S. attack on Iran. The plans were allegedly made in retaliation for Iran's uranium enrichment program due to suspicions that it is for military application in the development of . The paper has also reported that the alleged plans to attack Iran may be a possible motivation for the development of nuclear weapons by Iran; there have been other of military response by both the U.S. and . The nation of Iran. Graphic from the CIA World Factbook On February 12, 2006, the Sunday Telegraph claimed that strategists at the are \"drawing up plans for devastating bombing raids backed by submarine-launched ballistic missile attacks against Iran's nuclear sites\" as '\"a last resort\" for the situation. Assessments of the time scale for include three to ten years. According to the , cities likely to be targets because of their alleged role in nuclear weapons development include medium-size towns such as or Bushire (\u0628\u0648\u0634\u0647\u0631), population estimated as 165,000 (2005) and with a population of about 511,000 (2005) and the small mountain town of . Just a few days earlier, an InterPress Service article by Gareth Porter reported that two ex-CIA operatives, Paul Pillar and Ellen Laipson, as saying that one of the main reasons motivating Iran to move towards developing nuclear weapons was the belief in a . Just a few weeks earlier, on January 25, 2006, former UN weapons inspector recommended that the United States give a similar commitment not to attack Iran with either conventional or nuclear weapons, just as it apparently has given to , stating, \"regime changes, we know, from the outside are not that much of a panacea. So I think [the United States] should contemplate similar offers to Iran as they have to North Korea.\"", "edit_actions": [{"type": "D", "before": "Sunday Telegraph", "after": null, "start_char_pos": 22, "end_char_pos": 38}, {"type": "D", "before": "nuclear weapons", "after": null, "start_char_pos": 255, "end_char_pos": 270}, {"type": "D", "before": "threats", "after": null, "start_char_pos": 438, "end_char_pos": 445}, {"type": "D", "before": "Israel", "after": null, "start_char_pos": 488, "end_char_pos": 494}, {"type": "D", "before": "Pentagon", "after": null, "start_char_pos": 628, "end_char_pos": 636}, {"type": "D", "before": "Iran to possibly develop nuclear weapons", "after": null, "start_char_pos": 847, "end_char_pos": 887}, {"type": "D", "before": "Centre for Nonproliferation Studies", "after": null, "start_char_pos": 933, "end_char_pos": 968}, {"type": "D", "before": "Bushehr", "after": null, "start_char_pos": 1094, "end_char_pos": 1101}, {"type": "D", "before": "Arak", "after": null, "start_char_pos": 1165, "end_char_pos": 1169}, {"type": "D", "before": "Natanz", "after": null, "start_char_pos": 1243, "end_char_pos": 1249}, {"type": "D", "before": "threat of attack by the United States and/or Israel", "after": null, "start_char_pos": 1510, "end_char_pos": 1561}, {"type": "D", "before": "Hans Blix", "after": null, "start_char_pos": 1639, "end_char_pos": 1648}, {"type": "D", "before": "North Korea", "after": null, "start_char_pos": 1809, "end_char_pos": 1820}], "sents_char_pos": [0, 95, 272, 415, 496, 516, 812, 915, 1160, 1211, 1276, 1360, 1391, 1589, 1906]} {"doc_id": "3366", "revision_depth": "1", "before_revision": "Category:United States Category:Politics and conflicts Category:Published Category:George W", "after_revision": "Category:United States Category:Politics and conflicts Category:Published Category:George W", "edit_actions": [], "sents_char_pos": [0]} {"doc_id": "33671", "revision_depth": "2", "before_revision": "The prosecutor did not withold complains for \"simple\" and \"severe\" physical harm by negligence against gendarmes Poget et Deiss in the trial of the Aubonne Bridge affair. Verdict will be given of Friday in the morning. A rope was put across the road: at one end, 20 metres above the river, militant Martin Shaw had tied himself; the rope would get up to the bridge, loop around the bareer , bar the road, loop again at the other bareer , and get down to its other end, with militant Gesine Wenzel. The rope was protected by two barrages of militantes and by posters reading \"Do not shoot\", and \"Stop here or you will kill two people\" (photo ). Neither Wenzel not Shaw had any form of security system and the rope was not tied to the bareers ; thus, the lifes of the two militants depended on the integrity of the rope barring the road. Both activists were invisible from the road, unless looking over the bareer . A dozen of minutes afterward, the police arrived and tried to fre the way for the 200 cars stalled by the blockade. The policemen saw the militants hanging at the end of the rope, and thus tried to have the cars drive below the rope by lifting it. Then, 25-year old gendarme Deiss, from Schaffouse, moved in and cut the rope with his knife. Gesine Wenzel was saved in extremis and pulled onto the bridge, shocked. Martin Shaw fell 20 metres into the shallow river, suffering severe injuries to his spine and several fractures; he had to spent one full month in Hospital to recover, and still suffers from his wounds. The clause of \"rupture of causality links\", which describes cases where things cannot be predicted, does ont apply here because one the situation was assessed, it was the duty of the policemen to warn their collegues. Ma\u00eetre Garbade, lawyer of the plaintifs, also underlined the risks of being softer with the police and of the feeling of impunity which could follow. Since policement are typically confronted to delinquents, he said, their errors bring the contect of the offences commited by their victimes , which tends to induce clemency for them (in the matter, the activists were trialed and convicted for blocking circulation). He also mentionned the difficulty of the investigation : the police was tempted to negate that a policeman had cut the rope, refused to aknowledge some testimonies, and gave immediate psychological support to Deiss, which was not done for the victims. \"I do not believe that this trial would have taken place if it was not for the two video recordings\", he said. Prosecutor M. Stoll, first substitute to the procuror, warned against the \"myth of police impunity\" and argued that he had recently requested and obtained conviction of two policemen. \"Then are no preferences within the prosecution \", he said. The prosecution went on arguing that the \"rupture of causality links\" did in fact apply, since the time between Poget realising the situation and Deiss cutting the rope was very brief (one minute). Absence of dialogue between the policemen and the militants was understandable because the protest was unexpected, illegal and dangerous (the activists had blocked the highway without any signs warning the motorists). The confuse messages of the posters was also alluded to ( \"Do not shoot\" and \"Stop here or you will kill two people\" ) , while a simple drawing of two people hanging from a bridge would have make the situation instantaneously clear for everybody; such drawings are featured on the web site of the activists. The prosecution conclued saying that the \"most probably cause\" of the accident was the protest itself, and dropped the charges. The lawyer for sergeant Poget External links Art. 125 du Code p\u00e9nal suisse Site des militants", "after_revision": "The prosecutor did not withold complains for \"simple\" and \"severe\" physical harm by negligence against gendarmes Poget and Deiss in the trial of the Aubonne Bridge affair. Verdict will be given of Friday in the morning. A rope was put across the road: at one end, 20 metres above the river, militant Martin Shaw had tied himself; the rope would get up to the bridge, loop around the barrier , bar the road, loop again at the other barrier , and get down to its other end, with militant Gesine Wenzel. The rope was protected by two barrages of militantes and by posters reading \"Do not shoot\", and \"Stop here or you will kill two people\" (photo ). Neither Wenzel not Shaw had any form of security system and the rope was not tied to the barriers ; thus, the lives of the two militants depended on the integrity of the rope barring the road. Both activists were invisible from the road, unless looking over the barrier . A dozen minutes afterward, the police arrived and tried to free the way for the 200 cars stalled by the blockade. The policemen saw the militants hanging at the end of the rope, and thus tried to have the cars drive below the rope by lifting it. Then, 25-year old gendarme Deiss, from Schaffouse, moved in and cut the rope with his knife. Gesine Wenzel was saved in extremis and pulled onto the bridge, shocked. Martin Shaw fell 20 metres into the shallow river, suffering severe injuries to his spine and several fractures; he had to spent one full month in hospital to recover, and still suffers from his wounds. The clause of \"rupture of causality links\", which describes cases where things cannot be predicted, does not apply here because once the situation was assessed, it was the duty of the policemen to warn their collegues. Ma\u00eetre Garbade, lawyer of the plaintifs, also underlined the risks of being softer with the police and of the feeling of impunity which could follow. Since policement are typically confronted to delinquents, he said, their errors bring to context the offences commited by their victims , which tends to induce clemency for them (in this matter, the activists were trialed and convicted for blocking traffic circulation). He also mentionned the difficulty of the investigation ; the police was tempted to negate that a policeman had cut the rope, refused to aknowledge some testimonies, and gave immediate psychological support to Deiss, which was not done for the victims. \"I do not believe that this trial would have taken place if it was not for the two video recordings\", he said. Prosecutor M. Stoll, first substitute to the procuror, warned against the \"myth of police impunity\" and argued that he had recently requested and obtained conviction of two policemen. \"Then are no preferences within the prosecution ,\" he said. The prosecution went on arguing that the \"rupture of causality links\" did in fact apply, since the time between Poget realising the situation and Deiss cutting the rope was very brief (one minute). Absence of dialogue between the policemen and the militants was understandable because the protest was unexpected, illegal and dangerous (the activists had blocked the highway without adequate signs warning the motorists). The confused messages of the posters were also alluded to \"Do not shoot\" and \"Stop here or you will kill two people\" , while a simple drawing of two people hanging from a bridge would have make the situation instantaneously clear for everybody; such drawings are featured on the web site of the activists. The prosecution conclued saying that the \"most probable cause\" of the accident was the protest itself, and dropped the charges. The lawyer for sergeant Poget External links Art. 125 du Swiss penal code Site of the militants", "edit_actions": [{"type": "R", "before": "et", "after": "and", "start_char_pos": 119, "end_char_pos": 121}, {"type": "R", "before": "bareer", "after": "barrier", "start_char_pos": 382, "end_char_pos": 388}, {"type": "R", "before": "bareer", "after": "barrier", "start_char_pos": 429, "end_char_pos": 435}, {"type": "R", "before": "bareers", "after": "barriers", "start_char_pos": 733, "end_char_pos": 740}, {"type": "R", "before": "lifes", "after": "lives", "start_char_pos": 753, "end_char_pos": 758}, {"type": "R", "before": "bareer", "after": "barrier", "start_char_pos": 905, "end_char_pos": 911}, {"type": "D", "before": "of", "after": null, "start_char_pos": 922, "end_char_pos": 924}, {"type": "R", "before": "fre", "after": "free", "start_char_pos": 976, "end_char_pos": 979}, {"type": "R", "before": "Hospital", "after": "hospital", "start_char_pos": 1475, "end_char_pos": 1483}, {"type": "R", "before": "ont", "after": "not", "start_char_pos": 1636, "end_char_pos": 1639}, {"type": "R", "before": "one", "after": "once", "start_char_pos": 1659, "end_char_pos": 1662}, {"type": "R", "before": "the contect of the", "after": "to context the", "start_char_pos": 1985, "end_char_pos": 2003}, {"type": "R", "before": "victimes", "after": "victims", "start_char_pos": 2031, "end_char_pos": 2039}, {"type": "R", "before": "the", "after": "this", "start_char_pos": 2086, "end_char_pos": 2089}, {"type": "A", "before": null, "after": "traffic", "start_char_pos": 2152, "end_char_pos": 2152}, {"type": "R", "before": ":", "after": ";", "start_char_pos": 2222, "end_char_pos": 2223}, {"type": "R", "before": "\",", "after": ",\"", "start_char_pos": 2762, "end_char_pos": 2764}, {"type": "R", "before": "any", "after": "adequate", "start_char_pos": 3156, "end_char_pos": 3159}, {"type": "R", "before": "confuse", "after": "confused", "start_char_pos": 3194, "end_char_pos": 3201}, {"type": "R", "before": "was", "after": "were", "start_char_pos": 3226, "end_char_pos": 3229}, {"type": "D", "before": "(", "after": null, "start_char_pos": 3246, "end_char_pos": 3247}, {"type": "D", "before": ")", "after": null, "start_char_pos": 3307, "end_char_pos": 3308}, {"type": "R", "before": "probably", "after": "probable", "start_char_pos": 3545, "end_char_pos": 3553}, {"type": "R", "before": "Code p\u00e9nal suisse Site des", "after": "Swiss penal code Site of the", "start_char_pos": 3683, "end_char_pos": 3709}], "sents_char_pos": [0, 170, 218, 328, 497, 643, 742, 835, 1029, 1161, 1254, 1327, 1440, 1530, 1748, 1898, 2166, 2418, 2529, 2713, 2773, 2971, 3189, 3436, 3497, 3625]} {"doc_id": "34710", "revision_depth": "1", "before_revision": "In it's announcement, the MPAA said it had commenced legal action against the following BitTorrent tracking sites\u2014isohunt.com, bthub.com, and torrentbox.com which are all owned by the same person; torrentspy.com; niteshadow.com as well as ed2k site ed2k-it.com and Usenet search engines\u2014nzb-zone.com, binnews.com, and dvdrs.net. Despite the announcement on it's website and in the media, the MPAA has failed to notify the administrator's of the sites involved directly. Joe from Binnews told Wikinews he only found out about the MPAA's actions after reading it on several news sites. He said \"At first, I double read the article making sure we were not being punk'd. But then I was shocked that we had to read about it publicly first. As of today (February 25), we have yet to get anything (from the MPAA)\". \" descds \", an administrator of dvdrs.net told Wikinews that the first he knew of the action being taken against the site was when he was approached by the press and users of his site. He said \"We haven't been informed by the MPAA and quite frankly are outraged by the method they have adopted to file these lawsuits. In actual fact we would still be none the wiser had our members and members of the press not have contacted us.\" \"When we found out about the filed lawsuit we was first worried (after all we are only a small site with limited funds), then shocked and finally outraged. Had the MPAA contacted us anytime in the sites history regards their concerns we would have happily worked with them to gain a resolve . \" he said. Binnews told Wikinews \"We do feel they should have notified first. We do not even have a confirmation this is for real.\" Dvdrs said \"We have stated many times had the MPAA personally contacted us we would have happily listened to their issues and acted accordingly. We are doing nothing wrong legally on our site and to be made look like an established piracy ring is an outrage. We have worked extremely hard on site to keep within international laws and they have publicly destroyed everything we have worked towards in the last 2 years. We are receiving negative PR and this is totally unacceptable.\" When questioned asked if Binnews ever received a takedown notice, Binnews replied \"Nope, we have never received a notice from anyone. My cell phone is tied to the site, we have proper DMCA guidelines on the site and no one has contacted us.\" When asked the same question, Dvdrs said \"No never. We would actively respond to any DMCA request quickly and efficiently. We fully support the law and would never try to evade anything within its scope. Had a DMCA been issued by any member, our site would have immediately deleted the offensive file.\" When asked how they would deal with a DMCA takedown notice, Binnews said \"We would act quite quickly. An email sent to the alert system is tied into all of \"staff\" members, my cell phone and my email.\" According to Dvdrs, they would be equally as compliant. \"We would immediately delete the offending file on our server and conduct a thorough research into any files that may also be connected to the one mentioned. We would also respond to the request personally with a follow up email expressing our actions . \" they said. Wikinews asked the administrators if they thought their sites were any different to conventional search engines like Google and Yahoo. Binnews replied \"No, you can goto any search engine and find just about anything.\" Dvdrs also shares Binnews' position telling Wikinews \"No. We index what is already readily available on commercial, tax paying, US based registered companies hard drives. All we are doing is pointing to files not on our network, much the same way google or any search bot operates. We do not host these files and without the premium paid service of third parties our marked up text based XML files are useless. We have never hosted illegal files and only offer information.\" Dvdrs has expressed that if the MPAA deems them illegal they should also target those who are actually hosting the files. Descds said \"We feel that should the MPAA deem us illegal then they must also target premium paid Usenet Providers who act as the transit for these files. Ironically both Easynews and Usenetserver offer both indexing and carrier for these files and yet have received no such lawsuits filed.\" On the other hand, Binnews was surprised that the MPAA did not target ISPs and Usenet providers in the first instance. \"Cut the head off and there is nothing for us to index and report on. If the ISPs acted in a proper manner and did what they are more than capable of, we would not be assisting people in combating piracy on their networks \" they said. Despite being outraged with the MPAA and it's actions, Descds said that despite being outside of US juristiction he is happy to assist the MPAA in anyway necessary. \"We would like it known for the record that we are actively trying to reach a resolve regards this action by the MPAA. We have contacted them and said openly many times we would welcome their input and act accordingly. Should they feel that NZBS are illegal we will remove those sections immediately and await a legal judgement on their legality. DVDRS is not a pirate network and to call us such has insulted our member base.\" \"I would also like it noted that although we host in the US i am actually a UK citizen who currently does not have to adhere to their communications and judgements. However, such is our resolve that I would happily comply should communication between us take place. We can offer little more to help this but hope that the MPAA retract their statement that we are an organised pirate network and restore our good name. Should the MPAA decide to not communicate with us and continue their legal actions we will instruct our attorneys and contact legal bodies like the EFF for help on this matter . \" he added. Binnews also had this to say of the MPAA's lawsuit - \"Binnews does not host any files, the claim that we read \"BinNews.com offers files for over 3,000 movies\" is 100\\% completely false. We do not host any files, never have and never will. We provide a legitimate service to copyright holders. No where on our site does it say, \"join us, we can give you free movies \". We do not even have pre-made nzb files.\" History of binnews and dvdrs.net Binnews started \"as a way to monitor what is on usenet \" according to Joe. \"Our intent is not and never has been to facilitate piracy. Its quite the opposite. We have several guides that explain how binnews can assist a company in getting rid of piracy . \" he said. Dvdrs.net started out as a community site in March, 2004 where people could discuss movies they loved, and hated, offer help to people with home cinema issues, discuss games and basically befriend members. descds said \"We have evolved several times and have always kept a keen eye on the laws of both local and international authorities.\" Dvdrs.net adopted NZBs at users' request several months after the site was launched. descds told Wikinews that the site had never been contacted by any legal representative to ask for the removal of NZB files. \"There has never been a law passed anywhere, as far as we are aware, that states NZB files are illegal to host. Had there been, we would have dropped them and continue with other aspects of our site. DVDRS is not all about indexing Usenet and has a very healthy community discussion group . \" he said.", "after_revision": "In its announcement, the MPAA said it had commenced legal action against the following BitTorrent tracking sites\u2014isohunt.com, bthub.com, and torrentbox.com , which are all owned by the same person; torrentspy.com; niteshadow.com as well as ed2k site ed2k-it.com and Usenet search engines\u2014nzb-zone.com, binnews.com, and dvdrs.net. Despite the announcement on its website and in the media, the MPAA has failed to notify the administrators of the sites involved directly. Joe from Binnews told Wikinews he only found out about the MPAA's actions after reading it on several news sites. He said , \"At first, I double read the article making sure we were not being punk'd. But then I was shocked that we had to read about it publicly first. As of today (February 25), we have yet to get anything (from the MPAA)\". \" Descds \", an administrator of dvdrs.net told Wikinews that the first he knew of the action being taken against the site was when he was approached by the press and users of his site. He said , \"We haven't been informed by the MPAA and quite frankly are outraged by the method they have adopted to file these lawsuits. In actual fact we would still be none the wiser had our members and members of the press not have contacted us.\" \"When we found out about the filed lawsuit we was first worried (after all we are only a small site with limited funds), then shocked and finally outraged. Had the MPAA contacted us anytime in the sites history regards their concerns we would have happily worked with them to gain a resolve , \" he said. Binnews told Wikinews , \"We do feel they should have notified first. We do not even have a confirmation this is for real.\" Dvdrs said , \"We have stated many times had the MPAA personally contacted us we would have happily listened to their issues and acted accordingly. We are doing nothing wrong legally on our site and to be made look like an established piracy ring is an outrage. We have worked extremely hard on site to keep within international laws and they have publicly destroyed everything we have worked towards in the last two years. We are receiving negative PR and this is totally unacceptable.\" When asked if Binnews ever received a takedown notice, Binnews replied , \"Nope, we have never received a notice from anyone. My cell phone is tied to the site, we have proper DMCA guidelines on the site and no one has contacted us.\" When asked the same question, Dvdrs said , \"No never. We would actively respond to any DMCA request quickly and efficiently. We fully support the law and would never try to evade anything within its scope. Had a DMCA been issued by any member, our site would have immediately deleted the offensive file.\" When asked how they would deal with a DMCA takedown notice, Binnews said , \"We would act quite quickly. An email sent to the alert system is tied into all of \"staff\" members, my cell phone and my email.\" According to Dvdrs, they would be equally as compliant. \"We would immediately delete the offending file on our server and conduct a thorough research into any files that may also be connected to the one mentioned. We would also respond to the request personally with a follow up email expressing our actions , \" they said. Wikinews asked the administrators if they thought their sites were any different to conventional search engines like Google and Yahoo. Binnews replied , \"No, you can go to any search engine and find just about anything.\" Dvdrs also shares Binnews' position telling Wikinews , \"No. We index what is already readily available on commercial, tax paying, US based registered companies hard drives. All we are doing is pointing to files not on our network, much the same way google or any search bot operates. We do not host these files and without the premium paid service of third parties our marked up text based XML files are useless. We have never hosted illegal files and only offer information.\" Dvdrs has expressed that if the MPAA deems them illegal they should also target those who are actually hosting the files. Descds said , \"We feel that should the MPAA deem us illegal then they must also target premium paid Usenet Providers who act as the transit for these files. Ironically both Easynews and Usenetserver offer both indexing and carrier for these files and yet have received no such lawsuits filed.\" On the other hand, Binnews was surprised that the MPAA did not target ISPs and Usenet providers in the first instance. \"Cut the head off and there is nothing for us to index and report on. If the ISPs acted in a proper manner and did what they are more than capable of, we would not be assisting people in combating piracy on their networks , \" they said. Despite being outraged with the MPAA and its actions, Descds said that despite being outside of US juristiction he is happy to assist the MPAA in anyway necessary. \"We would like it known for the record that we are actively trying to reach a resolve regards this action by the MPAA. We have contacted them and said openly many times we would welcome their input and act accordingly. Should they feel that NZBS are illegal we will remove those sections immediately and await a legal judgement on their legality. DVDRS is not a pirate network and to call us such has insulted our member base.\" \"I would also like it noted that although we host in the US i am actually a UK citizen who currently does not have to adhere to their communications and judgements. However, such is our resolve that I would happily comply should communication between us take place. We can offer little more to help this but hope that the MPAA retract their statement that we are an organised pirate network and restore our good name. Should the MPAA decide to not communicate with us and continue their legal actions we will instruct our attorneys and contact legal bodies like the EFF for help on this matter , \" he added. Binnews also had this to say of the MPAA's lawsuit : \"Binnews does not host any files, the claim that we read \"BinNews.com offers files for over 3,000 movies\" is 100\\% completely false. We do not host any files, never have and never will. We provide a legitimate service to copyright holders. No where on our site does it say, \"join us, we can give you free movies .\" We do not even have pre-made nzb files.\" History of binnews and dvdrs.net Binnews started \"as a way to monitor what is on usenet , \" according to Joe. \"Our intent is not and never has been to facilitate piracy. Its quite the opposite. We have several guides that explain how binnews can assist a company in getting rid of piracy , \" he said. Dvdrs.net started out as a community site in March, 2004 , where people could discuss movies they loved, and hated, offer help to people with home cinema issues, discuss games and basically befriend members. Descds said, \"We have evolved several times and have always kept a keen eye on the laws of both local and international authorities.\" Dvdrs.net adopted NZBs at users' request several months after the site was launched. Descds told Wikinews that the site had never been contacted by any legal representative to ask for the removal of NZB files. \"There has never been a law passed anywhere, as far as we are aware, that states NZB files are illegal to host. Had there been, we would have dropped them and continue with other aspects of our site. DVDRS is not all about indexing Usenet and has a very healthy community discussion group , \" he said.", "edit_actions": [{"type": "R", "before": "it's", "after": "its", "start_char_pos": 3, "end_char_pos": 7}, {"type": "A", "before": null, "after": ",", "start_char_pos": 157, "end_char_pos": 157}, {"type": "R", "before": "it's", "after": "its", "start_char_pos": 358, "end_char_pos": 362}, {"type": "R", "before": "administrator's", "after": "administrators", "start_char_pos": 423, "end_char_pos": 438}, {"type": "A", "before": null, "after": ",", "start_char_pos": 593, "end_char_pos": 593}, {"type": "R", "before": "descds", "after": "Descds", "start_char_pos": 812, "end_char_pos": 818}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1003, "end_char_pos": 1003}, {"type": "R", "before": ".", "after": ",", "start_char_pos": 1533, "end_char_pos": 1534}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1568, "end_char_pos": 1568}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1679, "end_char_pos": 1679}, {"type": "R", "before": "2", "after": "two", "start_char_pos": 2079, "end_char_pos": 2080}, {"type": "D", "before": "questioned", "after": null, "start_char_pos": 2157, "end_char_pos": 2167}, {"type": "A", "before": null, "after": ",", "start_char_pos": 2234, "end_char_pos": 2234}, {"type": "A", "before": null, "after": ",", "start_char_pos": 2436, "end_char_pos": 2436}, {"type": "A", "before": null, "after": ",", "start_char_pos": 2772, "end_char_pos": 2772}, {"type": "R", "before": ".", "after": ",", "start_char_pos": 3210, "end_char_pos": 3211}, {"type": "A", "before": null, "after": ",", "start_char_pos": 3376, "end_char_pos": 3376}, {"type": "R", "before": "goto", "after": "go to", "start_char_pos": 3390, "end_char_pos": 3394}, {"type": "A", "before": null, "after": ",", "start_char_pos": 3497, "end_char_pos": 3497}, {"type": "A", "before": null, "after": ",", "start_char_pos": 4054, "end_char_pos": 4054}, {"type": "A", "before": null, "after": ",", "start_char_pos": 4676, "end_char_pos": 4676}, {"type": "R", "before": "it's", "after": "its", "start_char_pos": 4731, "end_char_pos": 4735}, {"type": "R", "before": ".", "after": ",", "start_char_pos": 5877, "end_char_pos": 5878}, {"type": "R", "before": "-", "after": ":", "start_char_pos": 5942, "end_char_pos": 5943}, {"type": "R", "before": "\".", "after": ".\"", "start_char_pos": 6256, "end_char_pos": 6258}, {"type": "A", "before": null, "after": ",", "start_char_pos": 6388, "end_char_pos": 6388}, {"type": "R", "before": ".", "after": ",", "start_char_pos": 6587, "end_char_pos": 6588}, {"type": "A", "before": null, "after": ",", "start_char_pos": 6657, "end_char_pos": 6657}, {"type": "R", "before": "descds said", "after": "Descds said,", "start_char_pos": 6807, "end_char_pos": 6818}, {"type": "R", "before": "descds", "after": "Descds", "start_char_pos": 7025, "end_char_pos": 7031}, {"type": "R", "before": ".", "after": ",", "start_char_pos": 7439, "end_char_pos": 7440}], "sents_char_pos": [0, 197, 213, 329, 470, 584, 668, 736, 809, 994, 1128, 1397, 1545, 1613, 1667, 1813, 1927, 2087, 2151, 2286, 2394, 2447, 2518, 2599, 2698, 2801, 2901, 2957, 3115, 3224, 3359, 3443, 3502, 3615, 3726, 3855, 3919, 4041, 4197, 4334, 4453, 4523, 4689, 4854, 4973, 5073, 5201, 5447, 5548, 5700, 5890, 6076, 6129, 6183, 6258, 6299, 6408, 6468, 6492, 6599, 6939, 7149, 7261, 7349]} {"doc_id": "34750", "revision_depth": "1", "before_revision": "The 1 ranked Duke Blue Devils lost to the Florida State Seminoles in NCAA Men's Basketball Wednesday night, by the score of 79-74 . The loss drops the Blue Devils to 27-2 while FSU improves to 18-8 . J.J. Redick led the Blue Devils with 30 points while the Seminoles were led by Alexander Thornton's 26. A bit of controversy was sparked when Florida State fans stormed the court early with 1.7 seconds left to play . At this juncture, Duke coach Mike Krzyzweski and his coaching staff left with all the players not in the game to the locker room. Krzyzweski said that he \"would think that security would not be ready for that type of thing. \" This was Duke's first ACC loss of the season. Earlier in the season , Duke narrowly escaped FSU at Cameron Indoor Stadium 97-96 in overtime", "after_revision": "The No. 1 ranked Duke Blue Devils lost to the unranked Florida State Seminoles 79-74 at FSU . The loss drops the Blue Devils to 27-2 (14-1 in the ACC) while FSU improves to 18-8 (8-7 in the ACC) . The Seminoles were led by Al Thornton, who was 15 for 16 at the freethrow line and scored 26 points in 36 minutes of play. Alexander Johnson brought in 22 points for FSU, shooting 10 of 13 at the line and bringing in 13 rebounds. Senior J.J. Redick led the Blue Devils with 30 points , including 4 three point shots, and fellow senior Shelden Williams had 20 points and 16 rebounds. Florida State fans swarmed the court with 1.7 seconds left to play , when the team was ahead 77-72. Duke coach Mike Krzyzweski sent all but the 5 Blue Devil players on the court to the locker room. The Seminoles were assessed a team technical foul, and Redick shot two free throws before play commenced. This marks Duke's first ACC loss of the season. In an earlier matchup , Duke narrowly escaped FSU at Cameron Indoor Stadium 97-96 in overtime", "edit_actions": [{"type": "A", "before": null, "after": "No.", "start_char_pos": 4, "end_char_pos": 4}, {"type": "A", "before": null, "after": "unranked", "start_char_pos": 43, "end_char_pos": 43}, {"type": "D", "before": "in NCAA Men's Basketball Wednesday night, by the score of", "after": null, "start_char_pos": 68, "end_char_pos": 125}, {"type": "A", "before": null, "after": "at FSU", "start_char_pos": 132, "end_char_pos": 132}, {"type": "A", "before": null, "after": "(14-1 in the ACC)", "start_char_pos": 174, "end_char_pos": 174}, {"type": "A", "before": null, "after": "(8-7 in the ACC)", "start_char_pos": 202, "end_char_pos": 202}, {"type": "A", "before": null, "after": "The Seminoles were led by Al Thornton, who was 15 for 16 at the freethrow line and scored 26 points in 36 minutes of play. Alexander Johnson brought in 22 points for FSU, shooting 10 of 13 at the line and bringing in 13 rebounds.", "start_char_pos": 205, "end_char_pos": 205}, {"type": "A", "before": null, "after": "Senior", "start_char_pos": 206, "end_char_pos": 206}, {"type": "R", "before": "while the Seminoles were led by Alexander Thornton's 26.", "after": ", including 4 three point shots, and fellow senior Shelden Williams had 20 points and 16 rebounds.", "start_char_pos": 254, "end_char_pos": 310}, {"type": "D", "before": "A bit of controversy was sparked when", "after": null, "start_char_pos": 311, "end_char_pos": 348}, {"type": "R", "before": "stormed the court early", "after": "swarmed the court", "start_char_pos": 368, "end_char_pos": 391}, {"type": "R", "before": ". At this juncture,", "after": ", when the team was ahead 77-72.", "start_char_pos": 422, "end_char_pos": 441}, {"type": "R", "before": "and his coaching staff left with all the players not in the game", "after": "sent all but the 5 Blue Devil players on the court", "start_char_pos": 469, "end_char_pos": 533}, {"type": "R", "before": "Krzyzweski said that he \"would think that security would not be ready for that type of thing. \"", "after": "The Seminoles were assessed a team technical foul, and Redick shot two free throws before play commenced.", "start_char_pos": 554, "end_char_pos": 649}, {"type": "R", "before": "was", "after": "marks", "start_char_pos": 655, "end_char_pos": 658}, {"type": "R", "before": "Earlier in the season", "after": "In an earlier matchup", "start_char_pos": 696, "end_char_pos": 717}], "sents_char_pos": [0, 134, 310, 423, 553, 647, 695]} {"doc_id": "35000", "revision_depth": "1", "before_revision": "250px|An Academy Award. The 78th Academy Awards were hosted by Jon Stewart , host of Comedy Central's The Daily Show . Crash won the Best Picture award, a surprise for many predictors. Co-producer Cathy Schulman commented \"[thank you for] embracing our film, about love and about tolerance, about truth. Thank you to the people all around the world who have been touched by this message. And we are humbled by the other nominees in this category. You have made this year one of the most breathtaking, and stunning, maverick years in American cinema, thank you.\" Paul Haggis and Bobby Moresco also won best original screenplay for Crash. Directed and co-produced by Canadian Paul Haggis, film distribution rights were purchased for just USD$3 million by Lions Gate Films. Noted film critic Roger Ebert called it his favourite picture of 2005, and the picture made many North American \"10 best\" lists. Backstage, Best Director winner Ang Lee commented to the press on how Brokeback Mountain refreshed his will to direct. \"Before I get into making this movie, I was very tired from two very ambitious work, The Hulk and Crouching Tiger, Hidden Dragon . I almost wanted to retire. I felt I had enough, I hit the bottom, sort of like my mid life crisis or something, and this movie teach me how to look at myself, how to manage myself in movie making again, enjoying making them, and the movie was shot very simple, nothing special, but most important, it taught me again, it's about human emotions, drama and acting.\" Foreign Language Film winner Gavin Hood ( Tsotsi ) commented that he felt the Oscar win would \"change the way South Africans view their moviemaking... hopefully it means that people will keep investing in our local stories, because this gives investors a little more confidence and what we want more than anything else is that people and human emotion is universal and we're more alike than we think we are around the world... we're actually so similar as human beings inside.\" Tsotsi was the People's Choice Award winner at the 2005 Toronto International Film Festival, while Crash debuted at the fest in 2004. Capote and Brokeback Mountain both played at the festival days after debuting at the Telluride Film Festival. TIFF's winners often go on to win Best Picture or Best Foreign Language Film; Wo hu cang long (Crouching Tiger, Hidden Dragon), American Beauty, and Whale Rider are such examples. At one point, Stewart jokingly chastised Hollywood for being \"out of touch\" with mainstream American values. Actor George Clooney later responded to this notion, saying, \"We are a little bit out of touch in Hollywood. It\u2019s probably a good thing. We\u2019re the ones that talked about AIDS when it was just being whispered. And we talked about civil rights when it wasn\u2019t really popular. We bring up subjects. This group of people gave Hattie McDaniel an Oscar in 1939 when blacks were still sitting in the backs of theaters. I\u2019m proud of this Academy, of this community. I\u2019m proud to be out of touch.\"", "after_revision": " The 78th were hosted by , host of 's . Crash won the Best Picture award, a surprise for many predictors. Co-producer commented \"[thank you for] embracing our film, about love and about tolerance, about truth. Thank you to the people all around the world who have been touched by this message. And we are humbled by the other nominees in this category. You have made this year one of the most breathtaking, and stunning, maverick years in American cinema, thank you.\" and also won best original screenplay for Crash. Directed and co-produced by Canadian Paul Haggis, film distribution rights were purchased for just USD$3 million by Lions Gate Films. Noted film critic called it his favourite picture of 2005, and the picture made many North American \"10 best\" lists. Backstage, Best Director winner commented to the press on how refreshed his will to direct. \"Before I get into making this movie, I was very tired from two very ambitious work, and . I almost wanted to retire. I felt I had enough, I hit the bottom, sort of like my mid life crisis or something, and this movie teach me how to look at myself, how to manage myself in movie making again, enjoying making them, and the movie was shot very simple, nothing special, but most important, it taught me again, it's about human emotions, drama and acting.\" Foreign Language Film winner Gavin Hood ( ) commented that he felt the Oscar win would \"change the way South Africans view their moviemaking... hopefully it means that people will keep investing in our local stories, because this gives investors a little more confidence and what we want more than anything else is that people and human emotion is universal and we're more alike than we think we are around the world... we're actually so similar as human beings inside.\" Tsotsi was the People's Choice Award winner at the 2005 Toronto International Film Festival, while Crash debuted at the fest in 2004. Capote and Brokeback Mountain both played at the festival days after debuting at the Telluride Film Festival. TIFF's winners often go on to win Best Picture or Best Foreign Language Film; (Crouching Tiger, Hidden Dragon), , and are such examples. At one point, Stewart jokingly chastised Hollywood for being \"out of touch\" with mainstream American values. Actor later responded to this notion, saying, \"We are a little bit out of touch in Hollywood. It\u2019s probably a good thing. We\u2019re the ones that talked about AIDS when it was just being whispered. And we talked about civil rights when it wasn\u2019t really popular. We bring up subjects. This group of people gave Hattie McDaniel an Oscar in 1939 when blacks were still sitting in the backs of theaters. I\u2019m proud of this Academy, of this community. I\u2019m proud to be out of touch.\"", "edit_actions": [{"type": "D", "before": "250px|An Academy Award.", "after": null, "start_char_pos": 0, "end_char_pos": 23}, {"type": "D", "before": "Academy Awards", "after": null, "start_char_pos": 33, "end_char_pos": 47}, {"type": "D", "before": "Jon Stewart", "after": null, "start_char_pos": 63, "end_char_pos": 74}, {"type": "R", "before": "Comedy Central's The Daily Show", "after": "'s", "start_char_pos": 85, "end_char_pos": 116}, {"type": "D", "before": "Cathy Schulman", "after": null, "start_char_pos": 197, "end_char_pos": 211}, {"type": "R", "before": "Paul Haggis and Bobby Moresco", "after": "and", "start_char_pos": 562, "end_char_pos": 591}, {"type": "D", "before": "Roger Ebert", "after": null, "start_char_pos": 789, "end_char_pos": 800}, {"type": "D", "before": "Ang Lee", "after": null, "start_char_pos": 932, "end_char_pos": 939}, {"type": "D", "before": "Brokeback Mountain", "after": null, "start_char_pos": 970, "end_char_pos": 988}, {"type": "R", "before": "The Hulk and Crouching Tiger, Hidden Dragon", "after": "and", "start_char_pos": 1104, "end_char_pos": 1147}, {"type": "D", "before": "Tsotsi", "after": null, "start_char_pos": 1556, "end_char_pos": 1562}, {"type": "D", "before": "Wo hu cang long", "after": null, "start_char_pos": 2314, "end_char_pos": 2329}, {"type": "R", "before": "American Beauty, and Whale Rider", "after": ", and", "start_char_pos": 2364, "end_char_pos": 2396}, {"type": "D", "before": "George Clooney", "after": null, "start_char_pos": 2531, "end_char_pos": 2545}], "sents_char_pos": [0, 23, 184, 303, 387, 446, 561, 636, 770, 899, 1018, 1149, 1176, 1513, 1991, 2125, 2235, 2313, 2415, 2524, 2633, 2661, 2733, 2797, 2819, 2935, 2981]} {"doc_id": "35104", "revision_depth": "1", "before_revision": "2006 Commonwealth Games Seventh Day of Competition By GoldPos. Country G S B Total 1 30px Australia 54 47 41 142 2 30px England21262168 3 30px| India 1611734 430px| Canada 11 22 16 49 530px Scotland 9 6 9 24 530px | South Africa 9 4 10 237 30pxJamaica 5229 830px| New Zealand 3 5 12 20 830px | Malaysia 3 3 4 10 8 30pxWales 3 1 7 11credit: Melbourne 2006 Full medal count", "after_revision": "2006 Commonwealth Games Eighth Day of Competition By GoldPos. Country G S B Total 1 30px Australia 57 51 45 135 2 30px England21282272 3 30px| India 1611734 430px| Canada 14 22 17 53 530px Scotland 10 7 9 26 630px | South Africa 9 4 10 237 30pxJamaica 52310 830px| New Zealand 4 5 12 21 930px | Malaysia 3 4 5 12 9 30pxWales 3 1 7 11credit: Melbourne 2006 Full medal count", "edit_actions": [{"type": "R", "before": "Seventh", "after": "Eighth", "start_char_pos": 24, "end_char_pos": 31}, {"type": "R", "before": "54 47 41 142", "after": "57 51 45 135", "start_char_pos": 100, "end_char_pos": 112}, {"type": "R", "before": "England21262168", "after": "England21282272", "start_char_pos": 120, "end_char_pos": 135}, {"type": "R", "before": "11", "after": "14", "start_char_pos": 172, "end_char_pos": 174}, {"type": "R", "before": "16 49", "after": "17 53", "start_char_pos": 178, "end_char_pos": 183}, {"type": "A", "before": null, "after": "10 7", "start_char_pos": 199, "end_char_pos": 199}, {"type": "R", "before": "6 9 24 530px", "after": "26 630px", "start_char_pos": 202, "end_char_pos": 214}, {"type": "R", "before": "5229", "after": "52310", "start_char_pos": 253, "end_char_pos": 257}, {"type": "R", "before": "3", "after": "4", "start_char_pos": 277, "end_char_pos": 278}, {"type": "R", "before": "20 830px", "after": "21 930px", "start_char_pos": 284, "end_char_pos": 292}, {"type": "D", "before": "3", "after": null, "start_char_pos": 306, "end_char_pos": 307}, {"type": "R", "before": "10 8", "after": "5 12 9", "start_char_pos": 310, "end_char_pos": 314}], "sents_char_pos": [0, 62]} {"doc_id": "35155", "revision_depth": "1", "before_revision": "The judge in the U.S. federal death penalty trial against Zacarias Moussaoui ruled on Friday that prosecutors can seek replacement witnesses for seven Federal Aviation Administration (FAA) employees whose testimony was tainted, and therefore disallowed because of pre-trial coaching by a Transportation Security Administration (TSA) lawyer. The 18-member jury (6 alternates) were sent home for a week while the court dealt with the revelation that government aviation security witness had been contacted prior to the trial by TSA lawyer Carla J. Martin , to help prepare their testimony in the case. Judge Leonie M. Brinkema initially ruled to prevent testimony from any aviation employees, but reversed her decision after the prosecution argued they would have little case left if their testimony remained inadmissible. FAA employee testimoney is expected to take the form of what measures would have been taken by the agency to prevent against the September 11, 2001 airliner attacks in New York City and Washington D.C. if Moussaoui had warned officials of the plan prior to the strikes. Defense attorney Edward B. MacMahon said that Moussaoui \"aspires to martyrdom,\" and called on jurors to deny the Al-Qaeda operative his wish to die. A wish that would result in him becoming \"a smiling face on a recruiting poster for Osama bin Laden ,\" MacMahon said. Moussaoui is believed by some to be the missing member in the team of 19 other attackers that carried out the suicide airliner strikes in New York City and Washington D.C. Arrested in Minnesota on immigration charges three weeks prior to the attacks, Moussaoui could have warned officials of the pending attacks, but failed to do so, argued Assistant U.S. Attorney Rob Spencer for the prosecution in opening statements. Family members of the nearly 3,000 killed in the attacks were able to watch the Alexandria , Virginia courtroom proceedings by closed-circuit television in six U.S. cities: New York, Boston, Central Islip, N.Y., Newark , N.J., and Philadelphia.", "after_revision": "The judge in the U.S. federal death penalty trial against ruled on Friday that prosecutors can seek replacement witnesses for seven (FAA) employees whose testimony was tainted, and therefore disallowed because of pre-trial coaching by a (TSA) lawyer. The 18-member jury (6 alternates) were sent home for a week while the court dealt with the revelation that government aviation security witness had been contacted prior to the trial by TSA lawyer , to help prepare their testimony in the case. Judge initially ruled to prevent testimony from any aviation employees, but reversed her decision after the prosecution argued they would have little case left if their testimony remained inadmissible. FAA employee testimoney is expected to take the form of what measures would have been taken by the agency to prevent against the airliner attacks in and if Moussaoui had warned officials of the plan prior to the strikes. Defense attorney Edward B. MacMahon said that Moussaoui \"aspires to martyrdom,\" and called on jurors to deny the operative his wish to die. A wish that would result in him becoming \"a smiling face on a recruiting poster for ,\" MacMahon said. Moussaoui is believed by some to be the missing member in the team of 19 other attackers that carried out the suicide airliner strikes in New York City and Washington D.C. Arrested in on immigration charges three weeks prior to the attacks, Moussaoui could have warned officials of the pending attacks, but failed to do so, argued Assistant U.S. Attorney Rob Spencer for the prosecution in opening statements. Family members of the nearly 3,000 killed in the attacks were able to watch the , Virginia courtroom proceedings by closed-circuit television in six U.S. cities: New York, Boston, Central Islip, N.Y., , N.J., and Philadelphia.", "edit_actions": [{"type": "D", "before": "Zacarias Moussaoui", "after": null, "start_char_pos": 58, "end_char_pos": 76}, {"type": "D", "before": "Federal Aviation Administration", "after": null, "start_char_pos": 151, "end_char_pos": 182}, {"type": "D", "before": "Transportation Security Administration", "after": null, "start_char_pos": 288, "end_char_pos": 326}, {"type": "D", "before": "Carla J. Martin", "after": null, "start_char_pos": 537, "end_char_pos": 552}, {"type": "D", "before": "Leonie M. Brinkema", "after": null, "start_char_pos": 606, "end_char_pos": 624}, {"type": "D", "before": "September 11, 2001", "after": null, "start_char_pos": 950, "end_char_pos": 968}, {"type": "R", "before": "New York City and Washington D.C.", "after": "and", "start_char_pos": 989, "end_char_pos": 1022}, {"type": "D", "before": "Al-Qaeda", "after": null, "start_char_pos": 1204, "end_char_pos": 1212}, {"type": "D", "before": "Osama bin Laden", "after": null, "start_char_pos": 1324, "end_char_pos": 1339}, {"type": "D", "before": "Minnesota", "after": null, "start_char_pos": 1542, "end_char_pos": 1551}, {"type": "D", "before": "Alexandria", "after": null, "start_char_pos": 1858, "end_char_pos": 1868}, {"type": "D", "before": "Newark", "after": null, "start_char_pos": 1990, "end_char_pos": 1996}], "sents_char_pos": [0, 340, 599, 820, 1090, 1239, 1357, 1777]} {"doc_id": "35963", "revision_depth": "1", "before_revision": "90px|Photos of Cronulla Riot suspects released to the ozzie media last week New South Wales Police say a 21-year-old ozzie woman has been charged in relation to the riots at Sydney's Cronulla Beach last year. She is the first ozzie woman to be arrested over reprisals from the December 11 ozzie race-fuelled riot. The ozzie woman was charged with affray, assaulting ozzie police, resisting arrest and disobeying ozzie police direction. She was refused bail. Ozzie police said the charges related to the violent and anti-social behaviour of a large number of ozzie people who gathered at Brighton-le-Sands on the night of the Cronulla riot. Three men have also been arrested in relation to the Cronulla riot. A 19-year-old ozzie man handed himself into ozzie police yesterday and is due to face Parramatta Local Court charged with riot and affray. A 21-year-old ozzie man from Cronulla also yesterday handed himself into ozzie detectives from Strike Force Enoggera, which was set up to investigate the ozzie racial unrest. The ozzie man was among the 20 whose photos were released to the ozzie media last week. Another ozzie man, whose photo was release to the ozzie media, handed himself in to ozzie police last night. He was charged with riot and affray and given conditional bail to appear at Sutherland Local Court on April 6. Ozzie police say Strike Force Enoggera has arrested 78 people to date, with 189 charges laid.", "after_revision": "90px|Photos of Cronulla Riot suspects released to the media last week New South Wales Police say a 21-year-old woman has been charged in relation to the riots at Sydney's Cronulla Beach last year. She is the first woman to be arrested over reprisals from the December 11 race-fuelled riot. The woman was charged with affray, assaulting police, resisting arrest and disobeying police direction. She was refused bail. Police said the charges related to the violent and anti-social behaviour of a large number of people who gathered at Brighton-le-Sands on the night of the Cronulla riot. Three men have also been arrested in relation to the Cronulla riot. A 19-year-old man handed himself into police yesterday and is due to face Parramatta Local Court charged with riot and affray. A 21-year-old man from Cronulla also yesterday handed himself into detectives from Strike Force Enoggera, which was set up to investigate the racial unrest. The man was among the 20 whose photos were released to the media last week. Another man, whose photo was release to the media, handed himself in to police last night. He was charged with riot and affray and given conditional bail to appear at Sutherland Local Court on April 6. Police say Strike Force Enoggera has arrested 78 people to date, with 189 charges laid.", "edit_actions": [{"type": "D", "before": "ozzie", "after": null, "start_char_pos": 54, "end_char_pos": 59}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 117, "end_char_pos": 122}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 226, "end_char_pos": 231}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 289, "end_char_pos": 294}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 318, "end_char_pos": 323}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 366, "end_char_pos": 371}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 412, "end_char_pos": 417}, {"type": "R", "before": "Ozzie police", "after": "Police", "start_char_pos": 458, "end_char_pos": 470}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 558, "end_char_pos": 563}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 722, "end_char_pos": 727}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 752, "end_char_pos": 757}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 861, "end_char_pos": 866}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 920, "end_char_pos": 925}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 1001, "end_char_pos": 1006}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 1026, "end_char_pos": 1031}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 1087, "end_char_pos": 1092}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 1118, "end_char_pos": 1123}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 1160, "end_char_pos": 1165}, {"type": "D", "before": "ozzie", "after": null, "start_char_pos": 1194, "end_char_pos": 1199}, {"type": "R", "before": "Ozzie police", "after": "Police", "start_char_pos": 1330, "end_char_pos": 1342}], "sents_char_pos": [0, 208, 313, 435, 457, 639, 707, 846, 1021, 1109, 1218]} {"doc_id": "36498", "revision_depth": "1", "before_revision": "David Parker today resigned from Cabinet; a day after he resigned his position as Attorney-General , after publicity around his filing of an incorrect declaration , with the Companies Office on behalf of Queens Park Mews Limited. The declaration said that ; the three shareholders had unanimously agreed not to appoint an auditor for the company , but according to Investigate Magazine, another shareholder Russell Hyslop, had never been consulted about the matter. Parker was saying early this morning , that he would persist to hold his other portfolios. Prime Minister Helen Clark released the news shortly before 11am (NZST) as she walked into a caucus meeting. She says \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act. The maximum penalty punishable under section 373(4) for filing a false return is a fine of $200,000 or 5 years imprisonment.", "after_revision": "David Parker resigned today from Cabinet, a day after he resigned his position as Attorney-General and after publicity around his filing of an incorrect declaration with the Companies Office on behalf of Queens Park Mews Limited. The declaration said that the three shareholders had unanimously agreed not to appoint an auditor for the company ; but according to Investigate Magazine, another shareholder , Russell Hyslop, had never been consulted about the matter. Parker was saying early this morning that he would persist in holding his other portfolios. Prime Minister Helen Clark released the news shortly before 11 a.m. (NZST) as she walked into a caucus meeting. She said, \"I have this morning accepted Mr Parker's resignation from all his portfolios.\" Knowingly authorising a false statement is an offence under the Companies Act. The maximum penalty under section 373(4) for filing a false return is a fine of $200,000 or five years of imprisonment.", "edit_actions": [{"type": "R", "before": "today resigned from Cabinet;", "after": "resigned today from Cabinet,", "start_char_pos": 13, "end_char_pos": 41}, {"type": "R", "before": ",", "after": "and", "start_char_pos": 99, "end_char_pos": 100}, {"type": "D", "before": ",", "after": null, "start_char_pos": 163, "end_char_pos": 164}, {"type": "D", "before": ";", "after": null, "start_char_pos": 256, "end_char_pos": 257}, {"type": "R", "before": ",", "after": ";", "start_char_pos": 346, "end_char_pos": 347}, {"type": "A", "before": null, "after": ",", "start_char_pos": 407, "end_char_pos": 407}, {"type": "D", "before": ",", "after": null, "start_char_pos": 504, "end_char_pos": 505}, {"type": "R", "before": "to hold", "after": "in holding", "start_char_pos": 528, "end_char_pos": 535}, {"type": "R", "before": "11am", "after": "11 a.m.", "start_char_pos": 618, "end_char_pos": 622}, {"type": "R", "before": "says", "after": "said,", "start_char_pos": 671, "end_char_pos": 675}, {"type": "D", "before": "punishable", "after": null, "start_char_pos": 855, "end_char_pos": 865}, {"type": "R", "before": "5 years", "after": "five years of", "start_char_pos": 938, "end_char_pos": 945}], "sents_char_pos": [0, 41, 229, 257, 466, 557, 666, 834]} {"doc_id": "36552", "revision_depth": "1", "before_revision": "The personal correspondence of the former Archbishop of North and South America, and spiritual leader of the Greek Orthodox community in the United States of America for 37 years, Iakovos Coucouzis, will be published during 2006. The Archbishop passed away in 2005. The publication of the correspondence of the late Archbishop will be the result of co-operation between the Theology School of the Aristotle University of Thessaloniki , the non-governmental Institute for National and Religious Studies and the program Ecumenical Hellenism . According to Athanasios Angelopoulos \u2014 who, along with theology professor Athanasios Karathanasis and political science student Nicolaos Mottas, has the scientific diligence of the project \u2014 the personal correspondence of Iakovos contains important information about the national issues of Greece, such as the Cyprus, Macedonian and the northern Epirus issues. A dynamic personality, the spiritual leader of the Greek Orthodox community in the United States from 1959 to 1996, Iakovos, constructed relations with all the American presidents, from Harry Truman to Bill Clinton, and with various personalities from the Americas, such as minority leaders, with most famous being his friendship with Martin Luther King Jr . The personal correspondence of the Greek Orthodox leader contains letters between Iakovos and various United States presidents, including John F. Kennedy, Richard Nixon , Ronald Reagan and George H. W. Bush, and with other political personalities \u2014 ministers, ambassadors, Washington, D.C. officials and former Greek Prime Ministers, including Constantine Caramanlis and Andreas Papandreou . According to professor Angelopoulos, the two-volume publication will contain photocopies of the original correspondence documents and moreover a major text \u2014 written in by Angelopoulos in Greek and translated into English by Nicolaos Mottas \u2014 which will summarize the essentians and meaning of Iakovos' correspondence, as well as its impact on the political, social and religious life of the Greek Orthodox Community in the United States of America and on Greek-American relations. Archbishop Iakovos with John F. Kennedy, 1960s. The supervisor of the project, professor Athanasios Angelopoulos, stated that Archbishop Iakovos' personal correspondence will be published in 2006. The publication, which will be prefaced by the Archbishop of Athens and All Greece, Archbishop Christodoulos , will be presented in Thessaloniki, Athens, and possibly to the Greek Community in the United States . External Links URL - Greek Orthodox Archdiocese of America URL - Orthodoxwiki%DIFDELCMD < %DIFDELCMD < %%% category:Religion category:Greece category:United States Category:North America Category:South America Category:George H. W .", "after_revision": "The personal correspondence of the former Archbishop of North and South America, and spiritual leader of the community in the United States of America for 37 years, Iakovos Coucouzis, will be published during 2006. The Archbishop passed away in 2005. The publication of the correspondence of the late Archbishop will be the result of co-operation between the Theology School of the , the non-governmental Institute for National and Religious Studies and the program . According to \u2014 who, along with theology professor Athanasios Karathanasis and political science student Nicolaos Mottas, has the scientific diligence of the project \u2014 the personal correspondence of Iakovos contains important information about the national issues of Greece, such as the Cyprus, and the northern issues. A dynamic personality, the spiritual leader of the Greek Orthodox community in the United States from 1959 to 1996, Iakovos, constructed relations with all the American presidents, from to Bill Clinton, and with various personalities from the Americas, such as minority leaders, with most famous being his friendship with . The personal correspondence of the Greek Orthodox leader contains letters between Iakovos and various United States presidents, including , , Ronald Reagan and George H. W. Bush, and with other political personalities \u2014 ministers, ambassadors, Washington, D.C. officials and former Greek Prime Ministers, including and . According to professor Angelopoulos, the two-volume publication will contain photocopies of the original correspondence documents and moreover a major text \u2014 written in by Angelopoulos in and translated into by Nicolaos Mottas \u2014 which will summarize the essentians and meaning of Iakovos' correspondence, as well as its impact on the political, social and religious life of the Greek Orthodox Community in the United States of America and on Greek-American relations. Archbishop Iakovos with John F. Kennedy, 1960s. The supervisor of the project, professor Athanasios Angelopoulos, stated that Archbishop Iakovos' personal correspondence will be published in 2006. The publication, which will be prefaced by the Archbishop of Athens and All Greece, Archbishop , will be presented in Thessaloniki, Athens, and possibly to the Greek Community in the United States %DIFDELCMD < %DIFDELCMD < %%% .", "edit_actions": [{"type": "D", "before": "Greek Orthodox", "after": null, "start_char_pos": 109, "end_char_pos": 123}, {"type": "D", "before": "Aristotle University of Thessaloniki", "after": null, "start_char_pos": 397, "end_char_pos": 433}, {"type": "D", "before": "Ecumenical Hellenism", "after": null, "start_char_pos": 518, "end_char_pos": 538}, {"type": "D", "before": "Athanasios Angelopoulos", "after": null, "start_char_pos": 554, "end_char_pos": 577}, {"type": "D", "before": "Macedonian", "after": null, "start_char_pos": 859, "end_char_pos": 869}, {"type": "D", "before": "Epirus", "after": null, "start_char_pos": 887, "end_char_pos": 893}, {"type": "D", "before": "Harry Truman", "after": null, "start_char_pos": 1088, "end_char_pos": 1100}, {"type": "D", "before": "Martin Luther King Jr", "after": null, "start_char_pos": 1237, "end_char_pos": 1258}, {"type": "D", "before": "John F. Kennedy, Richard Nixon", "after": null, "start_char_pos": 1399, "end_char_pos": 1429}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1432, "end_char_pos": 1432}, {"type": "R", "before": "Constantine Caramanlis and Andreas Papandreou", "after": "and", "start_char_pos": 1606, "end_char_pos": 1651}, {"type": "D", "before": "Greek", "after": null, "start_char_pos": 1842, "end_char_pos": 1847}, {"type": "D", "before": "English", "after": null, "start_char_pos": 1868, "end_char_pos": 1875}, {"type": "D", "before": "Christodoulos", "after": null, "start_char_pos": 2428, "end_char_pos": 2441}, {"type": "D", "before": ".", "after": null, "start_char_pos": 2544, "end_char_pos": 2545}, {"type": "D", "before": "External Links URL - Greek Orthodox Archdiocese of America URL - Orthodoxwiki", "after": null, "start_char_pos": 2546, "end_char_pos": 2623}, {"type": "D", "before": "category:Religion category:Greece category:United States Category:North America Category:South America Category:George H. W", "after": null, "start_char_pos": 2653, "end_char_pos": 2776}], "sents_char_pos": [0, 229, 265, 540, 901, 924, 1017, 1082, 1510, 1653, 2135, 2183, 2332]} {"doc_id": "36888", "revision_depth": "1", "before_revision": "The British National Party(BNP) a far-right political party , failed to hold onto one of its seats on Bradford City Council, West Yorkshire, UK. The byelection was called after the incumbent BNP councillor, Angela Clark, stood down. The seat was won in 2004 following a BNP hijacking of a campaign against gangs grooming girls for sex. The BNP claimed white girls were being groomed by Asian men for sex. The original campaign was organised by Angela Sinfield, whose 13 year-old daughter was groomed by a gang which she pointed out contained white and Asian men. Sinfield joined the Labour Party last year and was its candidate for the Keighley West seat. She sensationally won the seat with 1819 votes over the BNP's 1216, a swing of 11.4 per cent from the BNP to Labour. The voter turnout was near general election levels, 58.8 per cent.Three BNP councillors remain on Bradford City Council, with two of them up for election in May.", "after_revision": "The British National Party(BNP) , a far-right political party failed to hold on to one of its seats on Bradford City Council, West Yorkshire, UK. The byelection was called after the incumbent BNP councillor, Angela Clark, stood down. BNP had won the seat in 2004 after it adapted an ongoing campaign against gangs grooming girls for sex. The BNP claimed white girls were being groomed by Asian men for sex. The original campaign was organised by Angela Sinfield, whose 13 year-old daughter was groomed by a gang which she pointed out contained white and Asian men. Sinfield joined the Labour Party last year and was its candidate for the Keighley West seat. She sensationally won the seat with 1819 votes over the BNP's 1216, a swing of 11.4 per cent from the BNP to Labour. The voter turnout was near general election levels, 58.8 per cent.Three BNP councillors remain on Bradford City Council, with two of them up for election in May.", "edit_actions": [{"type": "A", "before": null, "after": ",", "start_char_pos": 32, "end_char_pos": 32}, {"type": "D", "before": ",", "after": null, "start_char_pos": 61, "end_char_pos": 62}, {"type": "R", "before": "onto", "after": "on to", "start_char_pos": 78, "end_char_pos": 82}, {"type": "R", "before": "The seat was won", "after": "BNP had won the seat", "start_char_pos": 234, "end_char_pos": 250}, {"type": "R", "before": "following a BNP hijacking of a", "after": "after it adapted an ongoing", "start_char_pos": 259, "end_char_pos": 289}], "sents_char_pos": [0, 145, 233, 336, 405, 563, 656, 773, 840]} {"doc_id": "37240", "revision_depth": "2", "before_revision": "Pro Hart's Gallery in Broken Hill, NSW Pro Hart, the self-taught, internationally-acclaimed Australian artist, died at home in Broken Hill on Tuesday after family members decided to cease his medication. The 77-year-old had been ill with motor neurone disease. Family members described his passing as peaceful. Pro Hart is a household name in Australia. Pro Hart's son, John Hart, says a State funeral is being organised for his father. He says his father lost the ability to paint about six months ago. Pro Hart's son David today said the funeral for the \"brushman of the bush\" will be held in the far-western New South Wales mining city of Broken Hill , for next Tuesday. \"It will be held next Tuesday\", he said, \"probably in the town's civic centre.\" Born Kevin Charles Hart in Broken Hill on May 30, 1928, his mining mates nicknamed him 'Professor' due to his passion for invention. He started painting \"cheeky\" pictures on the wooden beams of the mines he worked in. Pro Hart went to few art classes and started painting full-time in 1958. His work hangs in collections all over the world. Agent Amanda Phillips says Mr Hart was one of Australia's most renowned artists yet his paintings are not in the National Gallery . \"He's a great Australian, I mean he's been given an MBE for his services to art, he's been honoured all around the world, his work hangs in major collections around the world, why isn't he displayed here in Australia? A spokeswoman for the National Gallery confirmed they had a \"very limited collection\" of Pro Hart's works although no paintings. Cannon Technique Pro Hart is renowned for his unique 'cannon' technique, which he developed in 1970. 'Cannon' painting works by filling balls with paint and firing them at the canvas using a hand-held cannon. The Federal Member for Parkes, John Cobb, said Pro Hart had been an inspirational figure in Broken Hill and helped to establish the town as one of the Australia's greatest artistic centres. Prime Minister John Howard described Hart as a great artist whose portraits of the outback were instantly recognisable. \"Not only will he be remembered as one of our finest painters but also for the mark he made in sculpture and through his book illustrations,\" Mr Howard said in a statement. \"He made a wonderful contribution to art and culture in Australia, enhancing its profile on the world stage.\" Fellow artist Ken Done said Pro Hart's legacy was \"in his paintings\". He said the painter was best known for his portraits of the outback. \"But I think his strongest pictures were the ones he did about his time underground \u2013 those tougher times, tougher men \u2013 and he brought a real sensitivity to that experience,\" Mr Done said. Pro Hart received the Member of the Order of the British Empire award in 1976 for his services to art in Australia. He is survived by his wife Raylee, three sons and two daughters.", "after_revision": "Pro Hart's Gallery in Broken Hill, NSW Pro Hart, the self-taught, internationally-acclaimed Australian artist, died at home in Broken Hill on March 28 after family members decided to cease his medication. The 77-year-old had been ill with motor neurone disease. Family members described his passing as peaceful. Hart is a household name in Australia. Hart's son, John Hart, says a State funeral is being organised for his father. He says his father lost the ability to paint about six months ago. Pro Hart's son David today said the funeral for the \"brushman of the bush\" will be held in the far-western New South Wales mining city of Broken Hill next Tuesday. \"It will be held next Tuesday\", he said, \"probably in the town's civic centre.\" Born Kevin Charles Hart in Broken Hill on May 30, 1928, his mining mates nicknamed him 'Professor' due to his passion for invention. He started painting \"cheeky\" pictures on the wooden beams of the mines he worked in. Hart went to few art classes and started painting full-time in 1958. His work hangs in collections all over the world. Agent Amanda Phillips says Hart was one of Australia's most renowned artists yet his paintings are not in the National Gallery of Australia . \"He's a great Australian, I mean he's been given an MBE for his services to art, he's been honoured all around the world, his work hangs in major collections around the world, why isn't he displayed here in Australia? A spokeswoman for the National Gallery confirmed they had a \"very limited collection\" of Pro Hart's works although no paintings. Cannon Technique Hart is renowned for his unique 'cannon' technique, which he developed in 1970. 'Cannon' painting works by filling balls with paint and firing them at the canvas using a hand-held cannon. The Federal Member for Parkes, John Cobb, said Hart had been an inspirational figure in Broken Hill and helped to establish the town as one of the Australia's greatest artistic centres. Prime Minister John Howard described Hart as a great artist whose portraits of the outback were instantly recognisable. \"Not only will he be remembered as one of our finest painters but also for the mark he made in sculpture and through his book illustrations,\" Howard said in a statement. \"He made a wonderful contribution to art and culture in Australia, enhancing its profile on the world stage.\" Fellow artist Ken Done said Hart's legacy was \"in his paintings\". He said the painter was best known for his portraits of the outback. \"But I think his strongest pictures were the ones he did about his time underground \u2013 those tougher times, tougher men \u2013 and he brought a real sensitivity to that experience,\" Done said. Hart received the Member of the Order of the British Empire award in 1976 for his services to art in Australia. He is survived by his wife Raylee, three sons and two daughters.", "edit_actions": [{"type": "R", "before": "Tuesday", "after": "March 28", "start_char_pos": 142, "end_char_pos": 149}, {"type": "D", "before": "Pro", "after": null, "start_char_pos": 311, "end_char_pos": 314}, {"type": "D", "before": "Pro", "after": null, "start_char_pos": 354, "end_char_pos": 357}, {"type": "D", "before": ", for", "after": null, "start_char_pos": 654, "end_char_pos": 659}, {"type": "D", "before": "Pro", "after": null, "start_char_pos": 972, "end_char_pos": 975}, {"type": "D", "before": "Mr", "after": null, "start_char_pos": 1122, "end_char_pos": 1124}, {"type": "A", "before": null, "after": "of Australia", "start_char_pos": 1225, "end_char_pos": 1225}, {"type": "D", "before": "Pro", "after": null, "start_char_pos": 1592, "end_char_pos": 1595}, {"type": "D", "before": "Pro", "after": null, "start_char_pos": 1831, "end_char_pos": 1834}, {"type": "D", "before": "Mr", "after": null, "start_char_pos": 2236, "end_char_pos": 2238}, {"type": "D", "before": "Pro", "after": null, "start_char_pos": 2405, "end_char_pos": 2408}, {"type": "D", "before": "Mr", "after": null, "start_char_pos": 2692, "end_char_pos": 2694}, {"type": "D", "before": "Pro", "after": null, "start_char_pos": 2706, "end_char_pos": 2709}], "sents_char_pos": [0, 203, 260, 310, 353, 436, 503, 673, 753, 886, 971, 1044, 1094, 1445, 1574, 1783, 1973, 2093, 2266, 2376, 2446, 2515, 2705, 2821]} {"doc_id": "3808", "revision_depth": "1", "before_revision": "1 2 330px|4 5 6 7 8 30px| 30px| 30px| 30px| 30px| 30px| 30px| 9 30px|10 30px| 30px| 30px| 30px| 30px| 30px| 30px| 11 30px|12 30px| 30px|30px|30px|30px|30px| 30px| 30px| 30px|30px|13 14 15 30px|16 17 30px|30px|30px| 30px| 30px| 30px| 30px|30px|30px| 18 19 30px|20 21 30px|30px| 30px| 30px| 30px|30px|30px|30px|30px| 30px| 22 30px|23 24 25 30px| 30px| 30px| 30px| 30px| 30px| 30px| 26 30px|27 30px| 30px| 30px| 30px| 30px| 30px| 30px| 28 30px|29 Across Pub game (5) To decide by using one's palate (5-4) Feeling of acting without thinking (7) Flower of Scotland (7) Division of time whilst pregnant (9) Broadcasting live (colloq.) (2-3) Looked over, forgotten (9) Pastoral artwork (6) Passageways for air (5) Bordering a playing field (9) Indian city, New _____ (5) Large snowfall (9) Alcoholic drink (7) Take to be true (7) Through the night (9) What you're writing as answers (5) Down Timber found on the beach (9) Cold-blooded animal (7) Ointment (5) Inducement for animal to perform tricks etc. (5) Completely filled with water (9) Opinion piece (9) Where sea meets fresh water (7) Belongs to them (5) Having doubt (9) Pregnant (9) Those tuned in to a radio program (9) Unit of energy (7) Relating to energy from fission (7) Disney elephant cartoon (5) Leader of a monastery (5) Permit (5)", "after_revision": "1 2 330px|4 5 6 7 8 30px| 30px| 30px| 30px| 30px| 30px| 30px| 9 30px|10 30px| 30px| 30px| 30px| 30px| 30px| 30px| 11 30px|12 30px| 30px|30px|30px|30px|30px| 30px| 30px| 30px|30px|13 14 15 30px|16 17 30px|30px|30px| 30px| 30px| 30px| 30px|30px|30px| 18 19 30px|20 21 30px|30px| 30px| 30px| 30px|30px|30px|30px|30px| 30px| 22 30px|23 24 25 30px| 30px| 30px| 30px| 30px| 30px| 30px| 26 30px|27 30px| 30px| 30px| 30px| 30px| 30px| 30px| 28 30px|29 Across 1. Pub game (5) 4. To decide by using one's palate (5-4) 9. Feeling of acting without thinking (7) 10. Flower of Scotland (7) 11. Division of time whilst pregnant (9) 12. Broadcasting live (colloq.) (2-3) 13. Looked over, forgotten (9) 16. Pastoral artwork (6) 18. Passageways for air (5) 20. Bordering a playing field (9) 22. Indian city, New _____ (5) 23. Large snowfall (9) 26. Alcoholic drink (7) 27. Take to be true (7) 28. Through the night (9) 29. What you're writing as answers (5) Down 1. Timber found on the beach (9) 2. Cold-blooded animal (7) 3. Ointment (5) 4. Inducement for animal to perform tricks etc. (5) 5. Completely filled with water (9) 6. Opinion piece (9) 7. Where sea meets fresh water (7) 8. Belongs to them (5) 14. Having doubt (9) 15. Pregnant (9) 17. Those tuned in to a radio program (9) 19. Unit of energy (7) 21. Relating to energy from fission (7) 22. Disney elephant cartoon (5) 24. Leader of a monastery (5) 25. Permit (5)", "edit_actions": [{"type": "A", "before": null, "after": "1.", "start_char_pos": 451, "end_char_pos": 451}, {"type": "A", "before": null, "after": "4.", "start_char_pos": 465, "end_char_pos": 465}, {"type": "A", "before": null, "after": "9.", "start_char_pos": 504, "end_char_pos": 504}, {"type": "A", "before": null, "after": "10.", "start_char_pos": 544, "end_char_pos": 544}, {"type": "A", "before": null, "after": "11.", "start_char_pos": 568, "end_char_pos": 568}, {"type": "A", "before": null, "after": "12.", "start_char_pos": 606, "end_char_pos": 606}, {"type": "A", "before": null, "after": "13.", "start_char_pos": 641, "end_char_pos": 641}, {"type": "A", "before": null, "after": "16.", "start_char_pos": 669, "end_char_pos": 669}, {"type": "A", "before": null, "after": "18.", "start_char_pos": 691, "end_char_pos": 691}, {"type": "A", "before": null, "after": "20.", "start_char_pos": 716, "end_char_pos": 716}, {"type": "A", "before": null, "after": "22.", "start_char_pos": 747, "end_char_pos": 747}, {"type": "A", "before": null, "after": "23.", "start_char_pos": 775, "end_char_pos": 775}, {"type": "A", "before": null, "after": "26.", "start_char_pos": 795, "end_char_pos": 795}, {"type": "A", "before": null, "after": "27.", "start_char_pos": 816, "end_char_pos": 816}, {"type": "A", "before": null, "after": "28.", "start_char_pos": 837, "end_char_pos": 837}, {"type": "A", "before": null, "after": "29.", "start_char_pos": 860, "end_char_pos": 860}, {"type": "A", "before": null, "after": "1.", "start_char_pos": 901, "end_char_pos": 901}, {"type": "A", "before": null, "after": "2.", "start_char_pos": 932, "end_char_pos": 932}, {"type": "A", "before": null, "after": "3.", "start_char_pos": 957, "end_char_pos": 957}, {"type": "A", "before": null, "after": "4.", "start_char_pos": 971, "end_char_pos": 971}, {"type": "A", "before": null, "after": "5.", "start_char_pos": 1021, "end_char_pos": 1021}, {"type": "A", "before": null, "after": "6.", "start_char_pos": 1055, "end_char_pos": 1055}, {"type": "A", "before": null, "after": "7.", "start_char_pos": 1074, "end_char_pos": 1074}, {"type": "A", "before": null, "after": "8.", "start_char_pos": 1107, "end_char_pos": 1107}, {"type": "A", "before": null, "after": "14.", "start_char_pos": 1128, "end_char_pos": 1128}, {"type": "A", "before": null, "after": "15.", "start_char_pos": 1146, "end_char_pos": 1146}, {"type": "A", "before": null, "after": "17.", "start_char_pos": 1160, "end_char_pos": 1160}, {"type": "A", "before": null, "after": "19.", "start_char_pos": 1199, "end_char_pos": 1199}, {"type": "A", "before": null, "after": "21.", "start_char_pos": 1219, "end_char_pos": 1219}, {"type": "A", "before": null, "after": "22.", "start_char_pos": 1256, "end_char_pos": 1256}, {"type": "A", "before": null, "after": "24.", "start_char_pos": 1285, "end_char_pos": 1285}, {"type": "A", "before": null, "after": "25.", "start_char_pos": 1312, "end_char_pos": 1312}], "sents_char_pos": [0, 464, 634, 668, 690, 715, 746, 774, 794, 815, 836]} {"doc_id": "39892", "revision_depth": "1", "before_revision": "The Greek Premier Kostas Caramanlis and his counterpart of Turkey, Rejep Tayyip Erdogan , had a meeting, for 45 minutes, in Thessaloniki , northern Greece, in the sidelines of the Inter-Balkan Cooperation Summit. Caramanlis and Erdogan had the opportunity to discuss the bilateral issues between Greece and Turkey, such as the Cyprus Issue, the dispute between the two countries in the area of Aegean Sea as well as the process of Turkey's efforts to become a member of the European Union. Today, the Prime Minister of Turkey will have the opportunity to visit the Turkish Consulate of Thessaloniki; the house in which the founder of the Republic of Turkey, Kemal Ataturk , was born. Except from the Caramanlis-Erdogan meeting, important discussions took place in Thessaloniki between the leaders of Southeast Europe countries. The Bulgarian Prime Minister denied the reports in Bulgarian Media, whereby the Bulgarian public sector was backing out of the Burgas-Alexandroupolis oil pipe construction. In addition, the leaders welcomed the signing of the agreement for constructing a state-of-the-art railroad network in Southeast Europe, which as he said, would modernise rail transport, reduce travel time and increase the quality of the services provided in the region.", "after_revision": "The Greek Premier and his counterpart of Turkey, , had a meeting, for 45 minutes, in , northern Greece, in the sidelines of the Inter-Balkan Cooperation Summit. Caramanlis and Erdogan had the opportunity to discuss the bilateral issues between Greece and Turkey, such as the Cyprus Issue, the dispute between the two countries in the area of Aegean Sea as well as the process of Turkey's efforts to become a member of the European Union. Today, the Prime Minister of Turkey will have the opportunity to visit the Turkish Consulate of Thessaloniki; the house in which the founder of the , , was born. Except from the Caramanlis-Erdogan meeting, important discussions took place in Thessaloniki between the leaders of Southeast Europe countries. The Bulgarian Prime Minister denied the reports in Bulgarian Media, whereby the Bulgarian public sector was backing out of the - oil pipe construction. In addition, the leaders welcomed the signing of the agreement for constructing a state-of-the-art railroad network in Southeast Europe, which as he said, would modernise rail transport, reduce travel time and increase the quality of the services provided in the region.", "edit_actions": [{"type": "D", "before": "Kostas Caramanlis", "after": null, "start_char_pos": 18, "end_char_pos": 35}, {"type": "D", "before": "Rejep Tayyip Erdogan", "after": null, "start_char_pos": 67, "end_char_pos": 87}, {"type": "D", "before": "Thessaloniki", "after": null, "start_char_pos": 124, "end_char_pos": 136}, {"type": "D", "before": "Republic of Turkey, Kemal Ataturk", "after": null, "start_char_pos": 638, "end_char_pos": 671}, {"type": "A", "before": null, "after": ",", "start_char_pos": 674, "end_char_pos": 674}, {"type": "R", "before": "Burgas-Alexandroupolis", "after": "-", "start_char_pos": 956, "end_char_pos": 978}], "sents_char_pos": [0, 212, 489, 599, 684, 828, 1001]} {"doc_id": "40180", "revision_depth": "1", "before_revision": "17 year old Arsenal FC striker Theo Walcott is the biggest surprise in England national team coach Sven-G\u00f6ran Eriksson 's preliminary pick for the FIFA World Cup 2006 in Germany. Injured Wayne Rooney is also one of the players in the squad. Theo Walcott hasn't yet played a Premier League game but Eriksson thinks that the team needs players with Walcott's pace. Eriksson decided this morning to pick Walcott ahead of players like Darren Bent and Jermain Defoe . When he named Walcott there were a lot of surprised journalists in the press conference room. \"Sometimes you do it on feelings as well and I am excited about Theo Walcott,\" Eriksson said at the press conference. He consulted his assistant coach Tord Grip and Arsenal FC coach Arsene Wenger when he picked Walcott. Wenger, who in January convinced the Arsenal FC directors to transfer Walcott from Southampton FC , is impressed of what he have seen of him. Michael Owen is expected to train with the national team from Monday. Ledley King was not picked for the squad due to an injury and hasn't been able to train. Tottenham Hotspur FC coach Martin Jol is amazed that Jermain Defoe is not in the squad but he still believes that he will be there, referring to the situation with Wayne Rooney and Michael Owen. Charlton striker Darren Bent says on his agents' website that he is disappointed to be overlooked.", "after_revision": "17 year old striker is the biggest surprise in England national team coach 's preliminary pick for the in Germany. Injured is also one of the players in the squad. Theo Walcott hasn't yet played a game but Eriksson thinks that the team needs players with Walcott's pace. Eriksson decided this morning to pick Walcott ahead of players like and . When he named Walcott there were a lot of surprised journalists in the press conference room. \"Sometimes you do it on feelings as well and I am excited about Theo Walcott,\" Eriksson said at the press conference. He consulted his assistant coach Tord Grip and Arsenal FC coach Arsene Wenger when he picked Walcott. Wenger, who in January convinced the Arsenal FC directors to transfer Walcott from , is impressed of what he has seen of him. is expected to train with the national team from Monday. was not picked for the squad due to an injury and hasn't been able to train. coach is amazed that Jermain Defoe is not in the squad but he still believes that he will be there, referring to the situation with Wayne Rooney and Michael Owen. striker Darren Bent says on his agents' website that he is disappointed to be overlooked.", "edit_actions": [{"type": "R", "before": "Arsenal FC striker Theo Walcott", "after": "striker", "start_char_pos": 12, "end_char_pos": 43}, {"type": "D", "before": "Sven-G\u00f6ran Eriksson", "after": null, "start_char_pos": 99, "end_char_pos": 118}, {"type": "D", "before": "FIFA World Cup 2006", "after": null, "start_char_pos": 147, "end_char_pos": 166}, {"type": "D", "before": "Wayne Rooney", "after": null, "start_char_pos": 187, "end_char_pos": 199}, {"type": "D", "before": "Premier League", "after": null, "start_char_pos": 274, "end_char_pos": 288}, {"type": "R", "before": "Darren Bent and Jermain Defoe", "after": "and", "start_char_pos": 431, "end_char_pos": 460}, {"type": "D", "before": "Southampton FC", "after": null, "start_char_pos": 860, "end_char_pos": 874}, {"type": "R", "before": "have", "after": "has", "start_char_pos": 901, "end_char_pos": 905}, {"type": "D", "before": "Michael Owen", "after": null, "start_char_pos": 919, "end_char_pos": 931}, {"type": "D", "before": "Ledley King", "after": null, "start_char_pos": 989, "end_char_pos": 1000}, {"type": "R", "before": "Tottenham Hotspur FC coach Martin Jol", "after": "coach", "start_char_pos": 1078, "end_char_pos": 1115}, {"type": "D", "before": "Charlton", "after": null, "start_char_pos": 1273, "end_char_pos": 1281}], "sents_char_pos": [0, 178, 240, 362, 462, 556, 674, 776, 918, 988, 1077, 1272]} {"doc_id": "41428", "revision_depth": "1", "before_revision": "Map of East Timor Australian Minister for Foreign Affairs, Alexander Downer ( Mayo, Liberal told parliament on Tuesday that the government has received fresh reports of violence in East Timor. Mr Downer told the Australian House of Representatives that he has received fresh reports of violence breaking out in parts of the East Timorese capital Dili as well as other parts of the nation. According to the Australian Deparment of Foreign Affairs and Trade (DFAT), there were shoot outs near Becora and Fatuahi on Tuesday involving the East Timorese military and militia. Violence broke out in East Timor in April , 2006 following the dismissal of 585 East Timorese soldiers for deserting. On April 28, 2006, five people were killed in violent clashes in Dili. An independent commission has been setup by the East timorese government to investigate complaints by the dismissed soldiers. Mr Downer urged the commission to \"conclude it's work quickly as a first step to the resolution of the current crisis\". Mr Downer said that he had made it clear to the East Timorese government that Australia will assist in East Timor if requested. He said that the Australian military have a rapid response team, consisiting of naval ships, aircraft and troops deployed in Northern Australia ready to go to East Timor if requested.", "after_revision": "Map of East Timor On Tuesday Australian Minister for Foreign Affairs, Alexander Downer ( Division of Mayo, Liberal ) told parliament that the government has received fresh reports of violence in East Timor. Mr . Downer told the Australian House of Representatives that he has received fresh reports of violence erupting in parts of the East Timorese capital , Dili, as well as other parts of the nation. According to the Australian Department of Foreign Affairs and Trade (DFAT), there were shootouts near Becora and Fatuahi on Tuesday involving the East Timorese military and militia. Violence erupted in East Timor in April 2006 following the dismissal of 585 East Timorese soldiers for deserting. On April 28, 2006, five people were killed in violent clashes in Dili. An independent commission has been setup by the East Timorese government to investigate complaints by the dismissed soldiers. Mr . Downer urged the commission to \"conclude its work quickly as a first step to the resolution of the current crisis\". Mr . Downer said that he had made it clear to the East Timorese government that Australia will assist in East Timor if requested. He said that the Australian military have a rapid response team, consisting of naval ships, aircraft and troops deployed in Northern Australia ready to go to East Timor if requested.", "edit_actions": [{"type": "A", "before": null, "after": "On Tuesday", "start_char_pos": 18, "end_char_pos": 18}, {"type": "A", "before": null, "after": "Division of", "start_char_pos": 79, "end_char_pos": 79}, {"type": "R", "before": "told parliament on Tuesday", "after": ") told parliament", "start_char_pos": 94, "end_char_pos": 120}, {"type": "A", "before": null, "after": ".", "start_char_pos": 198, "end_char_pos": 198}, {"type": "R", "before": "breaking out", "after": "erupting", "start_char_pos": 298, "end_char_pos": 310}, {"type": "R", "before": "Dili", "after": ", Dili,", "start_char_pos": 349, "end_char_pos": 353}, {"type": "R", "before": "Deparment", "after": "Department", "start_char_pos": 420, "end_char_pos": 429}, {"type": "R", "before": "shoot outs", "after": "shootouts", "start_char_pos": 478, "end_char_pos": 488}, {"type": "R", "before": "broke out", "after": "erupted", "start_char_pos": 583, "end_char_pos": 592}, {"type": "D", "before": ",", "after": null, "start_char_pos": 616, "end_char_pos": 617}, {"type": "R", "before": "timorese", "after": "Timorese", "start_char_pos": 816, "end_char_pos": 824}, {"type": "A", "before": null, "after": ".", "start_char_pos": 892, "end_char_pos": 892}, {"type": "R", "before": "it's", "after": "its", "start_char_pos": 934, "end_char_pos": 938}, {"type": "A", "before": null, "after": ".", "start_char_pos": 1013, "end_char_pos": 1013}, {"type": "R", "before": "consisiting", "after": "consisting", "start_char_pos": 1204, "end_char_pos": 1215}], "sents_char_pos": [0, 194, 391, 573, 691, 762, 888, 1009, 1138]} {"doc_id": "42099", "revision_depth": "1", "before_revision": "200px|The Australian House of Representatives descended into rows between opposition and government members today The Australian Labor Party has accused speaker of the Australian House of Representatives, David Hawker ( Liberal, Wannon ) of failing to be impartial. During question time today, opposition leader, Kim Beazley (Labor, Brand ) asked the government to confirm comments made by Cameron Thompson (Liberal, Blair ), which asked for Prime Minister John Howard (Liberal, Bennelong ) to explain his role in the failed merger of the Nationals and Liberals in Queensland . According to Mr Beazley, Mr Thompson claims that the president of the Liberal party in Queensland was appointed by Mr Howard and that his actions would have been known and agreed upon by the Prime Minister. The opposition's next woe came when Stephen Smith (Labor, Perth ) asked the Prime Minister to confirm accusations that the government's new industrial relations laws (called Workchoices ) had placed pressure on the low pay commission to lower the minimum wage of Australian workers. Mr Howard took the opportunity to attack Mr Beazley's role as Minister for Employment, Education and Training in 1993 saying that he had contempt for the unemployed. Anthony Albanese (Labor, Grayndler ) raised a point of order, claiming that the Prime Minister's answer was irrelevant. This was refused by the speaker, who said that Mr Howard was attempting to answer a \"lengthy question\". Mr Albanese then interrupted Mr Howard as he was continuing his attack on Mr Beazley telling the speaker that the question was very specific and that Mr Howard's answer was irrelevant. Mr Albanese was ordered to resume his seat, and when he failed to do so was ordered out of the house. Following Mr Albanese's ejection, Mr Smith argued that the Prime Minister was not answering his question before also being ordered out of the house by the speaker. As Mr Howard began to continue his answer, Julia Irwin (Labor, Fowler ) interrupted Mr Howard. Mrs Irwin was then ordered to leave the house. The opposition found itself another member short in the house after Julia Gillard (Labor, Lalor ) was removed for calling Health Minister Tony Abbott (Liberal, Warringah ) an \"idiot\". Ms Gillard's comment followed Mr Abbott tabling a document written by Medibank Private relating to a media campaign to counter negative views on its sale. Part of the document claimed that Medibank Private had \"established a hypothetical but possible scenario: Julia Gillard arguing that the sale will mean higher premiums\". Following the house's question time, Mr Abbott and Peter Costello (Liberal, Higgins ) accused Lindsay Tanner (Labor, Melbourne ), Wayne Swan (Labor, Lilley ) and Kim Wilkey (Labor, Swan ) of deliberately blocking a camera's view of Mr Howard during one of his answers. Mr Tanner said \"It's not our fault he's short\" and Mr Wilkie said that he never raised from his chair and that Mr Abbott needed to \"get his facts straight\".", "after_revision": "200px|The Australian House of Representatives descended into rows between opposition and government members today The has accused speaker of the Australian House of Representatives, David Hawker ( , ) of failing to be impartial. During question time today, opposition leader, (Labor, ) asked the government to confirm comments made by Cameron Thompson (Liberal, ), which asked for Prime Minister John Howard (Liberal, ) to explain his role in the failed merger of the and Liberals in . According to Mr Beazley, Mr Thompson claims that the president of the Liberal party in Queensland was appointed by Mr Howard and that his actions would have been known and agreed upon by the Prime Minister. The opposition's next woe came when Stephen Smith (Labor, ) asked the Prime Minister to confirm accusations that the government's new industrial relations laws (called ) had placed pressure on the low pay commission to lower the minimum wage of Australian workers. Mr Howard took the opportunity to attack Mr Beazley's role as Minister for Employment, Education and Training in 1993 saying that he had contempt for the unemployed. Anthony Albanese (Labor, ) raised a point of order, claiming that the Prime Minister's answer was irrelevant. This was refused by the speaker, who said that Mr Howard was attempting to answer a \"lengthy question\". Mr Albanese then interrupted Mr Howard as he was continuing his attack on Mr Beazley telling the speaker that the question was very specific and that Mr Howard's answer was irrelevant. Mr Albanese was ordered to resume his seat, and when he failed to do so was ordered out of the house. Following Mr Albanese's ejection, Mr Smith argued that the Prime Minister was not answering his question before also being ordered out of the house by the speaker. As Mr Howard began to continue his answer, Julia Irwin (Labor, ) interrupted Mr Howard. Mrs Irwin was then ordered to leave the house. The opposition found itself another member short in the house after Julia Gillard (Labor, ) was removed for calling Health Minister Tony Abbott (Liberal, ) an \"idiot\". Ms Gillard's comment followed Mr Abbott tabling a document written by Medibank Private relating to a media campaign to counter negative views on its sale. Part of the document claimed that Medibank Private had \"established a hypothetical but possible scenario: Julia Gillard arguing that the sale will mean higher premiums\". Following the house's question time, Mr Abbott and Peter Costello (Liberal, ) accused Lindsay Tanner (Labor, ), Wayne Swan (Labor, ) and Kim Wilkey (Labor, ) of deliberately blocking a camera's view of Mr Howard during one of his answers. Mr Tanner said \"It's not our fault he's short\" and Mr Wilkie said that he never raised from his chair and that Mr Abbott needed to \"get his facts straight\".", "edit_actions": [{"type": "D", "before": "Australian Labor Party", "after": null, "start_char_pos": 118, "end_char_pos": 140}, {"type": "R", "before": "Liberal, Wannon", "after": ",", "start_char_pos": 220, "end_char_pos": 235}, {"type": "D", "before": "Kim Beazley", "after": null, "start_char_pos": 313, "end_char_pos": 324}, {"type": "D", "before": "Brand", "after": null, "start_char_pos": 333, "end_char_pos": 338}, {"type": "D", "before": "Blair", "after": null, "start_char_pos": 417, "end_char_pos": 422}, {"type": "D", "before": "Bennelong", "after": null, "start_char_pos": 479, "end_char_pos": 488}, {"type": "D", "before": "Nationals", "after": null, "start_char_pos": 539, "end_char_pos": 548}, {"type": "D", "before": "Queensland", "after": null, "start_char_pos": 565, "end_char_pos": 575}, {"type": "D", "before": "Perth", "after": null, "start_char_pos": 843, "end_char_pos": 848}, {"type": "D", "before": "Workchoices", "after": null, "start_char_pos": 959, "end_char_pos": 970}, {"type": "D", "before": "Grayndler", "after": null, "start_char_pos": 1259, "end_char_pos": 1268}, {"type": "D", "before": "Fowler", "after": null, "start_char_pos": 1972, "end_char_pos": 1978}, {"type": "D", "before": "Lalor", "after": null, "start_char_pos": 2141, "end_char_pos": 2146}, {"type": "D", "before": "Warringah", "after": null, "start_char_pos": 2211, "end_char_pos": 2220}, {"type": "D", "before": "Higgins", "after": null, "start_char_pos": 2636, "end_char_pos": 2643}, {"type": "D", "before": "Melbourne", "after": null, "start_char_pos": 2677, "end_char_pos": 2686}, {"type": "D", "before": "Lilley", "after": null, "start_char_pos": 2709, "end_char_pos": 2715}, {"type": "D", "before": "Swan", "after": null, "start_char_pos": 2741, "end_char_pos": 2745}], "sents_char_pos": [0, 265, 577, 784, 1067, 1233, 1353, 1457, 1642, 1744, 1908, 2003, 2050, 2234, 2389, 2559, 2828]} {"doc_id": "42439", "revision_depth": "1", "before_revision": "Flag of Somalia According to The Scotsman , former US intelligence officials said a secret operation to support the Alliance for the Restoration of Peace and Counter-Terrorism in war-torn Somalia appeared to involve both the CIA and US military . The officials spoke under condition of anonymity. The warlord factions that drove the US and UN troops out of Mogadishu in October 1993 led to the withdrawal of American forces from Somalia in 1994. This switch in allegiances from President Clinton's administration have so far not stopped the sharia courts, who have gained control of the capital, Mogadishu. A key objective of US policy in the Horn of Africa region is the US fear of Somalia becoming a safe haven for al-Qaeda. Somalia experts in US say, according to The East African newspaper, that the militias linked to the sharia courts have support among Mogadishu residents. Mohamed Asser, resident, said. \"The era of warlords in Somalia is over. This morning Mogadishu is under only one hand, the Islamic courts.\" John Prendergast , who served on the National Security Council staff in the Clinton administration and now tracks Somalia for the think-tank International Crisis Group said that three alliance leaders recently told him that they were receiving funds from the CIA. \"Our assessment is between $100,000 and $150,000 per month,\" Prendergast said. Giving money to warlord factions would violate the United Nations \u2019 arms embargo against Somalia. The United Nations, which is administering the embargo, is investigating how the warlord alliance came to receive a shipment of weapons. Prendergast believes this policy has resulted in an backlash: \"By circumventing the new government and going straight to individual warlords, the US is perpetuating and even deepening Somalia's fundamental problems, and compromising long-term efforts to combat extremism.\" Michael Zorick, former Somalia political officer in the US embassy in Nairobi, Kenya argues that US support of the Somali Alliance for the Restoration of Peace and Counter-Terrorism had increased support for Islamists. According to Zorick, the United States should give more support to the Somali government and push for peace. The analyst's advice went against the Bush administration , which recently had the regional expert reassigned to Chad. The Somali government, the Transitional Central Government in city of Baidoa , a bystander to the recent events, is the 14th of such authorities in Somalia since the overthrow of dictator Mohamed Siad Barre in 1991. The government is currently seeking talks with the Islamists groups with a view to establishing peace for the country. According to The Mercury News the Bush administration has deployed about 1,500 US troops in the tiny nation of Djibouti, on Somalia's northern border. That seems to be a part of a US regional strategy if the warlords lose on battlefield.", "after_revision": "Flag of Somalia According to , former US intelligence officials said a secret operation to support the in war-torn Somalia appeared to involve both the CIA and . The officials spoke under condition of anonymity. The warlord factions that in October 1993 led to the withdrawal of American forces from Somalia in 1994. This switch in allegiances from President Clinton's administration have so far not stopped the sharia courts, who have gained control of the capital, Mogadishu. A key objective of US policy in the region is the US fear of Somalia becoming a safe haven for al-Qaeda. Somalia experts in US say, according to The East African newspaper, that the militias linked to the sharia courts have support among Mogadishu residents. Mohamed Asser, resident, said. \"The era of warlords in Somalia is over. This morning Mogadishu is under only one hand, the Islamic courts.\" , who served on the in the Clinton administration and now tracks Somalia for the think-tank said that three alliance leaders recently told him that they were receiving funds from the CIA. \"Our assessment is between $100,000 and $150,000 per month,\" Prendergast said. Giving money to warlord factions would violate the United Nations ' arms embargo against Somalia. The United Nations, which is administering the embargo, is investigating how the warlord alliance came to receive a shipment of weapons. Prendergast believes this policy has resulted in an backlash: \"By circumventing the new government and going straight to individual warlords, the US is perpetuating and even deepening Somalia's fundamental problems, and compromising long-term efforts to combat extremism.\" Michael Zorick, former Somalia political officer in the US embassy in Nairobi, Kenya argues that US support of the Somali Alliance for the Restoration of Peace and Counter-Terrorism had increased support for Islamists. According to Zorick, the United States should give more support to the Somali government and push for peace. The analyst's advice went against the , which recently had the regional expert reassigned to Chad. The Somali government, the Transitional Central Government in city of , a bystander to the recent events, is the 14th of such authorities in Somalia since the overthrow of dictator in 1991. The government is currently seeking talks with the Islamists groups with a view to establishing peace for the country. According to the Bush administration has deployed about 1,500 US troops in the tiny nation of Djibouti, on Somalia's northern border. That seems to be a part of a US regional strategy if the warlords lose on battlefield.", "edit_actions": [{"type": "D", "before": "The Scotsman", "after": null, "start_char_pos": 29, "end_char_pos": 41}, {"type": "D", "before": "Alliance for the Restoration of Peace and Counter-Terrorism", "after": null, "start_char_pos": 116, "end_char_pos": 175}, {"type": "D", "before": "US military", "after": null, "start_char_pos": 233, "end_char_pos": 244}, {"type": "D", "before": "drove the US and UN troops out of Mogadishu", "after": null, "start_char_pos": 323, "end_char_pos": 366}, {"type": "D", "before": "Horn of Africa", "after": null, "start_char_pos": 643, "end_char_pos": 657}, {"type": "D", "before": "John Prendergast", "after": null, "start_char_pos": 1021, "end_char_pos": 1037}, {"type": "D", "before": "National Security Council staff", "after": null, "start_char_pos": 1058, "end_char_pos": 1089}, {"type": "D", "before": "International Crisis Group", "after": null, "start_char_pos": 1162, "end_char_pos": 1188}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 1430, "end_char_pos": 1431}, {"type": "D", "before": "Bush administration", "after": null, "start_char_pos": 2238, "end_char_pos": 2257}, {"type": "D", "before": "Baidoa", "after": null, "start_char_pos": 2389, "end_char_pos": 2395}, {"type": "D", "before": "Mohamed Siad Barre", "after": null, "start_char_pos": 2507, "end_char_pos": 2525}, {"type": "D", "before": "The Mercury News", "after": null, "start_char_pos": 2667, "end_char_pos": 2683}], "sents_char_pos": [0, 246, 296, 445, 606, 726, 880, 911, 952, 1284, 1363, 1461, 1598, 1871, 2090, 2199, 2318, 2534, 2653, 2804]} {"doc_id": "42584", "revision_depth": "1", "before_revision": "When 29 students in Florida attended a fake crime scene during a field trip set up by their teacher, Sue Messenger, they found a real body . The body of a homeless man was found in Fort Lauderdale Park by the students and police say he died of natural causes and there was nothing to indicate that foul play was involved. The students are part of a criminology class at St. Thomas Aquinas High School. \" We thought it was Ms. Messenger messing around with us,\" said 16-year-old Josh Rozental, who was the one that had discovered the body. \"When I went over, knowing what I know about rigor mortis and postmortem lividity, it was apparent to me that actually this was a deceased individual. So the biggest thing is I wanted them to move off ... I knew there was going to be an investigation and I just wanted them to back off and for us to not to disturb anything,\" said Messenger. For 20 years Messenger has been using \" paper skeletons, fake weapons, notes, shell casings, and sunglasses\" that students could find to further their education. The study was in its fifth of 13 days. Some students even thought the body was a \"dummy.\"%DIFDELCMD < %DIFDELCMD < %%% \" It was a good crash course. The first thing we thought was, 'that's a real good dummy she set up,'\" said 15-year-old Juan Cantor, a student at the high school. \" The students went up to this one area ... and found a man with his back against the wall and he looked dead. They thought it was part of the skit,\" said Kathy Collins a Fort Lauderdale Police detective. Police say the man was David Wayne Bodie, 45.", "after_revision": "When 29 students attended a fake crime scene in Fort Lauderdale Park during a field trip set up by their teacher, Sue Messenger, they found the body of a homeless man . Police said he died of natural causes and there was nothing to indicate that foul play was involved. The students are part of a criminology class at St. Thomas Aquinas High School. At first, some students thought the body was a \" dummy\". \" We thought it was Ms. Messenger messing around with us,\" said 16-year-old Josh Rozental, who was the one that had discovered the body. \"When I went over, knowing what I know about rigor mortis and postmortem lividity, it was apparent to me that actually this was a deceased individual. So the biggest thing is I wanted them to move off \u2026. I knew there was going to be an investigation and I just wanted them to back off and for us to not to disturb anything,\" said Messenger. \" %DIFDELCMD < %DIFDELCMD < %%% It was a good crash course. The first thing we thought was, 'that's a real good dummy she set up,'\" said 15-year-old Juan Cantor, a student at the high school. For 20 years Messenger has been using \" paper skeletons, fake weapons, notes, shell casings, and sunglasses\" that students could find to further their education. The study was in its fifth of 13 days. \" The students went up to this one area \u2026 and found a man with his back against the wall and he looked dead. They thought it was part of the skit,\" said Kathy Collins a Fort Lauderdale Police detective. Police said the man was David Wayne Bodie, 45.", "edit_actions": [{"type": "D", "before": "in Florida", "after": null, "start_char_pos": 17, "end_char_pos": 27}, {"type": "A", "before": null, "after": "in Fort Lauderdale Park", "start_char_pos": 56, "end_char_pos": 56}, {"type": "D", "before": "a real body .", "after": null, "start_char_pos": 128, "end_char_pos": 141}, {"type": "R", "before": "The body", "after": "the body", "start_char_pos": 142, "end_char_pos": 150}, {"type": "R", "before": "was found in Fort Lauderdale Park by the students and police say", "after": ". Police said", "start_char_pos": 169, "end_char_pos": 233}, {"type": "A", "before": null, "after": "At first, some students thought the body was a", "start_char_pos": 403, "end_char_pos": 403}, {"type": "A", "before": null, "after": "dummy\". \"", "start_char_pos": 406, "end_char_pos": 406}, {"type": "R", "before": "...", "after": "\u2026.", "start_char_pos": 743, "end_char_pos": 746}, {"type": "D", "before": "For 20 years Messenger has been using", "after": null, "start_char_pos": 884, "end_char_pos": 921}, {"type": "D", "before": "paper skeletons, fake weapons, notes, shell casings, and sunglasses\" that students could find to further their education. The study was in its fifth of 13 days.", "after": null, "start_char_pos": 924, "end_char_pos": 1084}, {"type": "D", "before": "Some students even thought the body was a \"dummy.\"", "after": null, "start_char_pos": 1085, "end_char_pos": 1135}, {"type": "D", "before": "\"", "after": null, "start_char_pos": 1165, "end_char_pos": 1166}, {"type": "A", "before": null, "after": "For 20 years Messenger has been using", "start_char_pos": 1327, "end_char_pos": 1327}, {"type": "A", "before": null, "after": "paper skeletons, fake weapons, notes, shell casings, and sunglasses\" that students could find to further their education. The study was in its fifth of 13 days.", "start_char_pos": 1330, "end_char_pos": 1330}, {"type": "A", "before": null, "after": "\"", "start_char_pos": 1331, "end_char_pos": 1331}, {"type": "R", "before": "...", "after": "\u2026", "start_char_pos": 1370, "end_char_pos": 1373}, {"type": "R", "before": "say", "after": "said", "start_char_pos": 1542, "end_char_pos": 1545}], "sents_char_pos": [0, 141, 322, 374, 402, 541, 692, 746, 883, 1045, 1084, 1135, 1194, 1326, 1440, 1534]} {"doc_id": "43194", "revision_depth": "1", "before_revision": "The broadcasters: TVNZ, CanWest, M\u0101ori Television, the TAB and Radio New Zealand have forged an alliance called FreeView which has leased satellite space for the digital television. Digital television will mean viewers can receive a crisper picture, clearer radio signals, limited reception problems, and more channels. It will require television viewers to buy a set top box, similar to the SKY Network Television decoder. Some viewers in some areas will need to buy a satellite dish as well. The approximated cost will be $200 or, with a dish, $400 (NZD) , however there is no subscription costs , unlike Sky Television.", "after_revision": "The broadcasters: TVNZ, CanWest, M\u0101ori Television, the TAB and Radio New Zealand have forged an alliance called FreeView which has leased satellite space for the digital television. Digital television will mean viewers can receive a crisper picture, clearer radio signals, limited reception problems, and more channels. FreeView will require television viewers to buy a set top box, similar to the SKY Network Television decoder. Some viewers in some areas will need to buy a satellite dish as well. The approximated cost will be $200 or, with a dish, $400 (NZD) . However, there is no subscription cost , unlike Sky Television.", "edit_actions": [{"type": "R", "before": "It", "after": "FreeView", "start_char_pos": 320, "end_char_pos": 322}, {"type": "R", "before": ", however", "after": ". However,", "start_char_pos": 557, "end_char_pos": 566}, {"type": "R", "before": "costs", "after": "cost", "start_char_pos": 592, "end_char_pos": 597}], "sents_char_pos": [0, 181, 319, 423, 493]} {"doc_id": "43757", "revision_depth": "1", "before_revision": "Australia defeated Ireland 37 points to 15 at Subiaco Oval in Perth, Australia on Saturday in a rugby union test match. The Wallabies had just come of a successful two test series win over England whilst the Irish had come off two competitive losses against the All Blacks in New Zealand. The win makes it three from three for new Australian coach John Connolly. The scoring opened up after 13 minutes of play, with Australia being awarded a penalty. Stirling Mortlock was successful with the shot at goal to take Australia to a three to nil lead. Ireland successfully held out Australia for the following ten minutes, until Chris Latham dived over to score the first try of the match. Mortlock missed the conversion , and Australia now lead eight points to nil. Ireland are awarded a penalty in the 29th minute which sees Ronan O'Gara successfully kick a goal for Ireland, getting their first points of the game to take the score to eight to three, with Australia having a five point lead. Australia further their lead when Mortlock is successful with another penalty goal around five minutes before half-time . The teams entered half-time , with Australia in front, 11 points to three. Ireland are quick to get back into the match, with a try to O'Gara in the 42nd minute. Although the conversion is missed, Ireland have moved closer to Australia, with the score narrowed to 11 poins to eight. Ireland score again in the 51st minute, with Neil Best scoring a try, and along with O'Gara's successful conversion, Ireland are now in front, 15 to 11, with just under 30 minutes remaining in the match. Australia are quick to respond, with Mark Gerrard scoring a try a few minutes later. Mortlock is successful with the conversion, and Australia take back the lead, with the score now at 18 to 11. Prop Greg Holmes gathers a loose ball and runs over 50m to score for Australia. Mortlock converts and Australia lead 25 to 15 with around 20 minutes remaining. George Gregan scores a try for Australia in the 67th minute, with Mortlock missing the conversion, Australia are now leading 30 to 15, making an Irish comeback unlikely, with just over ten minutes left in the match. Cameron Shepherd scores the last try of the match, which is converted by Mortlock, making the final score 37 to 15.", "after_revision": "Australia defeated Ireland 37 points to 15 at Subiaco Oval in Perth, Australia on Saturday in a rugby union test match. The Wallabies had just come of a successful two test series win over England whilst the Irish had come from two competitive losses against the All Blacks in New Zealand. The win makes it three from three for new Australian coach John Connolly. The scoring opened after 13 minutes of play, with Australia being awarded a penalty. Stirling Mortlock was successful with the shot at goal to take Australia to a three to nil lead. Ireland successfully held Australia for the following ten minutes, until Chris Latham dived over to score the first try of the match. Mortlock missed the conversion and Australia led eight points to nil. Ireland is awarded a penalty in the 29th minute which sees Ronan O'Gara successfully kick a goal for Ireland, getting its first points of the game bringing the score to eight to three, with Australia having a five point lead. Australia furthers its lead when Mortlock is successful with another penalty goal around five minutes before half time . The teams entered half time , with Australia in front, 11 points to three. Ireland is quick to get back into the match, with a try to O'Gara in the 42nd minute. Although the conversion is missed, Ireland has moved closer to Australia, with the score narrowed to 11 points to eight. Ireland scores again in the 51st minute, with Neil Best scoring a try, and along with O'Gara's successful conversion, Ireland is now in front, 15 to 11, with just under 30 minutes remaining in the match. Australia is quick to respond, with Mark Gerrard scoring a try a few minutes later. Mortlock is successful with the conversion, and Australia takes back the lead, with the score now at 18 to 11. Prop Greg Holmes gathers a loose ball and runs over 50m to score for Australia. Mortlock converts and Australia leads 25 to 15 with around 20 minutes remaining. George Gregan scores a try for Australia in the 67th minute, with Mortlock missing the conversion, Australia now leads 30 to 15, making an Irish comeback unlikely, with just over ten minutes left in the match. Cameron Shepherd scores the last try of the match, which is converted by Mortlock, making the final score 37 to 15.", "edit_actions": [{"type": "R", "before": "off", "after": "from", "start_char_pos": 223, "end_char_pos": 226}, {"type": "D", "before": "up", "after": null, "start_char_pos": 382, "end_char_pos": 384}, {"type": "D", "before": "out", "after": null, "start_char_pos": 574, "end_char_pos": 577}, {"type": "R", "before": ", and Australia now lead", "after": "and Australia led", "start_char_pos": 717, "end_char_pos": 741}, {"type": "R", "before": "are", "after": "is", "start_char_pos": 771, "end_char_pos": 774}, {"type": "R", "before": "their", "after": "its", "start_char_pos": 882, "end_char_pos": 887}, {"type": "R", "before": "to take", "after": "bringing", "start_char_pos": 913, "end_char_pos": 920}, {"type": "R", "before": "further their", "after": "furthers its", "start_char_pos": 1001, "end_char_pos": 1014}, {"type": "R", "before": "half-time", "after": "half time", "start_char_pos": 1101, "end_char_pos": 1110}, {"type": "R", "before": "half-time", "after": "half time", "start_char_pos": 1131, "end_char_pos": 1140}, {"type": "R", "before": "are", "after": "is", "start_char_pos": 1196, "end_char_pos": 1199}, {"type": "R", "before": "have", "after": "has", "start_char_pos": 1318, "end_char_pos": 1322}, {"type": "R", "before": "poins", "after": "points", "start_char_pos": 1380, "end_char_pos": 1385}, {"type": "R", "before": "score", "after": "scores", "start_char_pos": 1404, "end_char_pos": 1409}, {"type": "R", "before": "are", "after": "is", "start_char_pos": 1521, "end_char_pos": 1524}, {"type": "R", "before": "are", "after": "is", "start_char_pos": 1610, "end_char_pos": 1613}, {"type": "R", "before": "take", "after": "takes", "start_char_pos": 1743, "end_char_pos": 1747}, {"type": "R", "before": "lead", "after": "leads", "start_char_pos": 1907, "end_char_pos": 1911}, {"type": "R", "before": "are now leading", "after": "now leads", "start_char_pos": 2064, "end_char_pos": 2079}], "sents_char_pos": [0, 119, 288, 362, 450, 547, 685, 762, 990, 1112, 1187, 1274, 1395, 1599, 1684, 1794, 1874, 1954, 2170]} {"doc_id": "45802", "revision_depth": "1", "before_revision": "REDIRE ", "after_revision": "From the studios of Robinson Telephone Company in Arlington, Virginia, I'm Paul Robinson. Today is Sunday, , and the time is 23:30 Universal Coordinated Time. This is Wikinews. (Sound Effect) Here are the stories that are being covered: Karl Rove named as source who disclosed an undercover US CIA agent's identity. The nation of Papua New Guinea is at risk of an African-level HIV/AIDS epidemic Gaylord Nelson, creator of the Earth Day annual environmental event dies at 89. Alleged Al-Qaeda leader killed in Saudi Arabia. Karla Homolka release from prison has Canada in an uproar. Underwater volcano erupts 1400 kilometers from Tokyo. U.S. Government to retain control of the root servers of the Internet. Scientists may have tests to detect Alzheimers. Two American pilots successfully recreate a 1919 cross-Atlantic flight. Today in History from Wikipedia. And now, these stories Karl Rove named as source of Plame leak Reporter's notes subpoenaed by the U.S. District Court in Washington, D.C. reveal United States President George W. Bush's chief political advisor Karl Rove as one of the two sources behind the leaking of the identity of undercover CIA agent Valerie Plame. Knowingly revealing the identity of an undercover CIA official is a crime in the United States. The notes are those of TIME magazine White House correspondent Matt Cooper. They were released by Norman Pearlstine, editor-in-chief of TIME Inc., by order of the court, in ruling that, in the case of leaking the identity of CIA agents, reporters must reveal the identity of their sources. Judith Miller of The New York Times, along with Cooper, could face jail time for their refusal to name anonymous sources.
Papua New Guinea at risk of AIDS epidemic Dr. Peter Piot, head of U.N. AIDS agency, told The Associated Press on the sidelines of a regional AIDS conference Sunday about the potential for an explosion in HIV and AIDS cases in the country of Papua New Guinea. He said the country is \"the one that I would see that could have an African-type of epidemic\" and that the danger of HIV and AIDS there \"is really getting out of hand.\" He also said other Asia-Pacific nations like Malaysia, Vietnam and Myanmar are also worrisome as the number of infections there continue to rise.
Earth Day founder Nelson dies at 89 Gaylord Nelson, founder of Earth Day, died Sunday in Kensington, Maryland, of cardiovascular failure. Nelson, who was 89, was also a governor and senator from the U.S. state of Wisconsin. He created the concept of an annual recognition of environmental causes at a speech in Seattle in September 1969, and the first Earth Day was celebrated on April 22, 1970. In 1995, Nelson was awarded the Presidential Medal of Freedom for his environmental efforts by U.S. President Bill Clinton.
Alleged Al-Qaeda leader killed in Saudi Arabia Younis Mohammad Ibrahim al-Hayyari, who was believed to be one of the top leaders of Al-Qaeda, died after exchanging fire and hurling hand grenades at Saudi Arabian police in Riyadh. Hayyari's name was at the top of a list of 36 al Qaeda suspects announced by Riyadh last week. The ministry of the Interior said he had helped prepare explosives and had played a part in several attacks on targets there. Saudi Arabia has been battling suspected al Qaida militants for two years since May 2003, when they launched their campaign of violence with triple suicide bombings at expatriate housing compounds in Riyadh. Successive leaders of the Saudi wing of al Qaida have been killed since 2003 and Saudi officials say their replacements are increasingly inexperienced. But Western counterterrorism experts say al Qaida has shown a resilience and ability to regenerate.
Canada awaits Karla Homolka's Release from Prison Karla Homolka has transfixed Canada since she helped her husband drug, rape, torture, videotape and kill two teenage girls and cause the death of her own sister. Homolka, 35, will be released sometime before tuesday after serving the full sentence of 12 years in prison for manslaughter. According to press accounts of her childhood, Homolka was just 17, a bright 11th-grader, when she met Paul Bernardo, 23, a charming and handsome man, in 1987. Bernardo would ultimately be found by police to be a serial rapist, with sometime-assistance from Homolka. Homolka struck a bargain with prosecutors to plead guilty to two counts of manslaughter and testify against her husband, and fears she will be the target of vigilantes angry about what many Canadians consider the \"deal with the devil\" that's to blame for her imminent release.
Underwater volcano erupts in Pacific near Japan An underwater volcano has erupted in the Pacific Ocean, about 1400 kilometers south of Tokyo. A plume of steam, rising more than 1100 meters into the air, was spotted by Japanese troops on the island of Iwo Jima, which is about 48 kilometers from the eruption. The last undersea eruption in the area lasted three days back in 1986. U.S. retains control of Internet root servers The United States decided on Friday to indefinitely retain control the 13 root servers that direct all internet traffic to the right locations. This decision drew concern from foreign officials who would rather see an international group such as ICANN oversee the control of the servers. David Gross, a U.S. ambassador and the coordinator for international communications and information policies of the US State Department, insists that the announcement was not related to U.N. discussions. This decision reverses a statement made by the United States in 1998 in which they said would hand power over to ICANN after meeting a number of set conditions. A spokesman said that the declaration was in response to growing security threats and global communications and to the fact that commerce is becoming more reliant on the Internet.
Scientists may have tests to detect Alzheimers It is believed that magnetic resonance spectroscopy can detect genetic flaws which are an almost certain guarantee that the person will develop Alzheimers disease later in life. Scientists have also used positron emission tomography, or PET scans to see if Alzheimers disease developed in some test subjects. Another study determined that blood levels of a protein called amyloid beta 42 drops three to five years before a patient was diagnosed with Alzheimer\u2019s. It was also found that Japanese-Americans who drank the most fruit and vegetable juice had a fourfold lower risk of developing Alzheimer\u2019s. One researcher found that moderate drinkers of alcohol had a lower risk of Alzheimer\u2019s than either non-drinkers or heavy drinkers. Re-attempt of 1919 Cross-Atlantic Flight is Successful Steve Fossett and his co-pilot Mark Rebholz successfully flew a custom-built replica biplane across the Atlantic from St. John's, Newfoundland and landed Sunday at a golf course in Clifden, western Ireland. The trip took approximately 17 hours, 45 minutes longer than the original flight back in June 1919, by British pilots John Alcock and Arthur Whitten-Brown, who on their original trip, crash landed in a swamp. Mr. Fossett, who is 60 and already holds world records in five pursuits, decided to try an aircraft that lacked such modern conveniences as power steering.
Today in History from Wikipedia Today is Sunday, July 3, 2005. Today is the 184th day of the year. There are 181 days remaining in this year. Here are some of the events that happened today in history:
In 1608, the City of Quebec was founded by Samuel de Champlain. In 1886, the New York Tribune becomes the first newspaper to use a linotype machine, eliminating typesetting by hand. In 1890, Idaho was admitted as the 43rd U.S. state. This was the day in 1935 that Andr\u00e9 Citro\u00ebn, the French automobile pioneer, died. American actor Tom Cruise was born on this day in 1962. And in 1976, Israeli commandos rescued 105 hostages at Entebbe Airport, Uganda.
(Closing Comments) Thank you for joining us for today's segment. Join us again tomorrow for more headlines, news, facts, and anniversaries.
I'm Paul Robinson. This report is in the public domain.
If you wish to contact the staff of this broadcast, please send an email to audiowikinews@gmail.com. If you wish to contribute to Wikinews, please visit www.wikinews.org, or call United States telephone number, area code 206, 339-WIKI, that's 206-339-9454. Wikinews is a nonprofit independent news site run by the non-profit Wikimedia Foundation", "edit_actions": [{"type": "R", "before": "REDIRE", "after": "From the studios of Robinson Telephone Company in Arlington, Virginia, I'm Paul Robinson. Today is Sunday, , and the time is 23:30 Universal Coordinated Time. This is Wikinews. (Sound Effect)", "start_char_pos": 0, "end_char_pos": 6}, {"type": "A", "before": null, "after": "Here are the stories that are being covered:", "start_char_pos": 7, "end_char_pos": 7}, {"type": "A", "before": null, "after": "Karl Rove named as source who disclosed an undercover US CIA agent's identity. The nation of Papua New Guinea is at risk of an African-level HIV/AIDS epidemic Gaylord Nelson, creator of the Earth Day annual environmental event dies at 89. Alleged Al-Qaeda leader killed in Saudi Arabia. Karla Homolka release from prison has Canada in an uproar. Underwater volcano erupts 1400 kilometers from Tokyo. U.S. Government to retain control of the root servers of the Internet. Scientists may have tests to detect Alzheimers. Two American pilots successfully recreate a 1919 cross-Atlantic flight. Today in History from Wikipedia.", "start_char_pos": 8, "end_char_pos": 8}, {"type": "A", "before": null, "after": "And now, these stories", "start_char_pos": 9, "end_char_pos": 9}, {"type": "A", "before": null, "after": "Karl Rove named as source of Plame leak Reporter's notes subpoenaed by the U.S. District Court in Washington, D.C. reveal United States President George W. Bush's chief political advisor Karl Rove as one of the two sources behind the leaking of the identity of undercover CIA agent Valerie Plame. Knowingly revealing the identity of an undercover CIA official is a crime in the United States. The notes are those of TIME magazine White House correspondent Matt Cooper. They were released by Norman Pearlstine, editor-in-chief of TIME Inc., by order of the court, in ruling that, in the case of leaking the identity of CIA agents, reporters must reveal the identity of their sources. Judith Miller of The New York Times, along with Cooper, could face jail time for their refusal to name anonymous sources.
", "start_char_pos": 10, "end_char_pos": 10}, {"type": "A", "before": null, "after": "Papua New Guinea at risk of AIDS epidemic Dr. Peter Piot, head of U.N. AIDS agency, told The Associated Press on the sidelines of a regional AIDS conference Sunday about the potential for an explosion in HIV and AIDS cases in the country of Papua New Guinea. He said the country is \"the one that I would see that could have an African-type of epidemic\" and that the danger of HIV and AIDS there \"is really getting out of hand.\" He also said other Asia-Pacific nations like Malaysia, Vietnam and Myanmar are also worrisome as the number of infections there continue to rise.
", "start_char_pos": 11, "end_char_pos": 11}, {"type": "A", "before": null, "after": "Earth Day founder Nelson dies at 89 Gaylord Nelson, founder of Earth Day, died Sunday in Kensington, Maryland, of cardiovascular failure. Nelson, who was 89, was also a governor and senator from the U.S. state of Wisconsin. He created the concept of an annual recognition of environmental causes at a speech in Seattle in September 1969, and the first Earth Day was celebrated on April 22, 1970. In 1995, Nelson was awarded the Presidential Medal of Freedom for his environmental efforts by U.S. President Bill Clinton.
", "start_char_pos": 12, "end_char_pos": 12}, {"type": "A", "before": null, "after": "Alleged Al-Qaeda leader killed in Saudi Arabia Younis Mohammad Ibrahim al-Hayyari, who was believed to be one of the top leaders of Al-Qaeda, died after exchanging fire and hurling hand grenades at Saudi Arabian police in Riyadh. Hayyari's name was at the top of a list of 36 al Qaeda suspects announced by Riyadh last week. The ministry of the Interior said he had helped prepare explosives and had played a part in several attacks on targets there. Saudi Arabia has been battling suspected al Qaida militants for two years since May 2003, when they launched their campaign of violence with triple suicide bombings at expatriate housing compounds in Riyadh. Successive leaders of the Saudi wing of al Qaida have been killed since 2003 and Saudi officials say their replacements are increasingly inexperienced. But Western counterterrorism experts say al Qaida has shown a resilience and ability to regenerate.
", "start_char_pos": 13, "end_char_pos": 13}, {"type": "A", "before": null, "after": "Canada awaits Karla Homolka's Release from Prison Karla Homolka has transfixed Canada since she helped her husband drug, rape, torture, videotape and kill two teenage girls and cause the death of her own sister. Homolka, 35, will be released sometime before tuesday after serving the full sentence of 12 years in prison for manslaughter. According to press accounts of her childhood, Homolka was just 17, a bright 11th-grader, when she met Paul Bernardo, 23, a charming and handsome man, in 1987. Bernardo would ultimately be found by police to be a serial rapist, with sometime-assistance from Homolka. Homolka struck a bargain with prosecutors to plead guilty to two counts of manslaughter and testify against her husband, and fears she will be the target of vigilantes angry about what many Canadians consider the \"deal with the devil\" that's to blame for her imminent release.
", "start_char_pos": 14, "end_char_pos": 14}, {"type": "A", "before": null, "after": "Underwater volcano erupts in Pacific near Japan An underwater volcano has erupted in the Pacific Ocean, about 1400 kilometers south of Tokyo. A plume of steam, rising more than 1100 meters into the air, was spotted by Japanese troops on the island of Iwo Jima, which is about 48 kilometers from the eruption. The last undersea eruption in the area lasted three days back in 1986.", "start_char_pos": 15, "end_char_pos": 15}, {"type": "A", "before": null, "after": "U.S. retains control of Internet root servers The United States decided on Friday to indefinitely retain control the 13 root servers that direct all internet traffic to the right locations. This decision drew concern from foreign officials who would rather see an international group such as ICANN oversee the control of the servers. David Gross, a U.S. ambassador and the coordinator for international communications and information policies of the US State Department, insists that the announcement was not related to U.N. discussions. This decision reverses a statement made by the United States in 1998 in which they said would hand power over to ICANN after meeting a number of set conditions. A spokesman said that the declaration was in response to growing security threats and global communications and to the fact that commerce is becoming more reliant on the Internet.
", "start_char_pos": 16, "end_char_pos": 16}, {"type": "A", "before": null, "after": "Scientists may have tests to detect Alzheimers It is believed that magnetic resonance spectroscopy can detect genetic flaws which are an almost certain guarantee that the person will develop Alzheimers disease later in life. Scientists have also used positron emission tomography, or PET scans to see if Alzheimers disease developed in some test subjects. Another study determined that blood levels of a protein called amyloid beta 42 drops three to five years before a patient was diagnosed with Alzheimer\u2019s. It was also found that Japanese-Americans who drank the most fruit and vegetable juice had a fourfold lower risk of developing Alzheimer\u2019s. One researcher found that moderate drinkers of alcohol had a lower risk of Alzheimer\u2019s than either non-drinkers or heavy drinkers.", "start_char_pos": 17, "end_char_pos": 17}, {"type": "A", "before": null, "after": "Re-attempt of 1919 Cross-Atlantic Flight is Successful Steve Fossett and his co-pilot Mark Rebholz successfully flew a custom-built replica biplane across the Atlantic from St. John's, Newfoundland and landed Sunday at a golf course in Clifden, western Ireland. The trip took approximately 17 hours, 45 minutes longer than the original flight back in June 1919, by British pilots John Alcock and Arthur Whitten-Brown, who on their original trip, crash landed in a swamp. Mr. Fossett, who is 60 and already holds world records in five pursuits, decided to try an aircraft that lacked such modern conveniences as power steering.
", "start_char_pos": 18, "end_char_pos": 18}, {"type": "A", "before": null, "after": "Today in History from Wikipedia Today is Sunday, July 3, 2005. Today is the 184th day of the year. There are 181 days remaining in this year. Here are some of the events that happened today in history:
In 1608, the City of Quebec was founded by Samuel de Champlain. In 1886, the New York Tribune becomes the first newspaper to use a linotype machine, eliminating typesetting by hand. In 1890, Idaho was admitted as the 43rd U.S. state. This was the day in 1935 that Andr\u00e9 Citro\u00ebn, the French automobile pioneer, died. American actor Tom Cruise was born on this day in 1962. And in 1976, Israeli commandos rescued 105 hostages at Entebbe Airport, Uganda.", "start_char_pos": 19, "end_char_pos": 19}, {"type": "A", "before": null, "after": "
(Closing Comments) Thank you for joining us for today's segment. Join us again tomorrow for more headlines, news, facts, and anniversaries.
I'm Paul Robinson. This report is in the public domain.
If you wish to contact the staff of this broadcast, please send an email to audiowikinews@gmail.com. If you wish to contribute to Wikinews, please visit www.wikinews.org, or call United States telephone number, area code 206, 339-WIKI, that's 206-339-9454. Wikinews is a nonprofit independent news site run by the non-profit Wikimedia Foundation", "start_char_pos": 20, "end_char_pos": 20}], "sents_char_pos": [0]} {"doc_id": "45989", "revision_depth": "1", "before_revision": "Some of the nearly one in ten members of the Class of 2006 who still haven \u2019 t passed the CAHSEE weeks after their scheduled graduations, including dozens from James Logan High School \u2019 s Class of 2006, will get another crack at it starting today at high schools around the state, when schools administer an additional last chance two-day test, added to the testing schedule in April in response to the number of seniors who still hadn \u2019 t passed. Meanwhile, California \u2019 s First District Appellate Court of California this morning will begin hearing arguments in a lawsuit that aims to prohibit the state from requiring students to pass the test, and force it to give them the diplomas they currently lack. According to testing statistics released by the California Department of Education, 1,759 California seniors passed the test when they took it in May, the last time the test was administered, bringing the total percentage of last year \u2019 s seniors to pass the test to an estimated 90.8 percent, or 396,201 of 436,374 members of the Class of 2006. State Superintendent of Public Instruction Jack O \u2019 Connell, who wrote the law which required students to pass the test when he was a state legislator, expressed muted pleasure at the results, which indicate a narrowing of the \u201cachievement gap\u201d between racial groups. \"While I will not be satisfied until all California students are successful in gaining the skills measured by the exit exam, I am pleased that the achievement gap is narrowing,\" O \u2019 Connell said. \"It is clear that all students are working hard to gain the critical skills necessary for a diploma and for survival in today \u2019 s global economy. I credit the exit exam for focusing both students and schools on meeting this challenge. We need to sustain this effort until the achievement gap is erased completely.\" \u201c Eighty-five percent of Hispanic students in the Class of 2006 have passed the test, with 19.7 percent passing during the junior year and nearly 11 percent passing in their senior year, \u201d according to a statement released by O \u2019Connell. \u201c By comparison, 11.5 percent of white students passed as juniors and 4.1 percent of white students passed as seniors. Eighty-three percent of African American students have passed the test, with 20.6 percent passing as juniors and 12 percent passing as seniors. \u201d O \u2019 Connell said that the estimated 40,173 students who haven \u2019 t passed the test should not give up trying to get a high school diploma or more education: \"I urge these students to continue to work in summer school, take a fifth year of high school, or study in adult school or community college to acquire those important skills in English and math,\" O \u2019 Connell said. \"This exam benefits students who are still struggling by focusing them on areas they need to strengthen so they can have more successful futures. In court, Arturo Gonzalez, lead attorney in the case, Valenzuela vs. O'Connell, named for Liliana Valenzuela, a Richmond High School student, will try to convince the First Appellate Court of California to uphold a Superior Court judge \u2019 s May ruling blocking the state's use of the test, on the grounds that it \u2019 s use as a graduation requirement was unconstitutional because poor and minority students don't have access to equal educational resources, and therefore don't have equal protection under the law. The judge, Robert Freedman of Alameda County, issued an injunction against the use of the test, briefly giving hope of graduation without passing to thousands of students statewide, but O \u2019 Connell appealed to the state Supreme Court and they stayed the judge \u2019 s injunction, allowing the state to order schools to deny diplomas to those who hadn \u2019 t passed the test. The Supreme Court also ordered the First District Appellate Court to hear the case, which the court scheduled for today. \"If the appellate court affirms the injunction, then any student who has passed all of his or her required courses will receive a high school diploma, \u201d Gonzalez said in an e-mail to the James Logan Courier.", "after_revision": "Some of the nearly one in ten members of the Class of 2006 who still haven ' t passed the CAHSEE weeks after their scheduled graduations, including dozens from James Logan High School ' s Class of 2006, will get another crack at it starting today at high schools around the state, when schools administer an additional last chance two-day test, added to the testing schedule in April in response to the number of seniors who still hadn ' t passed. Meanwhile, California ' s First District Appellate Court of California this morning will begin hearing arguments in a lawsuit that aims to prohibit the state from requiring students to pass the test, and force it to give them the diplomas they currently lack. According to testing statistics released by the California Department of Education, 1,759 California seniors passed the test when they took it in May, the last time the test was administered, bringing the total percentage of last year ' s seniors to pass the test to an estimated 90.8 percent, or 396,201 of 436,374 members of the Class of 2006. State Superintendent of Public Instruction Jack O ' Connell, who wrote the law which required students to pass the test when he was a state legislator, expressed muted pleasure at the results, which indicate a narrowing of the \"achievement gap\" between racial groups. \"While I will not be satisfied until all California students are successful in gaining the skills measured by the exit exam, I am pleased that the achievement gap is narrowing,\" O ' Connell said. \"It is clear that all students are working hard to gain the critical skills necessary for a diploma and for survival in today ' s global economy. I credit the exit exam for focusing both students and schools on meeting this challenge. We need to sustain this effort until the achievement gap is erased completely.\" \" Eighty-five percent of Hispanic students in the Class of 2006 have passed the test, with 19.7 percent passing during the junior year and nearly 11 percent passing in their senior year, \" according to a statement released by O 'Connell. \" By comparison, 11.5 percent of white students passed as juniors and 4.1 percent of white students passed as seniors. Eighty-three percent of African American students have passed the test, with 20.6 percent passing as juniors and 12 percent passing as seniors. \" O ' Connell said that the estimated 40,173 students who haven ' t passed the test should not give up trying to get a high school diploma or more education: \"I urge these students to continue to work in summer school, take a fifth year of high school, or study in adult school or community college to acquire those important skills in English and math,\" O ' Connell said. \"This exam benefits students who are still struggling by focusing them on areas they need to strengthen so they can have more successful futures. \" In court, Arturo Gonzalez, lead attorney in the case, Valenzuela vs. O'Connell, named for Liliana Valenzuela, a Richmond High School student, will try to convince the First Appellate Court of California to uphold a Superior Court judge ' s May ruling blocking the state's use of the test, on the grounds that it ' s use as a graduation requirement was unconstitutional because poor and minority students don't have access to equal educational resources, and therefore don't have equal protection under the law. The judge, Robert Freedman of Alameda County, issued an injunction against the use of the test, briefly giving hope of graduation without passing to thousands of students statewide, but O ' Connell appealed to the state Supreme Court and they stayed the judge ' s injunction, allowing the state to order schools to deny diplomas to those who hadn ' t passed the test. The Supreme Court also ordered the First District Appellate Court to hear the case, which the court scheduled for today. \"If the appellate court affirms the injunction, then any student who has passed all of his or her required courses will receive a high school diploma, \" Gonzalez said in an e-mail to the James Logan Courier.", "edit_actions": [{"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 75, "end_char_pos": 76}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 184, "end_char_pos": 185}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 436, "end_char_pos": 437}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 470, "end_char_pos": 471}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 943, "end_char_pos": 944}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 1104, "end_char_pos": 1105}, {"type": "R", "before": "\u201cachievement gap\u201d", "after": "\"achievement gap\"", "start_char_pos": 1281, "end_char_pos": 1298}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 1502, "end_char_pos": 1503}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 1644, "end_char_pos": 1645}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1833, "end_char_pos": 1834}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 2020, "end_char_pos": 2021}, {"type": "R", "before": "\u2019Connell. \u201c", "after": "'Connell. \"", "start_char_pos": 2061, "end_char_pos": 2072}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 2334, "end_char_pos": 2335}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 2338, "end_char_pos": 2339}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 2398, "end_char_pos": 2399}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 2691, "end_char_pos": 2692}, {"type": "A", "before": null, "after": "\"", "start_char_pos": 2853, "end_char_pos": 2853}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 3090, "end_char_pos": 3091}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 3166, "end_char_pos": 3167}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 3553, "end_char_pos": 3554}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 3625, "end_char_pos": 3626}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 3712, "end_char_pos": 3713}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 4005, "end_char_pos": 4006}], "sents_char_pos": [0, 447, 707, 1053, 1321, 1517, 1663, 1752, 1832, 2070, 2189, 2333, 2706, 2852, 2922, 3364, 3732, 3853]} {"doc_id": "46145", "revision_depth": "1", "before_revision": "220px|This picture shows Saddam Hussein during his first appearance at the Iraqi Special Tribunal. He was the president of Iraq from 1979 until the United States-led invasion of Iraq reached Baghdad on April 9, 2003. The trial of Saddam Hussein has been adjourned until 16 October, which is when the Iraq Special Tribunal is expected to pronounce its judgment. Hussein and seven co-defendants are on trial charged with crimes against humanity after Hussein allegedly ordered his military forces to kill 148 people from the village of Dujail following an attempted assassination of the former Iraqi leader in 1982. The former dictator did not appear in court for the final session of his trial today, but he is due to stand trial on 21 August to judge his part in the infamous Anfal campaign , where groups of Iraqi Kurds were murdered in the 1980s. As Hussein \u2019 s defense team has been boycotting the trial demanding better security after three of their numbers were murdered, the court has selected replacement lawyers. Iraq\u2019s former Vice-President Taha Yassin Ramadan, today refused to allow the appointed representative to stand for him. \u201c I do not know who this lawyer is or his name, \u201d he said. The other defendant was Awad Hamad al-Bandar, the former chief judge of the court. Like he did yesterday, Judge Raouf Abdel Rahman again slated Hussein\u2019s defense lawyers for avoiding the court. \u201cThey\u2019 re sitting abroad now generating fame by issuing political statements on television stations as if this case is a political one. This behavior will harm you, the defendants. This is a criminal case, not a political one, \u201d Mr Rahman warned. Most of Hussein\u2019s legal team is based in Amman , the capital of Jordan.", "after_revision": " The trial of Saddam Hussein has been adjourned until 16 October, which is when the is expected to pronounce its judgment. Hussein and seven co-defendants are on trial charged with after Hussein allegedly ordered his military forces to kill 148 people from the village of following an attempted assassination of the former Iraqi leader in 1982. The former dictator did not appear in court for the final session of his trial today, but he is due to stand trial on 21 August to judge his part in the infamous , where groups of Iraqi were murdered in the 1980s. As Hussein ' s defense team has been boycotting the trial demanding better security after three of their numbers were murdered, the court has selected replacement lawyers. Iraq\u2019s former Vice-President Taha Yassin Ramadan, today refused to allow the appointed representative to stand for him. \" I do not know who this lawyer is or his name, \" he said. The other defendant was Awad Hamad al-Bandar, the former chief judge of the court. Like he did yesterday, Judge Raouf Abdel Rahman again slated Hussein\u2019s defense lawyers for avoiding the court. \"They' re sitting abroad now generating fame by issuing political statements on television stations as if this case is a political one. This behavior will harm you, the defendants. This is a criminal case, not a political one, \" Mr Rahman warned. Most of Hussein\u2019s legal team is based in , the capital of Jordan.", "edit_actions": [{"type": "D", "before": "220px|This picture shows Saddam Hussein during his first appearance at the Iraqi Special Tribunal. He was the president of Iraq from 1979 until the United States-led invasion of Iraq reached Baghdad on April 9, 2003.", "after": null, "start_char_pos": 0, "end_char_pos": 216}, {"type": "D", "before": "Iraq Special Tribunal", "after": null, "start_char_pos": 300, "end_char_pos": 321}, {"type": "D", "before": "crimes against humanity", "after": null, "start_char_pos": 419, "end_char_pos": 442}, {"type": "D", "before": "Dujail", "after": null, "start_char_pos": 534, "end_char_pos": 540}, {"type": "D", "before": "Anfal campaign", "after": null, "start_char_pos": 776, "end_char_pos": 790}, {"type": "D", "before": "Kurds", "after": null, "start_char_pos": 815, "end_char_pos": 820}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 860, "end_char_pos": 861}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1141, "end_char_pos": 1142}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1189, "end_char_pos": 1190}, {"type": "R", "before": "\u201cThey\u2019", "after": "\"They'", "start_char_pos": 1394, "end_char_pos": 1400}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1621, "end_char_pos": 1622}, {"type": "D", "before": "Amman", "after": null, "start_char_pos": 1682, "end_char_pos": 1687}], "sents_char_pos": [0, 98, 216, 360, 613, 848, 1020, 1140, 1199, 1282, 1393, 1529, 1574, 1640]} {"doc_id": "46507", "revision_depth": "1", "before_revision": "\u201c I\u2019m proud of him as a soldier and as a son. He did the Army proud, \u201d 60 year-old Robin Cornish said of his son, the one hundred and fifteenth British soldier to be killed in Iraq since operations began in 2003. Cpl Cornish, who served for the 1st Battalion The Light Infantry, joined the Army at the age of eighteen in Leeds. His deployments included Northern Ireland, Sierra Leone and Iraq in 2003 and 2004. He had been touring the country for a third time for three months when he was killed. His father said he would have risen through the ranks: \u201c He would have got on. He was determined to go up the ladder and he would have got there. \u201d Yesterday, Cpl Cornish \u2019 s Commanding Officer, Lietenant Colonel Johnny Bowron, said: \u201c Matthew was a great soldier, a fine friend and a marvellous husband and father. He will be remembered for his heart and his great character. A Yorkshireman through and through and an enthusiastic follower of Leeds Rhinos Rugby League, he was constantly teased for his inexplicable loyalty to Tottenham Hotspur Football Club. \u201d Cpl Cornish leaves behind his wife Abbey, his three-year old son Ethan and his one-year old daughter Libby. Lt Col Bowron said Cpl Cornish \u2019 s true passion was for his family. \u201c They were what lay closest to his heart - the rest was irrelevant. \u201d Des Browne, the Defence Secretary, commented on the loss of life in both Iraq and Afghanistan yesterday. \u201c Our troops are doing a tough job magnificently well. Their courage and commitment demands nothing but admiration. \u201d", "after_revision": "\" I\u2019m proud of him as a soldier and as a son. He did the Army proud, \" 60 year-old Robin Cornish said of his son, the one hundred and fifteenth British soldier to be killed in Iraq since operations began in 2003. Cpl Cornish, who served for the 1st Battalion The Light Infantry, joined the Army at the age of eighteen in Leeds. His deployments included Northern Ireland, Sierra Leone and Iraq in 2003 and 2004. He had been touring the country for a third time for three months when he was killed. His father said he would have risen through the ranks: \" He would have got on. He was determined to go up the ladder and he would have got there. \" Yesterday, Cpl Cornish ' s Commanding Officer, Lieutenant Colonel Johnny Bowron, said: \" Matthew was a great soldier, a fine friend and a marvellous husband and father. He will be remembered for his heart and his great character. A Yorkshire man through and through and an enthusiastic follower of Leeds Rhinos Rugby League, he was constantly teased for his inexplicable loyalty to Tottenham Hotspur Football Club. \" Cpl Cornish leaves behind his wife Abbey, his three-year old son Ethan and his one-year old daughter Libby. Lt Col Bowron said Cpl Cornish ' s true passion was for his family. \" They were what lay closest to his heart - the rest was irrelevant. \" Des Browne, the Defence Secretary, commented on the loss of life in both Iraq and Afghanistan yesterday. \" Our troops are doing a tough job magnificently well. Their courage and commitment demands nothing but admiration. \"", "edit_actions": [{"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 0, "end_char_pos": 1}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 69, "end_char_pos": 70}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 552, "end_char_pos": 553}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 643, "end_char_pos": 644}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 668, "end_char_pos": 669}, {"type": "R", "before": "Lietenant", "after": "Lieutenant", "start_char_pos": 692, "end_char_pos": 701}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 731, "end_char_pos": 732}, {"type": "R", "before": "Yorkshireman", "after": "Yorkshire man", "start_char_pos": 876, "end_char_pos": 888}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1058, "end_char_pos": 1059}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 1199, "end_char_pos": 1200}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1236, "end_char_pos": 1237}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1305, "end_char_pos": 1306}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1412, "end_char_pos": 1413}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1528, "end_char_pos": 1529}], "sents_char_pos": [0, 45, 212, 327, 410, 496, 575, 642, 812, 873, 1057, 1167, 1235, 1304, 1411, 1466]} {"doc_id": "47188", "revision_depth": "1", "before_revision": "According to BBC NEWS , Merseyside police have apparently been called in and are working with the Crown Prosecution Service. As yet there has been no confirmation that the blog was acting in or had intended to act in a criminal manner. An Earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather criminal matter. Liverpool City Council, has so far declined to comment on the sites dissaperance , although the site had been previosuly blocked from the council's IT systems.", "after_revision": "According to BBC News , Merseyside police have apparently been called in and are working with the Crown Prosecution Service. As yet there has been no confirmation that the blog was acting in or had intended to act in a criminal manner. An earlier article in the Liverpool Echo, had however suggested that some employees of Liverpool City Council felt postings on the blog may be defamatory, a civil rather than criminal matter. Liverpool City Council, has so far declined to comment on the sites disappearance , although the site had been previously blocked from the council's IT systems.", "edit_actions": [{"type": "R", "before": "NEWS", "after": "News", "start_char_pos": 17, "end_char_pos": 21}, {"type": "R", "before": "Earlier", "after": "earlier", "start_char_pos": 239, "end_char_pos": 246}, {"type": "A", "before": null, "after": "than", "start_char_pos": 406, "end_char_pos": 406}, {"type": "R", "before": "dissaperance", "after": "disappearance", "start_char_pos": 492, "end_char_pos": 504}, {"type": "R", "before": "previosuly", "after": "previously", "start_char_pos": 534, "end_char_pos": 544}], "sents_char_pos": [0, 124, 235, 423]} {"doc_id": "478642", "revision_depth": "1", "before_revision": "The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors. Repeat until flows around infobox ... Some testing going on here. .. Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled. The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.%DIFDELCMD < %DIFDELCMD < %%% Repeat until flows around infobox. . . Some testing going on here. . . Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled. The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors. Repeat until flows around infobox. . . Some testing going on here. . . Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled. The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors. Repeat until flows around infobox. .. Some testing going on here. .. Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled. The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors. Repeat until flows around infobox. .. Some testing going on here. .. Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled. The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors. Repeat until flows around infobox. .. Some testing going on here. .. Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled. The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.%DIFDELCMD < %DIFDELCMD < %%% Repeat until flows around infobox. .. Some testing going on here. ..%DIFDELCMD < %DIFDELCMD < %%% Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled. The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.%DIFDELCMD < %DIFDELCMD < %%% Repeat until flows around infobox. .", "after_revision": "The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors. > Filler text ... Bacon ipsum dolor sit amet pork loin anim leberkas cillum laboris. Aliquip speck voluptate, meatball sint brisket corned beef. Rump capicola est flank, tempor dolore beef spare ribs pork loin corned beef chuck in ut nisi. Occaecat chuck frankfurter ex pastrami, ea ut beef in turkey. Cow pork irure flank, ut sunt pig short ribs fatback voluptate spare ribs sed filet mignon. Brisket aute fugiat, deserunt officia sausage eu laborum turducken dolor. Pork loin pork belly chicken consectetur, boudin laboris leberkas bresaola sed sint veniam bacon nostrud. %DIFDELCMD < %DIFDELCMD < %%% Pork belly ex dolore in commodo. Dolore consectetur in cupidatat prosciutto. Fugiat strip steak kielbasa, pork belly short ribs in swine rump. Anim sirloin elit turducken eu adipisicing. Shank velit andouille filet mignon. Pork chop ribeye exercitation beef consequat . Magna pastrami ea strip steak tri-tip pig. Labore anim shank, sirloin proident do dolore minim reprehenderit ribeye. Shank t-bone in sed magna pariatur. Ribeye venison jerky nostrud swine, in tempor leberkas dolore dolore enim sirloin et . Beef ribs enim cow, ullamco laborum laboris exercitation brisket boudin id magna flank meatloaf. Ham veniam brisket beef filet mignon eiusmod. Officia mollit jerky, magna incididunt ea laboris irure et. Velit corned beef leberkas ut strip steak, pork chop spare ribs bresaola venison speck tempor t-bone. Ham hock sunt kielbasa, in incididunt frankfurter jerky swine andouille nisi. Tri-tip veniam cow kielbasa, shank shankle hamburger salami venison. Cupidatat culpa shoulder, turducken et irure strip steak nulla. Kielbasa bresaola pork loin andouille commodo swine. Commodo aute flank excepteur prosciutto boudin cow. Ut flank jerky meatloaf commodo. Filet mignon capicola commodo, consectetur in nulla leberkas dolore brisket bacon fugiat ex elit. Do labore ball tip venison biltong, strip steak speck cupidatat. Cillum velit laboris, flank drumstick elit commodo irure voluptate eu aute ham hock bresaola. Turducken non short ribs beef strip steak, chuck flank. Voluptate quis qui venison. Dolor hamburger aute turducken. Quis beef boudin ad, et ullamco filet mignon chuck. Qui reprehenderit eu, kielbasa shankle fatback ut biltong irure commodo t-bone . Ad anim biltong, excepteur officia ground round veniam ham hock deserunt irure tongue id. Pork belly ham hock dolore, tongue dolor pariatur dolore esse brisket elit. Exercitation non velit eiusmod cillum, tail pastrami bresaola swine ut occaecat adipisicing elit. Beef ribs reprehenderit incididunt non, mollit tongue tri-tip cupidatat venison in elit meatloaf. Elit mollit adipisicing, magna consectetur nostrud exercitation ham sunt anim beef shoulder . Tri-tip ut cillum, tenderloin enim ball tip pork qui fatback jowl. Enim nisi meatball, culpa boudin tongue sunt reprehenderit turkey t-bone ut. Ea spare ribs adipisicing cillum. Pig tongue minim, id ut cow strip steak. Turducken consequat pastrami, proident non meatloaf corned beef irure in velit veniam est t-bone swine. Brisket qui venison t-bone, ullamco tongue in. Rump fatback sirloin, proident consectetur reprehenderit commodo. Enim sint filet mignon leberkas shank, speck t-bone laborum aute dolore drumstick. Nulla andouille eiusmod reprehenderit sausage. Corned beef proident bacon deserunt. Jerky ribeye salami tempor shankle tail. Ut tempor eu, venison pastrami pork belly shoulder ham est beef ribs culpa shankle. T-bone in minim flank nulla. Leberkas labore aliquip t-bone, velit minim veniam prosciutto spare ribs laboris voluptate pastrami magna cupidatat. Swine beef tri-tip tenderloin, id adipisicing beef ribs. Boudin quis jerky, eiusmod short loin strip steak leberkas laboris excepteur reprehenderit fugiat meatball chuck. In short loin salami, bacon rump magna t-bone tempor cupidatat. Jerky fugiat pastrami meatball, labore ball tip nostrud tri-tip quis short loin ribeye salami ham hock. Drumstick chicken proident fugiat prosciutto non labore tongue aliquip pig. Pariatur shank spare ribs, dolor ground round sirloin speck incididunt ullamco duis eu do labore. Ex nulla labore, tenderloin swine drumstick cupidatat. Eu est adipisicing, officia speck consectetur excepteur do shoulder. Fugiat drumstick shank tongue duis, jerky dolore swine nostrud anim quis. Fatback sed officia, anim enim pork exercitation andouille filet mignon. Culpa non ball tip, turkey chuck strip steak ut swine dolor shank dolore do. Incididunt pork belly sint duis, commodo adipisicing pork minim meatloaf mollit chuck eiusmod. Sed pancetta aliqua deserunt chuck shankle velit. Shoulder hamburger andouille pig laboris excepteur capicola flank kielbasa. Corned beef culpa prosciutto ribeye sirloin, jowl meatloaf tenderloin fatback boudin turducken ball tip. Fugiat est fatback, officia consequat pork biltong nulla salami jowl. Capicola pig pancetta, aliqua jowl ribeye occaecat. T-bone officia dolore cupidatat reprehenderit. Culpa anim et consectetur, shoulder pork chop enim beef ribs laboris. In ball tip consequat swine, t-bone ribeye incididunt drumstick venison ham dolore dolor. Swine kielbasa tenderloin, ham ut t-bone ex adipisicing. Anim ut dolore incididunt. Ham hock id aliqua qui, speck dolore exercitation drumstick adipisicing. Officia fugiat strip steak, est pork belly meatloaf aute. Ham officia jerky consequat nisi strip steak, spare ribs aliquip leberkas cupidatat in. Flank ball tip cow, est ad fatback exercitation excepteur anim sint ea veniam duis. Tempor sausage sed laboris, reprehenderit speck tail. Qui chuck speck anim sint tempor. Ad quis tri-tip, meatloaf pig capicola nisi nostrud turducken elit reprehenderit. Ut short loin short ribs frankfurter fatback. Ut eu et pastrami do short loin. Pariatur culpa consequat, qui ground round velit turducken labore chuck strip steak aliquip consectetur pork belly ea. Eu ground round bacon, leberkas corned beef minim beef ribs ea voluptate deserunt pork belly. Pastrami bresaola enim, excepteur shank eu tri-tip leberkas strip steak voluptate. In pariatur ribeye pastrami rump, filet mignon minim fugiat. Chuck cow ad hamburger sint rump. T-bone qui chicken, tempor dolore jowl sed excepteur voluptate short ribs elit drumstick ad. Sint tongue qui, chicken aute cupidatat eiusmod salami nisi. Dolore rump duis, beef ut swine aute pork loin pariatur ground round sint. Aliquip tenderloin ea turducken, adipisicing est voluptate brisket ham consequat salami shankle occaecat aliqua. Salami tempor sausage, ea chicken excepteur bresaola flank eu turkey dolore mollit velit reprehenderit proident. Reprehenderit fugiat voluptate sunt, beef ribs nisi duis occaecat jerky ullamco pig incididunt boudin. Strip steak capicola ut, boudin bacon chicken duis minim shank esse proident elit flank. Est consectetur pariatur pork chop, enim capicola pastrami short ribs beef ribs speck bresaola sed filet mignon ut. Veniam bacon filet mignon boudin, aliqua laboris corned beef sunt short loin frankfurter flank shank pariatur. Tongue laboris anim andouille. Chicken capicola leberkas commodo est mollit aliquip, elit incididunt. Shankle venison cow, eu kielbasa capicola et swine do bacon proident nostrud commodo speck excepteur. Reprehenderit venison excepteur hamburger pig. Bacon consectetur salami, sed flank sint pancetta. Corned beef tongue tempor jowl veniam pork. %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% %DIFDELCMD < %DIFDELCMD < %%% Swine ut est chicken. Kielbasa ground round anim, sint aute drumstick in est ut sed tri-tip strip steak cow. Pork chop t-bone enim, corned beef hamburger short ribs duis esse bacon short loin minim venison boudin do fatback. Shank meatball id proident tail t-bone. Drumstick ut spare ribs shoulder, shank ball tip consequat. Do drumstick culpa consectetur pig elit", "edit_actions": [{"type": "R", "before": "Repeat until flows around infobox", "after": "> Filler text", "start_char_pos": 246, "end_char_pos": 279}, {"type": "R", "before": "Some testing going on here. ..", "after": "Bacon ipsum dolor sit amet pork loin anim leberkas cillum laboris. Aliquip speck voluptate, meatball sint brisket corned beef. Rump capicola est flank, tempor dolore beef spare ribs pork loin corned beef chuck in ut nisi. Occaecat chuck frankfurter ex pastrami, ea ut beef in turkey. Cow pork irure flank, ut sunt pig short ribs fatback voluptate spare ribs sed filet mignon. Brisket aute fugiat, deserunt officia sausage eu laborum turducken dolor. Pork loin pork belly chicken consectetur, boudin laboris leberkas bresaola sed sint veniam bacon nostrud.", "start_char_pos": 284, "end_char_pos": 314}, {"type": "D", "before": "Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled.", "after": null, "start_char_pos": 315, "end_char_pos": 474}, {"type": "D", "before": "The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.", "after": null, "start_char_pos": 475, "end_char_pos": 720}, {"type": "R", "before": "Repeat until flows around infobox.", "after": "Pork belly ex dolore in commodo. Dolore consectetur in cupidatat prosciutto. Fugiat strip steak kielbasa, pork belly short ribs in swine rump. Anim sirloin elit turducken eu adipisicing. Shank velit andouille filet mignon. Pork chop ribeye exercitation beef consequat", "start_char_pos": 750, "end_char_pos": 784}, {"type": "D", "before": ".", "after": null, "start_char_pos": 787, "end_char_pos": 788}, {"type": "R", "before": "Some testing going on here.", "after": "Magna pastrami ea strip steak tri-tip pig. Labore anim shank, sirloin proident do dolore minim reprehenderit ribeye. Shank t-bone in sed magna pariatur. Ribeye venison jerky nostrud swine, in tempor leberkas dolore dolore enim sirloin et", "start_char_pos": 789, "end_char_pos": 816}, {"type": "D", "before": ".", "after": null, "start_char_pos": 819, "end_char_pos": 820}, {"type": "R", "before": "Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled.", "after": "Beef ribs enim cow, ullamco laborum laboris exercitation brisket boudin id magna flank meatloaf. Ham veniam brisket beef filet mignon eiusmod. Officia mollit jerky, magna incididunt ea laboris irure et. Velit corned beef leberkas ut strip steak, pork chop spare ribs bresaola venison speck tempor t-bone. Ham hock sunt kielbasa, in incididunt frankfurter jerky swine andouille nisi. Tri-tip veniam cow kielbasa, shank shankle hamburger salami venison. Cupidatat culpa shoulder, turducken et irure strip steak nulla.", "start_char_pos": 821, "end_char_pos": 980}, {"type": "R", "before": "The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.", "after": "Kielbasa bresaola pork loin andouille commodo swine. Commodo aute flank excepteur prosciutto boudin cow. Ut flank jerky meatloaf commodo. Filet mignon capicola commodo, consectetur in nulla leberkas dolore brisket bacon fugiat ex elit.", "start_char_pos": 981, "end_char_pos": 1226}, {"type": "R", "before": "Repeat until flows around infobox.", "after": "Do labore ball tip venison biltong, strip steak speck cupidatat. Cillum velit laboris, flank drumstick elit commodo irure voluptate eu aute ham hock bresaola. Turducken non short ribs beef strip steak, chuck flank. Voluptate quis qui venison. Dolor hamburger aute turducken. Quis beef boudin ad, et ullamco filet mignon chuck. Qui reprehenderit eu, kielbasa shankle fatback ut biltong irure commodo t-bone", "start_char_pos": 1227, "end_char_pos": 1261}, {"type": "D", "before": ".", "after": null, "start_char_pos": 1264, "end_char_pos": 1265}, {"type": "R", "before": "Some testing going on here.", "after": "Ad anim biltong, excepteur officia ground round veniam ham hock deserunt irure tongue id. Pork belly ham hock dolore, tongue dolor pariatur dolore esse brisket elit. Exercitation non velit eiusmod cillum, tail pastrami bresaola swine ut occaecat adipisicing elit. Beef ribs reprehenderit incididunt non, mollit tongue tri-tip cupidatat venison in elit meatloaf. Elit mollit adipisicing, magna consectetur nostrud exercitation ham sunt anim beef shoulder", "start_char_pos": 1266, "end_char_pos": 1293}, {"type": "D", "before": ".", "after": null, "start_char_pos": 1296, "end_char_pos": 1297}, {"type": "R", "before": "Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled.", "after": "Tri-tip ut cillum, tenderloin enim ball tip pork qui fatback jowl. Enim nisi meatball, culpa boudin tongue sunt reprehenderit turkey t-bone ut. Ea spare ribs adipisicing cillum. Pig tongue minim, id ut cow strip steak. Turducken consequat pastrami, proident non meatloaf corned beef irure in velit veniam est t-bone swine. Brisket qui venison t-bone, ullamco tongue in.", "start_char_pos": 1298, "end_char_pos": 1457}, {"type": "R", "before": "The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.", "after": "Rump fatback sirloin, proident consectetur reprehenderit commodo. Enim sint filet mignon leberkas shank, speck t-bone laborum aute dolore drumstick. Nulla andouille eiusmod reprehenderit sausage. Corned beef proident bacon deserunt. Jerky ribeye salami tempor shankle tail. Ut tempor eu, venison pastrami pork belly shoulder ham est beef ribs culpa shankle.", "start_char_pos": 1458, "end_char_pos": 1703}, {"type": "R", "before": "Repeat until flows around infobox. ..", "after": "T-bone in minim flank nulla. Leberkas labore aliquip t-bone, velit minim veniam prosciutto spare ribs laboris voluptate pastrami magna cupidatat. Swine beef tri-tip tenderloin, id adipisicing beef ribs. Boudin quis jerky, eiusmod short loin strip steak leberkas laboris excepteur reprehenderit fugiat meatball chuck.", "start_char_pos": 1704, "end_char_pos": 1741}, {"type": "R", "before": "Some testing going on here. ..", "after": "In short loin salami, bacon rump magna t-bone tempor cupidatat. Jerky fugiat pastrami meatball, labore ball tip nostrud tri-tip quis short loin ribeye salami ham hock. Drumstick chicken proident fugiat prosciutto non labore tongue aliquip pig. Pariatur shank spare ribs, dolor ground round sirloin speck incididunt ullamco duis eu do labore. Ex nulla labore, tenderloin swine drumstick cupidatat. Eu est adipisicing, officia speck consectetur excepteur do shoulder. Fugiat drumstick shank tongue duis, jerky dolore swine nostrud anim quis.", "start_char_pos": 1742, "end_char_pos": 1772}, {"type": "R", "before": "Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled.", "after": "Fatback sed officia, anim enim pork exercitation andouille filet mignon. Culpa non ball tip, turkey chuck strip steak ut swine dolor shank dolore do. Incididunt pork belly sint duis, commodo adipisicing pork minim meatloaf mollit chuck eiusmod. Sed pancetta aliqua deserunt chuck shankle velit. Shoulder hamburger andouille pig laboris excepteur capicola flank kielbasa. Corned beef culpa prosciutto ribeye sirloin, jowl meatloaf tenderloin fatback boudin turducken ball tip.", "start_char_pos": 1773, "end_char_pos": 1932}, {"type": "R", "before": "The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.", "after": "Fugiat est fatback, officia consequat pork biltong nulla salami jowl. Capicola pig pancetta, aliqua jowl ribeye occaecat. T-bone officia dolore cupidatat reprehenderit. Culpa anim et consectetur, shoulder pork chop enim beef ribs laboris.", "start_char_pos": 1933, "end_char_pos": 2178}, {"type": "R", "before": "Repeat until flows around infobox. ..", "after": "In ball tip consequat swine, t-bone ribeye incididunt drumstick venison ham dolore dolor. Swine kielbasa tenderloin, ham ut t-bone ex adipisicing. Anim ut dolore incididunt. Ham hock id aliqua qui, speck dolore exercitation drumstick adipisicing.", "start_char_pos": 2179, "end_char_pos": 2216}, {"type": "R", "before": "Some testing going on here. ..", "after": "Officia fugiat strip steak, est pork belly meatloaf aute. Ham officia jerky consequat nisi strip steak, spare ribs aliquip leberkas cupidatat in. Flank ball tip cow, est ad fatback exercitation excepteur anim sint ea veniam duis. Tempor sausage sed laboris, reprehenderit speck tail. Qui chuck speck anim sint tempor. Ad quis tri-tip, meatloaf pig capicola nisi nostrud turducken elit reprehenderit.", "start_char_pos": 2217, "end_char_pos": 2247}, {"type": "R", "before": "Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled.", "after": "Ut short loin short ribs frankfurter fatback. Ut eu et pastrami do short loin. Pariatur culpa consequat, qui ground round velit turducken labore chuck strip steak aliquip consectetur pork belly ea. Eu ground round bacon, leberkas corned beef minim beef ribs ea voluptate deserunt pork belly.", "start_char_pos": 2248, "end_char_pos": 2407}, {"type": "R", "before": "The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.", "after": "Pastrami bresaola enim, excepteur shank eu tri-tip leberkas strip steak voluptate. In pariatur ribeye pastrami rump, filet mignon minim fugiat. Chuck cow ad hamburger sint rump. T-bone qui chicken, tempor dolore jowl sed excepteur voluptate short ribs elit drumstick ad. Sint tongue qui, chicken aute cupidatat eiusmod salami nisi.", "start_char_pos": 2408, "end_char_pos": 2653}, {"type": "R", "before": "Repeat until flows around infobox. ..", "after": "Dolore rump duis, beef ut swine aute pork loin pariatur ground round sint. Aliquip tenderloin ea turducken, adipisicing est voluptate brisket ham consequat salami shankle occaecat aliqua. Salami tempor sausage, ea chicken excepteur bresaola flank eu turkey dolore mollit velit reprehenderit proident. Reprehenderit fugiat voluptate sunt, beef ribs nisi duis occaecat jerky ullamco pig incididunt boudin. Strip steak capicola ut, boudin bacon chicken duis minim shank esse proident elit flank. Est consectetur pariatur pork chop, enim capicola pastrami short ribs beef ribs speck bresaola sed filet mignon ut. Veniam bacon filet mignon boudin, aliqua laboris corned beef sunt short loin frankfurter flank shank pariatur.", "start_char_pos": 2654, "end_char_pos": 2691}, {"type": "R", "before": "Some testing going on here. ..", "after": "Tongue laboris anim andouille. Chicken capicola leberkas commodo est mollit aliquip, elit incididunt. Shankle venison cow, eu kielbasa capicola et swine do bacon proident nostrud commodo speck excepteur. Reprehenderit venison excepteur hamburger pig. Bacon consectetur salami, sed flank sint pancetta. Corned beef tongue tempor jowl veniam pork.", "start_char_pos": 2692, "end_char_pos": 2722}, {"type": "D", "before": "Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled.", "after": null, "start_char_pos": 2723, "end_char_pos": 2882}, {"type": "D", "before": "The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.", "after": null, "start_char_pos": 2883, "end_char_pos": 3128}, {"type": "D", "before": "Repeat until flows around infobox. ..", "after": null, "start_char_pos": 3158, "end_char_pos": 3195}, {"type": "D", "before": "Some testing going on here. ..", "after": null, "start_char_pos": 3196, "end_char_pos": 3226}, {"type": "D", "before": "Working to move as much CSS as possible for Infoboxes into the master CSS, hence require a sandbox with its own Common. css page where changes can be trialled.", "after": null, "start_char_pos": 3256, "end_char_pos": 3415}, {"type": "D", "before": "The intended outcome of this is more flexible infoboxes, and ability to have multiple classes of infobox which may be re-coloured to make identifying an article's most-importand category easy - all whilst hiding the complexity from contributors.", "after": null, "start_char_pos": 3416, "end_char_pos": 3661}, {"type": "R", "before": "Repeat until flows around infobox. .", "after": "Swine ut est chicken. Kielbasa ground round anim, sint aute drumstick in est ut sed tri-tip strip steak cow. Pork chop t-bone enim, corned beef hamburger short ribs duis esse bacon short loin minim venison boudin do fatback. Shank meatball id proident tail t-bone. Drumstick ut spare ribs shoulder, shank ball tip consequat. Do drumstick culpa consectetur pig elit", "start_char_pos": 3691, "end_char_pos": 3727}], "sents_char_pos": [0, 245, 283, 314, 474, 720, 980, 1226, 1457, 1703, 1741, 1772, 1932, 2178, 2216, 2247, 2407, 2653, 2691, 2722, 2882, 3128, 3195, 3226, 3415, 3661]} {"doc_id": "48086", "revision_depth": "1", "before_revision": "In a speech in South London this morning, Communities Secretary Ruth Kelly has urged local communities to \u201croot out\u201d fanaticism. She was speaking as head of the government \u2019 s Commission on Integration and Cohesion. The commission was established to enhance community relations after the 7 July bomb attacks in London last year, and it will investigate how tensions between people of different ethnic groups and religions can be countered. \u201c Alongside the debate, we need action at all levels - national, but even more importantly from local communities themselves to help build united communities and root out all forms of extremism, \u201d Ms Kelly said. She also warned that communities were becoming more and more secluded from each other. \u201c In our attempt to avoid imposing a single British identity and culture, have we ended up with some communities living in isolation from each other with no common bonds between them? \u201d she asked. On the subject of immigration, Ms Kelly said it is not racist to discuss the issue. \u201c We need a well-managed system of immigration that has clear rules and integrity to counter exploitations from the far right. \u201d She also acknowledged that international events are having an impact on community relations. \u201c Global tensions are being reflected on the streets of local communities, \u201d she said. Damian Green, the Conservative Party \u2019 s spokesman on immigration , said: \u201c There is a huge and vital challenge to be met in helping Britain's Muslim communities integrate fully with the rest of society. We hope that this latest government initiative has more substance than previous initiatives which have tended to grab a headline but then achieve very little in the long term. \u201d", "after_revision": "In a speech in South London this morning, Communities Secretary Ruth Kelly has urged local communities to \"root out\" fanaticism. She was speaking as head of the government ' s Commission on Integration and Cohesion. The commission was established to enhance community relations after the 7 July bomb attacks in London last year, and it will investigate how tensions between people of different ethnic groups and religions can be countered. \" Alongside the debate, we need action at all levels - national, but even more importantly from local communities themselves to help build united communities and root out all forms of extremism, \" Ms Kelly said. She also warned that communities were becoming more and more secluded from each other. \" In our attempt to avoid imposing a single British identity and culture, have we ended up with some communities living in isolation from each other with no common bonds between them? \" she asked. On the subject of immigration, Ms Kelly said it is not racist to discuss the issue. \" We need a well-managed system of immigration that has clear rules and integrity to counter exploitations from the far right. \" She also acknowledged that international events are having an impact on community relations. \" Global tensions are being reflected on the streets of local communities, \" she said. Damian Green, the Conservative Party ' s spokesman on immigration said, \" There is a huge and vital challenge to be met in helping Britain's Muslim communities integrate fully with the rest of society. We hope that this latest government initiative has more substance than previous initiatives which have tended to grab a headline but then achieve very little in the long term. \"", "edit_actions": [{"type": "R", "before": "\u201croot out\u201d", "after": "\"root out\"", "start_char_pos": 106, "end_char_pos": 116}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 172, "end_char_pos": 173}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 440, "end_char_pos": 441}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 635, "end_char_pos": 636}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 739, "end_char_pos": 740}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 923, "end_char_pos": 924}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1020, "end_char_pos": 1021}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1147, "end_char_pos": 1148}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1242, "end_char_pos": 1243}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1317, "end_char_pos": 1318}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 1366, "end_char_pos": 1367}, {"type": "R", "before": ", said: \u201c", "after": "said, \"", "start_char_pos": 1395, "end_char_pos": 1404}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1709, "end_char_pos": 1710}], "sents_char_pos": [0, 128, 215, 439, 651, 738, 922, 935, 1019, 1146, 1241, 1328, 1532]} {"doc_id": "48094", "revision_depth": "1", "before_revision": "Pluto's diameter is about 18\\% that of Earth. Today, astronomers have endorsed a proposal about the definition of the word \"planet\" . As a consequence, our solar system now counts only 8 planets . They are Mercury, Venus, Earth, Mars, Jupiter, Saturn, Uranus and Neptune. Pluto no longer meets the criteria and loses its planet status, but becomes the prototype of a distinct class of dwarf planets . Ceres and 2003 UB313 also have been recognised as dwarf planets. Charon , which was previously in the run for promotion, did not meet the final criteria for a dwarf planet. Some 2500 astronomers from over 75 countries gathered this week in Prague at the Congress of the International Astronomical Union (IAU) to decide on several issues like a formal definition of a planet. Previously, there was no definition and with the discovery of new objects beyond Pluto there was much need for a clear criterion. The scientists also discussed new research findings in their field. The final draft states: \"A planet is a celestial body that is in orbit around the Sun has sufficient mass for its self-gravity to overcome rigid body forces so that it assumes a hydrostatic equilibrium (nearly round) shape has cleared the neighbourhood around its orbit. A dwarf planet is a celestial body that is in orbit around the Sun, has sufficient mass for its self-gravity to overcome rigid body forces so that it assumes a hydrostatic equilibrium (nearly round) shape, has not cleared the neighbourhood around its orbit, is not a satellite . Pluto did not meet one of the criteria for planet: its orbit is higly eccentric , causing it to overlap with Neptune's. The IAU has a dozen other objects similar to Pluto on its \"watchlist\" and is expected to announce new dwarf planets in the coming months and years. Ever since its discovery by American Clyde Tombaugh in 1930, Pluto has been considered a planet, though its status has been questioned many times after it was discovered to be far less massive than earlier calculations suggested, and because of its many other eccentricities. As a consequence of the vote, many textbooks, encyclopedias and other sources will need rewriting.", "after_revision": "Today, have endorsed a proposal about the . As a consequence, our solar system now counts only 8 . They are , , , , , , , and . no longer meets the criteria and loses its planet status, but becomes the prototype of a distinct class of . and also have been recognised as dwarf planets. , which was previously in the run for promotion, did not meet the final criteria for a dwarf planet. Some 2500 astronomers from over 75 countries gathered this week in at the Congress of the (IAU) to decide on several issues like a formal definition of a planet. Previously, there was no definition and with the discovery of new objects beyond Pluto there was much need for a clear criterion. The scientists also discussed new research findings in their field. The final draft states: \"A planet is a celestial body that is in orbit around the has sufficient mass for its self- to overcome so that it assumes a (nearly round) shape has around its orbit. A dwarf planet is a celestial body that is in orbit around the Sun, has sufficient mass for its self-gravity to overcome rigid body forces so that it assumes a hydrostatic equilibrium (nearly round) shape, has not cleared the neighbourhood around its orbit, is not a . Pluto did not meet one of the criteria for planet: its is highly , causing it to overlap with Neptune's. The IAU has a dozen other objects similar to Pluto on its \"watchlist\" and is expected to announce new dwarf planets in the coming months and years. Ever since its discovery by American in 1930, Pluto has been considered a planet, though its status has been questioned many times after it was discovered to be far less massive than earlier calculations suggested, and because of its many other eccentricities. As a consequence of the vote, many textbooks, encyclopedias and other sources will need rewriting.", "edit_actions": [{"type": "R", "before": "Pluto's diameter is about 18\\% that of Earth. Today, astronomers", "after": "Today,", "start_char_pos": 0, "end_char_pos": 64}, {"type": "D", "before": "definition of the word \"planet\"", "after": null, "start_char_pos": 100, "end_char_pos": 131}, {"type": "D", "before": "planets", "after": null, "start_char_pos": 187, "end_char_pos": 194}, {"type": "R", "before": "Mercury, Venus, Earth, Mars, Jupiter, Saturn, Uranus and Neptune. Pluto", "after": ", , , , , , , and .", "start_char_pos": 206, "end_char_pos": 277}, {"type": "D", "before": "dwarf planets", "after": null, "start_char_pos": 385, "end_char_pos": 398}, {"type": "R", "before": "Ceres and 2003 UB313", "after": "and", "start_char_pos": 401, "end_char_pos": 421}, {"type": "D", "before": "Charon", "after": null, "start_char_pos": 466, "end_char_pos": 472}, {"type": "D", "before": "Prague", "after": null, "start_char_pos": 641, "end_char_pos": 647}, {"type": "D", "before": "International Astronomical Union", "after": null, "start_char_pos": 671, "end_char_pos": 703}, {"type": "D", "before": "Sun", "after": null, "start_char_pos": 1056, "end_char_pos": 1059}, {"type": "R", "before": "self-gravity to overcome rigid body forces", "after": "self- to overcome", "start_char_pos": 1088, "end_char_pos": 1130}, {"type": "D", "before": "hydrostatic equilibrium", "after": null, "start_char_pos": 1152, "end_char_pos": 1175}, {"type": "D", "before": "cleared the neighbourhood", "after": null, "start_char_pos": 1201, "end_char_pos": 1226}, {"type": "D", "before": "satellite", "after": null, "start_char_pos": 1512, "end_char_pos": 1521}, {"type": "R", "before": "orbit is higly eccentric", "after": "is highly", "start_char_pos": 1579, "end_char_pos": 1603}, {"type": "D", "before": "Clyde Tombaugh", "after": null, "start_char_pos": 1829, "end_char_pos": 1843}], "sents_char_pos": [0, 45, 196, 271, 465, 573, 775, 905, 973, 1244, 1643, 1791, 2067]} {"doc_id": "48395", "revision_depth": "1", "before_revision": "Iranian president Mahmoud Ahmadinejad inaugurated a heavy-water production plant in Arak , Iran on Saturday, according to reports on Iranian television. The plant is part of the nuclear program of Iran , which the Iranian government says is for peaceful purposes only in the face of accusations by western governments that the country is trying to develop nuclear weapons. The Arak facility, located 150 miles south of Teheran , is part of a larger project of building a heavy-water reactor in the city. The Iranian president has said that it will be used for medical purposes only, and has said that students, scientists, and journalists will be allowed to tour the plant. Construction on the production plant began in 1996. Iran provoked international controversy in April 2006 when it announced an earlier nuclear success: the enrichment of a small amount of uranium to reactor-grade levels (3.5\\% of the isotope uranium-235 using gas centrifuge technology. Concern was raised by some that if Iran was able to scale up its enrichment facilities, they could be used to produce bomb-grade uranium (90\\% uranium-235). Heavy water is the colloquial name for deuterium oxide, 2H2O. To the unaided eye it appears identical to regular water, H2O, but it contains deuterium , a heavy isotope of hydrogen. Among its many uses, it is commonly used as a moderator in certain types of nuclear reactors. It is considered a nuclear proliferation risk because heavy-water production reactors can easily use natural uranium, and in the process transmute it into the element plutonium , which can be reprocessed and used as the fissile core of a nuclear bomb. Heavy-water production reactors have been used for this purpose by India, Israel, Pakistan, North Korea, Russia and USA. There is no evidence that heavy-water power reactors, such as the Canadian-produced CANDU reactor , have been used for military plutonium production, but in theory they can also be used for this purpose, as any uranium reactor will produce certain amounts of plutonium. Critics have charged that current Iranian research reactors do not require the amount of heavy water which the production facility will be able to create. Iran's other controversial reactor site at Bushehr does not require heavy water. Though many of Iran's nuclear facilities do have possible peaceful uses, most of them are considered dual-use technology , which could also be diverted into military purposes. In 2003, the still-developing production site was inspected by a delegation from the International Atomic Energy Agency, the non-proliferation wing of the United Nations in charge of enforcing the Nuclear Non-Proliferation Treaty , of which Iran is a signatory. At the time, Iran claimed the heavy water would be for exporting to other countries, and later clarified that it would be used for a heavy-water reactor in Arak. Iran has claimed that it would have purchased a heavy-water research reactor from abroad but it had been unable to do so, and so had to resort to an indigenous design and construction. Iran claims that the reactor will be used to produce radioisotopes , which have many medical applications. IAEA inspectors questioned this on the basis that the reactor plans they had seen did not have adequate facilities for producing radioisotopes. Iran claimed that the plans were still developing and that the missing facilities, known as hot cells, could not yet be designed without knowing other characteristics of the reactor, and that they were building a separate facility with those capabilities at the same site.", "after_revision": "Iranian president Mahmoud Ahmadinejad inaugurated a production plant in , Iran on Saturday, according to reports on Iranian television. The plant is part of the , which the Iranian government says is for peaceful purposes only in the face of accusations by western governments that the country is trying to develop nuclear weapons. The Arak facility, located 150 miles south of , is part of a larger project of building a heavy-water in the city. The Iranian president has said that it will be used for medical purposes only, and has said that students, scientists, and journalists will be allowed to tour the plant. Construction on the production plant began in 1996. Iran provoked international controversy in April 2006 when it announced an earlier nuclear success: the of a small amount of to reactor-grade levels (3.5\\% of the isotope using technology. Concern was raised by some that if Iran was able to scale up its enrichment facilities, they could be used to produce bomb-grade uranium (90\\% uranium-235). Heavy water is the colloquial name for deuterium oxide, 2H2O. To the unaided eye it appears identical to regular water, H2O, but it contains , a heavy isotope of hydrogen. Among its many uses, it is commonly used as a moderator in certain types of nuclear reactors. It is considered a nuclear proliferation risk because heavy-water production reactors can easily use natural uranium, and in the process transmute it into the element , which can be reprocessed and used as the fissile core of a nuclear bomb. Heavy-water production reactors have been used for this purpose by India, Israel, Pakistan, North Korea, Russia and USA. There is no evidence that heavy-water power reactors, such as the Canadian-produced , have been used for military plutonium production, but in theory they can also be used for this purpose, as any uranium reactor will produce certain amounts of plutonium. Critics have charged that current Iranian research reactors do not require the amount of heavy water which the production facility will be able to create. Iran's other controversial reactor site at does not require heavy water. Though many of Iran's nuclear facilities do have possible peaceful uses, most of them are considered , which could also be diverted into military purposes. In 2003, the still-developing production site was inspected by a delegation from the International Atomic Energy Agency, the non-proliferation wing of the United Nations in charge of enforcing the , of which Iran is a signatory. At the time, Iran claimed the heavy water would be for exporting to other countries, and later clarified that it would be used for a heavy-water reactor in Arak. Iran has claimed that it would have purchased a heavy-water research reactor from abroad but it had been unable to do so, and so had to resort to an indigenous design and construction. Iran claims that the reactor will be used to produce , which have many medical applications. IAEA inspectors questioned this on the basis that the reactor plans they had seen did not have adequate facilities for producing radioisotopes. Iran claimed that the plans were still developing and that the missing facilities, known as hot cells, could not yet be designed without knowing other characteristics of the reactor, and that they were building a separate facility with those capabilities at the same site.", "edit_actions": [{"type": "D", "before": "heavy-water", "after": null, "start_char_pos": 52, "end_char_pos": 63}, {"type": "D", "before": "Arak", "after": null, "start_char_pos": 84, "end_char_pos": 88}, {"type": "D", "before": "nuclear program of Iran", "after": null, "start_char_pos": 178, "end_char_pos": 201}, {"type": "D", "before": "Teheran", "after": null, "start_char_pos": 419, "end_char_pos": 426}, {"type": "D", "before": "reactor", "after": null, "start_char_pos": 483, "end_char_pos": 490}, {"type": "D", "before": "enrichment", "after": null, "start_char_pos": 830, "end_char_pos": 840}, {"type": "D", "before": "uranium", "after": null, "start_char_pos": 862, "end_char_pos": 869}, {"type": "R", "before": "uranium-235 using gas centrifuge", "after": "using", "start_char_pos": 916, "end_char_pos": 948}, {"type": "D", "before": "deuterium", "after": null, "start_char_pos": 1259, "end_char_pos": 1268}, {"type": "D", "before": "plutonium", "after": null, "start_char_pos": 1561, "end_char_pos": 1570}, {"type": "D", "before": "CANDU reactor", "after": null, "start_char_pos": 1851, "end_char_pos": 1864}, {"type": "D", "before": "Bushehr", "after": null, "start_char_pos": 2235, "end_char_pos": 2242}, {"type": "D", "before": "dual-use technology", "after": null, "start_char_pos": 2374, "end_char_pos": 2393}, {"type": "D", "before": "Nuclear Non-Proliferation Treaty", "after": null, "start_char_pos": 2646, "end_char_pos": 2678}, {"type": "D", "before": "radioisotopes", "after": null, "start_char_pos": 3111, "end_char_pos": 3124}], "sents_char_pos": [0, 152, 372, 503, 673, 725, 960, 1117, 1179, 1299, 1393, 1645, 1766, 2036, 2191, 2272, 2448, 2710, 2872, 3057, 3164, 3308]} {"doc_id": "48397", "revision_depth": "1", "before_revision": "Richie McCaw knocked on the kick off from Butch James, offside All Blacks then lead to an early penalty kick to Percy Montgomery, giving South Africa a three-nil lead. James kicks another penalty two minutes later giving them a six to nil lead. Daniel Carter then gives the All Blacks their first points with a penalty kick of his own. Fourie du Preez scored the first try of the match in the 10th minute for South Africa. Montgomery misses the conversion and the South Africa now lead 11 to three. After a period of no scoring, Carter kicks another penalty goal in the 18th minute to reduce the gap to 11 to six. Neemia Tialata scores the All Blacks first try off a Carter kick. Carter converts , and the All Blacks move ahead to 13 to 11. On halftime the All Blacks are given a penalty, 60m away from the South African line. An ambitious Carter goes for the kick, and is successful, and the All Blacks go into the break 16 to 11. Carter gets the first points of the second half with another penalty goal inthe 43rd minute. Luke McAlister extends the All Blacks lead a few minutes later with a try of his own, and with Carters conversion, the All Blacks now lead 26 to 11. A subsequent penalty goal to South Africa by Montgomery reduces this to 26 to 14. The All Blacks start to move further away with the game when Sitiveni Sivivatu scores in the 55th minute, although Carter misses the conversion, the All Blacks move to a 31 to 14 lead. A try to Mils Muliaina and a subsequent Carter conversion makes the score 38 to 14. South Africa start to make a comeback when Jaque Fourie scores a try. Andr\u00e9 Pretorius misses the conversion, and the score is now 38 to 19 to the All Blacks. Fourie scores again in the 70th minute, and with the Pretorius conversion, the score is now 38 to 26 with 10 minutes remaining in the match. However Rico Gear seals the victory in the 75th minute with a try. carter converts and the All Blacks win 45 to 26.", "after_revision": "Richie McCaw knocked on the kick off from Butch James, offside All Blacks then lead to an early penalty kick to Percy Montgomery, giving South Africa a three-nil lead. James kicked another penalty two minutes later giving them a six to nil lead. Daniel Carter then gave the All Blacks their first points with a penalty kick of his own. Fourie du Preez scored the first try of the match in the 10th minute for South Africa. Montgomery missed the conversion and South Africa lead 11 to three. After a period of no scoring, Carter kicked another penalty goal in the 18th minute to reduce the gap to 11 to six. Neemia Tialata scored the All Blacks first try off a Carter kick. Carter converted , and the All Blacks moved ahead to 13 to 11. On halftime the All Blacks are given a penalty, 60m away from the South African line. An ambitious Carter went for the kick, and was successful, and the All Blacks went into the break 16 to 11. Carter got the first points of the second half with another penalty goal in the 43rd minute. Luke McAlister extended the All Blacks lead a few minutes later with a try of his own, and with Carter's conversion, the All Blacks lead 26 to 11. A subsequent penalty goal to South Africa by Montgomery reduced this to 26 to 14. The All Blacks start to move further away with the game when Sitiveni Sivivatu scored in the 55th minute, although Carter missed the conversion, the All Blacks moved to a 31 to 14 lead. A try to Mils Muliaina and a subsequent Carter conversion made the score 38 to 14. South Africa started to make a comeback when Jaque Fourie scored a try. Andr\u00e9 Pretorius missed the conversion, and the score was at 38 to 19 to the All Blacks. Fourie scored again in the 70th minute, and with the Pretorius conversion, the score read 38 to 26 with 10 minutes remaining in the match. However Rico Gear sealed the victory in the 75th minute with a try. Carter converted and the All Blacks won 45 to 26.", "edit_actions": [{"type": "R", "before": "kicks", "after": "kicked", "start_char_pos": 174, "end_char_pos": 179}, {"type": "R", "before": "gives", "after": "gave", "start_char_pos": 264, "end_char_pos": 269}, {"type": "R", "before": "misses", "after": "missed", "start_char_pos": 434, "end_char_pos": 440}, {"type": "R", "before": "the South Africa now", "after": "South Africa", "start_char_pos": 460, "end_char_pos": 480}, {"type": "R", "before": "kicks", "after": "kicked", "start_char_pos": 536, "end_char_pos": 541}, {"type": "R", "before": "scores", "after": "scored", "start_char_pos": 629, "end_char_pos": 635}, {"type": "R", "before": "converts", "after": "converted", "start_char_pos": 687, "end_char_pos": 695}, {"type": "R", "before": "move", "after": "moved", "start_char_pos": 717, "end_char_pos": 721}, {"type": "R", "before": "goes", "after": "went", "start_char_pos": 847, "end_char_pos": 851}, {"type": "R", "before": "is", "after": "was", "start_char_pos": 870, "end_char_pos": 872}, {"type": "R", "before": "go", "after": "went", "start_char_pos": 904, "end_char_pos": 906}, {"type": "R", "before": "gets", "after": "got", "start_char_pos": 939, "end_char_pos": 943}, {"type": "R", "before": "inthe", "after": "in the", "start_char_pos": 1006, "end_char_pos": 1011}, {"type": "R", "before": "extends", "after": "extended", "start_char_pos": 1040, "end_char_pos": 1047}, {"type": "R", "before": "Carters", "after": "Carter's", "start_char_pos": 1120, "end_char_pos": 1127}, {"type": "D", "before": "now", "after": null, "start_char_pos": 1155, "end_char_pos": 1158}, {"type": "R", "before": "reduces", "after": "reduced", "start_char_pos": 1230, "end_char_pos": 1237}, {"type": "R", "before": "scores", "after": "scored", "start_char_pos": 1335, "end_char_pos": 1341}, {"type": "R", "before": "misses", "after": "missed", "start_char_pos": 1378, "end_char_pos": 1384}, {"type": "R", "before": "move", "after": "moved", "start_char_pos": 1416, "end_char_pos": 1420}, {"type": "R", "before": "makes", "after": "made", "start_char_pos": 1499, "end_char_pos": 1504}, {"type": "R", "before": "start", "after": "started", "start_char_pos": 1538, "end_char_pos": 1543}, {"type": "R", "before": "scores", "after": "scored", "start_char_pos": 1581, "end_char_pos": 1587}, {"type": "R", "before": "misses", "after": "missed", "start_char_pos": 1611, "end_char_pos": 1617}, {"type": "R", "before": "is now", "after": "was at", "start_char_pos": 1648, "end_char_pos": 1654}, {"type": "R", "before": "scores", "after": "scored", "start_char_pos": 1690, "end_char_pos": 1696}, {"type": "R", "before": "is now", "after": "read", "start_char_pos": 1768, "end_char_pos": 1774}, {"type": "R", "before": "seals", "after": "sealed", "start_char_pos": 1842, "end_char_pos": 1847}, {"type": "R", "before": "carter converts", "after": "Carter converted", "start_char_pos": 1891, "end_char_pos": 1906}, {"type": "R", "before": "win", "after": "won", "start_char_pos": 1926, "end_char_pos": 1929}], "sents_char_pos": [0, 167, 244, 335, 422, 498, 613, 679, 740, 826, 931, 1024, 1173, 1255, 1440, 1524, 1594, 1682, 1823]} {"doc_id": "49966", "revision_depth": "1", "before_revision": "Hewlett-Packard is in a scandal over the alegged illegal investigation of its own board members over leaks from the board to the press. The companys admits that it hired private investigators and that they used pretexting to get private phone records of it's own directors. Pretexting is where someone pretends to be the customer when calling the phone company to get their phone records. It is illegal in the State of California. The aim of the HP investigation was to find out which director(s) had leaked information to journalists. VC investor Tom Perkins resigned from the board on May 22nd 2006 over the issue and requested that HP look into the methods used in it's leak inquiry. The FCC is looking into phone companies who may have supplied the phone records illegally under California law. So", "after_revision": "Hewlett-Packard (HP) is embroiled in a scandal over the alleged illegal investigation of its own board members over leaks from the board to the press. The companys admits that it hired private investigators and that they used pretexting to get private phone records of its own directors. 'Pretexting' is where someone pretends to be the customer when calling the phone company to get their phone records. It is illegal in the state of California. The aim of the HP investigation was to find out which director(s) had leaked information to journalists. Venture Capitalist investor Tom Perkins resigned from the board on May 22, 2006 over the issue and requested that HP look into the methods used in its leak inquiry. The Federal Communications Commission is looking into phone companies who may have supplied the phone records illegally under California law. ", "edit_actions": [{"type": "R", "before": "is", "after": "(HP) is embroiled", "start_char_pos": 16, "end_char_pos": 18}, {"type": "R", "before": "alegged", "after": "alleged", "start_char_pos": 41, "end_char_pos": 48}, {"type": "R", "before": "it's", "after": "its", "start_char_pos": 254, "end_char_pos": 258}, {"type": "R", "before": "Pretexting", "after": "'Pretexting'", "start_char_pos": 274, "end_char_pos": 284}, {"type": "R", "before": "State", "after": "state", "start_char_pos": 410, "end_char_pos": 415}, {"type": "R", "before": "VC", "after": "Venture Capitalist", "start_char_pos": 536, "end_char_pos": 538}, {"type": "R", "before": "22nd", "after": "22,", "start_char_pos": 591, "end_char_pos": 595}, {"type": "R", "before": "it's", "after": "its", "start_char_pos": 668, "end_char_pos": 672}, {"type": "R", "before": "FCC", "after": "Federal Communications Commission", "start_char_pos": 691, "end_char_pos": 694}, {"type": "D", "before": "So", "after": null, "start_char_pos": 799, "end_char_pos": 801}], "sents_char_pos": [0, 135, 273, 388, 430, 535, 686]} {"doc_id": "5194", "revision_depth": "1", "before_revision": "thumb The 77th Annual Academy Awards were held on February 27th, 2005 and broadcast live across the world. Some of the more poignant moments included a tribute to Johnny Carson , frequent host of the Awards, as well as a video tribute to many people involved in the movie industry who died in the past year, including Rodney Dangerfield, Ossie Davis, Christopher Reeve, Marlon Brando, and Ronald Reagan , set to the music of Yo Yo Ma . Winners/Nominees Best Picture Million Dollar Baby Other nominees The Aviator Finding Neverland Ray Sideways Achievement in Directing Clint Eastwood , Million Dollar Baby Other nominees Martin Scorsese, The Aviator Taylor Hackford, Ray Alexander Payne, Sideways Mike Leigh, Vera Drake Best Actor in a Leading Role Jamie Foxx , Ray Other nominees Don Cheadle, Hotel Rwanda Johnny Depp, Finding Neverland Leonardo DiCaprio, The Aviator Clint Eastwood, Million Dollar Baby Best Supporting Actor Morgan Freeman , Million Dollar Baby Other nominees Alan Alda, The Aviator Thomas Haden Church, Sideways Jamie Foxx, Collateral Clive Owen, Closer Best Actress in a Leading Role Hilary Swank , Million Dollar Baby Other nominees Annette Bening, Being Julia Catalina Sandino Moreno, Maria Full of Grace Imelda Staunton, Vera Drake Kate Winslet, Eternal Sunshine of the Spotless Mind Best Supporting Actress Cate Blanchett , The Aviator Other nominees Laura Linney, Kinsey Virginia Madsen, Sideways Sophie Okenodo, Hotel Rwanda Natalie Portman, Closer Best Original Screenplay Eternal Sunshine of the Spotless Mind Other nominees The Aviator Hotel Rwanda The Incredibles Vera Drake Best Adapted Screenplay Sideways Other nominees Before Sunset Finding Neverland Million Dollar Baby The Motorcycle Diaries Best Foreign-Language Film The Sea Inside Other nominees As It Is In Heaven The Chorus Downfall Yesterday Best Animated Feature Film The Incredibles Other nominees Shark Tale Shrek 2 Achievement in Art Direction The Aviator Other nominees Finding Neverland Lemony Snicket's A Series of Unfortunate Events Andrew Lloyd Webber's The Phantom of the Opera A Very Long Engagement Achievement in Cinematography The Aviator Other nominees House of Flying Daggers The Passion of the Christ Andrew Lloyd Webber's The Phantom of the Opera A Very Long Engagement Achievement in Costume Design The Aviator Other nominees Finding Neverland Lemony Snicket's A Series of Unfortunate Events Ray Troy Best Documentary Feature Born into Brothels Other nominees The Story of the Weeping Camel Super Size Me Tupac: Resurrection Twist of Faith Best Film Editing The Aviator Other nominees Collateral Finding Neverland Million Dollar Baby Ray Achievement in Makeup A Series of Unfortunate Events Other nominees The Passion of the Christ The Sea Inside Best Original Score Finding Neverland Other nominees Harry Potter and the Prisoner of Azkaban Lemony Snicket's A Series of Unfortunate Events The Passion of the Christ The Village Original Song Al Otro Lado Del Rio, from The Motorcycle Diaries Other nominees \u201cAccidentally in Love\u201d, Shrek 2 \u201cBelieve\u201d, The Polar Express \u201cLearn to Be Lonely\u201d, Andrew Lloyd Webber's The Phantom of the Opera \u201cLook to Your Path (Vois sur ton chemin)\u201d, The Chorus Achievement in Sound Mixing Ray Other nominees The Aviator The Incredibles The Polar Express Spider-Man 2 Achievement in Sound Editing The Incredibles Other nominees The Polar Express Spider-Man 2 Best Visual Effects Spider-Man 2 Other nominees Harry Potter and the Prisoner of Azkaban I, Robot Best Documentary Short Mighty Times: The Children's March Other nominees Autism is the World The Children of Leningradsky Hardwood Sister Rose's Passion Best Animated Short Film Ryan Other nominees Birthday Boy Gopher Broke Guard Dog Lorenzo", "after_revision": "The were held on February 27th, 2005 and broadcast live across the world. Some of the more poignant moments included a tribute to , frequent host of the Awards, as well as a video tribute to many people involved in the movie industry who died in the past year, including , , , , and , set to the music of . Winners/Nominees Best Picture Other nominees Achievement in Directing , Other nominees , , , , Best Actor in a Leading Role , Other nominees , , , , Best Supporting Actor , Other nominees , , , , Best Actress in a Leading Role , Other nominees , , , , Best Supporting Actress , Other nominees , , , , Best Original Screenplay Other nominees Best Adapted Screenplay Other nominees Best Foreign-Language Film Other nominees As It Is In Heaven Downfall Best Animated Feature Film Other nominees Achievement in Art Direction Other nominees Achievement in Cinematography Other nominees Achievement in Costume Design Other nominees Best Documentary Feature Other nominees Tupac: Resurrection Twist of Faith Best Film Editing Other nominees Achievement in Makeup Other nominees Best Original Score Other nominees Original Song Al Otro Lado Del Rio, from Other nominees \u201cAccidentally in Love\u201d, \u201cBelieve\u201d, \u201cLearn to Be Lonely\u201d, \u201cLook to Your Path (Vois sur ton chemin)\u201d, Achievement in Sound Mixing Other nominees Achievement in Sound Editing Other nominees Best Visual Effects Other nominees Best Documentary Short Mighty Times: The Children's March Other nominees The Children of Leningradsky Hardwood Sister Rose's Passion Best Animated Short Film Other nominees Birthday Boy Gopher Broke Guard Dog Lorenzo", "edit_actions": [{"type": "R", "before": "thumb The 77th Annual Academy Awards", "after": "The", "start_char_pos": 0, "end_char_pos": 36}, {"type": "D", "before": "Johnny Carson", "after": null, "start_char_pos": 163, "end_char_pos": 176}, {"type": "D", "before": "Rodney Dangerfield, Ossie Davis, Christopher Reeve, Marlon Brando, and Ronald Reagan", "after": null, "start_char_pos": 318, "end_char_pos": 402}, {"type": "A", "before": null, "after": ", , , and ,", "start_char_pos": 405, "end_char_pos": 405}, {"type": "D", "before": "Yo Yo Ma", "after": null, "start_char_pos": 426, "end_char_pos": 434}, {"type": "R", "before": "Million Dollar Baby Other nominees The Aviator Finding Neverland Ray Sideways", "after": "Other nominees", "start_char_pos": 467, "end_char_pos": 544}, {"type": "D", "before": "Clint Eastwood", "after": null, "start_char_pos": 570, "end_char_pos": 584}, {"type": "R", "before": "Million Dollar Baby Other nominees Martin Scorsese, The Aviator Taylor Hackford, Ray Alexander Payne, Sideways Mike Leigh, Vera Drake", "after": "Other nominees , , , ,", "start_char_pos": 613, "end_char_pos": 746}, {"type": "D", "before": "Jamie Foxx", "after": null, "start_char_pos": 776, "end_char_pos": 786}, {"type": "R", "before": "Ray Other nominees Don Cheadle, Hotel Rwanda Johnny Depp, Finding Neverland Leonardo DiCaprio, The Aviator Clint Eastwood, Million Dollar Baby", "after": "Other nominees , , , ,", "start_char_pos": 815, "end_char_pos": 957}, {"type": "D", "before": "Morgan Freeman", "after": null, "start_char_pos": 980, "end_char_pos": 994}, {"type": "R", "before": "Million Dollar Baby Other nominees Alan Alda, The Aviator Thomas Haden Church, Sideways Jamie Foxx, Collateral Clive Owen, Closer", "after": "Other nominees , , , ,", "start_char_pos": 1023, "end_char_pos": 1152}, {"type": "D", "before": "Hilary Swank", "after": null, "start_char_pos": 1184, "end_char_pos": 1196}, {"type": "R", "before": "Million Dollar Baby Other nominees Annette Bening, Being Julia Catalina Sandino Moreno, Maria Full of Grace Imelda Staunton, Vera Drake Kate Winslet, Eternal Sunshine of the Spotless Mind", "after": "Other nominees , , , ,", "start_char_pos": 1225, "end_char_pos": 1412}, {"type": "D", "before": "Cate Blanchett", "after": null, "start_char_pos": 1437, "end_char_pos": 1451}, {"type": "R", "before": "The Aviator Other nominees Laura Linney, Kinsey Virginia Madsen, Sideways Sophie Okenodo, Hotel Rwanda Natalie Portman, Closer", "after": "Other nominees , , , ,", "start_char_pos": 1480, "end_char_pos": 1606}, {"type": "R", "before": "Eternal Sunshine of the Spotless Mind Other nominees The Aviator Hotel Rwanda The Incredibles Vera Drake", "after": "Other nominees", "start_char_pos": 1632, "end_char_pos": 1736}, {"type": "R", "before": "Sideways Other nominees Before Sunset Finding Neverland Million Dollar Baby The Motorcycle Diaries", "after": "Other nominees", "start_char_pos": 1761, "end_char_pos": 1859}, {"type": "D", "before": "The Sea Inside", "after": null, "start_char_pos": 1887, "end_char_pos": 1901}, {"type": "R", "before": "The Chorus Downfall Yesterday", "after": "Downfall", "start_char_pos": 1936, "end_char_pos": 1965}, {"type": "R", "before": "The Incredibles Other nominees Shark Tale Shrek 2", "after": "Other nominees", "start_char_pos": 1993, "end_char_pos": 2042}, {"type": "R", "before": "The Aviator Other nominees Finding Neverland Lemony Snicket's A Series of Unfortunate Events Andrew Lloyd Webber's The Phantom of the Opera A Very Long Engagement", "after": "Other nominees", "start_char_pos": 2072, "end_char_pos": 2234}, {"type": "R", "before": "The Aviator Other nominees House of Flying Daggers The Passion of the Christ Andrew Lloyd Webber's The Phantom of the Opera A Very Long Engagement", "after": "Other nominees", "start_char_pos": 2265, "end_char_pos": 2411}, {"type": "R", "before": "The Aviator Other nominees Finding Neverland Lemony Snicket's A Series of Unfortunate Events Ray Troy", "after": "Other nominees", "start_char_pos": 2442, "end_char_pos": 2543}, {"type": "D", "before": "Born into Brothels Other nominees The Story of the Weeping Camel Super Size Me", "after": null, "start_char_pos": 2569, "end_char_pos": 2647}, {"type": "A", "before": null, "after": "Other nominees", "start_char_pos": 2648, "end_char_pos": 2648}, {"type": "D", "before": "The Aviator Other nominees Collateral Finding Neverland Million Dollar Baby Ray", "after": null, "start_char_pos": 2702, "end_char_pos": 2781}, {"type": "A", "before": null, "after": "Other nominees", "start_char_pos": 2782, "end_char_pos": 2782}, {"type": "D", "before": "A Series of Unfortunate Events Other nominees The Passion of the Christ The Sea Inside", "after": null, "start_char_pos": 2805, "end_char_pos": 2891}, {"type": "A", "before": null, "after": "Other nominees", "start_char_pos": 2892, "end_char_pos": 2892}, {"type": "D", "before": "Finding Neverland Other nominees Harry Potter and the Prisoner of Azkaban Lemony Snicket's A Series of Unfortunate Events The Passion of the Christ The Village", "after": null, "start_char_pos": 2913, "end_char_pos": 3072}, {"type": "A", "before": null, "after": "Other nominees", "start_char_pos": 3073, "end_char_pos": 3073}, {"type": "D", "before": "The Motorcycle Diaries", "after": null, "start_char_pos": 3115, "end_char_pos": 3137}, {"type": "D", "before": "Shrek 2", "after": null, "start_char_pos": 3177, "end_char_pos": 3184}, {"type": "D", "before": "The Polar Express", "after": null, "start_char_pos": 3196, "end_char_pos": 3213}, {"type": "D", "before": "Andrew Lloyd Webber's The Phantom of the Opera", "after": null, "start_char_pos": 3236, "end_char_pos": 3282}, {"type": "D", "before": "The Chorus", "after": null, "start_char_pos": 3326, "end_char_pos": 3336}, {"type": "D", "before": "Ray Other nominees The Aviator The Incredibles The Polar Express Spider-Man 2", "after": null, "start_char_pos": 3365, "end_char_pos": 3442}, {"type": "A", "before": null, "after": "Other nominees", "start_char_pos": 3443, "end_char_pos": 3443}, {"type": "D", "before": "The Incredibles Other nominees The Polar Express Spider-Man 2", "after": null, "start_char_pos": 3473, "end_char_pos": 3534}, {"type": "A", "before": null, "after": "Other nominees", "start_char_pos": 3535, "end_char_pos": 3535}, {"type": "D", "before": "Spider-Man 2 Other nominees Harry Potter and the Prisoner of Azkaban I, Robot", "after": null, "start_char_pos": 3556, "end_char_pos": 3633}, {"type": "A", "before": null, "after": "Other nominees", "start_char_pos": 3634, "end_char_pos": 3634}, {"type": "D", "before": "Autism is the World", "after": null, "start_char_pos": 3708, "end_char_pos": 3727}, {"type": "D", "before": "Ryan", "after": null, "start_char_pos": 3813, "end_char_pos": 3817}], "sents_char_pos": [0, 106, 178, 207, 307, 337, 350, 369, 384, 404, 593, 664, 693, 714, 735, 795, 846, 872, 909, 937, 1003, 1068, 1101, 1122, 1145, 1205, 1275, 1312, 1349, 1374, 1460, 1520, 1544, 1569, 1599, 1612, 1632, 1649, 1665, 1676, 1689, 1703, 1714, 1726, 1737, 1750, 1761, 1776, 1792, 1807, 1825, 1837, 1852, 1865, 1882, 1895, 1908, 1920, 1936, 1947, 1966, 1980, 1993, 2009, 2024, 2035, 2055, 2072, 2084, 2099, 2117, 2134, 2146, 2158, 2172, 2655, 3109, 3176, 3195, 3671]} {"doc_id": "52282", "revision_depth": "1", "before_revision": "Internet users on the Chinese-forums.com website report that the longtime block of Wikipedia by China has been at least temporarily lifted. Absent an announcement from the Chinese government, it's unclear what the conditions were that caused the site to be accessible from within China. A blog by Wikipedia contributor Andrew Lih says that someone in \" Beijing emailed me saying he could suddenly start using Wikipedia again. Some folks in Hubei said it was still blocked. Shanghai and Guangdong users said parts were accessible.\" He continued that \"from a Beijing China Netcom's residential DSL connection, the English language and other foreign language versions are now accessible, but the Chinese version is still blocked\", noting that the Chinese-language version is the most important one to most Wikipedians in the country. Wikimedia head Jimmy Wales told Moneycontrol.com yesterday that, \"We don't know what they took offense to. We really don't intend to compromise the way Google did. We also feel that the block is an error. I am trying to set up high-level meetings in China to state our case and explain why we should be unblocked. We have no idea what the result of that would be. But we are somewhat hopeful. Wikipedia is not a haven for dissidents but an encyclopedia. About 99.9 percent of Wikipedia has topics that are not of interest to the Chinese Government. There is no political component. We are hopeful that they can see the point.\" The third block of Wikipedia, which was implemented 19 October 2005, was issued without explanation or an expected length. Wikipedia has been blocked twice before, the first from 2-21 June 2004, due to the 15th anniversary of the Tian'anmen Square Incident . A website called baidu.com runs a self-censored wiki-based encyclopedia website, called baidubaike.com, launched in April of this year. Wikipedia is a project of the Wikimedia Foundation, a non-profit organisation based out of St. Petersberg, Florida . Its 2007 annual convention, Wikimania , is set to take place in Taipei .", "after_revision": " users on the Chinese-forums.com website report that the longtime block of by China has been at least temporarily lifted. Absent an announcement from the Chinese government, it's unclear what the conditions were that caused the site to be accessible from within China. A blog by Wikipedia contributor Andrew Lih says that someone in \" emailed me saying he could suddenly start using Wikipedia again. Some folks in said it was still blocked. and users said parts were accessible.\" He continued that \"from a Beijing China Netcom's residential connection, the English language and other foreign language versions are now accessible, but the Chinese version is still blocked\", noting that the Chinese-language version is the most important one to most Wikipedians in the country. Wikimedia head told yesterday that, \"We don't know what they took offense to. We really don't intend to compromise the way Google did. We also feel that the block is an error. I am trying to set up high-level meetings in China to state our case and explain why we should be unblocked. We have no idea what the result of that would be. But we are somewhat hopeful. Wikipedia is not a haven for dissidents but an encyclopedia. About 99.9 percent of Wikipedia has topics that are not of interest to the Chinese Government. There is no political component. We are hopeful that they can see the point.\" The third block of Wikipedia, which was implemented 19 October 2005, was issued without explanation or an expected length. Wikipedia has been blocked twice before, the first from 2-21 June 2004, due to the 15th anniversary of the . A website called runs a self-censored wiki-based encyclopedia website, called baidubaike.com, launched in April of this year. Wikipedia is a project of the Wikimedia Foundation, a organisation based out of , . Its 2007 annual convention, , is set to take place in .", "edit_actions": [{"type": "D", "before": "Internet", "after": null, "start_char_pos": 0, "end_char_pos": 8}, {"type": "D", "before": "Wikipedia", "after": null, "start_char_pos": 83, "end_char_pos": 92}, {"type": "D", "before": "Beijing", "after": null, "start_char_pos": 353, "end_char_pos": 360}, {"type": "D", "before": "Hubei", "after": null, "start_char_pos": 440, "end_char_pos": 445}, {"type": "R", "before": "Shanghai and Guangdong", "after": "and", "start_char_pos": 473, "end_char_pos": 495}, {"type": "D", "before": "DSL", "after": null, "start_char_pos": 592, "end_char_pos": 595}, {"type": "R", "before": "Jimmy Wales told Moneycontrol.com", "after": "told", "start_char_pos": 846, "end_char_pos": 879}, {"type": "D", "before": "Tian'anmen Square Incident", "after": null, "start_char_pos": 1688, "end_char_pos": 1714}, {"type": "D", "before": "baidu.com", "after": null, "start_char_pos": 1734, "end_char_pos": 1743}, {"type": "D", "before": "non-profit", "after": null, "start_char_pos": 1907, "end_char_pos": 1917}, {"type": "R", "before": "St. Petersberg, Florida", "after": ",", "start_char_pos": 1944, "end_char_pos": 1967}, {"type": "D", "before": "Wikimania", "after": null, "start_char_pos": 1998, "end_char_pos": 2007}, {"type": "D", "before": "Taipei", "after": null, "start_char_pos": 2034, "end_char_pos": 2040}], "sents_char_pos": [0, 139, 286, 425, 472, 530, 830, 937, 994, 1035, 1144, 1194, 1223, 1284, 1379, 1412, 1457, 1580, 1716, 1852, 1947, 1969]} {"doc_id": "53180", "revision_depth": "1", "before_revision": "FIVE GOVERNMENTS DIVIDED OVER PRIVATE TAKEOVER . A 'monopalisation' of Weston Government by a private 'organisation' has caused a split within five governments.Tension has grown over the past year, especialy at the 'House of Commons', due to Documentation and Corraspondence sent to five governments ( British, German, Swiss, Dane & Australien ) regarding a private 'consortiums' takeover of Weston Government. The Private Concern in qestian is reported to have made a 'pirated saturation' of Upper goernment over a planned and Legnthey Period. The Governments informed of this are Up in Arms and have seperated into two Camps ! The Commons has aparently been informed for most of this year , since the 'documents' started to be annonamously sent to the ' House', and are treating it as insider infomation and beetween the walls until an answer to the full extent of the situation is properly understood. I am in contact with a member of parliament & he has said he sees no harm in the public leaning of the situation as it concerns them very much as both sides live together , although many of his ' colleges 'feel the same , he does not wish to offically leak it and would prefer to remain annomanous because of the gravity of the situation, but also gestured towards his personal safty being a consideration. My relationship with this MP is such that he feels free to discuss the contents of the documents and also the wider scene which he has said is similer within five other governments, as i have stated. He feels the situation will continue to develop along 'Reconstructive Lines' and that there will be an element of confliction over the 'balance of Power' which will probaly lead to an 'administrative confrontation', whatever is meant by that (sounds like a gentalmans term for polictical fight), although he stresses the situation is at its 'Birth' I have a lot of details on the various documents content and am in good contact with the MP, although the sourse of the documents has never reavealed his identity. So my intention is to further the Exposure from the publics right to know something benificia", "after_revision": "FIVE GOVERNMENTS DIVIDED OVER PRIVATE MONOPOLY . A 'monopalisation' of Weston Government by a private 'organisation' has caused a split within five governments.Tension has grown over the past year, especialy at the 'House of Commons', due to Documentation and Corraspondence sent to five governments ( British, German, Swiss, Dane & Australien ) regarding a private 'consortiums' takeover of Weston Government. The Private Concern in questian is reported to have made a 'pirated saturation' of Upper goernment over a planned and Legnthey Period. The Governments informed of this are Up in Arms and have seperated into two Camps ! The Commons has aparently been informed for most of this year , since the 'documents' started to be annonamously sent to the ' House', and are treating it as insider infomation and are waiting untill an answer for the full extent of the situation is properly understood. I am in contact with a member of parliament & he has said he sees no harm in the public leaning of the situation as it concerns them very much as both sides live together . Although many of his ' colleges 'feel the same , he does not wish to officially leak it and would prefer to remain annomanous because of the gravity of the situation, but also gestured towards his personal safty being a consideration. My relationship with this MP is such that he feels free to discuss the contents of the documents and also the wider scene which he has said is similar within five other governments, as I have stated. He feels the situation will continue to develope along 'Reconstructive Lines' and that there will be an element of confliction over the 'balance of Power' which will probaly lead to an 'administrative confrontation', whatever is meant by that (sounds like a polictical fight), although he stresses the situation is at its 'Birth' I have a lot of details on the various documents content and am in good contact with the MP, though the sourse of the documents has never reavealed his identity. So my intention is to further the Exposure for the publics right to know something benificial", "edit_actions": [{"type": "R", "before": "TAKEOVER", "after": "MONOPOLY", "start_char_pos": 38, "end_char_pos": 46}, {"type": "R", "before": "qestian", "after": "questian", "start_char_pos": 434, "end_char_pos": 441}, {"type": "R", "before": "beetween the walls until an answer to", "after": "are waiting untill an answer for", "start_char_pos": 810, "end_char_pos": 847}, {"type": "R", "before": ", although", "after": ". Although", "start_char_pos": 1076, "end_char_pos": 1086}, {"type": "R", "before": "offically", "after": "officially", "start_char_pos": 1147, "end_char_pos": 1156}, {"type": "R", "before": "similer", "after": "similar", "start_char_pos": 1455, "end_char_pos": 1462}, {"type": "R", "before": "i", "after": "I", "start_char_pos": 1497, "end_char_pos": 1498}, {"type": "R", "before": "develop", "after": "develope", "start_char_pos": 1552, "end_char_pos": 1559}, {"type": "D", "before": "gentalmans term for", "after": null, "start_char_pos": 1769, "end_char_pos": 1788}, {"type": "R", "before": "although", "after": "though", "start_char_pos": 1954, "end_char_pos": 1962}, {"type": "R", "before": "from", "after": "for", "start_char_pos": 2068, "end_char_pos": 2072}, {"type": "R", "before": "benificia", "after": "benificial", "start_char_pos": 2109, "end_char_pos": 2118}], "sents_char_pos": [0, 160, 410, 544, 628, 904, 1311, 1511, 1588, 2024]} {"doc_id": "53369", "revision_depth": "1", "before_revision": "Top police sources said the message was sent to Director General of Police Raman Srivastava and the Home Secretary Sri Prakash Jaiswal. Taking serious note of the e-mail, Kerala police is interrogating the accused persons whether they had played a prank. After this happening , the authorities are on the high alert. This threat can have serious connotations considering the arrest of 2 Al-badr militants from down south.", "after_revision": "Top police sources said the message was sent to Director General of Police Raman Srivastava and the Home Secretary Sri Prakash Jaiswal. Taking serious note of the e-mail, Kerala police are interrogating the accused persons suspecting they had played a prank. After this incident , the authorities are on high alert. This threat can have serious connotations considering the arrest of 2 Al-badr militants from down south.", "edit_actions": [{"type": "R", "before": "is", "after": "are", "start_char_pos": 185, "end_char_pos": 187}, {"type": "R", "before": "whether", "after": "suspecting", "start_char_pos": 222, "end_char_pos": 229}, {"type": "R", "before": "happening", "after": "incident", "start_char_pos": 266, "end_char_pos": 275}, {"type": "D", "before": "the", "after": null, "start_char_pos": 301, "end_char_pos": 304}], "sents_char_pos": [0, 135, 254, 316]} {"doc_id": "53552", "revision_depth": "1", "before_revision": "Cimaron making landfall Typhoon Cimaron, known to those in the Philippines as Typhoon Paeng, made landfall on October 29 in Luzon at around 1:00 UTC. Winds of 160 mph were sustained for one minite , were recorded shortly before landfall. Already, it has killed at least nineteen people, injured 58, and at least fifteen people may still be missing in the Philippines. Damage in the country is estimated to have reached $443 million pesos, or $8.8 million United States dollars (USD). Impact Cimaron at peak intensity Deaths and other affects on people So far, six people have been reported to have been drowned or killed by falling trees in Dinapigue, Isabela province . A further 15 people were injured there. In addition, a 28 year old woman was killed along with her 6 year old child in Aurora province . Their hut was swept away by the powerful currents. Three more people drowned in the town of Kasibu, Neuva Vizcaya province . A four year old girl was killed by a landslide in Bugias, Benguet province , as was a man of 53 years of age in Kalinga province . In Baguio City , a house with a mother and her two daughters was buried in landslide, injuring all of them, according to fire official Senior Superintendent Carlito Romero. A woman died in a road accident that also injured seven other people in La Union province . Original total damage estimates were placed at $400 million pesos, or $8 million United States Dollars, but were revised to $139 million pesos, or $2.79 million USD in total damage. Of that total, $114.39 million pesos, or $2.3 million USD, was from infrastructure and agricultural damage, mostly from the Cagayan Valley . The remaining money was $22.8 million pesos, or $458,600+ USD in damage to roads and bridges and damage to school buildings was worth $2 million pesos, equivalent to $40,230 USD. The Philippine National Red Cross noted that many of the agency's different branches were assisting the storm victims since Monday morning. Current storm information At 2100 UTC October 31, the Japan Meteorological Association (JMA) reported the center of Typhoon Cimaron to be near 18.7\u00b0N 116.4\u00b0E . It had maximum 10-minute sustained winds of 80 knots (150 km/h , 90 mph ), with a minimum central pressure of 950 hPa , and was moving almost stationary. At 1800 UTC, the Joint Typhoon Warning Center (JTWC) reported the center of Typhoon 22W to be located about 270 nm (500 km , 310 miles ) south-southeast of Hong Kong , with maximum 1-minute sustained winds of 100 knots (175 km/h, 110 mph), gusting to 125 knots (230 km/h, 145 mph).", "after_revision": "Cimaron making landfall Typhoon Cimaron, known to those in the Philippines as Typhoon Paeng, made landfall on October 29 in at around 1:00 UTC. Winds of 160 mph were sustained for one minute , were recorded shortly before landfall. Already, it has killed at least nineteen people, injured 58, and at least fifteen people may still be missing in the Philippines. Damage in the country is estimated to have reached $443 million pesos, or $8.8 million (USD). Impact Cimaron at peak intensity Deaths and other affects on people So far, six people have been reported to have been drowned or killed by falling trees in , . A further 15 people were injured there. In addition, a 28 year old woman was killed along with her 6 year old child in . Their hut was swept away by the powerful currents. Three more people drowned in the town of , . A four year old girl was killed by a landslide in Bugias, , as was a man of 53 years of age in . In , a house with a mother and her two daughters was buried in landslide, injuring all of them, according to fire official Senior Superintendent Carlito Romero. A woman died in a road accident that also injured seven other people in . Original total damage estimates were placed at $400 million pesos, or $8 million United States Dollars, but were revised to $139 million pesos, or $2.79 million USD in total damage. Of that total, $114.39 million pesos, or $2.3 million USD, was from and damage, mostly from the . The remaining money was $22.8 million pesos, or $458,600+ USD in damage to roads and bridges and damage to school buildings was worth $2 million pesos, equivalent to $40,230 USD. The noted that many of the agency's different branches were assisting the storm victims since Monday morning. Current storm information At 2100 October 31, the (JMA) reported the center of Typhoon Cimaron to be near . It had maximum 10-minute sustained winds of 80 (150 , 90 ), with a minimum central pressure of 950 , and was moving almost stationary. At 1800 UTC, the (JTWC) reported the center of Typhoon 22W to be located about 270 (500 , 310 ) south-southeast of , with maximum 1-minute sustained winds of 100 knots (175 km/h, 110 mph), gusting to 125 knots (230 km/h, 145 mph).", "edit_actions": [{"type": "D", "before": "Luzon", "after": null, "start_char_pos": 124, "end_char_pos": 129}, {"type": "R", "before": "minite", "after": "minute", "start_char_pos": 190, "end_char_pos": 196}, {"type": "D", "before": "United States dollars", "after": null, "start_char_pos": 455, "end_char_pos": 476}, {"type": "R", "before": "Dinapigue, Isabela province", "after": ",", "start_char_pos": 641, "end_char_pos": 668}, {"type": "D", "before": "Aurora province", "after": null, "start_char_pos": 790, "end_char_pos": 805}, {"type": "R", "before": "Kasibu, Neuva Vizcaya province", "after": ",", "start_char_pos": 900, "end_char_pos": 930}, {"type": "D", "before": "Benguet province", "after": null, "start_char_pos": 991, "end_char_pos": 1007}, {"type": "D", "before": "Kalinga province", "after": null, "start_char_pos": 1045, "end_char_pos": 1061}, {"type": "D", "before": "Baguio City", "after": null, "start_char_pos": 1067, "end_char_pos": 1078}, {"type": "D", "before": "La Union province", "after": null, "start_char_pos": 1309, "end_char_pos": 1326}, {"type": "R", "before": "infrastructure and agricultural", "after": "and", "start_char_pos": 1579, "end_char_pos": 1610}, {"type": "D", "before": "Cagayan Valley", "after": null, "start_char_pos": 1635, "end_char_pos": 1649}, {"type": "D", "before": "Philippine National Red Cross", "after": null, "start_char_pos": 1835, "end_char_pos": 1864}, {"type": "D", "before": "UTC", "after": null, "start_char_pos": 2005, "end_char_pos": 2008}, {"type": "D", "before": "Japan Meteorological Association", "after": null, "start_char_pos": 2025, "end_char_pos": 2057}, {"type": "D", "before": "18.7\u00b0N 116.4\u00b0E", "after": null, "start_char_pos": 2114, "end_char_pos": 2128}, {"type": "D", "before": "knots", "after": null, "start_char_pos": 2178, "end_char_pos": 2183}, {"type": "D", "before": "km/h", "after": null, "start_char_pos": 2189, "end_char_pos": 2193}, {"type": "D", "before": "mph", "after": null, "start_char_pos": 2199, "end_char_pos": 2202}, {"type": "D", "before": "hPa", "after": null, "start_char_pos": 2245, "end_char_pos": 2248}, {"type": "D", "before": "Joint Typhoon Warning Center", "after": null, "start_char_pos": 2302, "end_char_pos": 2330}, {"type": "D", "before": "nm", "after": null, "start_char_pos": 2397, "end_char_pos": 2399}, {"type": "D", "before": "km", "after": null, "start_char_pos": 2405, "end_char_pos": 2407}, {"type": "D", "before": "miles", "after": null, "start_char_pos": 2414, "end_char_pos": 2419}, {"type": "D", "before": "Hong Kong", "after": null, "start_char_pos": 2441, "end_char_pos": 2450}], "sents_char_pos": [0, 149, 237, 367, 483, 670, 710, 807, 858, 932, 1063, 1236, 1328, 1510, 1651, 1830, 1970, 2130, 2284]} {"doc_id": "53996", "revision_depth": "1", "before_revision": "Howard Bortenstein 52-year-old Howard Bortenstein is the founder/owner of Miller Bortenstein Consultants, \u201c a management consulting firm specializing in information technology strategy and change management. \u201d Q: Describe the three most important issues in your campaign. A: There is a tremendous undertone of despair and apathy when people talk about the current situation of Ward 28 and the city in general. I am deeply concerned about the downward spiral of our neighbourhoods: no vision, residents feel unsafe; businesses struggling; crumbling public housing; no \u201c at risk neighbourhoods \u2019 youth funding and an absentee councillor battling windmills elsewhere, leaving the ward in auto-pilot. I strongly believe our city government must be accountable to the neighbourhoods that elect it. Crime Prevention We need to feel safe & secure everywhere Strengthen neighbourhood-police relationships Create \u201cSafe Neighbourhoods\u201d volunteer organization Residents from all neighbourhoods and all income levels share these concerns. Tenants must have more options and flexibility to break the cycle of poverty and get back their dignity that has been taken from them. Dramatic change from the current model of building \u201c monuments to poverty \u201d is required. Tenants need choice offered by portable housing allowances, to relocate closer to new job opportunities or schools anywhere in Toronto. We must return Ward 28 to socio-economic diversity. Q: Why have you chosen to involve yourself in the political process? A: Had anyone asked me a few years ago if I had any political aspirations, I would have thought they were nuts. But a couple of years ago, when our then two year old daughter was put at risk by picking up a discarded condom in Riverdale Park, things changed. So after the trauma of hepatitis injections and HIV screening at Sick Kids and fighting city hall to clean up the park the question remained \u201c How did this happen? \u201d The simple answer is: \u201c because we let it happen \u201d . We took it for granted that our local councillor was making the right choices to keep us safe and to improve the quality of life of all neighbourhoods and all residents. Well, I found out the hard way that isn \u2019 t true and I decided this needed to be changed. Party politics are paralyzing City Council, literally crippling this city. Asa candidate, the question I receive most often is, \u201c what is your political party? \u201d I am not aligned or a member of any political party. I am not an ideologue from the left or the right. I believe in consensus, not compromise, and building bridges on issues from the centre. Bortenstein did not respond to the question \u201c Which council decision (since the 2003 election) do you feel the city/your ward should be most proud of, and which was least desirable? \u201d", "after_revision": "Howard Bortenstein 52-year-old Howard Bortenstein is the founder/owner of Miller Bortenstein Consultants, \" a management consulting firm specializing in information technology strategy and change management. \" Q: Describe the three most important issues in your campaign. A: There is a tremendous undertone of despair and apathy when people talk about the current situation of Ward 28 and the city in general. I am deeply concerned about the downward spiral of our neighbourhoods: no vision, residents feel unsafe; businesses struggling; crumbling public housing; no \" at risk neighbourhoods ' youth funding and an absentee councillor battling windmills elsewhere, leaving the ward in auto-pilot. I strongly believe our city government must be accountable to the neighbourhoods that elect it. Crime Prevention We need to feel safe & secure everywhere Strengthen neighbourhood-police relationships Create \"Safe Neighbourhoods\" volunteer organization Residents from all neighbourhoods and all income levels share these concerns. Tenants must have more options and flexibility to break the cycle of poverty and get back their dignity that has been taken from them. Dramatic change from the current model of building \" monuments to poverty \" is required. Tenants need choice offered by portable housing allowances, to relocate closer to new job opportunities or schools anywhere in Toronto. We must return Ward 28 to socio-economic diversity. Q: Why have you chosen to involve yourself in the political process? A: Had anyone asked me a few years ago if I had any political aspirations, I would have thought they were nuts. But a couple of years ago, when our then two year old daughter was put at risk by picking up a discarded condom in Riverdale Park, things changed. So after the trauma of hepatitis injections and HIV screening at Sick Kids and fighting city hall to clean up the park the question remained \" How did this happen? \" The simple answer is: \" because we let it happen \" . We took it for granted that our local councillor was making the right choices to keep us safe and to improve the quality of life of all neighbourhoods and all residents. Well, I found out the hard way that isn ' t true and I decided this needed to be changed. Party politics are paralyzing City Council, literally crippling this city. Asa candidate, the question I receive most often is, \" what is your political party? \" I am not aligned or a member of any political party. I am not an ideologue from the left or the right. I believe in consensus, not compromise, and building bridges on issues from the centre. Bortenstein did not respond to the question \" Which council decision (since the 2003 election) do you feel the city/your ward should be most proud of, and which was least desirable? \"", "edit_actions": [{"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 106, "end_char_pos": 107}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 208, "end_char_pos": 209}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 567, "end_char_pos": 568}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 592, "end_char_pos": 593}, {"type": "R", "before": "\u201cSafe Neighbourhoods\u201d", "after": "\"Safe Neighbourhoods\"", "start_char_pos": 904, "end_char_pos": 925}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1213, "end_char_pos": 1214}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1236, "end_char_pos": 1237}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1908, "end_char_pos": 1909}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1931, "end_char_pos": 1932}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 1955, "end_char_pos": 1956}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 1982, "end_char_pos": 1983}, {"type": "R", "before": "\u2019", "after": "'", "start_char_pos": 2196, "end_char_pos": 2197}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 2374, "end_char_pos": 2375}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 2406, "end_char_pos": 2407}, {"type": "R", "before": "\u201c", "after": "\"", "start_char_pos": 2643, "end_char_pos": 2644}, {"type": "R", "before": "\u201d", "after": "\"", "start_char_pos": 2781, "end_char_pos": 2782}], "sents_char_pos": [0, 271, 409, 514, 537, 563, 696, 792, 1026, 1161, 1250, 1386, 1438, 1507, 1619, 1766, 1930, 2155, 2245, 2320, 2405, 2460, 2510, 2598]} {"doc_id": "54370", "revision_depth": "1", "before_revision": " 73-year old retired pastor, Reverend Roland Weisselberg, burned himself alive during Reformation Day services on Tuesday in Erfurt, Germany. His self-immolation was apparently to protest against the spread of Islam, which he felt the Protestant church should take more seriously. His last words were \"Jesus and Oskar,\" which is believed to refer to Oskar Bruesewitz, a priest who burned himself alive to protest the Communist government of East Germany. He was transported to a burns unit in Halle but died en route. Reverend Weisselberg had lived under Communism in East Germany, and had been a publisher in his former vocation. Axel Noack, Bishop of Saxony, said that he was shocked at Rev. Weisselberg's self-immolation, stressing that Christians could not accept a \"clash of cultures\". He confessed that the issue of Islam had been sidelined within the Church and was only spoken about in private. There were few Muslims there with whom they could engage in dialogue, Noack claimed .", "after_revision": "A 73-year old retired pastor, Reverend Roland Weisselberg, burned himself alive during Reformation Day services on Tuesday in Erfurt, Germany. His self-immolation was apparently in protest against the spread of Islam, which he felt the Protestant church should take more seriously. His last words were \"Jesus and Oskar,\" , believed to a reference to Oskar Bruesewitz, a priest who burned himself alive to protest the Communist government of East Germany. He was transported to a burns unit in Halle but died en route. Rev. Weisselberg had lived under Communism in East Germany, and had been a publisher in his former vocation. Axel Noack, Bishop of Saxony, said that he was shocked at Rev. Weisselberg's self-immolation, stressing that Christians could not accept a \"clash of cultures\". He confessed that the issue of Islam had been sidelined within the Church and was only spoken about in private. There were few Muslims there with whom they could engage in dialogue, Noack said .", "edit_actions": [{"type": "A", "before": null, "after": "A", "start_char_pos": 0, "end_char_pos": 0}, {"type": "R", "before": "to", "after": "in", "start_char_pos": 177, "end_char_pos": 179}, {"type": "R", "before": "which is believed to refer", "after": ", believed to a reference", "start_char_pos": 320, "end_char_pos": 346}, {"type": "R", "before": "Reverend", "after": "Rev.", "start_char_pos": 518, "end_char_pos": 526}, {"type": "R", "before": "claimed", "after": "said", "start_char_pos": 979, "end_char_pos": 986}], "sents_char_pos": [0, 141, 280, 454, 517, 630, 790, 902]} {"doc_id": "5484", "revision_depth": "1", "before_revision": "Carlos Mesa. The President of Bolivia Carlos Mesa officially resigned Sunday, March 6. Now the President of Senate Hormando Vaca D\u00edez is the temporary President of the Republic of Bolivia. Mesa resigned because of the announcement of highways's blockages by Evo Morales , both the leader of the coca growers and the Movement Toward Socialism (MAS). The blockages serve to pressure the Legislative so the Hydrocarbons Law can be approved. The law aims to raise the taxes levied on hydrocarbon extraction from 18 to 50\\%. The MAS is a political party formed basically by coca-growing campesinos (known as cocaleros), communists , admirers of Fidel Castro and indigenous people. The party is against the government of the United States and the alleged American influency in the region, the neoliberalism and the globalization . Morales in his own words, explain some of the MAS motivations: The worst enemy of humanity is capitalism. That is what provokes uprisings like our own, a rebellion against a system, against a neoliberal model, which is the representation of a savage capitalism. If the entire world doesn't acknowledge this reality, that the national states are not providing even minimally for health, education and alimentation, then each day the most fundamental human rights are being violated. Morales is an admirer of Fidel Castro and he says he is inspired by the presidents of Venezuela Hugo Chavez and Brazil, Luiz In\u00e1cio Lula da Silva . He supports the creation of a anti-imperialist block formed by Latin-American and Arabian countries against the USA, which is being organized by the Brazilian President. Bolivia economy depends on exportation of hydrocarbon (oil and gas). Other sources of resources comes from the cultivation of coca. The coca growers demands the same treatment the government is giving to hydrocarbons. However, the production of coca in great quantities is controversial since the coca is the raw material of cocaine . Cocaine is considered illegal in Bolivia and in the majority of other countries", "after_revision": " The President of Bolivia officially resigned Sunday, March 6. Now the President of Senate Hormando Vaca D\u00edez is the temporary President of the Republic of Bolivia. Mesa resigned because of the announcement of highways's blockages by , both the leader of the growers and the Movement Toward Socialism (MAS). The blockages serve to pressure the Legislative so the Hydrocarbons Law can be approved. The law aims to raise the taxes levied on hydrocarbon extraction from 18 to 50\\%. The MAS is a political party formed basically by coca-growing (known as cocaleros), , admirers of , and people. The party is against the government of the and the alleged American influency in the region, the and the . Morales in his own words, explain some of the MAS motivations: The worst enemy of humanity is capitalism. That is what provokes uprisings like our own, a rebellion against a system, against a neoliberal model, which is the representation of a savage capitalism. If the entire world doesn't acknowledge this reality, that the national states are not providing even minimally for health, education and alimentation, then each day the most fundamental human rights are being violated. Morales is an admirer of Fidel Castro and he says he is inspired by the presidents of and , . He supports the creation of an anti-imperialist block formed by Latin-American and Arabian countries against the USA, which is being organized by the Brazilian President. Bolivia economy depends on exportation of (oil and gas). Other sources of resources comes from the cultivation of coca. The coca growers demands the same treatment the government is giving to hydrocarbons. However, the production of coca in great quantities is controversial since the coca is the raw material of . Cocaine is considered illegal in Bolivia and in the majority of other countries", "edit_actions": [{"type": "D", "before": "Carlos Mesa.", "after": null, "start_char_pos": 0, "end_char_pos": 12}, {"type": "D", "before": "Carlos Mesa", "after": null, "start_char_pos": 38, "end_char_pos": 49}, {"type": "D", "before": "Evo Morales", "after": null, "start_char_pos": 258, "end_char_pos": 269}, {"type": "D", "before": "coca", "after": null, "start_char_pos": 295, "end_char_pos": 299}, {"type": "D", "before": "campesinos", "after": null, "start_char_pos": 582, "end_char_pos": 592}, {"type": "D", "before": "communists", "after": null, "start_char_pos": 615, "end_char_pos": 625}, {"type": "R", "before": "Fidel Castro and indigenous", "after": ", and", "start_char_pos": 640, "end_char_pos": 667}, {"type": "D", "before": "United States", "after": null, "start_char_pos": 719, "end_char_pos": 732}, {"type": "R", "before": "neoliberalism and the globalization", "after": "and the", "start_char_pos": 787, "end_char_pos": 822}, {"type": "R", "before": "Venezuela Hugo Chavez and Brazil, Luiz In\u00e1cio Lula da Silva", "after": "and ,", "start_char_pos": 1393, "end_char_pos": 1452}, {"type": "R", "before": "a", "after": "an", "start_char_pos": 1483, "end_char_pos": 1484}, {"type": "D", "before": "hydrocarbon", "after": null, "start_char_pos": 1667, "end_char_pos": 1678}, {"type": "D", "before": "cocaine", "after": null, "start_char_pos": 1950, "end_char_pos": 1957}], "sents_char_pos": [0, 12, 188, 348, 437, 519, 675, 824, 930, 1086, 1306, 1454, 1624, 1693, 1756, 1842]} {"doc_id": "55265", "revision_depth": "1", "before_revision": "Nine people are confirmed dead in a fire in a leather bag facory in Kolkata's South 24 Pargana district in Topsia area. Eighteen people were seriously injured and admitted to National Medical College and Hospital. Inspector General of Police (Law and Order) Raj Kanojia said that the fire was broken out at about 3 am when the victims were inside the factory and all the doors were closed. Director General of Fire Brigade Gopal Bhattacharjee said that it was an illegal factory in Kolkata located at third floor of the building. At the time of fire, all the premises were closed and workers could not come out from the factory. The cause of the fire was yet to be ascertained. Kolkata Mayor Bikash Ranjan Bhattacharya predicted short circuit or an unattended cigarette causing fire in the factory .", "after_revision": "Nine people are confirmed dead in a fire in a leather bag factory in Kolkata's South 24 Pargana district in Topsia area. Eighteen people were seriously injured and admitted to the National Medical College and Hospital. Inspector General of Police (Law and Order) Raj Kanojia said that the fire broke out at about 3 a.m. local time, when the victims were inside the factory and all the doors were closed. Director General of Fire Brigade Gopal Bhattacharjee said that it was an illegal factory in Kolkata located at third floor of the building. At the time of fire, all the exits were shut and workers could not come out from the factory. The cause of the fire is yet to be ascertained. Kolkata Mayor Bikash Ranjan Bhattacharya suggested that a short circuit or an unattended cigarette may have caused the fire .", "edit_actions": [{"type": "R", "before": "facory", "after": "factory", "start_char_pos": 58, "end_char_pos": 64}, {"type": "A", "before": null, "after": "the", "start_char_pos": 175, "end_char_pos": 175}, {"type": "R", "before": "was broken", "after": "broke", "start_char_pos": 290, "end_char_pos": 300}, {"type": "R", "before": "am", "after": "a.m. local time,", "start_char_pos": 316, "end_char_pos": 318}, {"type": "R", "before": "premises were closed", "after": "exits were shut", "start_char_pos": 560, "end_char_pos": 580}, {"type": "R", "before": "was", "after": "is", "start_char_pos": 652, "end_char_pos": 655}, {"type": "R", "before": "predicted", "after": "suggested that a", "start_char_pos": 720, "end_char_pos": 729}, {"type": "R", "before": "causing fire in the factory", "after": "may have caused the fire", "start_char_pos": 771, "end_char_pos": 798}], "sents_char_pos": [0, 119, 214, 390, 530, 629, 678]} {"doc_id": "55544", "revision_depth": "1", "before_revision": "Today at a special caucus meeting, member of parliaments (MP) for National agreed that the new leader of the opposition, New Zealand's National Party, is John Key and the deputy leader is Bill English , they are taking over from past leader, Dr Don Brash and past deputy leader, Gerry Brownlee. Bill English, 45-years-old, use to be leader of the National Party before being outed in 2003 and being replaced by Dr Brash for a bad performance at the 2002 New Zealand elections, Mr English only managed to get 22\\% of the votes cast. Mr Key, also 45-years-old, said at the announcement of the new leader and deputy leader that he was honoured that he was chosen to be the new leader of the National Party and also hounoured that Mr English would be his deputy. \"Can I tell you I think we will make a formidable team . Key said the public placed a high value on unity. If National could demonstrate it could manage itself, then it could start to manage the country.\" Dr Brash will however stay on the National Party. He is at number 3 on the list of National MP , behind Key and English. His new caucus responsibilities will be : Spokesman for the Security and Intelligence Service and Spokesman for Relationships with Non-Government Parties. His select committee responsibility is Security and Intelligence.", "after_revision": "Today at a special caucus meeting, member of parliaments (MP) for National agreed that the new leader of the opposition, New Zealand's National Party, is John Key and the deputy leader is Bill English . They are taking over from past leader, Dr Don Brash and past deputy leader, Gerry Brownlee. Bill English, 45-years-old, is the former leader of the National Party . He was outed in 2003 , for a bad performance at the 2002 New Zealand elections, and replaced by Dr Brash. Mr English only managed to get 22\\% of the votes cast. John Key, also 45-years-old, said at the announcement of the new leader and deputy leader that he was honoured that he was chosen to be the new leader of the National Party and also honoured that Mr English would be his . If National could demonstrate it could manage itself, then it could start to manage the country. deputy. \"Can I tell you I think we will make a formidable team ,\" he said . Key said the public placed a high value on unity. Dr Brash will however stay on the National Party. He is at number 3 on the list of National MPs , behind Key and English. His new caucus responsibilities will be Spokesman for the Security and Intelligence Service and Spokesman for Relationships with Non-Government Parties. His select committee responsibility is Security and Intelligence.", "edit_actions": [{"type": "R", "before": ", they", "after": ". They", "start_char_pos": 201, "end_char_pos": 207}, {"type": "R", "before": "use to be", "after": "is the former", "start_char_pos": 323, "end_char_pos": 332}, {"type": "R", "before": "before being", "after": ". He was", "start_char_pos": 362, "end_char_pos": 374}, {"type": "R", "before": "and being replaced by Dr Brash", "after": ",", "start_char_pos": 389, "end_char_pos": 419}, {"type": "A", "before": null, "after": "and replaced by Dr Brash.", "start_char_pos": 477, "end_char_pos": 477}, {"type": "R", "before": "Mr", "after": "John", "start_char_pos": 533, "end_char_pos": 535}, {"type": "R", "before": "hounoured", "after": "honoured", "start_char_pos": 713, "end_char_pos": 722}, {"type": "A", "before": null, "after": ". If National could demonstrate it could manage itself, then it could start to manage the country.", "start_char_pos": 752, "end_char_pos": 752}, {"type": "A", "before": null, "after": ",\" he said", "start_char_pos": 816, "end_char_pos": 816}, {"type": "D", "before": "If National could demonstrate it could manage itself, then it could start to manage the country.\"", "after": null, "start_char_pos": 869, "end_char_pos": 966}, {"type": "R", "before": "MP", "after": "MPs", "start_char_pos": 1059, "end_char_pos": 1061}, {"type": "D", "before": ":", "after": null, "start_char_pos": 1128, "end_char_pos": 1129}], "sents_char_pos": [0, 294, 532, 760, 868, 966, 1016, 1087, 1242]} {"doc_id": "58086", "revision_depth": "1", "before_revision": "200px|The demonstration in front of the Burgtheater A crowd of about 250 activists from the Austrian National Union of Students (\u00d6sterreichische Hochsch\u00fclerinnen- und Hochsch\u00fclerschaft, \u00d6H) as well as the Organisation of Socialist Students of Austria (Verband Sozialistischer StudentInnen \u00d6sterreichs, VSSt\u00d6) quickly reacted to the announced forming of the new Austrian coalition government by starting a demonstration in front of the University of Vienna , the largest in the country. Specifically, the demonstration protested against the proposed plan of enabling students to do community service work at a rate of EUR 6 ( ~ USD 7.6) per hour to work off student fees of about EUR 372 ( ~ USD 475,8) per semester. These fees were introduced under the government of chancellor Wolfgang Sch\u00fcssel , which ruled Austria from 2000 on. 200px|The demonstration in front of the Parliament The protest started directly in front of the university buildings on the famous Ringstra\u00dfe . Protestors blocked the street by sweeping the street, symbolising the work students have to do in order to study. They proceeded to the headquarters of the SP\u00d6, where they chanted \"Who betrayed us? Social Democrats!\", and later to the parliament building. After this, they announced to go to the \u00d6VP headquarters, when this reporter had to leave the scene. On October 1, 2006, a new National Assembly was elected. The Social Democrats narrowly won the election, while the \u00d6VP suffered severe losses and fell to second place. Since then, intense negotiations between the two parties about a coalition have taken place and presumably ended today, when at 13:30 hours, SP\u00d6 leader Alfred Gusenbauer and \u00d6VP leader Wolfgang Sch\u00fcssel announced the finishing of negotiations and conciliation of the two parties in a new government, which is to be sworn in by President Heinz Fischer on January 11.", "after_revision": "200px|The demonstration in front of the A crowd of about 250 activists from the (\u00d6sterreichische Hochsch\u00fclerinnen- und Hochsch\u00fclerschaft, \u00d6H) as well as the Organisation of (Verband Sozialistischer StudentInnen \u00d6sterreichs, VSSt\u00d6) quickly reacted to the announced forming of the new Austrian coalition government by starting a demonstration in front of the , the largest in the country. Specifically, the demonstration protested against the proposed plan of enabling students to do community service work at a rate of 6 ( about 7.6) per hour to work off student fees of about EUR 372 ( about USD 475,8) per semester. These fees were introduced under the government of chancellor , which ruled Austria from 2000 on. 200px|The demonstration in front of the Parliament The protest started directly in front of the university buildings on the famous . Protestors blocked the street by sweeping the street, symbolising the work students have to do in order to study. They proceeded to the headquarters of the SP\u00d6, where they chanted \"Who betrayed us? Social Democrats!\", and later to the building. After this, they announced to go to the \u00d6VP headquarters, when this reporter had to leave the scene. On October 1, 2006, a new was elected. The narrowly won the election, while the \u00d6VP suffered severe losses and fell to second place. Since then, intense negotiations between the two parties about a coalition have taken place and presumably ended today, when at 13:30 hours, SP\u00d6 leader and \u00d6VP leader Wolfgang Sch\u00fcssel announced the finishing of negotiations and conciliation of the two parties in a new government, which is to be sworn in by on January 11.", "edit_actions": [{"type": "D", "before": "Burgtheater", "after": null, "start_char_pos": 40, "end_char_pos": 51}, {"type": "D", "before": "Austrian National Union of Students", "after": null, "start_char_pos": 92, "end_char_pos": 127}, {"type": "D", "before": "Socialist Students of Austria", "after": null, "start_char_pos": 221, "end_char_pos": 250}, {"type": "D", "before": "University of Vienna", "after": null, "start_char_pos": 435, "end_char_pos": 455}, {"type": "D", "before": "EUR", "after": null, "start_char_pos": 617, "end_char_pos": 620}, {"type": "R", "before": "~ USD", "after": "about", "start_char_pos": 625, "end_char_pos": 630}, {"type": "R", "before": "~", "after": "about", "start_char_pos": 689, "end_char_pos": 690}, {"type": "D", "before": "Wolfgang Sch\u00fcssel", "after": null, "start_char_pos": 778, "end_char_pos": 795}, {"type": "D", "before": "Ringstra\u00dfe", "after": null, "start_char_pos": 963, "end_char_pos": 973}, {"type": "D", "before": "parliament", "after": null, "start_char_pos": 1211, "end_char_pos": 1221}, {"type": "D", "before": "National Assembly", "after": null, "start_char_pos": 1359, "end_char_pos": 1376}, {"type": "D", "before": "Social Democrats", "after": null, "start_char_pos": 1394, "end_char_pos": 1410}, {"type": "D", "before": "Alfred Gusenbauer", "after": null, "start_char_pos": 1653, "end_char_pos": 1670}, {"type": "D", "before": "President Heinz Fischer", "after": null, "start_char_pos": 1828, "end_char_pos": 1851}], "sents_char_pos": [0, 485, 715, 1089, 1173, 1231, 1332, 1389, 1500]} {"doc_id": "60036", "revision_depth": "1", "before_revision": "Microsoft Windows XP logo. In Russia, Microsoft decided to press charges against a teacher for using pirated copies of Microsoft software on school computers. The teacher, Mr. Alexander Ponosov, pleaded not guilty and claimed that he purchased the computer along with the software it came with legally, without knowing that the computer was loaded with pirated software. The Russian president criticized the move by Microsoft against the teacher, saying it was \"ridiculous\" to arrest someone for using computers and that the distributors of pirated software should be targeted rather than users. Former Soviet leader Mikhail Gorbachev also urged Microsoft to drop the suit , asking Microsoft's mercy for the teacher and adding that the teacher, if convicted, may face \"imprisonment in Siberian camps\".", "after_revision": "Microsoft Windows XP logo. Russian prosecutors have charged a school headmaster with using pirated copies of Microsoft software on school computers. The teacher, Mr. Alexander Ponosov, pleaded not guilty and claimed that he did not know that the purchased computers were loaded with pirated software. The Russian president criticized the move against the teacher, saying it was \"ridiculous\" to arrest someone for using computers and that the distributors of pirated software should be targeted rather than users. Former Soviet leader Mikhail Gorbachev also urged Microsoft to intercede in the case , asking Microsoft's mercy for the teacher and adding that the teacher, if convicted, may face \"imprisonment in Siberian camps\".", "edit_actions": [{"type": "R", "before": "In Russia, Microsoft decided to press charges against a teacher for", "after": "Russian prosecutors have charged a school headmaster with", "start_char_pos": 27, "end_char_pos": 94}, {"type": "R", "before": "purchased the computer along with the software it came with legally, without knowing that the computer was", "after": "did not know that the purchased computers were", "start_char_pos": 234, "end_char_pos": 340}, {"type": "D", "before": "by Microsoft", "after": null, "start_char_pos": 413, "end_char_pos": 425}, {"type": "R", "before": "drop the suit", "after": "intercede in the case", "start_char_pos": 659, "end_char_pos": 672}], "sents_char_pos": [0, 26, 158, 370, 595]} {"doc_id": "60866", "revision_depth": "1", "before_revision": "A company in Los Gatos, California, called Audible Magic, is currently developing a new software that is to filter music and video that was uploaded on the Internet without permission of copyright holders. The company's chief executive, Vance Ikezoye, demonstrated how the system works. He downloaded a poor-quality video from YouTube and fed it to the filtering software . The program identified the video as a fighting scene of \u201cKill Bill: Vol. 2 \u201d the rights of which are owned by Miramax. The entertainment industry is already demanding the adoption of the new system by the Internet companies. One of the major social networks owned by News Corporation, MySpace, has agreed on adopting the filter. However, not all websites want to adopt the system as soon as it is launched. The main holdout is YouTube, owned by Google. The site's officials earlier said they would adopt a filtering software by the end of last year and till this day YouTube haven't used any type of filtering system. The company's official said that they would only use the filter in case the copyright owners will broaden their license with Google. The executives of NBC and Viacom have already stated their complaints regarding the delay of Googleto place filters. The new system uses a large database that includes digital representations of various copyrighted audio and video files. However, the software is not finished yet since there are ways of fooling it, like for example by cropping the image. The technology of spotting copyrighted material is called \u201cdigital fingerprinting \u201d . The technology checks for matches and decides whether to post the material on the site or not. Analysts say that the filtering software is to improve the relations that are currently quite tensed between the standard media companies and Internet companies.", "after_revision": "Audible Magic, a company in Los Gatos, California, is developing a new software that can filter music and video uploaded on the Internet without permission of copyright holders. The company's chief executive, Vance Ikezoye, demonstrated how the system works. He downloaded a poor-quality video from YouTube and fed it to the filtering software , which identified the video as a fighting scene of \u201cKill Bill: Vol. 2 , \u201d the rights to which are owned by Miramax. The entertainment industry is already demanding the adoption of the new system by the Internet companies. One of the major social networks owned by News Corporation, MySpace, has agreed to adopt the filter. However, not all websites want to adopt the system as soon as it is launched. The main holdout is YouTube, owned by Google. The site's officials earlier said they would adopt a filtering software by the end of last year , but so far YouTube has not begun using any type of filtering system. The company's officials said that they would only use the filter if copyright owners will broaden their license with Google. The executives of NBC and Viacom have already stated their complaints regarding Google's delay on placing filters. The new system uses a large database that includes digital representations of various copyrighted audio and video files. This technology of spotting copyrighted material , called \u201cdigital fingerprinting , \u201d checks for matches and decides whether to post the material on the site or not. However, Audible Magic's software is not considered finalized since it can still be \"fooled\"--e.g., by cropping the image. Analysts say that the filtering software is to improve the relations that are currently quite tense between the standard media companies and Internet companies.", "edit_actions": [{"type": "R", "before": "A", "after": "Audible Magic, a", "start_char_pos": 0, "end_char_pos": 1}, {"type": "R", "before": "called Audible Magic, is currently", "after": "is", "start_char_pos": 36, "end_char_pos": 70}, {"type": "R", "before": "is to", "after": "can", "start_char_pos": 102, "end_char_pos": 107}, {"type": "D", "before": "that was", "after": null, "start_char_pos": 131, "end_char_pos": 139}, {"type": "R", "before": ". The program", "after": ", which", "start_char_pos": 372, "end_char_pos": 385}, {"type": "A", "before": null, "after": ",", "start_char_pos": 449, "end_char_pos": 449}, {"type": "R", "before": "of", "after": "to", "start_char_pos": 463, "end_char_pos": 465}, {"type": "R", "before": "on adopting", "after": "to adopt", "start_char_pos": 680, "end_char_pos": 691}, {"type": "R", "before": "and till this day YouTube haven't used", "after": ", but so far YouTube has not begun using", "start_char_pos": 924, "end_char_pos": 962}, {"type": "R", "before": "official", "after": "officials", "start_char_pos": 1007, "end_char_pos": 1015}, {"type": "R", "before": "in case the", "after": "if", "start_char_pos": 1057, "end_char_pos": 1068}, {"type": "R", "before": "the delay of Googleto place", "after": "Google's delay on placing", "start_char_pos": 1206, "end_char_pos": 1233}, {"type": "R", "before": "However, the software is not finished yet since there are ways of fooling it, like for example by cropping the image. The", "after": "This", "start_char_pos": 1364, "end_char_pos": 1485}, {"type": "R", "before": "is", "after": ",", "start_char_pos": 1530, "end_char_pos": 1532}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1564, "end_char_pos": 1564}, {"type": "D", "before": ". The technology", "after": null, "start_char_pos": 1567, "end_char_pos": 1583}, {"type": "A", "before": null, "after": "However, Audible Magic's software is not considered finalized since it can still be \"fooled\"--e.g., by cropping the image.", "start_char_pos": 1664, "end_char_pos": 1664}, {"type": "R", "before": "tensed", "after": "tense", "start_char_pos": 1759, "end_char_pos": 1765}], "sents_char_pos": [0, 205, 286, 373, 493, 599, 703, 781, 827, 992, 1125, 1242, 1363, 1481, 1663]} {"doc_id": "6104", "revision_depth": "2", "before_revision": "The official Abin version can be seen on its website. The agency stores and archives all data collected by the inteligence service, including data that do not fulfill all Abin's criteria for consistency and accuracy. Every kind of document remains in Abin archive so it can be re-evaluated in the future. According to General Felix, Abin archives may contain data that are not relevant, tendentious or completely untrue. The documents mentioned by Veja are this sort of data. According to Veja, the spy says that he came upon the FARC case accidentally. It happened when leftists invited him to be part of a pro-FARC committee, in defense of the Colombian guerrillas. The spy claims to have agreed and and he began to frequent the meetings, which were almost always secret. General Jorge Felix refused to comment the case explaining that everything were already had been told to the deputies and senators comission . It is known that the FARC and PT politics have met since 1990. Many of these meetings ocurred during the enconteurs of the Foro de S\u00e3o Paulo. Some analysts say that the Comunist Colombian guerrilla aims to extend its influence throughout other countries in Latin America., Deputy Paulo Rocha also says that the meetings between FARC delegates with Brazilian politicians were part of a FARC attempt of establishing a diplomatic representation in Brazil, which did not happened. So, according to the deputy, there were meetings between the father Oliv\u00e9rio Medina, who worked as FARC ambassador, with parliamentarians of diverse parties. The deputy said: \"Meetings can have happened, but there is no political and financial relation with the PT.\" For the deputy there are no reasons to create a congress investigation comission , as suggested by oppostion parties. The Veja admitted in its article that it is possible that the FARC delegate father Medina did not said the true when he told the FARC would donate 5 million dollars to PT campaign in Cora\u00e7\u00e3o Vermelho hacienda. Also the magazine admitted that it cannot proof the donation ocurred and it says that it is possible that the Abin documents are untrue. The magazine Veja said it didn't involve the Workers' Party, as an organization, in the case. The leftist Ant\u00f4nio Carlos Viana told to the Brazilian newspaper Correio Braziliense that during the encounter between FARC and PT members in Cora\u00e7\u00e3o Vermelho hacienda there weren't any discussion about money. He said:\"We believe that the path to peace in Colombia is people and Brazilian government recognizing the FARC. However we can't take any responsability by the FARC's actions and we deny categorically any discussion about money to electoral purposes in Brazil.\" Some Brazilian comments Some opinion excerpts from the O Estado de S\u00e3o Paulo Forum:Magazines and newspapers must be careful with explosive news I am not PT sympathizant and I have already criticized some points about the party and the governement (...) There is no saint in any political party, neither in the several religions, neither in the Church. However, I can't believe that someone inside PT, after I have some knowledge about its leaders, might have received any contribution from the FARC (...) Fake dossiers have already been created relating the PSDB with foreign bank accounts and these news were denied later. The FARC donation is a campaign gossip which is already began by PT unfortunately. \u2014 Antonio Carlos Rocha da Silva / S\u00e3o PauloPossibilities The news published in Veja magazine, March 13, this year, is really daring. Saying that the PT received money from the FARC is serious and grave. If the magazine published the story, there must be, at least, some kind of information.(...)The Workers'Party members deny the fact, with no exception. But you must remember that most of them have belonged to armed groups during the militar regime.(..)If the PT did not prosecute the magazine, the doubt can cause some harm.(...) \u2014 Jorge Cort\u00e1s Sader Filho / Niter\u00f3iNew story, old subject''' The FARC/PT connection is older thant the Bible draft. In 2002 a deputy tryed to create a CPI [Congress Comission of Investigation] to investigate the donation, however he didn't get enough signatures. (...)If the article is lying, the PT have to proof and expose the magazine, then prosecute it.(...) The worst blind person is who doesn't want to see. This kind of person, the fanatic voter, is not helping in nothing Brazil.'' \u2014 Sonia / Rio de Janeiro 17 March: Comission of deputies and senators hear the explanations of the persons in charge for Abin, the general Jorge F\u00e9lix and Mauro Marcelo de Lima e Silva. They express the documents used by the magazine Veja are not reliable and cannot be used. The meeting in the farm, as described in Abin documents, ocurred . Brazilian government have already said that it is against terrorism.
", "after_revision": "The official Abin version can be seen on its website. The agency stores and archives all data collected by the intelligence service, including data that do not fulfill all Abin's criteria for consistency and accuracy. Every kind of document remains in Abin archive so it can be re-evaluated in the future. According to General Felix, Abin archives may contain data that are not relevant, tendentious or completely untrue. The documents mentioned by Veja are this sort of data. According to Veja, the spy says that he came upon the FARC case accidentally. It happened when leftists invited him to be part of a pro-FARC committee, in defense of the Colombian guerrillas. The spy claims to have agreed and he began to frequent the meetings, which were almost always secret. General Jorge Felix refused to comment the case explaining that everything were already had been told to the deputies and senators commission . It is known that the FARC and PT politics have met since 1990. Many of these meetings occurred during the enconteurs of the Foro de S\u00e3o Paulo. Some analysts say that the Communist Colombian guerrilla aims to extend its influence throughout other countries in Latin America., Deputy Paulo Rocha also says that the meetings between FARC delegates with Brazilian politicians were part of a FARC attempt of establishing a diplomatic representation in Brazil, which did not happened. So, according to the deputy, there were meetings between the father Oliv\u00e9rio Medina, who worked as FARC ambassador, with parliamentarians of diverse parties. The deputy said: \"Meetings can have happened, but there is no political and financial relation with the PT.\" For the deputy there are no reasons to create a congress investigation commission , as suggested by oppostion parties. The Veja admitted in its article that it is possible that the FARC delegate father Medina did not said the true when he told the FARC would donate 5 million dollars to PT campaign in Cora\u00e7\u00e3o Vermelho hacienda. Also the magazine admitted that it cannot proof the donation occurred and it says that it is possible that the Abin documents are untrue. The magazine Veja said it didn't involve the Workers' Party, as an organization, in the case. The leftist Ant\u00f4nio Carlos Viana told to the Brazilian newspaper Correio Braziliense that during the encounter between FARC and PT members in Cora\u00e7\u00e3o Vermelho hacienda there weren't any discussion about money. He said:\"We believe that the path to peace in Colombia is people and Brazilian government recognizing the FARC. However we can't take any responsibility by the FARC's actions and we deny categorically any discussion about money to electoral purposes in Brazil.\" Some Brazilian comments Some opinion excerpts from the O Estado de S\u00e3o Paulo Forum:Magazines and newspapers must be careful with explosive news I am not PT sympathizant and I have already criticized some points about the party and the government (...) There is no saint in any political party, neither in the several religions, neither in the Church. However, I can't believe that someone inside PT, after I have some knowledge about its leaders, might have received any contribution from the FARC (...) Fake dossiers have already been created relating the PSDB with foreign bank accounts and these news were denied later. The FARC donation is a campaign gossip which is already began by PT unfortunately. \u2014 Antonio Carlos Rocha da Silva / S\u00e3o PauloPossibilities The news published in Veja magazine, March 13, this year, is really daring. Saying that the PT received money from the FARC is serious and grave. If the magazine published the story, there must be, at least, some kind of information.(...)The Workers'Party members deny the fact, with no exception. But you must remember that most of them have belonged to armed groups during the militar regime.(..)If the PT did not prosecute the magazine, the doubt can cause some harm.(...) \u2014 Jorge Cort\u00e1s Sader Filho / Niter\u00f3iNew story, old subject''' The FARC/PT connection is older thant the Bible draft. In 2002 a deputy tryed to create a CPI [Congress Commission of Investigation] to investigate the donation, however he didn't get enough signatures. (...)If the article is lying, the PT have to proof and expose the magazine, then prosecute it.(...) The worst blind person is who doesn't want to see. This kind of person, the fanatic voter, is not helping in nothing Brazil.'' \u2014 Sonia / Rio de Janeiro 17 March: Commission of deputies and senators hear the explanations of the persons in charge for Abin, the general Jorge F\u00e9lix and Mauro Marcelo de Lima e Silva. They express the documents used by the magazine Veja are not reliable and cannot be used. The meeting in the farm, as described in Abin documents, occurred . Brazilian government have already said that it is against terrorism. ", "edit_actions": [{"type": "R", "before": "inteligence", "after": "intelligence", "start_char_pos": 111, "end_char_pos": 122}, {"type": "D", "before": "and", "after": null, "start_char_pos": 702, "end_char_pos": 705}, {"type": "R", "before": "comission", "after": "commission", "start_char_pos": 905, "end_char_pos": 914}, {"type": "R", "before": "ocurred", "after": "occurred", "start_char_pos": 1003, "end_char_pos": 1010}, {"type": "R", "before": "Comunist", "after": "Communist", "start_char_pos": 1086, "end_char_pos": 1094}, {"type": "R", "before": "comission", "after": "commission", "start_char_pos": 1732, "end_char_pos": 1741}, {"type": "R", "before": "ocurred", "after": "occurred", "start_char_pos": 2050, "end_char_pos": 2057}, {"type": "R", "before": "responsability", "after": "responsibility", "start_char_pos": 2568, "end_char_pos": 2582}, {"type": "R", "before": "governement", "after": "government", "start_char_pos": 2927, "end_char_pos": 2938}, {"type": "R", "before": "Comission", "after": "Commission", "start_char_pos": 4098, "end_char_pos": 4107}, {"type": "R", "before": "Comission", "after": "Commission", "start_char_pos": 4458, "end_char_pos": 4467}, {"type": "R", "before": "ocurred", "after": "occurred", "start_char_pos": 4756, "end_char_pos": 4763}, {"type": "D", "before": "> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------. ______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ .C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------. ______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /%DIFDELCMD < \\\\%%% \\ --__%DIFDELCMD < \\\\ %%% : e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__%DIFDELCMD < \\\\%%% _________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ", "after_revision": "%DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\%%% %DIFDELCMD < \\\\ %%% %DIFDELCMD < \\\\%%% The Xbox 360 The \"red ring of death\" indicating a hardware failure. Microsoft has extended the warranty on its Xbox 360 video game console to three years from the date of purchase following a large number of problems with the console and \"an unacceptable number of repairs\", costing the company more than one billion US dollars. The fault, which has been dubbed the \"red ring of death\", causes the console to fail completely. In an open letter to owners of the Xbox 360, Peter Moore of Microsoft said, \"As of today, all Xbox 360 consoles are covered by an enhanced warranty program to address specifically the general hardware failures indicated by the three flashing red lights on the console. This applies to new and previously-sold consoles.\" The extended warranty covers repairing and shipping of the console and the company has promised to reimburse those owners who have already had to pay for repairs. Microsoft has not released details of the number of units that have suffered from the problem but has said it is \"bigger than we are comfortable with\". The Xbox 360 was launched by Microsoft in 2005 and in January of this year the company lowered its sales expectations to 12 million units for the year ending June 2007.", "edit_actions": [{"type": "D", "before": "g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 0, "end_char_pos": 116}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 135, "end_char_pos": 141}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 161, "end_char_pos": 414}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 433, "end_char_pos": 768}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 787, "end_char_pos": 793}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------. ______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ .C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 813, "end_char_pos": 1066}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 1085, "end_char_pos": 1420}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 1439, "end_char_pos": 1445}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------. ______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 1465, "end_char_pos": 1719}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 1738, "end_char_pos": 2073}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 2092, "end_char_pos": 2098}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 2118, "end_char_pos": 2371}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 2390, "end_char_pos": 2725}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 2744, "end_char_pos": 2750}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 2770, "end_char_pos": 3023}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 3042, "end_char_pos": 3377}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 3396, "end_char_pos": 3402}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 3422, "end_char_pos": 3675}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 3694, "end_char_pos": 4029}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 4048, "end_char_pos": 4054}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 4074, "end_char_pos": 4327}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 4346, "end_char_pos": 4681}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 4700, "end_char_pos": 4706}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 4726, "end_char_pos": 4979}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 4998, "end_char_pos": 5333}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 5352, "end_char_pos": 5358}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 5378, "end_char_pos": 5631}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 5650, "end_char_pos": 5985}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 6004, "end_char_pos": 6010}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 6030, "end_char_pos": 6283}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 6302, "end_char_pos": 6637}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 6656, "end_char_pos": 6662}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 6682, "end_char_pos": 6935}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 6954, "end_char_pos": 7289}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 7308, "end_char_pos": 7314}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 7334, "end_char_pos": 7587}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 7606, "end_char_pos": 7941}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 7960, "end_char_pos": 7966}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 7986, "end_char_pos": 8239}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 8258, "end_char_pos": 8593}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 8612, "end_char_pos": 8618}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 8638, "end_char_pos": 8891}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 8910, "end_char_pos": 9245}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 9264, "end_char_pos": 9270}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 9290, "end_char_pos": 9543}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 9562, "end_char_pos": 9897}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 9916, "end_char_pos": 9922}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 9942, "end_char_pos": 10195}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 10214, "end_char_pos": 10549}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 10568, "end_char_pos": 10574}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 10594, "end_char_pos": 10847}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 10866, "end_char_pos": 11201}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 11220, "end_char_pos": 11226}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 11246, "end_char_pos": 11499}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 11518, "end_char_pos": 11853}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 11872, "end_char_pos": 11878}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 11898, "end_char_pos": 12151}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 12170, "end_char_pos": 12505}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 12524, "end_char_pos": 12530}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 12550, "end_char_pos": 12803}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 12822, "end_char_pos": 13157}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 13176, "end_char_pos": 13182}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 13202, "end_char_pos": 13455}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 13474, "end_char_pos": 13809}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 13828, "end_char_pos": 13834}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 13854, "end_char_pos": 14107}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 14126, "end_char_pos": 14461}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 14480, "end_char_pos": 14486}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 14506, "end_char_pos": 14759}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 14778, "end_char_pos": 15113}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 15132, "end_char_pos": 15138}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 15158, "end_char_pos": 15411}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 15430, "end_char_pos": 15765}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 15784, "end_char_pos": 15790}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 15810, "end_char_pos": 16063}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 16082, "end_char_pos": 16417}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 16436, "end_char_pos": 16442}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 16462, "end_char_pos": 16715}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 16734, "end_char_pos": 17069}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 17088, "end_char_pos": 17094}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 17114, "end_char_pos": 17367}, {"type": "D", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x ** g o a t s e x * g o a t s e x * g o a t s e x * g g o / \\ \\ / \\ o a| | \\ | | a t| `. | | : t s` | | \\| | s e \\ | / /", "after": null, "start_char_pos": 17386, "end_char_pos": 17721}, {"type": "D", "before": "\\ --__", "after": null, "start_char_pos": 17740, "end_char_pos": 17746}, {"type": "D", "before": ": e x \\ \\/ _--~~ ~--__| \\ | x \\ \\_-~ ~-_\\ | * g \\_ \\ _.--------.______\\| | g o \\ \\______// _ ___ _ (_(__> \\ | o a \\ . C ___) ______ (_(____> | / a t /\\ | C ____)/ \\ (_____> |_/ t s / /\\| C_____) | (___> / \\ s e | ( _C_____)\\______/ // _/ / \\ e x | \\ |__", "after": null, "start_char_pos": 17766, "end_char_pos": 18019}, {"type": "R", "before": "_________// (__/ | x | \\ \\____) `---- --' | * g | \\_ ___\\ /_ _/ | g o | / | | \\ | o a | | / \\ \\ | a t | / / | | \\ |t s | / / \\__/\\___/ | |s e | / | | | |e x | | | | | |x g o a t s e x * g o a t s e x * g o a t s e x", "after": "The Xbox 360 The \"red ring of death\" indicating a hardware failure. Microsoft has extended the warranty on its Xbox 360 video game console to three years from the date of purchase following a large number of problems with the console and \"an unacceptable number of repairs\", costing the company more than one billion US dollars.", "start_char_pos": 18038, "end_char_pos": 18253}, {"type": "A", "before": null, "after": "The fault, which has been dubbed the \"red ring of death\", causes the console to fail completely.", "start_char_pos": 18254, "end_char_pos": 18254}, {"type": "A", "before": null, "after": "In an open letter to owners of the Xbox 360, Peter Moore of Microsoft said, \"As of today, all Xbox 360 consoles are covered by an enhanced warranty program to address specifically the general hardware failures indicated by the three flashing red lights on the console. This applies to new and previously-sold consoles.\" The extended warranty covers repairing and shipping of the console and the company has promised to reimburse those owners who have already had to pay for repairs.", "start_char_pos": 18255, "end_char_pos": 18255}, {"type": "A", "before": null, "after": "Microsoft has not released details of the number of units that have suffered from the problem but has said it is \"bigger than we are comfortable with\".", "start_char_pos": 18256, "end_char_pos": 18256}, {"type": "A", "before": null, "after": "The Xbox 360 was launched by Microsoft in 2005 and in January of this year the company lowered its sales expectations to 12 million units for the year ending June 2007.", "start_char_pos": 18257, "end_char_pos": 18257}], "sents_char_pos": [0, 225, 472, 877, 1124, 1529, 1777, 2182, 2429, 2834, 3081, 3486, 3733, 4138, 4385, 4790, 5037, 5442, 5689, 6094, 6341, 6746, 6993, 7398, 7645, 8050, 8297, 8702, 8949, 9354, 9601, 10006, 10253, 10658, 10905, 11310, 11557, 11962, 12209, 12614, 12861, 13266, 13513, 13918, 14165, 14570, 14817, 15222, 15469, 15874, 16121, 16526, 16773, 17178, 17425, 17830]} {"doc_id": "736", "revision_depth": "1", "before_revision": "Hu Jintao, the President of the People's Republic of China had lunch today with the President of Brazil, Luiz In\u00e1cio Lula da Silva , at the Granja do Torto, the President's country residence in the Brazilian Federal District . Lunch was a traditional Brazilian barbecue with different kinds of meat. Some Brazilian ministers were present at the event: Antonio Palocci (Economy), Eduardo Campos (Science and Technology), Roberto Rodrigues ( Agriculture), Luiz Fernando Furlan (Development), Celso Amorim (Exterior Relations), Dilma Rousseff ( Mines and Energy). Also present were Roger Agnelli ( Vale do Rio Doce company president) and Eduardo Dutra ( Petrobras , government oil company, president). This meeting is part of a new political economy agreement between Brazil and China where Brazil has recognized mainland China's market economy status, and China has promised to buy more Brazilian products .", "after_revision": ", the of the People's Republic of China had lunch today with the of Brazil, , at the Granja do Torto, the President's country residence in the . Lunch was a traditional Brazilian with different kinds of meat. Some Brazilian ministers were present at the event: (Economy), ( ), ( Agriculture), (Development), ( ), ( Mines and Energy). Also present were ( company president) and Eduardo Dutra ( , government oil company, president). This meeting is part of a new agreement between Brazil and China where Brazil has recognized mainland China's status, and China has promised to buy more .", "edit_actions": [{"type": "R", "before": "Hu Jintao, the President", "after": ", the", "start_char_pos": 0, "end_char_pos": 24}, {"type": "D", "before": "President", "after": null, "start_char_pos": 84, "end_char_pos": 93}, {"type": "D", "before": "Luiz In\u00e1cio Lula da Silva", "after": null, "start_char_pos": 105, "end_char_pos": 130}, {"type": "D", "before": "Brazilian Federal District", "after": null, "start_char_pos": 198, "end_char_pos": 224}, {"type": "D", "before": "barbecue", "after": null, "start_char_pos": 261, "end_char_pos": 269}, {"type": "D", "before": "Antonio Palocci", "after": null, "start_char_pos": 352, "end_char_pos": 367}, {"type": "D", "before": "Eduardo Campos (Science and Technology), Roberto Rodrigues", "after": null, "start_char_pos": 379, "end_char_pos": 437}, {"type": "A", "before": null, "after": "), (", "start_char_pos": 440, "end_char_pos": 440}, {"type": "D", "before": "Luiz Fernando Furlan", "after": null, "start_char_pos": 455, "end_char_pos": 475}, {"type": "D", "before": "Celso Amorim (Exterior Relations), Dilma Rousseff", "after": null, "start_char_pos": 491, "end_char_pos": 540}, {"type": "A", "before": null, "after": "), (", "start_char_pos": 543, "end_char_pos": 543}, {"type": "R", "before": "Roger Agnelli ( Vale do Rio Doce", "after": "(", "start_char_pos": 581, "end_char_pos": 613}, {"type": "D", "before": "Petrobras", "after": null, "start_char_pos": 653, "end_char_pos": 662}, {"type": "D", "before": "political economy", "after": null, "start_char_pos": 731, "end_char_pos": 748}, {"type": "D", "before": "market economy", "after": null, "start_char_pos": 829, "end_char_pos": 843}, {"type": "D", "before": "Brazilian products", "after": null, "start_char_pos": 887, "end_char_pos": 905}], "sents_char_pos": [0, 299, 562, 700]} {"doc_id": "73718", "revision_depth": "1", "before_revision": "West Indies have beaten England by 93 runs in the third and final One-Day International of the West Indies tour of England at Trent Bridge, Nottingham , England. West Indies win the three match series 2-1. England's bowlers fared poorly, despite removing Devon Smith early on, with the West Indies batsmen scoring 116 runs off the last ten overs. Runako Morton (82 not out), Chris Gayle (82) and Dwayne Bravo (42 off 24 balls) helped the West Indies to an imposing total of 289-5. The only wickets for England were taken by Liam Plunkett (3-59) and James Anderson (2-51). In response, England's batting performance was no better than their fielding. Although Owais Shah scored 51, England lost too many batsmen cheaply including Kevin Pietersen for 0. They were reduced to 196 all out, far short of the 290 runs needed. Fidel Edwards took 3-30 and Daren Powell took 4-40 for the West Indies. Previously on the tour, England won a four match Test series 3-0 and drew a two match Twenty20 series 1-1. England: A N Cook, M J Prior (wkt), I R Bell, K P Pietersen, P D Collingwood (capt), O A Shah, A D Mascarenhas , L E Plunkett, S C J Broad, MS Panesar, J M Anderson West Indies: C H Gayle (capt), D S Smith, S Chanderpaul, M N Samuels, D J Bravo, D Ramdin (wkt), D R Smith, R S Morton, F H Edwards, R Rampaul, D B L Powell Player of the match: D B L Powell (West Indies) Player of the series: S Chanderpaul (West Indies) Umpires: M R Benson and B G Jerling (South Africa) TV Umpire: P J Hartley Match referee: M J Procter (South Africa) Reserve Umpire: I J Gould", "after_revision": "have beaten by 93 runs in the third and final of the at , , England. West Indies win the three match series 2-1. England's bowlers fared poorly, despite removing early on, with the West Indies batsmen scoring 116 runs off the last ten overs. (82 not out), (82) and (42 off 24 balls) helped the West Indies to an imposing total of 289-5. The only wickets for England were taken by (3-59) and (2-51). In response, England's batting performance was no better than their fielding. Although scored 51, England lost too many batsmen cheaply including for 0. They were reduced to 196 all out, far short of the 290 runs needed. took 3-30 and took 4-40 for the West Indies. Previously on the tour, England won a four match series 3-0 and drew a two match series 1-1. England: , (wkt), , , (capt), , , , , , West Indies: (capt), , , , , (wkt), , , , , Player of the match: (West Indies) Player of the series: (West Indies) Umpires: and (South Africa) TV Umpire: Match referee: (South Africa) Reserve Umpire: ", "edit_actions": [{"type": "R", "before": "West Indies have beaten England", "after": "have beaten", "start_char_pos": 0, "end_char_pos": 31}, {"type": "R", "before": "One-Day International of the West Indies tour of England at Trent Bridge, Nottingham", "after": "of the at", "start_char_pos": 66, "end_char_pos": 150}, {"type": "A", "before": null, "after": ",", "start_char_pos": 153, "end_char_pos": 153}, {"type": "D", "before": "Devon Smith", "after": null, "start_char_pos": 256, "end_char_pos": 267}, {"type": "D", "before": "Runako Morton", "after": null, "start_char_pos": 348, "end_char_pos": 361}, {"type": "D", "before": "Chris Gayle", "after": null, "start_char_pos": 376, "end_char_pos": 387}, {"type": "D", "before": "Dwayne Bravo", "after": null, "start_char_pos": 397, "end_char_pos": 409}, {"type": "D", "before": "Liam Plunkett", "after": null, "start_char_pos": 525, "end_char_pos": 538}, {"type": "D", "before": "James Anderson", "after": null, "start_char_pos": 550, "end_char_pos": 564}, {"type": "D", "before": "Owais Shah", "after": null, "start_char_pos": 660, "end_char_pos": 670}, {"type": "D", "before": "Kevin Pietersen", "after": null, "start_char_pos": 730, "end_char_pos": 745}, {"type": "D", "before": "Fidel Edwards", "after": null, "start_char_pos": 821, "end_char_pos": 834}, {"type": "D", "before": "Daren Powell", "after": null, "start_char_pos": 849, "end_char_pos": 861}, {"type": "D", "before": "Test", "after": null, "start_char_pos": 942, "end_char_pos": 946}, {"type": "D", "before": "Twenty20", "after": null, "start_char_pos": 979, "end_char_pos": 987}, {"type": "R", "before": "A N Cook, M J Prior", "after": ",", "start_char_pos": 1009, "end_char_pos": 1028}, {"type": "R", "before": "I R Bell, K P Pietersen, P D Collingwood", "after": ", ,", "start_char_pos": 1036, "end_char_pos": 1076}, {"type": "R", "before": "O A Shah, A D Mascarenhas , L E Plunkett, S C J Broad, MS Panesar, J M Anderson", "after": ", , , , ,", "start_char_pos": 1085, "end_char_pos": 1164}, {"type": "D", "before": "C H Gayle", "after": null, "start_char_pos": 1178, "end_char_pos": 1187}, {"type": "R", "before": "D S Smith, S Chanderpaul, M N Samuels, D J Bravo, D Ramdin", "after": ", , , ,", "start_char_pos": 1196, "end_char_pos": 1254}, {"type": "R", "before": "D R Smith, R S Morton, F H Edwards, R Rampaul, D B L Powell", "after": ", , , ,", "start_char_pos": 1262, "end_char_pos": 1321}, {"type": "D", "before": "D B L Powell", "after": null, "start_char_pos": 1343, "end_char_pos": 1355}, {"type": "D", "before": "S Chanderpaul", "after": null, "start_char_pos": 1392, "end_char_pos": 1405}, {"type": "R", "before": "M R Benson and B G Jerling", "after": "and", "start_char_pos": 1429, "end_char_pos": 1455}, {"type": "D", "before": "P J Hartley", "after": null, "start_char_pos": 1482, "end_char_pos": 1493}, {"type": "D", "before": "M J Procter", "after": null, "start_char_pos": 1509, "end_char_pos": 1520}, {"type": "D", "before": "I J Gould", "after": null, "start_char_pos": 1552, "end_char_pos": 1561}], "sents_char_pos": [0, 162, 347, 481, 572, 650, 752, 820, 892, 1008, 1177]} {"doc_id": "73814", "revision_depth": "1", "before_revision": "1500 people in northern Nevada town of Winnemucca had to be evacuate this weekend as a 8,000-acre 55 sqaure miles wildfire burned danger close to the towns southern end. The fire threatened homes,business and a power substation the cause of the wildfire is believed to lighting strikes", "after_revision": "1500 people in northern Nevada town of Winnemucca had to be evacuated this weekend as a 8,000-acre 55 square mile wildfire burned dangerously close to the town's southern end. The fire threatened homes,business and a power substation . Lightning strikes are believed to have started the blaze.", "edit_actions": [{"type": "R", "before": "evacuate", "after": "evacuated", "start_char_pos": 60, "end_char_pos": 68}, {"type": "R", "before": "sqaure miles wildfire burned danger", "after": "square mile wildfire burned dangerously", "start_char_pos": 101, "end_char_pos": 136}, {"type": "R", "before": "towns", "after": "town's", "start_char_pos": 150, "end_char_pos": 155}, {"type": "R", "before": "the cause of the wildfire is believed to lighting strikes", "after": ". Lightning strikes are believed to have started the blaze.", "start_char_pos": 228, "end_char_pos": 285}], "sents_char_pos": [0, 169]} {"doc_id": "73816", "revision_depth": "1", "before_revision": "The mosque has been accused of enforcing it's own Islamic law in the capital, notable the illegal detention of Chinese foreign nationals working in massage parlors. The mosques leaders follow the Hanafi school of thought, believing that the Koran is the authority by which justice should by metered. Historically the mosque has had close links with the Pakistan leadership, and members of the current administration have resisted calls for a crackdown on the mosques antagonistic behaviour.", "after_revision": "The mosque has been accused of enforcing it's own Islamic law in the capital, notably the illegal detention of Chinese foreign nationals working in massage parlors. The mosques leaders follow the Hanafi school of thought, believing that the Koran is the authority by which justice should be metered. Historically the mosque has had close links with the Pakistan leadership, and members of the current administration have resisted calls for a crackdown on the mosques provocative behaviour.", "edit_actions": [{"type": "R", "before": "notable", "after": "notably", "start_char_pos": 78, "end_char_pos": 85}, {"type": "R", "before": "by", "after": "be", "start_char_pos": 288, "end_char_pos": 290}, {"type": "R", "before": "antagonistic", "after": "provocative", "start_char_pos": 467, "end_char_pos": 479}], "sents_char_pos": [0, 164, 299]} {"doc_id": "74857", "revision_depth": "1", "before_revision": "The political involvement of most media and other factors are causing contradictions among official sources that are making press work extremely hard. Moreover, nobody is permitted to reach the accident location. The site of the accident was closed to visitors following the intoxication of three TV journalists who got too close. Location of the cloud Map highlighting Lviv, the site of the derailment, in the Lviv Oblast. TV channel Novyj Kanal translated a telephonic interview with officers from the Ministry of Internal Affairs during which the existence of any cloud whatsoever is firmly denied. Immediately after the interview a press conference by Kiev mayor , Mr. Leonid Chernovezkij, announces that starting next Monday a daily report about the movements of the same cloud will be available to the population. The service will be provided by the Kiev administration. In an interview to TV channel UT-1 an officer of the ecological service admitted that they have no real data about the area closer to the accident, because not even government officers are permitted to reach it. The officer said that most data about the hypothetical movements of the cloud (if the cloud exists) are made based on computer simulations they receive from Russian vendors, because no such simulation model is currently available in the Ukraine. The closest available on spot measures are related to areas located several kilometers away from the epicentre. Removal operation In the same press release the Mayor of Kiev also announced that no transport of whatever dangerous material will be allowed in the town area. The removal by railway of the phosphor containers involved in the accident was originally planned for today. It \u2019s unclear how Kiev\u2019s transit refusal may affect the operationand whether the mayor has the authority to block national traffic on the railways. According to the Press Manager of the Ministery for Emergency Situations, Mr. Igor Krol', four containers will be lifted and put back on the rails today. Five containers have already been lifted. Yet the weather may affect the operations, as violent storms and very strong winds are expected in the area. This is going to introduce a serious risk factor for the phosphor that still remains on the ground. The contaminating products are in fact insulated from the air by means of pillows made of air and foam; a strong wind may cause new emergencies by even just partially removing such insulation structures. Yushchenko issued an official call to speed up the closure of the Chernobyl atomic power plants on July , 20. Immediately after he left the country with his family for an unofficial visit to Poland, that will be followed by an official visit to Germany. He is expected to travel to Germany on the evening of July 21. The Ukraine Procuror General, Mr. Aleksandr Medvedenko, declares to the press that he has visited the accident site together with the President, and that all necessary measures are being taken, both for the liquidation of the accident and the defense of the civilian population. He notes that \"it takes courage to work there, for the personnel of the Ministry for Emergency Situations\". He announces that a complex cycle of medical care is being planned for about 1500 children of the affected area. In the same interview the Procuror General announces that the Government of Kazakhstan will accept being returned the phosphor left (the goods were originally from Kazakhstan). Yet in the same hours the director of Kazphosphat (the vendor ) declares in an interview to the newspaper Segodnja that he gathers that \"the phosphor will be stocked in the Ukraine, because it makes no sense to transfer it back. Moreover, you can hardly imagine that Russia would accept the passage of such a dangerous damaged load on their railways\".", "after_revision": "The political involvement of most media and other factors are causing contradictions among official sources that are making press work extremely hard. Moreover, no one is permitted to enter the accident location. The site of the accident was closed to visitors following the injury of three TV journalists who got too close. Location of the cloud Map highlighting Lviv, the site of the derailment, in the Lviv Oblast. TV channel Novyj Kanal translated a telephonic interview with officers from the Ministry of Internal Affairs , during which the existence of any cloud whatsoever was firmly denied. Immediately after the interview , a press conference by the mayor of Kiev , Mr. Leonid Chernovezkij, announced that starting next Monday a daily report about the movements of the cloud will be available to the population. The service will be provided by the Kiev administration. In an interview with TV channel UT-1 , an officer of the ecological service admitted that they have no real data about the area closer to the accident, because not even government officers are permitted to reach it. The officer said that most data about the hypothetical movements of the cloud (if the cloud exists) are made based on computer simulations they receive from Russian vendors, because no such simulation model is currently available in the Ukraine. The closest available on spot measures are taken in areas located several kilometers away from the epicentre. Removal operation In the same press release , the Mayor of Kiev also announced that no transport of any dangerous material will be allowed in the town area. The removal by railway of the phosphor containers involved in the accident was originally planned for today. It is unclear how Kiev\u2019s transit refusal may affect this operation, or whether the mayor has the authority to block national traffic on the railways. According to the Press Manager of the Ministery for Emergency Situations, Mr. Igor Krol', four containers will be lifted and put back on the rails today. Five containers have already been righted. However, weather may affect the operations, as violent storms and very strong winds are expected in the area. This is going to introduce a serious risk factor for the phosphor that still remains on the ground. The contaminating products are currently insulated from the air by means of pillows made of air and foam; a strong wind may cause new emergencies by even just partially removing such insulation structures. Yushchenko issued an official call to speed up the closure of the Chernobyl atomic power plants on July 20. Immediately afterwards, he left the country with his family for an unofficial visit to Poland, which will be followed by an official visit to Germany. He is expected to travel to Germany on the evening of July 21. The Ukraine Procuror General, Mr. Aleksandr Medvedenko, declared to the press that he has visited the accident site together with the President, and that all necessary measures are being taken, both for the cleanup of the accident and the defense of the civilian population. He notes that \"it takes courage to work there, for the personnel of the Ministry for Emergency Situations\". He announces that a complex cycle of medical care is being planned for about 1500 children of the affected area. In the same interview , the Procuror General announced that the Government of Kazakhstan will accept the phosphor still remaining (the goods were originally from Kazakhstan). However, in the same time period, the director of Kazphosphat (the vendor of the materials) declared in an interview to the newspaper Segodnja that he gathers that \"the phosphor will be stocked in the Ukraine, because it makes no sense to transfer it back. Moreover, you can hardly imagine that Russia would accept the passage of such a dangerous damaged load on their railways\".", "edit_actions": [{"type": "R", "before": "nobody", "after": "no one", "start_char_pos": 161, "end_char_pos": 167}, {"type": "R", "before": "reach", "after": "enter", "start_char_pos": 184, "end_char_pos": 189}, {"type": "R", "before": "intoxication", "after": "injury", "start_char_pos": 275, "end_char_pos": 287}, {"type": "A", "before": null, "after": ",", "start_char_pos": 533, "end_char_pos": 533}, {"type": "R", "before": "is", "after": "was", "start_char_pos": 585, "end_char_pos": 587}, {"type": "A", "before": null, "after": ",", "start_char_pos": 635, "end_char_pos": 635}, {"type": "R", "before": "Kiev mayor", "after": "the mayor of Kiev", "start_char_pos": 658, "end_char_pos": 668}, {"type": "R", "before": "announces", "after": "announced", "start_char_pos": 696, "end_char_pos": 705}, {"type": "D", "before": "same", "after": null, "start_char_pos": 774, "end_char_pos": 778}, {"type": "R", "before": "to", "after": "with", "start_char_pos": 895, "end_char_pos": 897}, {"type": "A", "before": null, "after": ",", "start_char_pos": 914, "end_char_pos": 914}, {"type": "R", "before": "related to", "after": "taken in", "start_char_pos": 1381, "end_char_pos": 1391}, {"type": "A", "before": null, "after": ",", "start_char_pos": 1494, "end_char_pos": 1494}, {"type": "R", "before": "whatever", "after": "any", "start_char_pos": 1549, "end_char_pos": 1557}, {"type": "R", "before": "\u2019s", "after": "is", "start_char_pos": 1723, "end_char_pos": 1725}, {"type": "R", "before": "the operationand", "after": "this operation, or", "start_char_pos": 1772, "end_char_pos": 1788}, {"type": "R", "before": "lifted. Yet the", "after": "righted. However,", "start_char_pos": 2056, "end_char_pos": 2071}, {"type": "R", "before": "in fact", "after": "currently", "start_char_pos": 2304, "end_char_pos": 2311}, {"type": "D", "before": ",", "after": null, "start_char_pos": 2581, "end_char_pos": 2582}, {"type": "R", "before": "after", "after": "afterwards,", "start_char_pos": 2599, "end_char_pos": 2604}, {"type": "R", "before": "that", "after": "which", "start_char_pos": 2676, "end_char_pos": 2680}, {"type": "R", "before": "declares", "after": "declared", "start_char_pos": 2850, "end_char_pos": 2858}, {"type": "R", "before": "liquidation", "after": "cleanup", "start_char_pos": 3001, "end_char_pos": 3012}, {"type": "A", "before": null, "after": ",", "start_char_pos": 3316, "end_char_pos": 3316}, {"type": "R", "before": "announces", "after": "announced", "start_char_pos": 3338, "end_char_pos": 3347}, {"type": "R", "before": "being returned the phosphor left", "after": "the phosphor still remaining", "start_char_pos": 3394, "end_char_pos": 3426}, {"type": "R", "before": "Yet", "after": "However,", "start_char_pos": 3472, "end_char_pos": 3475}, {"type": "R", "before": "hours", "after": "time period,", "start_char_pos": 3488, "end_char_pos": 3493}, {"type": "R", "before": ") declares", "after": "of the materials) declared", "start_char_pos": 3534, "end_char_pos": 3544}], "sents_char_pos": [0, 150, 212, 330, 423, 602, 821, 878, 1091, 1337, 1449, 1610, 1719, 1867, 2021, 2063, 2172, 2272, 2376, 2476, 2730, 2793, 3072, 3180, 3293, 3471, 3700]} {"doc_id": "74873", "revision_depth": "1", "before_revision": "On Thursday 21 year old actress Lindsay Lohan accompanied by her attorney turned herself into the Beverly Hills Police Department on a misdemeanor charge of hit-and-run and driving under the influence. Lohan crashed her 2005 Mercedes SL-65 into a curb on Sunset Boulevard then was driven to a Century City hospital in a friends carwith minor injuries from the accident . The Beverly Hills Police tracked her down at the hospital where they check her blood-alcohol level that was above California's 0.08 percent legal limit but the police would not disclose what level Lohan's blood-alcohol was. On Thursday she was fingerprinted,photographed given a 30,000 dollar bond and schedule a court date for August 24. After the crash Lohan checked in to a rehabilitation center for 45 days this is the second round of rehabilitation this year ", "after_revision": "Lindsay Lohan at the Calvin Klein Spring 2007 Fashion Show afterparty. On Thursday afternoon, 21-year-old actress Lindsay Lohan turned herself in to the Beverly Hills Police Department to face charges of misdemeanor hit-and-run and the suspicion of driving under the influence. Accompanied by her lawyer, Lohan was fingerprinted and photographed by police. On May 26 of this year, Lohan had crashed her car into a curb and hedge on Sunset Boulevard and received minor injuries. She was then driven to a Century City hospital in a friend's car . The Beverly Hills Police tracked her down at the hospital where they checked her blood-alcohol level , which was found to be above California's 0.08 percent legal limit , although the police would not disclose what level Lohan's blood-alcohol was. After the crash , Lohan checked herself into a rehabilitation center for a 45-day stay, which was her second round of rehabilitation this year . A court date has been scheduled for August 24, 2007.", "edit_actions": [{"type": "R", "before": "On Thursday 21 year old", "after": "Lindsay Lohan at the Calvin Klein Spring 2007 Fashion Show afterparty. On Thursday afternoon, 21-year-old", "start_char_pos": 0, "end_char_pos": 23}, {"type": "R", "before": "accompanied by her attorney turned herself into", "after": "turned herself in to", "start_char_pos": 46, "end_char_pos": 93}, {"type": "R", "before": "on a misdemeanor charge of", "after": "to face charges of misdemeanor", "start_char_pos": 130, "end_char_pos": 156}, {"type": "A", "before": null, "after": "the suspicion of", "start_char_pos": 173, "end_char_pos": 173}, {"type": "R", "before": "Lohan crashed her 2005 Mercedes SL-65", "after": "Accompanied by her lawyer, Lohan was fingerprinted and photographed by police.", "start_char_pos": 203, "end_char_pos": 240}, {"type": "A", "before": null, "after": "On May 26 of this year, Lohan had crashed her car", "start_char_pos": 241, "end_char_pos": 241}, {"type": "A", "before": null, "after": "and hedge", "start_char_pos": 254, "end_char_pos": 254}, {"type": "R", "before": "then was", "after": "and received minor injuries. She was then", "start_char_pos": 275, "end_char_pos": 283}, {"type": "R", "before": "friends carwith minor injuries from the accident", "after": "friend's car", "start_char_pos": 323, "end_char_pos": 371}, {"type": "R", "before": "check", "after": "checked", "start_char_pos": 443, "end_char_pos": 448}, {"type": "R", "before": "that was", "after": ", which was found to be", "start_char_pos": 473, "end_char_pos": 481}, {"type": "R", "before": "but", "after": ", although", "start_char_pos": 526, "end_char_pos": 529}, {"type": "D", "before": "On Thursday she was fingerprinted,photographed given a 30,000 dollar bond and schedule a court date for August 24.", "after": null, "start_char_pos": 598, "end_char_pos": 712}, {"type": "R", "before": "Lohan checked in to", "after": ", Lohan checked herself into", "start_char_pos": 729, "end_char_pos": 748}, {"type": "R", "before": "45 days this is the", "after": "a 45-day stay, which was her", "start_char_pos": 777, "end_char_pos": 796}, {"type": "A", "before": null, "after": ".", "start_char_pos": 838, "end_char_pos": 838}, {"type": "A", "before": null, "after": "A court date has been scheduled for August 24, 2007.", "start_char_pos": 839, "end_char_pos": 839}], "sents_char_pos": [0, 202, 373, 597, 712]} {"doc_id": "75336", "revision_depth": "1", "before_revision": "__NOTOC__ Regions of the Empire State Games