On the Transform Method of Solution of an External Crack Problem

The breakdown of the usual method of Fourier transforms in the problem of an external line crack in a thin infinite elastic plate is discovered and the correct solution of this problem is derived using the concept of a generalised Fourier transform of a type discussed first by Golecki [1] in connection with Flamant's problem.

Evaluation of two-dimensional quantizers for Fourier transform binary holograms

Quantization formats of four digital holographic codes (Lohmann,Lee, Burckhardt and Hsueh-Sawchuk) are evaluated. A quantitative assessment is made from errors in both the Fourier transform and image domains. In general, small errors in the Fourier amplitude or phase alone do not guarantee high image fidelity. From quantization considerations, the Lee hologram is shown to be the best choice for randomly phase coded objects. When phase coding is not feasible, the Lohmann hologram is preferable as it is easier to plot.

Analysis-By-Synthesis Based Switched Transform Domain Split Vq Using Gaussian Mixture Model

Using analysis-by-synthesis (AbS) approach, we develop a soft decision based switched vector quantization (VQ) method for high quality and low complexity coding of wideband speech line spectral frequency (LSF) parameters. For each switching region, a low complexity transform domain split VQ (TrSVQ) is designed. The overall rate-distortion (R/D) performance optimality of new switched quantizer is addressed in the Gaussian mixture model (GMM) based parametric framework. In the AbS approach, the reduction of quantization complexity is achieved through the use of nearest neighbor (NN) TrSVQs and splitting the transform domain vector into higher number of subvectors. Compared to the current LSF quantization methods, the new method is shown to provide competitive or better trade-off between R/D performance and complexity.

Fourier transform of the collagen triple-helical structure and its significance

The Fourier transforms of the collagen molecular structure have been calculated taking into consideration various side chain atoms, as well as the presence of bound water molecules. There is no significant change in the calculated intensity distribution on including the side chain atoms of non-imino-acid residues. Taking into account the presence of about two bound water molecules per tripeptide unit, the agreement with the observed x-ray pattern is slightly improved. Fourier transforms have also been calculated for the detailed molecular geometries proposed from other laboratories. It is found that there are no major differences between them, as compared to our structure, either in the positions of peak intensity or in the intensity distribution. Hence it is not possible to judge the relative merits of the various molecular geometries for the collagen triple helix from a comparison of the calculated transforms with the meagre data available from its x-ray fibre pattern. It is also concluded that the collagen molecular structure should be regarded as a somewhat flexible chain structure, capable of adapting itself to the requirements of the different side groups which occur in each local region.

Two Stage Transform Vector Quantization of LSFs for Wideband Speech Coding

We investigate the use of a two stage transform vector quantizer (TSTVQ) for coding of line spectral frequency (LSF) parameters in wideband speech coding. The first stage quantizer of TSTVQ, provides better matching of source distribution and the second stage quantizer provides additional coding gain through using an individual cluster specific decorrelating transform and variance normalization. Further coding gain is shown to be achieved by exploiting the slow time-varying nature of speech spectra and thus using inter-frame cluster continuity (ICC) property in the first stage of TSTVQ method. The proposed method saves 3-4 bits and reduces the computational complexity by 58-66%, compared to the traditional split vector quantizer (SVQ), but at the expense of 1.5-2.5 times of memory.

New light on the optical equivalence theorem and a new type of discrete diagonal coherent state representation

In many instances we find it advantageous to display a quantum optical density matrix as a generalized statistical ensemble of coherent wave fields. The weight functions involved in these constructions turn out to belong to a family of distributions, not always smooth functions. In this paper we investigate this question anew and show how it is related to the problem of expanding an arbitrary state in terms of an overcomplete subfamily of the overcomplete set of coherent states. This provides a relatively transparent derivation of the optical equivalence theorem. An interesting by-product is the discovery of a new class of discrete diagonal representations.

Application of Laplace transform technique to the solution of certain third-order non-linear systems

A number of papers have appeared on the application of operational methods and in particular the Laplace transform to problems concerning non-linear systems of one kind or other. This, however, has met with only partial success in solving a class of non-linear problems as each approach has some limitations and drawbacks. In this study the approach of Baycura has been extended to certain third-order non-linear systems subjected to non-periodic excitations, as this approximate method combines the advantages of engineering accuracy with ease of application to such problems. Under non-periodic excitations the method provides a procedure for estimating quickly the maximum response amplitude, which is important from the point of view of a designer. Limitations of such a procedure are brought out and the method is illustrated by an example taken from a physical situation.

