Optimal barrier subdivision for Kramers' escape rate

We examine the effect of subdividing the potential barrier along the reaction coordinate on Kramers' escape rate for a model potential. Using the known supersymmetric potential approach, we show the existence of an optimal number of subdivisions that maximizes the rate.

A Jacobian-Based Algorithm for Planning Attitude Maneuvers Using Forward and Reverse Rotations

Algorithms for planning quasistatic attitude maneuvers based on the Jacobian of the forward kinematic mapping of fully-reversed (FR) sequences of rotations are proposed in this paper. An FR sequence of rotations is a series of finite rotations that consists of initial rotations about the axes of a body-fixed coordinate frame and subsequent rotations that undo these initial rotations. Unlike the Jacobian of conventional systems such as a robot manipulator, the Jacobian of the system manipulated through FR rotations is a null matrix at the identity, which leads to a total breakdown of the traditional Jacobian formulation. Therefore, the Jacobian algorithm is reformulated and implemented so as to synthesize an FR sequence for a desired rotational displacement. The Jacobian-based algorithm presented in this paper identifies particular six-rotation FR sequences that synthesize desired orientations. We developed the single-step and the multiple-step Jacobian methods to accomplish a given task using six-rotation FR sequences. The single-step Jacobian method identifies a specific FR sequence for a given desired orientation and the multiple-step Jacobian algorithm synthesizes physically feasible FR rotations on an optimal path. A comparison with existing algorithms verifies the fast convergence ability of the Jacobian-based algorithm. Unlike closed-form solutions to the inverse kinematics problem, the Jacobian-based algorithm determines the most efficient FR sequence that yields a desired rotational displacement through a simple and inexpensive numerical calculation. The procedure presented here is useful for those motion planning problems wherein the Jacobian is singular or null.

Oxygen transfer and energy dissipation rate in surface aerator

The dissipation rate of turbulent kinetic energy (epsilon) is a key parameter for mixing in surface aerators. In particular, determination epsilon across the impeller stream, where the most intensive mixing takes place, is essential to ascertain that an appropriate degree of mixing is achieved. Present work by using commercial software VisiMix (R) calculates the energy dissipation rate in geometrically similar unbaffled surface aeration systems in order to scale-up the oxygen transfer process. It is found that in geometrically similar system, oxygen transfer rate is uniquely correlated with dissipation rate of energy. Simulation or scale-up equation governing oxygen transfer rate and dissipation rate of energy has been developed in the present work.

Oxygen transfer and energy dissipation rate in surface aerator

The dissipation rate of turbulent kinetic energy(e)is a key parameter for mixing in surface aerators. In particular, determination e across the impeller stream, where the most intensive mixing takes place, is essential to ascertain that an appropriate degree of mixing is achieved. Present work by using commercial software VisiMix calculates the energy dissipation rate in geometrically similar unbaffled surface aeration systems in order to scale-up the oxygen transfer process. It is found that in geometrically similar system,oxygen transfer rate is uniquely correlated with dissipation rate of energy. Simulation or scale-up equation governing oxygen transfer rate and dissipation rate of energy has been developed in the present work.

A Scalable High Throughput Firewall in FPGA

High end network security applications demand high speed operation and large rule set support. Packet classification is the core functionality that demands high throughput in such applications. This paper proposes a packet classification architecture to meet such high throughput. We have Implemented a Firewall with this architecture in reconfigurable hardware. We propose an extension to Distributed Crossproducting of Field Labels (DCFL) technique to achieve scalable and high performance architecture. The implemented Firewall takes advantage of inherent structure and redundancy of rule set by using, our DCFL Extended (DCFLE) algorithm. The use of DCFLE algorithm results In both speed and area Improvement when It is Implemented in hardware. Although we restrict ourselves to standard 5-tuple matching, the architecture supports additional fields.High throughput classification Invariably uses Ternary Content Addressable Memory (TCAM) for prefix matching, though TCAM fares poorly In terms of area and power efficiency. Use of TCAM for port range matching is expensive, as the range to prefix conversion results in large number of prefixes leading to storage inefficiency. Extended TCAM (ETCAM) is fast and the most storage efficient solution for range matching. We present for the first time a reconfigurable hardware Implementation of ETCAM. We have implemented our Firewall as an embedded system on Virtex-II Pro FPGA based platform, running Linux with the packet classification in hardware. The Firewall was tested in real time with 1 Gbps Ethernet link and 128 sample rules. The packet classification hardware uses a quarter of logic resources and slightly over one third of memory resources of XC2VP30 FPGA. It achieves a maximum classification throughput of 50 million packet/s corresponding to 16 Gbps link rate for file worst case packet size. The Firewall rule update Involves only memory re-initialiization in software without any hardware change.

