Search results for "routing"
showing 10 items of 587 documents
Construction of Disjoint Virtual Backbones for Wireless Sensor Networks
2020
A wireless sensor network is a wireless network of sensors aimed at monitoring physical events. It has ingratiated itself into almost all areas of human endeavors. Data dissemination in these networks is quite challenging and is generally accomplished by flooding. But flooding introduces broadcast storm problem due from implosion and overlap. To overcome this, topology management can prescribe a virtual backbone network to which routing is confined. In this paper we propose an algorithm that constructs multiple disjoint virtual backbone networks, using only nodes' locations. The disjointedness makes routing more robust and the network exploitation energy efficient. Simulations show our algo…
The Network Balance Realized by Routing Organization System
2011
In the presented paper, we propose to exploit routing organization for the purpose of managing network resources. According to our assumptions, we have the same quantity of materials, objects, tokens, tools etc. at our disposal in every node of the network. During network operation we must distribute resources between these nodes. It should be carried out as instantaneously and as economically as possible. Multi-Agent Systems are also used to deal with this kind of tasks and the centralised algorithms presented in this paper are to be used to measure the efficiency of the distributed MAS solution. From the logistical point of view, we have a sequence of stages with different states of token…
Multi-Resource Management for Multi-Tier Space Information Networks: A Cooperative Game
2019
With the drastic increase of space information network (SIN) traffic and the diversity of network traffic types, the optimal allocation of the scarce network resources is of great significance for optimizing the SIN system capability. In this paper, we propose a multi-resource management method for multi-tier SIN using the cooperative Nash bargaining solution. Since the original problem is a non-convex problem, we firstly make logarithmic transition, and then find a tightest lower bound function to convert the initial problem into a convex one. In order to carry out the optimal bandwidth and power allocation in SIN, we construct a joint bandwidth and power allocation (JBPA) algorithm. Simul…
The accuracy of molecular dipole moments in standard electronic structure calculations
2000
Abstract A systematic investigation has been carried out of the accuracy of calculated molecular equilibrium dipole moments of 11 polar closed-shell molecules, using the HF, MP2, CCSD and CCSD(T) models and correlation-consistent basis sets. Augmented basis sets are important for improving the basis-set convergence, but the quality of the results depends more on the correlation treatment than on the cardinal number of the basis set. Augmented triple-zeta basis sets are sufficient for most calculations. The mean absolute error of the HF calculations is 0.16 D, which is reduced at the MP2 and CCSD levels to 0.048 and 0.025 D, respectively. The CCSD(T) errors are small – typically
A correction method for dynamic analysis of linear systems
2004
Abstract This paper proposes an analytical method to improve the accuracy of the dynamic response of classically damped linear systems, as given by a standard truncated modal analysis. Upon computing the first m undamped modes of a n-degree-of-freedom system, two sets of equations in the Rn nodal space are built, which are uncoupled and govern the contribution to the response of the m computed modes and the remaining (n−m) unknown modes, respectively. The first set is solved in the Rm modal space by using the m available modes; the second set is solved in a reduced R(n−m) nodal space, without computing additional modes. Specifically, it is shown that the particular solution of the second se…
Gibberellic acid and flower bud development in loquat (Eriobotrya japonica Lindl.)
2011
The application of gibberellic acid (GA 3) to the whole loquat tree from mid-May to early June and from early August to the onset of flowering, significantly reduced the number of premature flowering shoots per current shoot and per m 3 of canopy, and so reduced the total number of panicles per m 3 of canopy. The number of vegetative shoots per m 3 of canopy was also significantly reduced by applying GA 3. The response depended on the concentration applied and produced optimal results at 50mgl -1. Differences in the number of flowers per panicle and leaves per shoot were not significantly modified by the treatment. Nevertheless, GA 3 applied directly to the developing apex near to flower di…
The mixed capacitated general routing problem with turn penalties
2011
In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing problems, and it takes into account turn penalties and forbidden turns, which are crucial in many real-life applications, such as mail delivery, waste collection and street maintenance operations. Through a polynomial transformation of the considered problem into a Generalized Vehicle routing problem, we suggest a new approach for solving this new problem by transforming it into an Asymmetric Capacitated Vehicle routing problem. In this way, we can solve the new problem both optimally and heuristically using existing algorithms. A powerfu…
Approximate Algorithm for Fast Capacity Provisioning in WANs with Trade-Off between Performance and Cost under Budget Constraint
2014
Due to the emergence of Software Defined Networking (SDN) with the idea of centralized control over computer networks, the Capacity and Flow Assignment Problem (CFA) may be approached in a classical non-distributed fashion in real-life scenarios. The question arises whether a heuristical approach to this NP-complete problem is of any use in practice.
Convergence in discrete Cauchy problems and applications to circle patterns
2005
A lattice-discretization of analytic Cauchy problems in two dimensions is presented. It is proven that the discrete solutions converge to a smooth solution of the original problem as the mesh size ε \varepsilon tends to zero. The convergence is in C ∞ C^\infty and the approximation error for arbitrary derivatives is quadratic in ε \varepsilon . In application, C ∞ C^\infty -approximation of conformal maps by Schramm’s orthogonal circle patterns and lattices of cross-ratio minus one is shown.
Loss of input from the mossy cells blocks maturation of newly generated granule cells.
2007
The objective of this work is to check whether the input from the mossy cells to the inner molecular layer is necessary for the integration and maturation of the newly generated granule cells of the dentate gyrus (DG) in mice, and if after status epilepticus the sprouting of the mossy fibers can substitute for this projection. Newly generated cells were labeled by administration of 5-bromo-deoxyuridine either before or after pilocarpine administration. The neuronal loss in the hippocampus after administration of pilocarpine combined with scopolamine and diazepam seemed restricted to the hilar mossy cells. The maturation of the granule cells was studied using immunohistochemistry for calreti…