Inverse Polynomial Based Explicit Guidance for Lunar Soft Landing During Powered Braking

In this paper an explicit guidance law for the powered descent phase of the soft lunar landing is presented. The descent trajectory, expressed in polynomial form is fixed based on the boundary conditions imposed by the precise soft landing mission. Adapting an inverse model based approach, the guidance command is computed from the known spacecraft trajectory. The guidance formulation ensures the vertical orientation of the spacecraft during touchdown. Also a closed form relation for the final flight time is proposed. The final time is expressed as a function of initial position and velocity of the spacecraft ( at the start of descent) and also depends on the desired landing site. To ensure the fuel minimum descent the proposed explicit method is extended to optimal guidance formulation. The effectiveness of the proposed guidance laws are demonstrated with simulation results.

HOMOGENIZATION OF A HYPERBOLIC EQUATION WITH HIGHLY CONTRASTING DIFFUSIVITY COEFFICIENTS

We study a hyperbolic problem in the framework of periodic homogenization assuming a high contrast between the diffusivity coefficients of the two components M-epsilon and B-epsilon of the heterogeneous medium. There are three regimes depending on the ratio between the size of the period and the amplitude a, of the diffusivity in B-epsilon. For the critical regime alpha(epsilon) similar or equal to epsilon, the limit problem is a strongly coupled system involving both the macroscopic and the microscopic variables. We also include the results in the non critical case.

HOMOGENIZATION OF A HYPERBOLIC EQUATION WITH HIGHLY CONTRASTING DIFFUSIVITY COEFFICIENTS

We study a hyperbolic problem in the framework of periodic homogenization assuming a high contrast between the diffusivity coefficients of the two components M-epsilon and B-epsilon of the heterogeneous medium. There are three regimes depending on the ratio between the size of the period and the amplitude a, of the diffusivity in B-epsilon. For the critical regime alpha(epsilon) similar or equal to epsilon, the limit problem is a strongly coupled system involving both the macroscopic and the microscopic variables. We also include the results in the non critical case.

FAST AND ACCURATE BILATERAL FILTERING USING GAUSS-POLYNOMIAL DECOMPOSITION

The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A common form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires O(sigma(2)) operations per pixel, where sigma is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to O(1) per pixel for any arbitrary sigma (constant-time implementation). This is based on the observation that the range kernel operates via the translations of a fixed Gaussian over the range space, and that these translated Gaussians can be accurately approximated using the so-called Gauss-polynomials. The overall algorithm emerging from this approximation involves a series of spatial Gaussian filtering, which can be efficiently implemented (in parallel) using separability and recursion. We present some preliminary results to demonstrate that the proposed algorithm compares favorably with some of the existing fast algorithms in terms of speed and accuracy.

Swelling behaviour of soil-bentonite mixtures

Studies on the swelling behaviour of mixtures of bentonite clay and nonswelling coarser fractions of different sizes and shapes reveal that observed swelling occurs only after the voids of the nonswelling particles are filled up with swollen clay particles. The magnitude of the swell within the voids, called intervoid swelling is large when the size and percentage of the nonswelling coarser fraction is large. The observable swell, after intervoid swelling, is called primary swelling and follows a rectangular hyperbolic relationship with time. The total swell per gram of the clay decreases with an increase in the size of the nonswelling fraction and with a decrease in the percentage of swelling clay. Time-swell relationships show that swelling continues to occur for a long time after the primary swelling, and this is called secondary swelling.

Information theory and one-dimensional disordered conductors

A novel method is proposed to treat the problem of the random resistance of a strictly one-dimensional conductor with static disorder. It is suggested, for the probability distribution of the transfer matrix of the conductor, the distribution of maximum information-entropy, constrained by the following physical requirements: 1) flux conservation, 2) time-reversal invariance and 3) scaling, with the length of the conductor, of the two lowest cumulants of ζ, where = sh2ζ. The preliminary results discussed in the text are in qualitative agreement with those obtained by sophisticated microscopic theories.

Mesh-free approximations via the error reproducing kernel method and applications to nonlinear systems developing shocks

