• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1512
  • 722
  • 156
  • 125
  • 107
  • 38
  • 38
  • 32
  • 24
  • 16
  • 15
  • 13
  • 12
  • 12
  • 10
  • Tagged with
  • 3210
  • 488
  • 367
  • 347
  • 334
  • 263
  • 227
  • 199
  • 192
  • 188
  • 174
  • 167
  • 166
  • 161
  • 161
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
191

The dissection of the bovine growth hormone polyadenylation signal reveals a complex element within the 3' flanking sequence

Goodwin, Edward Culver January 1993 (has links)
No description available.
192

Determination of the Sequence Specificity and Protein Substrates of Protein Phosphatases

Luechapanichkul, Rinrada 25 September 2014 (has links)
No description available.
193

Mind the Gap: Influence of Filmic Strategies on the Architectural Sequence

Williams, Laura E. 09 August 2010 (has links)
No description available.
194

Miospore Biostratigraphy, Sequence Stratigraphy, and Glacio-Eustatic Response of the Borden Delta (Osagean; Tournaisian/Visean) of Kentucky and Indiana, U.S.A

Richardson, Jeffery G. 02 April 2003 (has links)
No description available.
195

Rearrangements of the Adenovirus Genome Induced by Embedded Inverted Terminal Repeat Sequences / Rearrangements of Adenovirus Genome

Lee, Frank 08 1900 (has links)
The adenovirus genome is a linear double stranded DNA molecule and the current widely accepted model of viral DNA replication proposes linear viral DNA intermediates at all stages of replication. Although the experimental evidence for this mechanism of replication is very strong, circular forms of adenovirus serotype 5 (Ad5) DNA molecules have also been detected in both permissive and non-permissive cell lines. In some experiments the circular structures were detected before the onset of viral DNA replication and thus suggested a possible role for circular forms of Ad5 DNA in the life cycle of the virus after infection. This study was undertaken to better understand the role of circular forms of the adenovirus genome in virus replication. The approach was to subclone the viral junction internally into the linear genome thus creating mutant viruses with embedded terminal sequences and to study the effect of such inserts on DNA structure. A total of five mutant viruses were constructed containing a variety of inserts and viral DNA from infected cells and banded viruses was analyzed by Southern Blot hybridization. The data clearly showed that embedded viral junctions have biological activity in that they generated novel, rear ranged viral DNA molecules, and that embedded single ITR sequences were also biologically active, but to a lesser extent. It was also observed that the copy numbers of the rearranged molecules were variable. It appeared that the embedded viral junction was active in recombination and replication of the viral genome, creating the rearrangements through these two processes. However, the results suggested that circular forms are not obligatory intermediates in DNA replication. The analysis of banded viral DNA in this study suggested that the encapsidation signal from the left end of the linear genome was required in cis for packaging of the viral genome, confirming previous results which identified an encapsidation signal for viral DNA packaging. The banding experiments also showed that truncated viral DNA molecules containing 75% of the viral genome were packaged. / Thesis / Master of Science (MS)
196

Sequence Alignments on a Multi-Transputer System

Qian, Zhiguang 09 1900 (has links)
This thesis is concentrated on parallelizing a sequential algorithm for finding k best non-intersecting local sequence alignments. In this thesis, the DNA local sequence alignment and the related problems are formally defined and efficient algorithms for solving these problems are presented. The problem have important applications in molecular biology. Based on the analysis of the characteristics of the local sequence alignment problem and a multi-transputer system, the problem was partitioned into subproblems and nicely mapped onto the transputer nodes. Then, an efficient parallel program is designed and implemented. By comparing the outputs of the sequential program and the parallel program, the performance of the parallel program is estimated. An average speedup of 6.3 is achieved on a 8-node configuration and an average speed-up of 11 is achieved on a 16-node configuration. / Thesis / Master of Engineering (ME)
197

An Urban Graduate Center

Ubben, Carolyn Wilson 22 October 1999 (has links)
The Urban Graduate Center is an academic village for graduate studies in an urban setting. The project seeks to establish a campus setting for students and professors who will primarily attend the Graduate Center on evenings and weekends. The Graduate Center seeks to extend the fabric of the existing urban area into an abandoned railroad yard site. The project involves a building complex the approximate size of a small city block. The building complex includes places for learning, places for meeting, and places for contemplation. The project offers the opportunity to investigate the process of designing architecture. While the project relates to needs of particular users the discoveries and methods of meeting these needs can be applied to many different forms of architecture. The various functions that will occur in the urban graduate center provide the chance to investigate issues of organization, scale, transitions, and details. / Master of Architecture
198

