The aim of this thesis is precise definition of control processes for components of Pressure Limit Valve 5 Generation (PLV5) which is produced by Bosch Diesel Ltd. in Jihlava. The objective was to define measurement methods which ensure identical results of measurement between co. Bosch Diesel Ltd. in Jihlava and suppliers of individual components. The results of this study are introduced into control drawings and described in individual conclusions of the thesis.

The aim of this thesis is to find suitable measures which will lead to the improvement of driver orientation in traffic spaceleading to lower the accident rate in the area. The theoretical part describes the traffic surveys that relate to the topic. Furthermore, the work mentioned detectors used for the implementation of automated traffic surveys. The theoretical part also describes methods that can be used to analyze the selected location and then design the ideal modification. At the end gives an overview of the various measures. In the practical part are different methodologies used for the analysis of selected intersections. Firstly, the analysis of observed conflict situations, including making conflicting diagram, under which was designed to measure. Then, the analysis of traffic accidents. Again, the result was a proposal for possible actions. The main objective was to compare and appreciation of both methodologies and proces design measures to improve driver orientation in the selected location.

This thesis deals with the method of distributed ray tracing focusing on optimalization of this method. The method uses simulation of some attributes of light by distributing rays of lights and it produces high quality and partly realistic images. The price for realitic effects is the high computational complexity of the method. The thesis analysis the theory connected with these aspects. A large part describes optimalizations of this method, i.e. searching for the nearest triangle intersection using kd-trees, quasi random sampling with faster convergence, the use of SSE instruction set and fast ray - triangle intersection. These optimalizations brought a noticable speed - up. The thesis includes description of implementation of these techniques. The implementation itself emphasises the practical usability including generating some advanced animations and universal description of objects.

Strong resonant dipole-dipole interactions in flexible Rydberg aggregates enable the formation of excitons, many-body states which collectively share excitation between atoms. Exciting the most energetic exciton of a linear Rydberg chain whose outer two atoms on one end are closely spaced causes the initiation of an exciton pulse for which electronic excitation and diatomic proximity propagate directed through the chain. The emerging transport of excitation is largely adiabatic and is enabled by the interplay between atomic motion and dynamical variation of the exciton. Here, we demonstrate the coherent splitting of such pulses into two modes, which induce strongly different atomic motion, leading to clear signatures of nonadiabatic effects in atomic density profiles. The mechanism exploits local nonadiabatic effects at a conical intersection, turning them from a decoherence source into an asset. The conical intersection is a consequence of the exciton pulses moving along a linear Rydberg chain and approaching an additional linear, perpendicularly aligned Rydberg chain. The intersection provides a sensitive knob controlling the propagation direction and coherence properties of exciton pulses. We demonstrate that this scenario can be exploited as an exciton switch, controlling direction and coherence properties of the joint pulse on the second of the chains. Initially, we demonstrate the pulse splitting on planar aggregates with atomic motion one-dimensionally constrained and employing isotropic interactions. Subsequently, we confirm the splitting mechanism for a fully realistic scenario in which all spatial restrictions are removed and the full anisotropy of the dipole-dipole interactions is taken into account. Our results enable the experimental observation of non-adiabatic electronic dynamics and entanglement transport with Rydberg atoms. The conical intersection crossings are clearly evident, both in atomic mean position information and excited state spectra of the Rydberg system. This suggests flexible Rydberg aggregates as a test-bench for quantum chemical effects in experiments on much inflated length scales. The fundamental ideas discussed here have general implications for excitons on a dynamic network.

