On the treewidth of MDS and Reed-Muller codes

The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we compute exact expressions for the treewidth of maximum distance separable codes, and first- and second-order Reed-Muller codes. These results constitute the only known explicit expressions for the treewidth of algebraic codes.

Stall flutter of NACA 0012 airfoil at low Reynolds numbers

In the present work, we experimentally study and demarcate the stall flutter boundaries of a NACA 0012 airfoil at low Reynolds numbers (Re similar to 10(4)) by measuring the forces and flow fields around the airfoil when it is forced to oscillate. The airfoil is placed at large mean angle of attack (alpha(m)), and is forced to undergo small amplitude pitch oscillations, the amplitude (Delta alpha) and frequency (f) of which are systematically varied. The unsteady loads on the oscillating airfoil are directly measured, and are used to calculate the energy transfer to the airfoil from the flow. These measurements indicate that for large mean angles of attack of the airfoil (alpha(m)), there is positive energy transfer to the airfoil over a range of reduced frequencies (k=pi fc/U), indicating that there is a possibility of airfoil excitation or stall flutter even at these low Re (c=chord length). Outside this range of reduced frequencies, the energy transfer is negative and under these conditions the oscillations would be damped. Particle Image Velocimetry (PIV) measurements of the flow around the oscillating airfoil show that the shear layer separates from the leading edge and forms a leading edge vortex, although it is not very clear and distinct due to the low oscillation amplitudes. On the other hand, the shear layer formed after separation is found to clearly move periodically away from the airfoil suction surface and towards it with a phase lag to the airfoil oscillations. The phase of the shear layer motion with respect to the airfoil motions shows a clear difference between the exciting and the damping case.

A transform approach to linear network coding for acyclic networks with delay

The algebraic formulation for linear network coding in acyclic networks with each link having an integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes at any given time instant is a Fq-linear combination of the input symbols across different generations, where Fq denotes the field over which the network operates. We use finite-field discrete Fourier transform (DFT) to convert the output symbols at the sink nodes at any given time instant into a Fq-linear combination of the input symbols generated during the same generation. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (non-transform) approach if and only if there exists a network code satisfying sink demands in the transform approach. Furthermore, assuming time invariant local encoding kernels, we show that the transform method can be employed to achieve half the rate corresponding to the individual source-destination mincut (which are assumed to be equal to 1) for some classes of three-source three-destination multiple unicast network with delays using alignment strategies when the zero-interference condition is not satisfied.

A Multicast Authentication Protocol (MAP) for Dynamic Multicast Groups in Wireless Networks

In this paper, we have proposed a centralized multicast authentication protocol (MAP) for dynamic multicast groups in wireless networks. In our protocol, a multicast group is defined only at the time of the multicasting. The authentication server (AS) in the network generates a session key and authenticates it to each of the members of a multicast group using the computationally inexpensive least common multiple (LCM) method. In addition, a pseudo random function (PRF) is used to bind the secret keys of the network members with their identities. By doing this, the AS is relieved from storing per member secrets in its memory, making the scheme completely storage scalable. The protocol minimizes the load on the network members by shifting the computational tasks towards the AS node as far as possible. The protocol possesses a membership revocation mechanism and is protected against replay attack and brute force attack. Analytical and simulation results confirm the effectiveness of the proposed protocol.

Experimental Investigation of Heat Fluxes in the Vicinity of Protuberances on a Flat Plate at Hypersonic Speeds

Heat transfer rates measured in front and to the side of a protrusion on an aluminum flat plate subjected to hypersonic flow at zero angle of attack are presented for two flow enthalpies of approximately 2 MJ/kg and 4.5 MJ/kg. Experiments were conducted in the hypersonic shock tunnel (HST2) and free piston driven HST3 at a freestream Mach number of 8. Heat transfer data was obtained for different geometries of the protrusion of a height of 4 mm, which is approximately the local boundary layer thickness. Comparatively high rates of heat transfer were obtained at regions of flow circulation in the separated region, with the hottest spot generally appearing in front of the protuberance. Experimental values showed moderate agreement with existing empirical correlations at higher enthalpy but not at all for the lower enthalpy condition, although the correlations were coined at enthalpy values nearer to the lower value. Schlieren visualization was also done to investigate the flow structures qualitatively.

Sliding mode control based guidance law with impact time constraints

