Technicolor

The need for reexamination of the standard model of strong, weak, and electromagnetic interactions is discussed, especially with regard to 't Hooft's criterion of naturalness. It has been argued that theories with fundamental scalar fields tend to be unnatural at relatively low energies. There are two solutions to this problem: (i) a global supersymmetry, which ensures the absence of all the naturalness-violating effects associated with scalar fields, and (ii) composite structure of the scalar fields, which starts showing up at energy scales where unnatural effects would otherwise have appeared. With reference to the second solution, this article reviews the case for dynamical breaking of the gauge symmetry and the technicolor scheme for the composite Higgs boson. This new interaction, of the scaled-up quantum chromodynamic type, keeps the new set of fermions, the technifermions, together in the Higgs particles. It also provides masses for the electroweak gauge bosons W± and Z0 through technifermion condensate formation. In order to give masses to the ordinary fermions, a new interaction, the extended technicolor interaction, which would connect the ordinary fermions to the technifermions, is required. The extended technicolor group breaks down spontaneously to the technicolor group, possibly as a result of the "tumbling" mechanism, which is discussed here. In addition, the author presents schemes for the isospin breaking of mass matrices of ordinary quarks in the technicolor models. In generalized technicolor models with more than one doublet of technifermions or with more than one technicolor sector, we have additional low-lying degrees of freedom, the pseudo-Goldstone bosons. The pseudo-Goldstone bosons in the technicolor model of Dimopoulos are reviewed and their masses computed. In this context the vacuum alignment problem is also discussed. An effective Lagrangian is derived describing colorless low-lying degrees of freedom for models with two technicolor sectors in the combined limits of chiral symmetry and large number of colors and technicolors. Finally, the author discusses suppression of flavor-changing neutral currents in the extended technicolor models.

Reflexive Incidence Matrx (RIM) Representation of Petr Nets

Although incidence matrix representation has been used to analyze the Petri net based models of a system, it has the limitation that it does not preserve reflexive properties (i.e., the presence of selfloops) of Petri nets. But in many practical applications self-loops play very important roles. This paper proposes a new representation scheme for general Petri nets. This scheme defines a matrix called "reflexive incidence matrix (RIM) c which is a combination of two matrices, a "base matrix Cb,,, and a "power matrix CP." This scheme preserves the reflexive and other properties of the Petri nets. Through a detailed analysis it is shown that the proposed scheme requires less memory space and less processing time for answering commonly encountered net queries compared to other schemes. Algorithms to generate the RIM from the given net description and to decompose RIM into input and output function matrices are also given. The proposed Petri net representation scheme is very useful to model and analyze the systems having shared resources, chemical processes, network protocols, etc., and to evaluate the performance of asynchronous concurrent systems.

In quest of a reliable and efficient computational test for detection of isomorphism in kinematic chains

The test based on comparison of the characteristic coefficients of the adjancency matrices of the corresponding graphs for detection of isomorphism in kinematic chains has been shown to fail in the case of two pairs of ten-link, simple-jointed chains, one pair corresponding to single-freedom chains and the other pair corresponding to three-freedom chains. An assessment of the merits and demerits of available methods for detection of isomorphism in graphs and kinematic chains is presented, keeping in view the suitability of the methods for use in computerized structural synthesis of kinematic chains. A new test based on the characteristic coefficients of the “degree” matrix of the corresponding graph is proposed for detection of isomorphism in kinematic chains. The new test is found to be successful in the case of a number of examples of graphs where the test based on characteristic coefficients of adjancency matrix fails. It has also been found to be successful in distinguishing the structures of all known simple-jointed kinematic chains in the categories of (a) single-freedom chains with up to 10 links, (b) two-freedom chains with up to 9 links and (c) three-freedom chains with up to 10 links.

Comment: Eigenvalue sensitivity method for optimal stabilisation of linear systems

In a letter RauA proposed a new method for designing statefeedback controllers using eigenvalue sensitivity matrices. However, there appears to be a conceptual mistake in the procedure, or else it is unduly restricted in its applicability. In particular the equation — BR~lBTK = A/.I, in which K is a positive-definite symmetric matrix.

Study of turbid media with light: Recovery of mechanical and optical properties from boundary measurement of intensity autocorrelation of light

