Homogenization of periodic structures via Bloch decomposition

In this paper, the classical problem of homogenization of elliptic operators in arbitrary domains with periodically oscillating coefficients is considered. Using Bloch wave decomposition, a new proof of convergence is furnished. It sheds new light and offers an alternate way to view the classical results. In a natural way, this method leads us to work in the Fourier space and thus in a framework dual to the one used by L. Tartar [Problemes d'Homogeneisation dans les Equations aux: Derivees Partielles, Cours Peccot au College de Prance, 1977] in his method of homogenization. Further, this technique offers a nontraditional way of calculating the homogenized coefficients which is easy to implement in the computer.

Maintaining dynamic sequences under equality tests in polylogarithmic time

We present a randomized and a deterministic data structure for maintaining a dynamic family of sequences under equality tests of pairs of sequences and creations of new sequences by joining or splitting existing sequences. Both data structures support equality tests in O(1) time. The randomized version supports new sequence creations in O(log(2) n) expected time where n is the length of the sequence created. The deterministic solution supports sequence creations in O(log n (log m log* m + log n)) time for the mth operation.

Spin state and exchange in the quasi-one-dimensional antiferromagnet KFeS2

We report the optical spectra and single crystal magnetic susceptibility of the one-dimensional antiferromagnet KFeS2. Measurements have been carried out to ascertain the spin state of Fe3+ and the nature of the magnetic interactions in this compound. The optical spectra and magnetic susceptibility could be consistently interpreted using a S = 1/2 spin ground state for the Fe3+ ion. The features in the optical spectra have been assigned to transitions within the d-electron manifold of the Fe3+ ion, and analysed in the strong field limit of the ligand field theory. The high temperature isotropic magnetic susceptibility is typical of a low-dimensional system and exhibits a broad maximum at similar to 565 K. The susceptibility shows a well defined transition to a three dimensionally ordered antiferromagnetic state at T-N = 250 K. The intra and interchain exchange constants, J and J', have been evaluated from the experimental susceptibilities using the relationship between these quantities, and chi(max), T-max, and T-N for a spin 1/2 one-dimensional chain. The values are J = -440.71 K, and J' = 53.94 K. Using these values of J and J', the susceptibility of a spin 1/2 Heisenberg chain was calculated. A non-interacting spin wave model was used below T-N. The susceptibility in the paramagnetic region was calculated from the theoretical curves for an infinite S = 1/2 chain. The calculated susceptibility compares well with the experimental data of KFeS2. Further support for a one-dimensional spin 1/2 model comes from the fact that the calculated perpendicular susceptibility at 0K (2.75 x 10(-4) emu/mol) evaluated considering the zero point reduction in magnetization from spin wave theory is close to the projected value (2.7 x 10(-4) emu/mol) obtained from the experimental data.

Triply-periodic balance surfaces

The list of possible G-H symmetries for triply-periodic balance surfaces, given by Koch and Fischer, is studied with a view to finding new types. It is found that balance surfaces exist for all the cases that were labelled as undecided in the work of Koch and Fischer. For some of these, new minimal surfaces have been found, with the aid of Brakke's 'Surface Evolver'. (C) 1997 Elsevier Science B.V.

Sex-specific organisation of middle repetitive DNA sequences in the mealybug Planococcus lilacinus

Differential organisation of homologous chromosomes is related to both sex determination and genomic imprinting in coccid insects, the mealybugs. We report here the identification of two middle repetitive sequences that are differentially organised between the two sexes and also within the same diploid nucleus. These two sequences form a part of the male-specific nuclease-resistant chromatin (NRC) fraction of a mealybug Planococcus lilacinus. To understand the phenomenon of differential organisation we have analysed the components of NRC by cloning the DNA sequences present, deciphering their primary sequence, nucleosomal organisation, genomic distribution and cytological localisation, Our observations suggest that the middle repetitive sequences within NRC are functionally significant and we discuss their probable involvement in male-specific chromatin organisation.

Quasi-Orthogonal Design and Performance Analysis of Amplify-And-Forward Relay Networks with Multiple-Antennas

This paper is on the design and performance analysis of practical distributed space-time codes for wireless relay networks with multiple antennas terminals. The amplify-andforward scheme is used in a way that each relay transmits a scaled version of the linear combination of the received symbols. We propose distributed generalized quasi-orthogonal space-time codes which are distributed among the source antennas and relays, and valid for any number of relays. Assuming M-PSK and M-QAM signals, we derive a formula for the symbol error probability of the investigated scheme over Rayleigh fading channels. For sufficiently large SNR, this paper derives closed-form average SER expression. The simplicity of the asymptotic results provides valuable insights into the performance of cooperative networks and suggests means of optimizing them. Our analytical results have been confirmed by simulation results, using full-rate full-diversity distributed codes.

A fast quasi-Newton method for semi-supervised SVM

Due to its wide applicability, semi-supervised learning is an attractive method for using unlabeled data in classification. In this work, we present a semi-supervised support vector classifier that is designed using quasi-Newton method for nonsmooth convex functions. The proposed algorithm is suitable in dealing with very large number of examples and features. Numerical experiments on various benchmark datasets showed that the proposed algorithm is fast and gives improved generalization performance over the existing methods. Further, a non-linear semi-supervised SVM has been proposed based on a multiple label switching scheme. This non-linear semi-supervised SVM is found to converge faster and it is found to improve generalization performance on several benchmark datasets. (C) 2010 Elsevier Ltd. All rights reserved.

Low correlation interleaved QAM sequences

A low correlation interleaved QAM sequence family is presented here. In a CDMA setting, these sequences have the ability to transport a large amount of data as well as enable variable-rate signaling on the reverse link. The new interleaved selected family INQ has period N, normalized maximum correlation parameter thetasmacrmax bounded above by lsim a radicN, where a ranges from 1.17 in the 16-QAM case to 1.99 for large M2-QAM, where M = 2m, m ges 2. Each user is enabled to transfer m + 1 bits of data per period of the spreading sequence. These constructions have the lowest known value of maximum correlation of any sequence family with the same alphabet.

Pruned Universal Symbol Sequences for LZW based Language identification

We present a improved language modeling technique for Lempel-Ziv-Welch (LZW) based LID scheme. The previous approach to LID using LZW algorithm prepares the language pattern table using LZW algorithm. Because of the sequential nature of the LZW algorithm, several language specific patterns of the language were missing in the pattern table. To overcome this, we build a universal pattern table, which contains all patterns of different length. For each language it's corresponding language specific pattern table is constructed by retaining the patterns of the universal table whose frequency of appearance in the training data is above the threshold.This approach reduces the classification score (Compression Ratio [LZW-CR] or the weighted discriminant score[LZW-WDS]) for non native languages and increases the LID performance considerably.

Sequences for Phase-Encoded Optical CDMA

In phase-encoded optical CDMA (OCDMA) spreading is achieved by encoding the phase of signal spectrum. Here, a mathematical model for the output signal of a phase-encoded OCDMA system is first derived. This is shown to lead to a performance metric for the design of spreading sequences for asynchronous transmission. Generalized bent functions are used to construct a family of efficient phase-encoding sequences. It is shown how M-ary modulation of these spreading sequences is possible. The problem of designing efficient phaseencoded sequences is then related to the problem of minimizing PMEPR (peak-to-mean envelope power ratio) in an OFDM communication system.

Optimality of orthogonal sequences with multi-dimensional signaling

The sum capacity on a symbol-synchronous CDMA system having processing gain N and supporting K power constrained users is achieved by employing any set of N orthogonal sequences if a few users are allowed to signal along multiple dimensions. Analogously, the minimum received power (energy-per-chip) on the symbolsynchronous CDMA system supporting K users that demand specified data rates is attained by employing any set of N orthogonal sequences. At most (N - 1) users need to be split and if there are no oversized users, these split users need to signal only in two dimensions each. These results show that sum capacity or minimum sum power can be achieved with minimal downlink signaling.

Spreading Sequences for Asynchronous Spectrally Phase Encoded Optical CDMA

In phase encoding optical CDMA (OCDMA) the spreading is achieved by encoding the phase of signal spectrum. In this paper we first derive a mathematical model for the output of phase encoding OCDMA systems. Based on this model we introduce a metric to design spreading sequences for asynchronous transmission. Then we connect the phase encoding sequence design problem to OFDM PMEPR (peak to mean envelope power ratio) problem. Using this connection we conclude that designing sequences with good properties for samples of timing delay guarantees that the same sequence to be good for all timing delays. Finally using generalized bent function we manage to construct a family of sequences which are good for asynchronous phase encoding OCDMA systems and using these sequences we introduce an M-ary modulation scheme for phase encoding OCDMA