Scattering theory and the discrete linear optimal control problem

This paper deals with the interpretation of the discrete-time optimal control problem as a scattering process in a discrete medium. We treat the discrete optimal linear regulator, constrained end-point and servo and tracking problems, providing a unified approach to these problems. This approach results in an easy derivation of the desired results as well as several new ones.

Contribution from unresolved discrete sources to the extragalactic gamma-ray background (EGRB)

The origin of the extragalactic gamma-ray background (EGRB) is still an open question, even nearly forty years after its discovery. The emission could originate either from truly diffuse processes or from unresolved point sources. Although the majority of the 271 point sources detected by EGRET (Energetic Gamma Ray Experiment Telescope) are unidentified, of the identified sources, blazars are the dominant candidates. Therefore, unresolved blazars may be considered the main contributor to the EGRB, and many studies have been carried out to understand their distribution, evolution and contribution to the EGRB. Considering that gamma-ray emission comes mostly from jets of blazars and that the jet emission decreases rapidly with increasing jet to line-of-sight angle, it is not surprising that EGRET was not able to detect many large inclination angle active galactic nuclei (AGNs). Though Fermi could only detect a few large inclination angle AGNs during the first three months of its survey, it is expected to detect many such sources in the near future. Since non-blazar AGNs are expected to have higher density as compared to blazars, these could also contribute significantly to the EGRB. In this paper, we discuss contributions from unresolved discrete sources including normal galaxies, starburst galaxies, blazars and off-axis AGNs to the EGRB.

A Joint Source-Channel Coding Scheme for Transmission of Correlated Discrete Sources over a Gaussian Multiple Access Channel

We consider the problem of transmission of correlated discrete alphabet sources over a Gaussian Multiple Access Channel (GMAC). A distributed bit-to-Gaussian mapping is proposed which yields jointly Gaussian codewords. This can guarantee lossless transmission or lossy transmission with given distortions, if possible. The technique can be extended to the system with side information at the encoders and decoder.

Holomorphic Sobolev spaces, Hermite and special Hermite semigroups and a Paley-Wiener theorem for the windowed Fourier transform

The images of Hermite and Laguerre-Sobolev spaces under the Hermite and special Hermite semigroups (respectively) are characterized. These are used to characterize the image of Schwartz class of rapidly decreasing functions f on R-n and C-n under these semigroups. The image of the space of tempered distributions is also considered and a Paley-Wiener theorem for the windowed (short-time) Fourier transform is proved.

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.

GMM based Bayesian approach to speech enhancement in signal transform domain

Considering a general linear model of signal degradation, by modeling the probability density function (PDF) of the clean signal using a Gaussian mixture model (GMM) and additive noise by a Gaussian PDF, we derive the minimum mean square error (MMSE) estimator. The derived MMSE estimator is non-linear and the linear MMSE estimator is shown to be a special case. For speech signal corrupted by independent additive noise, by modeling the joint PDF of time-domain speech samples of a speech frame using a GMM, we propose a speech enhancement method based on the derived MMSE estimator. We also show that the same estimator can be used for transform-domain speech enhancement.

Rendering stiffer walls: a hybrid haptic system using continuous and discrete time feedback

Instability in conventional haptic rendering destroys the perception of rigid objects in virtual environments. Inherent limitations in the conventional haptic loop restrict the maximum stiffness that can be rendered. In this paper we present a method to render virtual walls that are much stiffer than those achieved by conventional techniques. By removing the conventional digital haptic loop and replacing it with a part-continuous and part-discrete time hybrid haptic loop, we were able to render stiffer walls. The control loop is implemented as a combinational logic circuit on an field-programmable gate array. We compared the performance of the conventional haptic loop and our hybrid haptic loop on the same haptic device, and present mathematical analysis to show the limit of stability of our device. Our hybrid method removes the computer-intensive haptic loop from the CPU-this can free a significant amount of resources that can be used for other purposes such as graphical rendering and physics modeling. It is our hope that, in the future, similar designs will lead to a haptics processing unit (HPU).

Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.