302 resultados para Region growing algorithms
Resumo:
A stretch of 71 nucleotides in a 1.2 kilobase pair Pst I fragment of rice DNA was identified as tRNA~ gene by hybridization and nucleotide sequence analyses. The hybridization of genomic DNA with the tRNA gene showed that there are about 10 glycine tRNA genes per diploid rice genome. The 3' and 5' internal control regions, where RNA polymerase III and transcription factors bind, were found to be present in the coding sequence. The gene was transcribed into a 4S product in an yeast cell-free extract. The substitution of 5' internal control region with analogous sequences from either M13mpl9 or M13mpl8 DNA did not affect the transcription of the gene in vitro. The changes in three highly conserved nucleotides in the consensus 5' internal control region (RGYNNARYGG; R = purine, Y = pyrimidine, N = any nucleotide) did not affect transcription showing that these nucleotides are not essential for promotion of transcription. There were two 16 base pair repeats, 'TGTTTGTTTCAGCTTA' at - 130 and - 375 positions upstream from the start of the gene. Deletion of 5' flanking sequences including the 16 base pair repeat at - 375 showed increased transcription indicating that these sequences negatively modulate the expression of the gene.
Resumo:
Oxides of the Y-Ba-Cu-O system are found to show onset of superconductivity in the 100–120 K region.
Resumo:
In this paper, three parallel polygon scan conversion algorithms have been proposed, and their performance when executed on a shared bus architecture has been compared. It has been shown that the parallel algorithm that does not use edge coherence performs better than those that use edge coherence. Further, a multiprocessing architecture has been proposed to execute the parallel polygon scan conversion algorithms more efficiently than a single shared bus architecture.
Resumo:
The influence of chemical mutation featuring the selective conversion of asparagine or glutamine to aspartic or glutamic acid, respectively, on the kinetics of refolding of reduced RNase has been studied. The monodeamidated derivatives of RNase A, viz. RNase Aa1a, Aa1b, and Aa1c having their deamidations in the region 67-74, were found to regain nearly their original enzymatic activity. However, a marked difference in the kinetics of refolding is seen, the order of regain of enzymic activity being RNase A greater than Aa1c congruent to Aa1a greater than Aa1b. The similarities in the distinct elution positions on Amberlite XE-64, gel electrophoretic mobilities, and u.v. spectra of reoxidized and native derivatives indicated that the native structures are formed. The slower rate of reappearance of enzymic activity in the case of the monodeamidated derivatives appears to result from altered interactions in the early stages of refolding. The roles of some amino acid residues of the 67-74 region in the pathway of refolding of RNase A are discussed.
Resumo:
The implementation of CSP-S (a subset of CSP)—a high level language for distributed programming—is presented in this paper. The language CSP-S features a parallel command, communication by message passing and the use of guarded command. The implementation consists of a compiler translating the CSP-S constructs into intermediate language. The execution is carried out by a scheduler which creates an illusion of concurrency. Using the CSP-S language constructs, distributed algorithms are written, executed and tested with the compiler designed.
Resumo:
A channel router is an important design aid in the design automation of VLSI circuit layout. Many algorithms have been developed based on various wiring models with routing done on two layers. With the recent advances in VLSI process technology, it is possible to have three independent layers for interconnection. In this paper two algorithms are presented for three-layer channel routing. The first assumes a very simple wiring model. This enables the routing problem to be solved optimally in a time of O(n log n). The second algorithm is for a different wiring model and has an upper bound of O(n2) for its execution time. It uses fewer horizontal tracks than the first algorithm. For the second model the channel width is not bounded by the channel density.
Resumo:
Experiments were conducted in the nonequilibrium region of a free mixing layer with unequal freestream velocities. Four velocity ratios U(1)/U(2) of 0.32, 0.46, 0.74, and 0.96 were used in this investigation. The growth of the shear layer as well as the velocity adjustment in the near wake were examined. There was reasonable agreement between the measured mean velocity profiles and those computed using the K-epsilon turbulence model. Some periodic turbulence velocity fluctuations were observed in the mixing layer, but their frequency remained the same along the flow.
Resumo:
An algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer.
Resumo:
VHF nighttime scintillations, recorded during a high solar activity period at a meridian chain of stations covering a magnetic latitude belt of 3°–21°N (420 km subionospheric points) are analyzed to investigate the influence of equatorial spread F irregularities on the occurrence of scintillation at latitudes away from the equator. Observations show that saturated amplitude scintillations start abruptly about one and a half hours after ground sunset and their onset is almost simultaneous at stations whose subionospheric points are within 12°N latitude of the magnetic equator, but is delayed at a station whose subionospheric point is at 21°N magnetic latitude by 15 min to 4 hours. In addition, the occurrence of postsunset scintillations at all the stations is found to be conditional on their prior occurrence at the equatorial station. If no postsunset scintillation activity is seen at the equatorial station, no scintillations are seen at other stations also. The occurrence of scintillations is explained as caused by rising plasma bubbles and associated irregularities over the magnetic equator and the subsequent mapping of these irregularities down the magnetic field lines to the F region of higher latitudes through some instantaneous mechanism; and hence an equatorial control is established on the generation of postsunset scintillation-producing irregularities in the entire low-latitude belt.
Resumo:
An algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer.
Resumo:
Algorithms are described for the basic arithmetic operations and square rooting in a negative base. A new operation called polarization that reverses the sign of a number facilitates subtraction, using addition. Some special features of the negative-base arithmetic are also mentioned.
Resumo:
The Printed Circuit Board (PCB) layout design is one of the most important and time consuming phases during equipment design process in all electronic industries. This paper is concerned with the development and implementation of a computer aided PCB design package. A set of programs which operate on a description of the circuit supplied by the user in the form of a data file and subsequently design the layout of a double-sided PCB has been developed. The algorithms used for the design of the PCB optimise the board area and the length of copper tracks used for the interconnections. The output of the package is the layout drawing of the PCB, drawn on a CALCOMP hard copy plotter and a Tektronix 4012 storage graphics display terminal. The routing density (the board area required for one component) achieved by this package is typically 0.8 sq. inch per IC. The package is implemented on a DEC 1090 system in Pascal and FORTRAN and SIGN(1) graphics package is used for display generation.
Resumo:
An important question which has to be answered in evaluting the suitability of a microcomputer for a control application is the time it would take to execute the specified control algorithm. In this paper, we present a method of obtaining closed-form formulas to estimate this time. These formulas are applicable to control algorithms in which arithmetic operations and matrix manipulations dominate. The method does not require writing detailed programs for implementing the control algorithm. Using this method, the execution times of a variety of control algorithms on a range of 16-bit mini- and recently announced microcomputers are calculated. The formulas have been verified independently by an analysis program, which computes the execution time bounds of control algorithms coded in Pascal when they are run on a specified micro- or minicomputer.
Resumo:
The question of the existence or otherwise of an athermal temperature region of plastic flow in metals is examined. It is suggested that the athermal region is absent in metals with large dislocation densities. Such an explanation is provoked by a fairly recent proposition that the unzipping of attractive junctions is a plausible rate-controlling mechanism at high temperatures.