Dynamic Digital Simulation of HVDC Systems Using a Novel Modular Converter Model

This paper describes a method for the dynamic digital simulation of HVDC transmission systems. The method employs a novel modular converter representation during both normal and abnormal conditions.

Very-high-Q inductor simulation for active tuned filters

Abstract is not available.

Drag reduction by a forward facing aerospike for a large angle blunt cone in high enthalpy flows

Drag reduction studies are conducted using a flat disc tipped aerospike for a 120-degree apex angle blunt cone model in high enthalpy flows. Accelerometer based force balance is used for the drag force measurement in the newly established free piston driven shock tunnel, HST3. Drag reduction upto about 58 percent has been achieved for Mach 8 flow of 5 MJ/kg specific enthalpy at zero degree angle of attack.

Experimental investigation of heat transfer reduction using forward facing cavity for missile shaped bodies flying at hypersonic speed

Forward facing circular nose cavity of 6 mm diameter in the nose portion of a generic missile shaped bodies is proposed to reduce the stagnation zone heat transfer. About 25% reduction in stagnation zone heat transfer is measured using platinum thin film sensors at Mach 8 in the IISc hypersonic shock tunnel. The presence of nose cavity does not alter the fundamental aerodynamic coefficients of the slender body. The experimental results along with the numerically predicted results is also discussed in this paper.

Hybrid Simulation of Queuing-System Dynamics

This paper presents a simple hybrid computer technique to study the transient behaviour of queueing systems. This method is superior to stand-alone analog or digital solution because the hardware requirement is excessive for analog technique whereas computation time is appreciable in the latter case. By using a hybrid computer one can share the analog hardware thus requiring fewer integrators. The digital processor can store the values, play them back at required time instants and change the coefficients of differential equations. By speeding up the integration on the analog computer it is feasible to solve a large number of these equations very fast. Hybrid simulation is even superior to the analytic technique because in the latter case it is difficult to solve time-varying differential equations.

Monte Carlo simulation of Ising chains showing several phase transitions

A Monte Carlo simulation of Ising chains with competing short-range and infiniterange interactions has been carried out. Results show that whenever the system does not enter a metastable state, variation of temperature brings about phase transitions in the Ising chain. These phase transitions, except for two sets of interaction strengths, are generally of higher order and involve changes in the long-range order while the short-range order remains unaffected.

Coarse-Grained Molecular Dynamics Simulation of the Aggregation Properties of Multiheaded Cationic Surfactants in Water

The aggregation property of multiheaded surfactants has been investigated by constant pressure molecular dynamics (MD) simulation in aqueous medium. The model multiheaded surfactants contain more than one headgroup (x = 2, 3, and 4) for a single tail group. This increases the hydrophilic charge progressively over the hydrophobic tail which has dramatic consequences in the aggregation behavior. In particular, we have looked at the change in the aggregation property such as critical micellar concentration (cmc), aggregation number, and size of the micelles for the multiheaded surfactants in water. We find with increasing number of headgroups of the Multiheaded surfactants that the cmc values increase and the aggregation numbers as well as the size of the micelles decrease. These trends are in agreement with the experimental findings as reported earlier with x = 1, 2, and 3. We also predict the aggregation properties of multiheaded surfactant With four headgroups (x = 4) for which no experimental studies exist yet.

Graphical simulation of Petri Nets

An interactive graphics package for modeling with Petri Nets has been implemented. It uses the VT-11 graphics terminal supported on the PDP-11/35 computer to draw, execute, analyze, edit and redraw a Petri Net. Each of the above mentioned tasks can be performed by selecting appropriate items from a menu displayed on the screen. Petri Nets with a reasonably large number of nodes can be created and analyzed using this package. The number of nodes supported may be increased by making simple changes in the program. Being interactive, the program seeks information from the user after displaying appropriate messages on the terminal. After completing the Petri Net, it may be executed step by step and the changes in the number of tokens may be observed on the screen, at each place. Some properties of Petri Nets like safety, boundedness, conservation and redundancy can be checked using this package. This package can be used very effectively for modeling asynchronous (concurrent) systems with Petri Nets and simulating the model by “graphical execution.”

Simulation of laminar flow in a three-dimensional lid-driven cavity by lattice Boltzmann method

Purpose - The purpose of this paper is to apply lattice Boltzmann equation method (LBM) with multiple relaxation time (MRT) model, to investigate lid-driven flow in a three-dimensional (3D), rectangular cavity, and compare the results with flow in an equivalent two-dimensional (2D) cavity. Design/methodology/approach - The second-order MRT model is implemented in a 3D LBM code. The flow structure in cavities of different aspect ratios (0.25-4) and Reynolds numbers (0.01-1000) is investigated. The LBM simulation results are compared with those from numerical solution of Navier-Stokes (NS) equations and with available experimental data. Findings - The 3D simulations demonstrate that 2D models may predict the flow structure reasonably well at low Reynolds numbers, but significant differences with experimental data appear at high Reynolds numbers. Such discrepancy between 2D and 3D results are attributed to the effect of boundary layers near the side-walls in transverse direction (in 3D), due to which the vorticity in the core-region is weakened in general. Secondly, owing to the vortex stretching effect present in 3D flow, the vorticity in the transverse plane intensifies whereas that in the lateral plane decays, with increase in Reynolds number. However, on the symmetry-plane, the flow structure variation with respect to cavity aspect ratio is found to be qualitatively consistent with results of 2D simulations. Secondary flow vortices whose axis is in the direction of the lid-motion are observed; these are weak at low. Reynolds numbers, but become quite strong at high Reynolds numbers. Originality/value - The findings will be useful in the study of variety of enclosed fluid flows.

