The paper explicates the notions of topic, contrastive topic, and focus as used in the analysis of Hungarian. Based on distributional criteria, topic and focus are claimed to represent distinct structural positions in the left periphery of the Hungarian sentence, associated with logical rather than discourse functions. The topic is interpreted as the logical subject of predication. The focus is analyzed as a derived main predicate, specifying the referential content of the set denoted by the backgrounded post-focus section of the sentence. The exhaustivity associated with the focus and the existential presupposition associated with the background are shown to be properties following from their specificational predication relation.

Complex concurrent APIs are difficult to reason about annually due to the exponential growth in the number of feasible schedules. Testing against reference solutions of these APIs is equally difficult as reference solutions implement an unknown set of allowed behaviors, and programmers have no way to directly control schedules or API internals to expose or reproduce errors. The work in this paper mechanically generates a drop-in replacement for a concurrent API from a formal specification. The specification is a guarded command system with first-order logic that is compiled into a core calculus. The term rewriting system is connected to actual C programs written against the API through lightweight wrappers in a role-based relationship with the rewriting system. The drop-in replacement supports putative what-if queries over API scenarios for behavior exploration, reproducibility for test and debug, full exhaustive search and other advanced model checking analysis methods for C programs using the API. We provide a Racket instantiation of the rewriting system with a C/Racket implementation of the role-based architecture and validate the process with an API from the Multicore Association.

L'objectif principal de cette thèse est de proposer les méthodes permettant d'obtenir le délai de transmission de bout en bout pire cas exact d'un réseau AFDX. Actuellement, seules des bornes supérieures pessimistes peuvent être calculées en utilisant les approches de type Calcul Réseau ou par Trajectoires. Pour cet objectif, différentes approches et outils existent et ont été analysées dans le contexte de cette thèse. Cette analyse a mis en évidence le besoin de nouvelles approches. Dans un premier temps, la vérification de modèle a été explorée. Les automates temporisés et les outils de verification ayant fait leur preuve dans le domaine temps réel ont été utilisés. Ensuite, une technique de simulation exhaustive a été utilisée pour obtenir les délais de communication pire cas exacts. Pour ce faire, des méthodes de réduction de séquences ont été définies et un outil a été développé. Ces méthodes ont été appliquées à une configuration réelle du réseau AFDX, nous permettant ainsi de valider notre travail sur une configuration de taille industrielle du réseau AFDX telle que celle embarquée à bord des avions Airbus A380. The main objective of this thesis is to provide methodologies for finding exact worst case end to end communication delays of AFDX network. Presently, only pessimistic upper bounds of these delays can be calculated by using Network Calculus and Trajectory approach. To achieve this goal, different existing tools and approaches have been analyzed in the context of this thesis. Based on this analysis, it is deemed necessary to develop new approaches and algorithms. First, Model checking with existing well established real time model checking tools are explored, using timed automata. Then, exhaustive simulation technique is used with newly developed algorithms and their software implementation in order to find exact worst case communication delays of AFDX network. All this research work has been applied on real life implementation of AFDX network, allowing us to validate our research work on industrial scale configuration of AFDX network such as used on Airbus A380 aircraft. / The main objective of this thesis is to provide methodologies for finding exact worst case end to end communication delays of AFDX network. Presently, only pessimistic upper bounds of these delays can be calculated by using Network Calculus and Trajectory approach. To achieve this goal, different existing tools and approaches have been analyzed in the context of this thesis. Based on this analysis, it is deemed necessary to develop new approaches and algorithms. First, Model checking with existing well established real time model checking tools are explored, using timed automata. Then, exhaustive simulation technique is used with newly developed algorithms and their software implementation in order to find exact worst case communication delays of AFDX network. All this research work has been applied on real life implementation of AFDX network, allowing us to validate our research work on industrial scale configuration of AFDX network such as used on Airbus A380 aircraft.

