Sökning: "Pattern-matching"

Visar resultat 1 - 5 av 43 avhandlingar innehållade ordet Pattern-matching.

  1. 1. Parallel and Distributed Processing in the Context of Fog Computing: High Throughput Pattern Matching and Distributed Monitoring

    Författare :Charalampos Stylianopoulos; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; resource-constrained devices; distributed monitoring; distributed processing; vectorization; pattern matching; high throughput; fog computing;

    Sammanfattning : With the introduction of the Internet of Things (IoT), physical objects now have cyber counterparts that create and communicate data. Extracting valuable information from that data requires timely and accurate processing, which calls for more efficient, distributed approaches. LÄS MER

  3. 2. Exploration of extended Higgs sectors, development of a displaced track trigger, and improvements in GRID middleware

    Författare :Max Isacson; Elin Bergeås Kuutmann; Patrizia Azzi; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; BSM; Supersymmetry; Standard Model; Higgs; 2HDM; Charged Higgs; Compositeness; Pattern Matching; GRID; Fysik med inriktning mot elementarpartikelfysik; Physics with specialization in Elementary Particle Physics;

    Sammanfattning : Two possible solutions to the Standard Model (SM) fine-tuning problem are presented in this thesis, MSSM and Compositeness. The Higgs sector of the MSSM can be tested by searching for charged Higgs bosons. Two direct searches for charged Higgs bosons decaying into a top- and bottom-quark are performed using 13.2 and 36. LÄS MER

  4. 3. Towards a practical programming language based on dependent type theory

    Författare :Ulf Norell; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; dependent types; type theory; metavariables; programming; pattern matching; type checking;

    Sammanfattning : Dependent type theories have a long history of being used for theorem proving. One aspect of type theory which makes it very powerful as a proof language is that it mixes deduction with computation. LÄS MER

  5. 4. Type Theory with First-Order Data Types and Size-Change Termination

    Författare :David Wahlstedt; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Pattern-matching; Reducibility; Size-Change Termination; Logical Framework; Lambda-calculus; Term rewriting.; Type Theory; Dependent types; Normalization; Type system;

    Sammanfattning : We prove normalization for a dependently typed lambda-calculus extended with first-order data types and computation schemata for first-order size-change terminating recursive functions. Size-change termination, introduced by C.S. Lee, N. LÄS MER

  7. 5. Performance enhancement in a well-structured pattern matcher through partial evaluation

    Författare :Pär Emanuelson; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap;

    Sammanfattning : Partial evaluation is a technique which can be utilized for the generation of compiled code from the corresponding interpreter. In this work the partial evaluation technique is applied to a pattern match interpreter, in order to achieve the simultaneous goals of a general, well-structured program which is extendible and still make high performance at execution possible. LÄS MER