Relevant bibliographies by topics / D-partition

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'D-partition'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'D-partition.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "D-partition"

1

MULZER, WOLFGANG, and YANNIK STEIN. "ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS." International Journal of Computational Geometry & Applications 24, no. 04 (December 2014): 261–73. http://dx.doi.org/10.1142/s0218195914600073.

Full text
Abstract:
Let P be a d-dimensional n-point set. A partition [Formula: see text] of P is called a Tverberg partition if the convex hulls of all sets in [Formula: see text] intersect in at least one point. We say that [Formula: see text] is t-tolerant if it remains a Tverberg partition after deleting any t points from P. Soberón and Strausz proved that there is always a t-tolerant Tverberg partition with ⌈n/(d + 1)(t + 1)⌉ sets. However, no nontrivial algorithms for computing or approximating such partitions have been presented so far. For d ≤ 2, we show that the Soberón-Strausz bound can be improved, and we show how the corresponding partitions can be found in polynomial time. For d ≥ 3, we give the first polynomial-time approximation algorithm by presenting a reduction to the regular Tverberg problem (with no tolerance). Finally, we show that it is coNP-complete to determine whether a given Tverberg partition is t-tolerant.
APA, Harvard, Vancouver, ISO, and other styles
2

Hwang, Chyi, Li‐Fong Hwang, and Jyh‐Haur Hwang. "Robust D‐partition." Journal of the Chinese Institute of Engineers 33, no. 6 (September 2010): 811–21. http://dx.doi.org/10.1080/02533839.2010.9671671.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Józefiak, Tadeusz, and Jerzy Weyman. "Representation-theoretic interpretation of a formula of D. E. Littlewood." Mathematical Proceedings of the Cambridge Philosophical Society 103, no. 2 (March 1988): 193–96. http://dx.doi.org/10.1017/s0305004100064768.

Full text
Abstract:
This note is a continuation of our attempts (see [3]) to give a satisfactory representation-theoretic justification of the following formula of D. E. Littlewood:where sI is the Schur symmetric function corresponding to a partition I, |I| is the weight of I, r(I) is the rank of I, and the summation ranges over all self-conjugate partitions (i.e. partitions I such that I = I where I is the partition conjugate to I).
APA, Harvard, Vancouver, ISO, and other styles
4

Azhar, Kamran, Sohail Zafar, Agha Kashif, and Zohaib Zahid. "On fault-tolerant partition dimension of graphs." Journal of Intelligent & Fuzzy Systems 40, no. 1 (January 4, 2021): 1129–35. http://dx.doi.org/10.3233/jifs-201390.

Full text
Abstract:
Fault-tolerant resolving partition is natural extension of resolving partitions which have many applications in different areas of computer sciences for example sensor networking, intelligent systems, optimization and robot navigation. For a nontrivial connected graph G (V (G) , E (G)), the partition representation of vertex v with respect to an ordered partition Π = {Si : 1 ≤ i ≤ k} of V (G) is the k-vector r ( v | Π ) = ( d ( v , S i ) ) i = 1 k , where, d (v, Si) = min {d (v, x) |x ∈ Si}, for i ∈ {1, 2, …, k}. A partition Π is said to be fault-tolerant partition resolving set of G if r (u|Π) and r (v|Π) differ by at least two places for all u ≠ v ∈ V (G). A fault-tolerant partition resolving set of minimum cardinality is called the fault-tolerant partition basis of G and its cardinality the fault-tolerant partition dimension of G denoted by P ( G ) . In this article, we will compute fault-tolerant partition dimension of families of tadpole and necklace graphs.
APA, Harvard, Vancouver, ISO, and other styles
5

Gramain, Jean-Baptiste, and Jørn B. Olsson. "On bar lengths in partitions." Proceedings of the Edinburgh Mathematical Society 56, no. 2 (March 21, 2013): 535–50. http://dx.doi.org/10.1017/s0013091512000387.

