Datasets:

wanyu

/

IteraTeR_full_doc

like 1

[ { "type": "A", "before": null, "after": "the", "start_char_pos": 51, "end_char_pos": 51 }, { "type": "R", "before": "driven by a class of additive processes. Additive processes are time-inhomogeneous Levy processes, or equivalently, processes with independent but inhomogeneous increments", "after": "in a hyper-exponential additive model with piecewise constant parameters", "start_char_pos": 89, "end_char_pos": 260 }, { "type": "D", "before": "of an additive process with hyper-exponential jumps", "after": null, "start_char_pos": 346, "end_char_pos": 397 }, { "type": "R", "before": "Wiener- Hopf", "after": "Wiener-Hopf", "start_char_pos": 461, "end_char_pos": 473 }, { "type": "R", "before": "Laplace(-Fourier) transforms of", "after": "Laplace-Fourier transforms of the", "start_char_pos": 550, "end_char_pos": 581 }, { "type": "D", "before": "digital and", "after": null, "start_char_pos": 603, "end_char_pos": 614 }, { "type": "A", "before": null, "after": "a", "start_char_pos": 635, "end_char_pos": 635 }, { "type": "D", "before": "model is simultaneously calibrated to Stoxx50E call options at four different maturities and subsequently", "after": null, "start_char_pos": 664, "end_char_pos": 769 }, { "type": "R", "before": ". Comparison with Monte Carlo simulation results shows", "after": "for a set of parameters obtained by a simultaneous calibration to Stoxx50E call options across strikes and four different maturities. By comparing the results with Monte-Carlo simulations, we show", "start_char_pos": 855, "end_char_pos": 909 } ]

[ 0, 129, 262, 399, 488, 631 ]

[ { "type": "A", "before": null, "after": "This work generalises the model of", "start_char_pos": 511, "end_char_pos": 511 }, { "type": "A", "before": null, "after": "Phys. Rev. Lett., 101, 118104", "start_char_pos": 512, "end_char_pos": 512 }, { "type": "A", "before": null, "after": "to a broader class of linear feedback systems.", "start_char_pos": 514, "end_char_pos": 514 }, { "type": "R", "before": "general", "after": "complete analytical", "start_char_pos": 528, "end_char_pos": 535 }, { "type": "R", "before": "and for the flip time (persistence ) distributions for this model switch", "after": "for the general case where the enzyme can mediate flipping in either direction. For this general case we also solve for the flip time distribution, making a connection to first passage and persistence problems in statistical physics", "start_char_pos": 637, "end_char_pos": 709 }, { "type": "R", "before": "We also", "after": "The occurrence of such a peak is analysed as a function of the parameter space. We present a new relation between the flip time distributions measured for two relevant choices of initial condition. We also introduce a new correlation measure to", "start_char_pos": 822, "end_char_pos": 829 } ]

[ 0, 132, 276, 510, 711, 821, 948, 1095, 1150 ]

[ { "type": "R", "before": "Sorting permutations by reversals and/or transpositions is an important genome rearrangement problem in computational molecular biology. From theoretical point of view, finding efficient algorithms for this problem and its variations are quite challenging. In this paper we consider", "after": "In this paper we study several variations of the", "start_char_pos": 0, "end_char_pos": 282 }, { "type": "A", "before": null, "after": "pancake flipping problem", "start_char_pos": 282, "end_char_pos": 282 }, { "type": "A", "before": null, "after": ", which is also well known as the problem of", "start_char_pos": 282, "end_char_pos": 282 }, { "type": "A", "before": null, "after": "sorting by prefix reversals", "start_char_pos": 282, "end_char_pos": 282 }, { "type": "A", "before": null, "after": ". We consider the variations in the sorting process by adding with prefix reversals other similar operations such as prefix transpositions and prefix transreversals. These type of sorting problems have applications in interconnection networks and computational biology. We first study", "start_char_pos": 282, "end_char_pos": 282 }, { "type": "R", "before": ", where a prefix reversal or a prefix transposition is applied always", "after": "and present a 3-approximation algorithm for this problem. Then we give a 2-approximation algorithm for sorting by prefix reversals and prefix transreversals. We also provide a 3-approximation algorithm for sorting by prefix reversals and prefix transpositions where the operations are always applied", "start_char_pos": 374, "end_char_pos": 443 }, { "type": "R", "before": "given permutation. For this problem we first present a 3-approximation algorithm, which performs close to 2 in practice.", "after": "permutation.", "start_char_pos": 474, "end_char_pos": 594 }, { "type": "D", "before": "consider the variation where a certain number of prefix reversals are forced to happen in the sorting process. Here we achieve an improved approximation ratio of (3-\\frac{3r", "after": null, "start_char_pos": 652, "end_char_pos": 825 }, { "type": "A", "before": null, "after": "show quantitatively how approximation ratios of our algorithms improve with the increase of", "start_char_pos": 855, "end_char_pos": 855 }, { "type": "R", "before": "that must happen in the sorting, when possible, and b(\\pi)\\geq 2r is the number of breakpoints in the given permutation. Again, in this variation our algorithm performs close to 1.6 in practice", "after": "applied by optimal algorithms. Finally, we present experimental results to support our analysis", "start_char_pos": 883, "end_char_pos": 1076 } ]

[ 0, 136, 256, 492, 594, 762, 1003 ]

[ { "type": "D", "before": "specify and", "after": null, "start_char_pos": 75, "end_char_pos": 86 }, { "type": "R", "before": "involve", "after": "require", "start_char_pos": 115, "end_char_pos": 122 }, { "type": "R", "before": "a", "after": "and evaluate a rejection-free", "start_char_pos": 195, "end_char_pos": 196 }, { "type": "R", "before": ", which", "after": ". The method", "start_char_pos": 296, "end_char_pos": 303 }, { "type": "R", "before": ". The method", "after": ", and it", "start_char_pos": 366, "end_char_pos": 378 }, { "type": "R", "before": "multivalent ligand-receptor interaction systems", "after": "interactions of an m-valent ligand with an n-valent cell-surface receptor", "start_char_pos": 521, "end_char_pos": 568 }, { "type": "R", "before": "reveal insights into ligand-receptor binding kinetics that are not available from previously developed equilibrium models", "after": "show that the rejection-free method is more efficient over wide parameter ranges than a related method that relies on rejection sampling", "start_char_pos": 590, "end_char_pos": 711 } ]

[ 0, 177, 367, 488 ]

[ { "type": "A", "before": null, "after": "multivalent", "start_char_pos": 29, "end_char_pos": 29 }, { "type": "R", "before": "difficult to simulate using methods that require explicit specification of a chemical reaction network.", "after": "simulated using a rule-based kinetic Monte Carlo method in which a rejection sampling strategy is used to generate reaction events. This method becomes inefficient when simulating aggregation processes with large biomolecular complexes.", "start_char_pos": 63, "end_char_pos": 166 }, { "type": "D", "before": "and evaluate", "after": null, "start_char_pos": 184, "end_char_pos": 196 }, { "type": "D", "before": "stochastic simulation", "after": null, "start_char_pos": 214, "end_char_pos": 235 }, { "type": "R", "before": ". The method has a computational cost independent of reaction network size, and it is based on sampling a set of chemical transformation classes defined by formal rules that characterize the interactions in a system. We", "after": ", and we", "start_char_pos": 313, "end_char_pos": 532 }, { "type": "R", "before": "interactions of an m-valent ligand with an n-valent cell-surface receptor", "after": "simple models for ligand-receptor interactions", "start_char_pos": 562, "end_char_pos": 635 }, { "type": "A", "before": null, "after": "performance of", "start_char_pos": 667, "end_char_pos": 667 }, { "type": "R", "before": "more efficient", "after": "equal to or better than that of the rejection method", "start_char_pos": 697, "end_char_pos": 711 }, { "type": "R", "before": "than a related method that relies on rejection sampling", "after": ", and the rejection-free method is more efficient for simulating systems in which aggregation is extensive. The rejection-free method reported here should be useful for simulating a variety of systems in which multisite molecular interactions yield large molecular aggregates", "start_char_pos": 739, "end_char_pos": 794 } ]

[ 0, 166, 314, 529 ]

[ { "type": "D", "before": "like", "after": null, "start_char_pos": 25, "end_char_pos": 29 }, { "type": "R", "before": "their steric interactions and", "after": "the steric interactions of the RNAPs and their", "start_char_pos": 238, "end_char_pos": 267 }, { "type": "A", "before": null, "after": "which we suggest here", "start_char_pos": 758, "end_char_pos": 758 } ]

[ 0, 184, 358, 573, 670 ]

[ { "type": "R", "before": "In this paper we", "after": "We", "start_char_pos": 0, "end_char_pos": 16 }, { "type": "A", "before": null, "after": "for a company", "start_char_pos": 74, "end_char_pos": 74 }, { "type": "R", "before": "drifted Brownian motion", "after": "Brownian motion with positive drift that is", "start_char_pos": 173, "end_char_pos": 196 }, { "type": "R", "before": "The objective", "after": "In this setting the objective of the company", "start_char_pos": 330, "end_char_pos": 343 }, { "type": "R", "before": "occurs", "after": "is taken to be", "start_char_pos": 450, "end_char_pos": 456 }, { "type": "R", "before": "hit", "after": "are", "start_char_pos": 560, "end_char_pos": 563 }, { "type": "R", "before": "regime", "after": "state", "start_char_pos": 617, "end_char_pos": 623 }, { "type": "R", "before": "explicitly characterize", "after": "provide an explicit characterization of", "start_char_pos": 717, "end_char_pos": 740 }, { "type": "R", "before": "some regime", "after": "one state", "start_char_pos": 849, "end_char_pos": 860 }, { "type": "R", "before": "in the case that", "after": "if", "start_char_pos": 937, "end_char_pos": 953 } ]

[ 0, 108, 329, 569, 796, 976 ]

[ { "type": "R", "before": "towards", "after": "toward", "start_char_pos": 291, "end_char_pos": 298 }, { "type": "D", "before": ",", "after": null, "start_char_pos": 385, "end_char_pos": 386 }, { "type": "A", "before": null, "after": "a", "start_char_pos": 577, "end_char_pos": 577 }, { "type": "R", "before": "datasets", "after": "data sets", "start_char_pos": 772, "end_char_pos": 780 }, { "type": "R", "before": "network", "after": "networks", "start_char_pos": 856, "end_char_pos": 863 }, { "type": "R", "before": "senate", "after": "Senate", "start_char_pos": 893, "end_char_pos": 899 }, { "type": "R", "before": "gene network which contains more than 4000 genes from", "after": "regulatory networks underlying 588 genes across", "start_char_pos": 939, "end_char_pos": 992 }, { "type": "D", "before": "Drosophila melanogaster", "after": null, "start_char_pos": 1011, "end_char_pos": 1034 }, { "type": "R", "before": "from", "after": "Drosophila melanogaster from the", "start_char_pos": 1035, "end_char_pos": 1039 } ]

[ 0, 158, 370, 687, 762 ]

[ { "type": "D", "before": "underlying", "after": null, "start_char_pos": 76, "end_char_pos": 86 }, { "type": "R", "before": "The latent roles or membership of the actors as determined by these dynamic links will also exhibit rich temporal phenomena, assuming a distinct role at one point while leaning more towards a second role at an another point. To capture this dynamic mixed membership in rewiring networks, we propose a state space", "after": "In this paper we propose a model-based approach to analyze what we will refer to as the dynamic tomography of such time-evolving networks. Our approach offers an intuitive but powerful tool to infer the semantic underpinnings of each actor, such as its social roles or biological functions, underlying the observed network topologies. Our model builds on earlier work on a", "start_char_pos": 136, "end_char_pos": 448 }, { "type": "R", "before": "which embeds an actor into a latent space and track its mixed membership in the latent space across time . We derived efficient approximate learning and inference algorithms for our model, and applied the learned models", "after": "for static networks, and the state-space model for tracking object trajectory. It overcomes a major limitation of many current network inference techniques, which assume that each actor plays a unique and invariant role that accounts for all its interactions with other actors; instead, our method models the role of each actor as a time-evolving mixed membership vector that allows actors to behave differently over time and carry out different roles/functions when interacting with different peers, which is closer to reality. We present an efficient algorithm for approximate inference and learning using our model; and we applied our model", "start_char_pos": 488, "end_char_pos": 707 }, { "type": "R", "before": ",", "after": "(i.e., the Sampson's network), a dynamic email communication network between the Enron employees,", "start_char_pos": 750, "end_char_pos": 751 }, { "type": "R", "before": "Drosophila melanogaster", "after": "fruit fly", "start_char_pos": 795, "end_char_pos": 818 }, { "type": "R", "before": "both", "after": "all", "start_char_pos": 860, "end_char_pos": 864 } ]

[ 0, 135, 360, 594, 856 ]

