recently different approaches have been developed in the field of sensor fault diagnostics based on auto-associative neural network (aann). in this paper we present a novel algorithm called self reconstructing auto-associative neural network (s-aann) which is able to detect and isolate single faulty sensor via reconstruction. we have also extended the algorithm to be applicable in multiple faul...

one of the main challenges in wireless sensor network is energy problem and life cycle of nodes in networks. several methods can be used for increasing life cycle of nodes. one of these methods is load balancing in nodes while transmitting data from source to destination. directed diffusion algorithm is one of declared methods in wireless sensor networks which is data-oriented algorithm. direct...

The Periodic Event Scheduling Problem (PESP), in which events have to be scheduled repeatedly over a given period, is a complex and wellknown discrete problem with numerous real-world applications. One of them is to find periodic timetables which is economically important, but difficult to handle mathematically, since even finding a feasible solution to this problem is known to be NP-hard. On t...

In the early 1970s, by work of Klee and Minty (1972) and Zadeh (1973), the Simplex Method, the Network Simplex Method, and the Successive Shortest Path Algorithm have been proved guilty of exponential worst-case behavior (for certain pivot rules). Since then, the common perception is that these algorithms can be fooled into investing senseless effort by ‘bad instances’ such as, e. g., Klee-Mint...

DYLP is a linear programming code implementing a dynamic simplex algorithm similar to that outlined by Padberg in [5]. The code attempts to maintain a reduced active constraint system by regularly purging loose constraints and variables with unfavourable reduced costs, and adding violated constraints and variables with favourable reduced costs. In abstract, the code alternates between primal an...

The paper addresses tlie design of tlie polyphase IIR filters based on the “’-order single-coefficient allpass sub-filters in the constraint coefficient space using the Constraint Dowdiill Simplex Algorithm. Incorporating the bit-flipping algorithm into its core engine allowed the optitilisation routine to converge to better target designs without affecting tlie Iiigli speed of tlie original al...

We define a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that using this condition the iterative algorithm terminates successfully. Additionally we provide an O(n) algorithm that renumbers any simplex grid to fulfil this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibility and al...

Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...

A geometrical analysis is made of the dual simplex algorithm applied to a linear programming formulation of the one-center location problem in IR (2) using block distance. A geometric rule is given, and shown to be equivalent to the minimum ratio rule of the simplex algorithm, for updating the dual basis. The geometric analysis is applied to the Euclidean distance one-center problem and yields ...