Detection of contiguous and distributed damage through contours of equal frequency change

The paper presents the results of a computational modeling for damage identification process for an axial rod representing an end-bearing pile foundation with known damage and a simply supported beam representing a bridge girder. The paper proposes a methodology for damage identification from measured natural frequencies of a contiguously damaged reinforced concrete axial rod and beam, idealized with distributed damage model. Identification of damage is from Equal_Eigen_value_change (Iso_Eigen_value_Change) contours, plotted between pairs of different frequencies. The performance of the method is checked for a wide variation of damage positions and extents. An experiment conducted on a free-free axially loaded reinforced concrete member and a flexural beam is shown as examples to prove the pros and cons of this method. (C) 2009 Elsevier Ltd. All rights reserved.

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.

Distributed space-time codes for cooperative networks with partial CSI

Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are reported, when the relay nodes are assumed to have knowledge of the phase component of the source to relay channel gains. It is shown that this under this partial channel state information (CSI), several well known space time codes for the colocated MIMO (Multiple Input Multiple Output) channel become amenable for use as DSTCs. In particular, the well known complex orthogonal designs, generalized coordinate interleaved orthogonal designs (GCIODs) and unitary weight single symbol decodable (UW-SSD) codes are shown to satisfy the required design constraints for DSTCs. Exploiting the relaxed code design constraints, we propose DSTCs obtained from Clifford Algebras which have low ML decoding complexity.

Energy efficient change detection over a MAC using physical layer fusion

We propose a simple and energy efficient distributed change detection scheme for sensor networks based on Page's parametric CUSUM algorithm. The sensor observations are IID over time and across the sensors conditioned on the change variable. Each sensor runs CUSUM and transmits only when the CUSUM is above some threshold. The transmissions from the sensors are fused at the physical layer. The channel is modeled as a multiple access channel (MAC) corrupted with IID noise. The fusion center which is the global decision maker, performs another CUSUM to detect the change. We provide the analysis and simulation results for our scheme and compare the performance with an existing scheme which ensures energy efficiency via optimal power selection.

Lateral impact derailment mechanisms, simulation and analysis

Lateral collisions between heavy road vehicles and passenger trains at level crossings and the associated derailments are serious safety issues. This paper presents a detailed investigation of the dynamic responses and derailment mechanisms of trains under lateral impact using a multi-body dynamics simulation method. Formulation of a three-dimensional dynamic model of a passenger train running on a ballasted track subject to lateral impact caused by a road truck is presented. This model is shown to predict derailment due to wheel climb and car body overturning mechanisms through numerical examples. Sensitivities of the truck speed and mass, wheel/rail friction and the train suspension to the lateral stability and derailment of the train are reported. It is shown that improvements to the design of train suspensions, including secondary and inter-vehicle lateral dampers have higher potential to mitigate the severity of the collision-induced derailments.

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.

Data-aware task scheduling for all-to-all comparison problems in heterogeneous distributed systems

Solving large-scale all-to-all comparison problems using distributed computing is increasingly significant for various applications. Previous efforts to implement distributed all-to-all comparison frameworks have treated the two phases of data distribution and comparison task scheduling separately. This leads to high storage demands as well as poor data locality for the comparison tasks, thus creating a need to redistribute the data at runtime. Furthermore, most previous methods have been developed for homogeneous computing environments, so their overall performance is degraded even further when they are used in heterogeneous distributed systems. To tackle these challenges, this paper presents a data-aware task scheduling approach for solving all-to-all comparison problems in heterogeneous distributed systems. The approach formulates the requirements for data distribution and comparison task scheduling simultaneously as a constrained optimization problem. Then, metaheuristic data pre-scheduling and dynamic task scheduling strategies are developed along with an algorithmic implementation to solve the problem. The approach provides perfect data locality for all comparison tasks, avoiding rearrangement of data at runtime. It achieves load balancing among heterogeneous computing nodes, thus enhancing the overall computation time. It also reduces data storage requirements across the network. The effectiveness of the approach is demonstrated through experimental studies.

Hydrographic observations and model simulation of the Bay of Bengal freshwater plume

Hydrographic observations were taken along two coastal sections and one open ocean section in the Bay of Bengal during the 1999 southwest monsoon, as a part of the Bay of Bengal Monsoon Experiment (BOBMEX). The coastal section in the northwestern Bay of Bengal, which was occupied twice, captured a freshwater plume in its two stages: first when the plume was restricted to the coastal region although separated from the coast, and then when the plume spread offshore. Below the freshwater layer there were indications of an undercurrent. The coastal section in the southern Bay of Bengal was marked by intense coastal upwelling in a 50 km wide band. In regions under the influence of the freshwater plume, the mixed layer was considerably thinner and occasionally led to the formation of a temperature inversion. The mixed layer and isothermal layer were of similar depth for most of the profiles within and outside the freshwater plume and temperature below the mixed layer decreased rapidly till the top of seasonal thermocline. There was no barrier layer even in regions well under the influence of the freshwater plume. The freshwater plume in the open Bay of Bengal does not advect to the south of 16 degrees N during the southwest monsoon. A model of the Indian Ocean, forced by heat, momentum and freshwater fluxes for the year 1999, reproduces the freshwater plume in the Bay of Bengal reasonably well. Model currents as well as the surface circulation calculated as the sum of geostrophic and Ekman drift show a southeastward North Bay Monsoon Current (NBMC) across the Bay, which forms the southern arm of a cyclonic gyre. The NBMC separates the very low salinity waters of the northern Bay from the higher salinities in the south and thus plays an important role in the regulation of near surface stratification. (c) 2007 Elsevier Ltd. All rights reserved.

