[en] An early, but at the time illuminating, piece of work on how to deal with a general, linearly coupled accelerator lattice is revisited. This work is based on the SLIM formalism developed in 1979-1981

[en] We study epidemic spreading in two interconnected complex networks. It is found that in our model the epidemic threshold of the interconnected network is always lower than that in any of the two component networks. Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. Theoretical analysis and simulation results show that, generally speaking, the epidemic size is not significantly affected by the inter-network correlation. In interdependent networks which can be viewed as a special case of interconnected networks, however, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant. -- Highlights: ► We study epidemic spreading in two interconnected complex networks. ► The epidemic threshold is lower than that in any of the two networks. And Interconnection correlation has impacts on threshold and average outbreak size. ► Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. ► We demonstrated and proved that Interconnection correlation does not affect epidemic size significantly. ► In interdependent networks, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant.

No abstract available

[en] An upper bound for the ratio of wealths of the best constant -rebalanced portfolio to that of the multinomial universal portfolio is derived. The finite- order multinomial universal portfolios can reduce the implementation time and computer-memory requirements for computation. The improved performance of the finite-order portfolios on some selected local stock-price data sets is observed.

[en] In the paper, some variants of Montgomery identity with the help of delta and nabla integrals are established which are useful to produce Montgomery identity involving alpha diamond integrals for function of two variables. The aforementioned identity is discussed in discrete, continuous, quantum calculus as well and employed to obtain Ostrowski type inequality for monotonically increasing function with respect to both parameters.

[en] Let f₁,...,f_r be polynomials in n variables, over the field F_q, and suppose that their degrees are d₁,...,d_r. It was shown by Warning in 1935 that if N is the number of common zeros of the polynomials f_i, then N≥q^n-d. It is the main aim of the present paper to improve on this bound. When the set of common zeros does not form an affine linear subspace in F_qⁿ, it is shown for example that N≥2q^n-d if q≥4, and that N≥q^n+1-d/(n+2-d) if the f_i are all homogeneous. Bibliography: 5 titles.

[en] The paper discuss the computation of the worst case uncertainty (WCU) in common measurement problems. The usefulness of computing the WCU besides the standard uncertainty is illustrated. A set of equations to compute the WCU in almost all practical situations is presented. The application of the equations to real-world cases is shown

[en] Spline-based deformable registration methods are quite popular within the medical-imaging community due to their flexibility and robustness. However, they require a large amount of computing time to obtain adequate results. This paper makes two contributions towards accelerating B-spline-based registration. First, we propose a grid-alignment scheme and associated data structures that greatly reduce the complexity of the registration algorithm. Based on this grid-alignment scheme, we then develop highly data parallel designs for B-spline registration within the stream-processing model, suitable for implementation on multi-core processors such as graphics processing units (GPUs). Particular attention is focused on an optimal method for performing analytic gradient computations in a data parallel fashion. CPU and GPU versions are validated for execution time and registration quality. Performance results on large images show that our GPU algorithm achieves a speedup of 15 times over the single-threaded CPU implementation whereas our multi-core CPU algorithm achieves a speedup of 8 times over the single-threaded implementation. The CPU and GPU versions achieve near-identical registration quality in terms of RMS differences between the generated vector fields.

[en] A method is proposed for calculating the actual contact area in a pressure coupling between components of different hardness. The reduced plastic hardness of the components is discussed.

[en] Two different local density approximation (Xα and Kohn-Sham exchange and Perdew-Zunger correlation) of the density funcitonal method have been used to calculate structural and electronic properties of six kinds of polyfluoroethylene, including polytetrafluoroethylene (PTFE), poly(1,2-difluorethylene) (PDFE), and others, for several different dihedral angles. For PTFE and PDFE, all the geometric parameters are optimized simultaneously in the stable helical conformation. The position of the minimum and the depth of the potential well are in good agreement with the experimental results. The stable helical conformation are found for PTFE and PDFE. For PDFE a shoulder close to the stable gauche conformation is found in the energy curve. The potential curves of another four kinds of polyfluorethylene are studied in detail close to the planar conformation. The side fluorine atoms strongly affect the conformation and the electronic structure. The band structure of PTFE and PDFE in optimized geometry and the other PFEs in planar zigzag conformation are calculated in good agreement with experimental results