Literatura académica sobre el tema "Perfect tiling problem"

We calculate the configurational entropy of random tilings obtained by elementary flips from a perfect octagonal tiling with an octagonal boundary. We map the problem of generating all configurations onto a partition problem. We calculate numerically the number of configurations and the associated entropy. We give some exact expressions in restricted cases and upper bounds for the entropy in the asymptotic case.

We study the problem of perfect tiling in the plane and explore the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given, and one has to decide whether it can tile the plane or a rectangle or not. Previously, it has been proved that tiling the plane is not feasible using a set of odd numbers or an infinite sequence of natural numbers including exactly two odd numbers. The problem is open for different situations in which the number of odd numbers is arbitrary. In addition to providing a solution to this special case, we discuss some open problems to tile the plane and rectangles in this paper.

Abstract. Lagrangian particle tracking schemes allow a wide range of flow and transport processes to be simulated accurately, but a major challenge is numerically implementing the inter-particle interactions in an efficient manner. This article develops a multi-dimensional, parallelized domain decomposition (DDC) strategy for mass-transfer particle tracking (MTPT) methods in which particles exchange mass dynamically. We show that this can be efficiently parallelized by employing large numbers of CPU cores to accelerate run times. In order to validate the approach and our theoretical predictions we focus our efforts on a well-known benchmark problem with pure diffusion, where analytical solutions in any number of dimensions are well established. In this work, we investigate different procedures for “tiling” the domain in two and three dimensions (2-D and 3-D), as this type of formal DDC construction is currently limited to 1-D. An optimal tiling is prescribed based on physical problem parameters and the number of available CPU cores, as each tiling provides distinct results in both accuracy and run time. We further extend the most efficient technique to 3-D for comparison, leading to an analytical discussion of the effect of dimensionality on strategies for implementing DDC schemes. Increasing computational resources (cores) within the DDC method produces a trade-off between inter-node communication and on-node work. For an optimally subdivided diffusion problem, the 2-D parallelized algorithm achieves nearly perfect linear speedup in comparison with the serial run-up to around 2700 cores, reducing a 5 h simulation to 8 s, while the 3-D algorithm maintains appreciable speedup up to 1700 cores.

Context. Existing cosmological simulation methods lack a high degree of parallelism due to the long-range nature of the gravitational force, which limits the size of simulations that can be run at high resolution. Aims. To solve this problem, we propose a new, perfectly parallel approach to simulate cosmic structure formation, which is based on the spatial COmoving Lagrangian Acceleration (sCOLA) framework. Methods. Building upon a hybrid analytical and numerical description of particles’ trajectories, our algorithm allows for an efficient tiling of a cosmological volume, where the dynamics within each tile is computed independently. As a consequence, the degree of parallelism is equal to the number of tiles. We optimised the accuracy of sCOLA through the use of a buffer region around tiles and of appropriate Dirichlet boundary conditions around sCOLA boxes. Results. As a result, we show that cosmological simulations at the degree of accuracy required for the analysis of the next generation of surveys can be run in drastically reduced wall-clock times and with very low memory requirements. Conclusions. The perfect scalability of our algorithm unlocks profoundly new possibilities for computing larger cosmological simulations at high resolution, taking advantage of a variety of hardware architectures.

The Finite Element (FEM) is applied to solve the governing equations of lubrication of the piston rings and to calculate the friction force on each ring. The ring is assumed to have a circular profile in the direction of motion. This profile changes with time because tilting of the ring with the engine cycle is taken into account. In the circumferential direction, the ring is assumed to be a perfect circle and the bore cross-section is assumed elliptic. Mixed lubrication is considered when the oil film thickness becomes smaller than a certain value which depends upon the roughness of the surfaces in contact. The friction coefficient for this lubrication is taken as a function of the oil film thickness and the surface roughness. The predictions of the friction force are compared with experimental friction data for the same engine.

