Plasmid pGA1 from Corynebacterium glutamicum codes for a gene product that positively influences plasmid copy number

The complete nucleotide sequence (4,826 bp) of the cryptic plasmid pGA1 from Corynebacterium glutamicum was determined. DNA sequence analysis revealed four putative coding regions (open reading frame A [ORFA], ORFA2, ORFB, and ORFC). ORFC was identified as a rep gene coding for an initiator of plasmid replication (Rep) according to the high level of homology of its deduced amino acid sequence with the Rep proteins of plasmids pSR1 (from C. glutamicum) and pNG2 (from Corynebacterium diphtheriae). This function was confirmed by deletion mapping of the minimal replicon of pGA1 (1.7 kb) which contains only ORFC. Deletion derivatives of pGA1 devoid of ORFA exhibited significant decreases in the copy number in C. glutamicum cells and displayed segregational instability. Introduction of ORFA in trans into the cells harboring these deletion plasmids dramatically increased their copy number and segregational stability. The ORFA gene product thus positively influences plasmid copy number. This is the first report on such activity associated with a nonintegrating bacterial plasmid. The related plasmids pGA1, pSR1, and pNG2 lacking significant homology with any other plasmid seem to be representatives of a new group of plasmids replicating in the rolling-circle mode.     

DIRECT RESONANCE OF TURBULENT BOUNDARY LAVER OVER COMPLIANT WALLS

１．　ＩＮＴＲＯＤＵＣＴＩＯＮＴｈｅｍａｉｎｇｏａｌｏｆｔｈｉｓｐａｐｅｒｉｓｔｏｅｘｐｌｏｒｅｔｈｅｐｏｓｓｉｂｉｌｉｔｙｔｏｌｅａｒｎｍｏｒｅａｂｏｕｔｔｈｅｍｅｃｈａｎｉｓｍｏｆｔｕｒｂｕｌｅｎｔｂｏｕｎｄａｒｙｌａｙｅｒｆｌｏｗｉｎｔｅｒａｃｔｉｏｎｓａｎｄｉｔｓｅｆｆｅｃｔｓｏｎｃｏｍｐｌｉａｎｔｗａｌｌｐｅｒｆｏｒｍａｎｃｅ．Ｔｈｅｒｅａｒｅｃｅｒｔａｉｎｐｒｅｒｅｑｕｉｓｉｔｅｃｏｎｄｉｔｉｏｎｓｔｏｆｕｒｔｈｅｒｔｈｅｓｔｕｄｙｏｎｔｈｅｍｅｃｈａｎｉｓｍ，ｉ．ｅ．ｔｈｅｃｏ…     

Computation of the stability radius of a Schur polynomial: an orthogonal projection approach

The robust Schur stability of a polynomial with uncertain coefficients will be investigated. A formula for the stability radius of a Schur polynomial is established. The result is the counterpart of [1] for linear discrete-time systems     

Self and mutual admittance of slot antennas on a dielectric half-space

In this paper, an efficient implementation of the spectral domain moment technique is presented for computing the self and mutual coupling between slot antennas on a dielectric half-space. It is demonstrated that by the proper selection of the weighting functions in the method of moments, the analytic evaluation or simplification of the transverse moment integrals is enabled. This results into a significant reduction of the required computational labor. The method is then utilized in order to provide design data for the self and mutual admittances between two slot antennas on a dielectric substrate lens in the case of fused quartz (∈ _r =3.80), crystal quartz (∈ _r =4.53), silicon (∈ _r =11.9) and GaAs (∈ _r =12.8). The presented technique and associated results are useful when designing twin slot quasi-optical receivers, imaging arrays, phased arrays or power-combining arrays of slot elements at millimeter-wave frequencies.     

Prolog/Rex-a way to extend Prolog for better knowledgerepresentation

Prolog/Rex represents a powerful amalgamation of the latest techniques for knowledge representation and processing, rich in semantic features that ease the difficult task of encoding heterogeneous knowledge of real-world applications. The Prolog/Rex concept mechanism lets a user represent domain entities in terms of their structural and behavioral properties, including multiple inheritance, arbitrary user-defined relations among entities, annotated values (demons), incomplete knowledge, etc. A flexible rule language helps the knowledge engineer capture human expertise and provide flexible control of the reasoning process. Additional Prolog/Rex strength that cannot be found in any other hybrid language made on top of Prolog is language level support for keeping many potentially contradictory solutions to a problem, allowing possible solutions and their implications to be automatically generated and completely explored before they are committed. The same mechanism is used to model time-states, which are useful in planning and scheduling applications of Prolog/Rex     

Site and query scheduling policies in multicomputer databasesystems

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations     

Partial indexing for nonuniform data distributions in relationalDBMS's

It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B⁺trees. The effectiveness of the B ⁺tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B⁺tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described