Relevant bibliographies by topics / Termination / Dissertations / Theses

Dissertations / Theses on the topic 'Termination'

To see the other types of publications on this topic, follow the link: Termination.
Author: Grafiati
Published: 4 June 2021
Last updated: 28 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Termination.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Rutter, Karen. "Termination." Master's thesis, University of Cape Town, 2008. http://hdl.handle.net/11427/11596.

Full text
Abstract:
Includes bibliographical references.
Termination is a genre novel which follows a contemporary crime fiction format. It adheres closely to the narrative shape of modem mystery books, containing the essential elements which constitute a work in this field. With a few twists. Contemporary crime fiction can follow a couple of paths along the way to solving a misdemeanour. Which is usually a murder. The protagonist is either on the spot and in the plot by virtue of his/her job. In other words, they could be a cop, forensic specialist, medical examiner, private investigator etc. Or they could be drawn reluctantly into a scenario, by circumstance or due to an over-developed sense of "doing the right thing."
APA, Harvard, Vancouver, ISO, and other styles
2

Cropper, Nick I. "Effective termination techniques." Thesis, University of St Andrews, 1997. http://hdl.handle.net/10023/13453.

Full text
Abstract:
An important property of term rewriting systems is termination: the guarantee that every rewrite sequence is finite. This thesis is concerned with orderings used for proving termination, in particular the Knuth-Bendix and polynomial orderings. First, two methods for generating termination orderings are enhanced. The Knuth-Bendix ordering algorithm incrementally generates numeric and symbolic constraints that are sufficient for the termination of the rewrite system being constructed. The KB ordering algorithm requires an efficient linear constraint solver that detects the nature of degeneracy in the solution space, and for this a revised method of complete description is presented that eliminates the space redundancy that crippled previous implementations. Polynomial orderings are more powerful than Knuth-Bendix orderings, but are usually much harder to generate. Rewrite systems consisting of only a handful of rules can overwhelm existing search techniques due to the combinatorial complexity. A genetic algorithm is applied with some success. Second, a subset of the family of polynomial orderings is analysed. The polynomial orderings on terms in two unary function symbols are fully resolved into simpler orderings. Thus it is shown that most of the complexity of polynomial orderings is redundant. The order type (logical invariant), either r or A (numeric invariant), and precedence is calculated for each polynomial ordering. The invariants correspond in a natural way to the parameters of the orderings, and so the tabulated results can be used to convert easily between polynomial orderings and more tangible orderings. The orderings of order type are two of the recursive path orderings. All of the other polynomial orderings are of order type w or w2 and each can be expressed as a lexicographic combination of r (weight), A (matrix), and lexicographic (dictionary) orderings. The thesis concludes by showing how the analysis extends to arbitrary monadic terms, and discussing possible developments for the future.
APA, Harvard, Vancouver, ISO, and other styles
3

Geser, Alfons [Verfasser]. "Relative termination / Alfons Geser." Ulm : Universität Ulm. Fakultät für Ingenieurwissenschaften und Informatik, 2012. http://d-nb.info/102529386X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wright, Joanna Jane. "Studies on transcriptional termination." Thesis, University of Edinburgh, 1987. http://hdl.handle.net/1842/11960.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kirtikar, Shantanu. "Termination of an axis." Thesis, Virginia Polytechnic Institute and State University, 1992. http://hdl.handle.net/10919/52120.

Full text
Abstract:
“Architecture does not exist, only the spirit of architecture exists. What has presence is a work of architecture which should be made in a way that is worthy of an offering to architecture.” Louis Kahn.
Master of Architecture
APA, Harvard, Vancouver, ISO, and other styles
6

Ottman, M. J., and B. R. Tickes. "Alfalfa Irrigation Termination, Yuma." College of Agriculture, University of Arizona (Tucson, AZ), 1994. http://hdl.handle.net/10150/201407.

Full text
Abstract:
Alfalfa irrigation is often withheld as a water conservation measure in Arizona. The objective of this research was to test the hypothesis that alfalfa yield and stand can be permanently damaged by withholding irrigation water. Irrigation was terminated during the summer (July through October) or winter (November through February) on a Superstition sand in Yuma. Summer irrigation termination reduced plant density from 4 to 1.5 plants per square foot and reduced hay yield from 0.76 to 0.27 tons per acre per cutting after irrigation was resumed. Winter irrigation termination had no residual effect on yield or plant density. Termination of alfalfa irrigation can permanently damage stands and reduce yield on sandy soil.
APA, Harvard, Vancouver, ISO, and other styles
7

Ottman, M. J., and R. L. Roth. "Alfalfa Irrigation Termination, Maricopa." College of Agriculture, University of Arizona (Tucson, AZ), 1994. http://hdl.handle.net/10150/201408.

Full text
Abstract:
Alfalfa irrigation is often withheld as a water conservation measure in Arizona. The objective of this research was to test the hypothesis that alfalfa can be permanently damaged by withholding irrigation water. Irrigation was terminated during the summer (July or August through September) or summer through winter (July or August through mid -March) on a Casa Grande sandy loam at Maricopa. Irrigation termination at Maricopa was not detrimental to stand although hay yields were depressed from 1.47 to 1.28 tons per acre following the second cycle of summer irrigation termination and from 1.57 to 1.23 tons per acre per cutting following summer through winter irrigation termination. Alfalfa water use was reduced by irrigation termination even after irrigation was resumed. Total nonstructural carbohydrates in the roots were never less than the control during irrigation termination but decreased relative to normally irrigated alfalfa when irrigation resumed.
APA, Harvard, Vancouver, ISO, and other styles
8

