Nonquadratic penalization improves near-infrared diffuse optical tomography

A new approach that can easily incorporate any generic penalty function into the diffuse optical tomographic image reconstruction is introduced to show the utility of nonquadratic penalty functions. The penalty functions that were used include quadratic (l(2)), absolute (l(1)), Cauchy, and Geman-McClure. The regularization parameter in each of these cases was obtained automatically by using the generalized cross-validation method. The reconstruction results were systematically compared with each other via utilization of quantitative metrics, such as relative error and Pearson correlation. The reconstruction results indicate that, while the quadratic penalty may be able to provide better separation between two closely spaced targets, its contrast recovery capability is limited, and the sparseness promoting penalties, such as l(1), Cauchy, and Geman-McClure have better utility in reconstructing high-contrast and complex-shaped targets, with the Geman-McClure penalty being the most optimal one. (C) 2013 Optical Society of America

An approximately H-1-optimal Petrov-Galerkin meshfree method: application to computation of scattered light for optical tomography

Nearly pollution-free solutions of the Helmholtz equation for k-values corresponding to visible light are demonstrated and verified through experimentally measured forward scattered intensity from an optical fiber. Numerically accurate solutions are, in particular, obtained through a novel reformulation of the H-1 optimal Petrov-Galerkin weak form of the Helmholtz equation. Specifically, within a globally smooth polynomial reproducing framework, the compact and smooth test functions are so designed that their normal derivatives are zero everywhere on the local boundaries of their compact supports. This circumvents the need for a priori knowledge of the true solution on the support boundary and relieves the weak form of any jump boundary terms. For numerical demonstration of the above formulation, we used a multimode optical fiber in an index matching liquid as the object. The scattered intensity and its normal derivative are computed from the scattered field obtained by solving the Helmholtz equation, using the new formulation and the conventional finite element method. By comparing the results with the experimentally measured scattered intensity, the stability of the solution through the new formulation is demonstrated and its closeness to the experimental measurements verified.

On the sphere decoding complexity of high-rate multigroup decodable STBCs in asymmetric MIMO systems

A space-time block code (STBC) is said to be multigroup decodable if the information symbols encoded by it can be partitioned into two or more groups such that each group of symbols can be maximum-likelihood (ML) decoded independently of the other symbol groups. In this paper, we show that the upper triangular matrix encountered during the sphere decoding of a linear dispersion STBC can be rank-deficient even when the rate of the code is less than the minimum of the number of transmit and receive antennas. We then show that all known families of high-rate (rate greater than 1) multigroup decodable codes have rank-deficient matrix even when the rate is less than the number of transmit and receive antennas, and this rank-deficiency problem arises only in asymmetric MIMO systems when the number of receive antennas is strictly less than the number of transmit antennas. Unlike the codes with full-rank matrix, the complexity of the sphere decoding-based ML decoder for STBCs with rank-deficient matrix is polynomial in the constellation size, and hence is high. We derive the ML sphere decoding complexity of most of the known high-rate multigroup decodable codes, and show that for each code, the complexity is a decreasing function of the number of receive antennas.

Application of the random eigenvalue problem in forced response analysis of a linear stochastic structure

The random eigenvalue problem arises in frequency and mode shape determination for a linear system with uncertainties in structural properties. Among several methods of characterizing this random eigenvalue problem, one computationally fast method that gives good accuracy is a weak formulation using polynomial chaos expansion (PCE). In this method, the eigenvalues and eigenvectors are expanded in PCE, and the residual is minimized by a Galerkin projection. The goals of the current work are (i) to implement this PCE-characterized random eigenvalue problem in the dynamic response calculation under random loading and (ii) to explore the computational advantages and challenges. In the proposed method, the response quantities are also expressed in PCE followed by a Galerkin projection. A numerical comparison with a perturbation method and the Monte Carlo simulation shows that when the loading has a random amplitude but deterministic frequency content, the proposed method gives more accurate results than a first-order perturbation method and a comparable accuracy as the Monte Carlo simulation in a lower computational time. However, as the frequency content of the loading becomes random, or for general random process loadings, the method loses its accuracy and computational efficiency. Issues in implementation, limitations, and further challenges are also addressed.

Solution of Time Dependent Joule Heat Equation for a Graphene Sheet Under Thomson Effect

