Design and performance analysis of various one dimensional codes using different data formats for OCDMA system

In this paper, the design, implementation and performance analysis of various one dimensional codes in an OCDMA system for different data formats is presented. A number of different codes are used with optical CDMA to improve its error performance. Here, three such codes, optical orthogonal codes (OOC), Walsh Hadamard codes and zero cross-correlation (ZCC) codes have been compared using different data formats, NRZ raised cosine, NRZ rectangular, RZ raised cosine and RZ rectangular. It is found that NRZ raised cosine has the best system performance for all the codes used. After that, the three codes have been compared in terms of the BER, eye diagrams and received optical power using NRZ raised cosine modulation format. It is analyzed that ZCC codes have zero cross-correlation property. The simulation results revealed that ZCC codes can provide a better BER compared to the OOC and Walsh Hadamard codes and it is most suitable to be employed in the OCDMA systems.     

One-dimensional three-body problem via symbolic dynamics

Symbolic dynamics is applied to the one-dimensional three-body problem with equal masses. The sequence of binary collisions along an orbit is expressed as a symbol sequence of two symbols. Based on the time reversibility of the problem and numerical data, inadmissible (i.e., unrealizable) sequences of collisions are systematically found. A graph for the transitions among various regions in the Poincare section is constructed. This graph is used to find an infinite number of periodic sequences, which implies an infinity of periodic orbits other than those accompanying a simple periodic orbit called the Schubart orbit. Finally, under reasonable assumptions on inadmissible sequences, we prove that the set of admissible symbol sequences forms a Cantor set. (c) 2000 American Institute of Physics.     

基于Eclipse图形建模框架的图形化脉冲序列设计软件的实现

采用Eclipse图形建模框架（Graphical Modeling Framework,GMF）技术构建了一个图形化磁共振脉冲序列设计软件．软件具备所见即所得的特点,用户使用拖放方式所画出的脉冲序列与教科书和参考文献上的脉冲序列几乎一样．软件支持核磁共振（Nuclear Magnetic Resonance,NMR）波谱和磁共振成像（Magnetic Resonance Imaging,MRI）的脉冲序列设计,同时提供实验参数管理模块,实现脉冲序列基础上的NMR实验设计和执行预览．得益于GMF完善的模型-视图-控制器模式和强大的代码生成能力,软件开发周期大幅度缩短、扩展能力大幅度提高．     

Multi-Task Offloading Based on Optimal Stopping Theory in Edge Computing Empowered Internet of Vehicles

Vehicular edge computing is a new computing paradigm. By introducing edge computing into the Internet of Vehicles (IoV), service providers are able to serve users with low-latency services, as edge computing deploys resources (e.g., computation, storage, and bandwidth) at the side close to the IoV users. When mobile nodes are moving and generating structured tasks, they can connect with the roadside units (RSUs) and then choose a proper time and several suitable Mobile Edge Computing (MEC) servers to offload the tasks. However, how to offload tasks in sequence efficiently is challenging. In response to this problem, in this paper, we propose a time-optimized, multi-task-offloading model adopting the principles of Optimal Stopping Theory (OST) with the objective of maximizing the probability of offloading to the optimal servers. When the server utilization is close to uniformly distributed, we propose another OST-based model with the objective of minimizing the total offloading delay. The proposed models are experimentally compared and evaluated with related OST models using simulated data sets and real data sets, and sensitivity analysis is performed. The results show that the proposed offloading models can be efficiently implemented in the mobile nodes and significantly reduce the total expected processing time of the tasks.     

Chaotic direct sequence spread spectrum for secure underwater acoustic communication

Direct sequence spread spectrum (DSSS) has been widely used in underwater acoustic (UWA) communications. In DSSS communications, spreading sequence’s period and chip rate are important characteristic parameters. However, these characteristic parameters may be detected in hostile environments due to the periodic nature of spreading sequence and their well-known construction process. In this paper, a novel chaotic direct sequence spread spectrum (CD3S) method is proposed for secure UWA communications. In the CD3S communications, chaotic sequences acting as encryption keys are used to encrypt the phases of transmitted signals. Consequently, the application of chaotic sequences disguises these obvious characteristic parameters of spread spectrum (SS) signals. It is difficult for unauthorized users to detect or intercept CD3S signal without knowledge of corresponding chaotic sequences. Hence, CD3S signal has a lower probability of detection and interception. Moreover, CD3S can achieve similar bit error ratio (BER) performance compared with DSSS in actual UWA communications. Also, the receivers that are suitable for DSSS communication can also be applied to CD3S communication. Numerical simulations demonstrate its excellent performance and potential applications in confidential UWA communications.     

