Identification of a discrete intermediate in the assembly disassembly of physalis mottle tymovirus through mutational analysis

Assembly intermediates of icosahedral viruses are usually transient and are difficult to identify. In the present investigation, site-specific and deletion mutants of the coat protein gene of physalis mottle tymovirus (PhMV) were used to delineate the role of specific amino acid residues in the assembly of the virus and to identify intermediates in this process. N-terminal 30, 34, 35 and 39 amino acid deletion and single C-terminal (N188) deletion mutant proteins of PhMV were expressed in Escherichia coli. Site-specific mutants H69A, C75A, W96A, D144N, D144N-T151A, K143E and N188A were also constructed and expressed. The mutant protein lacking 30 amino acid residues from the N terminus self-assembled to T = 3 particles in vivo while deletions of 34, 35 and 39 amino acid residues resulted in the mutant proteins that were insoluble. Interestingly, the coat protein (pR PhCP) expressed using pRSET B vector with an additional 41 amino acid residues at the N terminus also assembled into T = 3 particles that were more compact and had a smaller diameter. These results demonstrate that the amino-terminal segment is flexible and either the deletion or addition of amino acid residues at the N terminus does not affect T = 3 capsid assembly, in contrast, the deletion of even a single residue from the C terminus (PhN188 Delta 1) resulted in capsids that were unstable. These capsids disassembled to a discrete intermediate with a sedimentation coefficent of 19.4 S. However, the replacement of C-terminal asparagine 188 by alanine led to the formation of stable capsids. The C75A and D144N mutant proteins also assembled into capsids that were as stable as the pR PhCP, suggesting that C75A and D144 are not crucial for the T = 3 capsid assembly. pR PhW96A and pR PhD144N-T151A mutant proteins failed to form capsids and were present as heterogeneous aggregates. Interestingly, the pR PhK143E mutant protein behaved in a manner similar to the C-terminal deletion protein in forming unstable capsids. The intermediate with an s value of 19.4 S was the major assembly product of pR PhH69A mutant protein and could correspond to a 30mer. It is possible that the assembly or disassembly is arrested at a similar stage in pR PhN188 Delta 1, pR PhH69A and pR PhK143E mutant proteins.

Classical Langevin dynamics of a charged particle moving on a sphere and diamagnetism: A surprise

It is generally known that the orbital diamagnetism of a classical system of charged particles in thermal equilibrium is identically zero —the Bohr-van Leeuwen theorem. Physically, this null result derives from the exact cancellation of the orbital diamagnetic moment associated with the complete cyclotron orbits of the charged particles by the paramagnetic moment subtended by the incomplete orbits skipping the boundary in the opposite sense. Motivated by this crucial but subtle role of the boundary, we have simulated here the case of a finite but unbounded system, namely that of a charged particle moving on the surface of a sphere in the presence of an externally applied uniform magnetic field. Following a real space-time approach based on the classical Langevin equation, we have computed the orbital magnetic moment that now indeed turns out to be non-zero and has the diamagnetic sign. To the best of our knowledge, this is the first report of the possibility of finite classical diamagnetism in principle, and it is due to the avoided cancellation.

A Joint Source-Channel Coding Scheme for Transmission of Correlated Discrete Sources over a Gaussian Multiple Access Channel

We consider the problem of transmission of correlated discrete alphabet sources over a Gaussian Multiple Access Channel (GMAC). A distributed bit-to-Gaussian mapping is proposed which yields jointly Gaussian codewords. This can guarantee lossless transmission or lossy transmission with given distortions, if possible. The technique can be extended to the system with side information at the encoders and decoder.

Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: stability and moving-horizon approximations

Stability results are given for a class of feedback systems arising from the regulation of time-varying discrete-time systems using optimal infinite-horizon and moving-horizon feedback laws. The class is characterized by joint constraints on the state and the control, a general nonlinear cost function and nonlinear equations of motion possessing two special properties. It is shown that weak conditions on the cost function and the constraints are sufficient to guarantee uniform asymptotic stability of both the optimal infinite-horizon and movinghorizon feedback systems. The infinite-horizon cost associated with the moving-horizon feedback law approaches the optimal infinite-horizon cost as the moving horizon is extended.