We address a physics-based solution of joule heating phenomenon in a single-layer graphene (SLG) sheet under the presence of Thomson effect. We demonstrate that the temperature in an isotopically pure (containing only C-12) SLG sheet attains its saturation level quicker than when doped with its isotopes (C-13). From the solution of the joule heating equation, we find that the thermal time constant of the SLG sheet is in the order of tenths of a nanosecond for SLG dimensions of a few micrometers. These results have been formulated using the electron interactions with the inplane and flexural phonons to demonstrate a field-dependent Landauer transmission coefficient. We further develop an analytical model of the SLG specific heat using the quadratic (out of plane) phonon band structure over the room temperature. Additionally, we show that a cooling effect in the SLG sheet can be substantially enhanced with the addition of C-13. The methodologies as discussed in this paper can be put forward to analyze the graphene heat spreader theory.

On Uniform Approximate Solutions in Bending of Symmetric Laminated Plates

A layer-wise theory with the analysis of face ply independent of lamination is used in the bending of symmetric laminates with anisotropic plies. More realistic and practical edge conditions as in Kirchhoff's theory are considered. An iterative procedure based on point-wise equilibrium equations is adapted. The necessity of a solution of an auxiliary problem in the interior plies is explained and used in the generation of proper sequence of two dimensional problems. Displacements are expanded in terms of polynomials in thickness coordinate such that continuity of transverse stresses across interfaces is assured. Solution of a fourth order system of a supplementary problem in the face ply is necessary to ensure the continuity of in-plane displacements across interfaces and to rectify inadequacies of these polynomial expansions in the interior distribution of approximate solutions. Vertical deflection does not play any role in obtaining all six stress components and two in-plane displacements. In overcoming lacuna in Kirchhoff's theory, widely used first order shear deformation theory and other sixth and higher order theories based on energy principles at laminate level in smeared laminate theories and at ply level in layer-wise theories are not useful in the generation of a proper sequence of 2-D problems converging to 3-D problems. Relevance of present analysis is demonstrated through solutions in a simple text book problem of simply supported square plate under doubly sinusoidal load.

Solving MIN ONES 2-SAT as fast as VERTEX COVER

The problem of finding a satisfying assignment that minimizes the number of variables that are set to 1 is NP-complete even for a satisfiable 2-SAT formula. We call this problem MIN ONES 2-SAT. It generalizes the well-studied problem of finding the smallest vertex cover of a graph, which can be modeled using a 2-SAT formula with no negative literals. The natural parameterized version of the problem asks for a satisfying assignment of weight at most k. In this paper, we present a polynomial-time reduction from MIN ONES 2-SAT to VERTEX COVER without increasing the parameter and ensuring that the number of vertices in the reduced instance is equal to the number of variables of the input formula. Consequently, we conclude that this problem also has a simple 2-approximation algorithm and a 2k - c logk-variable kernel subsuming (or, in the case of kernels, improving) the results known earlier. Further, the problem admits algorithms for the parameterized and optimization versions whose runtimes will always match the runtimes of the best-known algorithms for the corresponding versions of vertex cover. Finally we show that the optimum value of the LP relaxation of the MIN ONES 2-SAT and that of the corresponding VERTEX COVER are the same. This implies that the (recent) results of VERTEX COVER version parameterized above the optimum value of the LP relaxation of VERTEX COVER carry over to the MIN ONES 2-SAT version parameterized above the optimum of the LP relaxation of MIN ONES 2-SAT. (C) 2013 Elsevier B.V. All rights reserved.

Algebraic characterization of rainbow connectivity

The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also present a formulation of the rainbow connectivity problem as an ideal membership problem.

Formation flying of small satellites using suboptimal MPSP guidance