Competition and data protection law are two powerful regimes simultaneously shaping the use of digital information, which has given rise to new interactions between these areas of law. While most views on this intersection emphasize that competition and data protection law must work together, nascent developments indicate that these legal regimes may sometimes conflict.  In the first place, firms faced with antitrust allegations are to an increasing extent invoking the need to protect the privacy of their users to justify their impugned conduct. Here, the conduct could either be prohibited by competition law despite of data protection or justified under competition law because of data protection. In the EU, no such justification attempt has reached court-stage, and it remains unclear how an enforcer ought to deal with such a claim. In the second place, competition law can mandate a firm to provide access to commercially valuable personal data to its rivals under a competition law remedy. Where that is the case, the question arising in this connection is whether an enforcer can and should design the remedy in a way that aligns with data protection law. If so, the issue remains of how that ought to be done. The task of the thesis has been to explore these issues, legally, economically, and coherently.  The thesis has rendered four main conclusions. First, data protection has a justified role in EU competition law in two ways. On the one hand, enhanced data protection can increase the quality of a service and may thus be factored in the competitive analysis as a dimension of quality. On the other, data protection as a human right must be guaranteed in the application of competition law. Second, these perspectives can be squared with the criteria for justifying competition breaches, in that data protection can be invoked to exculpate a firm from antitrust allegations. Third, in that context, the human rights dimension of data protection may entail that the enforcer must consider data protection even if it is not invoked. However, allowing data protection interests to override competition law in this manner is relatively inefficient as it may lead to less innovation, higher costs, and lower revenues. Fourth, the profound importance of data protection in the EU necessarily means that enforcers should accommodate data protection interests in designing competition law remedies which mandate access to personal data. This may be done in several ways, including requirements to anonymize data before providing access, or to oblige the firm to be compliant with data protection law in the process of providing access. The analysis largely confirms that anonymization is the preferable option.

<p>Data je karakterizacija raznih tipova specijalnih elemenata mreže, kao &scaron;to su kodistributivni, neutralni, skrativi, standardni, izuzetni, neprekidni, beskonačno distributivni i drugi i ti rezultati su primenjeni u strukturnim ispitivanjima algebri, posebno u mrežama kongruencija, podalgebri i slabih kongruencija algebri.&nbsp; Specijalni elementi su posebno proučavani i u bipolumrežama i dobijene su nove teoreme reprezentacije za bipolumreže. Ispitana je kolekcija svih mreža sa istim skupom i-nerazloživih elemenata, pokazano je da je ta kolekcija i sama mreža u odnosu na inkluziju i daju se karakterizacije te mreže.&nbsp; Re&scaron;avan je problem preno&scaron;enja mrežnih identiteta sa mreže podalgebri i kongruencija na mrežu slabih kongruencija. Proučavane su osobine svojstva preseka kongruencija i svojstva pro&scaron;irenja kongruencija i neke varijante tih svojstava u vezi sa mrežama slabih kongruencija. Date su karakterizacije mreže slabih kongruencija nekih posebnih klasa algebri i varijeteta, kao &scaron;to su unarne algebra, mreže, grupe, Hamiltonove algebra i druge.</p> / <p>A characterization of various types of special elements in lattices: codistributive,&nbsp; neutral, cancellable, standard, exceptional, continuous, infinitely distributive and others are given, and the results are applied in structural investigations in algebras, in particular in lattices of subalgebras, congruences and weak congruences. Special elements are investigated also in bi-semilattices and new representation theorems for bisemilattices are obtained. The collection of all lattices with the same poset of meet-irreducible elements is studied and it is proved that this collection is a lattice under inclusion and characterizations of this lattice is given.&nbsp; A problem of transferability of lattice identities from lattices of subalgebras and congruences to&nbsp; lattices of weak congruencse of&nbsp; algebras is solved. The congruence intersection property and the congruence extension property as well as various alternations of these properties are investigated in connection with weak congruence lattices. Characterizations of weak congruence lattices of special classes of algebras and varieties, as unary algebras, lattices, groups, Hamiltonian algebras and others are given.</p>

[pt] Na primeira parte da tese, consideramos difeomorfismos com ciclos heterodimensionais associados a um par de selas P e Q de co-índice dois. Provamos que difeomorfismos com ciclos que possuem no mínimo um par de autovalores centrais do ciclo não real geram ciclos heterodimensionais robustos. Além disso, quando os autovalores centrais são não-reais, os ciclos robustos estão associados as continuações das selas iniciais (ou seja, os ciclos podem ser estabilizados). Na segunda parte deste trabalho estudamos mapas produto cruzado sobre aplicações deslocamento (do tipo Bernoulli) com fibras contrativas e dependência Holder nos pontos da base. Provamos que sistemas que satisfazem a propriedade de cobertura exibem blender simbólicos. Estes blenders são generalizações do blender usual cuja principal característica é que suas direções centrais podem ter qualquer dimensão d maior ou igual que 1. / [en] In the first part of the thesis, we consider diffeomorphisms having heterodimensional cycles associated with a pair of saddles P and Q of co-index two. We prove that diffeomorphisms with cycles, which have at least one pair of non-real central eigenvalues, generate robust heterodimensional cycles. Moreover, when both central eigenvalues are non-real, the robust cycles are associated with the continuation of the initial saddles (i.e. the cycle can be stabilized). In the second part of this work we study skew product maps over Bernoulli shifts with contracting fibers and Holder dependence on the base points. We prove that systems satisfying the covering property exhibit symbolic blenders. These blenders are generalizations of the usual blenders whose main property is that their central direction may have any dimension d greater than or equal to 1.

