Search results for "CIRCUIT"
showing 10 items of 936 documents
A New Crowded Comparison Operator in Constrained Multiobjective Optimization for Capacitors Sizing and Siting in Electrical Distribution Systems
2005
This paper presents a new Crowded Comparison Operator (CCO) for NSGA-II to solve the Multiobjective and constrained problem of optimal capacitors placement in electrical distribution systems.
Finding all optimal solutions to the network flow problem
1986
The problem examined in this paper is as follows: Given a feasible optimum basic solution (f.o.b.s) of the minimum cost network flow problem, find all the f.o.b.s of this problem. The existence of alternative f.o.b.s is characterized by means of elementary circuits of zero cost and length greater than two in the incremental graph associated to the given f.o.b.s. It is shown that any alternative f.o.b.s. can be obtained from the original one by circulating flow through elementary circuits belonging to a succession of incremental graphs. This result leads to the construction of an efficient algorithm to obtain all f.o.b.s. of the network flow problem.
Optimal Delay-Power Tradeoff in Sparse Delay Tolerant Networks: a preliminary study
2006
In this paper we present a first attempt to study analytically the tradeoff between delivery delay and resource consumption for epidemic routing in Delay Tolerant Networks. We assume that the nodes cooperate in order to minimize a common cost equal to a weighted sum of the packet delivery delay and the total number of copies, which is strongly related to the power consumption. In this framework we determine the best policy each node should deploy in a very simple scenario where all the nodes have perfect knowledge of the system status. The result is used as an ideal reference to evaluate the performance of some heuristics proposed, investigating potential performance improvements and config…
A new method for creating sparse design velocity fields
2006
We present a novel method for the computation of mesh node sensitivities with respect to the boundary node movement. The sensitivity field is sparse in a sense that movement of each boundary node affects only given amount of inner mesh nodes, which can result in considerable savings in the storage space. The method needs minimal control from the user, and it does not place any restrictions (such as block structure) on the mesh. Use of the method is demonstrated with a shape optimization problem using CAD-free parametrization. A solution to the classical die-swell free boundary problem by coupling the boundary node locations with the state variables is also presented. In that case, sparsity …
Optimal positioning of irregular shapes in stamping die strip
2010
The nesting of two-dimensional shapes is a common problem, where raw material has to be economically cut. As for the single-pass single-row strip layout, several algorithms, based on established methods, have been proposed. Moreover, it should be noticed that the optimum layout should also consider a few constraints, like grain orientation for subsequent forming operation, correct bridge width, and the commercial roll of metal width in order to make solutions applicable in real industrial environments. Most of the procedures until now shown in literature are quite complex and often ignore these real constraints. They usually make use of sliding techniques and are not able to effectively wor…
Design of a Permanent Magnet Synchronous Generator using Interactive Multiobjective Optimization
2017
We consider an analytical model of a permanent magnet synchronous generator and formulate a mixed-integer constrained multiobjective optimization problem with six objective functions. We demonstrate the usefulness of solving such a problem by applying an interactive multiobjective optimization method called NIMBUS. In the NIMBUS method, a decision is iteratively involved in the optimization process and directs the solution process in order to find her/his most preferred Pareto optimal solution for the problem. We also employ a commonly used noninteractive evolutionary multiobjective optimization method NSGA-II to generate a set of solutions that approximates the Pareto set and demonstrate t…
A heuristic for fast convergence in interference-free channel assignment using D1EC coloring
2010
This work proposes an efficient method for solving the Distance-1 Edge Coloring problem (D1EC) for the assignment of orthogonal channels in wireless networks with changing topology. The coloring algorithm is performed by means of the simulated annealing method, a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a suboptimal coloring scheme. Furthermore, a stateful implementation of the D1EC scheme is proposed, in which network coloring is executed upon topology changes. The stateful D1EC is also based on simulated annealing and reduces the algorithm’s convergence time by one order of magnitude in …
OLS Identification of network topologies
2011
Abstract In many applications, it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function where a set of parameters are used to operate a trade-off between accuracy and complexity in the final model. The problem of reducing the complexity is addressed by fixing a certain degree of sparsity and finding the…
Scenario of the Birth of Hidden Attractors in the Chua Circuit
2017
Recently it was shown that in the dynamical model of Chua circuit both the classical selfexcited and hidden chaotic attractors can be found. In this paper the dynamics of the Chua circuit is revisited. The scenario of the chaotic dynamics development and the birth of selfexcited and hidden attractors is studied. It is shown a pitchfork bifurcation in which a pair of symmetric attractors coexists and merges into one symmetric attractor through an attractormerging bifurcation and a splitting of a single attractor into two attractors. The scenario relating the subcritical Hopf bifurcation near equilibrium points and the birth of hidden attractors is discussed.
Contractions yielding new supersymmetric extensions of the poincaré algebra
1991
Two new Poincare superalgebras are analysed. They are obtained by the Wigner-Inonu contraction from two real forms of the superalgebra OSp(2;4;C) - one describing the N = 2 anti-de-Sitter superalgebra with a non-compact internal symmetry SO(1, 1) and the other corresponding to the de-Sitter superalgebra with internal symmetry SO(2). Both are 19-dimensional self-conjugate extensions of the Konopel'chenko superalgebra. They contain 10 Poincare generators and one generator of internal symmetry in addition to 8 odd generators half of which, however, do not commute with translations.