Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Harmonic analysis of DC capacitor current in sinusoidal and space-vector modulated neutral-point-clamped inverters

The voltage ripple and power loss in the DC-capacitor of a voltage source inverter depend on the harmonic currents flowing through the capacitor. This paper presents a double Fourier series based analysis of the harmonic contents of the DC capacitor current in a three-level neutral-point clamped (NPC) inverter, modulated with sine-triangle pulse-width modulation (SPWM) or conventional space vector pulse-width modulation (CSVPWM) schemes. The analytical results are validated experimentally on a 3-kVA three-level inverter prototype. The capacitor current in an NPC inverter has a periodicity of 120(a similar to) at the fundamental or modulation frequency. Hence, this current contains third-harmonic and triplen-frequency components, apart from switching frequency components. The harmonic components vary with modulation index and power factor for both PWM schemes. The third harmonic current decreases with increase in modulation index and also decreases with increase in power factor in case of both PWM methods. In general, the third harmonic content is higher with SPWM than with CSVPWM at a given operating condition. Also, power loss and voltage ripple in the DC capacitor are estimated for both the schemes using the current harmonic spectrum and equivalent series resistance (ESR) of the capacitor.

Determinantal point processes in the plane from products of random matrices

We show that the density of eigenvalues for three classes of random matrix ensembles is determinantal. First we derive the density of eigenvalues of product of k independent n x n matrices with i.i.d. complex Gaussian entries with a few of matrices being inverted. In second example we calculate the same for (compatible) product of rectangular matrices with i.i.d. Gaussian entries and in last example we calculate for product of independent truncated unitary random matrices. We derive exact expressions for limiting expected empirical spectral distributions of above mentioned ensembles.

Optimal Guidance for Accurate Lunar Soft Landing with Minimum Fuel Consumption using Model Predictive Static Programming

In this paper the soft lunar landing with minimum fuel expenditure is formulated as a nonlinear optimal guidance problem. The realization of pinpoint soft landing with terminal velocity and position constraints is achieved using Model Predictive Static Programming (MPSP). The high accuracy of the terminal conditions is ensured as the formulation of the MPSP inherently poses final conditions as a set of hard constraints. The computational efficiency and fast convergence make the MPSP preferable for fixed final time onboard optimal guidance algorithm. It has also been observed that the minimum fuel requirement strongly depends on the choice of the final time (a critical point that is not given due importance in many literature). Hence, to optimally select the final time, a neural network is used to learn the mapping between various initial conditions in the domain of interest and the corresponding optimal flight time. To generate the training data set, the optimal final time is computed offline using a gradient based optimization technique. The effectiveness of the proposed method is demonstrated with rigorous simulation results.

Two-Point Closure Strategy in the Mapping Closure Approximation Approach

A two-point closure strategy in mapping closure approximation (MCA) approach is developed for the evolution of the probability density function (PDF) of a scalar advected by stochastic velocity fields. The MCA approach is based on multipoint statistics. We formulate a MCA modeled system using the one-point PDFs and two-point correlations. The MCA models can describe both the evolution of the PDF shape and the rate at which the PDF evolves.

Nonlinear Analysis of Submarine Pipelines During Single Point Lifting

基于管道微单元体平衡建立了海管单点提升的非线性力学模型的控制微分方程组,使用变弧长的无量纲代换将动边界问题化为固定边界的两点边值问题,利用maple环境下编制的两点边值问题的打靶法程序得到了该问题在各个提升阶段的数值解答和在单点提升过程中管道的极限弯矩约为0.71q~{1/3}(EI)~{2/3}。

Modification of Bertrand's theorem and extended Runge-Lenz vector

It is shown that for a particle with suitable angular moments in the screened Coulomb potential or isotropic harmonic potential, there still exist closed orbits rather than ellipse, characterized by the conserved aphelion and perihelion vectors, i.e. extended Runge-Lenz vector, which implies a higher dynamical symmetry than the geometrical symmetry O-3. The closeness of a planar orbit implies the radial and angular motional frequencies are commensurable.

The Complete Proof of the Virial Theorem in the Refined TFD Theory for all Electrons of an Atom in a Solid

The complete proof of the virial theorem in refined Thomas-Fermi-Dirac theory for all electrons of an atom in a solid is given.

Flow properties of a dusty-gas point source in a supersonic free stream

