Selection of Optimal Time-to-go in Generalized Vector Explicit Guidance

A new method of selection of time-to-go (t(go)) for Generalized Vector Explicit Guidance (GENEX) law have been proposed in this paper. t(go) is known to be an important parameter in the control and cost function of GENEX guidance law. In this paper the formulation has been done to find an optimal value of t(go) that minimizes the performance cost. Mechanization of GENEX with this optimal t(go) reduces the lateral acceleration demand and consequently increases the range of the interceptor. This new formulation of computing t(go) comes in closed form and thus it can be implemented onboard. This new formulation is applied in the terminal phase of an surface-to-air interceptor for an angle constrained engagement. Results generated by simulation justify the use of optimal t(go).

Orientation Selection and Microstructural Evolution in Directionally Solidified Tb0.3Dy0.7Fe1.95

Tb0.3Dy0.7Fe1.95 alloy was directionally solidified by using a modified Bridgman technique at a wide range of growth rates of 5 to 100 cm/h. The directionally grown samples exhibited plane front solidification morphology up to a growth rate of 90 cm/h. Typical island banding feature was observed closer to the chilled end, which eventually gave rise to irregular peritectic coupled growth (PCG). The PCG gained prominence with an increase in the growth rate. The texture study revealed formation of strong aOE (c) 311 > texture in a lower growth rate regime, aOE (c) 110 > and ``rotated aOE (c) 110 > aEuroe in an intermediate growth regime, and aOE (c) 112 > in a higher growth rate regime. In-depth analysis of the atomic configuration of a solid-liquid interface revealed that the growth texture is influenced by the kinetics of atomic attachment to the solid-liquid interface, which is intimately related to a planar packing fraction and an atomic stacking sequence of the interfacial plane. The mechanism proposed in this article is novel and will be useful in addressing the orientation selection mechanism of topologically closed packed intermetallic systems. The samples grown at a higher growth rate exhibit larger magnetostriction (lambda) and d lambda/dH owing to the absence of pro-peritectic (Tb,Dy)Fe-3 and formation of aOE (c) 112 > texture, which lies closer to the easy magnetization direction (EMD).

Prototype Selection on Large and Streaming Data

Since streaming data keeps coming continuously as an ordered sequence, massive amounts of data is created. A big challenge in handling data streams is the limitation of time and space. Prototype selection on streaming data requires the prototypes to be updated in an incremental manner as new data comes in. We propose an incremental algorithm for prototype selection. This algorithm can also be used to handle very large datasets. Results have been presented on a number of large datasets and our method is compared to an existing algorithm for streaming data. Our algorithm saves time and the prototypes selected gives good classification accuracy.

Direct Link-Aware Relay Selection for Average Interference-Constrained Underlay Cognitive Radio

Cooperative relaying combined with selection exploits spatial diversity to significantly improve the performance of interference-constrained secondary users in an underlay cognitive radio network. We present a novel and optimal relay selection (RS) rule that minimizes the symbol error probability (SEP) of an average interference-constrained underlay secondary system that uses amplify-and-forward relays. A key point that the rule highlights for the first time is that, for the average interference constraint, the signal-to-interference-plus-noise-ratio (SINR) of the direct source-to-destination (SI)) link affects the choice of the optimal relay. Furthermore, as the SINR increases, the odds that no relay transmits increase. We also propose a simpler, more practical, and near-optimal variant of the optimal rule that requires just one bit of feedback about the state of the SD link to the relays. Compared to the SD-unaware ad hoc RS rules proposed in the literature, the proposed rules markedly reduce the SEP by up to two orders of magnitude.

Social optimum in social groups with give-and-take criterion

We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.

Dislocation theory of the fracture criterion for anisotropic solids

A dislocation theory of fracture criterion for the mixed dislocation emission and cleavage process in an anisotropic solid is developed in this paper. The complicated cases involving mixed-mode loading are considered here. The explicit formula for dislocations interaction with a semi-infinite crack is obtained. The governing equation for the critical condition of crack cleavage in an anisotropic solid after a number dislocation emissions is established. The effects of elastic anisotropy, crack geometry and load phase angle on the critical energy release rate and the total number of the emitted dislocations at the onset of cleavage are analysed in detail. The analyses revealed that the critical energy release rates can increase to one or two magnitudes larger than the surface energy because of the dislocation emission. It is also found elastic anisotropy and crystal orientation have significant effects on the critical energy release rates. The anisotropic values can be several times the isotropic value in one crack orientation. The values may be as much as 40% less than the isotropic value in another crack orientation and another anisotropy parameter. Then the theory is applied to a fee single crystal. An edge dislocation can emit from the crack tip along the most highly shear stressed slip plane. Crack cleavage can occur along the most highly stressed slip plane after a number of dislocation emissions. Calculation is carried out step by step. Each step we should judge by which slip system is the most highly shear stressed slip system and which slip system has the largest energy release rate. The calculation clearly shows that the crack orientation and the load phase angle have significant effects on the crystal brittle-ductile behaviours.

A New Ignition Criterion Based Upon a Critical Thermal Energy Density

It has long been known that various ignition criteria of energetic materials have been limited in applicability to small regions. In order to explore the physical nature of ignition, we calculated how much thermal energy per unit mass of energetic materials was absorbed under different external stimuli. Hence, data of several typical sensitivity tests were analyzed by order of magnitude estimation. Then a new concept on critical thermal energy density was formulated. Meanwhile, the chemical nature of ignition was probed into by chemical kinetics.

Simulating dynamic covariance structures for testing the adaptive behavior of variable selection algorithms (Invited Paper)

Variable selection for regression is a classical statistical problem, motivated by concerns that too large a number of covariates may bring about overfitting and unnecessarily high measurement costs. Novel difficulties arise in streaming contexts, where the correlation structure of the process may be drifting, in which case it must be constantly tracked so that selections may be revised accordingly. A particularly interesting phenomenon is that non-selected covariates become missing variables, inducing bias on subsequent decisions. This raises an intricate exploration-exploitation tradeoff, whose dependence on the covariance tracking algorithm and the choice of variable selection scheme is too complex to be dealt with analytically. We hence capitalise on the strength of simulations to explore this problem, taking the opportunity to tackle the difficult task of simulating dynamic correlation structures. © 2008 IEEE.

Streaming covariance selection with applications to adaptive querying in sensor networks

Sensor networks can be naturally represented as graphical models, where the edge set encodes the presence of sparsity in the correlation structure between sensors. Such graphical representations can be valuable for information mining purposes as well as for optimizing bandwidth and battery usage with minimal loss of estimation accuracy. We use a computationally efficient technique for estimating sparse graphical models which fits a sparse linear regression locally at each node of the graph via the Lasso estimator. Using a recently suggested online, temporally adaptive implementation of the Lasso, we propose an algorithm for streaming graphical model selection over sensor networks. With battery consumption minimization applications in mind, we use this algorithm as the basis of an adaptive querying scheme. We discuss implementation issues in the context of environmental monitoring using sensor networks, where the objective is short-term forecasting of local wind direction. The algorithm is tested against real UK weather data and conclusions are drawn about certain tradeoffs inherent in decentralized sensor networks data analysis. © 2010 The Author. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.