The Alfvén Wave Equation for Magnetospheric Plasmas

It is shown that besides the continuous spectrum which damps away as inverse power of time, the coupled Alfvén wave equation, which gives coupling between a shear Alfvén wave and a surface wave, can also admit a well behaved harmonic solution in the closed form for a set of initial conditions. This solution, though valid for finite time intervals, points out that the Alfvén surface waves can have a band of frequency (instead of a monochromatic frequency for a nonsheared magnetic field) within which the local field line resonance frequency can lie, and thus can excite magnetic pulsations with latitude-dependent frequency. By considering magnetic fields not only varying in magnitude but also in direction, it is shown that the time interval for the validity of the harmonic solution depend upon the angle between the magnetic field directions on either side of the magnetopause. For small values of the angle the time interval can become appreciably large.

Optimal Receive Antenna Selection in Time-Varying Fading Channels with Practical Training Constraints

Hardware constraints, which motivate receive antenna selection, also require that various antenna elements at the receiver be sounded sequentially to obtain estimates required for selecting the `best' antenna and for coherently demodulating data thereafter. Consequently, the channel state information at different antennas is outdated by different amounts and corrupted by noise. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, a preferable strategy is to linearly weight the channel estimates of different antennas differently, depending on the training scheme. We derive closed-form expressions for the symbol error probability (SEP) of AS for MPSK and MQAM in time-varying Rayleigh fading channels for arbitrary selection weights, and validate them with simulations. We then characterize explicitly the optimal selection weights that minimize the SEP. We also consider packet reception, in which multiple symbols of a packet are received by the same antenna. New suboptimal, but computationally efficient weighted selection schemes are proposed for reducing the packet error rate. The benefits of weighted selection are also demonstrated using a practical channel code used in third generation cellular systems. Our results show that optimal weighted selection yields a significant performance gain over conventional unweighted selection.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Studies of cryotreatment on the performance of integral diaphragm pressure transducers for space application

The integral diaphragm pressure transducers machined out of precipitation hardened martensite stainless steel (APX4) are widely used for propellant pressure measurements in space applications. These transducers are expected to exhibit dimensional stability and linearity for their entire useful life. These vital factors are very critical for the reliable performance and dependability of the pressure transducers. However, these transducers invariably develop internal stresses during various stages of machining. These stresses have an adverse effect on the performance of the transducers causing deviation from linearity. In order to eliminate these possibilities, it was planned to cryotreat the machined transducers to improve both the long-term linearity and dimensional stability. To study these effects, an experimental cryotreatment unit was designed and developed based on the concept of indirect cooling using the concept of cold nitrogen gas forced closed loop convection currents. The system has the capability of cryotreating large number of samples for varied rates of cooling, soaking and warm-up. After obtaining the initial levels of residual stress and retained austenite using X-ray diffraction techniques, the pressure transducers were cryotreated at 98 K for 36 h. Immediately after cryotreatment, the transducers were tempered at 510 degrees C for 3 h in vacuum furnace. Results after cryo treatment clearly indicated significant reduction in residual stress levels and conversion of retained austenite to martensite. These changes have brought in improvements in long term zero drift and dimensional stability. The cryotreated pressure transducers have been incorporated for actual space applications. (c) 2010 Published by Elsevier Ltd.

Nonlinear fracture properties of concrete-concrete interfaces

The fracture properties of different concrete-concrete interfaces are determined using the Bazant's size effect model. The size effect on fracture properties are analyzed using the boundary effect model proposed by Wittmann and his co-workers. The interface properties at micro-level are analyzed through depth sensing micro-indentation and scanning electron microscopy. Geometrically similar beam specimens of different sizes having a transverse interface between two different strengths of concrete are tested under three-point bending in a closed loop servo-controlled machine with crack mouth opening displacement control. The fracture properties such as, fracture energy (G(f)), length of process zone (c(f)), brittleness number (beta), critical mode I stress intensity factor (K-ic), critical crack tip opening displacement CTODc (delta(c)), transitional ligament length to free boundary (a(j)), crack growth resistance curve and micro-hardness are determined. It is seen that the above fracture properties decrease as the difference between the compressive strength of concrete on either side of the interface increases. (C) 2010 Elsevier Ltd. All rights reserved.

The Relay Selection and Transmission Trade-off in Cooperative Communication Systems

A common and practical paradigm in cooperative communication systems is the use of a dynamically selected `best' relay to decode and forward information from a source to a destination. Such systems use two phases - a relay selection phase, in which the system uses transmission time and energy to select the best relay, and a data transmission phase, in which it uses the spatial diversity benefits of selection to transmit data. In this paper, we derive closed-form expressions for the overall throughput and energy consumption, and study the time and energy trade-off between the selection and data transmission phases. To this end, we analyze a baseline non-adaptive system and several adaptive systems that adapt the selection phase, relay transmission power, or transmission time. Our results show that while selection yields significant benefits, the selection phase's time and energy overhead can be significant. In fact, at the optimal point, the selection can be far from perfect, and depends on the number of relays and the mode of adaptation. The results also provide guidelines about the optimal system operating point for different modes of adaptation. The analysis also sheds new insights on the fast splitting-based algorithm considered in this paper for relay selection.

Weber-Fechner type nonlinear behavior in zigzag edge graphene nanoribbons

Using a continuum Dirac theory, we study the density and spin response of zigzag edge-terminated graphene ribbons subjected to edge potentials and Zeeman fields. Our analytical calculations of the density and spin responses of the closed system (fixed particle number) to the static edge fields, show a highly nonlinear Weber-Fechner type behavior where the response depends logarithmically on the edge potential. The dependence of the response on the size of the system (e.g., width of a nanoribbon) is also uncovered. Zigzag edge graphene nanoribbons, therefore, provide a realization of response of organs such as the eye and ear that obey Weber-Fechner law. We validate our analytical results with tight-binding calculations. These results are crucial in understanding important effects of electron-electron interactions in graphene nanoribbons such as edge magnetism, etc., and also suggest possibilities for device applications of graphene nanoribbons.

