A three-position spectral line survey of sagittarius B2 between 218 and 263 GHz. II. Data analysis

We present an analysis of the data from our Swedish-ESO Submillimetre Telescope molecular line survey in the 1.3 mm band of the N, M, and NW positions in the Sgr B2 molecular cloud. The line emissions from 42 molecular species, and some of their isotopomers, were analyzed assuming a single temperature and a homogeneous source. In cases where a source size much smaller than the antenna beam (23

Retrodirective Antenna Spatial Data Protection

In this letter, we show how a 2.4-GHz retrodirective array operating in a multipath rich environment can be utilized in order to spatially encrypt digital data. For the first time, we give experimental evidence that digital data that has no mathematical encryption applied to it can be successfully recovered only when it is detected with a receiver that is polarization-matched to that of a reference continuous-wave (CW) pilot tone signal. In addition, we show that successful detection with low bit error rate (BER) will only occur within a highly constrained spatial region colocated close to the position of the CW reference signal. These effects mean that the signal cannot be intercepted and its modulated data recovered at locations other than the constrained spatial region around the position from which the retrodirective communication was initiated.

Sampled-data gain scheduling of continuous LTV plants

This paper discusses the design of gain- scheduled sampled-data controllers for continuous-time polytopic linear parameter-varying systems. The scheduling variables are assumed to available only at the sampling instants, and a bound on the time-variation of the scheduling parameters is also assumed to be known. The resultant gain-scheduled controllers improve the maximum achieveable delay bound over previous constant-gain ones in the literature.

Cost function adaptation: a stochastic gradient algorithm for data echo cancellation

A family of stochastic gradient algorithms and their behaviour in the data echo cancellation work platform are presented. The cost function adaptation algorithms use an error exponent update strategy based on an absolute error mapping, which is updated at every iteration. The quadratic and nonquadratic cost functions are special cases of the new family. Several possible realisations are introduced using these approaches. The noisy error problem is discussed and the digital recursive filter estimator is proposed. The simulation outcomes confirm the effectiveness of the proposed family of algorithms.

Adaptive data echo cancellation using cost function adaptation

For a digital echo canceller it is desirable to reduce the adaptation time, during which the transmission of useful data is not possible. LMS is a non-optimal algorithm in this case as the signals involved are statistically non-Gaussian. Walach and Widrow (IEEE Trans. Inform. Theory 30 (2) (March 1984) 275-283) investigated the use of a power of 4, while other research established algorithms with arbitrary integer (Pei and Tseng, IEEE J. Selected Areas Commun. 12(9)(December 1994) 1540-1547) or non-quadratic power (Shah and Cowan, IEE.Proc.-Vis. Image Signal Process. 142 (3) (June 1995) 187-191). This paper suggests that continuous and automatic, adaptation of the error exponent gives a more satisfactory result. The family of cost function adaptation (CFA) stochastic gradient algorithm proposed allows an increase in convergence rate and, an improvement of residual error. As special case the staircase CFA algorithm is first presented, then the smooth CFA is developed. Details of implementations are also discussed. Results of simulation are provided to show the properties of the proposed family of algorithms. (C) 2000 Elsevier Science B.V. All rights reserved.

The Y-procedure: How to extract the chemical transformation rate from reaction-diffusion data with no assumption on the kinetic model

The paper presents a new method to extract the chemical transformation rate from reaction–diffusion data with no assumption on the kinetic model (“kinetic model-free procedure”). It is a new non-steady-state kinetic characterization procedure for heterogeneous catalysts. The mathematical foundation of the Y-procedure is a Laplace-domain analysis of the two inert zones in a TZTR followed by transposition to the Fourier domain. When combined with time discretization and filtering the Y-procedure leads to an efficient practical method for reconstructing the concentration and reaction rate in the active zone. Using the Y-procedure the concentration and reaction rate of a non-steady state catalytic process can be determined without any pre-assumption regarding the type of kinetic dependence. The Y-procedure is the basis for advanced software for non-steady state kinetic data interpretation. The Y-procedure can be used to relate changes in the catalytic reaction rate and kinetic parameters to changes in the surface composition (storage) of a catalyst.