[ { "type": "R", "before": "Motivation: Recent advances in experimental techniques have generated large amounts of protein interaction data, producing networks containing large numbers of cellular proteins. Mathematically sound and robust foundations are needed for extensive,", "after": "In our previous publication, a framework for information flow in interaction networks based on random walks with damping was formulated with two fundamental modes: emitting and absorbing. While many other network analysis methods based on random walks or equivalent notions have been developed before and after our earlier work, one can show that they can all be mapped to one of the two modes. In addition to these two fundamental modes, a major strength of our earlier formalism was its accommodation of", "start_char_pos": 0, "end_char_pos": 248 }, { "type": "R", "before": "exploration of networks, integrating knowledge from different specializations and facilitating biological discovery. Results: Extending our earlier work, we present a theoretical construct, based on random walks, for modelling of information channels between selected points in interaction networks. The software implementation, called ITM Probe, can be used as network exploration and hypothesis forming tool.", "after": "directed information flow that yielded plausible and meaningful biological interpretation of protein functions and pathways. However, the directed flow from origins to destinations was induced via a potential function that was heuristic. Here, with a theoretically sound approach called the channel mode, we extend our earlier work for directed information flow. This is achieved by our newly constructed nonheuristic potential function that facilitates a purely probabilistic interpretation of the channel mode. For each network node, the channel mode combines the solutions of emitting and absorbing modes in the same context, producing what we call a channel tensor. The entries of the channel tensor at each node can be interpreted as the amount of flow passing through that node from an origin to a destination. Similarly to our earlier model, the channel mode encompasses damping as a free parameter that controls the locality of information flow.", "start_char_pos": 266, "end_char_pos": 676 }, { "type": "R", "before": "ITM Probe.Availability: www.ncbi.nlm.nih.gov/CBBresearch/qmbp/itm_probe", "after": "our new framework.", "start_char_pos": 789, "end_char_pos": 860 } ]

[ 0, 178, 382, 565, 676, 799 ]

[ { "type": "A", "before": null, "after": "Revised working paper V 1.1", "start_char_pos": 13, "end_char_pos": 13 }, { "type": "D", "before": "developed here", "after": null, "start_char_pos": 579, "end_char_pos": 593 }, { "type": "A", "before": null, "after": "both", "start_char_pos": 628, "end_char_pos": 628 }, { "type": "R", "before": "a more precise form of", "after": "more precise", "start_char_pos": 670, "end_char_pos": 692 }, { "type": "R", "before": "expansion", "after": "transformations", "start_char_pos": 708, "end_char_pos": 717 }, { "type": "R", "before": "and variance gamma", "after": ", variance gamma and normal. In the case of the normal distribution, the change of variables employed allows the sampling to take place to good accuracy based on a single rational approximation over a very wide range of the sample space. The avoidance of any branching statement may be of use in optimal GPU computations", "start_char_pos": 837, "end_char_pos": 855 } ]

[ 0, 170, 272, 440, 567 ]

[ { "type": "D", "before": "Revised working paper V 1.1", "after": null, "start_char_pos": 13, "end_char_pos": 40 }, { "type": "R", "before": "may be", "after": "is", "start_char_pos": 1126, "end_char_pos": 1132 }, { "type": "A", "before": null, "after": ", and we give example of branch-free normal quantiles that offer performance improvements in a GPU environment, while retaining the precision characteristics of well-known methods", "start_char_pos": 1168, "end_char_pos": 1168 } ]

[ 0, 197, 299, 467, 594, 730, 875, 1084 ]

[ { "type": "A", "before": null, "after": "Monte Carlo", "start_char_pos": 215, "end_char_pos": 215 }, { "type": "A", "before": null, "after": ". Comparisons are made on Nvidia Quadro and GTX 285 and 480 GPU cards", "start_char_pos": 1316, "end_char_pos": 1316 } ]

[ 0, 169, 272, 440, 567, 703, 848, 1057 ]

[ { "type": "R", "before": "A(z", "after": "Q(x", "start_char_pos": 96, "end_char_pos": 99 }, { "type": "R", "before": "z", "after": "x", "start_char_pos": 114, "end_char_pos": 115 }, { "type": "D", "before": "The method may also be regarded as providing both analytical and numerical bases for doing more precise Cornish-Fisher transformations.", "after": null, "start_char_pos": 582, "end_char_pos": 717 }, { "type": "A", "before": null, "after": "as it avoids the effect of", "start_char_pos": 1151, "end_char_pos": 1151 }, { "type": "A", "before": null, "after": "warp divergence", "start_char_pos": 1156, "end_char_pos": 1156 }, { "type": "R", "before": "example", "after": "examples", "start_char_pos": 1171, "end_char_pos": 1178 }, { "type": "A", "before": null, "after": "best", "start_char_pos": 1289, "end_char_pos": 1289 }, { "type": "R", "before": "Comparisons", "after": "We also offer models based on a low-probability of warp divergence. Comparisons of new and old forms", "start_char_pos": 1339, "end_char_pos": 1350 }, { "type": "R", "before": "Nvidia Quadro and", "after": "the Nvidia Quadro 4000,", "start_char_pos": 1363, "end_char_pos": 1380 }, { "type": "R", "before": "GPU cards", "after": ", and Tesla C2050 GPUs. We argue that in single-precision mode, the change-of-variables approach offers performance competitive with the fastest existing scheme while substantially improving precision, and that in double-precision mode, this approach offers the most GPU-optimal Gaussian quantile yet, and without compromise on precision for Monte Carlo applications, working twice as fast as the CUDA 4 library function with increased precision", "start_char_pos": 1397, "end_char_pos": 1406 } ]

[ 0, 172, 286, 454, 581, 717, 862, 1071, 1338 ]

[ { "type": "D", "before": "unifying approach with a", "after": null, "start_char_pos": 158, "end_char_pos": 182 }, { "type": "D", "before": "significantly", "after": null, "start_char_pos": 433, "end_char_pos": 446 } ]

[ 0, 144, 376 ]

[ { "type": "R", "before": "Credit", "after": "We present a new approach to understanding credit", "start_char_pos": 0, "end_char_pos": 6 }, { "type": "R", "before": "are studied for the structure and its temporal change from the year", "after": "and with this approach examine the temporal change in the structure of the Japanese credit network from", "start_char_pos": 63, "end_char_pos": 130 }, { "type": "D", "before": "to define", "after": null, "start_char_pos": 495, "end_char_pos": 504 } ]

[ 0, 144, 306, 417, 645 ]

[ { "type": "A", "before": null, "after": ",", "start_char_pos": 106, "end_char_pos": 106 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 130, "end_char_pos": 130 } ]

[ 0, 225, 387, 498, 716 ]

[ { "type": "R", "before": "formalize a", "after": "develop an algebraic framework for the description and analysis of financial behaviours, that is, behaviours that consist of transferring certain amounts of money at planned times. To a large extent, analysis of financial products amounts to analysis of such behaviours. We formalize the", "start_char_pos": 3, "end_char_pos": 14 }, { "type": "D", "before": "pure", "after": null, "start_char_pos": 74, "end_char_pos": 78 }, { "type": "R", "before": "to make financial issues relating to these products amenable to mathematical analysis. The formalization is given in a timed extension of tuplix calculus and abstracts from the idiosyncrasies of time measurement", "after": "by an equation in the framework developed and define a notion of financial product behaviour using this formalization", "start_char_pos": 138, "end_char_pos": 349 }, { "type": "R", "before": "use the timed tuplix calculus to show how wanted financial behaviours may profit from using pure financial products", "after": "present some properties of financial product behaviours", "start_char_pos": 360, "end_char_pos": 475 } ]

[ 0, 224, 351 ]

[ { "type": "R", "before": "Fokker-Planck equation for the probability distribution of the former. This has the form of diffusion equation with time-dependent diffusion coefficient, resulting in an anomalous diffusion. The diffusion", "after": "long time behavior of the mean square displacement. Anomalous diffusion is found where the diffusion", "start_char_pos": 244, "end_char_pos": 448 }, { "type": "D", "before": ". The diffusion exponent of the Weiss-Havlin comb model is derived as a special case, and the same exponent holds even for weakly coupled processes", "after": null, "start_char_pos": 550, "end_char_pos": 697 } ]

[ 0, 201, 314, 434, 551, 699, 798 ]

[ { "type": "R", "before": "processes with the friction coefficient depending", "after": "process whose friction coefficient depends", "start_char_pos": 104, "end_char_pos": 153 }, { "type": "D", "before": ",", "after": null, "start_char_pos": 192, "end_char_pos": 193 }, { "type": "R", "before": "behavior", "after": "behaviour", "start_char_pos": 255, "end_char_pos": 263 }, { "type": "R", "before": "where", "after": ". Since", "start_char_pos": 326, "end_char_pos": 331 }, { "type": "D", "before": "and", "after": null, "start_char_pos": 409, "end_char_pos": 412 }, { "type": "A", "before": null, "after": "also find that the coupling can lead to ergodic or non-ergodic behaviour of the studied process. We", "start_char_pos": 451, "end_char_pos": 451 }, { "type": "A", "before": null, "after": "coupled", "start_char_pos": 606, "end_char_pos": 606 }, { "type": "R", "before": "description", "after": "descriptions", "start_char_pos": 693, "end_char_pos": 704 } ]

[ 0, 202, 296, 447, 547 ]

[ { "type": "R", "before": "nonlinear", "after": "continuum", "start_char_pos": 2, "end_char_pos": 11 }, { "type": "R", "before": "distribution", "after": "frequency distributions", "start_char_pos": 175, "end_char_pos": 187 }, { "type": "R", "before": "the dependency network", "after": "both the in-directed and out-directed dependency networks", "start_char_pos": 200, "end_char_pos": 222 }, { "type": "R", "before": "is scale-free", "after": "follow Zipf's law", "start_char_pos": 238, "end_char_pos": 251 }, { "type": "A", "before": null, "after": ", as well as the weakest nodes,", "start_char_pos": 298, "end_char_pos": 298 }, { "type": "R", "before": "nonlinearity-induced saturation effect. This also distinguishes the two", "after": "saturation behaviour arising from the finiteness of semantic possibilities in the network. To preserve uniqueness of operations in the network, the nodes obey an \"exclusion principle\", with no two nodes being exactly alike in their functionality. The parameters related to finite-size behaviour make a quantitative distinction between the two", "start_char_pos": 338, "end_char_pos": 409 }, { "type": "R", "before": "from each other. The", "after": ". Dynamic evolution, over two generations of free software releases, shows that the saturation properties of the in-directed and out-directed networks are oppositely affected. For the out-degree distribution, whose top nodes form the foundation of the entire network, the", "start_char_pos": 459, "end_char_pos": 479 }, { "type": "R", "before": "the steady dependency distribution", "after": "a steady scale-free frequency distribution of nodes", "start_char_pos": 536, "end_char_pos": 570 }, { "type": "R", "before": "saturation properties of the mature scale-free network", "after": "finite limit to the number of top nodes that the mature out-directed network can have", "start_char_pos": 588, "end_char_pos": 642 } ]

[ 0, 164, 377, 475 ]

[ { "type": "R", "before": "A continuum model has been proposed to fit the data pertaining to the", "after": "We propose a continuum model for the degree distribution of", "start_char_pos": 0, "end_char_pos": 69 }, { "type": "R", "before": "While the", "after": "The", "start_char_pos": 122, "end_char_pos": 131 }, { "type": "R", "before": "the most richly linked nodes , as well as the most", "after": "but the heavily linked nodes and the", "start_char_pos": 269, "end_char_pos": 319 }, { "type": "D", "before": ",", "after": null, "start_char_pos": 340, "end_char_pos": 341 }, { "type": "D", "before": "Dynamic evolution of free software releases shows that the finite-size properties of the in-directed and out-directed networks are opposite in nature.", "after": null, "start_char_pos": 509, "end_char_pos": 659 }, { "type": "D", "before": "also", "after": null, "start_char_pos": 739, "end_char_pos": 743 }, { "type": "R", "before": "rich", "after": "the most heavily liked", "start_char_pos": 781, "end_char_pos": 785 }, { "type": "D", "before": "mature", "after": null, "start_char_pos": 801, "end_char_pos": 807 }, { "type": "A", "before": null, "after": "finally", "start_char_pos": 833, "end_char_pos": 833 }, { "type": "R", "before": "each passing", "after": "every", "start_char_pos": 903, "end_char_pos": 915 }, { "type": "R", "before": "finite", "after": "terminal", "start_char_pos": 995, "end_char_pos": 1001 } ]

[ 0, 121, 398, 508, 659, 839 ]

[ { "type": "R", "before": "the prices of spread options and the put-call symmetry property", "after": "prices of some basket options", "start_char_pos": 174, "end_char_pos": 237 }, { "type": "A", "before": null, "after": "put-call symmetry property and the", "start_char_pos": 264, "end_char_pos": 264 }, { "type": "R", "before": "multiasset", "after": "multi-asset", "start_char_pos": 449, "end_char_pos": 459 } ]

[ 0, 127, 301, 389 ]

[ { "type": "R", "before": ". Preferences of", "after": "and preferences of both", "start_char_pos": 89, "end_char_pos": 105 }, { "type": "D", "before": "of", "after": null, "start_char_pos": 121, "end_char_pos": 123 }, { "type": "R", "before": "often", "after": "possibly even", "start_char_pos": 163, "end_char_pos": 168 }, { "type": "A", "before": null, "after": "the", "start_char_pos": 317, "end_char_pos": 317 }, { "type": "R", "before": "influence of correlations", "after": "impact of correlations on the system", "start_char_pos": 453, "end_char_pos": 478 } ]

[ 0, 182, 305 ]

[ { "type": "R", "before": "network management and control", "after": "the network", "start_char_pos": 546, "end_char_pos": 576 }, { "type": "R", "before": "We", "after": "The resulting framework is a complex multiobjective optimization problem that can be efficiently solved through existing multiobjective search techniques. In this contribution, we", "start_char_pos": 708, "end_char_pos": 710 }, { "type": "R", "before": "as performance criteria for the network", "after": ". The aim of this paper is to present the framework and hence for conciseness purposes, the multiobjective optimization search is not developed herein", "start_char_pos": 822, "end_char_pos": 861 } ]

[ 0, 204, 502, 707 ]

