Energy released during arc crack propagation

The problem of circular arc cracks in a homogeneous medium is revisited. An unusual but simple method to calculate the energy change due to arc crack propagation along a circle is illustrated based on the earlier work of Sih and Liebowitz (1968). The limiting case of crack of angle 27pi is shown to correspond with the problem of a circular hole in a large plate under remote loading.

Interactions of interfacial arc cracks

The interaction of two interfacial arc cracks around a circular elastic inclusion embedded in an elastic matrix is examined. New results for stress intensity factors for a pair of interacting cracks are derived for a concentrated force acting in the matrix. For verifying the point load solutions, stress intensity factors under uniform loading are obtained by superposing point force results. For achieving this objective, a general method for generating desired stress fields inside a test region using point loads is described. The energetics of two interacting interfacial arc cracks is discussed in order to shed more light on the debonding of hard or soft inclusions from the matrix. The analysis based on complex variables is developed in a general way to handle the interactions of multiple interfacial arc cracks/straight cracks.

Scaling analysis of momentum and heat transport in gas tungsten arc weld pools

A systematic procedure is outlined for scaling analysis of momentum and heat transfer in gas tungsten arc weld pools. With suitable selections of non-dimentionalised parameters, the governing equations coupled with appropriate boundary conditions are first scaled, and the relative significance of various terms appearing in them is analysed accordingly. The analysis is then used to predict the orders of magnitude of some important quantities, such as the velocity scene lit the top surface, velocity boundary layer thickness, maximum temperature increase in the pool, and time required for initiation of melting. Some of the quantities predicted from the scaling analysis can also be used for optimised selection of appropriate grid size and time steps for full numerical simulation of the process. The scaling predictions are finally assessed by comparison with numerical results quoted in the literature, and a good qualitative agreement is observed.

Search for sub-mm, mm and radio continuum emission from extremely red objects

We present the results of sub-mm, mm (850 mum, 450 mum and 1250 mum) and radio (1.4 and 4.8 GHz) continuum observations of a sample of 27 K-selected Extremely Red Objects, or EROs, (14 of which form a complete sample with K < 20 and I - K > 5) aimed at detecting dusty starbursts, deriving the fraction of UltraLuminous Infrared Galaxies (ULIGs) in ERO samples, and constraining their redshifts using the radio-FIR correlation. One ERO was tentatively detected at 1250 mum and two were detected at 1.4 GHz, one of which has a less secure identification as an ERO counterpart. Limits on their redshifts and their star forming properties are derived and discussed. We stacked the observations of the undetected objects at 850 mum, 1250 mum and 4.8 GHz in order to search for possible statistical emission from the ERO population as a whole, but no significant detections were derived either for the whole sample or as a function of the average NIR colours. These results strongly suggest that the dominant population of EROs with K < 20 is not comprised of ULIGs like HR 10, but is probably made of radio-quiet ellipticals and weaker starburst galaxies with L < 10(12) L . and SFR < few hundred M. yr(-1).

Monodisperse sub-10 nm gold nanoparticles by reversing the order of addition in Turkevich method - The role of chloroauric acid