Full text
Abstract:
AbstractWe present, given an odd integer d, a decomposition of the multiset of bar lengths of a bar partition λ as the union of two multisets, one consisting of the bar lengths in its d-core partition cd(λ) and the other consisting of modified bar lengths in its d-quotient partition. In particular, we obtain that the multiset of bar lengths in cd(λ) is a sub-multiset of the multiset of bar lengths in λ. Also, we obtain a relative bar formula for the degrees of spin characters of the Schur extensions of $\mathfrak{S}_n$. The proof involves a recent similar result for partitions, proved by Bessenrodt and the authors.
APA, Harvard, Vancouver, ISO, and other styles
6

Last, Günter. "Stationary partitions and Palm probabilities." Advances in Applied Probability 38, no. 03 (September 2006): 602–20. http://dx.doi.org/10.1017/s0001867800001191.

Full text
Abstract:
A stationary partition based on a stationary point process N in ℝ d is an ℝ d -valued random field π={π(x): x∈ℝ d } such that both π(y)∈N for each y∈ℝ d and the random partition {{y∈ℝ d : π(y)=x}: x∈N} is stationary jointly with N. Stationary partitions may be considered as general versions of the stationary random tessellations studied in stochastic geometry. As in the special case of the Voronoi tessellation, a stationary partition can be used to relate the underlying stationary probability measure to the associated Palm probability measure of N. In doing so, we will develop some basic theory for stationary partitions and extend properties of stationary tessellations to our more general case. One basic idea is that the stationary measure is (up to a shift) a weighted version of the Palm measure, where the weight is the volume of the typical cell. We will make systematic use of a known modified probability measure. Finally, we use our approach to extend some recent results on the shift coupling of the stationary distribution and the Palm distribution.
APA, Harvard, Vancouver, ISO, and other styles
7

Bogaevskaya, V. G. "Automatic analysis of D-partition." Journal of Physics: Conference Series 788 (January 2017): 012006. http://dx.doi.org/10.1088/1742-6596/788/1/012006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dorey, Nick, Timothy J. Hollowood, and Valentin V. Khoze. "The D-instanton partition function." Journal of High Energy Physics 2001, no. 03 (March 26, 2001): 040. http://dx.doi.org/10.1088/1126-6708/2001/03/040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Neimark, Yu I. "D-partition and robust stability." Computational Mathematics and Modeling 9, no. 2 (April 1998): 160–66. http://dx.doi.org/10.1007/bf02404127.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hansen, Jennie C. "A functional central limit theorem for the Ewens sampling formula." Journal of Applied Probability 27, no. 1 (March 1990): 28–43. http://dx.doi.org/10.2307/3214593.

Full text
Abstract:
For each n > 0, the Ewens sampling formula from population genetics is a measure on the set of all partitions of the integer n. To determine the limiting distributions for the part sizes of a partition with respect to the measures given by this formula, we associate to each partition a step function on [0, 1]. Each jump in the function equals the number of parts in the partition of a certain size. We normalize these functions and show that the induced measures on D[0, 1] converge to Wiener measure. This result complements Kingman's frequency limit theorem [10] for the Ewens partition structure.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "D-partition"

1

Mendez, Barrios César. "Low-Order Controllers for Time-Delay Systems : an Analytical Approach." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00719477.

Full text
Abstract:
The research work presented in this thesis concern to the stability analysis of linear time-delay systems with low-order controllers. This thesis is divided into three parts.The first part of the thesis focus on the study of linear SISO (single-input/single-output) systems with input/output delays, where the feedback loop is closed with a controller of PID-type. Inspired by the geometrical approach developed by Gu et al. we propose an analytical method to find the stability regions of all stabilizing controllers of PID-type for the time-delay system. Based on this same approach, we propose an algorithm to calculate the degree of fragility of a given controller of PID- type (PI, PD and PID).The second part of the thesis focuses on the stability analysis of linear systems under an NCS (Networked System Control) based approach. More precisely, we first focus in the stabilization problem by taking into account the induced network delays and the effects induced by the sampling period. To carry out such an analysis we have adopted an eigenvalue perturbation-based approach.Finally, in the third part of the thesis we tackle certain problems concerning to the behavior of the zeros of a certain class of sampled-data SISO systems. More precisely, given a continuous-time system, we obtain the sampling intervals guaranteeing the invariance of the number of unstable zeros in each interval. To perform such an analysis, we adopt an eigenvalue perturbation-based approach.
APA, Harvard, Vancouver, ISO, and other styles
2

