Optimal polygon placement by translation

Let M be an m-sided simple polygon and N be an n-sided polygon with holes. In this paper we consider the problem of computing the feasible region, i.e., the set of all placements by translation of M so that M lies inside N without intersecting any hole. First we propose an O (mn(2)) time algorithm for computing the feasible region for the case when M is a monotone polygon. Then we consider the general case when M is a simple polygon and propose an O(m(2)n(2)) time algorithm for computing the feasible region. Both algorithms are optimal upto a constant factor.

Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays

In this paper a pipelined ring algorithm is presented for efficient computation of one and two dimensional Fast Fourier Transform (FFT) on a message passing multiprocessor. The algorithm has been implemented on a transputer based system and experiments reveal that the algorithm is very efficient. A model for analysing the performance of the algorithm is developed from its computation-communication characteristics. Expressions for execution time, speedup and efficiency are obtained and these expressions are validated with experimental results obtained on a four transputer system. The analytical model is then used to estimate the performance of the algorithm for different number of processors, and for different sizes of the input data.

Stabilizing trench's algorithm to invert symmetric toeplitz matrices

Presented here is a stable algorithm that uses Zohar's formulation of Trench's algorithm and computes the inverse of a symmetric Toeplitz matrix including those with vanishing or nearvanishing leading minors. The algorithm is based on a diagonal modification of the matrix, and exploits symmetry and persymmetry properties of the inverse matrix.

Acoustic performance of hoses - A parametric study

Modeling of wave propagation in hoses, unlike in rigid pipes or waveguides, introduces a coupling between the inside medium, the hose wall, and the outside medium, This alters the axial wave number and thence the corresponding effective speed of sound inside the hose resulting in sound radiation into the outside medium, also called the breakout or shell noise, The existing literature on the subject is such that a hose cannot be integrated into the,whole piping system made up of sections of hoses, pipes, and mufflers to predict the acoustical performance in terms of transmission loss (TL), The present paper seeks to fill this gap, Three one-dimensional coupled wave equations are written to account for the presence of a yielding wall with a finite lumped transverse impedance of the hose material, The resulting wave equation can readily be reduced to a transfer matrix form using an effective wave number for a moving medium in a hose section, Incorporating the effect of fluid loading due to the outside medium also allows prediction of the transverse TL and the breakout noise, Axial TL and transverse TL have been combined into net TL needed by designers, Predictions of the axial as well as transverse TL are shown to compare well with those of a rigorous 3-D analysis using only one-hundredth of the computation time, Finally, results of some parametric studies are reported for engineers involved in the acoustical design of hoses. (C) 1996 Institute of Noise Control Engineering.

Experimental studies of a distorted turbulent spot in a three-dimensional flow

We report here on the results of a series of experiments carried out on a turbulent spot in a distorted duct to study the effects of a divergence with straight streamlines preceded by a short stretch of transverse streamline curvature, both in the absence of any pressure gradient. It is found that the distortion produces substantial asymmetry in the spot: the angles at which the spot cuts across the local streamlines are altered dramatically (in contradiction of a hypothesis commonly made in transition zone modelling), and the Tollmien-Schlichting waves that accompany the wing tips of the spot are much stronger on the outside of the bend than on the inside. However there is no strong effect on the internal structure of the spot and the eddies therein, or on such propagation characteristics as overall spread rate and the celerities of the leading and trailing edges. Both lateral streamline curvature and non-homogeneity of the laminar boundary layer into which the spot propagates are shown to be strong factors responsible for the observed asymmetry. It is concluded that these factors produce chiefly a geometric distortion of the coherent structure in the spot, but do not otherwise affect its dynamics in any significant way.

Pipelined ring algorithm for matrix multiplication on transputer networks: performance analysis and estimation

A parallel matrix multiplication algorithm is presented, and studies of its performance and estimation are discussed. The algorithm is implemented on a network of transputers connected in a ring topology. An efficient scheme for partitioning the input matrices is introduced which enables overlapping computation with communication. This makes the algorithm achieve near-ideal speed-up for reasonably large matrices. Analytical expressions for the execution time of the algorithm have been derived by analysing its computation and communication characteristics. These expressions are validated by comparing the theoretical results of the performance with the experimental values obtained on a four-transputer network for both square and irregular matrices. The analytical model is also used to estimate the performance of the algorithm for a varying number of transputers and varying problem sizes. Although the algorithm is implemented on transputers, the methodology and the partitioning scheme presented in this paper are quite general and can be implemented on other processors which have the capability of overlapping computation with communication. The equations for performance prediction can also be extended to other multiprocessor systems.

Flow induced by an asymmetrically placed disk rotating coaxially inside a cylindrical casing