We discuss the inverse problem associated with the propagation of the field autocorrelation of light through a highly scattering object like tissue. In the first part of the work, we reconstructed the optical absorption coefficient mu(u) and particle diffusion coefficient D-B from simulated measurements which are integrals of a quantity computed from the measured intensity and intensity autocorrelation g(2)(tau) at the boundary. In the second part we recover the mean square displacement (MSD) distribution of particles in an inhomogeneous object from the sampled g(2)(tau) measure on the boundary. From the MSD, we compute the storage and loss moduli distributions in the object. We have devised computationally easy methods to construct the sensitivity matrices which are used in the iterative reconstruction algorithms for recovering these parameters from the measurements. The results of the reconstruction of mu(a), D-B, MSD and the viscoelastic parameters, which are presented, show reasonable good position and quantitative accuracy.

Styrene Oxidation to Benzaldehyde by Polymer Anchored Wilkinson Complex

Wilkinson complex, insolubilized by anchoring to polymeric Amberlite beads, had been used for the liquid-phase catalytic oxidation of styrene to benzaldehyde and formaldehyde in toluene medium. Styrene conversion was followed by measuring the oxygen volume in contact with the reaction mixture in a specially designed closed batch apparatus. Styrene conversion depended upon catalyst loading and distribution inside the porous beads, while temperature had little effect on it. The internal diffusional effects on the conversion process have been taken into consideration by a mathematical model which allowed calculation of effectiveness factors for various catalyst loadings and corresponding catalyst distributions. The influence of external diffusion was separately determined by plotting initial rate versus catalyst loading. The proposed method can be readily extended to immobilized enzymes in porous matrices.

Styrene Oxidation to Benzaldehyde by Polymer Anchored Wilkinson Complex

Wilkinson complex, insolubilized by anchoring to polymeric Amberlite beads, had been used for the liquid-phase catalytic oxidation of styrene to benzaldehyde and formaldehyde in toluene medium. Styrene conversion was followed by measuring the oxygen volume in contact with the reaction mixture in a specially designed closed batch apparatus. Styrene conversion depended upon catalyst loading and distribution inside the porous beads, while temperature had little effect on it. The internal diffusional effects on the conversion process have been taken into onsideration by a mathematical model which allowed calculation of effectiveness factors for various catalyst loadings and corresponding catalyst distributions. The influence of external diffusion was separately determined by plotting initial rate versus catalyst loading. The proposed method can be readily extended to immobilized enzymes in porous matrices.

Efficient implementations of a pseudodynamical stochastic filtering strategy for static elastography

A computationally efficient pseudodynamical filtering setup is established for elasticity imaging (i.e., reconstruction of shear modulus distribution) in soft-tissue organs given statically recorded and partially measured displacement data. Unlike a regularized quasi-Newton method (QNM) that needs inversion of ill-conditioned matrices, the authors explore pseudodynamic extended and ensemble Kalman filters (PD-EKF and PD-EnKF) that use a parsimonious representation of states and bypass explicit regularization by recursion over pseudotime. Numerical experiments with QNM and the two filters suggest that the PD-EnKF is the most robust performer as it exhibits no sensitivity to process noise covariance and yields good reconstruction even with small ensemble sizes.

Occurrence, divergence and evolution of intrinsic terminators across Eubacteria

In Escherichia coli, the canonical intrinsic terminator of transcription includes a palindrome followed by a U-trail on the transcript. The apparent underrepresentation of such terminators in eubacterial genomes led us to develop a rapid and accurate algorithm, GeSTer, to predict putative intrinsic terminators. Now, we have analyzed 378 genome sequences with an improved version of GeSTer. Our results indicate that the canonical E. coli type terminators are not overwhelmingly abundant in eubacteria. The atypical structures, having stem-loop structures but lacking ‘U’ trail, occur downstream of genes in all the analyzed genomes but different phyla show conserved preference for different types of terminators. This propensity correlates with genomic GC content and presence of the factor, Rho. 60–70% of identified terminators in all the genomes show “optimized” stem-length and ΔG. These results provide evidence that eubacteria extensively rely on the mechanism of intrinsic termination, with a considerable divergence in their structure, positioning and prevalence. The software and detailed results for individual genomes are freely available on request

Non-Abelian monopoles break color. I. Classical mechanics