Kim, Jinho. "Représentation et analyse musicale assistée par base de données relationnelle de la partition des variations pour orchestre op. 30 d'Anton Webern : vers un système d'"analyse musicale assistée par base de données relationnelle"." Paris 4, 2006. http://www.theses.fr/2006PA040004.

Full text
Abstract:
Une note présente dans une partition, comme d'autres objets musicaux d'ailleurs, peut être considérée comme étant une entité possédant des propriétés qui peuvent être représentées par des valeurs élémentaires et stockées dans les différentes colonnes d'une même ligne d'une table de base de données relationnelle. La représentation de toutes les notes dans la partition sous forme de tables qui constituent un ensemble de colonnes et de lignes facilite grandement l'accès au caractère ouvert de l'analyse musicale : en effet chacun peut, en fonction de sa propre problématique, interroger la base de données qui représente et stocke la partition. La partition des Variations pour ochestre op. 30 d'Anton Webern, grâce à l'aide précieuse de base de données relationnelle, est représentée, stockée, et analysée de façon classificatoire et paradigmatique : toutes les séries, tous les intervalles, et tous les accords présents dans la partition sont identifiées pour vérifier l'existence des intervalles et des accords dominats ; les particularités liées à l'entropie, à la distribution des notes dans le registre, à la durée, à l'intensité, et à l'écriture orchestrale sont aussi identifiées
A note in a score, as other musical objects, can be considered as an entity having some properties. These last are represented by atomic values in columns on a line of relational data base table. The representation of all notes in the score in relational form of tables as a totality of columns and lines facilitates the access to the music analysis of open character: each can interrogate following each problematic the database that represents and stocks the score. The score of Variations for orchestra op. 30 of Anton Webern, as an example of application of the concept of “Relational Database-aided Music Analysis”, is represented, stored, and analyzed in a classificatory and a paradigmatic way: All sets, all intervals, and all chords existing in the score are retrieved, as a result on can verify the dominant intervals and chords; the particularities concerned distribution of notes in the register, duration, intensity and orchestration are also recognized
APA, Harvard, Vancouver, ISO, and other styles
3

Weinert, Thilo Volker [Verfasser]. "A Potpourri of Partition Properties / Thilo Weinert." Bonn : Universitäts- und Landesbibliothek Bonn, 2014. http://d-nb.info/1057915084/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sullivan, Timothy. "Terrains, for orchestra." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0001/NQ41088.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Adelmann, Stephan [Verfasser]. "On Hydrodynamics in Centrifugal Partition Chromatography / Stephan Adelmann." München : Verlag Dr. Hut, 2014. http://d-nb.info/1053859562/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hermeling, Maike [Verfasser]. "Partition von gasgetragenen Nanopartikeln in Modellblasensäulen / Maike Hermeling." Clausthal-Zellerfeld : Universitätsbibliothek Clausthal, 2011. http://d-nb.info/1010235257/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schneider, René [Verfasser]. "Iterative Partition-Based Moving-Horizon State Estimation / René Schneider." Aachen : Shaker, 2017. http://d-nb.info/1138178179/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Mingming. "Development of the partition of unity finite element method for the numerical simulation of interior sound field." Thesis, Compiègne, 2016. http://www.theses.fr/2016COMP2282/document.