In this paper, the flow due to a rotating disk non-symmetrically placed with respect to the height of the enclosing stationary cylinder is analyzed numerically. The full Navier-Stokes equations expressed in terms of stream function and vorticity are solved by successive over-relaxation for different disk radii, its distance from the bottom casing and rotational Reynolds numbers. It is observed that the flow pattern is strongly influenced by the size and the position of the disk. When the disk is very close to the top casing and small in radius, there are two regions of different scales and the vortices in the region of small scale are trapped between the disk and the top casing. Further, the variation of the moment coefficient is determined for different positions and sizes of the rotating disk. The calculations shows that the frictional torque increases rapidly, when the disk approaches the top casing. This finding is of importance for the design of vertical rotating disk reactors applied in chemical vapor deposition.

The actor-critic algorithm as multi-time-scale stochastic approximation

The actor-critic algorithm of Barto and others for simulation-based optimization of Markov decision processes is cast as a two time Scale stochastic approximation. Convergence analysis, approximation issues and an example are studied.

A fault-tolerant distributed deadlock detection algorithm

In this paper, we propose a new fault-tolerant distributed deadlock detection algorithm which can handle loss of any resource release message. It is based on a token-based distributed mutual exclusion algorithm. We have evaluated and compared the performance of the proposed algorithm with two other algorithms which belong to two different classes, using simulation studies. The proposed algorithm is found to be efficient in terms of average number of messages per wait and average deadlock duration compared to the other two algorithms in all situations, and has comparable or better performance in terms of other parameters.

A token-based distributed algorithm for total order atomic broadcast

In this paper, we propose a new token-based distributed algorithm for total order atomic broadcast. We have shown that the proposed algorithm requires lesser number of messages compared to the algorithm where broadcast servers use unicasting to send messages to other broadcast servers. The traditional method of broadcasting requires 3(N - 1) messages to broadcast an application message, where N is the number of broadcast servers present in the system. In this algorithm, the maximum number of token messages required to broadcast an application message is 2N. For a heavily loaded system, the average number of token messages required to broadcast an application message reduces to 2, which is a substantial improvement over the traditional broadcasting approach.

Identification of delamination in composite beams using spectral estimation and a genetic algorithm

An efficient strategy for identification of delamination in composite beams and connected structures is presented. A spectral finite-element model consisting of a damaged spectral element is used for model-based prediction of the damaged structural response in the frequency domain. A genetic algorithm (GA) specially tailored for damage identification is derived and is integrated with finite-element code for automation. For best application of the GA, sensitivities of various objective functions with respect to delamination parameters are studied and important conclusions are presented. Model-based simulations of increasing complexity illustrate some of the attractive features of the strategy in terms of accuracy as well as computational cost. This shows the possibility of using such strategies for the development of smart structural health monitoring softwares and systems.

Machine-tool selection and operation allocation in FMS: solving a fuzzy goal-programming model using a genetic algorithm

The decision-making process for machine-tool selection and operation allocation in a flexible manufacturing system (FMS) usually involves multiple conflicting objectives. Thus, a fuzzy goal-programming model can be effectively applied to this decision problem. The paper addresses application of a fuzzy goal-programming concept to model the problem of machine-tool selection and operation allocation with explicit considerations given to objectives of minimizing the total cost of machining operation, material handling and set-up. The constraints pertaining to the capacity of machines, tool magazine and tool life are included in the model. A genetic algorithm (GA)-based approach is adopted to optimize this fuzzy goal-programming model. An illustrative example is provided and some results of computational experiments are reported.

Neural network based optimal routing algorithm for communication networks

This paper presents the capability of the neural networks as a computational tool for solving constrained optimization problem, arising in routing algorithms for the present day communication networks. The application of neural networks in the optimum routing problem, in case of packet switched computer networks, where the goal is to minimize the average delays in the communication have been addressed. The effectiveness of neural network is shown by the results of simulation of a neural design to solve the shortest path problem. Simulation model of neural network is shown to be utilized in an optimum routing algorithm known as flow deviation algorithm. It is also shown that the model will enable the routing algorithm to be implemented in real time and also to be adaptive to changes in link costs and network topology. (C) 2002 Elsevier Science Ltd. All rights reserved.

Performance analysis of the random early detection algorithm

In this article we consider a finite queue with its arrivals controlled by the random early detection algorithm. This is one of the most prominent congestion avoidance schemes in the Internet routers. The aggregate arrival stream from the population of transmission control protocol sources is locally considered stationary renewal or Markov modulated Poisson process with general packet length distribution. We study the exact dynamics of this queue and provide the stability and the rates of convergence to the stationary distribution and obtain the packet loss probability and the waiting time distribution. Then we extend these results to a two traffic class case with each arrival stream renewal. However, computing the performance indices for this system becomes computationally prohibitive. Thus, in the latter half of the article, we approximate the dynamics of the average queue length process asymptotically via an ordinary differential equation. We estimate the error term via a diffusion approximation. We use these results to obtain approximate transient and stationary performance of the system. Finally, we provide some computational examples to show the accuracy of these approximations.