Neural circuitry for recognizing interspike interval sequences

Sensory systems present environmental information to central nervous system as sequences of action potentials or spikes. How do animals recognize these sequences carrying information about their world? We present a biologically inspired neural circuit designed to enable spike pattern recognition. This circuit is capable of training itself on a given interspike interval (ISI) sequence and is then able to respond to presentations of the same sequence. The essential ingredients of the recognition circuit are (a) a tunable time delay circuit, (b) a spike selection unit, and (c) a tuning mechanism using spike timing dependent plasticity of inhibitory synapses. We have investigated this circuit using Hodgkin-Huxley neuron models connected by realistic excitatory and inhibitory synapses. It is robust in the presence of noise represented as jitter in the spike times of the ISI sequence.     

Analyses of constraints on high speed optical code division multiplexing access (OCDMA) link parameters due to fiber optic chromatic dispersion

In direct sequence-optical code division multiplexing access (DS-OCDMA) system networks, data rate and data spreading technique involved in such systems require a high chip rate. Transmission link in these systems is significantly affected by the fiber chromatic dispersion. In this study, we have developed and employed a simple model to estimate the G652 fiber dispersion effects. OCDMA technique has been employed to investigate fiber chromatic dispersion effects on multiple access interference (MAI). We have found that, at a short optical fiber length, the optical fiber dispersion has a significant impact on the high data rate transmission systems (higher than 750 Mbit/s). The performance and optimization of optical orthogonal code (OOC) in the OCDMA system is reported. We have demonstrated that, for a high data rate, even if dispersion compensated devices are not deployed, the BER can be significantly improved when the OOC desired length is selected. We have shown that when compensation dispersion devices are not deployed in the system, there is a trade off between the limited dispersion effects and the MAI.     

一种跳频扩时码的构造及性能分析

以一维二次同余码(QCC)作为扩时模式，以光正交码(OOC)和QCC码作为频域跳频模式，通过时域和频域的组合，构造了适用于光码分多址(OCDMA)系统的QCC/QCC和QCC/OOC 2种跳频扩时码，并对码的容量及其相关性进行了分析。与一维QCC码相比，QCC/QCC跳频扩时码的容量扩大了p 1倍（p为码重），相关性得到改善，并且码字异相自相关限λa=1，互相关限λc=2；QCC/OOC跳频扩时码具有更大的码容量和更好的相关性，码字异相自相关限λa=0，所有码字按一定规律可分成p 1组（p为码重），每组内码字的互相关限λa=1，不同组间码字的互相关限λa=2。所得结果为光码分多址系统中跳频扩时码的构造提供了一种新的方法。     

Optimizing tissue contrast in magnetic resonance imaging

Magnetic resonance imaging demands that tissue contrast and signal-to-noise advantages be sought in each component of the imaging system. One component of magnetic resonance imaging in which contrast and signal-to-noise ratios are easily manipulated is in the choice of pulse sequences and interpulse delay times. This article provides a general method for determining the best choices of interpulse delay times in pulse sequences and applies that method to saturation recovery, inversion recovery, and spin-echo sequences. Saturation recovery and inversion recovery sequences with rephasing pulses, and tissues with unequal hydrogen densities are considered. Optimization of pulse sequences is carried out for the two distinct cases of (a) a fixed number of sequence repetitions and (b) a fixed total imaging time. Analytic expressions are derived or approximate expressions are provided for the interpulse delay times that optimize contrast-to-noise ratios in each pulse sequence. The acceptable range of interpulse delay times to obtain reasonable contrast using each pulse sequence is discussed.     

An optimized multislice acquisition sequence for the inversion-recovery MR imaging

An optimized multislice data acquisition scheme for inversion-recovery MR imaging is proposed and experimental results are presented. In this new scheme, instead of forming a set of multislice inversion-recovery sequences in series for a given phase encoding step, 180° inversion pulses corresponding to different slices are interwoven with the spin echo data acquisition sequence in an optimal way depending on the desired inversion-recovery time. For example, between the 180° inversion RF pulse and the spin-echo imaging sequence, a number of imaging and inversion sequences are inserted with different slice combinations, i.e., long inversion-recovery time is effectively utilized for the other slice pre-inversion and data acquisition. With the optimized sequence, imaging time has been reduced by as much as a factor of four compared with the existing methods.     

