In this thesis, a discrete Markov chain model for analyzing memory interference in multiprocessors, is presented.

The purpose of this thesis is to study the equivalence relation between sets A and B: A o B if and only if there exists a one to one function f from A onto B. In Chapter I, some of the fundamental properties of the equivalence relation are derived. Certain basic results on countable and uncountable sets are given. In Chapter II, a number of theorems on equivalent sets are proved and Dedekind's definitions of finite and infinite are compared with the ordinary concepts of finite and infinite. The Bernstein Theorem is studied and three different proofs of it are given. In Chapter III, the concept of cardinal number is introduced by means of two axioms of A. Tarski, and some fundamental theorems on cardinal arithmetic are proved.

Nous présentons une nouvelle méthode de type frontière immergée (immersed boundary method, ou méthode IB) pour le calcul d'écoulements visqueux incompressibles en géométries irrégulières. Dans les méthodes IB , la frontière irrégulière de la géométrie n'est pas alignée avec la grille de calcul, et le point crucial de leur développement demeure le traitement numérique des cellules fluides qui sont coupées par la frontière irrégulière, appelées cut-cells. La partie dédiée à la résolution des équations de Navier-Stokes de notre méthode IB, appelée méthode LS-STAG , repose sur la méthode MAC pour grilles cartésiennes décalées, et sur l'utilisation d'une fonction de distance signée (la fonction level-set ) pour représenter précisément les frontières irrégulières du domaine. L'examen discret des lois globales de conservation de l'écoulement (masse, quantité de mouvement et énergie cinétique) a permis de bâtir une discrétisation unifiée des équations de Navier-Stokes dans les cellules cartésiennes et les cut-cells . Cette discrétisation a notamment la propriété de préserver la structure à 5 points du stencil original et conduit à une méthode extrêmement efficace sur le plan du temps de calcul en comparaison à un solveur non-structuré. La précision de la méthode est évaluée pour l'écoulement de Taylor-Couette et sa robustesse éprouvée par l'étude de divers écoulements instationnaires, notamment autour d'objets profilés. Le champ d'application de notre solveur Newtonien s'étend au cas d'écoulements en présence de géométries mobiles, et la méthode LS-STAG s'avère être un outil prometteur puisqu'affranchie des étapes systématiques (et coûteuses) de remaillage du domaine. Finalement, la première application d'une méthode IB au calcul d'écoulements de fluides viscoélastiques est présentée. La discrétisation de la loi constitutive est basée sur la méthode LS-STAG et sur l'utilisation d'un arrangement totalement décalé des variables dans tout le domaine assurant le couplage fort requis entre les variables hydrodynamiques et les composantes du tenseur des contraintes élastiques. La méthode est appliquée au fluide d'Oldroyd-B en écoulement dans une contraction plane 4:1 à coins arrondis. / This thesis concerns the development of a new Cartesian grid / immersed boundary (IB) method for the computation of incompressible viscous flows in two-dimensional irregular geometries. In IB methods, the computational grid is not aligned with the irregular boundary, and of upmost importance for accuracy and stability is the discretization in cells which are cut by the boundary, the so-called ``cut-cells''. In this thesis, we present a new IB method, called the LS-STAG method, which is based on the MAC method for staggered Cartesian grids and where the irregular boundary is sharply represented by its level-set function. This implicit representation of the immersed boundary enables us to calculate efficiently the geometry parameters of the cut-cells. We have achieved a novel discretization of the fluxes in the cut-cells by enforcing the strict conservation of total mass, momentum and kinetic energy at the discrete level. Our discretization in the cut-cells is consistent with the MAC discretization used in Cartesian fluid cells, and has the ability to preserve the 5-point Cartesian structure of the stencil, resulting in a highly computationally efficient method. The accuracy and robustness of our method is assessed on canonical flows at low to moderate Reynolds number~: Taylor Couette flow, flows past a circular cylinder, including the case where the cylinder has forced oscillatory rotations. We extend the \em LS-STAG \em method to the handling of moving immersed boundaries and present some results for the transversely oscillating cylinder flow in a free-stream. Finally, we present the first IB method that handles flows of viscoelastic fluids. The discretization of the constitutive law equation is based on the \em LS-STAG \em method and on the use of a fully staggered arrangement of unknowns, which ensures a strong coupling between all flow variables in the whole domain. The resulting method is applied to the flow of an Oldroyd-B fluid in a 4:1 planar contraction with rounded corner.

Title: Analysis of practise and training of volleyball set in youth teams Objectives: In this work I tried to analyze practise and training of volleyball set at setter in youth teams. Above all I will be deal with types of sets and practising the sets. I will examine their training and using in training units. I will be also concetrated on the person of setter. I am intrested in what is supposed to have the skills and abilities. Abstract: This thesis is dedicated to all volleyball fans and mainly to volleyball coaches who are interested in problematics of practise and training volleyball set in youth teams. It can be also dedicated to volleyball coaches who are starting with their career. This thesis contains of chapter from history of volleyball, performance of game and the analysis of set, the set itself, division of set and skills and abilities of setter. This analysis was based on the questionnaire responses of selected coaches from volleyball clubs in Czech Republic. Key words: The volleyball, practise, training, set, setter