Between incurably degenerative illness and the graffiti which ignited the Syrian Civil War, YOUR TURN, DOCTOR complicates hope. When myths of revolution, of wellness, no longer console—love as measured in anything but loss. Within a multidisciplinary project how an increasingly painful embodiment intersects the material excess of capitalism is explored. Can objects function as a political demand, necessitating changes in the way the world is ordered? Who for? To understand one kind of oppression in necessary sterility and another in marginalization so profound blindness can result. That is to ask, how long must one be told they do not see a thing they see before they don’t, before transgressions become norms? A list of "Indulgences" modeled loosely after Martin Luther’s Ninety-Five Theses outlines content. Five sections reference the five pillars of Islam— with each containing nineteen individual proposals. Nineteen serves as the common denominator for the mathematical structure of much of the text of the Quran.

Bobbin lace is a 500-year-old art form in which threads are braided together in an alternating manner to produce a lace fabric. A key component in its construction is a small pattern, called a bobbin lace ground, that can be repeated periodically to fill a region of any size. In this thesis we present a mathematical model for bobbin lace grounds representing the structure as the pair (Δ(G), ζ (v)) where Δ(G) is a topological embedding of a 2-regular digraph, G, on a torus and ζ(v) is a mapping from the vertices of G to a set of braid words. We explore in depth the properties that Δ(G) must possess in order to produce workable lace patterns. Having developed a solid, logical foundation for bobbin lace grounds, we enumerate and exhaustively generate patterns that conform to that model. We start by specifying an equivalence relation and define what makes a pattern prime so that we can identify unique representatives. We then prove that there are an infinite number of prime workable patterns. One of the key properties identified in the model is that it must be possible to partition Δ(G) into a set of osculating circuits such that each circuit has a wrapping index of (1,0); that is, the circuit wraps once around the meridian of the torus and does not wrap around the longitude. We use this property to exhaustively generate workable patterns for increasing numbers of vertices in G by gluing together lattice paths in an osculating manner. Using a backtracking algorithm to process the lattice paths, we identify over 5 million distinct prime patterns. This is well in excess of the roughly 1,000 found in lace ground catalogues. The lattice paths used in our approach are members of a family of partially directed lattice paths that have not been previously reported. We explore these paths in detail, develop a recurrence relation and generating function for their enumeration and present a bijection between these paths and a subset of Motzkin paths. Finally, to draw out of the extremely large number of patterns some of the more aesthetically interesting cases for lacemakers to work on, we look for examples that have a high degree of symmetry. We demonstrate, by computational generation, that there are lace ground representatives from each of the 17 planar periodic symmetry groups. / Graduate / 0389 / 0984 / 0405 / veronikairvine@gmail.com

No presente trabalho propõe-se empregar algoritmos genéticos em associação com o design construtal para a otimização de geometrias em problemas de transferência de calor. O objetivo principal de todos os estudos deste trabalho é minimizar a máxima temperatura que ocorre no domínio computacional. Investigou-se, inicialmente, uma cavidade isotérmica em forma de Y inserida em um sólido retangular com geração de calor uniforme a uma taxa volumétrica constante, onde foi feita uma comparação e validação do algoritmo genético frente à busca exaustiva para poucos graus de liberdade. Após, foi feita uma otimização usando somente algoritmos genéticos considerando todos os quatro graus de liberdade do problema e diferentes valores para suas restrições geométricas. O estudo seguinte foi feito considerando a mesma geometria anteriormente discutida, porém considerou-se as paredes da cavidade Y com uma condição de contorno convectiva. Da mesma forma anterior, foi feita uma validação do algoritmo genético frente à busca exaustiva e na sequência uma otimização de todos os quatro graus de liberdade e diferentes valores do parâmetro convectivo a, empregando somente algoritmos genéticos. No terceiro caso, estudou-se um caminho assimétrico em forma de V de um material de alta condutividade. A geometria tem sua base recebendo um fluxo de calor constante e o remove através das extremidades de dois braços ligados a um sumidouro de calor. Otimizou-se a forma pelo método exaustivo considerando quatro graus de liberdade e uma restrição constante . Após, usou-se algoritmos genéticos para otimizar a geometria considerando os mesmos graus de liberdade e diferentes valores para a restrição de ocupação do material condutivo. Similarmente ao caso da cavidade convectiva em forma de Y, por fim, estudou-se a otimização geométrica de um corpo cilíndrico onde cavidades convectivas retangulares com dois pares de braços são inseridas. Realizaram-se otimizações de até sete graus de liberdade e também se estudou a influência de um parâmetro convectivo e das frações de ocupação das áreas do corpo e braços da cavidade. Deste estudo, concluiu-se que quanto maior o número de cavidades, menores são as máximas temperaturas que ocorrem no domínio. Destaca-se, também, a dependência do parâmetro convectivo, que influenciou na forma da melhor geometria encontrada. Para todos os estudos feitos, os resultados mostraram que a busca por meio de algoritmos genéticos levou a uma redução significativa do número de simulações necessárias para obter a geometria ótima com resultados concordantes aos obtidos com busca exaustiva. Além disso, foi possível estender o estudo para problemas com mais graus de liberdade, restrições e propriedades térmicas. Conclui-se que o melhor design é altamente dependente dos graus de liberdade e restrições, este sendo alcançado de acordo com o princípio construtal da ótima distribuição das imperfeições. / In this work, we propose employing genetic algorithms in association with constructal design for geometry optimization in heat transfer problems. The main objective of all studies is to minimize the maximum temperature that occurs in the computational domain. It was investigated initially an isothermal Y-shaped cavity intruded into a rectangular solid conducting wall with heat generation uniformly at a volumetric rate, where a comparison and validation of genetic algorithm against exhaustive search for few degrees of freedom was made. Then, an optimization is performed by means of genetic algorithms considering all four degrees of freedom of the problem and different values for geometric constraints. The following study has been done considering the same geometry as previously discussed, but it is considered the walls of the Y-cavity with a convective boundary condition. Thus, a dimensionless heat transfer parameter to study (a) was added. Similarly, foregoing study, a genetic algorithm validation was performed comparing to the exhaustive search. After, all four degrees of freedom and different values of a parameter only using genetic algorithms were optimized. In the next investigation, an asymmetric V-shaped pathway of high conductivity material was studied. This geometry receives a constant heat transfer rate in its base and removes it by the end of the two branches that are in touch with the heat sink. The shape was optimized by exhaustive approach considering four degree of freedom and a constraint. After, we used genetic algorithms to optimize the geometry considering the same degrees of freedom and different values for the restriction. Finally, similar to the case of the Y-shaped convective cavity, rectangular convective cavities with two pairs of arms inserted into a cylindrical solid body were optimized. Optimizations of up to seven degrees of freedom were performed and the influence of the convective parameter and of the area fractions of the body and arms of the cavity, were also investigated. From this study, it was concluded that the higher the number of cavities, the lower the maximum temperatures occurring in the domain. Also, the dependence of the convective parameter, influenced in the form of the best geometry, is highlighted. For all studies carried out, the results showed that the search using genetic algorithms led to a significant reduction of the number of simulations required to obtain the optimal geometry. Moreover, it was possible to extend the study where it was considered other degrees of freedom, constraints and thermal properties. We concluded that the best design is highly dependent of degrees of freedom and constraints, and this has been achieved according to the constructal principle of optimal distribution of imperfections.

Este trabalho propõe uma metodologia para enumerar soluções, que indiquem a barra e a compensação de potência reativa necessária para o sistema elétrico sob análise, que atendam aos requisitos avaliados pela função objetivo e as restrições. Nessa alocação de compensação ótima de potência reativa, obtemos as melhores barras e configurações de potências e tecnologias de dispositivos de compensação, minimizando as perdas totais de potência ativa da rede. Em redes fracas com conversores de frequência (por exemplo, para conexão de fontes renováveis, ou interligações utilizando conversores HVDC), esta metodologia proposta busca a melhor relação de curto-circuito trifásico (SCR) no ponto de conexão do conversor de frequência, melhorando a conexão da barra de interesse. O método busca soluções para alocar um único dispositivo de compensação, e soluções alocando simultaneamente dois dispositivos. A metodologia proposta baseia-se na enumeração exaustiva das soluções, e o estudo de caso nos sistemas de 14 e 30 barras do IEEE mostrou a aplicabilidade e funcionalidade da metodologia proposta. / This work proposes a methodology to enumerate solutions, which indicate the bar and the reactive power compensation required for the electrical system under analysis, that meet the requirements evaluated by the objective function and the constraints. In this allocation of optimal compensation of reactive power, we obtain the optimal bars and technologies of compensation devices, minimizing the total losses of active power of the network. In weak networks with frequency converters (e.g. for connection of renewable sources, or interconnections using HVDC converters), the proposed methodology seeks the best threephase short-circuit (SCR) relation at the connection point, improving the connection of the new generation. The method looks for solutions to allocate a single compensation device, and solutions to allocate two devices simultaneously. The proposed methodology is based on the exhaustive enumeration of the solutions. A case study carried out in the IEEE 14 and 30 bus systems shows the applicability and performance of the proposed methodology.

<p>In 2002 an amendment was added to the International Convention for the Safety of Life at Sea (SOLAS) which opened up for shipbuilders to replace steel with lightweight materials in the superstructures. However, SOLAS requires equal fire safety compared to ships with steel superstructures.</p><p> </p><p>LASS-c is a cross-organizational project with the aim to find a method to build cruise ships with part of the superstructure made in lightweight materials. As a part of the LASS-c project the purpose of this thesis has been to develop an application in Java (FISPAT). The tool has been designed to find fire sensitive areas in structures such as cruise vessels. A second aim with the thesis has been to evaluate the cruise ship Norwegian Gem with respect to fire sensitive areas.   </p><p> </p><p>In FISPAT the user can make a model of a structure. The model is built up by rooms, networks and devices. With the model, FISPAT can simulate fire spread and the effects on the networks included in the model. The user can then analyze the results to find fire sensitive parts.</p><p> </p><p>One of the main results in this thesis is the tool itself together with this report which also serves as a manual to FISPAT. An evaluation of Norwegian Gem was also made which points to some critical parts of the ship. One example is the main water supply pipe to the sprinklers which has no redundant systems and all sectioning valves are manually operated, hence it is vulnerable to faults. The electrical feed to the three pump units is also a vulnerable point on the vessel. The pumps have redundant electrical networks, but the wires are drawn on the same paths, making it possible to take out both systems with one fire.</p>

Telecommunications companies (telcos) and Internet Service Providers (ISPs) monitor the traffic passing through their networks for the purposes of network evaluation and planning for future growth. Most monitoring techniques currently use a form of packet sampling. However, exhaustive monitoring is a preferable solution because it ensures accurate traffic characterization and also allows encoding operations, such as compression and encryption, to be performed. To overcome the very high computational cost of exhaustive monitoring and encoding of data, this thesis suggests exploiting parallelism. By utilizing a parallel cluster in conjunction with load balancing techniques, a simulation is created to distribute the load across the parallel processors. It is shown that a very scalable system, capable of supporting a fairly high data rate can potentially be designed and implemented. A complete system is then implemented in the form of a transparent Ethernet bridge, ensuring that the system can be deployed into a network without any change to the network. The system focuses its encoding efforts on obtaining the maximum compression rate and, to that end, utilizes the concept of streams, which attempts to separate data packets into individual flows that are correlated and whose redundancy can be removed through compression. Experiments show that compression rates are favourable and confirms good throughput rates and high scalability.

In 2002 an amendment was added to the International Convention for the Safety of Life at Sea (SOLAS) which opened up for shipbuilders to replace steel with lightweight materials in the superstructures. However, SOLAS requires equal fire safety compared to ships with steel superstructures.   LASS-c is a cross-organizational project with the aim to find a method to build cruise ships with part of the superstructure made in lightweight materials. As a part of the LASS-c project the purpose of this thesis has been to develop an application in Java (FISPAT). The tool has been designed to find fire sensitive areas in structures such as cruise vessels. A second aim with the thesis has been to evaluate the cruise ship Norwegian Gem with respect to fire sensitive areas.      In FISPAT the user can make a model of a structure. The model is built up by rooms, networks and devices. With the model, FISPAT can simulate fire spread and the effects on the networks included in the model. The user can then analyze the results to find fire sensitive parts.   One of the main results in this thesis is the tool itself together with this report which also serves as a manual to FISPAT. An evaluation of Norwegian Gem was also made which points to some critical parts of the ship. One example is the main water supply pipe to the sprinklers which has no redundant systems and all sectioning valves are manually operated, hence it is vulnerable to faults. The electrical feed to the three pump units is also a vulnerable point on the vessel. The pumps have redundant electrical networks, but the wires are drawn on the same paths, making it possible to take out both systems with one fire.