Cette thèse réunit en trois articles mon intérêt éclectique pour la théorie des graphes. Le premier problème étudié est la conjecture de Erdos-Faber-Lovász: La réunion de k graphes complets distincts, ayant chacun k sommets, qui ont deux-à-deux au plus un sommet en commun peut être proprement coloriée en k couleurs. Cette conjecture se caractérise par le peu de résultats publiés. Nous prouvons qu’une nouvelle classe de graphes, construite de manière inductive, satisfait la conjecture. Le résultat consistera à présenter une classe qui ne présente pas les limitations courantes d’uniformité ou de régularité. Le deuxième problème considère une conjecture concernant la couverture des arêtes d’un graphe: Si G est un graphe simple avec alpha(G) = 2, alors le nombre minimum de cliques nécessaires pour couvrir l’ensemble des arêtes de G (noté ecc(G)) est au plus n, le nombre de sommets de G. La meilleure borne connue satisfaite par ecc(G) pour tous les graphes avec nombre d’indépendance de deux est le minimum de n + delta(G) et 2n − omega(racine (n log n)), où delta(G) est le plus petit nombre de voisins d’un sommet de G. Notre objectif a été d’obtenir la borne ecc(G) <= 3/2 n pour une classe de graphes la plus large possible. Un autre résultat associé à ce problème apporte la preuve de la conjecture pour une classe particulière de graphes: Soit G un graphe simple avec alpha(G) = 2. Si G a une arête dominante uv telle que G \ {u,v} est de diamètre 3, alors ecc(G) <= n. Le troisième problème étudie le jeu de policier et voleur sur un graphe. Presque toutes les études concernent les graphes statiques, et nous souhaitons explorer ce jeu sur les graphes dynamiques, dont les ensembles d’arêtes changent au cours du temps. Nowakowski et Winkler caractérisent les graphes statiques pour lesquels un unique policier peut toujours attraper le voleur, appellés cop-win, à l’aide d’une relation <= définie sur les sommets de ce graphe: Un graphe G est cop-win si et seulement si la relation <= définie sur ses sommets est triviale. Nous adaptons ce théorème aux graphes dynamiques. Notre démarche nous mène à une relation nous permettant de présenter une caractérisation des graphes dynamiques cop-win. Nous donnons ensuite des résultats plus spécifiques aux graphes périodiques. Nous indiquons aussi comment généraliser nos résultats pour k policiers et l voleurs en réduisant ce cas à celui d’un policier unique et un voleur unique. Un algorithme pour décider si, sur un graphe périodique donné, k policiers peuvent capturer l voleurs découle de notre caractérisation. / This thesis represents in three articles my eclectic interest for graph theory. The first problem is the conjecture of Erdos-Faber-Lovász: If k complete graphs, each having k vertices, have the property that every pair of distinct complete graphs have at most one vertex in common, then the vertices of the resulting graph can be properly coloured by using k colours. This conjecture is notable in that only a handful of classes of EFL graphs are proved to satisfy the conjecture. We prove that the Erdos-Faber-Lovász Conjecture holds for a new class of graphs, and we do so by an inductive argument. Furthermore, graphs in this class have no restrictions on the number of complete graphs to which a vertex belongs or on the number of vertices of a certain type that a complete graph must contain. The second problem addresses a conjecture concerning the covering of the edges of a graph: The minimal number of cliques necessary to cover all the edges of a simple graph G is denoted by ecc(G). If alpha(G) = 2, then ecc(G) <= n. The best known bound satisfied by ecc(G) for all the graphs with independence number two is the minimum of n + delta(G) and 2n − omega(square root (n log n)), where delta(G) is the smallest number of neighbours of a vertex in G. In this type of graph, all the vertices at distance two from a given vertex form a clique. Our approach is to extend all of these n cliques in order to cover the maximum possible number of edges. Unfortunately, there are graphs for which it’s impossible to cover all the edges with this method. However, we are able to use this approach to prove a bound of ecc(G) <= 3/2n for some newly studied infinite families of graphs. The third problem addresses the game of Cops and Robbers on a graph. Almost all the articles concern static graphs, and we would like to explore this game on dynamic graphs, the edge sets of which change as a function of time. Nowakowski and Winkler characterize static graphs for which a cop can always catch the robber, called cop-win graphs, by means of a relation <= defined on the vertices of such graphs: A graph G is cop-win if and only if the relation <= defined on its vertices is trivial. We adapt this theorem to dynamic graphs. Our approach leads to a relation, that allows us to present a characterization of cop-win dynamic graphs. We will then give more specific results for periodic graphs, and we will also indicate how to generalize our results to k cops and l robbers by reducing this case to one with a single cop and a single robber. An algorithm to decide whether on a given periodic graph k cops can catch l robbers follows from our characterization.

