Performance analysis of slotted fiber-optic code-division multiple-access (CDMA) packet networks

This paper examines code-division multiple-access (CDMA) techniques used in slotted fiber-optic packet networks. Since the inherent properties and signal processing of the conventional communication channels are different from those of the fiber-optic channels, new code sequences must be constructed for fiber-optic applications. The goal of our research is to analyze the performance of fiber-optic CDMA packet networks using code sequences with given orthogonality properties. © 1997 IEEE.published_or_final_versio

Testing for double threshold autoregressive conditional heteroscedastic model

The testing problem for the hypothesis of linearity against the double threshold autoregressive conditional heteroscedastic model is addressed. The, problem is nonstandard as the threshold parameter is a nuisance parameter which is absent under the null hypothesis. We will show that the asymptotic null distribution of the Lagrange-multiplier test statistic is a functional of a zero-mean Gaussian process. In some cases, we give the upper percentage points of the test statistic. The performance of the test statistic is illustrated by extensive simulation experiments and an example.published_or_final_versio

Performance analysis of unslotted fiber-optic code-division multiple-access (CDMA) packet networks

This paper examines code-division multiple-access (CDMA) techniques used in unslotted fiber-optic packet networks. Since the inherent properties and signal processing of the conventional communication channels are different from those of the fiber-optic channels, new code sequences must be constructed for fiber-optic applications. In unslotted systems, the exact solution is very difficult to obtain. Therefore, two approximation methods are presented to analyze the performance of such systems. Simulation is performed to verify the accuracy of the results.published_or_final_versio

Subcellular partitioning of MRP RNA assessed by ultrastructural and biochemical analysis.

A small RNA encoded within the nucleus is an essential subunit of a RNA processing endonuclease (RNase MRP) hypothesized to generate primers for mitochondrial DNA replication from the heavy strand origin of replication. Controversy has arisen, however, concerning the authenticity of an intramitochondrial pool of MRP RNA, and has called into question the existence of pathways for nucleo-mitochondrial transport of nucleic acids in animal cells. In an effort to resolve this controversy, we combined ultrastructural in situ hybridization and biochemical techniques to assess the subcellular partitioning of MRP RNA. Cryosections of mouse cardiomyocytes were hybridized with biotin-labeled RNA probes complementary to different regions of MRP RNA and varying in length from 115 to 230 nucleotides, followed by immunogold labeling. In addition, we transfected mouse C2C12 myogenic cells with constructs bearing mutated forms of the mouse MRP RNA gene and compared the relative abundance of the resulting transcripts to that of control RNAs within whole cell and mitochondrial fractions. In the former analysis we observed preferential localization of MRP RNA to nucleoli and mitochondria in comparison to the nucleoplasm and cytoplasm. In the latter series of studies we observed that wild-type MRP RNA partitions to the mitochondrial fraction by comparison to other RNA transcripts that are localized to the extramitochondrial cytoplasmic space (28S rRNA) or to the nucleoplasm (U1 snRNA). Deletions within 5' or 3' regions of the MRP RNA gene produced transcripts that remain competent for mitochondrial targeting. In contrast, deletion of the midportion of the coding region (nt 118 to 175) of the MRP RNA gene resulted in transcripts that fail to partition to the mitochondrial fraction. We conclude that an authentic intramitochondrial pool of MRP RNA is present in these actively respiring cells, and that specific structural determinants within the MRP RNA molecule permit it to be partitioned to mitochondria

Effect of alumina on photocatalytic activity of iron oxides for bisphenol A degradation

Author name used in this publication: F. B. LiAuthor name used in this publication: X. Z. LiAuthor name used in this publication: C. S. LiuAuthor name used in this publication: T. X. Liu2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Heterogeneous photodegradation of pentachlorophenol and iron cycling with goethite, hematite and oxalate under UVA illumination

2009-2010 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

A unified constitutive model for asymmetric tension and compression creep-ageing behaviour of naturally aged Al-Cu-Li alloy

A set of unified constitutive equations is presented that predict the asymmetric tension and compression creep behaviour and recently observed double primary creep of pre-stretched/naturally aged aluminium-cooper-lithium alloy AA2050-T34. The evolution of the primary micro- and macro-variables related to the precipitation hardening and creep deformation of the alloy during creep age forming (CAF) are analysed and modelled. Equations for the yield strength evolution of the alloy, including an initial reversion and subsequent strengthening, are proposed based on a theory of concurrent dissolution, re-nucleation and growth of precipitates during artificial ageing. We present new observations of so-called double primary creep during the CAF process. This phenomenon is then predicted by introducing effects of interacting microstructures, including evolving precipitates, diffusing solutes and dislocations, into the sinh-law creep model. In addition, concepts of threshold creep stress σth and a microstructure-dependant creep variable H, which behave differently under different external stress directions, are proposed and incorporated into the creep model. This enables prediction of the asymmetric tension and compression creep-ageing behaviour of the alloy. Quantitative transmission electron microscopy (TEM) and related small-angle X-ray scattering (SAXS) analysis have been carried out for selected creep-aged samples to assist the development and calibration of the constitutive model. A good agreement has been achieved between the experimental results and the model. The model has the potential to be applied to creep age forming of other heat-treatable aluminium alloys

A multiple type bike repositioning problem

This paper investigates a new static bicycle repositioning problem in which multiple types of bikes are considered. Some types of bikes that are in short supply at a station can be substituted by other types, whereas some types of bikes can occupy the spaces of other types in the vehicle during repositioning. These activities provide two new strategies, substitution and occupancy, which are examined in this paper. The problem is formulated as a mixed-integer linear programming problem to minimize the total cost, which consists of the route travel cost, penalties due to unmet demand, and penalties associated with the substitution and occupancy strategies. A combined hybrid genetic algorithm is proposed to solve this problem. This solution algorithm consists of (i) a modified version of a hybrid genetic search with adaptive diversity control to determine routing decisions and (ii) a proposed greedy heuristic to determine the loading and unloading instructions at each visited station and the substitution and occupancy strategies. The results show that the proposed method can provide high-quality solutions with short computing times. Using small examples, this paper also reveals problem properties and repositioning strategies in bike sharing systems with multiple types of bikes.published_or_final_versio

Covering Problems for Partial Words and for Indeterminate Strings

We consider the problem of computing a shortest solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of the alphabet that could be present at the corresponding position. We also consider covering partial words, which are a special case of indeterminate strings where each non-solid symbol is a don't care symbol. We prove that indeterminate string covering problem and partial word covering problem are NP-complete for binary alphabet and show that both problems are fixed-parameter tractable with respect to $k$, the number of non-solid symbols. For the indeterminate string covering problem we obtain a $2^{O(k \log k)} + n k^{O(1)}$-time algorithm. For the partial word covering problem we obtain a $2^{O(\sqrt{k}\log k)} + nk^{O(1)}$-time algorithm. We prove that, unless the Exponential Time Hypothesis is false, no $2^{o(\sqrt{k})} n^{O(1)}$-time solution exists for either problem, which shows that our algorithm for this case is close to optimal. We also present an algorithm for both problems which is feasible in practice.Comment: full version (simplified and corrected); preliminary version appeared at ISAAC 2014; 14 pages, 4 figure