This thesis describes an optimising Compiler for translating from SMV to CLP(B). The optimisation is aimed at reducing the number of required variables in order to decrease the size of the resulting BDDs. Also a partitioning of the transition relation is performed. The Compiler uses an internal representation of a FSM that is built up from the SMV description. A number of rewrite steps are performed on the problem description such as encoding to a Boolean domain and performing the optimisations.

This master?s thesis examines the possibility to heuristically optimise instruction cache performance in a Just-In-Time (JIT) Compiler. Programs that do not fit inside the cache all at once may suffer from cache misses as a result of frequently executed code segments competing for the same cache lines. A new heuristic algorithm LHCPA was created to place frequently executed code segments to avoid cache conflicts between them, reducing the overall cache misses and reducing the performance bottlenecks. Set-associative caches are taken into consideration and not only direct mapped caches.

Modelica is a multi-domain and equation-based modeling language. Modelica is based on object-oriented principles and non-causal modeling. The language is constructed to facilitate reuse and decompose models. The models and the modellibrary can modified to design a new nonlinear components.Object-oriented modeling is an excellent way to analyze and study large complex heterogeneous physical systems. The object-oriented modeling approach build on reusing and decomposition of models and non-causal modeling.Modeling physical systems often leads to a DAE system with index 2 or 3.

The Ericsson AXE-based systems are programmed using an internally developed language called Plex-C. Plex-C is normally compiled to execute on an Ericsson internal processor architecture. A transition to standard processors is currently in progress. This makes it interesting to examine if Plex-C can be compiled to execute on the JVM, which would make it processor independent. The purpose of the thesis is to examine if parts of the run-time environment of Plex-C can be translated to Java and if this can be done so that sufficient performance is obtained.

Building Automation Systems in commercial buildings are often designed and installed by different contractors, using equipment and components from different manufacturers. The lack of an accepted communication standard has resulted in a few different standards. Many manufacturers of building automation systems only support one, a few or none of these standards, while developing proprietary system solutions. Regin, who develop such equipment, are planning to adopt an open communication protocol specially designed for building automation - BACnet. As a step in that direction this thesis was announced with the purpose to investigate the possibility to implement BACnet in one of their products and to gain more knowledge of the BACnet protocol.

This report studies the possibility of using some sort of radio sender and transmitter in order to position skis lost in powder snow. It is concluded that a RF-solution on the 433 MHz frequency should be the most efficient. Different forms of directional antennas are examined and studies show that in theory the best suited is the so called ?Yagi-Uda antenna?. A solution based on using a Receive Signal Strength Indicator value together with the above mentioned directional antenna is developed.

In this report you can get a complete instruction about how to build your own development system for the PIC-processor. This card will be used for laborations for the students at LITH-ITN. With this card you can send new assembler codes (new instructions) down to the microprocessor via the Serialport on your computer. Then the new instructions for the microprocessor will start to execute. We made a solder paste stencil at Campus Norrköping solder paste stencil laboratory.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.