Master of Music / Department of Music / Kurt Gartner / This is a report for anyone playing or teaching any one of the following pieces: Concerto for Vibraphone and Orchestra by Ney Rosauro, Surface Tension by Dave Hollinden, Urban Sketches for Percussion Trio by Lon W. Chaffin, Take Five by Paul Desmond, or DT Supreme by Austin Barnes. The repertoire is analyzed by the method given in Jan Larue’s book Guidelines for Style and Analysis. The report includes interpretive decisions, technical considerations, harmonic analysis, and form.

The purpose of this study was to investigate endocrine responses to redistribution with heavier loads (RR+L) during back squat (BS) exercise in resistance-trained men. Ten men (mean±SE; 23±2 years, 175.6±2.0 cm, 78.0±3.4 kg, 4±1 training years) were assigned using randomization to either RR+L (4 sets of (2×5 repetitions) of BS with 30 s intra-set and 90 s inter-set rest using 75% of their 1RM) or traditional sets (TS; 4 sets of 10 repetitions of BS with 120 s inter-set rest using 70% of their 1RM). Fasted blood samples were collected pre-exercise (PRE), immediately post-exercise (IP), and 5 (+5), 15 (+15), and 30 (+30) minutes post-exercise to analyze the concentrations of testosterone (T), growth hormone (GH), cortisol (C), and blood lactate (BL). Two-way ANOVAs with repeated measures were used (p≤0.05). A main effect of condition (p=0.023) was observed for BL (RR+L; 5.9±0.5 vs TS; 6.7±0.4 mmol/L). A main effect of time point (p≤0.001) was observed for T, GH, C, and BL. T was greater at IP (8.8±1.1), +5 (9.0±1.1), +15 (8.5±1.0), and +30 (8.0±1.0) than PRE (7.1±0.8 ng/mL). GH was greater at IP (58.3±12.7), +5 (62.8±12.7), +15 (67.9±13.3), and +30 (52.8±11.2) than PRE (3.6±1.6 µIU/mL). C was greater at +15 (25.5±2.9) and +30 (25.6±2.7) than PRE (20.0±2.7 µg/dL). BL was greater at IP (8.6±0.6), +5 (8.2±0.6), +15 (7.4±0.5), and +30 (5.8±0.5) than PRE (1.4±0.2 mmol/L). RR+L resulted in lower BL but no differences in T, GH, and C responses compared to TS. Thus, practitioners may incorporate RR+L without affecting endocrine responses.

The goal of this paper is to benchmark Answer Set Programming (ASP) systems to test their performance when dealing with a complex optimization problem. In particular, the problem tackled is resource allocation in the area of Business Process Management (BPM). Like many other scheduling problems, the allocation of resources and starting times to business process activities is a challenging optimization problem for ASP solvers. Our problem encoding is ASP Core-2 standard compliant and it is realized in a declarative and compact fashion. We develop an instance generator that produces problem instances of different size and hardness with respect to adjustable parameters. By using the baseline encoding and the instance generator, we provide a comparison between the two award-winning ASP solvers clasp and wasp and report the grounding performance of gringo and i-dlv. The benchmark suggests that there is room for improvement concerning both the grounders and the solvers. Fostered by the relevance of the problem addressed, of which several variants have been described in different domains, we believe this is a solid application-oriented benchmark for the ASP community. / Series: Working Papers on Information Systems, Information Business and Operations

This thesis considers a novel problem of obtaining global channel state information (CSI) at every node in an ad-hoc wireless network. A class of protocols for dissemination and estimation are developed which attempt to minimize the staleness of the estimates throughout the network. This thesis also provides an optimal protocol for CSI dissemination in networks with complete graph topology and a near optimal protocol in networks having incomplete graph topology. In networks with complete graph topology, the protocol for CSI dissemination is shown to have a resemblance to finding Eulerian tours in complete graphs. For networks having incomplete graph topology, a lower bound on maximum staleness is given and a near optimal algorithm based on finding minimum connected dominating sets and proper scheduling is described in this thesis.

This thesis considers a novel problem of obtaining global channel state information (CSI) at every node in an ad-hoc wireless network. A class of protocols for dissemination and estimation are developed which attempt to minimize the staleness of the estimates throughout the network. This thesis also provides an optimal protocol for CSI dissemination in networks with complete graph topology and a near optimal protocol in networks having incomplete graph topology. In networks with complete graph topology, the protocol for CSI dissemination is shown to have a resemblance to finding Eulerian tours in complete graphs. For networks having incomplete graph topology, a lower bound on maximum staleness is given and a near optimal algorithm based on finding minimum connected dominating sets and proper scheduling is described in this thesis.

A dissertation submitted to the Faculty of Engineenug, University of the Witwatersrand, in fulfilment. of the requirements for the degree of Master of Science in Engineering, / A multi variable control strategy for a grinding circuit at East Driefontein has been implemented by others and has enabled it to operate under stable conditions. The next development needed was to find conditions under which tne efficiency of the circuit was the greatest. Optimum set points exist for the multi variable controller to keep the circuit at its most efficient state. This project was done to determine these set points, and how it affected the operation of the circuit. The strategy involved the collection of process data, the development of mathematical models and the determination of these optimum set points by simulation, This option reduced interference with routine production operations, which is often a prohibiting factor during any development work on an existing process. The optimum set points were successfully determined, and were compared with previous findings and current plant practice. / AC2017