Abstract We study map lattices coupled by collision and show how perturbations of transfer operators associated with the spatially periodic approximation model can be used to extract information about collisions per lattice unit. More precisely, we a on finite box L sites boundary conditions, collision. derive, via non-trivial first-order for leading eigenvalue rare event operator, formula firs...

We consider the problem of maximizing a non-negative monotone submodular function subject to knapsack constraint, which is also known as Budgeted Submodular Maximization (BSM) problem. Sviridenko (Operat Res Lett 32:41–43, 2004) showed that by guessing 3 appropriate elements an optimal solution, and then executing greedy algorithm, one can obtain approximation ratio $$\alpha =1-{1}/{e} \approx ...

The specific heat of Cd Mn Se (x = 0.01) and Cd , Mn S (x = 0.026) in the temperature range of 0.3 - 40K was measured. The measurements were carried out in different applied magnetic fields (H = 0,10,20, 28KG). The results were analyzed with a model which includes long range interactions. Calculations based on on extended version of nearest neighbor pair approximation (including triplets)...

290 Word count: 4,418 Text + 3 Tables + 7 Figures = 7,168 Submission Date: August 1, 2008 Revised version submitted Date: November 15, 2008 Paper submitted for Presentation and Publication in the TRANSPORTATION RESEARCH RECORD, JOURNAL OF TRANSPORTATION RESEARCH BOARD AFTER BEING PRESENTED Transportation Research Board’s 88 Annual Meeting, Washington, D.C., 2009 (Revised on 11/15/08)

There have been many studies on the simultaneous approximation capability of feedforward neural networks (FNNs). Most of these, however, are only concerned with the density or feasibility of performing simultaneous approximations. This paper considers the simultaneous approximation of algebraic polynomials, employing Taylor expansion and an algebraic constructive approach, to construct a class ...

While the basic greedy algorithm gives a semi-streaming with an approximation guarantee of 2 for unweighted matching problem, it was only recently that Paz and Schwartzman obtained analogous result weighted instances. Their approach is based on versatile local ratio technique also applies to generalizations such as hypergraph matchings. However, framework analysis fails related problem matroid ...

The maximum traveling salesman problem (Max TSP) consists of finding a Hamiltonian cycle with the total weight edges in given complete weighted graph. This is APX-hard general metric case but admits polynomial-time approximation schemes geometric setting, when edge weights are induced by vector norm fixed-dimensional real space. We propose first scheme for Max TSP an arbitrary space fixed doubl...