Orthogonal biofunctionalization of magnetic nanoparticles via ``clickable'' poly(ethylene glycol) silanes: a ``universal ligand'' strategy to design stealth and target-specific nanocarriers

The present work demonstrates a novel strategy to synthesize orthogonally bio-engineered magnetonanohybrids (MNPs) through the design of versatile, biocompatible linkers whose structure includes: (i) a robust anchor to bind with metal-oxide surfaces; (ii) tailored surface groups to act as spacers and (iii) a general method to implement orthogonal functionalizations of the substrate via ``click chemistry''. Ligands that possess the synthetic generality of features (i)-(iii) are categorized as ``universal ligands''. Herein, we report the synthesis of a novel, azido-terminated poly(ethylene glycol) (PEG) silane that can easily self-assemble on MNPs through hetero-condensation between surface hydroxyl groups and the silane end of the ligand, and simultaneously provide multiple clickable sites for high density, chemoselective bio-conjugation. To establish the universal-ligand-strategy, we clicked alkyl-functionalized folate onto the surface of PEGylated MNPs. By further integrating a near-infrared fluorescent (NIRF) marker (Alexa-Fluor 647) with MNPs, we demonstrated their folate-receptor mediated internalization inside cancer cells and subsequent translocation into lysosomes and mitochondria. Ex vivo NIRF imaging established that the azido-PEG-silane developed in course of the study can effectively reduce the sequestration of MNPs by macrophage organs (viz. liver and spleen). These folate-PEG-MNPs were not only stealth and noncytotoxic but their dual optical and magnetic properties aided in tracking their whereabouts through combined magnetic resonance and optical imaging. Together, these results provided a strong motivation for the future use of the ``universal ligand'' strategy towards development of ``smart'' nanohybrids for theragnostic applications.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences

The Cubic Sieve Method for solving the Discrete Logarithm Problem in prime fields requires a nontrivial solution to the Cubic Sieve Congruence (CSC) x(3) equivalent to y(2)z (mod p), where p is a given prime number. A nontrivial solution must also satisfy x(3) not equal y(2)z and 1 <= x, y, z < p(alpha), where alpha is a given real number such that 1/3 < alpha <= 1/2. The CSC problem is to find an efficient algorithm to obtain a nontrivial solution to CSC. CSC can be parametrized as x equivalent to v(2)z (mod p) and y equivalent to v(3)z (mod p). In this paper, we give a deterministic polynomial-time (O(ln(3) p) bit-operations) algorithm to determine, for a given v, a nontrivial solution to CSC, if one exists. Previously it took (O) over tilde (p(alpha)) time in the worst case to determine this. We relate the CSC problem to the gap problem of fractional part sequences, where we need to determine the non-negative integers N satisfying the fractional part inequality {theta N} < phi (theta and phi are given real numbers). The correspondence between the CSC problem and the gap problem is that determining the parameter z in the former problem corresponds to determining N in the latter problem. We also show in the alpha = 1/2 case of CSC that for a certain class of primes the CSC problem can be solved deterministically in <(O)over tilde>(p(1/3)) time compared to the previous best of (O) over tilde (p(1/2)). It is empirically observed that about one out of three primes is covered by the above class. (C) 2013 Elsevier B.V. All rights reserved.

Alternative Formulation of the Discrete Linear Quadratic Regulator (DLQR)

In this paper, an alternative apriori and aposteriori formulation has been derived for the discrete linear quadratic regulator (DLQR) in a manner analogous to that used in the discrete Kalman filter. It has been shown that the formulation seamlessly fits into the available formulation of the DLQR and the equivalent terms in the existing formulation and the proposed formulation have been identified. Thereafter, the significance of this alternative formulation has been interpreted in terms of the sensitivity of the controller performances to any changes in the states or to changes in the control inputs. The implications of this alternative formulation to adaptive controller tuning have also been discussed.

