Multi-point sensing system for plantar pressure measurement

In this paper, the development of a novel multipoint pressure sensor system suitable for the measurement of human foot pressure distribution has been presented. It essentially consists of a matrix of cantilever sensing elements supported by beams. Foil type strain gauges have been employed for the conversion of foot pressure in to proportional electrical response. Information on the signal conditioning circuitry used is given. Also, the results obtained on the performance of the system are included.

Behavior of Sandwich Beams With Functionally Graded Rubber Core in Three Point Bending

The three-point bending behavior of sandwich beams made up of jute epoxy skins and piecewise linear functionally graded (FG) rubber core reinforced with fly ash filler is investigated. This work studies the influence of the parameters such as weight fraction of fly ash, core to thickness ratio, and orientation of jute on specific bending modulus and strength. The load displacement response of the sandwich is traced to evaluate the specific modulus and strength. FG core samples are prepared by using conventional casting technique and sandwich by hand layup. Presence of gradation is quantified experimentally. Results of bending test indicate that specific modulus and strength are primarily governed by filler content and core to sandwich thickness ratio. FG sandwiches with different gradation configurations (uniform, linear, and piecewise linear) are modeled using finite element analysis (ANSYS 5.4) to evaluate specific strength which is subsequently compared with the experimental results and the best gradation configuration is presented. POLYM. COMPOS., 32:1541-1551, 2011. (C) 2011 Society of Plastics Engineers

Real-time Computer Simulation of Three Dimensional Elastostatics using the Finite Point Method

Real-time simulation of deformable solids is essential for some applications such as biological organ simulations for surgical simulators. In this work, deformable solids are approximated to be linear elastic, and an easy and straight forward numerical technique, the Finite Point Method (FPM), is used to model three dimensional linear elastostatics. Graphics Processing Unit (GPU) is used to accelerate computations. Results show that the Finite Point Method, together with GPU, can compute three dimensional linear elastostatic responses of solids at rates suitable for real-time graphics, for solids represented by reasonable number of points.

Robust Fixed Order Lateral H2 Controller for Micro Air Vehicle

This paper presents a robust fixed order H2controller design using strengthened discrete optimal projection equations, which approximate the first order necessary optimality condition. The novelty of this work is the application of the robust H2controller to a micro aerial vehicle named Sarika2 developed in house. The controller is designed in discrete domain for the lateral dynamics of Sarika2 in the presence of low frequency atmospheric turbulence (gust) and high frequency sensor noise. The design specification includes simultaneous stabilization, disturbance rejection and noise attenuation over the entire flight envelope of the vehicle. The resulting controller performance is comprehensively analyzed by means of simulation

Corrosion of 310 stainless steel in H2 H2O-H2S gas mixtures; studies at constant temperature and fixed oxygen potential

Corrosion of SAE 310 stainless steel in H2-H2O-H2S gas mixtures was studied at a constant temperature of 1150 K. Reactive gas mixtures were chosen to yield a constant oxygen potential of approximately 6 × 10-13 Nm-2 and sulfur potentials ranging from 0.19 × 10-2 Nm-2 to 33 × 10-2 Nm-2. The kinetics of corrosion were determined using a thermobalance, and the scales were analyzed using metallography, scanning electron microscopy, and energy dispersive X-ray analysis. Two corrosion regimes, which were dependent on sulfur potential, were identified. At high sulfur potentials (P S 2 ± 2.7 × 10-2 Nm-2) the corrosion rates were high, the kinetics obeyed a linear rate equation, and the scales consisted mainly of sulfide phases similar to those observed from pure sulfidation. At low sulfur potentials (P S 2 ± 0.19 × 10-2 Nm-2) the corrosion rates were low, the kinetics obeyed a parabolic rate equation, and scales consisted mainly of oxide phases. Thermochemical diagrams for the Fe-Cr-S-O, Fe-Ni-S-O, Cr-Ni-S-O, and Si-Cr-S-O systems were constructed, and the experimental results are discussed in relation to these diagrams. Based on this comparison, reasonable corrosion mechanisms were developed. At high sulfur potentials, oxide and sulfide phases initially nucleate as separate islands. Overgrowth of the oxide by the sulfide occurs and an exchange reaction governs the corrosion process. Preoxidation at low oxygen potentials and 1150 K is beneficial in suppressing sulfidation at high sulfur potentials.

