A Coalition game model for spectrum pooling in wireless data access networks

We consider a setting in which several operators offer downlink wireless data access services in a certain geographical region. Each operator deploys several base stations or access points, and registers some subscribers. In such a situation, if operators pool their infrastructure, and permit the possibility of subscribers being served by any of the cooperating operators, then there can be overall better user satisfaction, and increased operator revenue. We use coalitional game theory to investigate such resource pooling and cooperation between operators.We use utility functions to model user satisfaction, and show that the resulting coalitional game has the property that if all operators cooperate (i.e., form a grand coalition) then there is an operating point that maximizes the sum utility over the operators while providing the operators revenues such that no subset of operators has an incentive to break away from the coalition. We investigate whether such operating points can result in utility unfairness between users of the various operators. We also study other revenue sharing concepts, namely, the nucleolus and the Shapely value. Such investigations throw light on criteria for operators to accept or reject subscribers, based on the service level agreements proposed by them. We also investigate the situation in which only certain subsets of operators may be willing to cooperate.

Nonlinear Model Predictive Spread Acceleration Guidance with Impact Angle Constraint for Stationary Targets

A new technique named as model predictive spread acceleration guidance (MPSAG) is proposed in this paper. It combines nonlinear model predictive control and spread acceleration guidance philosophies. This technique is then used to design a nonlinear suboptimal guidance law for a constant speed missile against stationary target with impact angle constraint. MPSAG technique can be applied to a class of nonlinear problems, which leads to a closed form solution of the lateral acceleration (latax) history update. Guidance command assumed is the lateral acceleration (latax), applied normal to the velocity vector. The new guidance law is validated by considering the nonlinear kinematics with both lag-free as well as first order autopilot delay. The simulation results show that the proposed technique is quite promising to come up with a nonlinear guidance law that leads to both very small miss distance as well as the desired impact angle.

Nonlinear Model Predictive Spread Acceleration Guidance with Impact Angle Constraint for Slow-moving Targets

A new technique named as model predictive spread acceleration guidance (MPSAG) is proposed in this paper. It combines nonlinear model predictive control and spread acceleration guidance philosophies. This technique is then used to design a nonlinear suboptimal guidance law for a constant speed missile against stationary target with impact angle constraint. MPSAG technique can be applied to a class of nonlinear problems, which leads to a closed form solution of the lateral acceleration (latax) history update. Guidance command assumed is the lateral acceleration (latax), applied normal to the velocity vector. The new guidance law is validated by considering the nonlinear kinematics with both lag-free as well as first order autopilot delay. The simulation results show that the proposed technique is quite promising to come up with a nonlinear guidance law that leads to both very small miss distance as well as the desired impact angle.

Microwave spectrum and structure of C(6)H(5)CCH center dot center dot center dot H(2)S complex

Rotational spectra of C(6)H(5)CCH center dot center dot center dot H(2)S, C(6)H(5)CCH center dot center dot center dot H(2)(34)S, C(6)H(5)CCH center dot center dot center dot HDS, C(6)H(5)CCH center dot center dot center dot D(2)S and C(6) H(5)CCD center dot center dot center dot H(2)S complexes have been observed using a pulsed nozzle Fourier transform microwave spectrometer. The observed spectrum is consistent with a structure in which hydrogen sulfide is located over the phenyl ring pi cloud and the distance between the centers of masses of the two monomers is 3.74 +/- 0.01 angstrom. In the complex, the H(2)S unit is shifted from the phenyl ring center towards the acetylene group. The vibrationally averaged structure has an effective Cs symmetry. Ab initio calculations were performed at MP2/aug-cc-pVDZ level of theory to locate the possible geometries of the complex. The calculations reveal the experimentally observed structure to be more stable than a coplanar arrangement of the monomers, which was observed for the C(6)H(5)CCH center dot center dot center dot H(2)O complex. Atoms in molecule theoretical analysis shows the presence of S-H center dot center dot center dot pi hydrogen bond. For the parent isotopologue, each transition frequency was found to split into two resulting from an interchange of the equivalent hydrogens of H(2)S unit in the complex. (C) 2011 Elsevier Inc. All rights reserved.

High-Rate Vector Quantization for Noisy Channels With Applications to Wideband Speech Spectrum Compression

This paper considers the high-rate performance of source coding for noisy discrete symmetric channels with random index assignment (IA). Accurate analytical models are developed to characterize the expected distortion performance of vector quantization (VQ) for a large class of distortion measures. It is shown that when the point density is continuous, the distortion can be approximated as the sum of the source quantization distortion and the channel-error induced distortion. Expressions are also derived for the continuous point density that minimizes the expected distortion. Next, for the case of mean squared error distortion, a more accurate analytical model for the distortion is derived by allowing the point density to have a singular component. The extent of the singularity is also characterized. These results provide analytical models for the expected distortion performance of both conventional VQ as well as for channel-optimized VQ. As a practical example, compression of the linear predictive coding parameters in the wideband speech spectrum is considered, with the log spectral distortion as performance metric. The theory is able to correctly predict the channel error rate that is permissible for operation at a particular level of distortion.

Nature and Properties of a Repulsive Fermi Gas in the Upper Branch of the Energy Spectrum

We generalize the Nozieres-Schmitt-Rink method to study the repulsive Fermi gas in the absence of molecule formation, i.e., in the so-called ``upper branch.'' We find that the system remains stable except close to resonance at sufficiently low temperatures. With increasing scattering length, the energy density of the system attains a maximum at a positive scattering length before resonance. This is shown to arise from Pauli blocking which causes the bound states of fermion pairs of different momenta to disappear at different scattering lengths. At the point of maximum energy, the compressibility of the system is substantially reduced, leading to a sizable uniform density core in a trapped gas. The change in spin susceptibility with increasing scattering length is moderate and does not indicate any magnetic instability. These features should also manifest in Fermi gases with unequal masses and/or spin populations.