[ { "type": "R", "before": "in which", "after": "based on", "start_char_pos": 69, "end_char_pos": 77 }, { "type": "R", "before": "non-topological state variables associated with nodesplay a crucial role. This", "after": "on nontopological properties of nodes. We show how the", "start_char_pos": 124, "end_char_pos": 202 }, { "type": "R", "before": "this paper, we show how", "after": "particular,", "start_char_pos": 308, "end_char_pos": 331 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 409, "end_char_pos": 409 }, { "type": "R", "before": "is", "after": "are", "start_char_pos": 433, "end_char_pos": 435 }, { "type": "R", "before": "in", "after": ", focusing on", "start_char_pos": 562, "end_char_pos": 564 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 733, "end_char_pos": 733 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 957, "end_char_pos": 957 }, { "type": "R", "before": "This result has", "after": "Interestingly, the exact opposite is observed for European countries. These results have", "start_char_pos": 1013, "end_char_pos": 1028 }, { "type": "R", "before": ", as it is", "after": "as they are", "start_char_pos": 1058, "end_char_pos": 1068 } ]

[ 0, 197, 304, 488, 616, 822, 1012 ]

[ { "type": "D", "before": "(AY)", "after": null, "start_char_pos": 32, "end_char_pos": 36 }, { "type": "R", "before": "AY", "after": "Azema-Yor", "start_char_pos": 483, "end_char_pos": 485 }, { "type": "R", "before": "AY", "after": "Azema-Yor", "start_char_pos": 544, "end_char_pos": 546 }, { "type": "R", "before": "Further,", "after": "Secondly", "start_char_pos": 600, "end_char_pos": 608 }, { "type": "R", "before": "AY", "after": "Azema-Yor", "start_char_pos": 628, "end_char_pos": 630 }, { "type": "A", "before": null, "after": "We establish relations between Average Value at Risk, Drawdown function, Hardy-Littlewood transform and its generalised inverse.", "start_char_pos": 720, "end_char_pos": 720 }, { "type": "R", "before": "AY", "after": "Azema-Yor", "start_char_pos": 749, "end_char_pos": 751 }, { "type": "R", "before": "AY", "after": "Azema-Yor", "start_char_pos": 827, "end_char_pos": 829 }, { "type": "R", "before": "prove new optimal properties of AY martingales relative to", "after": "characterise Azema-Yor martingales showing they are optimal relative to the", "start_char_pos": 887, "end_char_pos": 945 }, { "type": "R", "before": "laws of martingales", "after": "variables among martingales whose maximum dominates stochastically a given benchmark", "start_char_pos": 975, "end_char_pos": 994 } ]

[ 0, 128, 284, 400, 494, 599, 719, 874 ]

[ { "type": "R", "before": "an", "after": "a", "start_char_pos": 818, "end_char_pos": 820 }, { "type": "R", "before": "n-step", "after": "k-step", "start_char_pos": 1074, "end_char_pos": 1080 }, { "type": "D", "before": ". A further technical contribution of the paper is an advance in the theory of n-step Fibonacci sums for which a prior reference result was missing", "after": null, "start_char_pos": 1214, "end_char_pos": 1361 } ]

[ 0, 216, 546, 707, 814, 1058, 1215 ]

[ { "type": "R", "before": "a firm", "after": "firms", "start_char_pos": 518, "end_char_pos": 524 }, { "type": "R", "before": "productivity", "after": "output", "start_char_pos": 647, "end_char_pos": 659 }, { "type": "R", "before": "study four models including the variants", "after": "employ four models for the production copula, that is, trivariate versions", "start_char_pos": 1023, "end_char_pos": 1063 }, { "type": "R", "before": ", Clayton copulas and find that the", "after": "and survival Clayton and", "start_char_pos": 1081, "end_char_pos": 1116 }, { "type": "R", "before": "Gumbel copula describes the data distribution and correlation very accurately", "after": "trivariate Gumbel; the last one works best", "start_char_pos": 1134, "end_char_pos": 1211 } ]

[ 0, 80, 319, 389, 460, 577, 697, 805, 1019 ]

[ { "type": "R", "before": "Levy", "after": "L\\'{e", "start_char_pos": 69, "end_char_pos": 73 }, { "type": "R", "before": "non-degenerate", "after": "nondegenerate", "start_char_pos": 198, "end_char_pos": 212 }, { "type": "R", "before": "Levy", "after": "L\\'{e", "start_char_pos": 261, "end_char_pos": 265 }, { "type": "R", "before": "is smooth in the continuation region for problems with either finite or infinite variation jumps . Moreover", "after": "of problems on an unbounded domain with infinite activity jumps is W^{2,1", "start_char_pos": 316, "end_char_pos": 423 }, { "type": "R", "before": "is shown via the global regularity of the value function", "after": "holds and the value function is C^{2,1", "start_char_pos": 450, "end_char_pos": 506 } ]

[ 0, 146, 414 ]

[ { "type": "A", "before": null, "after": "obstacle", "start_char_pos": 326, "end_char_pos": 326 }, { "type": "D", "before": ". As a result, the smooth-fit property holds and the value function is C^{2,1", "after": null, "start_char_pos": 408, "end_char_pos": 485 } ]

[ 0, 150 ]

[ { "type": "R", "before": "infinite activity jumps is", "after": "finite/infinite variation jumps is in", "start_char_pos": 372, "end_char_pos": 398 }, { "type": "A", "before": null, "after": ". As a consequence, the smooth-fit property holds", "start_char_pos": 416, "end_char_pos": 416 } ]

[ 0, 150 ]

[ { "type": "R", "before": "a process with L\\'{e", "after": "jump diffusions", "start_char_pos": 54, "end_char_pos": 74 }, { "type": "A", "before": null, "after": "that", "start_char_pos": 151, "end_char_pos": 151 }, { "type": "R", "before": "obstacle problems", "after": "this optimal stopping problem", "start_char_pos": 318, "end_char_pos": 335 }, { "type": "A", "before": null, "after": "with p\\in(1, \\infty)", "start_char_pos": 419, "end_char_pos": 419 } ]

[ 0, 141 ]

[ { "type": "R", "before": "In this manual , we describe how to use the software together with COMSOL Multiphysics 3.4 and Matlab to set up simulations. We provide a detailed account of the code structure and of the available interfaces. This makes modifications and extensions of the code possible. We also give two detailed examples, in which we describe the process of simulating and visualizing two models from the systems biology literature in a step-by-step manner", "after": "This manual describes version 1.1 of the software", "start_char_pos": 475, "end_char_pos": 917 } ]

[ 0, 125, 271, 474, 599, 684, 746 ]

[ { "type": "D", "before": "(NSM)", "after": null, "start_char_pos": 326, "end_char_pos": 331 }, { "type": "R", "before": "the", "after": "a", "start_char_pos": 402, "end_char_pos": 405 }, { "type": "R", "before": "1.1", "after": "1.2", "start_char_pos": 506, "end_char_pos": 509 }, { "type": "A", "before": null, "after": ". URDME 1.2 includes support for Comsol Multiphysics 4.1, 4.2, 4.3 as well as the previous version 3.5a. Additionally, support for basic SBML has been added along with the possibility to compile in stand-alone mode", "start_char_pos": 526, "end_char_pos": 526 } ]

[ 0, 125, 271, 475 ]

[ { "type": "R", "before": "1.2", "after": "1.3", "start_char_pos": 497, "end_char_pos": 500 }, { "type": "R", "before": "1.2", "after": "1.3", "start_char_pos": 524, "end_char_pos": 527 }, { "type": "R", "before": "4.1, 4.2, 4.3 as well as the previous version 3.5a. Additionally, support for basic SBML has been added along with the possibility to compile in stand-alone mode", "after": "5.x and PDE Toolbox version 1.5 and above", "start_char_pos": 569, "end_char_pos": 730 } ]

[ 0, 125, 271, 466, 517, 620 ]

[ { "type": "R", "before": "1.3", "after": "1.4", "start_char_pos": 497, "end_char_pos": 500 }, { "type": "R", "before": "URDME 1.3 includes support for Comsol Multiphysics 5.x and PDE Toolbox version 1.5 and above", "after": "Refer to URL for the latest updates", "start_char_pos": 518, "end_char_pos": 610 } ]

[ 0, 125, 271, 466, 517 ]

[ { "type": "R", "before": "This incompatibility goes away by noticing that the model", "after": "The conflict can be understood on the basis that the multiplicative models", "start_char_pos": 417, "end_char_pos": 474 }, { "type": "R", "before": ", geometric Brownian motion, is a", "after": "are", "start_char_pos": 499, "end_char_pos": 532 }, { "type": "R", "before": "process, in the sense that", "after": "which leads to", "start_char_pos": 545, "end_char_pos": 571 }, { "type": "R", "before": "differ", "after": "differing", "start_char_pos": 597, "end_char_pos": 603 }, { "type": "R", "before": "a single realization", "after": "single realizations", "start_char_pos": 633, "end_char_pos": 653 }, { "type": "R", "before": "papers on portfolio theoryuse ensemble-average returns. The", "after": "treatments, from the very beginning of probability theory, use ensemble-averages, whereas the", "start_char_pos": 668, "end_char_pos": 727 }, { "type": "A", "before": null, "after": "time-averages. Maximizing the", "start_char_pos": 768, "end_char_pos": 768 }, { "type": "R", "before": "returns. The averages differ by a logarithm. In portfolio theory this logarithm can be implemented as a logarithmic utility function. It is important to distinguish between effects of non-ergodicity and genuine utility constraints. For instance,", "after": "growth rates for an investment defines an optimal leverage, whereas growth rates derived from", "start_char_pos": 782, "end_char_pos": 1027 }, { "type": "R", "before": "This", "after": "The latter", "start_char_pos": 1082, "end_char_pos": 1086 }, { "type": "R", "before": "returns", "after": "growth", "start_char_pos": 1185, "end_char_pos": 1192 }, { "type": "A", "before": null, "after": ". The Sharpe ratio is insensitive to leverage. Its relation to optimal leverage is discussed", "start_char_pos": 1222, "end_char_pos": 1222 } ]

[ 0, 157, 273, 416, 655, 723, 790, 826, 915, 1013, 1081, 1224 ]

[ { "type": "R", "before": "biogenic force generators acting in the nanometer range", "after": "single macromolecules that generate forces at the piconewton range and nanometer scale", "start_char_pos": 21, "end_char_pos": 76 }, { "type": "R", "before": "and move", "after": "by moving", "start_char_pos": 129, "end_char_pos": 137 }, { "type": "R", "before": "research, we will discuss", "after": "paper, we study", "start_char_pos": 176, "end_char_pos": 201 }, { "type": "R", "before": "molecular motors, in", "after": "two-head molecular motors in the", "start_char_pos": 218, "end_char_pos": 238 }, { "type": "R", "before": "Our network modelis based on the distinct mechanochemical states of molecular motors. It can be regarded as", "after": "The network model,", "start_char_pos": 286, "end_char_pos": 393 }, { "type": "R", "before": "one used by Steffen Liepelt and Reinhard", "after": "recently work of Liepelt and", "start_char_pos": 418, "end_char_pos": 458 }, { "type": "R", "before": ". The method used in this research is similar as the one used by Michael E. Fisher and Anatoly B. Kolomeisky", "after": ", is based on the discrete mechanochemical states of a molecular motor with multiple cycles. By generalizing the mathematical method developed by Fisher and Kolomeisky for single cycle motor", "start_char_pos": 492, "end_char_pos": 600 }, { "type": "R", "before": ". Generally, the formulation of the velocity of molecular motors can be obtained", "after": ", we are able to obtain an explicit formula for the velocity of a molecular motor", "start_char_pos": 632, "end_char_pos": 712 } ]

[ 0, 78, 167, 285, 371, 567, 633 ]

[ { "type": "R", "before": "standard", "after": "prevailing", "start_char_pos": 163, "end_char_pos": 171 }, { "type": "R", "before": "LDs", "after": "LD", "start_char_pos": 312, "end_char_pos": 315 }, { "type": "R", "before": "Relying on this mechanism, we have", "after": "Mathematically, LD were modeled as spherical protuberances in an otherwise planar ER membrane. We estimated the local phospholipid composition, and", "start_char_pos": 362, "end_char_pos": 396 }, { "type": "D", "before": "the", "after": null, "start_char_pos": 422, "end_char_pos": 425 }, { "type": "R", "before": "LDs. We", "after": "LD. Based on this model calculation, we", "start_char_pos": 480, "end_char_pos": 487 }, { "type": "R", "before": "de-mixing", "after": "demixing", "start_char_pos": 504, "end_char_pos": 513 }, { "type": "R", "before": "As a result of de-mixing", "after": "During demixing", "start_char_pos": 631, "end_char_pos": 655 }, { "type": "R", "before": ". This", "after": ", which", "start_char_pos": 726, "end_char_pos": 732 }, { "type": "R", "before": ", necessary for the creation of a lipid droplet, were driven or supported by the process of lipid de-mixing. In", "after": "was supported by or even driven by lipid demixing. In addition, we show that demixing is thermodynamically necessary as LD cannot bud-off otherwise. In", "start_char_pos": 783, "end_char_pos": 894 }, { "type": "R", "before": "LDs eventually detached from the ER at a critical", "after": "our model predicts a LD bud-off", "start_char_pos": 932, "end_char_pos": 981 }, { "type": "R", "before": "30-50 nm. We", "after": "13 nm. This diameter is far below the experimentally determined size of typical yeast LD. Thus, we", "start_char_pos": 1000, "end_char_pos": 1012 } ]