Error estimates for the error reproducing kernel method (ERKM) are provided. The ERKM is a mesh-free functional approximation scheme [A. Shaw, D. Roy, A NURBS-based error reproducing kernel method with applications in solid mechanics, Computational Mechanics (2006), to appear (available online)], wherein a targeted function and its derivatives are first approximated via non-uniform rational B-splines (NURBS) basis function. Errors in the NURBS approximation are then reproduced via a family of non-NURBS basis functions, constructed using a polynomial reproduction condition, and added to the NURBS approximation of the function obtained in the first step. In addition to the derivation of error estimates, convergence studies are undertaken for a couple of test boundary value problems with known exact solutions. The ERKM is next applied to a one-dimensional Burgers equation where, time evolution leads to a breakdown of the continuous solution and the appearance of a shock. Many available mesh-free schemes appear to be unable to capture this shock without numerical instability. However, given that any desired order of continuity is achievable through NURBS approximations, the ERKM can even accurately approximate functions with discontinuous derivatives. Moreover, due to the variation diminishing property of NURBS, it has advantages in representing sharp changes in gradients. This paper is focused on demonstrating this ability of ERKM via some numerical examples. Comparisons of some of the results with those via the standard form of the reproducing kernel particle method (RKPM) demonstrate the relative numerical advantages and accuracy of the ERKM.

Approximate solutions of Fredholm integral equations of the second kind

This note is concerned with the problem of determining approximate solutions of Fredholm integral equations of the second kind. Approximating the solution of a given integral equation by means of a polynomial, an over-determined system of linear algebraic equations is obtained involving the unknown coefficients, which is finally solved by using the least-squares method. Several examples are examined in detail. (c) 2009 Elsevier Inc. All rights reserved.

Fast Iterative Division of p-adic Numbers

A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.

A global convergence criterion for discrete-time multivariable adaptive systems

The paper deals with the basic problem of adjusting a matrix gain in a discrete-time linear multivariable system. The object is to obtain a global convergence criterion, i.e. conditions under which a specified error signal asymptotically approaches zero and other signals in the system remain bounded for arbitrary initial conditions and for any bounded input to the system. It is shown that for a class of up-dating algorithms for the adjustable gain matrix, global convergence is crucially dependent on a transfer matrix G(z) which has a simple block diagram interpretation. When w(z)G(z) is strictly discrete positive real for a scalar w(z) such that w-1(z) is strictly proper with poles and zeros within the unit circle, an augmented error scheme is suggested and is proved to result in global convergence. The solution avoids feeding back a quadratic term as recommended in other schemes for single-input single-output systems.

Quantum-Ohmic Resistance Fluctuation In Disordered Conductors - An Invariant Imbedding Approach

It is now well known that in extreme quantum limit, dominated by the elastic impurity scattering and the concomitant quantum interference, the zero-temperature d.c. resistance of a strictly one-dimensional disordered system is non-additive and non-self-averaging. While these statistical fluctuations may persist in the case of a physically thin wire, they are implicitly and questionably ignored in higher dimensions. In this work, we have re-examined this question. Following an invariant imbedding formulation, we first derive a stochastic differential equation for the complex amplitude reflection coefficient and hence obtain a Fokker-Planck equation for the full probability distribution of resistance for a one-dimensional continuum with a Gaussian white-noise random potential. We then employ the Migdal-Kadanoff type bond moving procedure and derive the d-dimensional generalization of the above probability distribution, or rather the associated cumulant function –‘the free energy’. For d=3, our analysis shows that the dispersion dominates the mobilitly edge phenomena in that (i) a one-parameter B-function depending on the mean conductance only does not exist, (ii) an approximate treatment gives a diffusion-correction involving the second cumulant. It is, however, not clear whether the fluctuations can render the transition at the mobility edge ‘first-order’. We also report some analytical results for the case of the one dimensional system in the presence of a finite electric fiekl. We find a cross-over from the exponential to the power-low length dependence of resistance as the field increases from zero. Also, the distribution of resistance saturates asymptotically to a poissonian form. Most of our analytical results are supported by the recent numerical simulation work reported by some authors.

Visual ecology of Indian carpenter bees II: adaptations of eyes and ocelli to nocturnal and diurnal lifestyles

Most bees are diurnal, with behaviour that is largely visually mediated, but several groups have made evolutionary shifts to nocturnality, despite having apposition compound eyes unsuited to vision in dim light. We compared the anatomy and optics of the apposition eyes and the ocelli of the nocturnal carpenter bee, Xylocopa tranquebarica, with two sympatric species, the strictly diurnal X. leucothorax and the occasionally crepuscular X. tenuiscapa. The ocelli of the nocturnal X. tranquebarica are unusually large (diameter ca. 1 mm) and poorly focussed. Moreover, their apposition eyes show specific visual adaptations for vision in dim light, including large size, large facets and very wide rhabdoms, which together make these eyes 9 times more sensitive than those of X. tenuiscapa and 27 times more sensitive than those of X. leucothorax. These differences in optical sensitivity are surprisingly small considering that X. tranquebarica can fly on moonless nights when background luminance is as low as 10(-5) cd m(-2), implying that this bee must employ additional visual strategies to forage and find its way back to the nest. These strategies may include photoreceptors with longer integration times and higher contrast gains as well as higher neural summation mechanisms for increasing visual reliability in dim light.