Woods-Henderson, Christine Ione. "An exploratory investigation of termination : the development of the counselor termination behavior inventory /." The Ohio State University, 1985. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487262825074848.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sakai, Masahiko. "CLASSES WHOSE TERMINATION IS DECIDABLE." INTELLIGENT MEDIA INTEGRATION NAGOYA UNIVERSITY / COE, 2006. http://hdl.handle.net/2237/10414.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Blidner, Aron. "Predicting termination from behavioral consultation." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=79287.

Full text
Abstract:
The main objective of this study was to investigate whether parental perceptions of the emotional, behavioral and social skills functioning of children with conduct problems, differed for parents who completed the behavioral consultation process (N = 40) compared to those who prematurely withdrew ( N = 11). A series of between group analyses were conducted to examine whether parental perceptions existed. Parents who prematurely withdrew from the behavioral consultation process reported significantly greater incidences of anxious and depressed behavior in children, than parents who remained in consultation F(1,49) = 4.24, p = .0448. Similarly, using the Wilks' criterion, overall estimates of emotional and behavioral functioning, combined with social skills functioning were also significantly affected by group membership, F(3,47) = 3.22, p = .0310. Using the same variables in a logistic regression analysis, a test of the full model with all three predictors compared to the constant only model was statistically reliable phi2 (3, N = 51) = 10.26, p = .0336, indicating that the predictors, as a set, reliably distinguished the perceptions of those who completed the consultation process, compared to those who prematurely withdrew. This model accurately predicted 77.7% of parents' group membership. The results of the study will be discussed in terms of their usefulness for future consultants to identify families at risk for prematurely withdrawing from the consultation process, so that additional resources can be offered to encourage their continued participation in the consultation process.
APA, Harvard, Vancouver, ISO, and other styles
11

Gale, Sarah Jane. "Band termination spectroscopy of '1'5'7Er." Thesis, University of Liverpool, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240568.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Chawdhary, Aziem A. "Proving termination using abstract interpretation." Thesis, Queen Mary, University of London, 2010. http://qmro.qmul.ac.uk/xmlui/handle/123456789/420.

Full text
Abstract:
One way to develop more robust software is to use formal program verification. Formal program verification requires the construction of a formal mathematical proof of the programs correctness. In the past ten years or so there has been much progress in the use of automated tools to formally prove properties of programs. However many such tools focus on proving safety properties: that something bad does not happen. Liveness properties, where we try to prove that something good will happen, have received much less attention. Program termination is an example of a liveness property. It has been known for a long time that to prove program termination we need to discover some function which maps program states to a well-founded set. Essentially we need to find one global argument for why the program terminates. Finding such an argument which overapproximates the entire program is very difficult. Recently, Podelski and Rybalchenko discovered a more compositional proof rule to find disjunctive termination arguments. Disjunctive termination arguments requires a series of termination arguments that individually may only cover part of the program but when put together give a reason for why the entire program will terminate. Thus we do not need to search for one overall reason for termination but we can break the problem down and focus on smaller parts of the program. This thesis develops a series of abstract interpreters for proving the termination of imperative programs. We make three contributions, each of which makes use of the Podelski-Rybalchenko result. Firstly we present a technique to re-use domains and operators from abstract interpreters for safety properties to produce termination analysers. This technique produces some very fast termination analysers, but is limited by the underlying safety domain used. We next take the natural step forward: we design an abstract domain for termination. This abstract domain is built from ranking functions: in essence the abstract domain only keeps track of the information necessary to prove program termination. However, the abstract domain is limited to proving termination for language with iteration. In order to handle recursion we use metric spaces to design an abstract domain which can handle recursion over the unit type. We define a framework for designing abstract interpreters for liveness properties such as termination. The use of metric spaces allows us to model the semantics of infinite computations for programs with recursion over the unit type so that we can design an abstract interpreter in a systematic manner. We have to ensure that the abstract interpreter is well-behaved with respect to the metric space semantics, and our framework gives a way to do this.
APA, Harvard, Vancouver, ISO, and other styles
13

Hunter, Richard E. Jr. "HIGH ALPHABET FLIGHT TERMINATION SYSTEM." International Foundation for Telemetering, 2001. http://hdl.handle.net/10150/607664.

Full text
Abstract:
International Telemetering Conference Proceedings / October 22-25, 2001 / Riviera Hotel and Convention Center, Las Vegas, Nevada
This paper proposes a modification of the high alphabet method of data transmission over an RF carrier. The system maps eleven characters into three tones. The three tones are Frequency Modulated onto an RF carrier. The 165 unique characters can be utilized for data transmission. The advantages of this system are: 1. Longer duration data words which have narrow bandwidth yielding a high signal to noise ratio. 2. Digital Signal Processing can be utilized to reconstruct characters from the tri-tone encoding. 3. The system will be less susceptible to external interference than normal Frequency Shift Keying system. The majority of the three tone burst would have to masked in order to loose a data word.
APA, Harvard, Vancouver, ISO, and other styles
14