[ 0, 139, 361, 484, 630, 727, 891, 1009, 1112 ]

[ { "type": "R", "before": "infrastructure", "after": "multi-cell infrastructure", "start_char_pos": 54, "end_char_pos": 68 }, { "type": "R", "before": "distance", "after": "carrier sensing range", "start_char_pos": 154, "end_char_pos": 162 }, { "type": "R", "before": ", up to which carrier sensing is effective. The", "after": ". We argue that, the", "start_char_pos": 172, "end_char_pos": 219 }, { "type": "R", "before": "Physical (PHY)", "after": "physical", "start_char_pos": 438, "end_char_pos": 452 }, { "type": "R", "before": "cell level", "after": "cell level", "start_char_pos": 481, "end_char_pos": 491 }, { "type": "R", "before": "transfers", "after": "downloads", "start_char_pos": 586, "end_char_pos": 595 }, { "type": "R", "before": "ns-2", "after": "ns-2", "start_char_pos": 659, "end_char_pos": 663 }, { "type": "D", "before": "also", "after": null, "start_char_pos": 885, "end_char_pos": 889 }, { "type": "R", "before": "static", "after": "static", "start_char_pos": 946, "end_char_pos": 952 }, { "type": "R", "before": "Nash equilibria in pure strategies", "after": "Nash equilibria in pure strategies", "start_char_pos": 990, "end_char_pos": 1024 }, { "type": "D", "before": "normalized network throughput", "after": null, "start_char_pos": 1065, "end_char_pos": 1094 }, { "type": "R", "before": "in", "after": "normalized network throughput. Our channel assignment algorithm requires neither any explicit knowledge of the topology nor any message passing, and provides assignments in only", "start_char_pos": 1095, "end_char_pos": 1097 }, { "type": "R", "before": "throughput metric", "after": "throughput metric", "start_char_pos": 1221, "end_char_pos": 1238 } ]

[ 0, 87, 215, 458, 597, 676, 825, 1134 ]

[ { "type": "R", "before": "generic", "after": "cognitive", "start_char_pos": 17, "end_char_pos": 24 }, { "type": "R", "before": "quantum linear", "after": "linear quantum", "start_char_pos": 181, "end_char_pos": 195 }, { "type": "A", "before": null, "after": "Keywords: Option price modelling, Quantum neural computation, nonlinear Schr\\\"odinger equations, leverage effect, bidirectional associative memory", "start_char_pos": 794, "end_char_pos": 794 } ]

[ 0, 106, 323, 676 ]

[ { "type": "R", "before": "After reviewing the strengthened hypotheses of the Shannon-MacMillan-Breiman Theorem, versus the standard statement of the Noiseless Coding Theorem, we state and prove a similar result for relative information , otherwise known as information gain. If the gain results from receiving a side message, this gain, when averaged over the ensemble of possible side messages, is precisely the pragmatic information defined in Weinberger (", "after": "This paper is part of an ongoing investigation of \"pragmatic information\", defined in Weinberger (", "start_char_pos": 0, "end_char_pos": 432 }, { "type": "R", "before": "). The relative information result proven herein can be used to extend the", "after": ") as \"the amount of information actually used in making a decision\". Because a study of information rates led to the Noiseless and Noisy Coding Theorems, two of the most important results of Shannon's theory, we begin the paper by defining a pragmatic information rate, showing that all of the relevant limits make sense, and interpreting them as the improvement in compression obtained from using the correct distribution of transmitted symbols. The first of two applications of the theory extends the", "start_char_pos": 438, "end_char_pos": 512 }, { "type": "D", "before": "an analysis of securities market trading strategies presented in Cover and Thomas (1992). We show, in particular, that their results for statistically independent horse races also apply", "after": null, "start_char_pos": 608, "end_char_pos": 793 }, { "type": "R", "before": "ergodic", "after": "stationary", "start_char_pos": 902, "end_char_pos": 909 }, { "type": "R", "before": "Also, if", "after": "If", "start_char_pos": 980, "end_char_pos": 988 }, { "type": "R", "before": "can be interpreted as", "after": "is bounded by", "start_char_pos": 1131, "end_char_pos": 1152 }, { "type": "R", "before": "Both the theorem proven herein and the application to trading make a compelling case for Weinberger's definition of pragmatic information", "after": "A second application is to the question of market efficiency. An efficient market is, by definition, a market in which the pragmatic information of the \"tradable past\" with respect to current prices is zero. Under this definition, markets whose returns are characterized by a GARCH(1,1) process cannot be efficient. Finally, a pragmatic informational analogue to Shannon's Noisy Coding Theorem suggests that a cause of market inefficiency is that the underlying fundamentals are changing so fast that the price discovery mechanism simply cannot keep up. This may happen most readily in the run-up to a financial bubble, where investors' willful ignorance degrade the information processing capabilities of the market", "start_char_pos": 1196, "end_char_pos": 1333 } ]

[ 0, 248, 440, 697, 979, 1195 ]

[ { "type": "R", "before": "\"", "after": "``", "start_char_pos": 440, "end_char_pos": 441 }, { "type": "R", "before": "\"", "after": "''", "start_char_pos": 461, "end_char_pos": 462 } ]

[ 0, 189, 510, 735, 808, 886, 955 ]

[ { "type": "R", "before": "``", "after": "\"", "start_char_pos": 663, "end_char_pos": 665 }, { "type": "R", "before": "''", "after": "\"", "start_char_pos": 688, "end_char_pos": 690 } ]

[ 0, 70, 283, 386, 616, 831, 934, 1050, 1169, 1304 ]

[ { "type": "R", "before": "\"", "after": "``", "start_char_pos": 663, "end_char_pos": 664 }, { "type": "R", "before": "\"", "after": "''", "start_char_pos": 687, "end_char_pos": 688 } ]

[ 0, 70, 283, 386, 616, 829, 932, 1048, 1167, 1302 ]

[ { "type": "R", "before": "flavonoid", "after": "flavonoids", "start_char_pos": 35, "end_char_pos": 44 }, { "type": "R", "before": "Flavonoid is", "after": "Flavonoids are", "start_char_pos": 112, "end_char_pos": 124 }, { "type": "R", "before": "was", "after": "were", "start_char_pos": 169, "end_char_pos": 172 }, { "type": "R", "before": "a chemical marker to understand", "after": "chemical markers for understanding", "start_char_pos": 192, "end_char_pos": 223 }, { "type": "R", "before": "between", "after": "among", "start_char_pos": 410, "end_char_pos": 417 }, { "type": "R", "before": "power law", "after": "power-law", "start_char_pos": 440, "end_char_pos": 449 } ]

[ 0, 111, 277, 564, 691, 831 ]

[ { "type": "A", "before": null, "after": "economic", "start_char_pos": 96, "end_char_pos": 96 }, { "type": "R", "before": "is extended to", "after": "has an extension that can be numerically represented by", "start_char_pos": 515, "end_char_pos": 529 }, { "type": "D", "before": "maximization", "after": null, "start_char_pos": 559, "end_char_pos": 571 }, { "type": "R", "before": "discuss the previous in", "after": "treat the case of", "start_char_pos": 582, "end_char_pos": 605 }, { "type": "R", "before": "optional measures with unit mass enables one", "after": "unit-mass optional measures enables", "start_char_pos": 745, "end_char_pos": 789 }, { "type": "D", "before": "completely", "after": null, "start_char_pos": 848, "end_char_pos": 858 }, { "type": "R", "before": "random-time horizon", "after": "random time-horizon", "start_char_pos": 1003, "end_char_pos": 1022 } ]

[ 0, 133, 435, 573, 681, 916 ]

[ { "type": "R", "before": "numeraire-invariant", "after": "num\\'{e", "start_char_pos": 61, "end_char_pos": 80 }, { "type": "D", "before": ",", "after": null, "start_char_pos": 657, "end_char_pos": 658 }, { "type": "A", "before": null, "after": "us", "start_char_pos": 811, "end_char_pos": 811 }, { "type": "R", "before": "investment-consumption", "after": "investment--consumption", "start_char_pos": 836, "end_char_pos": 858 }, { "type": "R", "before": "numeraire", "after": "num\\'{e", "start_char_pos": 986, "end_char_pos": 995 } ]

[ 0, 141, 443, 608, 711, 927 ]

[ { "type": "R", "before": "which ultimately generates", "after": ", which ultimately generate", "start_char_pos": 91, "end_char_pos": 117 }, { "type": "R", "before": "cell", "after": "cells", "start_char_pos": 150, "end_char_pos": 154 }, { "type": "R", "before": "transition", "after": "transitions", "start_char_pos": 327, "end_char_pos": 337 }, { "type": "R", "before": "which naturally", "after": "controlling cell fate determination, which", "start_char_pos": 575, "end_char_pos": 590 }, { "type": "A", "before": null, "after": "directionality,", "start_char_pos": 668, "end_char_pos": 668 }, { "type": "D", "before": "directionality,", "after": null, "start_char_pos": 693, "end_char_pos": 708 }, { "type": "R", "before": "comprised of", "after": "comprising", "start_char_pos": 774, "end_char_pos": 786 }, { "type": "D", "before": "in principle", "after": null, "start_char_pos": 813, "end_char_pos": 825 }, { "type": "R", "before": "repressing irrelevant", "after": "sequentially repressing selected", "start_char_pos": 874, "end_char_pos": 895 }, { "type": "R", "before": ", channeling the dynamics in", "after": "restricting the dynamics to lower dimensional subspaces of", "start_char_pos": 914, "end_char_pos": 942 }, { "type": "R", "before": "phase spacethrough a simpler, lower dimensional subspace", "after": "state space", "start_char_pos": 964, "end_char_pos": 1020 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 1095, "end_char_pos": 1095 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 1186, "end_char_pos": 1186 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 1237, "end_char_pos": 1237 }, { "type": "D", "before": "in simulations", "after": null, "start_char_pos": 1287, "end_char_pos": 1301 }, { "type": "R", "before": "dynamical systems", "after": "the underlying dynamical system", "start_char_pos": 1418, "end_char_pos": 1435 }, { "type": "D", "before": ",", "after": null, "start_char_pos": 1590, "end_char_pos": 1591 } ]

[ 0, 339, 497, 736, 1022, 1303, 1437 ]

[ { "type": "R", "before": "Maximum Entropy", "after": "maximum entropy", "start_char_pos": 14, "end_char_pos": 29 }, { "type": "R", "before": "legitimize", "after": "legitimise", "start_char_pos": 200, "end_char_pos": 210 }, { "type": "R", "before": "Finally, we", "after": "We", "start_char_pos": 340, "end_char_pos": 351 }, { "type": "A", "before": null, "after": ". Finally, we apply our approach to options on the S", "start_char_pos": 501, "end_char_pos": 501 }, { "type": "A", "before": null, "after": "P 500 index", "start_char_pos": 502, "end_char_pos": 502 } ]

[ 0, 92, 251, 339 ]

[ { "type": "R", "before": "well-known", "after": "well known", "start_char_pos": 6, "end_char_pos": 16 }, { "type": "R", "before": "i.e.", "after": "that is,", "start_char_pos": 191, "end_char_pos": 195 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 261, "end_char_pos": 261 }, { "type": "R", "before": "model for the stock price", "after": "stock price model", "start_char_pos": 306, "end_char_pos": 331 } ]

[ 0, 136 ]

[ { "type": "R", "before": "Here we propose an objective scheme to quantify the precise amount of negative entropy, present in an extremely important biochemical pathway; namely, the TCA cycle. Our approach is based on the", "after": "Biological systems possess negative entropy. In them, one form of order produces another, URLanized form of order. We propose a formal scheme to calculate robustness of an entire biological system by quantifying the negative entropy present in it. Our Methodology is based upon a", "start_char_pos": 0, "end_char_pos": 194 }, { "type": "R", "before": "entropy and negative entropy", "after": "(physico-chemical) and negative (biological) entropy, present in the system(TCA cycle, for this work)", "start_char_pos": 292, "end_char_pos": 320 }, { "type": "R", "before": "condition between these positive and negative entropy, could unambiguously provide a quantitative marker that describes the 'edge of life' for TCA cycle . Difference between concentration-profiles prevalent at the 'edge of life' and biologically observed TCA cycle, could quantitatively express the precise amount of negative entropy present in a typical biochemical network. We show here that it is not the existence of mere order, but the synchronization profile between ordered fluctuations, which accounts for biological robustness. An exhaustive sensitivity analysis could identify the concentrations, for which slightest perturbation can account for enormous increase in positive entropy. Since our algorithm is general, the same analysis can as well be performed on larger networks and (ideally) for an entire cell, if numerical data for concentration is available", "after": ", proposed here, could measure the robustness in TCA cycle in exact numeric terms, whereas the mixed strategy game between these entropies could quantitate the progression of stages of biological adaptation. Synchronization profile amongst macromolecular concentrations (even under environmental perturbations) is found to account for negative entropy and biological robustness. Emergence of synchronization profile was investigated with dynamically varying metabolite concentrations. Obtained results were verified with that from the deterministic simulation methods. Categorical plans to apply this algorithm in Cancer studies and anti-viral therapies are proposed alongside. From theoretical perspective, this work proposes a general, rigorous and alternative view of immunology", "start_char_pos": 364, "end_char_pos": 1235 } ]

[ 0, 142, 165, 322, 739, 900, 1058 ]