Full text
Abstract:
Dans ce travail, nous avons introduit le concept sous-jacent de PUFEM et la formulation de base lié à l'équation de Helmholtz dans un domaine borné. Le processus d'enrichissement de l'onde plane de variables PUFEM a été montré et expliqué en détail. L'idée principale est d'inclure une connaissance a priori sur le comportement local de la solution dans l'espace des éléments finis en utilisant un ensemble de fonctions d'onde qui sont des solutions aux équations aux dérivées partielles. Dans cette étude, l'utilisation des ondes planes se propageant dans différentes directions a été favorisée car elle conduit à des algorithmes de calcul efficaces. En outre, nous avons montré que le nombre de directions d'ondes planes dépend de la taille de l'élément PUFEM et la fréquence des ondes à la fois en 2D et 3D. Les approches de sélection de ces ondes planes sont également illustrés. Pour les problèmes 3D, nous avons étudié deux systèmes de distribution des directions d'ondes planes qui sont la méthode du cube discrétisé et la méthode de la force de Coulomb. Il a été montré que celle-ci permet d'obtenir des directions d'onde espacées de façon uniforme et permet d'obtenir un nombre arbitraire d'ondes planes attachées à chaque noeud de l'élément de PUFEM, ce qui rend le procédé plus souple.Dans le chapitre 3, nous avons étudié la simulation numérique des ondes se propageant dans deux dimensions en utilisant PUFEM. La principale priorité de ce chapitre est de venir avec un schéma d'intégration exacte (EIS), résultant en un algorithme d'intégration rapide pour le calcul de matrices de coefficients de système avec une grande précision. L'élément 2D PUFEM a ensuite été utilisé pour résoudre un problème de transmission acoustique impliquant des matériaux poreux. Les résultats ont été vérifiés et validés par la comparaison avec des solutions analytiques. Les comparaisons entre le régime exact d'intégration (EIS) et en quadrature de Gauss ont montré le gain substantiel offert par l'EIE en termes de temps CPU.Une 3D exacte Schéma d'intégration a été présenté dans le chapitre 4, afin d'accélérer et de calculer avec précision (jusqu'à la précision de la machine) des intégrales très oscillatoires découlant des coefficients de la matrice de PUFEM associés à l'équation 3D Helmholtz. Grâce à des tests de convergence, un critère de sélection du nombre d'ondes planes a été proposé. Il a été montré que ce nombre ne pousse que quadratiquement avec la fréquence qui donne lieu à une réduction drastique du nombre total de degrés de libertés par rapport au FEM classique. Le procédé a été vérifié pour deux exemples numériques. Dans les deux cas, le procédé est représenté à converger vers la solution exacte. Pour le problème de la cavité avec une source de monopôle située à l'intérieur, nous avons testé deux modèles numériques pour évaluer leur performance relative. Dans ce scénario, où la solution exacte est singulière, le nombre de directions d'onde doit être choisie suffisamment élevée pour faire en sorte que les résultats ont convergé.Dans le dernier chapitre, nous avons étudié les performances numériques du PUFEM pour résoudre des champs sonores intérieurs 3D et des problèmes de transmission d'ondes dans lequel des matériaux absorbants sont présents. Dans le cas particulier d'un matériau réagissant localement modélisé par une impédance de surface. Un des critères d'estimation d'erreur numérique est proposé en considérant simplement une impédance purement imaginaire qui est connu pour produire des solutions à valeur réelle. Sur la base de cette estimation d'erreur, il a été démontré que le PUFEM peut parvenir à des solutions précises tout en conservant un coût de calcul très faible, et seulement environ 2 degrés de liberté par longueur d'onde ont été jugées suffisantes. Nous avons également étendu la PUFEM pour résoudre les problèmes de transmission des ondes entre l'air et un matériau poreux modélisé comme un fluide homogène équivalent
In this work, we have introduced the underlying concept of PUFEM and the basic formulation related to the Helmholtz equation in a bounded domain. The plane wave enrichment process of PUFEM variables was shown and explained in detail. The main idea is to include a priori knowledge about the local behavior of the solution into the finite element space by using a set of wave functions that are solutions to the partial differential equations. In this study, the use of plane waves propagating in various directions was favored as it leads to efficient computing algorithms. In addition, we showed that the number of plane wave directions depends on the size of the PUFEM element and the wave frequency both in 2D and 3D. The selection approaches for these plane waves were also illustrated. For 3D problems, we have investigated two distribution schemes of plane wave directions which are the discretized cube method and the Coulomb force method. It has been shown that the latter allows to get uniformly spaced wave directions and enables us to acquire an arbitrary number of plane waves attached to each node of the PUFEM element, making the method more flexible.In Chapter 3, we investigated the numerical simulation of propagating waves in two dimensions using PUFEM. The main priority of this chapter is to come up with an Exact Integration Scheme (EIS), resulting in a fast integration algorithm for computing system coefficient matrices with high accuracy. The 2D PUFEM element was then employed to solve an acoustic transmission problem involving porous materials. Results have been verified and validated through the comparison with analytical solutions. Comparisons between the Exact Integration Scheme (EIS) and Gaussian quadrature showed the substantial gain offered by the EIS in terms of CPU time.A 3D Exact Integration Scheme was presented in Chapter 4, in order to accelerate and compute accurately (up to machine precision) of highly oscillatory integrals arising from the PUFEM matrix coefficients associated with the 3D Helmholtz equation. Through convergence tests, a criteria for selecting the number of plane waves was proposed. It was shown that this number only grows quadratically with the frequency thus giving rise to a drastic reduction in the total number of degrees of freedoms in comparison to classical FEM. The method has been verified for two numerical examples. In both cases, the method is shown to converge to the exact solution. For the cavity problem with a monopole source located inside, we tested two numerical models to assess their relative performance. In this scenario where the exact solution is singular, the number of wave directions has to be chosen sufficiently high to ensure that results have converged. In the last Chapter, we have investigated the numerical performances of the PUFEM for solving 3D interior sound fields and wave transmission problems in which absorbing materials are present. For the specific case of a locally reacting material modeled by a surface impedance. A numerical error estimation criteria is proposed by simply considering a purely imaginary impedance which is known to produce real-valued solutions. Based on this error estimate, it has been shown that the PUFEM can achieve accurate solutions while maintaining a very low computational cost, and only around 2 degrees of freedom per wavelength were found to be sufficient. We also extended the PUFEM for solving wave transmission problems between the air and a porous material modeled as an equivalent homogeneous fluid. A simple 1D problem was tested (standing wave tube) and the PUFEM solutions were found to be around 1% error which is sufficient for engineering purposes
APA, Harvard, Vancouver, ISO, and other styles
9

