Sökning: "Algorithm theory"

Visar resultat 6 - 10 av 461 avhandlingar innehållade orden Algorithm theory.

  1. 6. Fighter Aircraft Maneuver Limiting Using MPC : Theory and Application

    Författare :Daniel Simon; Johan Löfberg; Torkel Glad; Jan Maciejowski; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Model predictive control; flight control;

    Sammanfattning : Flight control design for modern fighter aircraft is a challenging task. Aircraft are dynamical systems, which naturally contain a variety of constraints and nonlinearities such as, e.g., maximum permissible load factor, angle of attack and control surface deflections. LÄS MER

  3. 7. Tracking Theory for Preventive Safety Systems

    Författare :Lars Danielsson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; vehicle tracking; sensor data fusion; automotive; active safety systems; sensor models; warning integration; motion models; fusion strategies; human machine interface; preventive safety systems;

    Sammanfattning : Preventive safety systems rely on accurate information from a sensing system regarding the current traffic situation to make decision whether to inform, warn or intervene to avoid an impeding collision or to mitigate its consequences. This thesis mainly considers tracking algorithms to enhance these systems through making the best use of the information supplied by on-vehicle sensors, such as radar and vision sensors. LÄS MER

  4. 8. Discrete Methods used in Graph Theory and Linear Programming

    Författare :Olof Barr; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Perceptron Algorithm; Graph Theory; Linear Programming; Matematik;

    Sammanfattning : The content of the thesis is divided into two parts; graph theory and linear programming. The main results in the first part concerns extremal graph theory. Here we want to determine the number of edges in a graph needed to ensure the existence of certain local structures. LÄS MER

  5. 9. Achievement tests and optimal design for pretesting of questions

    Författare :Mahmood Ul Hassan; Frank Miller; Steven Gilmour; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Achievement test; Equivalence theorem; Exchange algorithm; Item calibration; Item response theory model; Optimal experimental design; Statistics; statistik;

    Sammanfattning : Achievement tests are used to measure the students' proficiency in a particular knowledge. Computerized achievement tests (e.g. GRE and SAT) are usually based on questions available in an item bank to measure the proficiency of students. LÄS MER

  7. 10. Formal Languages and Automata in Computational Algebra

    Författare :Jonas Månsson; Algebra; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; control; Datalogi; Talteori; algebraisk geometri; algebra; gruppteori; Computer science; numerical analysis; systems; group theory; field theory; algebraic geometry; finite automata; Number Theory; Gröbner bases; SAGBI bases; numerisk analys; system; kontroll; fältteori;

    Sammanfattning : This thesis is a collection of six papers in computational algebra. In particular, we study noncommutative Gröb- ner bases, SAGBI bases and similar algebraic objects which can be represented as a graph or an automaton. LÄS MER