The Effects of Cueing Learners to a Transfer Problem Prior to Instruction

Pienkowski, Nathan 05 March 2002 (has links)
Prior research indicates that cueing or priming an individual prior to exposing them to a basic stimulus, either visual or verbal, will direct their perception and attention toward specific aspects of that stimulus. Furthermore, it suggests that those aspects of the stimulus that are attended or perceived may be related by the extent to which they afford the resolution of a problem, need, or state invoked by the cued phenomenon. The purpose of this study was to determine whether similar results would be found using content of a greater scale. In other words, the purpose was to determine whether the same cueing and priming results found using words and phrases would apply using entire instructional modules. Specifically, this study attempted to determine whether cuing individuals to an expected outcome performance prior to instruction would cause them to focus on those parts of the instruction needed to succeed on the outcome performance. It was hypothesized that prior cuing would result in superior performance on a transfer problem. Similarly, it was also hypothesized that, since the learner's attention would be directed toward specific parts of the instruction to the neglect of others, overall memory retention would be diminished for learners that were cued. To test these hypotheses, an experimental design was used with two overall groups: one receiving prior exposure to a transfer problem and one not. In addition, in order to avoid the possibility that any results could be generalized only to the subject matter being taught, two different subject domains were used: statistics and biology. Therefore, 115 undergraduate students were randomly assigned to one of four groups: (a) a statistics group receiving prior exposure to a transfer problem; (c) a statistics group without prior exposure to a transfer problem; (b) a biology group receiving prior exposure to a transfer problem; (d) a biology group without prior exposure to a transfer problem. Following instruction, each group received the transfer problem and recall test appropriate for the subject area covered during their instruction (statistics or biology). The resulting data was analyzed using two ANOVAs, one for retention and one for transfer. Neither ANOVA yielded significant results. Hence, the results reported in this study do not support either hypothesis. / Ph. D.
199

Segmenting, Summarizing and Predicting Data Sequences

Chen, Liangzhe 19 June 2018 (has links)
Temporal data is ubiquitous nowadays and can be easily found in many applications. Consider the extensively studied social media website Twitter. All the information can be associated with time stamps, and thus form different types of data sequences: a sequence of feature values of users who retweet a message, a sequence of tweets from a certain user, or a sequence of the evolving friendship networks. Mining these data sequences is an important task, which reveals patterns in the sequences, and it is a very challenging task as it usually requires different techniques for different sequences. The problem becomes even more complicated when the sequences are correlated. In this dissertation, we study the following two types of data sequences, and we show how to carefully exploit within-sequence and across-sequence correlations to develop more effective and scalable algorithms. 1. Multi-dimensional value sequences: We study sequences of multi-dimensional values, where each value is associated with a time stamp. Such value sequences arise in many domains such as epidemiology (medical records), social media (keyword trends), etc. Our goals are: for individual sequences, to find a segmentation of the sequence to capture where the pattern changes; for multiple correlated sequences, to use the correlations between sequences to further improve our segmentation; and to automatically find explanations of the segmentation results. 2. Social media post sequences: Driven by applications from popular social media websites such as Twitter and Weibo, we study the modeling of social media post sequences. Our goal is to understand how the posts (like tweets) are generated and how we can gain understanding of the users behind these posts. For individual social media post sequences, we study a prediction problem to find the users' latent state changes over the sequence. For dependent post sequences, we analyze the social influence among users, and how it affects users in generating posts and links. Our models and algorithms lead to useful discoveries, and they solve real problems in Epidemiology, Social Media and Critical Infrastructure Systems. Further, most of the algorithms and frameworks we propose can be extended to solve sequence mining problems in other domains as well. / Ph. D. / Temporal data is ubiquitous nowadays and can be easily found in many applications. Consider the extensively studied social media website Twitter. All the information can be associated with time stamps, and thus form different types of data sequences: a sequence of feature values of users who retweet a message, a sequence of tweets from a certain user, or a sequence of the evolving friendship networks. Mining these data sequences is an important task, which reveals patterns in the sequences, and helps downstream tasks like data compression and visualization. At the same time, it is a very challenging task as it usually requires different techniques for different sequences. The problem becomes even more complicated when the sequences are correlated. In this dissertation, we first study value sequences, where objects in the sequence are multidimensional data values, and move to text sequences, where each object in the sequence is a text document (like a tweet). For each of these data sequences, we study them either as independent individual sequences, or as a group of dependent sequences. We then show how to carefully exploit different types of correlations behind the sequences to develop more effective and scalable algorithms. Our models and algorithms lead to useful discoveries, and they solve real problems in Epidemiology, Social Media and Critical Infrastructure Systems. Further, most of the algorithms and frameworks we propose can be extended to solve sequence mining problems in other domains as well.
200