[ { "type": "R", "before": "eucaryotic", "after": "eukaryotic", "start_char_pos": 62, "end_char_pos": 72 }, { "type": "R", "before": "It is widely believed that the spindle starts forming by", "after": "Several mechanisms are at work towards the formation of the spindle, one of which is", "start_char_pos": 246, "end_char_pos": 302 }, { "type": "R", "before": "We present a complete analytical formulation of this problem, in the case of a single fixed target and for arbitrary cell size. We derive a set of Green's functions for the microtubule dynamics and an associated set of first passage quantities. An implicit analytical expression for the probability distribution of the search time is then obtained , with appropriate boundary conditions at the outer cell membrane. We extract the conditions of optimized search from our formalism. Our results are in qualitative and semi-quantitative agreement with known experimental results for different cell types", "after": "Although the entire cell cycle can be up to 24 hours long, the mitotic phase typically takes only less than an hour. How does the cell keep the duration of mitosis within this limit? Previous theoretical studies have suggested that the chromosome search and capture is optimized by tuning the microtubule dynamic parameters to minimize the search time. In this paper, we examine this conjecture. We compute the mean search time for a single target by microtubules from a single nucleating site, using a systematic and rigorous theoretical approach, for arbitrary kinetic parameters. The result is extended to multiple targets and nucleating sites by physical arguments. Estimates of mitotic time scales are then obtained for different cells using experimental data. In yeast and mammalian cells, the observed changes in microtubule kinetics between interphase and mitosis are beneficial in reducing the search time. In", "start_char_pos": 405, "end_char_pos": 1005 }, { "type": "A", "before": null, "after": "Xenopus", "start_char_pos": 1010, "end_char_pos": 1010 }, { "type": "A", "before": null, "after": "extracts, by contrast, the opposite effect is observed, in agreement with the current understanding that large cells use additional mechanisms to regulate the duration of the mitotic phase", "start_char_pos": 1011, "end_char_pos": 1011 } ]

[ 0, 245, 404, 532, 649, 819, 885 ]

[ { "type": "A", "before": null, "after": "dynamic", "start_char_pos": 17, "end_char_pos": 17 }, { "type": "R", "before": "purpose", "after": "purposes", "start_char_pos": 58, "end_char_pos": 65 }, { "type": "R", "before": "standard", "after": "conventional", "start_char_pos": 132, "end_char_pos": 140 }, { "type": "R", "before": "to a hybrid technique", "after": "and we come up with a hybrid method", "start_char_pos": 201, "end_char_pos": 222 }, { "type": "R", "before": "reduces", "after": "eliminates", "start_char_pos": 277, "end_char_pos": 284 }, { "type": "A", "before": null, "after": "for vectors of risk factors", "start_char_pos": 406, "end_char_pos": 406 }, { "type": "R", "before": "Second", "after": "Additionally", "start_char_pos": 510, "end_char_pos": 516 }, { "type": "R", "before": "bridging this way between", "after": "whence bridging", "start_char_pos": 590, "end_char_pos": 615 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 725, "end_char_pos": 725 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 778, "end_char_pos": 778 }, { "type": "R", "before": "implementation", "after": "evaluation", "start_char_pos": 960, "end_char_pos": 974 }, { "type": "R", "before": "Furthermore", "after": "The empirical calibration procedure presented in this paper can be seen as the SDE-counterpart of the so called Filtered Historical Simulation method; the behavior of volatility stems in our case out of the assumptions on the underlying SDEs. Furthermore,", "start_char_pos": 999, "end_char_pos": 1010 }, { "type": "R", "before": ". Results of a concrete implementation are provided. The method also allows a", "after": "always making a", "start_char_pos": 1104, "end_char_pos": 1181 }, { "type": "A", "before": null, "after": "a-priori", "start_char_pos": 1289, "end_char_pos": 1289 }, { "type": "A", "before": null, "after": ". Results of one concrete implementation are provided", "start_char_pos": 1320, "end_char_pos": 1320 } ]

[ 0, 109, 312, 509, 658, 998, 1156 ]

[ { "type": "D", "before": "the frequent", "after": null, "start_char_pos": 158, "end_char_pos": 170 }, { "type": "A", "before": null, "after": "as is frequently the case in living cells,", "start_char_pos": 209, "end_char_pos": 209 }, { "type": "R", "before": "becomes insufficient", "after": "fails", "start_char_pos": 229, "end_char_pos": 249 }, { "type": "R", "before": ", producing intrinsic", "after": "that intrinsically generate", "start_char_pos": 367, "end_char_pos": 388 }, { "type": "R", "before": "temporaly fluctuating concentrationx(t). The statistical behaviour of this simple network module turns out to be so rich that CMCs can be viewed as versatile and tunable noise generators.", "after": "temporally fluctuating concentration.", "start_char_pos": 597, "end_char_pos": 784 }, { "type": "R", "before": "P(x) several qualitatively different", "after": "of the concentration qualitatively distinct", "start_char_pos": 856, "end_char_pos": 892 }, { "type": "A", "before": null, "after": "and suggest that CMCs in cells can function as versatile and tunable noise generators", "start_char_pos": 1118, "end_char_pos": 1118 } ]

[ 0, 151, 291, 433, 637, 784, 1000 ]

[ { "type": "R", "before": "We systematically investigate the community structure of the yeast protein interaction network . We employ methods that allow us to identify communities in", "after": "Motivation: If biology is modular then clusters, or communities, of proteins derived using only protein-protein interaction network structure might define protein modules with similar biological roles. We investigate the connection between biological modules and network communities in yeast and ask how the functional similarity of", "start_char_pos": 0, "end_char_pos": 155 }, { "type": "R", "before": "network at multiple resolutions as, a priori, there is no single scale of interest. We use novel, stringent tests to find strong evidence for a link between topology and function. Crucially, our tests control for the fact that interacting partners are more similar than a randomly-chosen pair, which is essential for a fair test of functional similarity. We find that many biologically homogeneous communities , that are robust over many resolutions, are surprisingly large. We thus not only identify complexes from the interaction data but also larger collections of strongly-interacting proteins . Communities that contain interactions from tandem affinity purification and co-immunoprecipitation data are far more likely to be biologically homogeneous than those from yeast-two-hybrid", "after": "communities that we find depends on the scales at which we probe the network. Results: We find many proteins lie in functionally homogeneous communities (a maximum of 2777 out of 4028 proteins) which suggests that network structure does indeed help identify sets of proteins with similar functions. The homogeneity of the communities depends on the scale selected. We use a novel test and two independent characterizations of protein function to determine the functional homogeneity of communities. We exploit the connection between network structure", "start_char_pos": 160, "end_char_pos": 947 }, { "type": "R", "before": "split-ubiquitin data. We find that high clustering coefficient is a very good indicator of biological homogeneity in small communities. For larger communities, we find that link density is also important. Our results significantly improve the understanding of the modular structure of the protein interaction network- and how that modularity is reflected in biological homogeneity and experimental type. Our results suggest a method", "after": "biological function", "start_char_pos": 952, "end_char_pos": 1384 }, { "type": "R", "before": "functionally similar proteins even when no annotation is yet known, thereby yielding a valuable diagnostic tool to predict groups that act concertedly within the cell", "after": "proteins which are likely to participate in similar biological functions. We show that high mean clustering coefficient and low mean node betweenness centrality can be used to predict functionally homogeneous communities. Availability: All the data sets and the community detection algorithm are available online", "start_char_pos": 1405, "end_char_pos": 1571 } ]

[ 0, 96, 243, 339, 514, 634, 973, 1087, 1156, 1355 ]

[ { "type": "R", "before": "Motivation", "after": "Background", "start_char_pos": 0, "end_char_pos": 10 }, { "type": "R", "before": "protein-protein", "after": "protein", "start_char_pos": 97, "end_char_pos": 112 }, { "type": "R", "before": "might", "after": "should", "start_char_pos": 143, "end_char_pos": 148 }, { "type": "R", "before": "connection", "after": "link", "start_char_pos": 222, "end_char_pos": 232 }, { "type": "R", "before": "ask how the functional similarity of the communities that we find depends on the scales", "after": "its relationship to the scale", "start_char_pos": 297, "end_char_pos": 384 }, { "type": "R", "before": "We find many proteins lie in functionally homogeneous communities (a maximum of 2777 out of 4028 proteins) which suggests that network structure does indeed help identify sets of proteins with similar functions. The homogeneity of the", "after": "Our results demonstrate that the functional homogeneity of", "start_char_pos": 425, "end_char_pos": 659 }, { "type": "R", "before": ". We use", "after": ", and that almost all proteins lie in a functionally homogeneous community at some scale. We judge functional homogeneity using", "start_char_pos": 702, "end_char_pos": 710 }, { "type": "R", "before": "two", "after": "three", "start_char_pos": 728, "end_char_pos": 731 }, { "type": "R", "before": "to determine the functional homogeneity of communities. We exploit the connection between network structure and biological function to select groups of proteins which are likely to participate in similar biological functions", "after": ", and find a high degree of overlap between these measures", "start_char_pos": 782, "end_char_pos": 1006 }, { "type": "A", "before": null, "after": "a", "start_char_pos": 1022, "end_char_pos": 1022 }, { "type": "R", "before": "and low mean node betweenness centrality", "after": "of a community", "start_char_pos": 1056, "end_char_pos": 1096 }, { "type": "R", "before": "predict functionally homogeneouscommunities. Availability: All the data sets and the community detection algorithm are available online", "after": "identify those that are functionally homogeneous. By tracing the community membership of a protein through multiple scales we demonstrate how our approach could be useful to biologists focusing on a particular protein. Conclusions: We show that there is no one scale of interest in the community structure of the yeast protein interaction network, but we can identify the range of resolution parameters that yield the most functionally coherent communities, and predict which communities are most likely to be functionally homogeneous", "start_char_pos": 1112, "end_char_pos": 1247 } ]

[ 0, 202, 415, 636, 703, 837, 1008, 1156 ]

[ { "type": "R", "before": "the", "after": "a", "start_char_pos": 9, "end_char_pos": 12 }, { "type": "R", "before": "F\\\"ollmer", "after": "Foellmer", "start_char_pos": 51, "end_char_pos": 60 }, { "type": "R", "before": ". The main contributions of this work consist of showing", "after": "and show", "start_char_pos": 177, "end_char_pos": 233 }, { "type": "A", "before": null, "after": "in general", "start_char_pos": 497, "end_char_pos": 497 }, { "type": "D", "before": "and multinomial", "after": null, "start_char_pos": 725, "end_char_pos": 740 }, { "type": "R", "before": "conditions", "after": "sufficient conditions that have to do with the finiteness of the kurtosis,", "start_char_pos": 777, "end_char_pos": 787 }, { "type": "R", "before": "In the Gaussian case, those conditions have to do with the finiteness of", "after": "When this equivalent martingale measure is adapted to", "start_char_pos": 879, "end_char_pos": 951 }, { "type": "R", "before": "kurtosis and , for multinomial innovations, an inequality between the trend terms of the prices and of the volatility equations needs to be satisfied", "after": "price representation we are able to recover out of it the classical pricing formulas of Duan and Heston-Nandi, as well as hedging schemes that improve the performance of those proposed in the literature", "start_char_pos": 956, "end_char_pos": 1105 } ]

[ 0, 178, 429, 649, 878 ]

[ { "type": "R", "before": "them with a previously proposed ensemble of networks", "after": "it with two unbiased ensembles: one obtained by reshuffling the edges and the other", "start_char_pos": 153, "end_char_pos": 205 }, { "type": "R", "before": "process", "after": "mechanism", "start_char_pos": 260, "end_char_pos": 267 }, { "type": "R", "before": "Even though the model ensemble successfully reproduces the degree distributions", "after": "Both ensembles reproduce the degree distributions (the first -by construction- exactly and the second approximately)", "start_char_pos": 285, "end_char_pos": 364 }, { "type": "R", "before": ", we find subtle differences in the structure that are reflected in the dynamics of regulatory-like processes", "after": ". An exceptionally large dynamically relevant core network found in Yeast in comparison with the second ensemble points to a strong bias towards a URLanization which is achieved by subtle modifications in the network's degree distributions", "start_char_pos": 437, "end_char_pos": 546 }, { "type": "R", "before": "for the regulation dynamics and comment on the impact of various Boolean function classes that have been suggested to better", "after": "of regulatory dynamics with various classes of update functions to", "start_char_pos": 572, "end_char_pos": 696 }, { "type": "R", "before": "In addition to an exceptionally large dynamical core network and an excess of self-intercting genes, we find that , even when these differences are eliminated, the Yeastaccommodates more dynamical attractors than best matching model networks which typically come with", "after": "We find that the Yeast's core network has a qualitatively different behaviour, accommodating on average multiple attractors unlike typical members of both reference ensembles which converge to", "start_char_pos": 740, "end_char_pos": 1007 }, { "type": "R", "before": "We further", "after": "Finally, we", "start_char_pos": 1037, "end_char_pos": 1047 }, { "type": "R", "before": "under minor perturbations. We find that , requiring all inputs of the Boolean functions to be nonredundant squeezes the stability of the system to a narrower band near the order-chaos boundary, while the network stability still", "after": "and find that the stability", "start_char_pos": 1091, "end_char_pos": 1318 }, { "type": "A", "before": null, "after": "robustness measure is squeezed into a narrower band around the order-chaos boundary when Boolean inputs are required to be nonredundant on each node. However, the", "start_char_pos": 1368, "end_char_pos": 1368 }, { "type": "R", "before": "model", "after": "reference models", "start_char_pos": 1392, "end_char_pos": 1397 }, { "type": "R", "before": "in terms of stability", "after": "'s core", "start_char_pos": 1412, "end_char_pos": 1433 }, { "type": "R", "before": "which is consistent with the type of statistically outlier motifs found in the core", "after": "suggesting that the dynamically stable network elements are located mostly on the peripherals of the regulatory network. Consistently, the statistically significant three-node motifs in the dynamical core of Yeast turn out to be different from and less stable than those found in the full transcriptional regulatory network", "start_char_pos": 1447, "end_char_pos": 1530 } ]