A Low-Complexity Algorithm for Intrusion Detection in a PIR-Based Wireless Sensor Network

We present a low-complexity algorithm for intrusion detection in the presence of clutter arising from wind-blown vegetation, using Passive Infra-Red (PIR) sensors in a Wireless Sensor Network (WSN). The algorithm is based on a combination of Haar Transform (HT) and Support-Vector-Machine (SVM) based training and was field tested in a network setting comprising of 15-20 sensing nodes. Also contained in this paper is a closed-form expression for the signal generated by an intruder moving at a constant velocity. It is shown how this expression can be exploited to determine the direction of motion information and the velocity of the intruder from the signals of three well-positioned sensors.

An algebraic formulation of static isotropy and design of statically isotropic 6–6 Stewart platform manipulators

In this paper, we present an algebraic method to study and design spatial parallel manipulators that demonstrate isotropy in the force and moment distributions. We use the force and moment transformation matrices separately, and derive conditions for their isotropy individually as well as in combination. The isotropy conditions are derived in closed-form in terms of the invariants of the quadratic forms associated with these matrices. The formulation is applied to a class of Stewart platform manipulator, and a multi-parameter family of isotropic manipulators is identified analytically. We show that it is impossible to obtain a spatially isotropic configuration within this family. We also compute the isotropic configurations of an existing manipulator and demonstrate a procedure for designing the manipulator for isotropy at a given configuration.

Kinematics of pantograph masts

This paper deals with the kinematics of pantograph masts. Pantograph masts have widespread use in space application as deployable structures. They are over constrained mechanisms with degree-of-freedom, evaluated by the Grübler–Kutzback formula, as less than one. In this paper, a numerical algorithm is used to evaluate the degree-of-freedom of pantograph masts by obtaining the null space of a constraint Jacobian matrix. In the process redundant joints in the masts are obtained. A method based on symbolic computation, to obtain the closed-form kinematics equations of triangular and box shaped pantograph masts, is presented. In the process, the various configurations such masts can attain during deployment, are obtained. The closed-form solution also helps in identifying the redundant joints in the masts. The symbolic computations involving the Jacobian matrix also leads to a method to evaluate the global degree-of-freedom for these masts.

A Novel, Balanced, and Energy-Efficient Training Method for Receive Antenna Selection

In receive antenna selection (AS), only signals from a subset of the antennas are processed at any time by the limited number of radio frequency (RF) chains available at the receiver. Hence, the transmitter needs to send pilots multiple times to enable the receiver to estimate the channel state of all the antennas and select the best subset. Conventionally, the sensitivity of coherent reception to channel estimation errors has been tackled by boosting the energy allocated to all pilots to ensure accurate channel estimates for all antennas. Energy for pilots received by unselected antennas is mostly wasted, especially since the selection process is robust to estimation errors. In this paper, we propose a novel training method uniquely tailored for AS that transmits one extra pilot symbol that generates accurate channel estimates for the antenna subset that actually receives data. Consequently, the transmitter can selectively boost the energy allocated to the extra pilot. We derive closed-form expressions for the proposed scheme's symbol error probability for MPSK and MQAM, and optimize the energy allocated to pilot and data symbols. Through an insightful asymptotic analysis, we show that the optimal solution achieves full diversity and is better than the conventional method.

Perturbation of critical solution temperatures by impurity doping

An expression is developed for the variation of the critical solution temperature of a binary liquid system when a third component (dopant) is added, using an extension of the regular solution theory. The model can be used for UCST, LCST and for closed loop systems and has the correct features in the limiting cases.

Rocking response of rectangular rigid blocks under random noise base excitations

The response of a rigid rectangular block resting on a rigid foundation and acted upon simultaneously by a horizontal and a vertical random white-noise excitation is considered. In the equation of motion, the energy dissipation is modeled through a viscous damping term. Under the assumption that the body does not topple, the steady-state joint probability density function of the rotation and the rotational velocity is obtained using the Fokker-Planck equation approach. Closed form solution is obtained for a specific combination of system parameters. A more general but approximate solution to the joint probability density function based on the method of equivalent non-linearization is also presented. Further, the problem of overturning of the block is approached in the framework of the diffusion methods for first passage failure studies. The overturning of the block is deemed incipient when the response trajectories in the phase plane cross the separatrix of the conservative unforced system. Expressions for the moments of first passage time are obtained via a series solution to the governing generalized Pontriagin-Vitt equations. Numerical results illustra- tive of the theoretical solutions are presented and their validity is examined through limited amount of digital simulations.

Study of forging design using slip-line fields

The main purpose of forging design is to ensure cavity filling with minimum material wastage, minimum die load and minimum deformation energy. Given the desired shape of the component and the material to be forged, this goal is achieved by optimising the initial volume of the billet, the geometrical parameters of the die and the process parameters. It is general industrial practise to fix the initial billet volume and the die parameters using empirical relationships derived from practical experience. In this paper a basis for optimising some of the parameters for simple closed-die forging is proposed. Slip-line field solutions are used to predict the flow, the load and the energy in a simple two-dimensional closed-die forging operation. The influence of the design parameters; flash-land width, excess initial workpiece area and forged cross-sectional size; on complete cavity filling and efficient cavity filling are investigated. Using the latter as necessary requirements for forging, the levels of permissable design parameters are determined, the variation of these levels with the size of the cross-section then being examined.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010