Monopoles which are sources of non-Abelian magnetic flux are predicted by many models of grand unification. It has been argued elsewhere that a generic transformation of the "unbroken" symmetry group H cannot be globally implemented on such monopoles for reasons of topology. In this paper, we show that similar topological obstructions are encountered in the mechanics of a test particle in the field of these monopoles and that the transformations of H cannot all be globally implemented as canonical transformations. For the SU(5) model, if H is SU(3)C×U(1)em, a consequence is that color multiplets are not globally defined, while if H is SU(3)C×SU(2)WS×U(1)Y, the same is the case for both color and electroweak multiplets. There are, however, several subgroups KT, KT′,… of H which can be globally implemented, with the transformation laws of the observables differing from group to group in a novel way. For H=SU(3)C×U(1)em, a choice for KT is SU(2)C×U(1)em, while for H=SU(3)C×SU(2)WS×U(1)Y, a choice is SU(2)C×U(1)×U(1)×U(1). The paper also develops the differential geometry of monopoles in a form convenient for computations.

On Bit Steering in the Minimization of the Control Memory of Microprogrammed Processors

The microcommands constituting the microprogram of the control memory of a microprogrammed processor can be partitioned into a number of disjoint sets. Some of these sets are then encoded to minimize the word width of the ROM storing the microprogram. A further reduction in the width of the ROM words can be achieved by a technique known as bit steering where one or more bits are shared by two or more sets of microcommands. These sets are called the steerable sets. This correspondence presents a simple method for the detection and encoding of steerable sets. It has been shown that the concurrency matrix of two steerable sets exhibits definite patterns of clusters which can be easily recognized. A relation "connection" has been defined which helps in the detection of three-set steerability. Once steerable sets are identified, their encoding becomes a straightforward procedure following the location of the identifying clusters on the concurrency matrix or matrices.

Realization of first order optical systems using thin lensest

A first order optical system is investigated in full generality within the context of wave optics. The problem is reduced to a study of the ray transfer matrices. The simplest such systems correspond to axially symmetric propagation. Realization of such systems by centrally located lenses separated by finite distances is studied. It is shown that, contrary to the commonly held view, the set of first order systems that can be realized using axially symmetric thin lenses exhausts the entire SL(2, R) group; at most three lenses are needed to realize any element of this group. In particular, the inverse of free propagation can be so realized. Among anisotropic systems it is again shown that every element of the lens group Sp(4, R) can be realized using a finite number of thin lenses.

Rectangular universal cellular array

A rectangular universal cellular array consisting of cells having three inputs and one output is described. This array is based on the Reed-Muller canonical expansion of a switching function. Although the total number of external input pins required in this array is the same as that of a rectangular array proposed in the literature, the number of cells is very much less.

On various types of decoupling for time-varying system

This paper deals with the problem of decoupling a class of linear time-varying multi-variable systems, based on the defining property that the impulse response matrix of a decoupled system is diagonal. Depending on the properties of the coefficient matrices of the vector differential equation of the open-loop system, the system may be uniformly or totally decoupled. The necessary and sufficient conditions that permit a system to be uniformly or totally decoupled by state variable feedback are given. The main contribution of this paper is the precise definition of these two classes of decoupling and a rigorous derivation of the necessary and sufficient conditions which show the necessity of requiring that the system be of constant ordered rank with respect to observability. A simple example illustrates the importance of having several definitions of decoupling. Finally, the results are specialized to the case of time invariant systems.

Formal description, compression and transformation of digital pictures

This paper describes the application of vector spaces over Galois fields, for obtaining a formal description of a picture in the form of a very compact, non-redundant, unique syntactic code. Two different methods of encoding are described. Both these methods consist in identifying the given picture as a matrix (called picture matrix) over a finite field. In the first method, the eigenvalues and eigenvectors of this matrix are obtained. The eigenvector expansion theorem is then used to reconstruct the original matrix. If several of the eigenvalues happen to be zero this scheme results in a considerable compression. In the second method, the picture matrix is reduced to a primitive diagonal form (Hermite canonical form) by elementary row and column transformations. These sequences of elementary transformations constitute a unique and unambiguous syntactic code-called Hermite code—for reconstructing the picture from the primitive diagonal matrix. A good compression of the picture results, if the rank of the matrix is considerably lower than its order. An important aspect of this code is that it preserves the neighbourhood relations in the picture and the primitive remains invariant under translation, rotation, reflection, enlargement and replication. It is also possible to derive the codes for these transformed pictures from the Hermite code of the original picture by simple algebraic manipulation. This code will find extensive applications in picture compression, storage, retrieval, transmission and in designing pattern recognition and artificial intelligence systems.