This 74-in-diameter blower had an overhung rotor design of titanium construction, operating at 50 pounds per square inch gauge in a critical chemical plant process. The shaft was supported by oil-film bearings and was directdriven by a 3000-hp electric motor through a metal disk type of coupling. The operating speed was 1780 rpm. The blower shaft and motor shaft motion was monitored by Bently Nevada proximity probes and a Model 3100 monitoring system.Although the blowers showed very satisfactory vibration levels during test runs at the manufacturer's plant, the vibration levels in situ had always been higher than was desirable. After several months of monitoring showed ever increasing vibration levels, one of the blowers was shut down in order to diagnose and resolve the problem.Several steps were taken to diagnose the problem: (1) The rotor was removed and the shop balance was checked and corrected. (2) The bearing support movement due to thermal expansion was measured. Then the shafts were misaligned in the cold condition in order to achieve near-perfect shaft alignment during normal operation. (3) The expected shaft vibration at the bearings was determined using lateral rotor dynamics analysis, including critical speed mapping. (4) A heavy sleeve was added to the blower shaft to increase the radial load on the drive-end bearing. (5) The metal disk type of coupling was replaced by a gear coupling. (6) The finite element and impact of the bearing support pedestal were tested to determine the stiffness of the bearing support. (7) The shaft movement was measured during a coast-down. (8)Tilting-pad bearings were evaluated as a possible replacement for the original standard sleeve type of hydrodynamic oil-film bearings.The final solution showed the importance of coupling angular stiffness (often rarely considered in machine design), rotor dynamic analysis, and field alignment.

Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$ has a long history, culminating in the K\"uhn--Osthus theorem [Combinatorica 2009] which resolves this problem, up to an additive constant, for all graphs $F$. We initiate the study of the analogous question for edge-ordered graphs. In particular, we characterize for which edge-ordered graphs $F$ this problem is well-defined. We also apply the absorbing method to asymptotically determine the minimum degree threshold for forcing a perfect $P$-tiling in an edge-ordered graph, where $P$ is any fixed monotone path.

A polyomino is a polygonal region with axis-parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems with polyomino pieces and a polyomino container P . We give polynomial-time algorithms for deciding if P can be tiled with k × k squares for any fixed k which can be part of the input (that is, deciding if P is the union of a set of non-overlapping k × k squares) and for packing P with a maximum number of non-overlapping and axis-parallel 2 × 1 dominos, allowing rotations by 90°. As packing is more general than tiling, the latter algorithm can also be used to decide if P can be tiled by 2 × 1 dominos. These are classical problems with important applications in VLSI design, and the related problem of finding a maximum packing of 2 × 2 squares is known to be NP-hard [6]. For our three problems there are known pseudo-polynomial-time algorithms, that is, algorithms with running times polynomial in the area or perimeter of P . However, the standard, compact way to represent a polygon is by listing the coordinates of the corners in binary. We use this representation, and thus present the first polynomial-time algorithms for the problems. Concretely, we give a simple O ( n log n )-time algorithm for tiling with squares, where n is the number of corners of P . We then give a more involved algorithm that reduces the problems of packing and tiling with dominos to finding a maximum and perfect matching in a graph with O ( n 3 ) vertices. This leads to algorithms with running times \(O({n^3 \frac{\log ^3 n}{\log ^2\log n} }) \) and \(O({n^3 \frac{\log ^2 n}{\log \log n} }) \) , respectively.

The traffic challenges faced by the Indonesian nation today are traffic violations, traffic jams and traffic crimes. These traffic violations can give rise to new problems that have more fatal consequences, for example they can result in traffic accidents and increase the death rate due to traffic accidents. The government's effort to respond to this is by instructing it to use information and communication technology to improve effective, excellent service and efficiency of public services and support transparency of public services. With a government policy related to providing services to the public using electronic services, the Chief of the Republic of Indonesia Police (KAPOLRI) then realized or implemented this policy by creating an electronic ticketing service (e-Tilang). The e-Tilang program has been implemented in Jember Regency since 2021. The implementation of the e-Tilang system in Jember Regency is still not optimal because there are many factors that hinder the realization of traffic order. So, this also has a big influence in measuring the effectiveness of implementing the e-Tilang system. This research uses a statutory approach and a conceptual approach, with a normative juridical research type. The implementation of e-Tilang in Jember Regency originally used CCTV cameras or what is usually called Electronic Traffic Law Enforcement (ETLE). However, the implementation is still not optimal, therefore to perfect the e-Tilang technology there is INCAR innovation using a mobile camera. The implementation of e-Tiling for traffic violators in Jember Regency has not been implemented optimally. Because, law enforcement for traffic violators in Jember Regency still requires the use of manual ticketing methods. So, it is necessary to improve the e-Tilang system which has been implemented throughout Indonesia, especially the new innovation, namely the INCAR car.