By using Lagrangian method, the flow properties of a dusty-gas point source in a supersonic free stream were studied and the particle parameters in the near-symmetry-axis region were obtained. It is demonstrated that fairly inertial particles travel along oscillating and intersecting trajectories between the bow and termination shock waves. In this region,formation of "multi-layer structure" in particle distribution with alternating low- and highdensity layers is revealed. Moreover, sharp accumulation of particles occurs near the envelopes of particle trajectories.

Research on Dynamic Micro-Deformation under Laser Point Source

The dynamic micro-deformation of the specimen under laser point source is measured using a laser beam reflex amplifier system and numerically simulated by Msc.Marc software. Compared with experimental result and calculated result, the final deformation direction of the specimen depends on the result of the thermal strain and the phase transformation strain cooperation, away from the laser beam or towards the laser beam, the final deformation angle depends on temperature gradient in the thickness direction and the geometry constraint of the specimen. The conclusion lays the foundation for further research on the mechanism of laser bending. At the same time, it is proposed that the model of calculation based on classical Fourier heat transfer theory cannot be enough to simulate the dynamic micro-deformation of the specimen under laser point source, the model of calculation should be modified in the future.

A New Version of Smoothed Point Method to Simulate Linear Elastic Wave Propagation

By using the kernel function of the smoothed particle hydrodynamics (SPH) and modification of statistical volumes of the boundary points and their kernel functions, a new version of smoothed point method is established for simulating elastic waves in solid. With the simplicity of SPH kept, the method is easy to handle stress boundary conditions, especially for the transmitting boundary condition. A result improving by de-convolution is also proposed to achieve high accuracy under a relatively large smooth length. A numerical example is given and compared favorably with the analytical solution.

Transient Ventilation Dynamics Following a Change in Strength of a Point Source of Heat

We investigate the transient ventilation flow within a confined ventilated space, with high- and low-level openings, when the strength of a low-level point source of heat is changed instantaneously. The steady-flow regime in the space involves a turbulent buoyant plume, which rises from the point source to a well-mixed warm upper layer. The steady-state height of the interface between this layer and the lower layer of exterior fluid is independent of the heat flux, but the upper layer becomes progressively warmer with heat flux. New analogue laboratory experiments of the transient adjustment between steady states identify that if the heat flux is increased, the continuing plume propagates to the top of the room forming a new, warmer layer. This layer gradually deepens, and as the turbulent plume entrains fluid from the original warm layer, the original layer is gradually depleted and disappears, and a new steady state is established. In contrast, if the source buoyancy flux is decreased, the continuing plume is cooler than the original plume, so that on reaching the interface it is of intermediate density between the original warm layer and the external fluid. The plume supplies a new intermediate layer, which gradually deepens with the continuing flow. In turn, the original upper layer becomes depleted, both as a result of being vented through the upper opening of the space, but also due to some penetrative entrainment of this layer by the plume, as the plume overshoots the interface before falling back to supply the new intermediate layer. We develop quantitative models which are in good accord with our experimental data, by combining classical plume theory with models of the penetrative entrainment for the case of a decrease in heating. Typically, we find that the effect of penetrative entrainment on the density of the intruding layer is relatively weak, provided the change in source strength is sufficiently large. However, penetrative entrainment measurably increases the rate at which the depth of the draining layer decreases. We conclude with a discussion of the importance of these results for the control of naturally ventilated spaces.

Computer generated hologram with geometric occlusion using GPU-accelerated depth buffer rasterization for three-dimensional display

We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume.We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm's complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of 0:01' for a 2:66' cone angle produces acceptable reconstruction quality. © 2009 Optical Society of America.

Computer generated hologram from point cloud using graphics processor

Computer generated holography is an extremely demanding and complex task when it comes to providing realistic reconstructions with full parallax, occlusion, and shadowing. We present an algorithm designed for data-parallel computing on modern graphics processing units to alleviate the computational burden. We apply Gaussian interpolation to create a continuous surface representation from discrete input object points. The algorithm maintains a potential occluder list for each individual hologram plane sample to keep the number of visibility tests to a minimum.We experimented with two approximations that simplify and accelerate occlusion computation. It is observed that letting several neighboring hologramplane samples share visibility information on object points leads to significantly faster computation without causing noticeable artifacts in the reconstructed images. Computing a reduced sample set via nonuniform sampling is also found to be an effective acceleration technique. © 2009 Optical Society of America.