Sökning: "shuffle"

Visar resultat 1 - 5 av 11 avhandlingar innehållade ordet shuffle.

1. 1. Complexities of Order-Related Formal Language Extensions

   Författare :Martin Berglund; Frank Drewes; Henrik Björklund; Markus Holzer; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; complexity; automata; languages; order; shuffle; regular expressions; context-free; mildly context-sensitive; parsing; membership; algorithm analysis; Computer Science; datalogi;

   Sammanfattning : The work presented in this thesis discusses various formal language formalisms that extend classical formalisms like regular expressions and context-free grammars with additional abilities, most relating to order. This is done while focusing on the impact these extensions have on the efficiency of parsing the languages generated. LÄS MER

3. 2. Complexities of Parsing in the Presence of Reordering

   Författare :Martin Berglund; Frank Drewes; Bruce Watson; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; parsing; membership problems; complexity theory; reordering; shuffle; mildly context-sensitive; formal languages; Computer Science; datalogi;

   Sammanfattning : The work presented in this thesis discusses various formalisms for representing the addition of order-controlling and order-relaxing mechanisms to existing formal language models. An immediate example is shuffle expressions, which can represent not only all regular languages (a regular expression is a shuffle expression), but also features additional operations that generate arbitrary interleavings of its argument strings. LÄS MER

4. 3. Some aspects of cryptographic protocols : with applications in electronic voting and digital watermarking

   Författare :Björn Terelius; Douglas Wikström; Helger Lipmaa; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : Cryptographic protocols are widely used on the internet, from relatively simple tasks such as key-agreement and authentication to much more complex problems like digital cash and electronic voting. Electronic voting in particular is a problem we investigate in this thesis. LÄS MER

5. 4. Structural algorithms and perturbations in differential-algebraic equations

   Författare :Henrik Tidefelt; Torkel Glad; Mats Jirstrand; Linköpings universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; differential-algebraic equations; index reduction; singular perturbation; Automatic control; Reglerteknik;

   Sammanfattning : Den kvasilinjära formen av differential-algebraiska ekvationer är både en mycket allmängiltig generalisering av den linjära tidsinvarianta formen, och en form som visar sig lämpa sig väl för indexreduktionsmetoder som vi hoppas ska komma att bli både praktiskt tillämpbara och väl förstådda i framtiden.Kuperingsalgoritmen (engelska: the shuffle algorithm) användes ursprungligen för att bestämma konsistenta initialvillkor för linjära tidsinvarianta differential-algebraiska ekvationer, men har även andra tillämpningar, till exempel det grundläggande problemet numerisk integration. LÄS MER

7. 5. Modeling and Estimation for Dry Clutch Control

   Författare :Andreas Myklebust; Lars Eriksson; Anders Robertsson; Linköpings universitet; []
   Nyckelord :;

   Sammanfattning : Increasing demands on comfort, performance, and fuel efficiency in vehicles lead to more complex transmission solutions. One such solution is the Automated Manual Transmission (AMT). It works just like an ordinary manual transmission but the clutch and gear selection are computer controlled. LÄS MER