In this paper, we provide a family of bounds for the rate at which the functions of many inputs can be computed in-network on general topologies. Going beyond simple symmetric functions where the output is invariant t...
详细信息
In this paper, we provide a family of bounds for the rate at which the functions of many inputs can be computed in-network on general topologies. Going beyond simple symmetric functions where the output is invariant to the permutation of the operands, e.g., average, parity, we describe an algorithm that is analyzed to provide throughput bounds (both lower and upper) for the general functions. In particular, we analyze our algorithm when the function to be computed is given as a binary tree schema. Our lower bounds depend on schema parameters like the number of operands and graph parameters like the second largest eigenvalue of the transition matrix of simple random walk on network graph, the maximum and minimum degree of any node in the network. The lower bounding technique that we have used is based on the network flows and can capture general multi-commodity flow settings. Our proposed algorithm uses the well-known simple random walk on a network as its basic primitive for routing. We show that the lower bound obtained on the rate of computation is tight for the complete network topology, the hypercube and the star topology. We also present an upper bound on the expected latency of any data operand in terms of the height of schema, well-studied random walk parameter like the hitting time, and the relative distance from the critical data rate. For the computation time of symmetric functions on the random geometric graph under the gossip model, our approach achieves an order-optimal (O) over tilde (n) time despite enforcing a binary tree schema for function computation. In general, Big-O notation represents an upper bound and e.g hides poly log n factors.
Despite extensive research on symmetric polynomial quadrature rules for triangles, as well as approaches to their calculation, few studies have focused on non-polynomial functions, particularly on their integration us...
详细信息
Despite extensive research on symmetric polynomial quadrature rules for triangles, as well as approaches to their calculation, few studies have focused on non-polynomial functions, particularly on their integration using symmetric triangle rules. In this paper, we present two approaches to computing symmetric triangle rules for singular integrands by developing rules that can integrate arbitrary functions. The first approach is well suited for a moderate amount of points and retains much of the efficiency of polynomial quadrature rules. The second approach better addresses large amounts of points, though it is less efficient than the first approach. We demonstrate the effectiveness of both approaches on singular integrands, which can often yield relative errors two orders of magnitude less than those from polynomial quadrature rules. (C) 2020 Elsevier Ltd. All rights reserved.
A conception of probability that can be traced back to Johannes von Kries is introduced: the "Spielraum" or range conception. Its close connection to the so-called method of arbitrary functions is highlighte...
详细信息
A conception of probability that can be traced back to Johannes von Kries is introduced: the "Spielraum" or range conception. Its close connection to the so-called method of arbitrary functions is highlighted. Possible interpretations of it are discussed, and likewise its scope and its relation to certain current interpretations of probability. Taken together, these approaches form a class of interpretations of probability in its own right, but also with its own problems. These, too, are introduced, discussed, and proposals in response to them are surveyed, some of which also go back to von Kries.
A new integrable case of the one-dimensional nonlinear wave equation was found. A general solution for this case depending on two arbitrary functions was derived. The functional form of the speed of sound can be used ...
详细信息
In this paper, we investigate the (2+1)-dimensional three-component long-wave-short-wave resonance interaction system, which describes complex systems and nonlinear wave phenomena in physics. By employing the Hirota b...
详细信息
In this paper, we investigate the (2+1)-dimensional three-component long-wave-short-wave resonance interaction system, which describes complex systems and nonlinear wave phenomena in physics. By employing the Hirota bilinear method, we derive the general nondegenerate N-soliton solution of the system, where each short-wave component contains N arbitrary functions of the independent variable y. The presence of these arbitrary functions in the analytical solution enables the construction of a wide range of nondegenerate soliton types. Finally, we illustrate the structural features of several novel nondegenerate solitons, including M-shaped, multiple double-hump, and sawtooth double-striped solitons, as well as interactions between nondegenerate solitons, such as dromion-like solitons and solitoffs, with the aid of figures.
A New Treatise on the Elements of the Differential and Integral Calculus by Horatio Nelson Robinson, I. F. Quinby; published by Ivison, Blakeman, Taylor & Co., 1867
A New Treatise on the Elements of the Differential and Integral Calculus by Horatio Nelson Robinson, I. F. Quinby; published by Ivison, Blakeman, Taylor & Co., 1867
We give a determination of the equivalence group of the Euler-Bernoulli equation and of one of its generalizations, and thus derive some symmetry properties of this equation. (C) 2012 Elsevier Ltd. All rights reserved.
We give a determination of the equivalence group of the Euler-Bernoulli equation and of one of its generalizations, and thus derive some symmetry properties of this equation. (C) 2012 Elsevier Ltd. All rights reserved.
A fully homomorphic encryption scheme enables computation of arbitrary functions on encrypted data. Fully homomorphic encryption has long been regarded as cryptography's prized "holy grail" - extremely u...
详细信息
ISBN:
(纸本)9780769545714
A fully homomorphic encryption scheme enables computation of arbitrary functions on encrypted data. Fully homomorphic encryption has long been regarded as cryptography's prized "holy grail" - extremely useful yet rather elusive. Starting with the groundbreaking work of Gentry in 2009, the last three years have witnessed numerous constructions of fully homomorphic encryption involving novel mathematical techniques, and a number of exciting applications. We will take the reader through a journey of these developments and provide a glimpse of the exciting research directions that lie ahead.
The error on a real quantity Y due to the graduation of the measuring instrument may be asymptotically represented, when the graduation is regular and fines down, by a Dirichlet form on R whose square field operator d...
详细信息
The error on a real quantity Y due to the graduation of the measuring instrument may be asymptotically represented, when the graduation is regular and fines down, by a Dirichlet form on R whose square field operator does not depend on the probability law of Y as soon as this law possesses a continuous density. This feature is related to the "arbitrary functions principle" (Poincare, Hopf). We give extensions of this property to R-d and to the Wiener space for some approximations of the Brownian motion. This gives new approximations of the Ornstein-Uhlenbeck gradient. These results apply to the discretization of some stochastic differential equations encountered in mechanics. (c) 2007 Elsevier Inc. All rights reserved.
暂无评论