In this paper, the sliding mode control based guidance laws to intercept stationary targets at a desired impact time are proposed. Then, it is extended to constant velocity targets using the notion of predicted interception. The desired impact time is achieved by selecting the interceptor's lateral acceleration to enforce a sliding mode on a switching surface designed using non-linear engagement dynamics. Numerical simulation results are presented to validate the proposed guidance law for different initial engagement geometries, impact times and salvo attack scenarios

Hypersonic interference heating on flat plate with short three-dimensional protuberances

Experiments were conducted to measure the heat flux in the vicinity of a three-dimensional protuberance placed on a flat plate facing a hypersonic flow at zero angle of attack. The effects of flow enthalpy and height of the protuberance on the interference heating in its vicinity were studied. Evidence of disturbed flow with highly three-dimensional characteristics and heightened vorticity was observed near the protrusion. A parametric study by changing the deflection angle of the protuberance was also made. Correlations exist in the open literature for enthalpy values lower than 2  MJ/kg. This effort has yielded a new correlation that is valid for enthalpies up to 6  MJ/kg. The Z-type schlieren technique was used to visualize the flow features qualitatively for one of the flow conditions studied.

Fast-Decodable MIDO Codes With Large Coding Gain

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of two complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input double output (MIDO) systems. Using this method, rate-2 STBCs for 4 x 2, 6 x 2, 8 x 2, and 12 x 2 systems are constructed and these STBCs are fast ML-decodable, have large coding gains, and STBC-schemes consisting of these STBCs have a non-vanishing determinant (NVD) so that they are DMT-optimal for their respective MIDO systems. It is also shown that the Srinath-Rajan code for the 4 x 2 system, which has the lowest ML-decoding complexity among known rate-2 STBCs for the 4x2 MIDO system with a large coding gain for 4-/16-QAM, has the same algebraic structure as the STBC constructed in this paper for the 4 x 2 system. This also settles in positive a previous conjecture that the STBC-scheme that is based on the Srinath-Rajan code has the NVD property and hence is DMT-optimal for the 4 x 2 system.

Nonlinear and linear autopilot performance comparison of tactical flight vehicle

n this paper, three-axis autopilot of a tactical flight vehicle has been designed for surface to air application. Both nonlinear and linear design synthesis and analysis have been carried out pertaining to present flight vehicle. Lateral autopilot performance has been compared by tracking lateral acceleration components along yaw and pitch plane at higher angles of attack in presence of side force and aerodynamic nonlinearity. The nonlinear lateral autopilot design is based on dynamic inversion and time scale separation principle. The linear lateral autopilot design is based on three-loop topology. Roll autopilot robustness performance has been enhanced against unmodeled roll disturbances by backstepping technique. Complete performance comparison results of both nonlinear and linear controller based on six degrees of freedom simulation along with stability and robustness studies with respect to plant parameter variation have been discussed in the paper.

Cooperative Communication of UAV to Perform Multi-task Using Nature Inspired Techniques

In this paper, the approach for assigning cooperative communication of Uninhabited Aerial Vehicles (UAV) to perform multiple tasks on multiple targets is posed as a combinatorial optimization problem. The multiple task such as classification, attack and verification of target using UAV is employed using nature inspired techniques such as Artificial Immune System (AIS), Particle Swarm Optimization (PSO) and Virtual Bee Algorithm (VBA). The nature inspired techniques have an advantage over classical combinatorial optimization methods like prohibitive computational complexity to solve this NP-hard problem. Using the algorithms we find the best sequence in which to attack and destroy the targets while minimizing the total distance traveled or the maximum distance traveled by an UAV. The performance analysis of the UAV to classify, attack and verify the target is evaluated using AIS, PSO and VBA.

Robust Reentry Guidance of a Reusable Launch Vehicle Using Model Predictive Static Programming

A robust suboptimal reentry guidance scheme is presented for a reusable launch vehicle using the recently developed, computationally efficient model predictive static programming. The formulation uses the nonlinear vehicle dynamics with a spherical and rotating Earth, hard constraints for desired terminal conditions, and an innovative cost function having several components with associated weighting factors that can account for path and control constraints in a soft constraint manner, thereby leading to smooth solutions of the guidance parameters. The proposed guidance essentially shapes the trajectory of the vehicle by computing the necessary angle of attack and bank angle that the vehicle should execute. The path constraints are the structural load constraint, thermal load constraint, bounds on the angle of attack, and bounds on the bank angle. In addition, the terminal constraints include the three-dimensional position and velocity vector components at the end of the reentry. Whereas the angle-of-attack command is generated directly, the bank angle command is generated by first generating the required heading angle history and then using it in a dynamic inversion loop considering the heading angle dynamics. Such a two-loop synthesis of bank angle leads to better management of the vehicle trajectory and avoids mathematical complexity as well. Moreover, all bank angle maneuvers have been confined to the middle of the trajectory and the vehicle ends the reentry segment with near-zero bank angle, which is quite desirable. It has also been demonstrated that the proposed guidance has sufficient robustness for state perturbations as well as parametric uncertainties in the model.