Energy-momentum conserving algorithm for nonlinear transient analysis within the framework of hybrid elements

This work deals with the formulation and implementation of an energy-momentum conserving algorithm for conducting the nonlinear transient analysis of structures, within the framework of stress-based hybrid elements. Hybrid elements, which are based on a two-field variational formulation, are much less susceptible to locking than conventional displacement-based elements within the static framework. We show that this advantage carries over to the transient case, so that not only are the solutions obtained more accurate, but they are obtained in fewer iterations. We demonstrate the efficacy of the algorithm on a wide range of problems such as ones involving dynamic buckling, complicated three-dimensional motions, et cetera.

Synergy between tribo-oxidation and strain rate response on governing the dry sliding wear behavior of titanium.

The present work provides an insight into the dry sliding wear behavior of titanium based on synergy between tribo-oxidation and strain rate response. Pin-on-disc tribometer was used to characterize the friction and wear behavior of titanium pin in sliding contact with polycrystalline alumina disk under ambient and vacuum condition. The sliding speed was varied from 0.01 to 1.4 ms(-1), normal load was varied from 15.3 to 76 N and with a sliding distance of 1500 m. It was seen that dry sliding wear behavior of titanium was governed by combination of tribo-oxidation and strain rate response in near surface region of titanium. Strain rate response of titanium was recorded by conducting uni-axial compression tests at constant true strain rate of 100 s(-1) in the temperature range from 298 to 873 K. Coefficient of friction and wear rate were reduced with increased sliding speed from 0.01 to 1.0 ms(-1). This is attributed to the formation of in situ self lubricating oxide film (TiO) and reduction in the intensity of adiabatic shear band cracking in the near surface region. This trend was confirmed by performing series of dry sliding tests under vacuum condition of 2 x 10(-4) Torr. Characterization tools such as optical microscopy, scanning electron microscopy, and X-ray diffractometer provided evidence of such processes. These experimental findings can be applied to enhance the dry sliding wear behavior of titanium with proper choice of operating conditions such as sliding speed, normal load, and environment.

A pattern adaptive thinning algorithm

A simple sequential thinning algorithm for peeling off pixels along contours is described. An adaptive algorithm obtained by incorporating shape adaptivity into this sequential process is also given. The distortions in the skeleton at the right-angle and acute-angle corners are minimized in the adaptive algorithm. The asymmetry of the skeleton, which is a characteristic of sequential algorithm, and is due to the presence of T-corners in some of the even-thickness pattern is eliminated. The performance (in terms of time requirements and shape preservation) is compared with that of a modern thinning algorithm.

An Algorithm to Decide Feasibility of Linear Integer Constraints Occurrng in Decision Tables

Abstract-To detect errors in decision tables one needs to decide whether a given set of constraints is feasible or not. This paper describes an algorithm to do so when the constraints are linear in variables that take only integer values. Decision tables with such constraints occur frequently in business data processing and in nonnumeric applications. The aim of the algorithm is to exploit. the abundance of very simple constraints that occur in typical decision table contexts. Essentially, the algorithm is a backtrack procedure where the the solution space is pruned by using the set of simple constrains. After some simplications, the simple constraints are captured in an acyclic directed graph with weighted edges. Further, only those partial vectors are considered from extension which can be extended to assignments that will at least satisfy the simple constraints. This is how pruning of the solution space is achieved. For every partial assignment considered, the graph representation of the simple constraints provides a lower bound for each variable which is not yet assigned a value. These lower bounds play a vital role in the algorithm and they are obtained in an efficient manner by updating older lower bounds. Our present algorithm also incorporates an idea by which it can be checked whether or not an (m - 2)-ary vector can be extended to a solution vector of m components, thereby backtracking is reduced by one component.

Influence of clofibrate administration on the rate of synthesis of macromolecules in regenerating rat liver