Using the recently developed model predictive static programming (MPSP), a suboptimal guidance logic is presented in this paper for formation flying of small satellites. Due to the inherent nature of the problem formulation, MPSP does not require the system dynamics to be linearized. The proposed guidance scheme is valid both for high eccentricity chief satellite orbits as well as large separation distance between chief and deputy satellites. Moreover, since MPSP poses the desired conditions as a set of `hard constraints', the final accuracy level achieved is very high. The proposed guidance scheme has been tested successfully for a variety of initial conditions and for a variety of formation commands as well. Comparison with standard Linear Quadratic Regulator (LQR) solution (which serves as a guess solution for MPSP) and another nonlinear controller, State Dependent Riccati Equation (SDRE) reveals that MPSP guidance achieves the objective with higher accuracy and with lesser amount of control usage as well.

Computationally Efficient and Accurate Modeling of Li-ion Battery

A computationally efficient Li-ion battery model has been proposed in this paper. The battery model utilizes the features of both analytical and electrical circuit modeling techniques. The model is simple as it does not involve a look-up table technique and fast as it does not include a polynomial function during computation. The internal voltage of the battery is modeled as a linear function of the state-of-charge of the battery. The internal resistance is experimentally determined and the optimal value of resistance is considered for modeling. Experimental and simulated data are compared to validate the accuracy of the model.

Transport properties of CuIn1-xAlxSe2/AZnO heterostructure for low cost thin film photovoltaics

CuIn1-xAlxSe2 (CIASe) thin films were grown by a simple sol-gel route followed by annealing under vacuum. Parameters related to the spin-orbit (Delta(SO)) and crystal field (Delta(CF)) were determined using a quasi-cubic model. Highly oriented (002) aluminum doped (2%) ZnO, 100 nm thin films, were co-sputtered for CuIn1-xAlxSe2/AZnO based solar cells. Barrier height and ideality factor varied from 0.63 eV to 0.51 eV and 1.3186 to 2.095 in the dark and under 1.38 A. M 1.5 solar illumination respectively. Current-voltage characteristics carried out at 300 K were confined to a triangle, exhibiting three limiting conduction mechanisms: Ohms law, trap-filled limit curve and SCLC, with 0.2 V being the cross-over voltage, for a quadratic transition from Ohm's to Child's law. Visible photodetection was demonstrated with a CIASe/AZO photodiode configuration. Photocurrent was enhanced by one order from 3 x 10(-3) A in the dark at 1 V to 3 x 10(-2) A upon 1.38 sun illumination. The optimized photodiode exhibits an external quantum efficiency of over 32% to 10% from 350 to 1100 nm at high intensity 17.99 mW cm(-2) solar illumination. High responsivity R-lambda similar to 920 A W-1, sensitivity S similar to 9.0, specific detectivity D* similar to 3 x 10(14) Jones, make CIASe a potential absorber for enhancing the forthcoming technological applications of photodetection.

Minimizing the Complexity of Fast Sphere Decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) was introduced by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain an optimal ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Impact angle constraint guidance law using cubic splines for intercepting stationary targets

In this paper the cubic spline guidance law is presented for intercepting a stationary target at a desired impact angle. The guidance law is obtained from cubic spline curve based trajectory using an inverse method. The cubic spline t rajectory curve expresses the altitude as a cubic polynomial of the downrange. The guidance law is modified to achieve interception in the cases where impact angle is greater that or equal to 90◦. The guidance law is implemented in a feedback mode to maintain the desired impact angle and to reduce miss distance in the presence of lateral acceleration saturation and atmospheric distur- bances. The simulation results show that the guidance law fulfills all the requirements.

Partially integrated guidance and control of an air-dropped guided munition with explicit trajectory fixing

An innovative partially integrated guidance and control (PIGC) technique is developed for trajectory fixing by considering six degree-of-freedom (Six-DOF) nonlinear engagement dynamics for successful interception of ground targets by guided munitions. This trajectory fixing algorithm gives closed form solution, where two different trajectories are designed in x - h and x - y planes separately using simple quadratic equations. In order to follow designed trajectories commanded pitch and yaw rates are generated in outer loop using dynamic inversion technique. In inner loop these body rates are tracked using faster dynamic inversion loop by generating the necessary control surface deflections. Simulation studies with actuator dynamics have been carried out to account for three dimensional (3D) engagement geometry to demonstrate the usefulness of PIGC technique.

Differential evolution based 3-D guidance law for a realistic interceptor model

This paper presents a novel, soft computing based solution to a complex optimal control or dynamic optimization problem that requires the solution to be available in real-time. The complexities in this problem of optimal guidance of interceptors launched with high initial heading errors include the more involved physics of a three dimensional missile-target engagement, and those posed by the assumption of a realistic dynamic model such as time-varying missile speed, thrust, drag and mass, besides gravity, and upper bound on the lateral acceleration. The classic, pure proportional navigation law is augmented with a polynomial function of the heading error, and the values of the coefficients of the polynomial are determined using differential evolution (DE). The performance of the proposed DE enhanced guidance law is compared against the existing conventional laws in the literature, on the criteria of time and energy optimality, peak lateral acceleration demanded, terminal speed and robustness to unanticipated target maneuvers, to illustrate the superiority of the proposed law. (C) 2013 Elsevier B. V. All rights reserved.