We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distan...

We present a fast approximation algorithm for the 1-median problem. Our algorithm can be applied to metric undirected graphs with node weight. Given a node v, our algorithm repeatedly executes a process of finding a node with higher centrality,in which an approximate centrality of each node v’ is calculated for the subgraph called the best kNSPGS of (v,v’). The best kNSPGS of (v,v’) is a subgra...

Stiffness matrix of the four-node quadrilateral plane stress element is decomposed into normal and shear components. A computer program is developed to obtain the straining modes using adequate and reduced integration. Then a solution for the problem of mixing straining modes is found. Accuracy of the computer program is validated by a closed-form stiffness matrix, derived for the plane rectang...

The paper presents a new reduction method designed for dynamic contact problems. Recently, we have proposed an efficient scheme the node-to-node formulation, that leads to Linear Complementarity Problems (LCP). Here, enhance underlying problem node-to-segment formulation. Due application of dual approach, Nonlinear Problem (NCP) is obtained, where condition described by quadratic inequality and...

Given a rooted tree with n nodes, the tree shortcut problem is to add a set of shortcut edges to the tree such that the shortest path from each node to any of its ancestors is of length O(logn) and the degree increment of each node is constant. We consider in this paper the dynamic version of the problem, which supports node insertion and deletion. For insertion, a node can be inserted as a lea...

In the problem of remote estimation by a centralized observer, improvements to accuracy observer estimates come at cost higher communication bandwidth and energy consumption. this article we improve reducing measurement variance on sensor node before its transmission node. The main contribution is show that trade-off between dynamical system variance. As result there an optimal averaging time m...

The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,......n} to a central node with minimal total link cost such that (a) each terminal node j has exactly one entering link; (b) for each terminal node j, a unique path from the central node to j exists; (c) for each terminal node j the number ...

The aim of this paper is to investigate geometrically nonlinear static analysis of axially functionally graded cantilever beam subjected to transversal non follower load. The considered problem is solved by finite element method with total Lagrangian kinematic approach. The material properties of the beam vary along the longitudinal direction according to the power law function. The finite elem...

Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...

in this study 121 prescapular, prefemoral and popliteal lymph node of male healthy camel from mashhad abattoir were collected. after collecting of specimens factors such as: length, width, thickness, weight, volume and density of each lymph node were measured by caliper device. all factors were analyzed and compared using excel program. it was revealed that, normal dimensions of right prescapul...