Counterfactual quantum certificate authorization

We present a multipartite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.

Thermal Decomposition of Propargyl Alcohol: Single Pulse Shock Tube Experimental and ab Initio Theoretical Study

Thermal decomposition of propargyl alcohol (C3H3OH), a molecule of interest in interstellar chemistry and combustion, was investigated using a single pulse shock tube in the temperature ranging from 953 to 1262 K. The products identified include acetylene, propyne, vinylacetylene, propynal, propenal, and benzene. The experimentally observed overall rate constant for thermal decomposition of propargyl alcohol was found to be k = 10((10.17 +/- 0.36)) exp(-39.70 +/- 1.83)/RT) s(-1) Ab initio theoretical calculations were carried out to understand the potential energy surfaces involved in the primary and secondary steps of propargyl alcohol thermal decomposition. Transition state theory was used to predict the rate constants, which were then used and refined in a kinetic simulation of the product profile. The first step in the decomposition is C-O bond dissociation, leading to the formation of two important radicals in combustion, OH and propargyl. This has been used to study the reverse OH propargyl radical reaction, about which there appears to be no prior work. Depending on the site of attack, this reaction leads to propargyl alcohol or propenal, one of the major products at temperatures below 1200 K. A detailed mechanism has been derived to explain all the observed products.

Dense shallow granular flows

Simplified equations are derived for a granular flow in the `dense' limit where the volume fraction is close to that for dynamical arrest, and the `shallow' limit where the stream-wise length for flow development (L) is large compared with the cross-stream height (h). The mass and diameter of the particles are set equal to 1 in the analysis without loss of generality. In the dense limit, the equations are simplified by taking advantage of the power-law divergence of the pair distribution function chi proportional to (phi(ad) - phi)(-alpha), and a faster divergence of the derivativ rho(d chi/d rho) similar to (d chi/d phi), where rho and phi are the density and volume fraction, and phi(ad) is the volume fraction for arrested dynamics. When the height h is much larger than the conduction length, the energy equation reduces to an algebraic balance between the rates of production and dissipation of energy, and the stress is proportional to the square of the strain rate (Bagnold law). In the shallow limit, the stress reduces to a simplified Bagnold stress, where all components of the stress are proportional to (partial derivative u(x)/partial derivative y)(2), which is the cross-stream (y) derivative of the stream-wise (x) velocity. In the simplified equations for dense shallow flows, the inertial terms are neglected in the y momentum equation in the shallow limit because the are O(h/L) smaller than the divergence of the stress. The resulting model contains two equations, a mass conservation equations which reduces to a solenoidal condition on the velocity in the incompressible limit, and a stream-wise momentum equation which contains just one parameter B which is a combination of the Bagnold coefficients and their derivatives with respect to volume fraction. The leading-order dense shallow flow equations, as well as the first correction due to density variations, are analysed for two representative flows. The first is the development from a plug flow to a fully developed Bagnold profile for the flow down an inclined plane. The analysis shows that the flow development length is ((rho) over barh(3)/B) , where (rho) over bar is the mean density, and this length is numerically estimated from previous simulation results. The second example is the development of the boundary layer at the base of the flow when a plug flow (with a slip condition at the base) encounters a rough base, in the limit where the momentum boundary layer thickness is small compared with the flow height. Analytical solutions can be found only when the stream-wise velocity far from the surface varies as x(F), where x is the stream-wise distance from the start of the rough base and F is an exponent. The boundary layer thickness increases as (l(2)x)(1/3) for all values of F, where the length scale l = root 2B/(rho) over bar. The analysis reveals important differences between granular flows and the flows of Newtonian fluids. The Reynolds number (ratio of inertial and viscous terms) turns out to depend only on the layer height and Bagnold coefficients, and is independent of the flow velocity, because both the inertial terms in the conservation equations and the divergence of the stress depend on the square of the velocity/velocity gradients. The compressibility number (ratio of the variation in volume fraction and mean volume fraction) is independent of the flow velocity and layer height, and depends only on the volume fraction and Bagnold coefficients.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).