Hydrographic observations and model simulation of the Bay of Bengal freshwater plume

Hydrographic observations were taken along two coastal sections and one open ocean section in the Bay of Bengal during the 1999 southwest monsoon, as a part of the Bay of Bengal Monsoon Experiment (BOBMEX). The coastal section in the northwestern Bay of Bengal, which was occupied twice, captured a freshwater plume in its two stages: first when the plume was restricted to the coastal region although separated from the coast, and then when the plume spread offshore. Below the freshwater layer there were indications of an undercurrent. The coastal section in the southern Bay of Bengal was marked by intense coastal upwelling in a 50 km wide band. In regions under the influence of the freshwater plume, the mixed layer was considerably thinner and occasionally led to the formation of a temperature inversion. The mixed layer and isothermal layer were of similar depth for most of the profiles within and outside the freshwater plume and temperature below the mixed layer decreased rapidly till the top of seasonal thermocline. There was no barrier layer even in regions well under the influence of the freshwater plume. The freshwater plume in the open Bay of Bengal does not advect to the south of 16 degrees N during the southwest monsoon. A model of the Indian Ocean, forced by heat, momentum and freshwater fluxes for the year 1999, reproduces the freshwater plume in the Bay of Bengal reasonably well. Model currents as well as the surface circulation calculated as the sum of geostrophic and Ekman drift show a southeastward North Bay Monsoon Current (NBMC) across the Bay, which forms the southern arm of a cyclonic gyre. The NBMC separates the very low salinity waters of the northern Bay from the higher salinities in the south and thus plays an important role in the regulation of near surface stratification. (c) 2007 Elsevier Ltd. All rights reserved.

High-rate, Single-Symbol Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of an the channels and the relays have only the phase information of the source-to-relay channels. In our earlier work, we had derived a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC. Using these conditions, in this paper we show that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from 2/N when the relays do not have CSI to 1/2, which is independent of N. We also show that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property. Using this property we are able to construct codes that are SSD and have higher rate than 2/N but giving full diversity only for signal constellations satisfying certain conditions.

Interactive Distributed Source Coding in Asymmetric Communication Scenarios

We provide a new unified framework, called "multiple correlated informants - single recipient" communication, to address the variations of the traditional Distributed Source Coding (DSC) problem. Different combinations of the assumptions about the communication scenarios and the objectives of communication result in different variations of the DSC problem. For each of these variations, the complexities of communication and computation of the optimal solution is determined by the combination of the underlying assumptions. In the proposed framework, we address the asymmetric, interactive, and lossless variant of the DSC problem, with various objectives of communication and provide optimal solutions for those. Also, we consider both, the worst-case and average-case scenarios.

Numerical Simulation of Groundwater Flow with Gradually Increasing Heterogeneity due to Clogging

Well injection replenishes depleting water levels in a well field. Observation well water levels some distance away from the injection well are the indicators of the success of a well injection program. Simulation of the observation well response, located a few tens of meters from the injection well, is likely to be affected by the effects of nonhomogeneous medium, inclined initial water table, and aquifer clogging. Existing algorithms, such as the U.S. Geological Survey groundwater flow software MODFLOW, are capable of handling the first two conditions, whereas time-dependent clogging effects are yet to be introduced in the groundwater flow models. Elsewhere, aquifer clogging is extensively researched in theory of filtration; scope for its application in a well field is a potential research problem. In the present paper, coupling of one such filtration theory to MODFLOW is introduced. Simulation of clogging effects during “Hansol” well recharge in the parts of western India is found to be encouraging.

OFDM Based Distributed Space Time Coding for Asynchronous Relay Networks

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This transmission scheme is amazingly simple and achieves a diversity order of two for any number of relays. Motivated by its simplicity, this scheme is extended to a more general transmission scheme that can achieve full cooperative diversity for any number of relays. The conditions on the distributed space time block code (DSTBC) structure that admit its application in the proposed transmission scheme are identified and it is pointed out that the recently proposed full diversity four group decodable DST-BCs from precoded co-ordinate interleaved orthogonal designs and extended Clifford algebras satisfy these conditions. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Finally, four group decodable distributed differential space time block codes applicable in this new transmission scheme for power of two number of relays are also provided.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.