Sökning: "Bengt E. Jonsson"
Visar resultat 1 - 5 av 20 avhandlingar innehållade orden Bengt E. Jonsson.
1. Directed Evolution of Glutathione Transferases with Altered Substrate Selectivity Profiles : A Laboratory Evolution Study Shedding Light on the Multidimensional Nature of Epistasis
Sammanfattning : Directed evolution is generally regarded as a useful approach in protein engineering. By subjecting members of a mutant library to the power of Darwinian evolution, desired protein properties are obtained. Numerous reports have appeared in the literature showing the success of tailoring proteins for various applications by this method. LÄS MER
2. Implementation of Flash Analog-to-Digital Converters in Silicon-on-Insulator Technology
Sammanfattning : High speed analog-to-digital converters (ADCs) used in, e.g., read channel and ultra wideband (UWB) applications are often based on a flash topology. The read channel applications is the intended application of this work, where a part of the work covers the design of two different types of 6-bit flash ADCs. LÄS MER
3. Implementation of Flash Analog-to-Digital Converters in Silicon-on-Insulator CMOS Technology
Sammanfattning : A 130 nm partially depleted silicon-on-insulator (SOI) complementary metal oxide semiconductor (CMOS) technology is evaluated with respect to analog circuit implementation. We perform the evaluation through implementation of three flash analog-to-digital converters (ADCs). LÄS MER
4. Learning Component Behavior from Tests : Theory and Algorithms for Automata with Data
Sammanfattning : Formal models are often used to describe the behavior of a computer program or component. Behavioral models have many different usages, e.g., in model-based techniques for software development and verification,such as model checking and model based testing. LÄS MER
5. Regular model checking
Sammanfattning : We present regular model checking, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology. States are represented by strings over a finite alphabet and the transition relation by a regular length-preserving relation on strings. LÄS MER