This thesis describes the design of cartesian robot for precise measurement microphones. It contains design of robot, which is set from motorized linear stage and welded steel profiles structure. Model of described robot was computed in Inventor and then strength analysed in Ansys. Individual motors of linear stages and their sensors were designed at the end.

Optimization of digital circuits still attracts much attention not only of researchers but mainly chip producers. One of new the methods for the optimization of digital circuits is cartesian genetic programming. This Master's thesis describes a new crossover operator and its implementation for cartesian genetic programming. Experimental evaluation was performed in the task of three-bit multiplier and five-bit parity circuit design.

The diploma thesis deals with the evolutionary algorithms and their application in the area of digital circuit design. In the first part, general principles of evolutionary algorithms are introduced. This part includes also the introduction of genetic algorithms and genetic programming. The next chapter describes the cartesian genetic programming and its modifications like embedded, self-modifying or multi-chromosome cartessian genetic programming. Essential part of this work consists of the design and implementation of a modularization technique for evolution circuit design. The proposed approach is evaluated using a set of standard benchmark circuits.

This thesis deals with the design of module for control of biaxial cartesian manipulator. Control module recieves signals STEP and DIR from PLC - these signals can have frequency up to 100 kHz. They are processed by the module and send to inputs of drivers, which control motors of biaxial manipulator. Both axis of manipulator are driven simultaneously. PLC is not able to manage this process without this module. Adjusted parameters are displayed on LCD display. Control module is disturbance-resistant. All signals are isolated by fast optocouplers, which guarantee minimum distortion of signals. Data are processed by microprocessor ATXMEGA. Program of microprocessor is written in the C language. It is possible to switch module to NPN or PNP logic and it is also possible to select output voltage 5 or 24 V according to the type and adjustment of used driver for motor control.

CFD-Analysen sind in den letzten Jahren ein fester Bestandteil in der Produktentwicklung geworden. Dies liegt primär daran, dass es in den letzten Jahrzehnten große Fortschritte in der Entwicklung der Software und dem Preisverfall der Hardware gegeben hat. Das einstige Expertenwerkzeug CFD hat heutzutage auch in vielen kleinen und mittelständischen Unternehmen seinen festen Platz gefunden und somit ein enormes Anwendungsspektrum erschlossen. Ein wesentlicher Schlüssel für diesen Erfolg war und ist die Effizienz bei der Erstellung der Berechnungsmodelle. Ein Meilenstein war die ab Mitte der 1990er Jahre verfügbare Verwendung unstrukturierter Netze. Erst durch den Einsatz von Tetraedern konnten beliebig komplexe Strukturen überhaupt vernetzt werden. Dieser Vortrag beschreibt die Verwendung von sogenannten kartesischen Netzen in Kombination mit der Immersed Boundary Methode. Dabei handelt es sich um einen bislang wenig beachteten Weg, der den Anwender nochmals erheblich bei der Modellaufbereitung entlastet und somit auch anspruchsvolle CFD-und Thermalsimulationen für Konstrukteure zugänglich macht.

To investigate the feasibility of improving performance for EcmaScript code in environments that restricts the usage of dynamic just in time compilers, an ahead of time EcmaScript to C compiler capable of compiling a substantial subset of the EcmaScript language has been constructed. The compiler recovers type information without customized type information by using the Cartesian Product Algorithm. While the compiler is not complete enough to be used in production it has shown to be capable of producing code that matches contemporary optimizing just in time compilers in terms of performance and substantially outperforms the interpreters currently used in restricted environments. In addition to constructing and benchmarking the compiler a survey was conducted to gauge if the selected subset of the language was acceptable for use by developers.

The complementary prism GḠ of a graph G is formed from the disjoint union of G and its complement Ḡ by adding the edges of a perfect matching between the corresponding vertices of G and Ḡ. A set S ⊆ V(G) is a double dominating set of G if for every v ∈ V(G)\S, v is adjacent to at least two vertices of S, and for every w ∈ S, w is adjacent to at least one vertex of S. The double domination number of G is the minimum cardinality of a double dominating set of G. We begin by determining the double domination number of complementary prisms of paths and cycles. Then we characterize the graphs G whose complementary prisms have small double domination numbers. Finally, we establish lower and upper bounds on the double domination number of GḠ and show that all values between these bounds are attainable.

The complementary prism GḠ of a graph G is formed from the disjoint union of G and its complement Ḡ by adding the edges of a perfect matching between the corresponding vertices of G and Ḡ. A set S ⊆ V(G) is a double dominating set of G if for every v ∈ V(G)\S, v is adjacent to at least two vertices of S, and for every w ∈ S, w is adjacent to at least one vertex of S. The double domination number of G is the minimum cardinality of a double dominating set of G. We begin by determining the double domination number of complementary prisms of paths and cycles. Then we characterize the graphs G whose complementary prisms have small double domination numbers. Finally, we establish lower and upper bounds on the double domination number of GḠ and show that all values between these bounds are attainable.

The complementary prism GḠ of a graph G is formed from the disjoint union of G and its complement G by adding the edges of a perfect matching between the corresponding vertices of G and Ḡ. A set S ⊆ V(G) is a restrained dominating set of G if for every v € V(G) \S, v is adjacent to a vertex in S and a vertex in V(G) \S. The restrained domination number of G is the minimum cardinality of a restrained dominating set of G. We study restrained domination of complementary prisms. In particular, we establish lower and upper bounds on the restrained domination number of GḠ, show that the restrained domination number can be attained for all values between these bounds, and characterize the graphs which attain the lower bound.

Placing degree constraints on the vertices of a path yields the definitions of uphill and downhill paths. Specifically, we say that a path π = v1, v2, ⋯ vk+1 is a downhill path if for every i, 1 ≤ i ≤ k, deg(v1) ≥ deg(vi+1). Conversely, a path π = u1, u2, ⋯ uk+1 is an uphill path if for every i, 1 ≤ i ≤ k, deg(u1) ≤ deg(ui+1). The downhill domination number of a graph G is defined to be the minimum cardinality of a set S of vertices such that every vertex in V lies on a downhill path from some vertex in S. The uphill domination number is defined as expected. We explore the properties of these invariants and their relationships with other invariants. We also determine a Vizing-like result for the downhill (respectively, uphill) domination numbers of Cartesian products.