Split-Freedom And Mvd-Intersection - A New Characterization Of Multivalued Dependencies Having Conflict-Free Covers

Sets of multivalued dependencies (MVDs) having conflict-free covers are important to the theory and design of relational databases [2,12,15,16]. Their desirable properties motivate the problem of testing a set M of MVDs for the existence of a confiict-free cover. In [8] Goodman and Tay have proposed an approach based on the possible equivalence of M to a single (acyclic) join dependency (JD). We remark that their characterization does not lend an insight into the nature of such sets of MVDs. Here, we use notions that are intrinsic to MVDs to develop a new characterization. Our approach proceeds in two stages. In the first stage, we use the notion of “split-free” sets of MVDs and obtain a characterization of sets M of MVDs having split-free covers. In the second, we use the notion of “intersection” of MVDs to arrive at a necessary and sufficient condition for a split-free set of MVDs to be conflict-free. Based on our characterizations, we also give polynomial-time algorithms for testing whether M has split-free and conflict-free covers. The highlight of our approach is the clear insight it provides into the nature of sets of MVDs having conflict-free covers. Less emphasis is given in this paper to the actual efficiency of the algorthms. Finally, as a bonus, we derive a desirable property of split-free sets of MVDs,thereby showing that they are interesting in their own right.

Estrogen modulation of retinol-binding protein in immature chicks: Comparison with riboflavin carrier protein

The kinetics of estrogen (E) modulation of retinol-binding protein (RBP) production in the liver of immature chicks were compared with those governing de novo induction of riboflavin carrier protein (RCP) in the same tissue. A single dose of E markedly enhanced the plasma levels of RBP without any detectable lag period to reach peak value by 24 h and this was followed by a decline to attain the baseline by 4 days. There was no amplification of the response during secondary stimulation unlike the case with RCP induction. With multiple E administration, the 4-fold increased plasma RBP concentrations were sustained at a steady state during both primary and secondary stimulations, whereas concomitant RCP concentration progressively increased with each hormone administration and this response was further amplified during secondary stimulation. Unlike RCP induction, enhanced RBP accumulation was not strictly E dose dependent although a minimal threshold level of the steroid was required to elicit measurable response. Progesterone (P) could neither modulate nor substitute for E in enhancing plasma levels of either of the 2 proteins while the anti-estrogens, en- and zuclomifene citrate severely suppressed the production of both the proteins. RCP induction was completely inhibited by both α-amanitin and cycloheximide for prolonged periods while E-stimulated RBP production was affected only partially by α-amanitin. Likewise, cycloheximide inhibition of RBP accumulation followed a pattern similar to that of hepatic general protein synthesis.

On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts

A cut (A, B) (where B = V - A) in a graph G = (V, E) is called internal if and only if there exists a vertex x in A that is not adjacent to any vertex in B and there exists a vertex y is an element of B such that it is not adjacent to any vertex in A. In this paper, we present a theorem regarding the arrangement of cliques in a chordal graph with respect to its internal cuts. Our main result is that given any internal cut (A, B) in a chordal graph G, there exists a clique with kappa(G) + vertices (where kappa(G) is the vertex connectivity of G) such that it is (approximately) bisected by the cut (A, B). In fact we give a stronger result: For any internal cut (A, B) of a chordal graph, and for each i, 0 <= i <= kappa(G) + 1 such that vertical bar K-i vertical bar = kappa(G) + 1, vertical bar A boolean AND K-i vertical bar = i and vertical bar B boolean AND K-i vertical bar = kappa(G) + 1 - i. An immediate corollary of the above result is that the number of edges in any internal cut (of a chordal graph) should be Omega(k(2)), where kappa(G) = k. Prompted by this observation, we investigate the size of internal cuts in terms of the vertex connectivity of the chordal graphs. As a corollary, we show that in chordal graphs, if the edge connectivity is strictly less than the minimum degree, then the size of the mincut is at least kappa(G)(kappa(G)+1)/2 where kappa(G) denotes the vertex connectivity. In contrast, in a general graph the size of the mincut can be equal to kappa(G). This result is tight.