Étant donné un k-graph (hypergraphe k-uniforme) F, la densité de Turán π(F) de F est la densité maximale parmi tous les k-graphes F-libres. Déterminer π(F) pour un k-graph donné F est un problème extrémal classique. Étant donnés deux k-graphes F et H, un F-facteur de H est une collection de copies de F disjointes sur les sommets de H qui couvrent ensemble tous les sommets de H. Les problèmes de F-facteurs, en tant que renforcement du problème de Turán, visent à trouver des conditions extrémales sur H garantissant un F-facteur, ce qui a également une histoire longue et profonde. Dans cette thèse, nous utilisons de nombreux outils puissants, dont la méthode probabiliste, la méthode de régularité des hypergraphes et la méthode d'absorption, pour étudier les densités de Turán et les F-facteurs de k-graphes F donnés dans des hypergraphes uniformément denses. Contrairement aux graphes, nous savons tous qu'il existe plusieurs notions non équivalentes de quasi-aléatoire dans les k-graphes pour k ≥ 3. Par conséquent, notre travail propose également plusieurs définitions non équivalentes de k-graphes uniformément denses. En gros, un k-graphe H est (d, μ, ⋆)-dense signifie qu'il est d-dense et ⋆-quasi-aléatoire pour une petite valeur de μ > 0 par rapport à des structures aléatoires données. En se limitant aux 3-graphes (d, μ, 1)-dense, la densité de Turán d'un 3-graphe donné F est notée π1(F). La détermination de π1(F) a été suggérée par Erdős et Sós dans les années 1980. En 2018, Reiher, Rödl et Schacht ont étendu le concept de 3-graphes (d, μ, 1)-dense à des k-graphes (d, μ, k-2)-dense pour k ≥ 3, et ils ont proposé l'étude de la densité de Turán uniforme πk-2(F) pour un k-graphe donné F dans des k-graphes (d, μ, k-2)-dense. En particulier, ils ont montré que πk-2(•) saute de 0 à au moins k-à-la-moins-k-ème puissance. Dans cette thèse, nous obtenons une condition suffisante pour les 3-graphes F qui satisfont π1(F) = 1/4. De manière intéressante, actuellement, tous les 3-graphes F connus dont π1(F) est de 1/4 satisfont cette condition. De plus, nous construisons également quelques 3-graphes intrigants F avec π1(F) = 1/4. Pour les k-graphes, nous donnons un cadre pour étudier πk-2(F) pour n'importe quel k-graphe F. En utilisant ce cadre, nous donnons une condition suffisante pour les k-graphes F satisfaisant πk-2(F) est k-à-la-moins-k-ème puissance, et nous construisons une famille infinie de k-graphes avec πk-2(F) est k-à-la-moins-k-ème puissance. En 2016, Lenz et Mubayi ont posé le problème de caractériser les k-graphes F tels que chaque k-graphe H suffisamment grand (d, μ, dot)-dense avec d > 0, v(F)|v(H) et un degré minimum de sommet positif contient un F-facteur. Motivés par ce problème, nous démontrons un théorème général sur les F-facteurs qui réduit le problème des F-facteurs de Lenz et Mubayi à un sous-problème naturel, c'est-à-dire le problème de F-cover. En utilisant ce résultat, nous répondons à la question de Lenz et Mubayi pour ceux F qui sont des k-graphes k-partis et pour tous les 3-graphes F, séparément. Dans le travail de Lenz et Mubayi, ils ont également construit une séquence de 3-graphes (1/8, μ, dot)-dense avec un degré minimum de sommet positif n'ayant pas de F-facteur, où F est un 3-graph k-parti complet équilibré. Dans cette thèse, nous prouvons que 1/8 est le seuil de densité pour garantir tous les 3-graphes 3-partis facteurs dans (d, μ, dot)-dense 3-graphes avec une condition de minimum degré de sommet Ω(n). De plus, nous montrons que l'on ne peut pas remplacer la condition de minimum degré de sommet par une condition de minimum degré de sommet. En particulier, nous étudions le seuil de densité optimal des F-facteurs pour chaque 3-graph 3-parti F dans (d, μ, dot)-dense 3-graphes avec un minimum degré de sommet Ω(n). De plus, nous étudions également les problèmes de F-facteurs pour les k-graphes k-partis F avec une hypothèse quasi-aléatoire plus forte et un minimum degré de sommet positif
Given a k-graph (k-uniform hypergraph) F, the Turán density π(F) of F is the maximum density among all F-free k-graphs. Determining π(F) for a given k-graph F is a classical extremal problem. Given two k-graphs F and H, a perfect F-tiling (or F-factor) of H is a collection of vertex-disjoint copies of F in H that together cover all the vertices of H. Perfect tiling problems, as a strengthening of the Turán problem, aim to find extremal conditions on H which guarantee an F-factor, which also has a long and profound history. In this thesis, we use many powerful tools including the probabilistic method, hypergraph regularity method and absorbing method to study Turán densities and perfect tilings of given k-graphs F in uniformly dense hypergraphs. Unlike graphs, we all know that there are several non-equivalent notions of quai-randomness in k-graphs for k ≥ 3. Hence, our work also has several non-equivalent definitions of uniformly dense k-graphs. Roughly speaking, a k-graph H is (d, μ, ⋆)-dense means that it is d-dense and ⋆-quai-randomness for some small μ > 0 with respect to given random structures. Restricting to (d, μ, 1)-dense 3-graphs, the Turán density of a given 3-graph F is denoted by π1(F). Determining π1(F) was suggested by Erdős and Sós in the 1980s. In 2018, Reiher, Rödl and Schacht extended the concept of (d, μ, 1)-dense 3-graphs to (d, μ, k-2)-dense k-graphs for k ≥ 3, and they proposed the study of uniform Turán density πk-2(F) for a given k-graph F in (d, μ, k-2)-dense k-graphs. In particular, they showed that πk-2(•) “jumps” from 0 to at least k-to-the-minus-kth-power. In this thesis, we obtain a sufficient condition for 3-graphs F which satisfy π1(F)= 1/4. Interestingly, currently all known 3-graphs F whose π1(F) is 1/4 satisfy this condition. In addition, we also construct some intriguing 3-graphs F with π1(F) = 1/4. For k-graphs, we give a framework to study πk-2(F) for any k-graph F. By using this framework, we give a sufficient condition for k-graphs F satisfying πk-2(F) is k-to-the-minus-kth-power, and construct an infinite family of k-graphs with πk-2(F) is k-to-the-minus-kth-power.In 2016, Lenz and Mubayi posed the problem of characterizing the k-graphs F such that every sufficiently large (d, μ, dot)-dense k-graph H with d > 0, v(F)|v(H) and positive minimum vertex degree contains an F-factor. Motivated by this problem, we prove a general theorem on F-factors which reduces the F-factors problem of Lenz and Mubayi to a natural sub-problem, that is, the F-cover problem. By using this result, we answer the question of Lenz and Mubayi for those F which are k-partite k-graphs and for all 3-graphs F, separately. In the work of Lenz and Mubayi, they also constructed a sequence of (1/8, μ, dot)-dense 3-graphs with positive minimum vertex degree having no F-factor, where F is a balanced complete 3-partite 3-graph. In this thesis, we prove that 1/8 is the density threshold for ensuring all 3-partite 3-graphs perfect tilings in (d, μ, dot)-dense 3-graphs given a minimum codegree condition Ω(n). Moreover, we show that one can not replace the minimum codegree condition with a minimum vertex degree condition. In particular, we study the optimal density threshold of F-factors for each 3-partite 3-graph F in (d, μ, dot)-dense 3-graphs with minimum codegree Ω(n). In addition, we also study F-factor problems for k-partite k-graphs F with stronger quasi-random assumption and positive minimum 1-degree