In this paper, we study the problem of laying out a multigrid network,MN , on a grid of minimum area. Precisely, we describe a layout having area ( 2N − 3)× (3N − 4), which is of the same order of magnitude as the lower bound.  1999 Published by Elsevier Science B.V. All rights reserved.

A new method based on principal component analysis (PCA) and artificial neural networks (ANN) is proposed for fault diagnosis of gearboxes. Firstly the six different base wavelets are considered, in which three are from real valued and other three from complex valued. Two wavelet selection criteria Maximum Energy to Shannon Entropy ratio and Maximum Relative Wavelet Energy are used and compared...

The layout problem for trees with weighted edges is motivated by the design of very large scale integrated circuits. Some of the nodes are xed and the object is to position the remainder so that the total weighted edge cost is minimized. The cost of each edge is the product of its weight and its length under some appropriate norm. Optimization for planar layouts is shown to be NP-hard. If cross...

Neural systems of organisms derive their functionality largely from the numerous and intricate connections between individual components. These connections are costly and have been refined via evolutionary pressure that acts to maximize their functionality while minimizing the associated cost. This tradeoff can be formulated as a constrained optimization problem. In this paper, we use simulated...

The visual impact of wind farm layouts has seen little consideration in the literature on the wind farm layout optimisation problem to date. Most existing algorithms focus on optimising layouts for power or the cost of energy alone. In this paper, we consider the geometry of wind farm layouts and whether it is possible to bi-optimise a layout for both energy efficiency and the degree of visual ...

The main bene1ts of a three-dimensional layout of interconnection networks are the savings in material (measured as volume) and the shortening of wires. The result presented in this paper is a general formula for calculating a lower bound on the volume. Moreover, for butter3y and X-tree networks we show layouts optimizing the maximum wire length and whose upper bounds on the volume are close to...

Many visual representations for trees have been developed in information and software visualization. One of them are cone trees, a well-known three-dimensional representation for trees. This paper is based on an approach for constructing cone trees bottom-up. For this approach, an optimal layout for these trees is given together with a proof that based on the assumptions, there can be no better...

LayOPTTM is an innovative facilities layout analysis and optimization software package which can be used by layout planners and engineers in the optimal solution of single and multiple floor facility layout problems. LayOPT is ideal for the re-design of the overall layout for an existing facility or the development of a block layout for a new building. It can be applied to manufacturing, wareho...

ÐPreparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981 [17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we aunfoldo the cycles in the CCC, the resulting st...

We study a problem motivated by rectilinear schematization of geographic maps. Given a biconnected plane graph G and an integer k ≥ 0, does G have a strictorthogonal drawing (i.e., an orthogonal drawing without edge bends) with at most k reflex angles per face? For k = 0, the problem is equivalent to realizing each face as a rectangle. We prove that the strict-orthogonal drawability problem for...