Krause, Jonas Frederik [Verfasser]. "Biocatalytic Conversions in a Centrifugal Partition Chromatograph / Jonas Frederik Krause." München : Verlag Dr. Hut, 2018. http://d-nb.info/1155057791/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Perron, Alain. "Duo concertant ; : Dorléac ; Relevés no. 7 ; Séquences voilées ; Double éclat : œuvres musicales." Master's thesis, Université Laval, 1992. http://hdl.handle.net/20.500.11794/28621.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "D-partition"

1

Spheres of influence: The partition of Europe, from Munich to Yalta. London: J. Murray, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Spheres of influence: The great powers partition Europe, from Munich to Yalta. Chicago: I.R. Dee, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Laporte-Castède, Georgette. Chants de noce dans les landes de Gascogne: Partitions de musique traditionelle par D. Betuing, J. Labèque, G. Lamoulie, G. Rémazeilles. Pau: Princi Negue, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

A basis for using fire modeling with 1-D thermal analyses of barriers/partitions to simulate 2-D and 3-D barrier/partition structural performance in real fires. Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

(Editor), Graham Haughton, and Colin C. Williams (Editor), eds. Corporate City?: Partnership, Participation and Partition in Urban Development in Leeds (Urban and Regional Planning and Development D). Avebury, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Smedley, Edward. History of France, Vol. 1: From the Final Partition of the Empire of Charlemagne, A. D. 843, to the Peace of Cambray, A. D. 1529 (Classic Reprint). Forgotten Books, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Borodin, Alexei, and Leonid Petrov. Integrable probability: stochastic vertex models and symmetric functions. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198797319.003.0002.