Response And Stability Of A Stochastic Beam-Column Using Stochastic Fem

A beam-column resting on continuous Winkler foundation and discrete elastic supports is considered. The beam-column is of variable cross-section and the variation of sectional properties along the axis of the beam-column is deterministic. Young's modulus, mass per unit length and distributed axial loadings of the beam-column have a stochastic distribution. The foundation stiffness coefficient of the Winkler model, the stiffnesses of discrete elastic supports, stiffnesses of end springs and the end thrust, are all considered as random parameters. The material property fluctuations and distributed axial loadings are considered to constitute independent, one-dimension uni-variate homogeneous real stochastic fields in space. The foundation stiffness coefficient, stiffnesses of the discrete elastic supports, stiffnesses of end springs and the end thrust are considered to constitute independent random variables. Static response, free vibration and stability behaviour of the beam-column are studied. Hamilton's principle is used to formulate the problem using stochastic FEM. Sensitivity vectors of the response and stability parameters are evaluated. Using these statistics of free vibration frequencies, mode shapes, buckling parameters, etc., are evaluated. A numerical example is given.

State space formulation of ammonia reactor dynamics

The specific objective of this paper is to develop a state space model of a tubular ammonia reactor which is the heart of an ammonia plant in a fertiliser complex. A ninth order model with three control inputs and two disturbance inputs is generated from the nonlinear distributed model using linearization and lumping approximations. The lumped model is chosen such that the steady state temperature at the exit of the catalyst bed computed from the simplified state space model is close enough to the one computed from the nonlinear steady state model. The model developed in this paper is very useful for the design of continuous/discrete versions of single variable/multivariable control algorithms.

The virial expansion of a classical interacting system

We consider N particles interacting pairwise by an inverse square potential in one dimension (Calogero-Sutherland-Moser model). For a system placed in a harmonic trap, its classical partition function for the repulsive regime is recognised in the literature. We start by presenting a concise re-derivation of this result. The equation of state is then calculated both for the trapped and the homogeneous gas. Finally, the classical limit of Wu's distribution function for fractional exclusion statistics is obtained and we re-derive the classical virial expansion of the homogeneous gas using this distribution function.

Belief Propagation Based Decoding of Large Non-Orthogonal STBCs

In this paper,we present a belief propagation (BP) based algorithm for decoding non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having large dimensions. The proposed approachinvolves message passing on Markov random field (MRF) representation of the STBC MIMO system. Adoption of BP approach to decode non-orthogonal STBCs of large dimensions has not been reported so far. Our simulation results show that the proposed BP-based decoding achieves increasingly closer to SISO AWGN performance for increased number of dimensions. In addition, it also achieves near-capacity turbo coded BER performance; for e.g., with BP decoding of 24 x 24 STBC from CDA using BPSK (i.e.,n576 real dimensions) and rate-1/2 turbo code (i.e., 12 bps/Hz spectral efficiency), coded BER performance close to within just about 2.5 dB from the theoretical MIMO capacity is achieved.

A discrete state perspective of manipulator workspaces Vorstellungen von diskreten zuständen von manipulator-arbeitsräumen

The finite resolution of joint drives or sensors imparts a discrete nature to the joints of a manipulator. Because of this an arbitrary point in the workspace cannot be reached without error even in ideal mechanical environment. This paper investigates the effect of this discrete nature of the joints on the accuracy of performance of a manipulator and develops a method to select the joint states to reach a point with least error. It is shown that the configuration leading to least error cannot, in general, be found from configuration space, especially when there is large variation in the link lengths or joint resolutions or both. The anomaly becomes severe when the gross motion of the end-effector approaches the local resolution of the workspace. The paper also shows how to distinguish two workspaces which may be identical so far as the boundary points are concerned, taking the joint resolutions into account. Finally, the concepts have been extended to define continuous space global and local performance indices for general multi degree of freedom manipulators.