The Turkevich method for synthesizing gold nanoparticles, using sodium citrate as the reducing agent, is renowned for its ability to produce biocompatible colloids with mean size >10 nm. Here we show that monodisperse gold nanoparticles in the 5-10 nm size range can be synthesized by simply reversing the order of addition of reactants, i.e. adding chloroauric acid to citrate solution. Kinetic studies and electron microscopic characterization revealed that the reactivity of chloroauric acid, initial molar ratio of citrate to chloroauric acid (MR), and reaction mixture pH play an important role in producing monodisperse gold nanoparticles. Reversing the order of addition also enhanced the stabilization of nanoparticles at high MR values. Remarkably, the system exhibits a `memory' of the order of addition, even when the timescale of mixing is much shorter than the timescale of synthesis. (C) 2011 Elsevier Inc. All rights reserved.

An Investigation into the Dependence of the Arc Voltage on the Parameters of the Short-Circuit Current and the Design of the Vacuum Interrupter

The vacuum interrupter is extensively employed in the medium voltage switchgear for the interruption of the short-circuit current. The voltage across the arc during current interruption is termed as the arc voltage. The nature and magnitude of this arc voltage is indicative of the performance of the contacts and the vacuum interrupter as a whole. Also, the arc voltage depends on the parameters like the magnitude of short-circuit current, the arcing time, the point of opening of the contacts, the geometry and area of the contacts and the type of magnetic field. This paper investigates the dependency of the arc voltage on some of these parameters. The paper also discusses the usefulness of the arc voltage in diagnosing the performance of the contacts.

Estimation of BT Interference in OFDM Sub Carriers with Training Signals

While wireless LAN (WLAN) is very popular now a days, its performance deteriorates in the presence of other signals like Bluetooth (BT) signal that operate in the same band as WLAN. Present interference mitigation techniques in WLAN due to BT cancel interference in WLAN sub carrier where BT has hopped but do not cancel interference in the adjacent sub carriers. In this paper BT interference signal in all the OFDM sub carriers is estimated. That is, leakage of BT in other sub carriers including the sub carriers in which it has hopped is also measured. BT signals are estimated using the training signals of OFDM system. Simulation results in AWGN noise show that proposed algorithm agrees closely with theoretical results.

Soft classification based Sub-pixel allocation model

Land cover (LC) refers to what is actually present on the ground and provide insights into the underlying solution for improving the conditions of many issues, from water pollution to sustainable economic development. One of the greatest challenges of modeling LC changes using remotely sensed (RS) data is of scale-resolution mismatch: that the spatial resolution of detail is less than what is required, and that this sub-pixel level heterogeneity is important but not readily knowable. However, many pixels consist of a mixture of multiple classes. The solution to mixed pixel problem typically centers on soft classification techniques that are used to estimate the proportion of a certain class within each pixel. However, the spatial distribution of these class components within the pixel remains unknown. This study investigates Orthogonal Subspace Projection - an unmixing technique and uses pixel-swapping algorithm for predicting the spatial distribution of LC at sub-pixel resolution. Both the algorithms are applied on many simulated and actual satellite images for validation. The accuracy on the simulated images is ~100%, while IRS LISS-III and MODIS data show accuracy of 76.6% and 73.02% respectively. This demonstrates the relevance of these techniques for applications such as urban-nonurban, forest-nonforest classification studies etc.

Computationally Efficient Sub-optimal Mid Course Guidance Using Model Predictive Static Programming (MPSP)

For a homing interceptor, suitable initial condition must be achieved by mid course guidance scheme for its maximum effectiveness. To achieve desired end goal of any mid course guidance scheme, two point boundary value problem must be solved online with all realistic constrain. A Newly developed computationally efficient technique named as MPSP (Model Predictive Static Programming) is utilized in this paper for obtaining suboptimal solution of optimal mid course guidance. Time to go uncertainty is avoided in this formulation by making use of desired position where midcourse guidance terminate and terminal guidance takes over. A suitable approach angle towards desired point also can be specified in this guidance law formulation. This feature makes this law particularly attractive because warhead effectiveness issue can be indirectly solved in mid course phase.

Boxicity of Circular Arc Graphs

A k-dimensional box is a Cartesian product R(1)x...xR(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. That is, two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of arcs on a circle. We show that if G is a circular arc graph which admits a circular arc representation in which no arc has length at least pi(alpha-1/alpha) for some alpha is an element of N(>= 2), then box(G) <= alpha (Here the arcs are considered with respect to a unit circle). From this result we show that if G has maximum degree Delta < [n(alpha-1)/2 alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. We also demonstrate a graph having box(G) > alpha but with Delta = n (alpha-1)/2 alpha + n/2 alpha(alpha+1) + (alpha+2). For a proper circular arc graph G, we show that if Delta < [n(alpha-1)/alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. Let r be the cardinality of the minimum overlap set, i.e. the minimum number of arcs passing through any point on the circle, with respect to some circular arc representation of G. We show that for any circular arc graph G, box(G) <= r + 1 and this bound is tight. We show that if G admits a circular arc representation in which no family of k <= 3 arcs covers the circle, then box(G) <= 3 and if G admits a circular arc representation in which no family of k <= 4 arcs covers the circle, then box(G) <= 2. We also show that both these bounds are tight.