Ly, Kim Quyen. "Automated verification of termination certificates." Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM036/document.

Full text
Abstract:
S'assurer qu'un programme informatique se comporte bien, surtout dans des applications critiques (santé, transport, énergie, communications, etc.) est de plus en plus important car les ordinateurs et programmes informatiques sont de plus en plus omniprésents, voir essentiel au bon fonctionnement de la société. Mais comment vérifier qu'un programme se comporte comme prévu, quand les informations qu'il prend en entrée sont de très grande taille, voire de taille non bornée a priori ? Pour exprimer avec exactitude ce qu'est le comportement d'un programme, il est d'abord nécessaire d'utiliser un langage logique formel. Cependant, comme l'a montré Gödel dans, dans tout système formel suffisamment riche pour faire de l'arithmétique, il y a des formules valides qui ne peuvent pas être prouvées. Donc il n'y a pas de programme qui puisse décider si toute propriété est vraie ou fausse. Cependant, il est possible d'écrire un programme qui puisse vérifier la correction d'une preuve. Ce travail utilisera justement un tel programme, Coq, pour formellement vérifier la correction d'un certain programme. Dans cette thèse, nous expliquons le développement d'une nouvelle version de Rainbow, plus rapide et plus sûre, basée sur le mécanisme d'extraction de Coq. La version précédente de Rainbow vérifiait un certificat en deux étapes. Premièrement, elle utilisait un programme OCaml non certifié pour traduire un fichier CPF en un script Coq, en utilisant la bibliothèque Coq sur la théorie de la réécriture et la terminaison appelée CoLoR. Deuxièmement, elle appelait Coq pour vérifier la correction du script ainsi généré. Cette approche est intéressante car elle fournit un moyen de réutiliser dans Coq des preuves de terminaison générée par des outils extérieurs à Coq. C'est également l'approche suivie par CiME3. Mais cette approche a aussi plusieurs désavantages. Premièrement, comme dans Coq les fonctions sont interprétées, les calculs sont beaucoup plus lents qu'avec un langage où les programmes sont compilés vers du code binaire exécutable. Deuxièmement, la traduction de CPF dans Coq peut être erronée et conduire au rejet de certificats valides ou à l'acceptation de certificats invalides. Pour résoudre ce deuxième problème, il est nécessaire de définir et prouver formellement la correction de la fonction vérifiant si un certificat est valide ou non. Et pour résoudre le premier problème, il est nécessaire de compiler cette fonction vers du code binaire exécutable. Cette thèse montre comment résoudre ces deux problèmes en utilisant l'assistant à la preuve Coq et son mécanisme d'extraction vers le langage de programmation OCaml. En effet, les structures de données et fonctions définies dans Coq peuvent être traduits dans OCaml et compilées en code binaire exécutable par le compilateur OCaml. Une approche similaire est suivie par CeTA en utilisant l'assistant à la preuve Isabelle et le langage Haskell
Making sure that a computer program behaves as expected, especially in critical applications (health, transport, energy, communications, etc.), is more and more important, all the more so since computer programs become more and more ubiquitous and essential to the functioning of modern societies. But how to check that a program behaves as expected, in particular when the range of its inputs is very large or potentially infinite? In this work, we explain the development of a new, faster and formally proved version of Rainbow based on the extraction mechanism of Coq. The previous version of Rainbow verified a CPF le in two steps. First, it used a non-certified OCaml program to translate a CPF file into a Coq script, using the Coq libraries on rewriting theory and termination CoLoR and Coccinelle. Second, it called Coq to check the correctness of the script. This approach is interesting for it provides a way to reuse in Coq termination proofs generated by external tools. This is also the approach followed by CiME3. However, it suffers from a number of deficiencies. First, because in Coq functions are interpreted, computation is much slower than with programs written in a standard programming language and compiled into binary code. Second, because the translation from CPF to Coq is not certified, it may contain errors and either lead to the rejection of valid certificates, or to the acceptance of wrong certificates. To solve the latter problem, one needs to define and formally prove the correctness of a function checking whether a certificate is valid or not. To solve the former problem, one needs to compile this function to binary code. The present work shows how to solve these two problems by using the proof assistant Coq and its extraction mechanism to the programming language OCaml. Indeed, data structures and functions de fined in Coq can be translated to OCaml and then compiled to binary code by using the OCaml compiler. A similar approach was first initiated in CeTA using the Isabelle proof assistant
APA, Harvard, Vancouver, ISO, and other styles
15

Reynolds, David Jerome. "PREMATURE TERMINATION: THE PATIENT'S PERSPECTIVE." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin992364526.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Bilka, Monica Nicole. "The Klamath's path after termination." [Missoula, Mont.] : The University of Montana, 2008. http://etd.lib.umt.edu/theses/available/etd-12312008-141310/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Reynolds, David J. "Premature termination the patient's perspective /." Cincinnati, Ohio : University of Cincinnati, 2001. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=ucin992364526.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Boyd, Nichole M. "Menominee Identity Maintenance Through Termination." OpenSIUC, 2012. https://opensiuc.lib.siu.edu/theses/899.