Performance analysis for geometrical attack on digital image watermarking

We present a technique for irreversible watermarking approach robust to affine transform attacks in camera, biomedical and satellite images stored in the form of monochrome bitmap images. The watermarking approach is based on image normalisation in which both watermark embedding and extraction are carried out with respect to an image normalised to meet a set of predefined moment criteria. The normalisation procedure is invariant to affine transform attacks. The result of watermarking scheme is suitable for public watermarking applications, where the original image is not available for watermark extraction. Here, direct-sequence code division multiple access approach is used to embed multibit text information in DCT and DWT transform domains. The proposed watermarking schemes are robust against various types of attacks such as Gaussian noise, shearing, scaling, rotation, flipping, affine transform, signal processing and JPEG compression. Performance analysis results are measured using image processing metrics.

The spectral index-luminosity relationship for steep-spectrum cores in extra-galactic radio-sources

The spectral index-luminosity relationship for steep-spectrum cores in galaxies and quasars has been investigated, and it is found that the sample of galaxies supports earlier suggestions of a strong correlation, while there is weak evidence for a similar relationship for the quasars. It is shown that a strong spectral index-luminosity correlation can be used to set an upper limit to the velocities of the radio-emitting material which is expelled from the nucleus in the form of collimated beams or jets having relativistic bulk velocities. The data on cores in galaxies indicate that the Lorentz factors of the radiating material are less than about 2.

An invariant subspace-based approach to the random eigenvalue problem of systems with clustered spectrum

The repeated or closely spaced eigenvalues and corresponding eigenvectors of a matrix are usually very sensitive to a perturbation of the matrix, which makes capturing the behavior of these eigenpairs very difficult. Similar difficulty is encountered in solving the random eigenvalue problem when a matrix with random elements has a set of clustered eigenvalues in its mean. In addition, the methods to solve the random eigenvalue problem often differ in characterizing the problem, which leads to different interpretations of the solution. Thus, the solutions obtained from different methods become mathematically incomparable. These two issues, the difficulty of solving and the non-unique characterization, are addressed here. A different approach is used where instead of tracking a few individual eigenpairs, the corresponding invariant subspace is tracked. The spectral stochastic finite element method is used for analysis, where the polynomial chaos expansion is used to represent the random eigenvalues and eigenvectors. However, the main concept of tracking the invariant subspace remains mostly independent of any such representation. The approach is successfully implemented in response prediction of a system with repeated natural frequencies. It is found that tracking only an invariant subspace could be sufficient to build a modal-based reduced-order model of the system. Copyright (C) 2012 John Wiley & Sons, Ltd.

Chiral discrimination and the measurement of enantiomeric excess from a severely overcrowded NMR spectrum

NMR spectroscopic chiral visualization, unambiguous assignment of peaks pertaining to R and S enantiomers and the subsequent measurement of enantiomeric composition demands a highly resolved spectrum. The method fails when the spectrum is severely overcrowded or highly complex, thereby hampering the determination of enantiomeric excess. In order to circumvent such problems we propose the utility of pure shift spectrum obtained by resolving the chemical shift and coupling information in two orthogonal dimensions. The skew projected spectrum yields singlet's at the respective chemical shift positions, permitting the unravelling of the superimposed spectral transitions for each enantiomer and measurement of enantiomeric composition. (C) 2012 Elsevier B. V. All rights reserved.

Error exponent analysis of energy-based bayesian spectrum sensing under fading channels

This paper analyzes the error exponents in Bayesian decentralized spectrum sensing, i.e., the detection of occupancy of the primary spectrum by a cognitive radio, with probability of error as the performance metric. At the individual sensors, the error exponents of a Central Limit Theorem (CLT) based detection scheme are analyzed. At the fusion center, a K-out-of-N rule is employed to arrive at the overall decision. It is shown that, in the presence of fading, for a fixed number of sensors, the error exponents with respect to the number of observations at both the individual sensors as well as at the fusion center are zero. This motivates the development of the error exponent with a certain probability as a novel metric that can be used to compare different detection schemes in the presence of fading. The metric is useful, for example, in answering the question of whether to sense for a pilot tone in a narrow band (and suffer Rayleigh fading) or to sense the entire wide-band signal (and suffer log-normal shadowing), in terms of the error exponent performance. The error exponents with a certain probability at both the individual sensors and at the fusion center are derived, with both Rayleigh as well as log-normal shadow fading. Numerical results are used to illustrate and provide a visual feel for the theoretical expressions obtained.

Cooperative distributed sequential spectrum sensing

We consider cooperative spectrum sensing for cognitive radios. We develop an energy efficient detector with low detection delay using sequential hypothesis testing. Sequential Probability Ratio Test (SPRT) is used at both the local nodes and the fusion center. We also analyse the performance of this algorithm and compare with the simulations. Modelling uncertainties in the distribution parameters are considered. Slow fading with and without perfect channel state information at the cognitive radios is taken into account.

A novel algorithm for cooperative distributed sequential spectrum sensing in Cognitive Radio

This paper considers cooperative spectrum sensing in Cognitive Radios. In our previous work we have developed DualSPRT, a distributed algorithm for cooperative spectrum sensing using Sequential Probability Ratio Test (SPRT) at the Cognitive Radios as well as at the fusion center. This algorithm works well, but is not optimal. In this paper we propose an improved algorithm- SPRT-CSPRT, which is motivated from Cumulative Sum Procedures (CUSUM). We analyse it theoretically. We also modify this algorithm to handle uncertainties in SNR's and fading.