[ 0, 284, 548, 739, 1036, 1117, 1363 ]

[ { "type": "A", "before": null, "after": "reversible", "start_char_pos": 67, "end_char_pos": 67 }, { "type": "D", "before": "Hopfield, 1974", "after": null, "start_char_pos": 277, "end_char_pos": 291 }, { "type": "D", "before": "time", "after": null, "start_char_pos": 401, "end_char_pos": 405 }, { "type": "A", "before": null, "after": "time", "start_char_pos": 419, "end_char_pos": 419 }, { "type": "R", "before": "kinetic proofreading completion time", "after": "completion time for a kinetic proofreading process and computational analyses for more complicated biochemical systems", "start_char_pos": 519, "end_char_pos": 555 }, { "type": "R", "before": "full system dynamical complexity", "after": "dynamical complexity of the full system", "start_char_pos": 809, "end_char_pos": 841 }, { "type": "R", "before": "will", "after": "is likely to", "start_char_pos": 920, "end_char_pos": 924 }, { "type": "R", "before": "other complex", "after": "many complex multi-step", "start_char_pos": 950, "end_char_pos": 963 } ]

[ 0, 118, 434, 557, 787, 900, 986 ]

[ { "type": "R", "before": "another defaulting firm", "after": "other defaulting firms", "start_char_pos": 237, "end_char_pos": 260 }, { "type": "R", "before": "necessary", "after": "necessarily", "start_char_pos": 391, "end_char_pos": 400 }, { "type": "R", "before": "necessary", "after": "required", "start_char_pos": 488, "end_char_pos": 497 }, { "type": "A", "before": null, "after": ". We then examine the calibration of the model on iTraxx data before and during the crisis. The dynamic feature together with the contagion effect seem to have a significant impact on the model performance, especially during the recent distressed period", "start_char_pos": 936, "end_char_pos": 936 } ]

[ 0, 83, 153, 299, 445, 521, 641, 743 ]

[ { "type": "R", "before": "\"", "after": "``", "start_char_pos": 64, "end_char_pos": 65 }, { "type": "R", "before": "\"", "after": "''", "start_char_pos": 100, "end_char_pos": 101 }, { "type": "D", "before": "(FTAP)", "after": null, "start_char_pos": 235, "end_char_pos": 241 }, { "type": "A", "before": null, "after": "equivalence between the", "start_char_pos": 270, "end_char_pos": 270 }, { "type": "R", "before": "in the market if and only if an equivalent local martingale deflator (ELMD) exists. An ELMD is", "after": "and the existence of", "start_char_pos": 311, "end_char_pos": 405 }, { "type": "R", "before": ", when deflated by it, discounted nonnegative wealth processes become local martingales. In terms of measures, absence of arbitrages of the first kind is shown to be equivalent to the existence of a finitely additive probability, weakly equivalent to the original and locally countably additive, under which the discounted asset-price process is a \"local martingale \". Finally, the aforementioned results are used to obtain an independent proof of the FTAP", "after": "acts as a local martingale deflator on nonnegative wealth processes", "start_char_pos": 439, "end_char_pos": 895 } ]

[ 0, 176, 394, 527, 807 ]

[ { "type": "R", "before": "The absence of arbitrages of the first kind, a weakening of the ``No Free Lunch with Vanishing Risk'' condition, is analyzed in a general", "after": "In a", "start_char_pos": 0, "end_char_pos": 137 }, { "type": "D", "before": ". In the spirit of the Fundamental Theorem of Asset Pricing", "after": null, "start_char_pos": 176, "end_char_pos": 235 }, { "type": "D", "before": "the", "after": null, "start_char_pos": 284, "end_char_pos": 287 }, { "type": "A", "before": null, "after": "(a weak viability condition)", "start_char_pos": 328, "end_char_pos": 328 } ]

[ 0, 177 ]

[ { "type": "R", "before": "modelling", "after": "modeling", "start_char_pos": 201, "end_char_pos": 210 }, { "type": "A", "before": null, "after": ". In particular, the use of the Bayesian inference method that allows to take expert judgement and parameter uncertainty into account, modeling dependence and inclusion of insurance are discussed", "start_char_pos": 383, "end_char_pos": 383 } ]

[ 0, 185, 274 ]

[ { "type": "R", "before": "A study of the boundedness in probability of the set of possible wealth outcomes of an economic agent facing constraints, and", "after": "We undertake a study of market viability from the perspective of a financial agent", "start_char_pos": 0, "end_char_pos": 125 }, { "type": "R", "before": ", is undertaken. The wealth-process set is abstractly", "after": ". The set of wealth processes available to the agent is", "start_char_pos": 161, "end_char_pos": 214 }, { "type": "D", "before": "(a)", "after": null, "start_char_pos": 407, "end_char_pos": 410 }, { "type": "A", "before": null, "after": "the set of terminal", "start_char_pos": 445, "end_char_pos": 445 }, { "type": "D", "before": "(b)", "after": null, "start_char_pos": 467, "end_char_pos": 470 }, { "type": "R", "before": "deflator that make", "after": "strictly positive deflator that makes", "start_char_pos": 501, "end_char_pos": 519 }, { "type": "R", "before": "in", "after": "to", "start_char_pos": 608, "end_char_pos": 610 }, { "type": "A", "before": null, "after": "agent's", "start_char_pos": 628, "end_char_pos": 628 }, { "type": "R", "before": "all wealth processes have versions that are semimartingales", "after": "every properly discounted wealth processes has a version that is a semimartingale", "start_char_pos": 693, "end_char_pos": 752 } ]

[ 0, 177, 377, 594 ]

[ { "type": "R", "before": "market viability", "after": "markets", "start_char_pos": 24, "end_char_pos": 40 }, { "type": "A", "before": null, "after": "(which in turn is equivalent to the weak market viability condition of absence of arbitrage of the first kind)", "start_char_pos": 435, "end_char_pos": 435 } ]

[ 0, 118, 335, 583 ]

[ { "type": "R", "before": "modelled", "after": "modeled", "start_char_pos": 353, "end_char_pos": 361 }, { "type": "D", "before": "the", "after": null, "start_char_pos": 393, "end_char_pos": 396 } ]

[ 0, 140, 363, 533 ]

[ { "type": "R", "before": "local", "after": "'local'", "start_char_pos": 335, "end_char_pos": 340 }, { "type": "A", "before": null, "after": "'", "start_char_pos": 633, "end_char_pos": 633 }, { "type": "A", "before": null, "after": "'", "start_char_pos": 659, "end_char_pos": 659 }, { "type": "R", "before": "portfolio", "after": "strategy", "start_char_pos": 934, "end_char_pos": 943 } ]

[ 0, 139, 239, 438, 579, 748 ]

[ { "type": "D", "before": ", which also shed light on a controversy in the field", "after": null, "start_char_pos": 424, "end_char_pos": 477 }, { "type": "A", "before": null, "after": "identify the", "start_char_pos": 1364, "end_char_pos": 1364 }, { "type": "A", "before": null, "after": "long-range dependence", "start_char_pos": 1369, "end_char_pos": 1369 }, { "type": "A", "before": null, "after": "in 802.11 and", "start_char_pos": 1370, "end_char_pos": 1370 } ]

[ 0, 111, 284, 479, 666, 855, 1009, 1226, 1350 ]

[ { "type": "R", "before": "We first 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 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 collision effect between nodes prevails over the 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", "after": "A simplistic principle founded", "start_char_pos": 112, "end_char_pos": 917 }, { "type": "R", "before": "times have", "after": "time has", "start_char_pos": 968, "end_char_pos": 978 }, { "type": "A", "before": null, "after": "and \\gamma is the collision probability", "start_char_pos": 1094, "end_char_pos": 1094 }, { "type": "A", "before": null, "after": "per-node", "start_char_pos": 1120, "end_char_pos": 1120 }, { "type": "D", "before": "m^2", "after": null, "start_char_pos": 1177, "end_char_pos": 1180 }, { "type": "R", "before": ", essentially due to collision. Moreover, we identify", "after": "/m^2, and paves the way for the following unifying result. The state-of-the-art theory on the superposition of the heavy-tailed processes is applied to establish a dichotomy exhibited by the aggregate backoff process, putting emphasis on the importance of time-scale on which we view the backoff processes. While the aggregation on normal time-scales leads to a Poisson process, it is approximated by a new limiting process possessing", "start_char_pos": 1190, "end_char_pos": 1243 }, { "type": "R", "before": "in 802.11 through both of mathematical and empirical wavelet-based analyses and answer a riddle:", "after": "(LRD) on coarse time-scales. This dichotomy turns out to be instrumental in formulating short-term fairness, extending existing formulas to arbitrary population, and to elucidate", "start_char_pos": 1266, "end_char_pos": 1362 }, { "type": "R", "before": "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 L\\'evy \\alpha-stable distribution with \\alpha \\in (1,2)", "after": "LRD in practical situations. A refined wavelet analysis is conducted to strengthen this argument", "start_char_pos": 1378, "end_char_pos": 1666 } ]

[ 0, 111, 389, 557, 734, 888, 1097, 1221, 1424 ]

[ { "type": "R", "before": "and resulting bankruptcies, taking into account", "after": ". We consider", "start_char_pos": 51, "end_char_pos": 98 }, { "type": "R", "before": "ordering", "after": "Potts-like", "start_char_pos": 172, "end_char_pos": 180 }, { "type": "R", "before": "Our results mean that, in the case when the individual firm dynamics favors dumping of rating changes, there is an optimal strengthof firms' interactions from the risk point of view", "after": "The existence of the collective phase depends on the mean interaction strength", "start_char_pos": 308, "end_char_pos": 489 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 534, "end_char_pos": 534 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 621, "end_char_pos": 621 }, { "type": "A", "before": null, "after": ". In the case when the individual firm dynamics favors dumping of rating changes, there is an optimal strength of the firm's interactions from the systemic risk point of view", "start_char_pos": 675, "end_char_pos": 675 } ]

[ 0, 208, 307, 491, 599 ]

[ { "type": "A", "before": null, "after": "the", "start_char_pos": 159, "end_char_pos": 159 }, { "type": "D", "before": "After the crisis achieves its bottom, it can develop into two directions: recovering (both correlations and variance decrease) or fatal catastrophe (correlations decrease, but variance not).", "after": null, "start_char_pos": 354, "end_char_pos": 544 }, { "type": "R", "before": "observation", "after": "observations", "start_char_pos": 594, "end_char_pos": 605 }, { "type": "A", "before": null, "after": "the", "start_char_pos": 707, "end_char_pos": 707 }, { "type": "R", "before": "adaptation", "after": "individual adaptation of similar non-interactive individuals to a similar system of external factors", "start_char_pos": 754, "end_char_pos": 764 }, { "type": "R", "before": "URLanization of interaction between factors (Liebig's versus synergistic systems) lead to different adaptation dynamics. This gives an explanation to qualitatively different dynamics of correlation under different types of load", "after": "Qualitatively, this approach follows Selye's idea about adaptation energy", "start_char_pos": 779, "end_char_pos": 1006 } ]

[ 0, 101, 353, 544, 684, 778, 899 ]

[ { "type": "A", "before": null, "after": "linear approximation of the", "start_char_pos": 94, "end_char_pos": 94 }, { "type": "R", "before": "We", "after": "Indeed, we", "start_char_pos": 166, "end_char_pos": 168 }, { "type": "R", "before": "expressions", "after": "exact expression", "start_char_pos": 296, "end_char_pos": 307 }, { "type": "R", "before": "and the first four cumulants for the", "after": "associated to the", "start_char_pos": 339, "end_char_pos": 375 }, { "type": "R", "before": "measure. This", "after": "density. Its knowledge", "start_char_pos": 401, "end_char_pos": 414 }, { "type": "R", "before": "obtain a semi-closed form for European option prices , based on Lewis ' approach. We deeply analyze", "after": "compute option prices exploiting Lewis and Lipton formula. We analyze in detail", "start_char_pos": 428, "end_char_pos": 527 }, { "type": "R", "before": "implement a conceptually", "after": "also compute the analytical expressions of the first four cumulants, being crucial to implement a", "start_char_pos": 651, "end_char_pos": 675 }, { "type": "R", "before": "which considerably reduces the computational burden and we test it", "after": ". It has been tested", "start_char_pos": 715, "end_char_pos": 781 }, { "type": "R", "before": "Our results show", "after": "The analysis we present reveals", "start_char_pos": 848, "end_char_pos": 864 }, { "type": "R", "before": "data for all the considered models. In particular, the fitted parameters suggest the risk neutral dynamics is in a low volatility fluctuation regime, which supports the reliability", "after": "implied surfaces and corroborates the accuracy", "start_char_pos": 898, "end_char_pos": 1078 } ]

[ 0, 165, 409, 509, 647, 847, 933 ]

[ { "type": "R", "before": "Its knowledge", "after": "This expression", "start_char_pos": 431, "end_char_pos": 444 }, { "type": "A", "before": null, "after": "a formula derived by", "start_char_pos": 491, "end_char_pos": 491 }, { "type": "D", "before": "formula", "after": null, "start_char_pos": 509, "end_char_pos": 516 }, { "type": "R", "before": "being", "after": "that are", "start_char_pos": 732, "end_char_pos": 737 }, { "type": "R", "before": "analysis", "after": "data analysis that", "start_char_pos": 890, "end_char_pos": 898 }, { "type": "R", "before": "agreement", "after": "fit", "start_char_pos": 925, "end_char_pos": 934 } ]