Full text
Abstract:
This chapter presents the study of a homogeneous stochastic higher spin six-vertex model in a quadrant. For this model concise integral representations for multipoint q-moments of the height function and for the q-correlation functions are derived. At least in the case of the step initial condition, these formulas degenerate in appropriate limits to many known formulas of such type for integrable probabilistic systems in the (1+1)d KPZ universality class, including the stochastic six-vertex model, ASEP, various q-TASEPs, and associated zero-range processes. The arguments are largely based on properties of a family of symmetric rational functions that can be defined as partition functions of the higher spin six-vertex model for suitable domains; they generalize classical Hall–Littlewood and Schur polynomials. A key role is played by Cauchy-like summation identities for these functions, which are obtained as a direct corollary of the Yang–Baxter equation for the higher spin six-vertex model.
APA, Harvard, Vancouver, ISO, and other styles
8

Gardner, Lloyd C. Spheres of Influence: The Great Powers Partition Europe, From Munich to Yalta. Ivan R. Dee, Publisher, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Spheres of Influence: The Great Powers Partition in Europe, From Munich to Yalta. Ivan R. Dee, Publisher, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "D-partition"

1

Chen, Danny Z., and Ewa Misiołek. "Free-Form Surface Partition in 3-D." In Algorithms and Computation, 520–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92182-0_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ding, Qiang, Ke Xu, and Hui-shan Liu. "Construct Optimal Diameter Network and d-partition Routing Algorithm." In Parallel and Distributed Processing and Applications - ISPA 2005 Workshops, 74–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11576259_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Neimark, Juri I. "Mathematical model as a fruitful idea of research. The D-partition." In Foundations of Engineering Mechanics, 501–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-47878-2_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Azuela, Juan Humberto Sossa, Francisco Cuevas de la Rosa, and Héctor Benitez. "Efficient Computation of 3-D Moments in Terms of an Object’s Partition." In Lecture Notes in Computer Science, 301–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-70659-3_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Padrón, Miguel A., and Ángel Plaza. "The 8T-LE Partition Applied to the Barycentric Division of a 3-D Cube." In Lecture Notes in Computational Science and Engineering, 753–62. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-55874-1_74.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yu, Hai-Yan, and Jiu-Lun Fan. "Three-Level Image Segmentation Based on Maximum Fuzzy Partition Entropy of 2-D Histogram and Quantum Genetic Algorithm." In Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 484–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85984-0_58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xie, Yuehong, Weiqin Ying, Yu Wu, Bingshen Wu, Shiyun Chen, and Weipeng He. "Partitioned Parallelization of MOEA/D for Bi-objective Optimization on Clusters." In Communications in Computer and Information Science, 373–81. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-0356-1_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jones, Keith John. "Parallel Reordering and Transfer of Data Between Partitioned Memories of Discrete Hartley for 1-D and m-D Cases." In The Regularized Fast Hartley Transform, 191–205. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68245-3_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sun, Jiachang. "Multi-color Difference Schemes of Helmholtz Equation and Its Parallel Fast Solver over 3-D Dodecahedron Partitions." In Distributed and Parallel Computing, 301–8. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564621_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Déchaine, Rose-Marie. "Partitioning the nominal domain." In Gender and Noun Classification, 17–40. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198828105.003.0002.