Marker extractions in DNA sequences using sub-sequence segmentation tree.

January 2005 (has links)
Hung Wah Johnson. / Thesis submitted in: August 2004. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 116-121). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Problem Statement --- p.3 / Chapter 1.3 --- Outline of the thesis --- p.6 / Chapter 2 --- Background --- p.8 / Chapter 2.1 --- Biological Background --- p.8 / Chapter 2.2 --- Sequence Alignments --- p.9 / Chapter 2.2.1 --- Pairwise Sequences Alignment --- p.11 / Chapter 2.2.2 --- Multiple Sequences Alignment --- p.15 / Chapter 2.3 --- Neighbor Joining Tree --- p.16 / Chapter 2.4 --- Marker Extractions --- p.18 / Chapter 2.5 --- Neural Network --- p.19 / Chapter 2.6 --- Conclusion --- p.22 / Chapter 3 --- Related Work --- p.23 / Chapter 3.1 --- FASTA --- p.23 / Chapter 3.2 --- Suffix Tree --- p.25 / Chapter 4 --- Sub-Sequence Segmentation Tree --- p.28 / Chapter 4.1 --- Introduction --- p.28 / Chapter 4.2 --- Problem Statement --- p.29 / Chapter 4.3 --- Design --- p.33 / Chapter 4.4 --- Time and space complexity analysis --- p.38 / Chapter 4.4.1 --- Performance Evaluation --- p.40 / Chapter 4.5 --- Summary --- p.48 / Chapter 5 --- Applications: Global Sequences Alignment --- p.51 / Chapter 5.1 --- Introduction --- p.51 / Chapter 5.2 --- Problem Statement --- p.53 / Chapter 5.3 --- Pairwise Alignment --- p.53 / Chapter 5.3.1 --- Algorithm --- p.53 / Chapter 5.3.2 --- Time and Space Complexity Analysis --- p.64 / Chapter 5.4 --- Multiple Sequences Alignment --- p.67 / Chapter 5.4.1 --- The Clustalw Algorithm --- p.68 / Chapter 5.4.2 --- MSA Using SSST --- p.70 / Chapter 5.4.3 --- Time and Space Complexity Analysis --- p.70 / Chapter 5.5 --- Experiments --- p.71 / Chapter 5.5.1 --- Experiment Setting --- p.72 / Chapter 5.5.2 --- Experimental Results --- p.72 / Chapter 5.6 --- Summary --- p.80 / Chapter 6 --- Applications: Marker Extractions --- p.81 / Chapter 6.1 --- Introduction --- p.81 / Chapter 6.2 --- Problem Statement --- p.82 / Chapter 6.3 --- The Multiple Sequence Alignment Approach --- p.85 / Chapter 6.3.1 --- Design --- p.85 / Chapter 6.4 --- Reference Sequence Alignment Approach --- p.88 / Chapter 6.4.1 --- Design --- p.90 / Chapter 6.5 --- Time and Space Complexity Analysis --- p.95 / Chapter 6.6 --- Experiments --- p.95 / Chapter 6.7 --- Summary --- p.99 / Chapter 7 --- HBV Application Framework --- p.101 / Chapter 7.1 --- Motivations --- p.101 / Chapter 7.2 --- The Procedure Flow of the Application --- p.102 / Chapter 7.2.1 --- Markers Extractions --- p.103 / Chapter 7.2.2 --- Rules Training and Prediction --- p.103 / Chapter 7.3 --- Results --- p.105 / Chapter 7.3.1 --- Clustering --- p.106 / Chapter 7.3.2 --- Classification --- p.107 / Chapter 7.4 --- Summary --- p.110 / Chapter 8 --- Conclusions --- p.112 / Chapter 8.1 --- Contributions --- p.112 / Chapter 8.2 --- Future Works --- p.114 / Chapter 8.2.1 --- HMM Learning --- p.114 / Chapter 8.2.2 --- Splice Sites Learning --- p.114 / Chapter 8.2.3 --- Faster Algorithm for Multiple Sequences Alignment --- p.115 / Bibliography --- p.121

Page generated in 0.0559 seconds