905 resultados para Circle Packing
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
We consider some of the relations that exist between real Szegö polynomials and certain para-orthogonal polynomials defined on the unit circle, which are again related to certain orthogonal polynomials on [-1, 1] through the transformation x = (z1/2+z1/2)/2. Using these relations we study the interpolatory quadrature rule based on the zeros of polynomials which are linear combinations of the orthogonal polynomials on [-1, 1]. In the case of any symmetric quadrature rule on [-1, 1], its associated quadrature rule on the unit circle is also given.
Resumo:
We study two 3-3-1 models with (i) five (four) charge 2/3 (-1/3) quarks and (ii) four (five) charge 2/3 (-1/3) quarks and a vectorlike third generation. Possibilities beyond these models are also briefly considered.
Resumo:
Over the past decade or two, restorative justice has become a popular approach for the criminal justice system to take in Canada, New Zealand, and Australia. In part, this is due in all three countries to an appalling disproportionality in the incarceration rates for racialized minorities. As the authors of "Will the Circle Be Unbroken?" point out, however, governments have been attracted to restorative justice for cost-cutting reasons as well. A burning question, therefore, is whether restorative justice works.
Resumo:
The irregular shape packing problem is approached. The container has a fixed width and an open dimension to be minimized. The proposed algorithm constructively creates the solution using an ordered list of items and a placement heuristic. Simulated annealing is the adopted metaheuristic to solve the optimization problem. A two-level algorithm is used to minimize the open dimension of the container. To ensure feasible layouts, the concept of collision free region is used. A collision free region represents all possible translations for an item to be placed and may be degenerated. For a moving item, the proposed placement heuristic detects the presence of exact fits (when the item is fully constrained by its surroundings) and exact slides (when the item position is constrained in all but one direction). The relevance of these positions is analyzed and a new placement heuristic is proposed. Computational comparisons on benchmark problems show that the proposed algorithm generated highly competitive solutions. Moreover, our algorithm updated some best known results. (C) 2012 Elsevier Ltd. All rights reserved.
Resumo:
Fluorene-based systems have shown great potential as components in organic electronics and optoelectronics (organic photovoltaics, OPVs, organic light emitting diodes, OLEDs, and organic transistors, OTFTs). These systems have drawn attention primarily because they exhibit strong blue emission associated with relatively good thermal stability. It is well-known that the electronic properties of polymers are directly related to the molecular conformations and chain packing of polymers. Here, we used three oligofluorenes (trimer, pentamer, and heptamer) as model systems to theoretically investigate the conformational properties of fluorene molecules, starting with the identification of preferred conformations. The hybrid exchange correlation functional, OPBE, and ZINDO/S-CI showed that each oligomer exhibits a tendency to adopt a specific chain arrangement, which could be distinguished by comparing their UV/vis electronic absorption and C-13 NMR spectra. This feature was used to identify the preferred conformation of the oligomer chains in chloroform-cast films by comparing experimental and theoretical UV/vis and C-13 NMR spectra. Moreover, the oligomer chain packing and dynamics in the films were studied by DSC and several solid state NMR techniques, which indicated that the phase behavior of the films may be influenced by the tendency that each oligomeric chain has to adopt a given conformation.
Resumo:
Chlortalidone (CTD) is an antihypertensive drug for which only two solid state phases have been structurally elucidated thus far. Here, we have prepared a chloroform solvate thereof, namely, CTD Form IV, and its structure was compared to those of Form I and Form III. Its two conformers exhibit a dual structural feature in relation to the antecedent polymorphs. Both CTD molecules of Form IV adopt a Form III-like conformation, which is featured, if the conformation of CTD Form I is used as a reference, by a rotation of about 90 degrees on the axis of the C-C bond bridging the substituted benzene and isoindolinyl rings. However, CTD Form IV assembles as in the Form I crystal packing despite the different stacking fashion of their centrosymmetric dimers. In contrast to Form I, there is no offset stacking in Form IV, which forces a bend of ca. 24 degrees between the planes passing through the isoindolinyl moieties of two [100]-stacked dimers. Chloroform molecules at a maximum stoichiometry of 0.25 mol per mol of the drug play a stabilizing role in the assembly of Form IV by filling the channels formed on the crystals.
Resumo:
Background: Body packing is used for international drug transport, immediate drug concealment during a police searching or introducing drugs inside prisons. Despite the high level of specialization of dealers who have started to manufacture more complex packs, up to 5% of patients could develop intoxication due to pack rupture. Bowel obstruction is another acute complication. Case presentation: A 27-year-old black male patient was sent to the hospital by court order for clinical evaluation and toxicological examination. The patient was conscious, oriented, had good color, normal arterial pressure and heart rate, and no signs of acute intoxication. Abdominal examination revealed discrete pain upon deep palpation and a small mass in the left iliac fossa. A plain abdominal radiograph revealed several oval structures located in the rectum and sigmoid. Fasting and a 50 g dose of activated charcoal every six hours were prescribed. After three days, the patient spontaneously evacuated 28 cocaine packs. Conclusion: Adequate clinical management and prompt identification of potential complications are of fundamental importance in dealing with body packing.
Resumo:
We find conditions for two piecewise 'C POT.2+V' homeomorphisms f and g of the circle to be 'C POT.1' conjugate. Besides the restrictions on the combinatorics of the maps (we assume that the maps have bounded combinatorics), and necessary conditions on the one-side derivatives of points where f and g are not differentiable, we also assume zero mean-nonlinearity for f and g.
Resumo:
Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm
Resumo:
[EN]Often some interesting or simply curious points are left out when developing a theory. It seems that one of them is the existence of an upper bound for the fraction of area of a convex and closed plane area lying outside a circle with which it shares a diameter, a problem stemming from the theory of isoperimetric inequalities. In this paper such a bound is constructed and shown to be attained for a particular area. It is also shown that convexity is a necessary condition in order to avoid the whole area lying outside the circle
Resumo:
This thesis, after presenting recent advances obtained for the two-dimensional bin packing problem, focuses on the case where guillotine restrictions are imposed. A mathematical characterization of non-guillotine patterns is provided and the relation between the solution value of the two-dimensional problem with guillotine restrictions and the two-dimensional problem unrestricted is being studied from a worst-case perspective. Finally it presents a new heuristic algorithm, for the two-dimensional problem with guillotine restrictions, based on partial enumeration, and computationally evaluates its performance on a large set of instances from the literature. Computational experiments show that the algorithm is able to produce proven optimal solutions for a large number of problems, and gives a tight approximation of the optimum in the remaining cases.
Resumo:
Geometric packing problems may be formulated mathematically as constrained optimization problems. But finding a good solution is a challenging task. The more complicated the geometry of the container or the objects to be packed, the more complex the non-penetration constraints become. In this work we propose the use of a physics engine that simulates a system of colliding rigid bodies. It is a tool to resolve interpenetration conflicts and to optimize configurations locally. We develop an efficient and easy-to-implement physics engine that is specialized for collision detection and contact handling. In succession of the development of this engine a number of novel algorithms for distance calculation and intersection volume were designed and imple- mented, which are presented in this work. They are highly specialized to pro- vide fast responses for cuboids and triangles as input geometry whereas the concepts they are based on can easily be extended to other convex shapes. Especially noteworthy in this context is our ε-distance algorithm - a novel application that is not only very robust and fast but also compact in its im- plementation. Several state-of-the-art third party implementations are being presented and we show that our implementations beat them in runtime and robustness. The packing algorithm that lies on top of the physics engine is a Monte Carlo based approach implemented for packing cuboids into a container described by a triangle soup. We give an implementation for the SAE J1100 variant of the trunk packing problem. We compare this implementation to several established approaches and we show that it gives better results in faster time than these existing implementations.
Resumo:
The thaumatrope consists of a circle of cardstock, 2.5 inches in diameter with 2 strings attached, one each at opposite points of the diameter. There were 2 images painted on the cardstock, one on each side, with their positions inverted. The outline of the image was usually printed and the color hand-painted in (Barnes 7).