Scattering theory and linear optimal control: Regulator and servo problems

In this paper, several known computational solutions are readily obtained in a very natural way for the linear regulator, fixed end-point and servo-mechanism problems using a certain frame-work from scattering theory. The relationships between the solutions to the linear regulator problem with different terminal costs and the interplay between the forward and backward equations have enabled a concise derivation of the partitioned equations, the forward-backward equations, and Chandrasekhar equations for the problem. These methods have been extended to the fixed end-point, servo, and tracking problems.

Effect of surface on the conductance characteristics of Au‐Bi2Sr2CaCu2O8+δ (single crystal) point contact junctions

We report the effect of surface treatments on the dynamic conductance curves (G=dI/dV‐V) of Au‐Bi2Sr2CaCu2O8+δ (single crystal) point contact junctions of variable junction conductances (100 mS≳G≳100 μS). We find that if the crystal surface is cleaved freshly just prior to making contacts, all irreproducible sharp multiple features often observed in tunneling data of Bi(2212) oxide superconductors disappear. If the cleaved crystal surfaces are left under ambient conditions for a few days and the tunneling experiments are repeated, these multiple features reappear. We also find that if the current in the junction is made to pass predominantly through the bulk (and not along the surface), gap features are sharper. The observed conductance curves are fitted to a modified model [G. E. Blonder et al., Phys. Rev. B 25, 4515 (1982)] and estimated gap values are Δ≂28 to 30 meV corresponding to the ratio 2Δ/kBTc ≂ 7.5 with lifetime broadening Γ/Δ≂0.2. We conclude that the sharp multiple features observed in Bi(2212) tunneling curves has no intrinsic origin in the bulk and they arise from the surface only.

Matrix Processors Using p-adic Arithmetic for Exact Linear Computations