Slicing and Dicing the Genome: A Statistical Physics Approach to Population Genetics

The inference of past demographic parameters from current genetic polymorphism is a fundamental problem in population genetics. The standard techniques utilize a reconstruction of the gene-genealogy, a cumbersome process that may be applied only to small numbers of sequences. We present a method that compares the total number of haplotypes (distinct sequences) with the model prediction. By chopping the DNA sequence into pieces we condense the immense information hidden in sequence space into a function for the number of haplotypes versus subsequence size. The details of this curve are robust to statistical fluctuations and are seen to reflect the process parameters. This procedure allows for a clear visualization of the quality of the fit and, crucially, the numerical complexity grows only linearly with the number of sequences. Our procedure is tested against both simulated data as well as empirical mtDNA data from China and provides excellent fits in both cases.     

Heteronuclear decoupling by optimal tracking

The problem to design efficient heteronuclear decoupling sequences is studied using optimal control methods. A generalized version of the gradient ascent engineering (GRAPE) algorithm is presented that makes it possible to design complex non-periodic decoupling sequences which are characterized by tens of thousands of pulse sequence parameters. In contrast to conventional approaches based on average Hamiltonian theory, the concept of optimal tracking is used: a pulse sequence is designed that steers the evolution of an ensemble of spin systems such that at a series of time points, a specified trajectory of the density operator is tracked as closely as possible. The approach is demonstrated for the case of low-power heteronuclear decoupling in the liquid state for in vivo applications. Compared to conventional sequences, significant gains in decoupling efficiency and robustness with respect to offset and inhomogeneity of the radio-frequency field were found in simulations and experiments.     

An efficient MAI cancellation technique in Optical CDMA

Optical code division multiple access (OCDMA) is a promising operational system for future backhaul optical networks especially for switching and optical signal multiplexing. However, OCDMA operation is restricted by multiple access interference (MAI) due to the asynchronous nature of transmission. In this study, we discuss an efficient MAI technique for OCDMA systems that depends not only on using hybrid frequency shift keying (FSK) modulation but also on employing the double padded modified prime code (DPMPC) as a signature sequence. MAI cancellation is performed by subtracting a reference signal from the received signal of the desired user. The simulation results show that the performance of the FSK-OCDMA technique is superior to the performance of the PPM-OCDMA technique. Furthermore, the obtained results illustrate that the FSK-OCDMA technique is able to accommodate a large number of simultaneous active users with low error-rate.     

Molecular modelling in structural biology

Molecular modelling is a powerful methodology for analysing the three dimensional structure of biological macromolecules. There are many ways in which molecular modelling methods have been used to address problems in structural biology. It is not widely appreciated that modelling methods are often an integral component of structure determination by NMR spectroscopy and X-ray crystallography. In this review we consider some of the numerous ways in which modelling can be used to interpret and rationalise experimental data and in constructing hypotheses that can be tested by experiment. Genome sequencing projects are producing a vast wealth of data describing the protein coding regions of the genome under study. However, only a minority of the protein sequences thus identified will have a clear sequence homology to a known protein. In such cases valuable three-dimensional models of the protein coding sequence can be constructed by homology modelling methods. Threading methods, which used specialised schemes to relate protein sequences to a library of known structures, have been shown to be able to identify the likely protein fold even in cases where there is no clear sequence homology. The number of protein sequences that cannot be assigned to a structural class by homology or threading methods, simply because they belong to a previously unidentified protein folding class, will decrease in the future as collaborative efforts in systematic structure determination begin to develop. For this reason, modelling methods are likely to become increasingly useful in the near future. The role of the blind prediction contests, such as the Critical Assessment of techniques for protein Structure Prediction (CASP), will be briefly discussed. Methods for modelling protein-ligand and protein-protein complexes are also described and examples of their applications given.     

Failure Impact,Availability and Cost Analysis of PONs Based on a Network Geometric Model