[ES] Desde hace aproximadamente dos décadas, las ayudas tecnológicas a la conducciónn han ido creciendo a un ritmo vertiginoso con la intención de hacer estos sistemas más eficientes y seguros. Estas ayudas a la conducción han ido cubriendo fallos que los investigadores denominan "conducción errática" ó "comportamientos inseguros al volante" y que son decisiones arbitrarias tomadas por un conductor humano, que ponen en peligro a todos los usuarios de la carretera. Estas malas decisiones, sumadas al creciente número de viajes en coche en una ciudad hoy en día (post pandemia), muestran la necesidad de seguir haciendo propuestas tecnológicas, enfocadas a donde se producen interacciones más complejas entre vehículos; por ejemplo, una intersección en hora punta. Los desarrollos en ayudas a la conducción se han orientado en dos temas: el primero sobre la automatización de la conducción (Sistemas Avanzados de Asistencia al Conductor - ADAS y Vehículos Automatizados - AV) y el segundo sobre la gestión del tráfico vial (algoritmos centralizados o distribuidos para el control del tráfico). Aunque en la actualidad hay varias empresas automotrices y centros de investigación trabajando en los dos temas, y en especial en algunos casos eliminando de la ecuación el comportamiento humano, todavía hay carencias en las configuraciones, para que un vehículo autónomo sea capaz de tomar decisiones óptimas, frente a todas las posibles condiciones disponibles en un tráfico vial. Ahora bien, y teniendo en cuenta los dos temas antes mencionados sobre los desarrollos en ayudas a la conducción, los investigadores prevén a grandes rasgos, que para alcanzar mayores niveles de conducción autónoma en la próxima década, es necesario estudiar cómo hacer más eficientes las interacciones autónomas entre vehículos. Por ello, las intersecciones viales son un ejemplo clave, donde es posible analizar casos de interacciones de alta complejidad entre vehículos, ya que se trata de una parte de la infraestructura vial, donde los vehículos comparten carriles, vías, cruces o cambios de carril a voluntad, y que podría generar colisiones en puntos de conflicto y retrasos en los desplazamientos si no existe una cooperación adecuada. De esta forma, en esta tesis se propone una serie de algoritmos distribuidos para el control del tráfico en intersecciones, basados en el intercambio de comunicaciones entre vehículos autónomos (interacciones locales) cercano a las intersecciones y donde se muestran comportamientos emergentes en el tráfico, resultando en cruces de forma cooperativa, segura y eficiente, desde bajas a altas densidades de tráfico vehicular en las intersecciones. Esta investigación se desarrolla utilizando simuladores de tráfico vial, con calles estilo Manhattan; primero implementando escenarios menos complejos con calles urbanas de un carril, y luego incrementando la complejidad con múltiples carriles. / [CA] Des de fa aproximadament dues dècades, les ajudes tecnològiques a la conducció han anat creixent a un ritme vertiginós amb la intenció de fer aquests sistemes més eficients i segurs. Aquestes ajudes a la conducció han anat cobrint fallades que els investigadors denominen "conducció erràtica" o "comportaments insegurs al volant" i que són decisions arbitràries preses per un conductor humà, que posen en perill a tots els usuaris de la carretera. Aquestes males decisions, sumades al creixent nombre de viatges en cotxe en una ciutat avui dia (post pandèmia), mostren la necessitat de seguir fent propostes tecnològiques, enfocades a on es produeixen interaccions més complexes entre vehicles; per exemple, una intersecció en hora punta. Els desenvolupaments en ajudes a la conducció s'han orientat en dos temes: el primer sobre l'automatització de la conducció (Sistemes Avançats d'Assistència al Conductor - ADAS i Vehicles Automatitzats - AV) i el segon sobre la gestió del trànsit vial (algoritmes centralitzats o distribuïts per al control del trànsit). Encara que actualment hi ha diverses empreses automobilístiques i centres de recerca treballant en els dos temes, i en especial en alguns casos eliminant de l'equació el comportament humà, encara hi ha mancances en les configuracions, perquè un vehicle autònom siga capaç de prendre decisions òptimes, davant totes les possibles condicions disponibles en un trànsit vial. Ara bé, i tenint en compte els dos temes abans esmentats sobre els desenvolupaments en ajudes a la conducció, els investigadors preveuen a grans trets, que per assolir majors nivells de conducció autònoma en la propera dècada, és necessari estudiar com fer més eficients les interaccions autònomes entre vehicles. Per això, les interseccions vials són un exemple clau, on és possible analitzar casos d'interaccions d'alta complexitat entre vehicles, ja que es tracta d'una part de la infraestructura vial, on els vehicles comparteixen carrils, vies, creus o canvis de carril a voluntat, i que podria generar col·lisions en punts de conflicte i retards en els desplaçaments si no existeix una cooperació adequada. D'aquesta manera, en aquesta tesi es proposa una sèrie d'algoritmes distribuïts per al control del trànsit en interseccions, basats en l'intercanvi de comunicacions entre vehicles autònoms (interaccions locals) properes a les interseccions i on es mostren comportaments emergents en el trànsit, resultant en creus de forma cooperativa, segura i eficient, des de baixes a altes densitats de trànsit vehicular en les interseccions. Aquesta investigació es desenvolupa utilitzant simuladors de trànsit vial, amb carrers estil Manhattan; primer implementant escenaris menys complexos amb carrers urbans d'un carril, i després incrementant la complexitat amb múltiples carrils. / [EN] Since a couple of decades, the technological driving aids have gone growing at a dizzying pace with the intention of making these systems more efficient and safe. These driving aids have been covering failures that the researchers name "erratic driving" or "unsafe driving behaviors" and are arbitrary decisions taken by a human driver which endanger all road users. These bad decisions in addition to the increasing number of driving commutes in a city nowadays (post pandemic), show the need to continue doing technological proposals focused on where there are more complex interactions between vehicles when density increases; for instance, an intersection in rush hour. The developments in driving aids have been orientated in two topics: the first driving automation (Advanced Driver Assistance Systems - ADAS and Automated Vehicles - AV) and the second road traffic management (centralized or distributed algorithms to traffic control). Although there are currently several automotive companies and research centers working in the two topics, and in special in some cases removing the equation the human behavior, there are still lacks in the configurations for an vehicle autonomous be able to make optimal decisions front to all possible conditions available in a road traffic. Now, and take into account the two topics aforementioned about driving aids developments, researchers broadly envisage that in order to reach autonomous driving levels higher (first topic) in the next decade, is necessary to study how to do autonomous vehicle interactions (second topic) more efficient. Therefore, road intersections are an instance where it is possible to analyse cases of highly complexity interactions between vehicles, because it is a part of road infrastructure where the vehicles sharing lanes, paths, crossings or lane changes at will and it could generate collisions on conflict points and time delay in the commutes if there is not an appropriate cooperation. Hence, this thesis proposes a series of distributed algorithms to traffic control on intersections, based on interchange of communications between autonomous vehicles (local interactions) near to the intersections that show emergent behaviors to crossing cooperative, safe way and efficiency with high densities the traffic system on intersections. This research is developed using simulators with Manhattan-style streets; first implementing scenarios less complex with one-lane city streets and then increase the complexity with multiple-lanes. / González Pinzón, CL. (2024). Distributed Intersection Management Algorithms for Autonomous Vehicles [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/204406

The aim of this diploma thesis is the solution of the traffic situation in the city center of Havlíčkův Brod. Mainly the ground road number II/150 adjustment, which consist in the modification of the two-way traffic to one-way traffic organization in the streets Dolní, Žižkova and Na Ostrově by using the analogy of a roundabout layout, is solved within this thesis. All mentioned modifications simplify the traffic situation, improve the orientation and increase the security and the traffic flow mainly in relation to pedestrians and cyclists. Another part of this thesis is focused on revitalization of the public spaces in front of the community center called Ostrov and junction of existing cycle tracks situated on the both banks of the Sázava river. In relation to this topic the adjustment of rainwater sewerage system, low-voltage above ground network, public lighting, communication electric cables, fire brigade signal lights and low-pressure gas pipeline is also solved.