Administration of the antihypercholesterolaemic drug clofibrate stimulates the rates of synthesis of nucleic acids and proteins in rat liver. The biosynthesis of mitochondrial proteins also is enhanced by the drug. In drug-fed animals, the rates of incorporation in vivo of radioactive precursors into DNA, RNA and proteins are stimulated even when the liver undergoes regeneration following partial hepatectomy. The rate of synthesis of mitochondrial proteins in the regenerative phase is higher in clofibrate-fed animals. These effects are consistent with the hepatomegalic and mitochondria-proliferating property of the drug.

An Algorithm for Tracking a Maneuvering Target in Clutter

We consider the problem of tracking a maneuvering target in clutter. In such an environment, missed detections and false alarms make it impossible to decide, with certainty, the origin of received echoes. Processing radar returns in cluttered environments consists of three functions: 1) target detection and plot formation, 2) plot-to-track association, and 3) track updating. Two inadequacies of the present approaches are 1) Optimization of detection characteristics have not been considered and 2) features that can be used in the plot-to-track correlation process are restricted to a specific class. This paper presents a new approach to overcome these limitations. This approach facilitates tracking of a maneuvering target in clutter and improves tracking performance for weak targets.

Non-stationary signal analysis by least mean fourth (LMF) adaptive algorithm

A modified least mean fourth (LMF) adaptive algorithm applicable to non-stationary signals is presented. The performance of the proposed algorithm is studied by simulation for non-stationarities in bandwidth, centre frequency and gain of a stochastic signal. These non-stationarities are in the form of linear, sinusoidal and jump variations of the parameters. The proposed LMF adaptation is found to have better parameter tracking capability than the LMS adaptation for the same speed of convergence.

Mössbauer studies of the corrosion products of iron formed in aqueous ammonium nitrate solution

The products of corrosion reaction of electrolytic iron in 45% ammonium nitrate solution formed under various conditions of time, temperature and pH have been analysed mainly by Mössbauer spectroscopy, in combination with X-ray diffraction, infrared absorption and electron microscopy techniques. γ-Fe00H is found to be the major product of hydrolytic precipitation at pH > 5.6 while only α-FeOOH is formed at pH < 3.0. In the pH range 3.0 < pH < 5.0, α-Fe00H and ferrihydrite are both formed. However, once the nuclei of α-Fe00H are formed under low pH conditions, their growth is favoured even in the otherwise unfavourable slightly acidic medium, resulting in a hydrous α-Fe00H which has two distinct hyperfine fields at the 57Fe nucleus. Magnetite is always formed in the vicinity of the metal and its rate of formation on the surface increases with temperature. α-Fe203 is the major product of hydrolytic precipitation at temperatures >80C. The possible mechanisms for the formation of each of the corrosion products are discussed.

An on-line algorithm for the location of cross point faults in programmable logic arrays

An on-line algorithm is developed for the location of single cross point faults in a PLA (FPLA). The main feature of the algorithm is the determination of a fault set corresponding to the response obtained for a failed test. For the apparently small number of faults in this set, all other tests are generated and a fault table is formed. Subsequently, an adaptive procedure is used to diagnose the fault. Functional equivalence test is carried out to determine the actual fault class if the adaptive testing results in a set of faults with identical tests. The large amount of computation time and storage required in the determination, a priori, of all the fault equivalence classes or in the construction of a fault dictionary are not needed here. A brief study of functional equivalence among the cross point faults is also made.

Systematic Construction of Linear Transform Based Full-Diversity, Rate-One Space-Time Frequency Codes

In this paper, we generalize the existing rate-one space frequency (SF) and space-time frequency (STF) code constructions. The objective of this exercise is to provide a systematic design of full-diversity STF codes with high coding gain. Under this generalization, STF codes are formulated as linear transformations of data. Conditions on these linear transforms are then derived so that the resulting STF codes achieve full diversity and high coding gain with a moderate decoding complexity. Many of these conditions involve channel parameters like delay profile (DP) and temporal correlation. When these quantities are not available at the transmitter, design of codes that exploit full diversity on channels with arbitrary DIP and temporal correlation is considered. Complete characterization of a class of such robust codes is provided and their bit error rate (BER) performance is evaluated. On the other hand, when channel DIP and temporal correlation are available at the transmitter, linear transforms are optimized to maximize the coding gain of full-diversity STF codes. BER performance of such optimized codes is shown to be better than those of existing codes.