[ 0, 192, 430, 518, 659, 800, 885 ]

[ { "type": "R", "before": "questions in the experimental and theoretical research in the field of interaction of weak influences of various fields with biological objects in conditions when an intense of", "after": "effect of ultralow-frequency or static magnetic and electric fields on biological processes is of huge interest for researchers due to the resonant change of the intensity of biochemical reactions although the energy in such fields is small. A simplified model to study the effect of the weak magnetic and electrical fields on fluctuation of", "start_char_pos": 4, "end_char_pos": 180 }, { "type": "R", "before": "influence is smalland weak perturbation are analyzed. The type of resonant interactions connected with these processes is considered. The new method of decision of the", "after": "random ionic currents in blood and to solve the", "start_char_pos": 185, "end_char_pos": 352 }, { "type": "D", "before": "offered. On the basis of results of the previous work", "after": null, "start_char_pos": 387, "end_char_pos": 440 }, { "type": "D", "before": "arXiv:0904.1198", "after": null, "start_char_pos": 441, "end_char_pos": 456 }, { "type": "R", "before": "the analytical expression of energy of a molecule in considered area has been obtained. Numerical estimations of the energy of molecules in capillary and aorta volume are resulted: for the values of relaxation rate \\Lambda=0.5 \\lambda, 0.05 \\lambda, and 0.005 \\lambda we obtain the energies \\varepsilon=2, 20 and 200 k_BT, respectively, for the molecules of capillaries and \\varepsilon=2\\cdot", "after": "suggested. The analytic expression for the kinetic energy of the molecules dissolved in certain liquid media is obtained. The values of the magnetic field leading to resonant effects in capillaries are estimated. The numerical estimates showed that the resonant values of the energy of molecular in the capillaries and aorta are different: under identical conditions a molecule of the aorta gets", "start_char_pos": 475, "end_char_pos": 867 }, { "type": "D", "before": ", 20\\cdot 10^{-9", "after": null, "start_char_pos": 876, "end_char_pos": 892 }, { "type": "A", "before": null, "after": "times less energy than the molecules in blood capillaries. So the", "start_char_pos": 973, "end_char_pos": 973 }, { "type": "R", "before": "resonance effectand the", "after": "resonant effect, with an approach to the resonant value of the magnetic field strength, the", "start_char_pos": 1012, "end_char_pos": 1035 }, { "type": "R", "before": ". This", "after": ", this", "start_char_pos": 1172, "end_char_pos": 1178 }, { "type": "D", "before": ". Even if the magnetic field value is not so near to the resonance value of the magnetic field a significant effect can be reached with an increase of the time of exposition to the magnetic field", "after": null, "start_char_pos": 1257, "end_char_pos": 1452 } ]

[ 0, 238, 318, 395, 562, 966, 1173, 1258 ]

[ { "type": "A", "before": null, "after": "\\,", "start_char_pos": 262, "end_char_pos": 262 }, { "type": "D", "before": "~", "after": null, "start_char_pos": 333, "end_char_pos": 334 }, { "type": "D", "before": "~", "after": null, "start_char_pos": 591, "end_char_pos": 592 } ]

[ 0, 136, 465 ]

[ { "type": "D", "before": "representative", "after": null, "start_char_pos": 64, "end_char_pos": 78 }, { "type": "A", "before": null, "after": "Markovian", "start_char_pos": 261, "end_char_pos": 261 }, { "type": "R", "before": "the usual approach which employs the a-posteriori Pareto optimality of equilibrium allocations", "after": "equilibrium allocations are not necessarily Pareto optimal", "start_char_pos": 557, "end_char_pos": 651 }, { "type": "D", "before": "in the complete-market setting", "after": null, "start_char_pos": 700, "end_char_pos": 730 } ]

[ 0, 280, 542, 746, 962 ]

[ { "type": "A", "before": null, "after": ",", "start_char_pos": 202, "end_char_pos": 202 }, { "type": "A", "before": null, "after": "generalized Jain's index that tunes the resolution of the fairness measure, a", "start_char_pos": 379, "end_char_pos": 379 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 430, "end_char_pos": 430 }, { "type": "A", "before": null, "after": ". We also construct an alternative set of four axioms to capture efficiency objectives and feasibility constraints", "start_char_pos": 484, "end_char_pos": 484 } ]

[ 0, 77, 145, 245, 338 ]

[ { "type": "D", "before": "consider different kinds of linear barriers. We", "after": null, "start_char_pos": 326, "end_char_pos": 373 }, { "type": "A", "before": null, "after": ": refraction and the impulse control", "start_char_pos": 424, "end_char_pos": 424 }, { "type": "A", "before": null, "after": "the dividends are payed out", "start_char_pos": 440, "end_char_pos": 440 }, { "type": "R", "before": "two-dimensional risk process hits the barrier the minimal amount of dividends is payed out to keep the risk process within the regionbounded by the barrier", "after": "two-dimensional risk process exit fixed region", "start_char_pos": 446, "end_char_pos": 601 }, { "type": "A", "before": null, "after": ". This paper is an attempt at understanding the effect of dependencies of two portfolios on the the join optimal strategy of paying dividends. For the proportional reinsurance we can observe for example the interesting phenomenon that is dependence of choice of the optimal barrier on the initial reserves. This is a contrast to the one-dimensional Cram\\'{e", "start_char_pos": 893, "end_char_pos": 893 } ]

[ 0, 150, 216, 322, 370, 426, 603, 804 ]

[ { "type": "R", "before": "have the same claims and they divide premia in some specified proportions", "after": "receive premiums at different rates and then split the amount they pay in fixed proportions for each claim (for simplicity we assume that they are equal)", "start_char_pos": 76, "end_char_pos": 149 }, { "type": "R", "before": "if", "after": "when", "start_char_pos": 239, "end_char_pos": 241 }, { "type": "R", "before": "leave", "after": "leaves", "start_char_pos": 295, "end_char_pos": 300 }, { "type": "A", "before": null, "after": "the", "start_char_pos": 358, "end_char_pos": 358 }, { "type": "D", "before": "the", "after": null, "start_char_pos": 394, "end_char_pos": 397 }, { "type": "R", "before": "first one", "after": "the first case", "start_char_pos": 418, "end_char_pos": 427 }, { "type": "A", "before": null, "after": "the", "start_char_pos": 461, "end_char_pos": 461 }, { "type": "R", "before": "exit", "after": "exits the", "start_char_pos": 491, "end_char_pos": 495 }, { "type": "R", "before": "whenever process hits", "after": ", whenever the process hits the", "start_char_pos": 533, "end_char_pos": 554 }, { "type": "R", "before": "the risk process", "after": "it", "start_char_pos": 572, "end_char_pos": 588 }, { "type": "R", "before": "dividend", "after": "dividends", "start_char_pos": 610, "end_char_pos": 618 }, { "type": "R", "before": "and waits there for the first", "after": "where it waits for the next", "start_char_pos": 664, "end_char_pos": 693 }, { "type": "A", "before": null, "after": "the", "start_char_pos": 739, "end_char_pos": 739 }, { "type": "D", "before": "time", "after": null, "start_char_pos": 795, "end_char_pos": 799 }, { "type": "R", "before": "an attempt at understanding", "after": "the first attempt to understand", "start_char_pos": 816, "end_char_pos": 843 }, { "type": "R", "before": "the join", "after": "joint", "start_char_pos": 896, "end_char_pos": 904 }, { "type": "R", "before": "the proportional reinsurance we can observe for example", "after": "example in case of proportional reinsurance one can observe", "start_char_pos": 947, "end_char_pos": 1002 }, { "type": "D", "before": "is dependence of", "after": null, "start_char_pos": 1035, "end_char_pos": 1051 }, { "type": "A", "before": null, "after": "depends", "start_char_pos": 1082, "end_char_pos": 1082 }, { "type": "R", "before": "a contrast to", "after": "in contrast with", "start_char_pos": 1116, "end_char_pos": 1129 }, { "type": "R", "before": "barrier among optimal barrier strategies", "after": "the barrier", "start_char_pos": 1204, "end_char_pos": 1244 } ]

[ 0, 151, 217, 323, 414, 509, 710, 801, 942, 1107 ]

[ { "type": "D", "before": "present and", "after": null, "start_char_pos": 17, "end_char_pos": 28 }, { "type": "D", "before": "1-\\alpha/", "after": null, "start_char_pos": 1194, "end_char_pos": 1203 }, { "type": "A", "before": null, "after": "/\\alpha-1", "start_char_pos": 1206, "end_char_pos": 1206 } ]

[ 0, 145, 409, 540, 691, 837, 1019, 1236 ]

[ { "type": "D", "before": "microtubule", "after": null, "start_char_pos": 4, "end_char_pos": 15 }, { "type": "D", "before": ", observed in all growing plant cells,", "after": null, "start_char_pos": 88, "end_char_pos": 126 }, { "type": "R", "before": "plant cell growth by uniaxial expansion along the axis perpendicular to the microtubules. To investigate the orientational ordering of microtubulesin this system, we", "after": "uniaxial expansion of all growing plant cells. Recent experiments have shown polymerization-driven collisions between the membrane-bound cortical microtubules, suggesting a possible mechanism for their alignment. We", "start_char_pos": 176, "end_char_pos": 341 }, { "type": "A", "before": null, "after": "of this mechanism", "start_char_pos": 432, "end_char_pos": 432 }, { "type": "R", "before": "the main driving factor in", "after": "sufficient to generate", "start_char_pos": 566, "end_char_pos": 592 } ]

[ 0, 265, 495 ]

[ { "type": "D", "before": "simple", "after": null, "start_char_pos": 149, "end_char_pos": 155 }, { "type": "R", "before": "t-distributed", "after": "distributed", "start_char_pos": 767, "end_char_pos": 780 } ]

[ 0, 129, 380, 552, 727, 806 ]

[ { "type": "R", "before": "transportation by N effective", "after": "transport by N", "start_char_pos": 33, "end_char_pos": 62 }, { "type": "D", "before": "experimental observations.", "after": null, "start_char_pos": 524, "end_char_pos": 550 } ]

[ 0, 92, 239, 431, 474 ]

[ { "type": "R", "before": "BSDE", "after": "BSDEs", "start_char_pos": 37, "end_char_pos": 41 }, { "type": "R", "before": "which from the perspective of a utility optimization interpretation of the underlying control problem on a financial market takes the following form. The", "after": ", namely a representation formula for the", "start_char_pos": 440, "end_char_pos": 593 }, { "type": "A", "before": null, "after": "component of its solution. The latter is relevant in the context of securitization of random liabilities arising from exogenous risk, which are optimally hedged by investment in a given financial market with respect to exponential preferences. In a purely stochastic formulation, the control", "start_char_pos": 602, "end_char_pos": 602 }, { "type": "R", "before": "BSDE", "after": "backward component of the FBSDE", "start_char_pos": 618, "end_char_pos": 622 }, { "type": "R", "before": "a random liabilitydepending on a market external uncertainty and this way describes the", "after": "the random liability, and describes its", "start_char_pos": 646, "end_char_pos": 733 }, { "type": "D", "before": "of the liability", "after": null, "start_char_pos": 759, "end_char_pos": 775 }, { "type": "R", "before": "a", "after": "the", "start_char_pos": 793, "end_char_pos": 794 }, { "type": "R", "before": "described", "after": "given", "start_char_pos": 835, "end_char_pos": 844 }, { "type": "R", "before": "This delta hedge is described in a key formula in terms of a derivative functional of the solution process", "after": "The representation formula of the main result describes this delta hedge in terms of the derivative of the BSDE's solution process on the one hand,", "start_char_pos": 871, "end_char_pos": 977 }, { "type": "A", "before": null, "after": "on the other hand", "start_char_pos": 1139, "end_char_pos": 1139 }, { "type": "D", "before": "largely", "after": null, "start_char_pos": 1154, "end_char_pos": 1161 }, { "type": "R", "before": ", designed to give", "after": ". It is designed to extend", "start_char_pos": 1259, "end_char_pos": 1277 }, { "type": "R", "before": "delta hedge in the context of", "after": "replication in", "start_char_pos": 1331, "end_char_pos": 1360 }, { "type": "R", "before": "generalizing the derivative hedge in the", "after": "from the classical", "start_char_pos": 1397, "end_char_pos": 1437 }, { "type": "R", "before": ". Of course", "after": "to incomplete markets on general stochastic bases. In this setting", "start_char_pos": 1458, "end_char_pos": 1469 }, { "type": "R", "before": "needed in the Brownian setting is not available in the general local martingale framework . We replace it", "after": "which is required in the Brownian framework is replaced", "start_char_pos": 1493, "end_char_pos": 1598 }, { "type": "R", "before": "stochastic calculus techniques", "after": "techniques related to a calculus of quadratic covariations of basis martingales", "start_char_pos": 1621, "end_char_pos": 1651 } ]

[ 0, 140, 270, 381, 589, 870, 1141, 1459, 1584 ]

