Efficient routing on complex networks

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it efficient path}, which considers the possible congestion in the nodes along actual paths. Since the nodes with largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our new strategy, can be as redistributing traffic load in central nodes to other non-central nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.Comment: 4 pages, 4 figure

Towards Object-based Wide Area Distributed Systems

In order to facilitate the construction of wide area distributed systems, it is necessary that we adopt a model that simplifies application development. In this position paper we advocate an object-based approach. Our approach allows for flexibility because many of the technical details of distribution, such as communication protocols, consistency rules, etc. can be hidden behind the objects' interfaces. In addition, we allow distributed objects to offer alternative implementations for an interface. A client may choose the most suitable implementation. We discuss the use of distributed objects as the means to this end, and compare our approach to existing ones. 1 Introduction Wide area distributed applications pose varying demands on the underlying operating systems, often making the development of the application itself a difficult task. For example, development of distributed applications often requires the following: ffl Support for expressing communication at a sufficiently high..

Classification in sparse, high dimensional environments applied to distributed systems failure prediction

Network failures are still one of the main causes of distributed systems’ lack of reliability. To overcome this problem we present an improvement over a failure prediction system, based on Elastic Net Logistic Regression and the application of rare events prediction techniques, able to work with sparse, high dimensional datasets. Specifically, we prove its stability, fine tune its hyperparameter and improve its industrial utility by showing that, with a slight change in dataset creation, it can also predict the location of a failure, a key asset when trying to take a proactive approach to failure management

On the Particle Data Group evaluation of Psi' and chi_c Branching Ratios

I propose a new evaluation of $\psi'(2S)$ and $\chi_c(1P)$ branching ratios which avoids the correlations affecting the current Particle Data Group evaluation. These correlations explain the apparent technique-dependent discrepancies between the available determinations of the ${\cal B}(\chi_c(1P)\to p\bar p)$ and $\Gamma(\chi_c(1P)\to \gamma\gamma)$ under the hypotesis that the current values of the $\psi'(2S)\to\chi_c(1P)\gamma$ branching ratios are overestimated. In the process I also noticed that Particle Data Group has not restated many of the older measurements, when necessary, for the new value of ${\cal B}(J/\psi\to l^+l^-)$, which significantly affects the evaluation of some relevant $\psi'(2S)$ and $\chi_c(1P)$ exclusive branching ratios.Comment: 13 pages. Revised version. Submitted to Phys. Rev.

An Object Model for Flexible Distributed Systems

this paper we describe a new model for constructing operating systems and applications in an integrated fashion. Compared to current approaches we provide high-level primitives for supporting distributed and parallel applications. We also provide the flexibility to configure both applications and kernels to only include the functionality that is actually used. The model we describe is based on objects. Objects are used to structure both applications programs and operating system kernels. They also provide the application interface to the operating system kernel, and access to hardware devices for both kernels and applications. By providing structuring mechanisms for large (distributed) objects, we believe that applications will be are easier to build. At the same time we provide flexibility by allowing extensions of operating system kernels and applications with new objects at run time[8], and by providing a way to bind to objects dynamically. An important aspect of a distributed system is the scalability of the system [6]. A scalable system should not depend on centralized resources or on algorithms that need global information. At the same time, a flexible system can use different algorithms depending on the situation. For example, the use of broadcasting and multicasting on a local Ethernet can be quite effective but should be avoided on a world wide scale. In this paper we discuss an object model that provides two kinds of objects: local objects and distributed objects. In Section 2 we describe the nondistributed (local) objects, followed by distributed objects in Section 3. We compare our work to that of others in Section 4. 2 Local object

Spacings of Quarkonium Levels with the Same Principal Quantum Number

The spacings between bound-state levels of the Schr\"odinger equation with the same principal quantum number $N$ but orbital angular momenta $\ell$ differing by unity are found to be nearly equal for a wide range of power potentials $V = \lambda r^\nu$, with $E_{N \ell} \approx F(\nu, N) - G(\nu,N) \ell$. Semiclassical approximations are in accord with this behavior. The result is applied to estimates of masses for quarkonium levels which have not yet been observed, including the 2P $c \bar c$ states and the 1D $b \bar b$ states.Comment: 20 pages, latex, 3 uuencoded figures submitted separately (process using psfig.sty

Enhancing Transport Efficiency by Hybrid Routing Strategy

Traffic is essential for many dynamic processes on real networks, such as internet and urban traffic systems. The transport efficiency of the traffic system can be improved by taking full advantage of the resources in the system. In this paper, we propose a dual-strategy routing model for network traffic system, to realize the plenary utility of the whole network. The packets are delivered according to different "efficient routing strategies" [Yan, et al, Phys. Rev. E 73, 046108 (2006)]. We introduce the accumulate rate of packets, {\eta} to measure the performance of traffic system in the congested phase, and propose the so-called equivalent generation rate of packet to analyze the jamming processes. From analytical and numerical results, we find that, for suitable selection of strategies, the dual- strategy system performs better than the single-strategy system in a broad region of strategy mixing ratio. The analytical solution to the jamming processes is verified by estimating the number of jammed nodes, which coincides well with the result from simulation.Comment: 6 pages, 3 figure

Right Handed Weak Currents in Sum Rules for Axialvector Constant Renormalization

The recent experimental results on deep inelastic polarized lepton scattering off proton, deuteron and $^{3}$He together with polari% zed neutron $\beta$-decay data are analyzed. It is shown that the problem of Ellis-Jaffe and Bjorken sum rules deficiency and the neutron paradox could be solved simultaneously by assuming the small right handed current (RHC) admixture in the weak interaction Lagrangian. The possible RHC impact on pion-nucleon $\sigma$-term and Gamow-Teller sum rule for $(p,n)$ nuclear reactions is pointed out.Comment: to be published in Phys. Rev. Lett. LaTeX, 8 pages, 21 k

Electromagnetic form factors in the J/\psi mass region: The case in favor of additional resonances

Using the results of our recent analysis of e^+e^- annihilation, we plot the curves for the diagonal and transition form factors of light hadrons in the time-like region up to the production threshold of an open charm quantum number. The comparison with existing data on the decays of J/\psi into such hadrons shows that some new resonance structures may be present in the mass range between 2 GeVand the J/\psi mass. Searching them may help in a better understanding of the mass spectrum in both the simple and a more sophisticated quark models, and in revealing the details of the three-gluon mechanism of the OZI rule breaking in K\bar K channel.Comment: Formulas are added, typo is corrected, the text is rearranged. Replaced to match the version accepted in Phys Rev

Scheduling based on a dynamic resource connection

The practical using of distributed computing systems associated with many problems, including troubles with the organization of an effective interaction between the agents located at the nodes of the system, with the specific configuration of each node of the system to perform a certain task, with the effective distribution of the available information and computational resources of the system, with the control of multithreading which implements the logic of solving research problems and so on. The article describes the method of computing load balancing in distributed automatic systems, focused on the multi-agency and multi-threaded data processing. The scheme of the control of processing requests from the terminal devices, providing the effective dynamic scaling of computing power under peak load is offered. The results of the model experiments research of the developed load scheduling algorithm are set out. These results show the effectiveness of the algorithm even with a significant expansion in the number of connected nodes and zoom in the architecture distributed computing system