A beam-forming network for a circular switched-beam phased array antenna

This paper reports on the design and development of a dividing/phasing network for a compact switched-beam array antenna for Land-vehicle mobile satellite communications, The device is formed by a switched radial divider/combiner and 1-bit phase shifters and generates a sufficient number of beams for the proper satellite tracking.

The GRIP domain is a specific targeting sequence for a population of trans-Golgi network derived tubulo-vesicular carriers

Vesicular carriers for intracellular transport associate with unique sets of accessory molecules that dictate budding and docking on specific membrane domains. Although many of these accessory molecules are peripheral membrane proteins, in most cases the targeting sequences responsible for their membrane recruitment have yet to be identified. We have previously defined a novel Golgi targeting domain (GRIP) shared by a family of coiled-coil peripheral membrane Golgi proteins implicated in membrane trafficking. We show here that the docking site for the GRIP motif of p230 is a specific domain of Golgi. membranes. By immunoelectron microscopy of HeLa cells stably expressing a green fluorescent protein (GFP)-p230(GRIP) fusion protein, we show binding specifically to a subset of membranes of the trans-Golgi network (TGN). Real-time imaging of live HeLa cells revealed that the GFP-p230(GRIP) was associated with highly dynamic tubular extensions of the TGN, which have the appearance and behaviour of transport carriers. To further define the nature of the GRIP membrane binding site, in vitro budding assays were performed using purified rat liver Golgi membranes and cytosol from GFP-p230(GRIP) transfected cells. Analysis of Golgi-derived vesicles by sucrose gradient fractionation demonstrated that GFP-p230(GRIP) binds to a specific population of vesicles distinct from those labelled for beta -COP or gamma -adaptin. The GFP-p230(GRIP) fusion protein is recruited to the same vesicle population as full-length p230, demonstrating that the GRIP domain is solely proficient as a targeting signal for membrane binding of the native molecule. Therefore, p230 GRIP is a targeting signal for recruitment to a highly selective membrane attachment site on a specific population of trans-Golgi network tubulovesicular carriers.

Efficient simulation of a Tandem Jackson Network

The two-node tandem Jackson network serves as a convenient reference model for the analysis and testing of different methodologies and techniques in rare event simulation. In this paper we consider a new approach to efficiently estimate the probability that the content of the second buffer exceeds some high level L before it becomes empty, starting from a given state. The approach is based on a Markov additive process representation of the buffer processes, leading to an exponential change of measure to be used in an importance sampling procedure. Unlike changes of measures proposed and studied in recent literature, the one derived here is a function of the content of the first buffer. We prove that when the first buffer is finite, this method yields asymptotically efficient simulation for any set of arrival and service rates. In fact, the relative error is bounded independent of the level L; a new result which is not established for any other known method. When the first buffer is infinite, we propose a natural extension of the exponential change of measure for the finite buffer case. In this case, the relative error is shown to be bounded (independent of L) only when the second server is the bottleneck; a result which is known to hold for some other methods derived through large deviations analysis. When the first server is the bottleneck, experimental results using our method seem to suggest that the relative error is bounded linearly in L.

Read-only-memory-based quantum computation: Experimental explorations using nuclear magnetic resonance and future prospects

Read-only-memory-based (ROM-based) quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less magical, and being more suited to implementing space-efficient computation (i.e., computation using the minimum number of writable qubits). Here we consider a number of small (one- and two-qubit) quantum algorithms illustrating different aspects of ROM-based QC. They are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a one-qubit binary multiplication algorithm; (c) a two-qubit controlled binary multiplication algorithm; and (d) a two-qubit ROM-based version of the Deutsch-Jozsa algorithm. For each algorithm we present experimental verification using nuclear magnetic resonance ensemble QC. The average fidelities for the implementation were in the ranges 0.9-0.97 for the one-qubit algorithms, and 0.84-0.94 for the two-qubit algorithms. We conclude with a discussion of future prospects for ROM-based quantum computation. We propose a four-qubit algorithm, using Grover's iterate, for solving a miniature real-world problem relating to the lengths of paths in a network.

Use of liquid phase adsorption for characterizing pore network connectivity in activated carbon

A simple percolation theory-based method for determination of the pore network connectivity using liquid phase adsorption isotherm data combined with a density functional theory (DFT)-based pore size distribution is presented in this article. The liquid phase adsorption experiments have been performed using eight different esters as adsorbates and microporous-mesoporous activated carbons Filtrasorb-400, Norit ROW 0.8 and Norit ROX 0.8 as adsorbents. The density functional theory (DFT)-based pore size distributions of the carbons were obtained using DFT analysis of argon adsorption data. The mean micropore network coordination numbers, Z, of the carbons were determined based on DR characteristic plots and fitted saturation capacities using percolation theory. Based on this method, the critical molecular sizes of the model compounds used in this study were also obtained. The incorporation of percolation concepts in the prediction of multicomponent adsorption equilibria is also investigated, and found to improve the performance of the ideal adsorbed solution theory (IAST) model for the large molecules utilized in this study. (C) 2002 Elsevier Science B.V. All rights reserved.

Segmenting the market of West Australian senior tourists using an artificial neural network

