Gotowa bibliografia na temat „Geometrical Partition”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Geometrical Partition”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Geometrical Partition"
DOREY, PATRICK. "PARTITION FUNCTIONS, INTERTWINERS AND THE COXETER ELEMENT". International Journal of Modern Physics A 08, nr 01 (10.01.1993): 193–208. http://dx.doi.org/10.1142/s0217751x93000084.
Pełny tekst źródłaYang, Zeng-hui. "On-the-fly determination of active region centers in adaptive-partitioning QM/MM". Physical Chemistry Chemical Physics 22, nr 34 (2020): 19307–17. http://dx.doi.org/10.1039/d0cp03034a.
Pełny tekst źródłaRivier, N., E. Guyon i E. Charlaix. "A geometrical approach to percolation through random fractured rocks". Geological Magazine 122, nr 2 (marzec 1985): 157–62. http://dx.doi.org/10.1017/s001675680003106x.
Pełny tekst źródłaChen, Jie, i Jun Ting Cheng. "An Improved Method of the Adaptive Hierarchical Space Partition Simplification Algorithm on the Point-Based Model". Advanced Materials Research 915-916 (kwiecień 2014): 1259–65. http://dx.doi.org/10.4028/www.scientific.net/amr.915-916.1259.
Pełny tekst źródłaHOLUB, ŠTĚPÁN, i JUHA KORTELAINEN. "ON PARTITIONS SEPARATING WORDS". International Journal of Algebra and Computation 21, nr 08 (grudzień 2011): 1305–16. http://dx.doi.org/10.1142/s0218196711006650.
Pełny tekst źródłaMIGUET, SERGE, i JEAN-MARC PIERSON. "QUALITY AND COMPLEXITY BOUNDS OF LOAD BALANCING ALGORITHMS FOR PARALLEL IMAGE PROCESSING". International Journal of Pattern Recognition and Artificial Intelligence 14, nr 04 (czerwiec 2000): 463–76. http://dx.doi.org/10.1142/s0218001400000301.
Pełny tekst źródłaCARFORA, M., M. MARTELLINI i A. MARZUOLI. "COMBINATORIAL AND TOPOLOGICAL PHASE STRUCTURE OF NON-PERTURBATIVE n-DIMENSIONAL QUANTUM GRAVITY". International Journal of Modern Physics B 06, nr 11n12 (czerwiec 1992): 2109–21. http://dx.doi.org/10.1142/s0217979292001055.
Pełny tekst źródłaHosseini-Toudeshky, H., M. R. Mofakhami i R. Yarmohammadi. "Sound transmission between partitioned contiguous enclosures". Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 223, nr 5 (4.02.2009): 1091–101. http://dx.doi.org/10.1243/09544062jmes1166.
Pełny tekst źródłaHatzinikitas, Agapitos N. "The Partition Function of the Dirichlet OperatorD2s=∑i=1d(-∂i2)son ad-Dimensional Rectangle Cavity". Journal of Mathematics 2015 (2015): 1–7. http://dx.doi.org/10.1155/2015/785720.
Pełny tekst źródłaPathak, Himanshu, Akhilendra Singh i Indra Vir Singh. "Composite Patch Repair of Structural Member by Coupled FE-EFG Approach". Applied Mechanics and Materials 829 (marzec 2016): 78–82. http://dx.doi.org/10.4028/www.scientific.net/amm.829.78.
Pełny tekst źródłaRozprawy doktorskie na temat "Geometrical Partition"
Pedrini, Mattia. "Moduli spaces of framed sheaves on stacky ALE spaces, deformed partition functions and the AGT conjecture". Doctoral thesis, SISSA, 2013. http://hdl.handle.net/20.500.11767/4807.
Pełny tekst źródłaCHERMISI, MILENA. "Crystalline flow of planar partitions and a geometric approach for systems of PDEs". Doctoral thesis, Università degli Studi di Roma "Tor Vergata", 2006. http://hdl.handle.net/2108/202647.
Pełny tekst źródłaThe present thesis deals with two different subjects. Chapter 1 and Chapter 2 concern interfaces evolution problems in the plane. In Chapter 1 I consider the evolution of a polycrystalline material with three (or more) phases, in presence of for an even crystalline anisotropy ϕo whose one-sublevel set Fϕ := {ϕo ≤ 1} (the Frank diagram) is a regular polygon of n sides. The dual function ϕ : R2 → R defined by ϕ(ξ) := sup{ξ ·η : ϕo(η) ≤ 1} is crystalline too and Wϕ := {ϕ ≤ 1} is called the Wulff shape. I am particularly interested in the motion by crystalline curvature of special planar networks called elementary triods, namely a regular three-phase boundary given by the union of three Lipschitz curves, the interfaces, intersecting at a point called triple junction. Each interface is the union of a segment of finite length and a half-line, reproducing two consecutive sides of Wϕ. I analyze local and global existence and stability of the flow. I prove that there exists, locally in time, a unique stable regular flow starting from a stable regular initial datum. I show that if n, the number of sides of Wϕ, is a multiple of 6 then the flow is global and converge to a homothetic flow as t → +∞. The analysis of the long time behavior requires the study of the stability. Stability is the ingredient that ensures that no additional segments develop at the triple junction during the flow. In general, the flow may become unstable at a finite time: if this occurs and none of the segments desappears, it is possible to construct a regular flow at subsequent times by adding an infinitesimal segment (or even an arc with zero crystalline curvature) at the triple junction. I also show that a segment may desappear. In such a case, the Cahn-Hoffman vector field Nmin has a jump discontinuity and the triple junction translates along the remaining adjacent half-line at subsequent times. Each of these flows has the property that all crystalline curvatures remain bounded (even if a segment appears or disappears). I want to stress that Taylor already predicted the appearance of new edges from a triple junction. I also consider the crystalline curvature flow starting from a stable ϕ-regular partition formed by two adjacent elementary triods. I discuss some examples of collapsing situations that lead to changes of topology, such as for instance the collision of two triple junctions. These examples (as well as the local in time existence result) show one of the advantages of crystalline flows with respect, for instance, to the usual mean curvature flow: explicit computations can be performed to some extent, and in case of nonuniqueness, a comparison between the energies of different evolutions (difficult in the euclidean case) can be made. In Chapter 2 we introduce, using the theory of S1-valued functions of bounded variations, a class of energy functionals defined on partitions and we produce, through the first variation, a new model for the evolution of interfaces which partially extends the one in Chapter 1 and which consists of a free boundary problem defined on S1-valued functions of bounded variation. This model is related to the evolution of polycrystals where the Wulff shape is allowed to rotate. Assuming the local existence of the flow, we show convexity preserving and embeddedness preserving properties. The second subject of the thesis is considered in Chapter 3 where we aim to extend the level set method to systems of PDEs. The method we propose is consistent with the previous research pursued by Evans for the heat equation and by Giga and Sato for Hamilton-Jacobi equations. Our approach follows a geometric construction related to the notion of barriers introduced by De Giorgi. The main idea is to force a comparison principle between manifolds of different codimension and require each sub-level of a solution of the level set equation to be a barrier for the graph of a solution of the corresponding system. We apply the method for a class of systems of first order quasi-linear equations. We compute the level set equation associated with suitable first order systems of conservation laws, with the mean curvature flow of a manifold of arbitrary codimension and with systems of reaction-diffusion equations. Finally, we provide a level set equation associated with the parametric curvature flow of planar curves.
Heller, Julia [Verfasser], i P. [Akademischer Betreuer] Schwer. "Structural properties of non-crossing partitions from algebraic and geometric perspectives / Julia Heller ; Betreuer: P. Schwer". Karlsruhe : KIT-Bibliothek, 2019. http://d-nb.info/1177147238/34.
Pełny tekst źródłaPezzoli, Gian Marco. "Representations of symmetric groups on the homology of dual matroids of complete graphs". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18253/.
Pełny tekst źródłaFernandes, Jeferson Wilian Dossa. "Interação fluido-estrutura com escoamentos incompressíveis utilizando o método dos elementos finitos". Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/18/18134/tde-31032016-165546/.
Pełny tekst źródłaInteraction between fluids and structures characterizes a nonlinear multi-physics problem presente in a wide range of engineering fields. This works presets the development of computational tools based on finite element method (FEM) for fluid-structure interaction (FSI) analysis considering low speed flows (incompressible), as a great part of the engineering problems. Given the topic multidisciplinary nature, it is necessary to study three different subjects: the computational structural dynamics, the computational fluid mechanics and the coupling problem. Regarding structural mechanics, we seek to employ a finite element adequate to FSI simulation, what clearly demands a geometric nonlinear analysis. We chose to employ shell elements with formulation in terms of positions, which avoids problems related to finite rotations approximations. Concerning computational fluid dynamics, we employ a stable method, at same time sensible o structural movements, which is written in the arbitrary Lagrangian-Eulerian (ALE) description. The flow incompressibility demands, for a stable method, the use of elements according to the Ladyzhenskaya-Bbuska-Brezzi (LBB) condition. It is also necessary to employ methods able to neutralize the spurious variations that appears from convection dominated flows when applying the standard Galerking method. In order to overcome this problem, we apply the Streamline-Upwind/Petrov-Galerkin (SUPG) method, which adds artificial diffusivity to the streamline direction, controlling spurious variations. Considering the fluid-shell coupling, we seek modularity and versatility, adopting the partitioned model. The developed coupling model ensure the use of fluid and structure meshes with no need for matching nodes.
Suárez, Sergio Andrés Pardo. "Análise numérica de barras gerais 3D sob efeitos mecânicos de explosões e ondas de choque". Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/18/18134/tde-07032017-103309/.
Pełny tekst źródłaThis work consists in the use of the Finite Element Method (FEM) for numerical analysis of fluid-bar structures, focusing on transient problems involving explosions or other actions with shock waves propagation. For this purpose, one needs to study three different aspects: the computational structural dynamics, the computational fluid dynamics and the coupling problem. Regarding computational structural dynamics, one need firstly to identify the requirements for an element to be adequate to analyze such problems, taking into account the fact that such element should admit large displacements. In order to avoid problems related to finite rotation approximations and to give a realist representation of a 3D bar structure, we chose a formulation defined in terms of positions and that considers the cross-section warping effects. Regarding computational fluid dynamics, we seek for a stable formulation for compressible flows, and at same time, sensitive to the movement of the structure, leading to an explicit time integration algorithm based on characteristics with governing equations described in the Arbitrary Lagrangian-Eulerian (ALE) form. Regarding to coupling, we chose to use a weak (explicit) partitioning coupling model in order to ensure modularity and versatility. The developed coupling scheme is bases on boundary conditions transfer techniques (Dirichlet-Neummann), and we study the effects of using bidirectional or unidirectional boundary conditions transfers.
Vásquez, Rifo Elisa. "Geometric partitions of definable sets and the Cauchy-Crofton formula". 2006. http://www.library.wisc.edu/databases/connect/dissertations.html.
Pełny tekst źródłaLeal, Rúben Telmo Domingues. "Developing Partition Crossovers for Combinatorial Optimisation Problems". Master's thesis, 2021. http://hdl.handle.net/10316/97923.
Pełny tekst źródłaOs operadores de recombinação desempenham um papel importante no desempenho de Algoritmos Evolucionários. Eles geram uma nova solução através da combinação de informação de outras duas soluções. O Problema da Recombinação Ótima (PRO) consiste na geração da melhor solução descendente segundo um dado operador. No entanto, em muitos casos este problema é NP-Difícil. Em particular, isto é verdade para o Problema do Caixeiro Viajante (PCV) quando se considera a recombinação com respeito e trasmissão de arestas.Os Cruzamentos de Partição são operadores de recombinação determinística que resolvem ou aproximam o PRO, explorando as decomposições naturais dos pais tendo em vista a geração de soluções de elevada qualidade, dadas essas decomposições.Geralmente, os Cruzamentos de Partição são combinados com operadores de procura local. As regras sobre as quais estes operadores funcionam definem a estrutura de vizinhança do espaço de procura. No entanto, não se sabe como é que os Cruzamentos de Partição se relacionam com esta estrutura de vizinhança. Mostramos que de facto todos os Cruzamentos de Partição podem ser geométricos sob alguma distância e que, para o caso particular dos Cruzamentos de Partição para o PCV existentes, eles são geométricos de acordo com a distância de bond.Adicionalmente, os Cruzamentos de Partição têm sido aplicados com sucesso em vários problemas de otimização. Apesar das diferenças entre problemas, a sua implementação segue um padrão comum que pode ser generalizado até certo ponto. Portanto, propomos uma Interface de Programação de Aplicações (IPA) para o desenvolvimento de cruzamentos de partição, que identifica claramente as suas operações fundamentais e separa a parte dependente do problema destes operadores, do resto do operador que é independente do problema.Tal IPA realça as relações entre componentes que surgem das decomposições das soluções involvidas e fornece oportunidades para melhorar os cruzamentos de partição existentes. Apresentamos uma análise experimental do Cruzamento de Partição GPX2 à luz do PRO e mostramos como é que a IPA proposta pode ser usada para o melhorar.
Recombination operators play an important role in the performance of Evolutionary Algorithms. They generate a new solution by combining information from other two parent solutions.The Optimal Recombination Problem (ORP) concerns the generation of the best possible offspring solution by a given operator. However, in many cases, this problem is NP-Hard. In particular, this is true for the Traveling Salesman Problem (TSP) when respectful, edge-transmitting recombination is considered.Partition crossovers are deterministic recombination operators that solve or approximate the ORP. They do so by exploiting natural decompositions of the parents in order to generate high-quality solutions given those decompositions. Partition Crossovers are usually combined with local search operators. The rules on which these operators operate define the neighbourhood structure of the search space. However, it is not known how Partition Crossovers relate to this neighbourhood structure. We show that indeed, all Partition Crossovers may be geometric under some distance and, for the particular case of current Partition Crossovers for the TSP, they are geometric for the bond distance.Moreover, partition crossovers have been successfully applied in several optimisation problems. Despite the differences between problems, their implementation follows a common pattern that is generalisable to some extent. Thus, we propose an API for the development of partition crossovers that clearly identifies their basic operations, and separates a problem-dependent part of these operators from the rest of the operator, which is problem-independent.Such an API brings focus to the relations between the components arising throught the decompositions of the solutions involved, and provide opportunities for improving existing partition crossovers. We present an experimental analysis of the GPX2 partition crossover in the light of the ORP, and show how the proposed API could be used to improve it.
FCT
Outro - MobiWise: From Mobile Sensing to Mobility Advising (P2020 SAICTPAC/0011/2015), co-financed by COMPETE 2020, Portugal 2020 -- Operational Program for Competitiveness and Internationalization (POCI), European Union’s European Regional Development Fund (ERDF), and the Foundation for Science and Technology (FCT).
Książki na temat "Geometrical Partition"
Topics in Hyperplane Arrangements. American Mathematical Society, 2017.
Znajdź pełny tekst źródłaCzęści książek na temat "Geometrical Partition"
Qie, Yifan, Lihong Qiao i Nabil Anwer. "A Framework for Curvature-Based CAD Mesh Partitioning". W Lecture Notes in Mechanical Engineering, 228–34. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70566-4_37.
Pełny tekst źródłaEngel, Peter. "Space Partitions". W Geometric Crystallography, 201–39. Dordrecht: Springer Netherlands, 1986. http://dx.doi.org/10.1007/978-94-009-4760-3_9.
Pełny tekst źródłaBoltyanski, V., H. Martini i V. Soltan. "Minimum Convex Partitions of Polygonal Domains". W Geometric Methods and Optimization Problems, 357–429. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5319-9_3.
Pełny tekst źródłaGriggs, Jerrold R. "The Sperner Property in Geometric and Partition Lattices". W The Dilworth Theorems, 298–304. Boston, MA: Birkhäuser Boston, 1990. http://dx.doi.org/10.1007/978-1-4899-3558-8_30.
Pełny tekst źródłaMoraglio, Alberto, i Riccardo Poli. "Geometric Crossover for Sets, Multisets and Partitions". W Parallel Problem Solving from Nature - PPSN IX, 1038–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11844297_105.
Pełny tekst źródłaGriebel, M., i M. A. Schweitzer. "A Particle-Partition of Unity Method Part V: Boundary Conditions". W Geometric Analysis and Nonlinear Partial Differential Equations, 519–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-55627-2_27.
Pełny tekst źródłaBose, Prosenjit, Ferran Hurtado, Eduardo Rivera-Campo i David R. Wood. "Partitions of Complete Geometric Graphs into Plane Trees". W Graph Drawing, 71–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31843-9_9.
Pełny tekst źródłaOhara, Atsumi. "Conformal Flattening on the Probability Simplex and Its Applications to Voronoi Partitions and Centroids". W Geometric Structures of Information, 51–68. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02520-5_4.
Pełny tekst źródłaLi, Gang, Lei Guo, Tuo Zhang, Jingxin Nie i Tianming Liu. "Cortical Sulcal Bank Segmentation via Geometric Similarity Based Graph Partition". W Lecture Notes in Computer Science, 108–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15699-1_12.
Pełny tekst źródłaChen, Xuefeng, Peng Li, Long Lin i Dingkang Wang. "Proving Geometric Theorems by Partitioned-Parametric Gröbner Bases". W Automated Deduction in Geometry, 34–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11615798_3.
Pełny tekst źródłaStreszczenia konferencji na temat "Geometrical Partition"
Sabeur-Bendehina, A., M. Aounallah, L. Adjlout, O. Imine i B. Imine. "Influence of Non Uniform Boundary Conditions on Laminar Free Convection in Wavy Square Cavity With Partial Partitions". W ASME 7th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2004. http://dx.doi.org/10.1115/esda2004-58228.
Pełny tekst źródłaRui Wang, Xinxin Feng, Xiaoying Gan, Jing Liu i Haitao Liu. "Femtocell as a relay: A bargaining solution for femto users partition in geometrical perspective". W 2013 International Conference on Wireless Communications and Signal Processing (WCSP). IEEE, 2013. http://dx.doi.org/10.1109/wcsp.2013.6677095.
Pełny tekst źródłaBianchini, C., M. Micio, L. Tarchi, C. Cortese, E. Imparato i D. Tampucci. "Numerical Analysis of Pressure Losses in Diffuser and Tube Steam Partition Valves". W ASME Turbo Expo 2013: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/gt2013-95527.
Pełny tekst źródłaRui Wang, Junshan Li, Guoqing Liu i Xuhui Li. "3D Geometric Model Region Partition Method". W 2008 7th World Congress on Intelligent Control and Automation. IEEE, 2008. http://dx.doi.org/10.1109/wcica.2008.4594257.
Pełny tekst źródłaZhang, Liping, i Jian S. Dai. "Reconfiguration Mechanism With Interlocking Geometric Constraints From Puzzles". W ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-71488.
Pełny tekst źródłaDinar, Mahmoud. "Parallelized Additive Manufacturing of Variably Partitioned Volumes for Large Scale 3D Printing With Localized Quality". W ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22496.
Pełny tekst źródłaFerreira, Renan U., Edson M. Hung, Ricardo L. de Queiroz i Debargha Mukherjee. "Efficiency improvements for a geometric-partition-based video coder". W 2009 16th IEEE International Conference on Image Processing ICIP 2009. IEEE, 2009. http://dx.doi.org/10.1109/icip.2009.5413818.
Pełny tekst źródłaShan, Hongzhang, Amir Kamil, Samuel Williams, Yili Zheng i Katherine Yelick. "Evaluation of PGAS Communication Paradigms with Geometric Multigrid". W PGAS '14: 8th International Conference on Partitioned Global Address Space Programming Models. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2676870.2676874.
Pełny tekst źródłaShan, Hongzhang, Samuel Williams, Yili Zheng, Amir Kamil i Katherine Yelick. "Implementing High-Performance Geometric Multigrid Solver with Naturally Grained Messages". W 2015 9th International Conference on Partitioned Global Address Space Programming Models (PGAS). IEEE, 2015. http://dx.doi.org/10.1109/pgas.2015.12.
Pełny tekst źródłaTao, Ming, Zhuang Dafang i Yuan Wen. "The Study on Geometrical Distortion of Triangular Partitions in Discrete Global Grid". W 2008 International Workshop on Education Technology and Training & 2008 International Workshop on Geoscience and Remote Sensing. IEEE, 2008. http://dx.doi.org/10.1109/ettandgrs.2008.168.
Pełny tekst źródła