A unique code (called Hensel's code) is derived for a rational number by truncating its infinite p-adic expansion. The four basic arithmetic algorithms for these codes are described and their application to rational matrix computations is demonstrated by solving a system of linear equations exactly, using the Gaussian elimination procedure.

Error, Confidence, and Cost in Engineering Computations

The questions that one should answer in engineering computations - deterministic, probabilistic/randomized, as well as heuristic - are (i) how good the computed results/outputs are and (ii) how much the cost in terms of amount of computation and the amount of storage utilized in getting the outputs is. The absolutely errorfree quantities as well as the completely errorless computations done in a natural process can never be captured by any means that we have at our disposal. While the computations including the input real quantities in nature/natural processes are exact, all the computations that we do using a digital computer or are carried out in an embedded form are never exact. The input data for such computations are also never exact because any measuring instrument has inherent error of a fixed order associated with it and this error, as a matter of hypothesis and not as a matter of assumption, is not less than 0.005 per cent. Here by error we imply relative error bounds. The fact that exact error is never known under any circumstances and any context implies that the term error is nothing but error-bounds. Further, in engineering computations, it is the relative error or, equivalently, the relative error-bounds (and not the absolute error) which is supremely important in providing us the information regarding the quality of the results/outputs. Another important fact is that inconsistency and/or near-consistency in nature, i.e., in problems created from nature is completely nonexistent while in our modelling of the natural problems we may introduce inconsistency or near-inconsistency due to human error or due to inherent non-removable error associated with any measuring device or due to assumptions introduced to make the problem solvable or more easily solvable in practice. Thus if we discover any inconsistency or possibly any near-inconsistency in a mathematical model, it is certainly due to any or all of the three foregoing factors. We do, however, go ahead to solve such inconsistent/near-consistent problems and do get results that could be useful in real-world situations. The talk considers several deterministic, probabilistic, and heuristic algorithms in numerical optimisation, other numerical and statistical computations, and in PAC (probably approximately correct) learning models. It highlights the quality of the results/outputs through specifying relative error-bounds along with the associated confidence level, and the cost, viz., amount of computations and that of storage through complexity. It points out the limitation in error-free computations (wherever possible, i.e., where the number of arithmetic operations is finite and is known a priori) as well as in the usage of interval arithmetic. Further, the interdependence among the error, the confidence, and the cost is discussed.

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional repair is exact repair where the replacement node is required to store data identical to that in the failed node. Exact repair is of interest as it greatly simplifies system implementation. The first result of this paper is an explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, for the case when d = n-1. This code has a particularly simple graphical description, and most interestingly has the ability to carry out exact repair without any need to perform arithmetic operations. We term this ability of the code to perform repair through mere transfer of data as repair by transfer. The second result of this paper shows that the interior points on the storage-bandwidth tradeoff cannot be achieved under exact repair, thus pointing to the existence of a separate tradeoff under exact repair. Specifically, we identify a set of scenarios which we term as ``helper node pooling,'' and show that it is the necessity to satisfy such scenarios that overconstrains the system.

Determination of alpha(s)(M-tau(2)) from improved fixed order perturbation theory

We revisit the extraction of alpha(s)(M-tau(2)) from the QCD perturbative corrections to the hadronic tau branching ratio, using an improved fixed-order perturbation theory based on the explicit summation of all renormalization-group accessible logarithms, proposed some time ago in the literature. In this approach, the powers of the coupling in the expansion of the QCD Adler function are multiplied by a set of functions D-n, which depend themselves on the coupling and can be written in a closed form by iteratively solving a sequence of differential equations. We find that the new expansion has an improved behavior in the complex energy plane compared to that of the standard fixed-order perturbation theory (FOPT), and is similar but not identical to the contour-improved perturbation theory (CIPT). With five terms in the perturbative expansion we obtain in the (MS) over bar scheme alpha(s)(M-tau(2)) = 0.338 +/- 0.010, using as input a precise value for the perturbative contribution to the hadronic width of the tau lepton reported recently in the literature.

Uptake of permanganate from aqueous environment by surfactant modified montmorillonite batch and fixed bed studies

Organo-clay was prepared by incorporating different amounts (in terms of CEC, ranging from 134-840 mg of quaternary ammonium cation (QACs) such as hexadecytrimethylammonium bromide (C19H42N]Br) into the montmorillonite clay. Prepared organo-clays are characterized by CHN analyser and XRD to measure the amount of elemental content and interlayer spacing of surfactant modified clay. The batch experiments of sorption of permanganate from aqueous media by organo-clays was studied at different acidic strengths (pH 1-7). The experimental results show that the rate and amount of adsorption of permanganate was higher at lower pH compared to raw montmorillonite. Laboratory fixed bed experiments were conducted to evaluate the breakthrough time and nature of breakthrough curves. The shape of the breakthrough curves shows that the initial cationic surfactant loadings at 1.0 CEC of the clay is enough to enter the permanganate ions in to the interlamellar region of the surfactant modified smectile clays. These fixed bed studies were also applied to quantify the effect of bed-depth and breakthrough time during the uptake of permanganate. Calculation of thermodynamic parameters shows that the sorption of permanganate is spontaneous and follows the first order kinetics.

Optimal Hop Distance and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network

We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organize into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention-based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first motivate that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc wireless network (described above) as a single cell, we study the hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (t) (1/eta), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterization of the optimal operating point. Simulation results are provided comparing the performance of the optimal strategy derived here with some simple strategies for operating the network.