Full text
Abstract:
Class qua gender is a mechanism for introducing a partition, i.e. noun classes, into the nominal domain. Treating class/gender as a partition function—a function that exhaustively and non-intersectively assigns all members of a set to a subset—provides insight into the range of variation attested in natural languages relative to the realization of class/gender. This set-theoretic analysis is embedded in a model of interface syntax that allows a given feature’s modus and locus of association to vary. Specifically, the locus of association of class/gender varies such that it can associate with any position in the nominal spine—including Root, n, Number, and D—with concomitant differences in morphology, syntax, and semantics. Also, the modus of association of class/gender can vary, such that it can associate with the nominal spine as a feature of a functional category, e.g. DCLASS, NumberCLASS, nCLASS, ROOTCLASS, or as an independent F-category in the nominal spine. In the latter case, it hosts a distinct F-head (Class), which can be positioned anywhere in the nominal spine. The model is assessed relative to two data sets: (i) the animacy-based gender partition of Plains Cree (central Algonquian): (ii) the classificatory gender (traditionally described as a noun-class system) of Shona (southern Bantu).
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "D-partition"

1

Sambinelli, M., C. N. Lintzmayer, C. N. Da Silva, and O. Lee. "Vertex partition problems in digraphs ⇤." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3174.

Full text
Abstract:
Let D be a digraph and k be a positive integer. Linial (1981) conjectured that the k-norm of a k-minimum path partition of a digraph D is at most max{PC2 C |C| : C is a partial k-coloring of D}. Berge (1982) conjectured that every k-minimum path partition contains a partial k-coloring orthogonal to it. It is well known that Berge's Conjecture implies Linial's Conjecture. In this work, we verify Berge's Conjecture, and consequently Linial's Conjecture, for locally in-semicomplete digraphs and k-minimum path partitions containing only two paths. Moreover, we verify a conjecture related to Berge's and Linial's Conjectures for locally in-semicomplete digraphs.
APA, Harvard, Vancouver, ISO, and other styles
2

Sleiti, A. K., and Ranganathan Kumar. "Effect of Vent Aspect Ratio on Unsteady Laminar Buoyant Flow Through Rectangular Vents in Large Enclosures." In ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-81604.

Full text
Abstract:
The effects of vent aspect ratio on oscillatory flow regime through a horizontal opening were studied numerically. The physical model consisted of a vertical rectangular enclosure divided into two chambers by a horizontal partition. The partitions contained a slot that connected the two chambers. The upper chamber contains cold air and the lower chamber contains hot air. A density differential due to the different temperatures drives the interaction between the two chambers. The opposing forces at the interface between the two chambers create a gravitationally unstable system, and an oscillating exchange of fluid develops. Results were obtained for cases with L/D=1, 0.5, and 2.0, where L represents the thickness of the partition and D represents the slot width of the opening in the partition. Results indicate that the flow exchange increases with partition thickness L/D=0.5 and decreases for L/D=2. The frequency of the oscillatory flow pattern is also examined for the different cases. Sudden bursts of upflow with a corresponding downflow have been documented and compared with experimental observations in the literature. The time traces of velocity and temperature fields for this flow regime reveal interesting mechanisms, which have been explained.
APA, Harvard, Vancouver, ISO, and other styles
3

Hong, Dohy. "D-iteration: Evaluation of a Dynamic Partition Strategy." In 2012 IEEE 14th Int'l Conf. on High Performance Computing and Communication (HPCC) & 2012 IEEE 9th Int'l Conf. on Embedded Software and Systems (ICESS). IEEE, 2012. http://dx.doi.org/10.1109/hpcc.2012.143.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Riera, Pablo E., and Manuel C. Eguía. "Flexible Solver For 1-D Cochlear Partition Simulations." In 171st Meeting of the Acoustical Society of America. Acoustical Society of America, 2016. http://dx.doi.org/10.1121/2.0000437.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cruz, Jadder Bismarck de Sousa, Cândida Nunes da Silva, and Orlando Lee. "Some Partial Results on Linial's Conjecture for Matching-Spine Digraphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/etc.2021.16386.

