The paper proposes a polynomial algorithm for solving systems of linear inequalities. The algorithm uses a polynomial relaxation-type procedure which either finds a solution for Ax = b,0 ≤ x ≤ 1, or decides that the system has no integer solutions. 1 Polynomial algorithm The polynomial algorithm described in [2] either solves a linear system Ax = b,0 ≤ x ≤ 1, or decides that it has no 0,1-solut...

Calculating and monitoring customer churn metrics is important for companies to retain customers earn more profit in business. In this study, a prediction framework developed by modified spectral clustering (SC). However, the similarity measure plays an imperative role predicting with better accuracy analyzing industrial data. The linear Euclidean distance traditional SC replaced non-linear S-d...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

It is shown that the expressions for tangential pressure, anisotropy factor and radial pressure in Einstein - Maxwell equations may serve as generating functions charged stellar models. The latter can incorporate an equation of state when expression energy density also used. Other are based on condition existence conformal motion (conformal flatness particular) Karmarkar embedding class one met...

in this paper, an efficient fault-tolerant routing algorithm for mobile ad-hoc networks (manets) is presented. the proposed algorithm increases the network fault-tolerance using natural redundancy of ad-hoc networks. this algorithm is carried out in two stages; 1) the selection of backup nodes 2) the selection of backup route(s). in the first stage, the proposed algorithm chooses nodes with the...