Full text
Abstract:
Historically, the Menominee Indian Tribe of Wisconsin has rested their identity on tribalism, self-determination, and connection to their land. Much of their history has been about their fight to maintain their identity as a people through struggling against the US government over land control through the various termination and restoration periods. As the Menominee tried to maintain their traditional ways, they often found themselves in conflict with mainstream values and culture. This paper discusses their history through the role of identity. Many Menominee found themselves becoming bicultural as a way to balance life both inside and outside of their indigenous culture.
APA, Harvard, Vancouver, ISO, and other styles
19

Caley, Clare Yvonne. "Termination of grain growth in cereals." Thesis, University of Edinburgh, 1987. http://hdl.handle.net/1842/27746.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Lee, Rodney. "Achieving voluntary termination, the principal's perspective." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq39613.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Bajema, Clifford Earl. "Treatment termination decisions euthanasia or benemortasia /." Theological Research Exchange Network (TREN), 1985. http://www.tren.com.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Preston, Matthew. "Rhodesia, Lebanon and civil war termination." Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368655.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Marnette, Bruno. "Tractable schema mappings under oblivious termination." Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.533832.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Taylor, Bradly S. "Counter leadership targeting and conflict termination." Thesis, Monterey, California: Naval Postgraduate School, 1999. http://hdl.handle.net/10945/13564.

Full text
Abstract:
The question of targeting opponent leadership historically has focused on tactical and moral/legal issues. Can the leader be found? And, is it legal and ethical to attack the leader? Analysis rarely has been conducted to determine whether the targeted organization is vulnerable to Counter Leadership Targeting (CLT) or what effect the CLT is intended to accomplish. Organizations vary in their vulnerability to CLT. Conversely, every CLT differs in its collateral effects or unintended consequences. This hampers the targeting organization's ability to leverage the CLT's results. The failure to systematically analyze CLT's effects on the targeted and targeting organizations has resulted in confused policy and failed CLT attempts. This thesis explores the effects of Counter Leadership Targeting on conflict termination. Organizational theory is used to develop a model of structural and psychological variables that can be applied to the analysis of a broad range of state and sub- state systems to determine the vulnerability of a specific organization to CLT. The thesis concludes that future threats to U.S. interests may have organizational characteristics that are conducive to CLT. Thus, the strategy may facilitate conflict termination, but, due to the volatile nature of CLT, it should be deliberately incorporated into a campaign plan only after careful, systematic analysis of the target organization. Initiating such a strategy without systematic analysis could lead to an overly risky venture with potentially high negative effects.
APA, Harvard, Vancouver, ISO, and other styles
25

Hathaway, Graham Michael. "High temperature superconducting power cable termination." Thesis, University of Southampton, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301206.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Wu, Alexander. "Automated termination proofs using Walther recursion." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/35388.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
Includes bibliographical references (leaves 63-64).
by Alexander Wu.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
27

Dicken, L. W., and K. Jenkins. "Pulse Code Modulated Flight Termination Receiver." International Foundation for Telemetering, 1995. http://hdl.handle.net/10150/611593.

Full text
Abstract:
International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, Nevada
Flight Termination is a control action that takes place when missiles or targets violate estabished safety criteria. The flight termination receiver, part of a ground to air control loop, is characterised by high system integrity and dedication to recovering and decoding the command signals. The paper describes the factors that have influenced the design and build of a robust Pulse Code Modulation Flight Termination Receiver for use on UK Trial Ranges. This work has been carried out with the support of UK MoD(PE), A ARM 51, on contract number A ARM 13b/224.
APA, Harvard, Vancouver, ISO, and other styles
28

Motshegwa, Tshiamo. "Distributed termination detection for multiagent protocols." Thesis, City, University of London, 2009. http://openaccess.city.ac.uk/19754/.

Full text
Abstract:
The research conducted in this thesis is on distributed termination detection in multiagent systems. Agents engage in complex interactions by executing behaviour specifications in the form of protocols. This work presents and experiments with a framework for making termination in a multiagent system explicit. As a side effect, the mechanism can be exploited to aid management of agent interactions, by providing visibility of the interaction process and can be extended to drive multiagent system management tasks such as timely garbage collection. Results from previous attempts to deploy agents systems when scaling up, e.g. Agentcities, have shown and exposed a big gap between theory and practice especially in the reliability and availability of deployed systems. In particular more work needs to be done in the area of supporting agent infrastructures as much as in theoretical agent foundations. There are two aspects to this problem of termination detection in multiagent systems, firstly, the formal verification of behaviour at compile-time and secondly, monitoring and control at run-time. Regarding the former, there has been some work on the ver- 13 ification of agent communication languages. But overall verification is difficult and often requires knowledge of internal states of agents at compile time, and as yet has not been satisfactorily solved to be deployed in real systems. The second, the runtime approach is adopted in here. The research is not about protocol engineering but assumes correct protocols, and protocol specifications to be finite state machine graphs. Given these correct verified protocols, the thesis proposes a number of definitions culminating in identification of minimal information in the form of sub-protocols that agents being autonomous, can make available for the termination detection. An off line procedure for deriving these sub-protocols is then presented. The thesis then considers a termination detection model, and within this model, proposes an conversationmodel encompassing protocol executions, with hierarchical conversations modelled as diffusing computation trees and defines a number of predicates to derive termination in centralised and distributed environments. Algorithms that implement these predicates are sketched and some complexity analysis is performed. The thesis then considers a prototype implementation evaluated over some defined detection delays metric. The evaluation approach is heavily empirical, with an experimental approach adopted to evaluate various configurations of the termination detection mechanism. The evaluation employs robust resampling and bootstrapping methods to analyse and obtain distributions and confidence intervals of the detection delays metric for the termination detection mechanism.
APA, Harvard, Vancouver, ISO, and other styles
29