Full text
Abstract:
Let $k$ be a positive integer. A \emph{partial $k$-coloring} of a digraph $D$ is a set $\calC$ of $k$ disjoint stable sets and has \emph{weight} defined as $\sum_{C \in \calC} |C|$. An \emph{optimal} $k$-coloring is a $k$-coloring of maximum weight. A \emph{path partition} of a digraph $D$ is a set $\calP$ of disjoint paths of $D$ that covers its vertex set and has \emph{$k$-norm} defined as $\sum_{P \in \mathcal{P}} \min\{|P|,k\}$. A path partition $\calP$ is \emph{$k$-optimal} if it has minimum $k$-norm. A digraph $D$ is \emph{matching-spine} if its vertex set can be partitioned into sets $X$ and $Y$, such that $D[X]$ has a Hamilton path and the arc set of $D[Y]$ is a matching. Linial (1981) conjectured that the $k$-norm of a $k$-optimal path partition of a digraph is at most the weight of an optimal partial $k$-coloring. We present some partial results on this conjecture for matching-spine digraphs.
APA, Harvard, Vancouver, ISO, and other styles
6

Fan, Xuhui, Bin Li, Ling Luo, and Scott A. Sisson. "Bayesian Nonparametric Space Partitions: A Survey." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/602.

Full text
Abstract:
Bayesian nonparametric space partition (BNSP) models provide a variety of strategies for partitioning a D-dimensional space into a set of blocks, such that the data within the same block share certain kinds of homogeneity. BNSP models are applicable to many areas, including regression/classification trees, random feature construction, and relational modelling. This survey provides the first comprehensive review of this subject. We explore the current progress of BNSP research through three perspectives: (1) Partition strategies, where we review the various techniques for generating partitions and discuss their theoretical foundation, `self-consistency'; (2) Applications, where we detail the current mainstream usages of BNSP models and identify some potential future applications; and (3) Challenges, where we discuss current unsolved problems and possible avenues for future research.
APA, Harvard, Vancouver, ISO, and other styles
7

Jinggong, Liu, Xue Yali, and Li Donghai. "Calculation of PI controller stable region based on D-partition method." In 2010 International Conference on Control, Automation and Systems (ICCAS 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccas.2010.5669858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sambinelli, M., C. N. Da Silva, and O. Lee. "Diperfect Digraphs." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3173.

Full text
Abstract:
Let D be a digraph. A path partition P of D is a collection of paths such that {V (P ) : P 2 P } is a partition of V (D). We say D is ↵ -diperfect if for every maximum stable set S of D there exists a path partition P of D such that |S \ V (P )| = 1 for all P 2 P and this property holds for every induced subdigraph of D. A digraph C is an anti-directed odd cycle if (i) the underlying graph of C is a cycle x1x2 · · · x2k+1x1, where k 2, (ii) the longest path in C has length 2, and (iii) each of the vertices x1, x2, x3, x4, x6, x8, . . . , x2k is either a source or a sink. Berge (1982) conjectured that a digraph D is ↵ -diperfect if, and only if, D contains no induced anti-directed odd cycle. In this work, we verify this conjecture for digraphs whose underlying graph is series-parallel and for in-semicomplete digraphs.
APA, Harvard, Vancouver, ISO, and other styles
9

CHEN, JIEBO, ZHONGQIN LI, XINGHUA HUANG, and XIAOPING XU. "STUDY ON PARTITION OF D(-)-MANDELIC ACID IN AQUEOUS TWO-PHASE SYSTEMS." In Proceedings of the 4th International Conference. WORLD SCIENTIFIC, 2004. http://dx.doi.org/10.1142/9789812702623_0011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Liang, Shuguang Zhao, Wu Zhu, and Xiaotai Wu. "The Intelligent Partition for 3-D Basic Body Surface Based on Differential Evolution." In 2012 International Symposium on Computer, Consumer and Control (IS3C). IEEE, 2012. http://dx.doi.org/10.1109/is3c.2012.73.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'D-partition' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography