Tato práce se zabývá různými charakteristikami komponovaných dokumentů a ukazuje potencionální výhody využití takových dokumentů v prostředí dnešního Webu. Hlavní pozornost je soustředěna na problémy spojené s validací komponovaných dokumentů. Práce zkoumá různé přístupy k řešení těchto problémů. Validační metoda NVDL (Namespace-based Validation Dispatching Language) je popsána detailně. Tato práce popisuje hlavní principy NVDL, zkoumá výhody a nevýhody oproti jiným přístupům a představuje JNVDL. JNVDL je kompletní implementace specifikace NVDL, která byla napsána v jazyce Java jako součást této práce. Popsány jsou nejen technické prvky implementace, ale JNVDL je představeno i z uživatelské perspektivy. Pro ověření využitelnosti bylo JNVDL integrováno do existujícího projektu pro validaci webových dokumentů s názvem Relaxed, aby jednoduše zpřístupnilo validaci komponovaných dokumentů autorům webového obsahu.

No description available.

No description available.

La thèse porte sur les réseaux de Kahn, un modèle de concurrence simple et expressif proposé par Gilles Kahn dans les années 70, et leur implémentation sur des architectures multi-coeurs modernes, à mémoire partagée. Dans un réseau de Kahn, le programmeur décrit un programme parallèle comme un ensemble de processus et de canaux communicants, reliant chacun exactement un processus producteur à un consommateur. Nous nous concentrons ici sur les aspects algorithmiques et les choix de conception liés à l'implémentation, avec deux points clefs : les garanties non bloquantes et la mémoire relâchée. Le développement d'algorithmes non bloquants efficaces s'inscrit dans une optique de gestion des ressources et de garantie de performance sur les plateformes à ordonnancement irrégulier, telles que les machines virtuelles ou les GPU. Un travail complémentaire sur les modèles de mémoire relâchée vient compléter cette approche théorique par un prolongement plus pratique dans le monde des architectures à mémoire partagée contemporaines. Nous présentons un nouvel algorithme non bloquant pour l'interprétation de réseaux de Kahn. Celui-ci est parallèle sur les accès disjoints : il permet à plusieurs processeursde travailler simultanément sur un même réseau de Kahn partagé, tout en exploitant le parallélisme entre processus indépendants. Il offre dans le même temps des garanties de progrès non bloquant : en mémoire bornée et en présence de retards sur les processeurs. L'ensemble forme, à notre connaissance, le premier système complètement non bloquant de cette envergure : techniques classiques de programmation non bloquante et contributions spécifiques aux réseaux de Kahn. Nous discutons également d'une variante bloquante destinée au calcul haute performance, avec des résultats expérimentaux encourageants. / In this thesis, we are interested in Kahn process networks, a simple yet expressive model of concurrency, and its parallel implementation on modern shared-memory architectures. Kahn process networks expose concurrency to the programmer through an arrangement of sequential processes and single-producer single-consumer channels. The focus is on the implementation aspects. Of particular importance to our study are two parameters: lock freedom and relaxed memory. The development of fast andefficient lock-free algorithms ties into concerns of controlled resource consumption and reliable performance on current and future platforms with unfair or skewed scheduling such as virtual machines and GPUs. Our work with relaxed memory models complements this more theoretical approach by offering a window into realistic sharedmemory architectures. We present a new lock-free algorithm for a Kahn process network interpreter. It is disjoint-access parallel: we allow multiple threads to work on the same shared Kahn process network, fully utilizing the parallelism exhibited by independent processes. It is nonblockingin that it guarantees global progress in bounded memory, even in the presence of (possibly infinite) delays affecting the executing threads. To our knowledge, it is the first lock-free system of this size, and integrates various well-known non-blocking techniques and concepts (e.g., safe memory reclamation, multi-word updates, assistance) with ideas and optimizations specific to the Kahn network setting. We also discuss a variant of the algorithm, which is blocking and targeted at high-performance computing, with encouraging experimental results.

Doctor of Philosophy / Department of Biology / Mark Ungerer / Elucidating the molecular basis of adaptive phenotypic variation represents a central aim in evolutionary biology. Using the model plant species Arabidopsis thaliana, I studied the intra-specific variation in freezing tolerance among natural accessions across its native range. Considerable variation in freezing tolerance among 71 selected accessions was observed both with and without a prior cold acclimation treatment, suggesting that both differences in cold-acclimation capacity and in intrinsic physiology contribute to this variation. A highly significant positive relationship was observed between freezing tolerance and latitude of origin of these accessions. This clinal pattern of variation is found to be attributable, at least in part, to relaxed purifying selection on CBF/DREB1 genes in the species’ southern range. These CBF/DREB1 genes encode transcriptional activators that play a critical role in the ability of A. thaliana plants to undergo cold acclimation and thereby achieve maximum freezing tolerance. Relative to accessions from northern regions, accessions of A. thaliana from the southern part of their geographic range exhibit significantly higher levels of nonsynonymous polymorphisms in coding regions of CBF/DREB1 genes. Relaxed selection on the CBF/DREB1s in southern accessions also has resulted in mutations in regulatory regions that lead to abrogated expression. These mutations in coding and regulatory regions compromise the function of CBF/DREB1 transcriptional activators during the cold acclimation process, as determined by reductions in rates of induction and maximum levels of expression in the downstream genes they regulate. These mutations could be selective neutral or beneficial in southern accessions depending on whether there is an allocation cost associated with cold acclimation. The fitness benefit and possible allocation cost of cold acclimation was examined in freezing and freezing-free environments using natural accessions exhibiting contrasting abilities of cold acclimation as well as transgenic CBF gene over-expression or knockdown/knockout lines. The extent to which cold acclimation benefits the plant in presence of freezing temperature is revealed, but a cost of cold acclimation wasn’t detected in the absence of freezing temperature under our experimental design, which suggests that these mutations in CBF genes in southern accessions might be neutral to natural selection.

It is already known that one can always find a set of measurements on any two-qubit entangled state that will lead to a violation of the CHSH inequality. We provide an explicit state in terms of the angle between Alice's choice of measurements and the angle between Bob's choice of measurements, such that the CHSH inequality is always violated provided Alice's or Bob's choice of inputs are not collinear. We prove that inequalities with a corresponding Bell operator written as a linear combination of tensor products of Pauli matrices, excluding the identity, will generate the most nonlocal correlations using maximally entangled states in our experiment. From this result and a proposition from Horodecki et. al., we are able to construct the state that generates these optimal correlations. To achieve this state in a lab, one party must rotate their qubit using the orthogonal operation we provide and also rotate their Bloch sphere such that all their measurements lie in the same plane. We provide a comprehensive study of how Bell inequalities change when experiments introduce error via imperfect detection efficiency. The original cases of perfect efficiency are covered first and then a more realistic approach, when inefficient detectors are used, will follow. It is shown that less entanglement is needed to demonstrate more nonlocality in some Clasure-Horne-Shimony-Holt (CHSH) experiments when detector inefficiency is introduced. An example of this is shown for any given specific set of measurements in the CHSH Bell experiment. This occurs when one party has a detector of efficiency for each choice of input and the other party makes projective measurements. The efficiency can be pushed down to fifty percent while still violating the CHSH inequality, and for the experimental set-up illustrated, there is more nonlocality with less entanglement. Furthermore, it is shown that if the first party has an imperfect detector for only one choice of inputs rather than two, the efficiency can be brought down arbitrarily close to zero percent while still violating the CHSH inequality. Historically, nonlocality and entanglement were viewed as two equivalent resources, but recently this equality has come under question; these results further support this fundamental difference. Further more, we introduce Mermin's game in the case of relaxed conditions. The original constraints were that when the detectors in separate labs of a two-qubit experiment are in the same setting, then the results should be the same. We require that the outcomes are the same at least part of the time, given by some epsilon variable. Initially, one could find a maximum violation of one-fourth by allowing to parties to share the singlet state and have measurement settings one-hundred and twenty degrees apart from one another. By allowing some epsilon error in the perfect correlations regime, one can find a maximum violation of minus one plus the square root of two using the singlet state and measurement inputs that achieve Tsirelson's bound for the CHSH experiment. The reason is that we show Mermin's inequality is technically the CHSH inequality "in disguise", but with using constraints the CHSH experiment does not use. We derive Mermin's inequality under new conditions and give the projective measurements needed to violate maximally.

In this paper, the numerical simulation for nano-indentation is performed to measure time-dependent behavior of polymeric films. The possibility to extract the relaxed shear modulus of the polymer is evaluated using a rigid ball indenter. The viscoelastic behavior of the polymer was represented by the standard model. The effects of Poisson’s ratio are also discussed. / Singapore-MIT Alliance (SMA)

Ingeniero Civil en Computación / La protección de la confidencialidad de la información manipulada por los programas computacionales es abordada a nivel del código fuente con distintas técnicas. Una de ellas es tipado de seguridad para el control de flujo, que controla el nivel de seguridad donde fluye la información agregando anotaciones a las variables tipadas. La propiedad de seguridad fundamental de control de flujo es conocida como no-interferencia (noninterference), que establece que un observador público no puede obtener conocimiento desde datos confidenciales. A pesar de ser una propiedad muy atractiva, los sistemas reales la vulneran fácilmente, y necesitan mecanismos para desclasificar selectivamente alguna información. En esta dirección, Cruz et al. proponen una forma de desclasificación basada en tipos (type-based declassification), en donde se utilizan las relaciones de subtipos del lenguaje para expresar las políticas de desclasificación de los datos que maneja el programa, en una forma simple y expresiva. A pesar de que el fundamento teórico de la desclasificación basada en tipos está bien descrito, carece de una implementación que permita comprobar la utilidad práctica de la propuesta. En este trabajo, se implementa el análisis de la desclasificación basada en tipos para un subconjunto del lenguaje Dart, un lenguaje de programación de propósito general orientado a objetos desarrollado por Google. Además, se implementó un sistema de inferencia de políticas de desclasificación y una extensión para ambientes de desarrollo, con el objetivo de facilitar el trabajo al programador y mejorar su experiencia.

In dense mating aggregations, such as insect and anuran choruses, signals produced at the same time can overlap and interfere with one another, reducing the ability of receivers to discriminate between individual signals. Thus, evolution by sexual selection is expected to result in mating signal timing strategies that avoid overlap. Patterns of signal alternation between competing males are commonly observed in leks and choruses across taxa. In some species, however, signalers instead deliberately overlap, or ‘synchronize’, their mating signals with neighboring conspecifics. Given the assumed high cost of reduced mate attraction when signals overlap, mating signal synchronization has remained an evolutionary puzzle. Synchronization may be beneficial, however, if overlapping signals reduce the attraction of nontarget receivers (predator avoidance hypothesis). Synchronized signals could also constructively interfere, increasing female attraction to the mating aggregation (the beacon effect hypothesis). I investigate these functions of synchronized signaling in two species of tree frogs that synchronize their mating calls: the pug-nosed tree frog (<i>Smilisca sila</i>) and the Ryukyu Kajika frog (<i>Buergeria japonica</i>). To examine the trade-offs imposed by call synchronization in each species, I conduct a series of field and laboratory playback experiments on target (female frogs) and nontarget (eavesdropping predators) receivers of frog calls. Results from these experiments support both hypotheses, suggesting that synchronized frog calls can reduce the attraction of predators and attract mates to the chorus. In addition, I found reduced preferences for fine-scale call timings in female <i>S. sila</i> and <i>B. japonica</i>, deviating from the expected preferences observed in many other anuran and non-anuran species. Thus, while males may enjoy multiple benefits from synchronized mating signals, relaxed sexual selection for non-synchronous signals may be key to the evolution and maintenance of mating signal synchrony.

No description available.