White, Eleanor. "Transcription termination by RNA polymerase II." Thesis, University of Oxford, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558432.

Full text
Abstract:
RNA Polymerase II (Pol I1) is responsible for the transcription of all protein-encoding genes. Pol II termination is dependent on RNA processing signals (both terminal intron splice sites, and cleavage and polyadenylation signals) as well as specific terminator elements located downstream of the poly(A) site. Detailed analysis of the human ~- globin gene terminator has shown that it contains a sequence-specific region that promotes rapid Co-Transcriptional Cleavage (CoTC) of the nascent transcript - an essential but not well understood step in the human ~-globin gene termination process. In the first part of this thesis, the role of sequences within this CoTC-mediated terminator element in the termination process is investigated. Analysis of mutant terminator sequences indicate that homopolymer A tracts are important for Pol II termination. The second part of this study focuses on identifying the activity responsible for CoTC, by using the yeast S. pombe as a tool for genetic analysis. The results indicate that the human ~-globin gene terminator is inefficient in S. pombe, suggesting that a mammalian specific factor(s) are required. In the final part of this study, I describe an investigation into the possibility that the exosome subunit Dis3 or the RNase III enzyme Dicer are involved in CoTC mediated transcription termination. While Dis3 is not involved in the CoTC process my results on Dicer may imply a significant role. Lastly, I present a preliminary investigation into the effect of pre-mRNA processing and the carboxyl terminal domain (CTD) of Po 1 II on CoTC activity.
APA, Harvard, Vancouver, ISO, and other styles
30

Kallmeyer, Adam K. "Regulatory mechanisms of eukaryotic translation termination." Thesis, Birmingham, Ala. : University of Alabama at Birmingham, 2007. https://www.mhsl.uab.edu/dt/2009r/kallmeyer.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Farr, C. R. "Irrigation Termination Effect on Upland Cotton." College of Agriculture, University of Arizona (Tucson, AZ), 1985. http://hdl.handle.net/10150/204076.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Candelli, Tito. "Genomewide analysis of road-block termination." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS587/document.

Full text
Abstract:
La transcription de l’ADN en ARN constitue la première étape de l’expression d’un gène. Durant les dix dernières années, plusieurs études ont montré qu’environ 80-90% du génome est transcrit et que la transcription peut démarrer presque partout. Ce phénomène, connu sous le nom de transcription envahissante, représente une menace sérieuse contre l’expression correcte du génome car il peut interférer non seulement avec d’autres évènements de transcription mais également avec n’importe quel procédé impliquant l’ADN. Une terminaison sélective est donc un mécanisme de la plus haute importance pour la stabilité du génome et la correcte régulation de l’expression des gènes. Ici nous décrivons la terminaison road-block, un nouveau mécanisme de la terminaison par l’ARN polymerase II, qui a pour fonction de limiter la transcription envahissante et de limiter les conséquences d’une translecture au niveau des sites de terminaison canoniques de S.cerevisiae. Nous démontrons également que plusieurs facteurs de transcription peuvent entrainer cette terminaison et que certains sites génomiques y sont associés. De plus, nous explorons également la possibilité que ces terminaisons road-block puissent contribuer à rendre spécifiques les origines de réplication
Transcription of DNA into RNA intermediates constitutes the first step in gene expression. During the last decade, several studies showed that about 80-90% of the genome is transcribed, and that transcription can initiate almost anywhere. This process—known as pervasive transcription—represents a serious threat to proper gene expression as it has the potential to interfere with not only other transcription events, but any DNA-based process. Selective transcription termination is therefore a mechanism of paramount importance for genome transcriptome stability and correct regulation of gene expression. Here we describe road-block termination, a novel termination mechanism for RNA polymerase II that functions to limit pervasive transcription and buffer the consequences of readthrough transcription at canonical terminators in S.cerevisiae. We show that several transcription factors can elicit this termination and that a number of unexpected genomic loci are associated with it. Additionally, we explore the possibility that road-block termination might contribute to specification of replication origins
APA, Harvard, Vancouver, ISO, and other styles
33

Bungert, Michael. "Termination of price wars : a signaling approach /." Wiesbaden : Dt. Univ.-Verl, 2003. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=015189963&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Wolborski, Maciej. "Termination and passivation of Silicon Carbide Devices." Licentiate thesis, KTH, Microelectronics and Information Technology, IMIT, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-439.

Full text
Abstract:

