O Research (OR) instructors use visualizations to help teach graph algorithms and data structures. Algorithm visualization is an illustration of abstract concepts included in computer algorithms, making use of either static or dynamic (animated) computer graphics. In this paper we present new software that includes an animated demonstration of the uncapacitated primal network simplex algorithm....

We propose a methodology for animating complexmodels based on simplexmesh represen tation and deformation A simplex mesh is characterized by a connectivity between vertices of three and can be obtained by duality from a triangulation In addition to their generality of representation simplex meshes have a compact and unambiguous shape description related to the notion of mean curvature We devise...

An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...

Recent work in mathematical neuroscience has calculated the directed graph homology of simplicial complex given by brains sparse adjacency graph, so called connectome. These biological connectomes show an abundance both high-dimensional simplices and Betti-numbers all viable dimensions - contrast to Erd\H{o}s-R\'enyi-graphs comparable size density. An analysis synthetically trained reveals simi...

Block motion estimation can be regarded as a function minimization problem in a finite-dimensional space. Therefore, fast block motion estimation can be achieved by using an efficient function minimization algorithm instead of a predefined search pattern, such as diamond search. Downhill simplex search is an efficient derivative-free function minimization algorithm. In this paper, we proposed a...

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...

Transmission network expansion planning (TNEP) is an important component of power system planning. Itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. Different methods have been proposed for the solution of the static transmissionnetwork expansion planning (STNEP) problem till now. But in all of them, STNEP pr...

this study is devoted to the formulation of the network design problem of one-way streets and the application of simulated annealing (sa) algorithm to solve this problem for a large real network. it discusses some points of views on one-way street networks, the objective function used for design, the way in which design constraints may be considered, and the traffic problems concerning one-way ...

We present Barrier-based Simplex (Bb-Simplex), a new, provably correct design for runtime assurance of continuous dynamical systems. Bb-Simplex is centered around the Control Architecture, which consists high-performance advanced controller not guaranteed to maintain safety plant, verified-safe baseline controller, and decision module that switches control plant between two controllers ensure w...