[ { "type": "R", "before": "forward-backward", "after": "forward--backward", "start_char_pos": 183, "end_char_pos": 199 }, { "type": "D", "before": ",", "after": null, "start_char_pos": 873, "end_char_pos": 874 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 954, "end_char_pos": 954 }, { "type": "D", "before": ". The representation formula of the main result describes this delta hedge in terms of the derivative of the BSDE's solution process on the one hand, and the correlation structure of the internal uncertainty captured by the forward process and the external uncertainty responsible for the market incompleteness on the other hand. The formula extends the scope of validity of the results obtained by several authors in the Brownian setting. It is designed to extend a genuinely stochastic representation of the optimal replication in cross hedging insurance derivatives from the classical Black-Scholes model to incomplete markets on general stochastic bases. In this setting, Malliavin's calculus which is required in the Brownian framework is replaced by new tools based on techniques related to a calculus of quadratic covariations of basis martingales", "after": null, "start_char_pos": 1011, "end_char_pos": 1865 } ]

[ 0, 141, 271, 382, 516, 733, 1012, 1340, 1450, 1669 ]

[ { "type": "A", "before": null, "after": "new extensions to", "start_char_pos": 11, "end_char_pos": 11 }, { "type": "R", "before": "new", "after": "several", "start_char_pos": 38, "end_char_pos": 41 }, { "type": "R", "before": "diffusions with linear drift and nonlinear diffusion coefficient functions,", "after": "time-homogeneous diffusions", "start_char_pos": 79, "end_char_pos": 154 }, { "type": "A", "before": null, "after": "a dual application of", "start_char_pos": 251, "end_char_pos": 251 }, { "type": "R", "before": "allows us to uncover new multiparameter", "after": "combines smooth monotonic mappings and measure changes via Doob-h transforms. This gives rise to new multi-parameter solvable", "start_char_pos": 313, "end_char_pos": 352 }, { "type": "R", "before": "mapped onto various simpler underlying diffusions. We give a simple rigorous boundary classification and characterization of the newly constructed processes with respect to the martingale property. Specifically, we construct, analyse and classify three new families of nonlinear diffusion models with affine drift that arise from the squared Bessel process (the Bessel family), the CIR process (the confluent hypergeometric family), and the Ornstein-Uhlenbeck diffusion (the OU family)", "after": "generally divided into two main classes; the first is specified by having affine (linear) drift with various resulting nonlinear diffusion coefficient functions, while the second class allows for several specifications of a (generally nonlinear) diffusion coefficient with resulting nonlinear drift function. The theory is applicable to diffusions with either singular and/or non-singular endpoints. As part of the results in this paper, we also present a complete boundary classification and martingale characterization of the newly developed diffusion families", "start_char_pos": 373, "end_char_pos": 858 } ]

[ 0, 225, 423, 570 ]

[ { "type": "R", "before": "Diffusive processes describe a", "after": "Diffusion is a key element of a", "start_char_pos": 0, "end_char_pos": 30 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 146, "end_char_pos": 146 }, { "type": "R", "before": ", and to recognize", "after": ". We also propose", "start_char_pos": 282, "end_char_pos": 300 }, { "type": "R", "before": "an annealed weighted network", "after": "annealed weighted networks", "start_char_pos": 316, "end_char_pos": 344 }, { "type": "R", "before": "The analysis of the simple", "after": "We show the validity of our approach addressing the problem of the", "start_char_pos": 385, "end_char_pos": 411 }, { "type": "R", "before": "reveals", "after": ", pointing out", "start_char_pos": 432, "end_char_pos": 439 }, { "type": "R", "before": "its behavior", "after": "the behavior observed", "start_char_pos": 462, "end_char_pos": 474 }, { "type": "A", "before": null, "after": "Additionally, we show how to employ our formalism for more complex dynamics.", "start_char_pos": 545, "end_char_pos": 545 }, { "type": "R", "before": "warning", "after": "and warns", "start_char_pos": 639, "end_char_pos": 646 }, { "type": "D", "before": "more", "after": null, "start_char_pos": 695, "end_char_pos": 699 } ]

[ 0, 140, 384, 544 ]

[ { "type": "R", "before": "use a model of proportionate growth to describe the dynamics of international trade flows. We provide an explanation to the fact that the extensive margin of trade account for a large fraction of the greater exports of large economies, as well as for a number of stylized facts described by the literature on trade networks such as the power-law distribution of connectivity and", "after": "develop a simple theoretical framework for the evolution of weighted network that is consistent with a number of stylized features of real-world data. In our framework,", "start_char_pos": 3, "end_char_pos": 381 }, { "type": "R", "before": "fat tails displayed by the distribution", "after": "Barabasi-Albert model of network evolution is extended as recently proposed by Stanley and colleagues in their work on complex system dynamics. Our model is verify by means of simulations and real world trade data. We show that the model correctly predicts the intensity and growth distribution of links, the size-variance relationships of the growth", "start_char_pos": 386, "end_char_pos": 425 }, { "type": "A", "before": null, "after": "link values,", "start_char_pos": 429, "end_char_pos": 429 }, { "type": "R", "before": "growth rates of trade flows. Hence, such a simple setup is able to capture the dynamics of very different economic variables, from firm size (as shown in the URLanization literature) to international trade flows (as documented here). Furthermore, we provide an additional element to the discussion on the relative ability of different international trade models to adequately match empirical regularities", "after": "relationship between the degree and strength of nodes, as well as the scale-free structure of the network", "start_char_pos": 434, "end_char_pos": 838 } ]

[ 0, 93, 462, 667 ]

[ { "type": "R", "before": "network", "after": "networks", "start_char_pos": 72, "end_char_pos": 79 }, { "type": "R", "before": "as recently proposed by Stanley and colleagues in their work on complex system dynamics", "after": "by assuming that link weights evolve according to a geometric Brownian motion", "start_char_pos": 231, "end_char_pos": 318 }, { "type": "R", "before": "verify", "after": "verified", "start_char_pos": 334, "end_char_pos": 340 }, { "type": "R", "before": "values", "after": "weights", "start_char_pos": 536, "end_char_pos": 542 } ]

[ 0, 153, 320, 391 ]

[ { "type": "R", "before": ",", "after": "and", "start_char_pos": 551, "end_char_pos": 552 }, { "type": "D", "before": ", and by introducing mass conservation for the monomers", "after": null, "start_char_pos": 608, "end_char_pos": 663 }, { "type": "R", "before": "the role and", "after": "two possible limiting models for the", "start_char_pos": 692, "end_char_pos": 704 }, { "type": "A", "before": null, "after": ", namely the vectorial or the random model", "start_char_pos": 754, "end_char_pos": 754 } ]

[ 0, 225, 465, 665, 756 ]

[ { "type": "R", "before": "develop a new theory for pricing call type American options in complete", "after": "solve the problem of pricing and optimal exercise of American call-type options in", "start_char_pos": 3, "end_char_pos": 74 }, { "type": "R", "before": "resolve", "after": "resolves", "start_char_pos": 159, "end_char_pos": 166 } ]

[ 0, 153 ]

[ { "type": "A", "before": null, "after": "one-dimensional", "start_char_pos": 11, "end_char_pos": 11 }, { "type": "R", "before": "rescue mechanism", "after": "mechanism of recovery from shrinkage", "start_char_pos": 360, "end_char_pos": 376 }, { "type": "R", "before": "Our results also show that in the presence of remnants microtubule dynamics can be regulated by changing the depolymerisation rate", "after": "Under conditions for which this alternative mechanism dominates, an increasing depolymerization rate leads to a decrease in dissociation rate and thus a net increase in assembly", "start_char_pos": 426, "end_char_pos": 556 } ]

[ 0, 140, 298, 425 ]

[ { "type": "R", "before": "and", "after": ". This model", "start_char_pos": 257, "end_char_pos": 260 }, { "type": "R", "before": "test whether such features might contribute to the proposed role of the microtubule as a mediator in intracellular signaling", "after": "study how ionic conductance along the lumen is affected by flux through the nanopores when an external potential is applied across its two ends", "start_char_pos": 272, "end_char_pos": 396 }, { "type": "R", "before": "can allow a", "after": "causes a net", "start_char_pos": 704, "end_char_pos": 715 }, { "type": "R", "before": "current", "after": "effect", "start_char_pos": 824, "end_char_pos": 831 }, { "type": "A", "before": null, "after": "enhance and", "start_char_pos": 851, "end_char_pos": 851 }, { "type": "A", "before": null, "after": "through the lumen", "start_char_pos": 893, "end_char_pos": 893 }, { "type": "A", "before": null, "after": "or as a nano-bioelectronic device", "start_char_pos": 1042, "end_char_pos": 1042 } ]

[ 0, 114, 562, 818 ]

[ { "type": "D", "before": "very", "after": null, "start_char_pos": 11, "end_char_pos": 15 }, { "type": "R", "before": "'value investing'", "after": "\"value investing\"", "start_char_pos": 156, "end_char_pos": 173 }, { "type": "R", "before": "When funds use leverage,", "after": "During good times competition drives investors to funds that use more leverage, because they have higher profits. As leverage increases", "start_char_pos": 499, "end_char_pos": 523 }, { "type": "R", "before": "'irrational behavior'", "after": "\"irrational behavior\"", "start_char_pos": 714, "end_char_pos": 735 }, { "type": "R", "before": "We show that the immediate cause of the increase in extreme risks in our model is the risk control policy of the banks", "after": "Here instead this comes from the fact that leverage limits cause funds to sell into a falling market", "start_char_pos": 763, "end_char_pos": 881 }, { "type": "A", "before": null, "after": "large", "start_char_pos": 1203, "end_char_pos": 1203 }, { "type": "R", "before": "by individual banks makes", "after": "in which individual banks base leverage limits on volatility causes leverage to rise during periods of low volatility, and to contract more quickly when volatility gets high, making", "start_char_pos": 1418, "end_char_pos": 1443 }, { "type": "D", "before": ". Thus it is the very effort to control risk at the local level that creates excessive risk at the aggregate level, which shows up as fat tails and clustered volatility", "after": null, "start_char_pos": 1482, "end_char_pos": 1650 } ]

[ 0, 76, 233, 350, 498, 641, 762, 1055, 1159, 1229, 1354, 1483 ]

[ { "type": "R", "before": "multi-network", "after": "multinetwork", "start_char_pos": 43, "end_char_pos": 56 }, { "type": "R", "before": "international trade", "after": "international-trade", "start_char_pos": 233, "end_char_pos": 252 }, { "type": "R", "before": "log-normality", "after": "log normality", "start_char_pos": 378, "end_char_pos": 391 }, { "type": "A", "before": null, "after": ",", "start_char_pos": 552, "end_char_pos": 552 }, { "type": "D", "before": ",", "after": null, "start_char_pos": 774, "end_char_pos": 775 }, { "type": "R", "before": "taxonomies", "after": "hierarchies", "start_char_pos": 1015, "end_char_pos": 1025 }, { "type": "R", "before": "\"", "after": "``", "start_char_pos": 1109, "end_char_pos": 1110 }, { "type": "A", "before": null, "after": ". Our approach is general and can be used to characterize any multinetwork emerging as a nontrivial aggregation of several interdependent layers", "start_char_pos": 1334, "end_char_pos": 1334 } ]

[ 0, 267, 477, 623, 936, 1041 ]

[ { "type": "R", "before": "Bloom filters are", "after": "The Bloom filter (BF) is a", "start_char_pos": 0, "end_char_pos": 17 }, { "type": "R", "before": "structures that answer", "after": "structure that answers", "start_char_pos": 50, "end_char_pos": 72 }, { "type": "R", "before": "Bloom filters", "after": "BFs", "start_char_pos": 274, "end_char_pos": 287 }, { "type": "R", "before": "push", "after": "move", "start_char_pos": 367, "end_char_pos": 371 }, { "type": "A", "before": null, "after": "such", "start_char_pos": 461, "end_char_pos": 461 }, { "type": "R", "before": "contribution consists", "after": "contributions are exploring the design space and the evaluation", "start_char_pos": 502, "end_char_pos": 523 }, { "type": "R", "before": "An evaluation of the", "after": "In addition to the theoretical estimates, extensive simulations of the multiple", "start_char_pos": 702, "end_char_pos": 722 }, { "type": "R", "before": "validates", "after": "validate", "start_char_pos": 773, "end_char_pos": 782 }, { "type": "D", "before": "proposed", "after": null, "start_char_pos": 805, "end_char_pos": 813 } ]

[ 0, 137, 419, 492, 701 ]

[ { "type": "R", "before": "stability of the", "after": "stable", "start_char_pos": 133, "end_char_pos": 149 }, { "type": "D", "before": ",", "after": null, "start_char_pos": 342, "end_char_pos": 343 } ]

[ 0, 171, 311 ]

[ { "type": "A", "before": null, "after": "noise characteristics of", "start_char_pos": 13, "end_char_pos": 13 }, { "type": "A", "before": null, "after": "simple genetic oscillatory systems. Using", "start_char_pos": 68, "end_char_pos": 68 }, { "type": "R", "before": ". We", "after": "as a prototypical example, we", "start_char_pos": 164, "end_char_pos": 168 }, { "type": "D", "before": "using the exact stochastic simulations with the Gillespie algorithm", "after": null, "start_char_pos": 306, "end_char_pos": 373 }, { "type": "A", "before": null, "after": "via dynamic Monte Carlo simulations", "start_char_pos": 407, "end_char_pos": 407 }, { "type": "R", "before": "protein species", "after": "protein-species", "start_char_pos": 425, "end_char_pos": 440 }, { "type": "A", "before": null, "after": "the", "start_char_pos": 529, "end_char_pos": 529 }, { "type": "R", "before": "respectively", "after": ", respectively,", "start_char_pos": 742, "end_char_pos": 754 }, { "type": "R", "before": "Local", "after": "The local", "start_char_pos": 883, "end_char_pos": 888 } ]

[ 0, 165, 409, 667, 882 ]