Silicon carbide rectifiers are commercially available since 2001, and MESFET switches are expected to enter the market within a year. Moreover, three inch SiC wafers can be purchased nowadays without critical defects for the device performance and four inch substrate wafers are announced for the year 2005. Despite this tremendous development in SiC technology, the reliability issues like device degradation or high channel mobility still remain to be solved.

This thesis focuses on SiC surface passivation and termination, a topic which is very important for the utilisation of the full potential of this semiconductor. Three dielectrics with high dielectric constants, Al2O3, AlN and TiO2, were deposited on SiC with different techniques. The structural and electrical properties of the dielectrics were measured and the best insulating layers were then deposited on fully processed and well characterised 1.2 kV 4H SiC PiN diodes. For the best Al2O3 layers, the leakage current was reduced to half its value and the breakdown voltage was extended by 0.5 kV, reaching 1.6 kV, compared to non passivated devices.

As important as the proper choice of dielectric material is a proper surface preparation prior to deposition of the insulator. In the thesis two surface treatments were tested, a standard HF termination used in silicon technology and an exposure to UV light from a mercury lamp. The second technique is highly interesting since a substantial improvement was observed when UV light was used prior to the dielectric deposition. Moreover, UV light stabilized the surface and reduced the leakage current by a factor of 100 for SiC devices after 10 Mrad γ ray exposition. The experiments indicate also that the measured leakage currents of the order of pA are dominated by surface leakage.

APA, Harvard, Vancouver, ISO, and other styles
35

Vroon, Daron. "Automatically Proving the Termination of Functional Programs." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19734.

Full text
Abstract:
Establishing the termination of programs is a fundamental problem in the field of software verification. For transformational programs, termination is used to extend partial correctness to total correctness. For reactive systems, termination reasoning is used to establish liveness properties. In the context of theorem proving, termination is used to establish the consistency of definitional axioms and to automate proofs by induction. Of course, termination is an undecidable problem, as Turing himself proved. However, the question remains: how automatic can a general termination analysis be in practice? In this dissertation, we develop two new general frameworks for reasoning about termination and demonstrate their effectiveness in automating the task of proving termination in the domain of applicative first-order functional languages. The foundation of the first framework is the development of the first known complete set of algorithms for ordinal arithmetic over an ordinal notation. We provide algorithms for ordinal ordering ($<$), addition, subtraction, multiplication, and exponentiation on the ordinals up to epsilon-naught. We prove correctness and complexity results for each algorithm. We also create a library for automating arithmetic reasoning over epsilon-naught in the ACL2 theorem proving system. This ordinal library enables new termination proofs that were previously not possible in previous versions of ACL2. The foundation of the second framework is an algorithm for fully automating termination reasoning with no user assistance. This algorithm uses a combination of theorem proving and static analysis to create a Calling Context Graph (CCG), a novel abstraction that captures the looping behavior of the program. Calling Context Measures (CCMs) are then used to prove that no infinite path through the CCG can be an actual computation of the program. We implement this algorithm in the ACL2, and empirically evaluate its effectiveness on the regression suite, a collection of over 11,000 user-defined functions from a wide variety of applications.
APA, Harvard, Vancouver, ISO, and other styles
36

Lee, Wen-shin. "Early Termination Strategies in Sparse Interpolation Algorithms." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20011106-101821.

Full text
Abstract:

A black box polynomial is an object that takes as input a valuefor each variable and evaluates the polynomial at the given input.The process of determining the coefficients and terms of a blackbox polynomial is the problem of black box polynomialinterpolation. Two major approaches have been addressing suchpurpose: the dense algorithms whose computational complexities aresensitive to the degree of the target polynomial, and the sparsealgorithms that take advantage of the situation when the number ofnon-zero terms in a designate basis is small. In this dissertationwe cover power, Chebyshev, and Pochhammer term bases. However, asparse algorithm is less efficient when the target polynomial isdense, and both approaches require as input an upper bound oneither the degree or the number of non-zero terms. By introducingrandomization into existing algorithms, we demonstrate and developa probabilistic approach which we call "early termination." Inparticular we prove that with high probability of correctness theearly termination strategy makes different polynomialinterpolation algorithms "smart" by adapting to the degree or tothe number of non-zero terms during the process when either is notsupplied as an input. Based on the early termination strategy, wedescribe new efficient univariate algorithms that race a denseagainst a sparse interpolation algorithm in order to exploit thesuperiority of one of them. We apply these racing algorithms asthe univariate interpolation procedure needed in Zippel'smultivariate sparse interpolation method. We enhance the earlytermination approach with thresholds, and present insights toother such heuristic improvements. Some potential of the earlytermination strategy is observed for computing a sparse shift,where a polynomial becomes sparse through shifting the variablesby a constant.

APA, Harvard, Vancouver, ISO, and other styles
37

Wolborski, Maciej. "Termination and passivation af silicon carbide devices /." Stockholm, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-439.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Weinberg, Daniela [Verfasser]. "Deciding Service Substitution - Termination guaranteed / Daniela Weinberg." München : Verlag Dr. Hut, 2012. http://d-nb.info/1029399352/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Sereni, Damien. "Termination analysis of higher-order functional programs." Thesis, University of Oxford, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.437001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Solscheid, Claudia. "Regulation of translation termination in Saccharomyces cerevisiae." Thesis, University of Kent, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.587517.