A real-time algorithm for simulation of flexible objects and hyper-redundant manipulators

Flexible objects such as a rope or snake move in a way such that their axial length remains almost constant. To simulate the motion of such an object, one strategy is to discretize the object into large number of small rigid links connected by joints. However, the resulting discretised system is highly redundant and the joint rotations for a desired Cartesian motion of any point on the object cannot be solved uniquely. In this paper, we revisit an algorithm, based on the classical tractrix curve, to resolve the redundancy in such hyper-redundant systems. For a desired motion of the `head' of a link, the `tail' is moved along a tractrix, and recursively all links of the discretised objects are moved along different tractrix curves. The algorithm is illustrated by simulations of a moving snake, tying of knots with a rope and a solution of the inverse kinematics of a planar hyper-redundant manipulator. The simulations show that the tractrix based algorithm leads to a more `natural' motion since the motion is distributed uniformly along the entire object with the displacements diminishing from the `head' to the `tail'.

The effect of horizontal resolution on simulation of very extreme US precipitation events in a global atmosphere model

We investigate the ability of a global atmospheric general circulation model (AGCM) to reproduce observed 20 year return values of the annual maximum daily precipitation totals over the continental United States as a function of horizontal resolution. We find that at the high resolutions enabled by contemporary supercomputers, the AGCM can produce values of comparable magnitude to high quality observations. However, at the resolutions typical of the coupled general circulation models used in the Fourth Assessment Report of the Intergovernmental Panel on Climate Change, the precipitation return values are severely underestimated.

An adaptive drug delivery design using neural networks for effective treatment of infectious diseases: A simulation study

An adaptive drug delivery design is presented in this paper using neural networks for effective treatment of infectious diseases. The generic mathematical model used describes the coupled evolution of concentration of pathogens, plasma cells, antibodies and a numerical value that indicates the relative characteristic of a damaged organ due to the disease under the influence of external drugs. From a system theoretic point of view, the external drugs can be interpreted as control inputs, which can be designed based on control theoretic concepts. In this study, assuming a set of nominal parameters in the mathematical model, first a nonlinear controller (drug administration) is designed based on the principle of dynamic inversion. This nominal drug administration plan was found to be effective in curing "nominal model patients" (patients whose immunological dynamics conform to the mathematical model used for the control design exactly. However, it was found to be ineffective in curing "realistic model patients" (patients whose immunological dynamics may have off-nominal parameter values and possibly unwanted inputs) in general. Hence, to make the drug delivery dosage design more effective for realistic model patients, a model-following adaptive control design is carried out next by taking the help of neural networks, that are trained online. Simulation studies indicate that the adaptive controller proposed in this paper holds promise in killing the invading pathogens and healing the damaged organ even in the presence of parameter uncertainties and continued pathogen attack. Note that the computational requirements for computing the control are very minimal and all associated computations (including the training of neural networks) can be carried out online. However it assumes that the required diagnosis process can be carried out at a sufficient faster rate so that all the states are available for control computation.

Simulation of Dust Loaded V-I Characteristics of a Commercial Thermal Power Plant Precipitator

A new approach based on finite difference method, is proposed for the simulation of electrical conditions in a dc energized wire-duct electrostatic precipitator with and without dust loading. Simulated voltage-curren characteristics with and without dust loading were compared with the measured characteristics for analyzing the performance of a precipitator. The simple finite difference method gives sufficiently accurate results with reduced mesh size. The results for dust free simulation were validated with published experimental data. Further measurements were conducted at a thermal power plant in India and the results compares well with the measured ones.

Dynamic simulation of activated sludge based wastewater treatment processes: Case studies with Titagarh Sewage Treatment Plant, India

STOAT has been extensively used for the dynamic simulation of an activated sludge based wastewater treatment plant in the Titagarh Sewage Treatment Plant, near Kolkata, India. Some alternative schemes were suggested. Different schemes were compared for the removal of Total Suspended Solids (TSS), b-COD, ammonia, nitrates etc. A combination of IAWQ#1 module with the Takacs module gave best results for the existing scenarios of the Titagarh Sewage Treatment Plant. The modified Bardenpho process was found most effective for reducing the mean b-COD level to as low as 31.4 mg/l, while the mean TSS level was as high as 100.98 mg/l as compared to the mean levels of TSS (92 62 mg/l) and b-COD (92.0 mg/l) in the existing plant. Scheme 2 gave a better scenario for the mean TSS level bringing it down to a mean value of 0.4 mg/l, but a higher mean value for the b-COD level at 54.89 mg/l. The Scheme Final could reduce the mean TSS level to 2.9 mg/l and the mean b-COD level to as low as 38.8 mg/l. The Final Scheme looks to be a technically viable scheme with respect to the overall effluent quality for the plant. (C) 2009 Elsevier B.V. All rights reserved.

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.