Measuring perceptions of customers can be a major problem for marketers of tourism and travel services. Much of the problem is to determine which attributes carry most weight in the purchasing decision. Older travellers weigh many travel features before making their travel decisions. This paper presents a descriptive analysis of neural network methodology and provides a research technique that assesses the weighting of different attributes and uses an unsupervised neural network model to describe a consumer-product relationship. The development of this rich class of models was inspired by the neural architecture of the human brain. These models mathematically emulate the neurophysical structure and decision making of the human brain, and, from a statistical perspective, are closely related to generalised linear models. Artificial neural networks or neural networks are, however, nonlinear and do not require the same restrictive assumptions about the relationship between the independent variables and dependent variables. Using neural networks is one way to determine what trade-offs older travellers make as they decide their travel plans. The sample of this study is from a syndicated data source of 200 valid cases from Western Australia. From senior groups, active learner, relaxed family body, careful participants and elementary vacation were identified and discussed. (C) 2003 Published by Elsevier Science Ltd.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

Fast, scalable master equation solution algorithms. IV. Lanczos iteration with diffusion approximation preconditioned iterative inversion

In this paper we propose a second linearly scalable method for solving large master equations arising in the context of gas-phase reactive systems. The new method is based on the well-known shift-invert Lanczos iteration using the GMRES iteration preconditioned using the diffusion approximation to the master equation to provide the inverse of the master equation matrix. In this way we avoid the cubic scaling of traditional master equation solution methods while maintaining the speed of a partial spectral decomposition. The method is tested using a master equation modeling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long-lived isomerizing intermediates. (C) 2003 American Institute of Physics.

Fast, scalable master equation solution algorithms. III. Direct time propagation accelerated by a diffusion approximation preconditioned iterative solver

In this paper we propose a novel fast and linearly scalable method for solving master equations arising in the context of gas-phase reactive systems, based on an existent stiff ordinary differential equation integrator. The required solution of a linear system involving the Jacobian matrix is achieved using the GMRES iteration preconditioned using the diffusion approximation to the master equation. In this way we avoid the cubic scaling of traditional master equation solution methods and maintain the low temperature robustness of numerical integration. The method is tested using a master equation modelling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long lived isomerizing intermediates. (C) 2003 American Institute of Physics.

GLUT4 recycles via a trans-Golgi network (TGN) subdomain enriched in Syntaxins 6 and 16 but not TGN38: Involvement of an acidic targeting motif

Insulin stimulates glucose transport in fat and muscle cells by triggering exocytosis of the glucose transporter GLUT4. To define the intracellular trafficking of GLUT4, we have studied the internalization of an epitope-tagged version of GLUT4 from the cell surface. GLUT4 rapidly traversed the endosomal system en route to a perinuclear location. This perinuclear GLUT4 compartment did not colocalize with endosomal markers (endosomal antigen I protein, transferrin) or TGN38, but showed significant overlap with the TGN target (t)-soluble N-ethylmaleimide-sensitive factor attachment protein receptors (SNAREs) Syntaxins 6 and 16. These results were confirmed by vesicle immunoisolation. Consistent with a role for Syntaxins 6 and 16 in GLUT4 trafficking we found that their expression was up-regulated significantly during adipocyte differentiation and insulin stimulated their movement to the cell surface. GLUT4 trafficking between endosomes and trans-Golgi network was regulated via an acidic targeting motif in the carboxy terminus of GLUT4, because a mutant lacking this motif was retained in endosomes. We conclude that GLUT4 is rapidly transported from the cell surface to a subdomain of the trans-Golgi network that is enriched in the t-SNAREs Syntaxins 6 and 16 and that an acidic targeting motif in the C-terminal tail of GLUT4 plays an important role in this process.

Knowledge-based system on optimum design of liquid retaining structures with genetic algorithms

This paper delineates the development of a prototype hybrid knowledge-based system for the optimum design of liquid retaining structures by coupling the blackboard architecture, an expert system shell VISUAL RULE STUDIO and genetic algorithm (GA). Through custom-built interactive graphical user interfaces under a user-friendly environment, the user is directed throughout the design process, which includes preliminary design, load specification, model generation, finite element analysis, code compliance checking, and member sizing optimization. For structural optimization, GA is applied to the minimum cost design of structural systems with discrete reinforced concrete sections. The design of a typical example of the liquid retaining structure is illustrated. The results demonstrate extraordinarily converging speed as near-optimal solutions are acquired after merely exploration of a small portion of the search space. This system can act as a consultant to assist novice designers in the design of liquid retaining structures.

GRIP domain-mediated targeting of two new coiled-coil proteins, GCC88 and GCC185, to subcompartments of the trans-Golgi network

The GRIP domain is a targeting sequence found in a family of coiled-coil peripheral Golgi proteins. Previously we demonstrated that the GRIP domain of p230/golgin245 is specifically recruited to tubulovesicular structures of the traps-Golgi network (TGN). Here we have characterized two novel Golgi proteins with functional GRIP domains, designated GCC88 and GCC185. GCC88 cDNA encodes a protein of 88 kDa, and GCC185 cDNA encodes a protein of 185 kDa. Both molecules are brefeldin A-sensitive peripheral membrane proteins and are predicted to have extensive coiled-coil regions with the GRIP domain at the C terminus. By immunofluorescence and immunoelectron microscopy GCC88 and GCC185, and the GRIP protein golgin97, are all localized to the TGN of Hela cells. Overexpression of full-length GCC88 leads to the formation of large electron dense structures that extend from the traps-Golgi. These de novo structures contain GCC88 and co-stain for the TGN markers syntaxin 6 and TGN38 but not for alpha2,6-sialyltransferase, beta-COP, or cis-Golgi GM130. The formation of these abnormal structures requires the N-terminal domain of GCC88. TGN38, which recycles between the TGN and plasma membrane, was transported into and out of the GCC88 decorated structures. These data introduce two new GRIP domain proteins and implicate a role for GCC88 in the organization of a specific TGN subcompartment involved with membrane transport.