Full text
Abstract:
Maintaining the correct balance of the various proteins found within a cell is a major process. Many factors come together during gene expression to transcribe a gene into mRNA and translate this transcript into a polypeptide chain. These processes are themselves formed of many stages, each of which provides points for a cell to ensure accuracy and adjust the amount of a certain protein. At the end of translation, the eukaryotic release factors eRF1 and eRF3 interact to release the nascent polypeptide chain from the ribosome. The main question remaining to be answered is how release factor levels, and with them termination accuracy, are regulated in Saccharomyces cerevisiae. This study focused on transcription and translational, as well as post translational events, as possible points of regulation. Our findings suggest that there is no feedback mechanism at either transcription or translation level which allows a cell to sense and adjust cellular levels of either of the . release factors. Although both eRF1 and eRF3 were found to be highly stable under non- stress conditions, microscopy studies highlighted the possible involvement of the yeast vacuole in regulating translation factor abundance during environmental stress. While no significant level changes were observed for the class one release factor eRF1 and several elongation factors, eRF3 levels were found to increase in protease deletion strains. Levels of the release factor were furthermore affected by deletions of the N-terminus in part or as a whole, though no connection was found linking the N-terminal region of eRF3 and the vacuole to one another in regulating cellular levels of the release factor. Moreover, this study highlighted that release factor levels, their ratio to one another and other factors involved in translation, are inextricably linked to termination accuracy. Data produced by this investigation suggests that eRF3 levels and activity are affected by a network of other factors. In specific, data presented here support studies published by other Laboratories reporting a functional interaction between eRF3 and the nucleotide exchange factor eEF1B and suggest that eRF1 might act as TDI for eRF3, as seen in mammalian cells.
APA, Harvard, Vancouver, ISO, and other styles
41

Fragkiadaki, Evangelia. "Loss separation termination : a portfolio on endings." Thesis, City University London, 2008. http://openaccess.city.ac.uk/8597/.

Full text
Abstract:
This paper aims to explore gender differences in reactions to romantic relationship dissolutions. Within the body of research on relationship breakups, attachment theory is frequently mentioned. Empirical data on adult attachment styles and how they relate to gender differences and reactions to separations will also be explored. The issue of gender is prevalent in psychological literature. Such classification regarding reactions to relationship breakups is ambiguous and research should turn to individuals and relationships when exploring breakups.
APA, Harvard, Vancouver, ISO, and other styles
42

Choi, Wai-yik, and 蔡位奕. "Termination of property managers by owners corporations." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/196056.

Full text
Abstract:
There were many termination cases of Property Managers by Owners ‘Corporations in Hong Kong. The so-called IO has the absolute power to appoint a building manager to manage their housing estate, factory or commercial building, etc. Previous studies are focused the conflicts, service quality and the DMC clauses to discuss the main reasons of termination. Conflicts has been arisen by many reasons, most likely are produced by property managers and developer by their management and staff performance, yet, the writer would like to find out any other reasons from the view of customer. Customers have various opinions for the service, how can the property managers find a way to maintain the management agreement and to get the satisfaction of owners? The goal of the study is to find out the main reason of the termination of the contract of a property management company, and what the committee members of owners ‘corporation expect the property managers to perform their job. The writer would consolidate the previous finding from the scholars and students who studied in customer relationship and service quality, and the topics of conflicts between the property managers and owners corporation. The writer would suggest some ideas to help the Property Managers to have a better working strategy when facing Owners’ Corporation.
published_or_final_version
Housing Management
Master
Master of Housing Management
APA, Harvard, Vancouver, ISO, and other styles
43

Mohamed, Hanan A. "Termination and applications of term rewriting systems." Thesis, University of Manchester, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.257312.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Moore, Andrew. "Mechanisms of chain termination in polyketide biosynthesis." Thesis, University of Cambridge, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.612033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Petry, Sabine. "Structural studies of the termination of translation." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.613178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Durant, Kevin. "Investigating the non-termination of affine loops." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/80052.

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2013.
ENGLISH ABSTRACT: The search for non-terminating paths within a program is a crucial part of software verification, as the detection of anfinite path is often the only manner of falsifying program termination - the failure of a termination prover to verify termination does not necessarily imply that a program is non-terminating. This document describes the development and implementation of two focussed techniques for investigating the non-termination of affine loops. The developed techniques depend on the known non-termination concepts of recurrent sets and Jordan matrix decomposition respectively, and imply the decidability of single-variable and cyclic affine loops. Furthermore, the techniques prove to be practically capable methods for both the location of non-terminating paths, as well as the generation of preconditions for non-termination.
AFRIKAANSE OPSOMMING: Sagtewareveri kasie vereis of die bewys van die beeindiging van 'n program, of die deteksie van oneindige uitvoerings. In hierdie tesis ontwikkel en implementeer ons twee tegnieke om oor die oneindige eienskap van a ene lusse te beslis. Die tegnieke wat ontwikkel word is gebaseer op konsepte soos Jordan matriksdekomposisie en herhaalde groepe wat al in die verlede gebruik is om die beeindiging van lusse te ondersoek. Die tegnieke kan gebruik word om die uitvoerbaarheid van beide een-veranderlike en sikliese a ene lusse te bepaal. Feitlik alle nie-eindige a ene lusse kan ge denti seer word en die toestande waaronder hierdie oneindige eienskap verskyn kan beskryf word.
APA, Harvard, Vancouver, ISO, and other styles
47