Passive Optical Networks(PONs)are considered as the preferred solution for broadband fibre-based access networks.This is because PONs present low cost deployment,low energy consumption and also meet high bandwidth demands from end users.In addition,end users expect a high availability for access networks,while operators are more concerned about reducing the failure impact(number of clients affected by failures).Moreover,operators are also interested in reducing the cost of the access network.This paper provides a deep insight into the consequences that the physical topology and design decisions cause on the availability,the failure impact and the cost of a PON.In order to do that,the physical layout of the PON deployment area is approximated by a network geometric model.A PON deployed according to the geometric model is then assessed in terms of failure impact,availability and cost.This way,the effects of different design decisions and the physical layout on these three parameters are evaluated.In addition,the tradeoffs between availability,failure impact and cost caused by planning decisions and the physical topology are identified and pinpointed.     

Coarse-graining protein energetics in sequence variables

We show that cluster expansions (CE), previously used to model solid-state materials with binary or ternary configurational disorder, can be extended to the protein design problem. We present a generalized CE framework, in which properties such as energy can be unambiguously expanded in the amino-acid sequence space. The CE coarse grains over nonsequence degrees of freedom (e.g., side-chain conformations) and thereby simplifies the problem of designing proteins, or predicting the compatibility of a sequence with a given structure, by many orders of magnitude. The CE is physically transparent, and can be evaluated through linear regression on the energies of training sequences. We show, as example, that good prediction accuracy is obtained with up to pairwise interactions for a coiled-coil backbone, and that triplet interactions are important in the energetics of a more globular zinc-finger backbone.     

New generalized zero forcing beamforming for serving more users in energy-harvesting enabled networks

This paper considers a multi-user wireless communication network supported by a multiple-antenna base station (BS), where the users who are located sufficiently close to the BS employ wireless energy harvesting (EH) to replenish their energy needs. The objective of this work is to design an efficient beamforming to maximize the minimum throughput among all the information users (IUs), subject to EH constraints. In this regard, transmit time-switching approach is employed, where energy and information are transmitted over different fractions of a time-slot. To achieve efficient EH, a conjugate beamforming (matched filtering) is applied. To design efficient information beamforming for max–min throughput optimization, conventional zero-forcing (ZF) beamforming can be adopted, however, it will not suppress multi-user interference if the number of users is greater than the number of antennas at the BS. To this end, different from the existing works which employ regularized zero-forcing (RZF) beamforming, this work proposes a new generalized zero-forcing (GZF) beamforming, which promises better max–min throughput compared to that achieved by the RZF beamforming. A new path-following algorithm is developed to achieve max–min throughput optimization by GZF beamforming, which is based on a simple convex quadratic program over each iteration.     

Interfacial debonding and slipping of carbon fiber-reinforced ceramic-matrix composites under two-stage cyclic loading

In this paper, the interface debonding and frictional slipping of carbon fiber-reinforced ceramic-matrix composites (CMCs) under two-stage cyclic fatigue loading have been investigated using micromechanics approach. Under cyclic fatigue loading, the fiber/matrix interface shear stress degrades with increasing cycle number due to interface wear. The synergistic effect of interface wear and fatigue loading sequence on interface debonding and frictional slipping has been analyzed. Based on the fatigue damage mechanism of fiber slipping relative to matrix, in the interface debonded region, upon unloading and subsequent reloading, the interface debonded length and interface slip lengths, i.e. interface counter-slip length and interface new-slip length, are determined using the fracture mechanics approach. The relationships between interface debonding, interface slipping, interface wear, cycle number, and different loading sequences are determined. There are two types of fatigue loading sequences considered, i.e. (1) cyclic loading under low peak stress for N₁ cycles, and then high peak stress; and (2) cyclic loading under high peak stress for N₁ cycles, and then low peak stress. The effects of peak stress level, interface wear, cycle number, and loading sequence on interface debonding and frictional slipping of fiber-reinforced CMCs have been analyzed. The fatigue hysteresis loops of cross-ply carbon fiber-reinforced silicon carbide composite corresponding to different cycle number under two-stage cyclic fatigue loading have been predicted.     

一种混沌伪随机序列复杂度分析法

分析了已有的序列线性复杂度分析方法，提出了用近似熵算法计算混沌运动的测度熵，作为衡量混沌伪随机序列复杂度的标准.理论研究表明，利用较短的观察序列，该方法能够准确地反映混沌系统和混沌伪随机序列复杂度的大小，可以作为判断利用混沌系统产生的伪随机序列的复杂度准则.实验结果表明该方法的有效性和理论结果的正确性. 关键词： 混沌 伪随机序列 熵