McAndrews, Thomas J. III. "ENHANCED FLIGHT TERMINATION SYSTEM PROGRAM - PART TWO." International Foundation for Telemetering, 2002. http://hdl.handle.net/10150/607523.

Full text
Abstract:
International Telemetering Conference Proceedings / October 21, 2002 / Town & Country Hotel and Conference Center, San Diego, California
The Air Force Flight Test Center in association with the Range Commanders Council (RCC) Range Safety Group is conducting a program that will explore the next generation of ground-based flight termination technology, known as the Enhanced Flight Termination System (EFTS) program. The first part of the program was successfully concluded in May 2002. The Government is leading this program with support from contractors, academia, and other RCC groups including the Telemetry Group, Frequency Management Group, and Telecommunications and Timing Group. Additionally, the National Security Agency is providing key support along with vendors who design, build and test range safety systems. This paper will discuss details of the design validation and development phases (part two) of the EFTS program. Redesign of flight termination receivers and ground system modification plans will be discussed as well as flight and ground hardware testing objectives.
APA, Harvard, Vancouver, ISO, and other styles
48

Arce, Dennis. "FLIGHT TERMINATION COMMAND AUTHENTICATION USING BLOCK ENCRYPTION." International Foundation for Telemetering, 2002. http://hdl.handle.net/10150/607528.

Full text
Abstract:
International Telemetering Conference Proceedings / October 21, 2002 / Town & Country Hotel and Conference Center, San Diego, California
Next generation flight termination systems (FTSs) will use digital technologies to verify the authenticity of range safety commands by command receiver-decoders located on each vehicle. This paper will discuss the general principles behind simplex message authentication using a block encryption cipher, and presents examples for demonstration.
APA, Harvard, Vancouver, ISO, and other styles
49

Koontz, Rollin H., and Daryl C. Hatfield. "AMRAAM FLIGHT TERMINATION ANTENNA DESIGN AND DEVELOPMENT." International Foundation for Telemetering, 1990. http://hdl.handle.net/10150/613423.

Full text
Abstract:
International Telemetering Conference Proceedings / October 29-November 02, 1990 / Riviera Hotel and Convention Center, Las Vegas, Nevada
This paper reports on the design of a B-band flight termination antenna (FTA) for use on the Advanced Medium Range Air to Air Missile (AMRAAM). The antenna is a low profile structure composed of an etched circuit board measuring 1.6 by 10.0 by 0.010 inches mounted inside a 0.17 inch deep cavity formed in the back of the AMRAAM harness cover. There is a metallic cover over the cavity which connects to the metalized harness cover constituting a ground plane for the antenna. The antenna is easily tuned through use of two metallic slugs in close proximity to the ends of the antenna elements. The active circuit of the antenna is composed of a 3-element folded dipole photoetched from copper clad Duroid. The center element is driven through a microstrip matching transformer which is printed on the opposite side of the antenna elements. A quarter wave open circuited stub is also printed opposite the elements to provide a virtual short such that no physical contacts are necessary between the transformer and the driven element. The matching transformer connects to the 50 ohm source at the center of the antenna through a side projecting microstrip tab which in turn is connected to a semi-rigid coaxial line. The antenna exhibits improved bandwidth and excellent pattern coverage, particularly in the critical roll plane. All of the antenna parameters will be presented and discussed.
APA, Harvard, Vancouver, ISO, and other styles
50

Nimkar, K. N. "Methods for proving non-termination of programs." Thesis, University College London (University of London), 2015. http://discovery.ucl.ac.uk/1469424/.

Full text
Abstract:
The search for reliable and scalable automated methods for finding counterexamples to termination or alternatively proving non-termination is still widely open. The thesis studies the problem of proving non-termination of programs and presents new methods for the same. It also provides a thorough comparison of new methods along with the previous methods. In the first method, we show how the problem of non-termination proving can be reduced to a question of underapproximation search guided by a safety prover. This reduction leads to new non-termination proving implementation strategies based on existing tools for safety proving. Furthermore, our approach leads to easy support for programs with unbounded non-determinism. In the second method, we show how Max-SMT-based invariant generation can be exploited for proving non-termination of programs. The construction of the proof of non-termination is guided by the generation of quasi-invariants - properties such that if they hold at a location during execution once, then they will continue to hold at that location from then onwards. The check that quasi-invariants can indeed be reached is then performed separately. Our technique produces more generic witnesses of non-termination than existing methods. Moreover, it can handle programs with unbounded non-determinism and is more likely to converge than previous approaches. When proving non-termination using known techniques, abstractions that overapproximate the program's transition relation are unsound. In the third method, we introduce live abstractions, a natural class of abstractions that can be combined with the concept of closed recurrence sets to soundly prove non-termination. To demonstrate the practical usefulness of this new approach we show how programs with non-linear, non-deterministic, and heap-based commands can be shown non-terminating using linear overapproximations. All three methods introduced in this thesis have been implemented in different tools. We also provide experimental results which show great performance improvements over existing methods.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Termination' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography