Relevant bibliographies by topics / Partitions

Contents

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

Academic literature on the topic 'Partitions'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 August 2024

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 'Partitions.'

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 "Partitions"

1

Devi, E. Anna, and J. Martin Leo Manickam. "Reconnection of Wireless Sensor Network Partitions on Multi-Agent Platform." International Journal of Business Analytics 6, no. 1 (January 2019): 43–54. http://dx.doi.org/10.4018/ijban.2019010103.

Full text
Abstract:
In wireless sensor networks, repairing partitions is of high priority. Various methods have been proposed for detecting partitions in the networks. One approach for reconnecting a partitioned network is to repair partitions using mobile nodes. For reconnecting the partitions approaches like transmission range adjustment and message ferry methods have been proposed but these are based on the degree of connectivity with neighbors. In the proposed method, we consider a partition detection system where the base station knows the position of the sensor nodes and the base station communicates with the nodes at regular intervals. The failure of the base station to communicate with a group of sensor nodes located together is the proof that some partitions have occurred. There could be two or more partitions occurring at a time and so multiple mobile nodes are to be employed. The aim of the algorithm is to coordinate among the mobile nodes and the partitioned network and to reconnect the partition. Here the safety of nodes, security of the network and scalability are considered.
APA, Harvard, Vancouver, ISO, and other styles
2

Hoang, Loc, Roshan Dathathri, Gurbinder Gill, and Keshav Pingali. "CuSP." ACM SIGOPS Operating Systems Review 55, no. 1 (June 2, 2021): 47–60. http://dx.doi.org/10.1145/3469379.3469385.

Full text
Abstract:
Graph analytics systems must analyze graphs with billions of vertices and edges which require several terabytes of storage. Distributed-memory clusters are often used for analyzing such large graphs since the main memory of a single machine is usually restricted to a few hundreds of gigabytes. This requires partitioning the graph among the machines in the cluster. Existing graph analytics systems use a built-in partitioner that incorporates a particular partitioning policy, but the best policy is dependent on the algorithm, input graph, and platform. Therefore, built-in partitioners are not sufficiently flexible. Stand-alone graph partitioners are available, but they too implement only a few policies. CuSP is a fast streaming edge partitioning framework which permits users to specify the desired partitioning policy at a high level of abstraction and quickly generates highquality graph partitions. For example, it can partition wdc12, the largest publicly available web-crawl graph with 4 billion vertices and 129 billion edges, in under 2 minutes for clusters with 128 machines. Our experiments show that it can produce quality partitions 6× faster on average than the state-of-theart stand-alone partitioner in the literature while supporting a wider range of partitioning policies.
APA, Harvard, Vancouver, ISO, and other styles
3

Ramdhani, Vivi, and Fathur Rahmi. "The Partition Dimension of a Path Graph." Sainstek : Jurnal Sains dan Teknologi 13, no. 2 (December 31, 2021): 66. http://dx.doi.org/10.31958/js.v13i2.4719.

Full text
Abstract:
Resolving partition is part of graph theory. This article, explains about resolving partition of the path graph, with. Given a connected graph and is a subset of writen . Suppose there is , then the distance between and is denoted in the form . There is an ordered set of -partitions of, writen then the representation of with respect tois the The set of partitions ofis called a resolving partition if the representation of each to is different. The minimum cardinality of the solving-partition to is called the partition dimension of G which is denoted by . Before getting the partition dimension of a path graph, the first step is to look for resolving partition of the graph. Some resolving partitions of path graph, with , and are obtained. Then, the partition dimension of the path graph which is the minimum cardinality of resolving partition, namely pd (Pn)=2Resolving partition is part of graph theory. This article, explains about resolving partition of the path graph, with. Given a connected graph and is a subset of writen . Suppose there is , then the distance between and is denoted in the form . There is an ordered set of -partitions of, writen then the representation of with respect tois the The set of partitions ofis called a resolving partition if the representation of each to is different. The minimum cardinality of the solving-partition to is called the partition dimension of G which is denoted by . Before getting the partition dimension of a path graph, the first step is to look for resolving partition of the graph. Some resolving partitionsof path graph, with , and are obtained. Then, the partition dimension of the path graph which is the minimum cardinality of resolving partition, namely.
APA, Harvard, Vancouver, ISO, and other styles
4

CUI, SU-PING, and NANCY SHAN SHAN GU. "CONGRUENCES FOR k DOTS BRACELET PARTITION FUNCTIONS." International Journal of Number Theory 09, no. 08 (December 2013): 1885–94. http://dx.doi.org/10.1142/s1793042113500644.

Full text
Abstract:
Andrews and Paule introduced broken k-diamond partitions by using MacMahon's partition analysis. Recently, Fu found a generalization which he called k dots bracelet partitions and investigated some congruences for this kind of partitions. In this paper, by finding congruence relations between the generating function for 5 dots bracelet partitions and that for 5-regular partitions, we get some new congruences modulo 2 for the 5 dots bracelet partition function. Moreover, for a given prime p, we study arithmetic properties modulo p of k dots bracelet partitions.
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Yu, Jianfeng Wu, Chunfu Lu, Zhichuan Tang, and Chengmin Li. "Pillow Support Model with Partitioned Matching Based on Body Pressure Distribution Matrix." Healthcare 9, no. 5 (May 12, 2021): 571. http://dx.doi.org/10.3390/healthcare9050571.

Full text
Abstract:
(1) Objective: Sleep problems have become one of the current serious public health issues. The purpose of this research was to construct an ideal pressure distribution model for head and neck support through research on the partitioned support surface of a pillow in order to guide the development of ergonomic pillows. (2) Methods: Seven typical memory foam pillows were selected as samples, and six subjects were recruited to carry out a body pressure distribution experiment. The average value of the first 10% of the samples in the comfort evaluation was calculated to obtain the relative ideal body pressure distribution matrix. Fuzzy clustering was performed on the ideal matrix to obtain the support surface partition. The ideal body pressure index of each partition was calculated, and a hierarchical analysis of each partition was then performed to determine the pressure sensitivity weight of each partition. Using these approaches, the key ergonomic node coordinates of the partitions of four different groups of people were extracted. The ergonomic node coordinates and the physical characteristics of the material were used to design a pillow prototype. Five subjects were recruited for each of the four groups to repeat the body pressure distribution experiment to evaluate the pillow prototype. (3) Results: An ideal support model with seven partitions, including three partitions in the supine position and four partitions in the lateral position, was constructed. The ideal body pressure distribution matrix and ideal body pressure indicators and pressure sensitivity weights for each partition were provided. The pillow that was designed and manufactured based on this model reproduced the ideal pressure distribution matrix evaluated by various groups of people. (4) Conclusion: The seven-partition ideal support model can effectively describe the head and neck support requirements of supine and lateral positions, which can provide strong support for the development of related products.
APA, Harvard, Vancouver, ISO, and other styles
6

Merca, Mircea, and Iulia-Ionelia Radu. "Plane Partitions as Sums over Partitions." Symmetry 15, no. 10 (September 25, 2023): 1820. http://dx.doi.org/10.3390/sym15101820.

Full text
Abstract:
In this paper, we consider complete homogeneous symmetric functions and provide a new formula for the number of plane partitions of n. This formula expresses the number of plane partitions of n in terms of binomial coefficients as a sum over all the partitions of n, considering the multiplicity of the parts greater than one. We obtain similar results for the number of strict plane partition of n and the number of symmetric plane partitions of n.
APA, Harvard, Vancouver, ISO, and other styles
7

Thompson, J. M., and R. M. Butterfield. "Changes in body composition relative to weight and maturity of Australian Dorset Horn rams and wethers 4. Adipocyte volume and number in dissected fat partitions." Animal Production 46, no. 3 (June 1988): 387–93. http://dx.doi.org/10.1017/s0003356100018997.

Full text
Abstract:
ABSTRACTThe effect of castration on the cellular characteristics of dissected fat partitions was examined in 20 Dorset Horn rams and 20 Dorset Horn wethers. Cellular characteristics of dissected carcass (subcutaneous and intermuscular partitions) and non-carcass (kidney fat, omental and mesenteric partitions) fat partitions were examined in 13 mature animals, and the rate of change in adipocyte volume relative to the change in chemical-fat weight in that partition, examined in 27 immature animals.Mature wethers had a greater concentration of chemical fat in the subcutaneous fat partition than mature rams (917 v. 885 g/kg, respectively). This, in combination with a greater weight of dissected subcutaneous fat, resulted in a greater weight of chemical fat in the subcutaneous partition of wethers compared with rams. Mature wethers had larger adipocytes than mature rams in all dissected fat partitions, with the largest increase in the subcutaneous and omental fat partitions. The increased adipocyte volume in the dissected fat partitions in mature wethers resulted in a smaller total estimated number of adipocytes in all carcass and non-carcass fat partitions compared with mature rams.Standardized allometric coefficients for adipocyte volume relative to chemical-fat weight in that partition showed that increases in chemical-fat weight were due to a combination of hypertrophy and hyperplasia. In the omental and kidney fat partitions, hypertrophy contributed more to the increase in chemical-fat weight in wethers compared with rams.
APA, Harvard, Vancouver, ISO, and other styles
8

Cheng, Qian, Qing Fan Gu, and Li Song Wang. "Partition Scheduling Research of Hard Real-Time and Multi-Core System." Applied Mechanics and Materials 490-491 (January 2014): 824–27. http://dx.doi.org/10.4028/www.scientific.net/amm.490-491.824.

Full text
Abstract:
For and multi-core in integrated avionics system used in the challenge, will partition scheduling on a single core changed concurrently on multi-core scheduling problems, we will partition into two partitions exclusive partitions and perform part to solve scheduling resource sharing and synchronization issues. We partition as a unit, to establish a and multi-core partition scheduling model and proposed approximate minimum core and multi-core partition scheduling algorithm to ensure exclusive partitions can be scheduled in the case, you can create a mapping for and multi-core partition to partition scheduling on multi-core .
APA, Harvard, Vancouver, ISO, and other styles
9

Andrews, George E., and Cristina Ballantine. "Almost partition identities." Proceedings of the National Academy of Sciences 116, no. 12 (March 4, 2019): 5428–36. http://dx.doi.org/10.1073/pnas.1820945116.

Full text
Abstract:
An almost partition identity is an identity for partition numbers that is true asymptotically100%of the time and fails infinitely often. We prove a kind of almost partition identity, namely that the number of parts in all self-conjugate partitions of n is almost always equal to the number of partitions of n in which no odd part is repeated and there is exactly one even part (possibly repeated). Not only does the identity fail infinitely often, but also, the error grows without bound. In addition, we prove several identities involving the number of parts in restricted partitions. We show that the difference in the number of parts in all self-conjugate partitions of n and the number of parts in all partitions of n into distinct odd parts equals the number of partitions of n in which no odd part is repeated, the smallest part is odd, and there is exactly one even part (possibly repeated). We provide both analytic and combinatorial proofs of this identity.
APA, Harvard, Vancouver, ISO, and other styles
10

Infante, Guillermo, Anders Jonsson, and Vicenç Gómez. "Globally Optimal Hierarchical Reinforcement Learning for Linearly-Solvable Markov Decision Processes." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 6 (June 28, 2022): 6970–77. http://dx.doi.org/10.1609/aaai.v36i6.20655.

Full text
Abstract:
We present a novel approach to hierarchical reinforcement learning for linearly-solvable Markov decision processes. Our approach assumes that the state space is partitioned, and defines subtasks for moving between the partitions. We represent value functions on several levels of abstraction, and use the compositionality of subtasks to estimate the optimal values of the states in each partition. The policy is implicitly defined on these optimal value estimates, rather than being decomposed among the subtasks. As a consequence, our approach can learn the globally optimal policy, and does not suffer from non-stationarities induced by high-level decisions. If several partitions have equivalent dynamics, the subtasks of those partitions can be shared. We show that our approach is significantly more sample efficient than that of a flat learner and similar hierarchical approaches when the set of boundary states is smaller than the entire state space.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Partitions"

1

Dogaru, Ioana. "Canonical partitions." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq24655.pdf.

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

French, Jennifer. "Vector Partitions." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etd/3392.

Full text
Abstract:
Integer partitions have been studied by many mathematicians over hundreds of years. Many identities exist between integer partitions, such as Euler’s discovery that every number has the same amount of partitions into distinct parts as into odd parts. These identities can be proven using methods such as conjugation or generating functions. Over the years, mathematicians have worked to expand partition identities to vectors. In 1963, M. S. Cheema proved that every vector has the same number of partitions into distinct vectors as into vectors with at least one component odd. This parallels Euler’s result for integer partitions. The primary purpose of this paper is to use generating functions to prove other vector partition identities that parallel results of integer partitions.
APA, Harvard, Vancouver, ISO, and other styles
3

Johnson, William E. "TONE ROW PARTITIONS IN SCHOENBERG'S MOSES UND ARON The Volk Partition and the Zwischenspiel Partition." Digital Commons @ Butler University, 2015. http://digitalcommons.butler.edu/grtheses/264.

Full text
Abstract:
Arnold Schoenberg's development of twelve-tone serial ism in the early 20th Century had profound and far-reaching impact on the musical world. As Schoenberg himself grew and matured as a composer, so did the compositional technique of, and indeed his proficiency with, serialism. The opera Moses und Aron was composed in Schoenberg's third compositional period that lasted from 1923 through Schoenberg's death in 1951 and was characterized almost exclusively by this new technique of twelvetone serialism. Moses und Aron's first two Acts (as well as the libretto for the third) were written from 1930 to 1932 and based entirely on a single tone row. Though the opera itself was composed in the early 1930s, it had its beginnings as a religious play, similar to Schoenberg's earlier work, Oer Biblische Weg. Schoenberg left the opera as it was in 1932 and failed to return to score the libretto in Act III. Despite remaining unfinished, Moses und Aron is still widely regarded as one of Schoenberg's finest works and displays a composer working at the height of his skill. This project brings to light the brilliance of the tone row Schoenberg chose as his foundation for Moses und Aron through examining the various tone row transformations used throughout the opera as well as their specific setting and orchestration within the context of each scene. More than simply a musical background for the dramatic events of the Exodus narrative, the tone row becomes a character in-and-of itself, transforming and shifting to mirror dramatic events and becoming a driving force throughout the opera. In addition to informing dramatic content and context, the way in which Schoenberg scores the tone row also helps to illuminate the large scale musical form of each scene and is even essential to the dramatic tension and characterization within the narrative. In addition, this project endeavors to show that Moses und Aron displays Schoenberg's mastery of the compositional technique of twelve-tone serialism by examining in detail the significance of the functional orchestration as well as the divisions, or partitions, of Schoenberg's twelve-tone row. Inseparably connected with a discussion of the functional orchestration and partitioning of Schoenberg's tone row is a discussion of the different kinds of counterpoint that often occur as a result of such partitioning within the choral and instrumental orchestration of Moses und Aron. These concepts of functional orchestration, partitioning, and multiple forms of counterpoint are defined and unpacked in the upcoming chapters. As counterpoint functions as such an important aspect of the partitioning of the tone row, a brief discussion of counterpoint in serialism, specifically in Moses und Aron, accompanies the discussion of functional orchestration and the row partitioning. This understanding of the function of counterpoint in twelve-tone serial atonality is essential to this study. Much has been written, specifically by Michael Cherlin, about the formal and dramatic organization of Moses und Aron and how Schoenberg's permutations of his tone row both influence and are influenced by the formal and dramatic context. Cherlin has also given significant attention to defining links between tone row partitions and dramatic events or characters within Moses und Aron. An important part of my research, therefore, includes examining the analytical findings of Cherlin as well as those from other scholarly sources. This project also challenges or supports these findings based on my own analysis and discusses what I believe to be a new facet of the organization of Moses und Aron not previously revealed in other studies. In Chapter 5 of this project, I bring to light two specific partitions of the row that occur within the choral counterpoint of the opera and have not been mentioned in any study of Moses und Aron that I have discovered in my research.
APA, Harvard, Vancouver, ISO, and other styles
4

Yip, Martha. "Genus one partitions." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2933.

Full text
Abstract:
We obtain a tight upper bound for the genus of a partition, and calculate the number of partitions of maximal genus. The generating series for genus zero and genus one rooted hypermonopoles is obtained in closed form by specializing the genus series for hypermaps. We discuss the connection between partitions and rooted hypermonopoles, and suggest how a generating series for genus one partitions may be obtained via the generating series for genus one rooted hypermonopoles. An involution on the poset of genus one partitions is constructed from the associated hypermonopole diagrams, showing that the poset is rank-symmetric. Also, a symmetric chain decomposition is constructed for the poset of genus one partitions, which consequently shows that it is strongly Sperner.
APA, Harvard, Vancouver, ISO, and other styles
5

Jagger, Christopher Neil. "Partitions of graphs." Thesis, University of Cambridge, 1995. https://www.repository.cam.ac.uk/handle/1810/251583.

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

Waugh, Karl Michael Vincent. "Partitions of codes." Thesis, University of Sussex, 2013. http://sro.sussex.ac.uk/id/eprint/45301/.

Full text
Abstract:
In this thesis we look at coding theory wherein we introduce the concept of perspective, a generalisation on the minimum distance of a code, which naturally leads to a partition of the code. Subsequently we introduce focused splittings, which shall be shown to be a generalisation of perfect codes. We investigate the existence of such objects, and address questions such as the complexity of finding a focused splittings, which we show to be NPComplete. We analyse the symmetries of focused splittings. We use focused splittings to address the problem of error correction and we construct an encoding method based on them. Finally we test this construction for various classes of focused splittings.
APA, Harvard, Vancouver, ISO, and other styles
7

Bustamante, Franco Sebastián Felipe. "Hypergraph cycle partitions." Tesis, Universidad de Chile, 2018. http://repositorio.uchile.cl/handle/2250/168156.

Full text
Abstract:
Tesis para optar al grado de Doctor en Ciencias de la Ingeniería, Mención Modelación Matemática
The main focus of this thesis is the study of monochromatic cycle partitions in uniform hypergraphs. The first part deals with Berge-cycles. Extending a result of Rado to hypergraphs, we prove that for all $r,k \in \N$ with $k \geq 2$, the vertices of every $r(k-1)$-edge-coloured countably infinite complete $k$-uniform hypergraph can be core-partitioned into at most $r$ monochromatic Berge-cycles of different colours. We further describe a construction showing that this result is best possible. The second part deals with $\ell$-cycles. We show that for all $\ell, k, n \in \N$ with $\ell \leq k/2$ the following hypergraph-variant of Lehel's conjecture is true. Every $2$-edge-colouring of the $k$-uniform complete graph on $n$ vertices has at most two disjoint monochromatic $\ell$-cycles in different colours that together cover all but a constant number of vertices, where the constant depends on $k$ and $\ell$. Furthermore, we can cover all vertices with at most $4$ ($3$ if $\ell \leq k/3$) disjoint monochromatic $\ell$-cycles. The third part deals with tight-cycles in $2$-edge-colourings of complete $3$-uniform hypergraphs. We show that for every $\eta > 0$ there exists an integer $n_0$ such that every $2$-edge-colouring of the $3$-uniform complete hypergraph on $n \geq n_0$ vertices contains two disjoint monochromatic tight cycles of distinct colours that together cover all but at most $\eta n$ vertices. Finally, the fourth part deals with tight-cycles in a more general setting. We prove that for every $k,r \in \N$, the vertices of every $r$-edge-coloured complete $k$-uniform hypergraph can be partitioned into a bounded number (independent of the size of the hypergraph) of monochromatic tight cycles, confirming a conjecture of Gy\'arf\'as. We further prove that for every $r,p \in \N$, the vertices of every $r$-edge-coloured complete graph can be partitioned into a bounded number of $p$-th powers of cycles, settling a problem of Elekes, D. Soukup, L. Soukup and Szentmikl\'ossy. In fact we prove a common generalisation of both theorems which further extends these results to all host hypergraphs with bounded independence number.
CONICYT/Doctorado Nacional/2014-21141116, CMM-Conicyt PIA AFB170001
APA, Harvard, Vancouver, ISO, and other styles
8

Lang, Richard Johannes. "Monochromatic cycle partitions." Tesis, Universidad de Chile, 2017. http://repositorio.uchile.cl/handle/2250/147415.

Full text
Abstract:
Doctor en Ciencias de la Ingeniería, Mención Modelación Matemática
The first part of this thesis concerns monochromatic cycle partitions. We make the following three contributions. Our first result is that for any colouring of the edges of the complete bipartite graph $K_{n,n}$ with 3 colours there are 5 disjoint monochromatic cycles which together cover all but $o(n)$ vertices of the graph. In the same situation, 18 disjoint monochromatic cycles together cover all vertices. Next we show that given any $2$-local edge-colouring of the edges of the balanced complete bipartite graph $K_{n,n}$, its vertices can be covered with at most $3$ disjoint monochromatic paths. And, we can cover all vertices of any complete or balanced complete bipartite $r$-locally edge-coloured graph with $O(r^2)$ disjoint monochromatic cycles. We also determine the $2$-local bipartite Ramsey number of a path: Every $2$-local edge-colouring of the edges of $K_{n,n}$ contains a monochromatic path on $n$ vertices. Finally, we prove that any edge-colouring in red and blue of a graph on $n$ vertices and of minimum degree $2n/3 + o(n)$ admits a partition into three monochromatic cycles. This confirms a conjecture of Pokrovskiy approximately. The second part of this thesis contains two independent results about (proper) edge-colouring and parameter estimation respectively. With regards to edge-colouring, we conjecture that any graph $G$ with treewidth $k$ and maximum degree $\Delta(G)\geq k + \sqrt{k}$ satisfies $\chi'(G)=\Delta(G)$. In support of the conjecture we prove its fractional version. Concerning parameter estimation we study, for any fixed monotone graph property $\mathcal{P}=\text{Forb}(\mathcal{\mathcal{F}})$, the sample complexity of estimating a bounded graph parameter $z_{\mathcal{\mathcal{F}}}$ that, for an input graph $G$, counts the number of {spanning} subgraphs of $G$ that satisfy $\mathcal{P}$. Using a new notion of vertex partitions, we improve upon previous upper bounds on the sample complexity of estimating $z_{\mathcal{\mathcal{F}}}$.
APA, Harvard, Vancouver, ISO, and other styles
9

Rybnikov, Konstantin. "Polyhedral partitions and stresses." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ45268.pdf.

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

Dent, Suzie C. "Incidence structures of partitions." Thesis, University of East Anglia, 1997. https://ueaeprints.uea.ac.uk/38276/.

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

Books on the topic "Partitions"

1

Landreville, Annie. Partitions. [Montréal, Québec]: Editions d'Orphée, 1993.

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

Kamleshwar. Partitions. New Delhi: Penguin Books, 2006.

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

Estates, NHS, and Great Britain. Department of Health., eds. Partitions. London: The Stationery Office, 1997.

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

Majmudar, Amit. Partitions. Oxford: OneWorld, 2011.

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

Great Britain. Department of Health. Partitions. London: HMSO, 1989.

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

Halász, Gábor, and Vera T. Sós, eds. Irregularities of Partitions. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-61324-1.

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

Neogy, Ajit K. Partitions of Bengal. Calcutta: A. Mukherjee & Co., 1987.

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

Manno, Yves Di. Partitions: Champs dévastés. [Paris]: Flammarion, 1995.

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

1941-, Halász Gábor, and Sós Vera T, eds. Irregularities of partitions. Berlin: Springer-Verlag, 1989.

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

Alain, Campiotti, ed. Fontaine blanche: Partitions. Vevey: Aire, 2013.

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

Book chapters on the topic "Partitions"

1

Aref, Samin, Mahdi Mostajabdaveh, and Hriday Chheda. "Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar." In Computational Science – ICCS 2023, 612–26. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-36027-5_48.

Full text
Abstract:
AbstractCommunity detection is a fundamental problem in computational sciences with extensive applications in various fields. The most commonly used methods are the algorithms designed to maximize modularity over different partitions of the network nodes. Using 80 real and random networks from a wide range of contexts, we investigate the extent to which current heuristic modularity maximization algorithms succeed in returning maximum-modularity (optimal) partitions. We evaluate (1) the ratio of the algorithms’ output modularity to the maximum modularity for each input graph, and (2) the maximum similarity between their output partition and any optimal partition of that graph. We compare eight existing heuristic algorithms against an exact integer programming method that globally maximizes modularity. The average modularity-based heuristic algorithm returns optimal partitions for only 19.4% of the 80 graphs considered. Additionally, results on adjusted mutual information reveal substantial dissimilarity between the sub-optimal partitions and any optimal partition of the networks in our experiments. More importantly, our results show that near-optimal partitions are often disproportionately dissimilar to any optimal partition. Taken together, our analysis points to a crucial limitation of commonly used modularity-based heuristics for discovering communities: they rarely produce an optimal partition or a partition resembling an optimal partition. If modularity is to be used for detecting communities, exact or approximate optimization algorithms are recommendable for a more methodologically sound usage of modularity within its applicability limits.
APA, Harvard, Vancouver, ISO, and other styles
2

Armstrong, M. A. "Partitions." In Undergraduate Texts in Mathematics, 61–67. New York, NY: Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4757-4034-9_12.

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

Fine, Nathan. "Partitions." In Basic Hypergeometric Series and Applications, 37–54. Providence, Rhode Island: American Mathematical Society, 1988. http://dx.doi.org/10.1090/surv/027/02.

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

Broekman, Jan M. "Partitions." In Meaning, Narrativity, and the Real, 203–49. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-28175-9_5.

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

Daepp, Ulrich, and Pamela Gorkin. "Partitions." In Reading, Writing, and Proving, 111–19. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-9479-0_11.

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

Soberón, Pablo. "Partitions." In Problem-Solving Methods in Combinatorics, 93–99. Basel: Springer Basel, 2013. http://dx.doi.org/10.1007/978-3-0348-0597-1_7.

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

Mitchell, Charles F., and George A. Mitchell. "Partitions." In Building Construction and Drawing 1906, 227–44. London: Routledge, 2022. http://dx.doi.org/10.1201/9781003261476-7.

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

Mladenović, Pavle. "Partitions." In Combinatorics, 75–90. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-00831-4_6.

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

Campbell, Geoffrey B. "Integer Partitions Generalized to Vector Partitions." In Vector Partitions, Visible Points and Ramanujan Functions, 204–30. Boca Raton: Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003174158-13.

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

Shub, Michael. "Markov Partitions." In Global Stability of Dynamical Systems, 122–46. New York, NY: Springer New York, 1987. http://dx.doi.org/10.1007/978-1-4757-1947-5_10.

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

Conference papers on the topic "Partitions"

1

Li, Wilson, Thomas Poozhikala, and Mahmoud Dinar. "An Algorithm for Partitioning Objects Into a Cube Skeleton and Segmented Shell Covers for Parallelized Additive Manufacturing." In ASME 2021 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/detc2021-69326.

Full text
Abstract:
Abstract Despite a growing application of additive manufacturing, build volume has limited the size of fabricated parts. Machines that can produce large-scale parts in whole have high costs and less commercially available. A workaround is to partition the desired part into smaller partitions which can be manufactured in parallel, with the added benefit of controlling process parameters for each partition independently and reducing manufacturing time. This paper proposes an approach that divides a part into a cube skeleton covered by shell segments where all components can be fabricated with smaller 3D printers. The proposed algorithm first hollows out the original fully dense part to a user-specified thickness, then partitions the part into 26 surrounding regions using the six faces of the maximally inscribed cube (or cuboid). Islands, i.e., small, disconnected partitions within each region, are combined with the smallest neighbor to create up to 26 connected partitions. To minimize the number of printed partitions, the connected partitions are ranked based on their volume and combined with their smallest neighbor in pairs in descending order, while ensuring each pair fits within a pre-selected build volume of available 3D printers. The final partitioned shell segments, the cube (or cuboid) center, and the secondary layer of cubes propagated from the face centers of the maximally inscribed cube are generated by the algorithm. Results of two cases are shown.
APA, Harvard, Vancouver, ISO, and other styles
2

Sankhavara, C. D., and H. J. Shukla. "Influence of Partition Location on Natural Convection in a Partitioned Enclosure." In ASME 2005 Summer Heat Transfer Conference collocated with the ASME 2005 Pacific Rim Technical Conference and Exhibition on Integration and Packaging of MEMS, NEMS, and Electronic Systems. ASMEDC, 2005. http://dx.doi.org/10.1115/ht2005-72093.

Full text
Abstract:
In this study, Natural convection heat transfer and fluid flow of square partitioned enclosure with two partitions protruding centrally from the end walls of an enclosure have been analysed numerically using finite element method. The enclosure has opposite isothermal walls at different temperatures. The thickness and length of the partitions is fixed and equal to 1/10 and 1/4 of width of the enclosure respectively. Computation for Rayleigh number in the range of 104 to 106 has been conducted. The influence of different thermal boundary conditions at the end walls and at the partitions is included in the investigation. ‘Standard’ boundary conditions are introduced as more appropriate to simulate situations of practical engineering interest. To solve the relevant governing equations a segregated sequential solution algorithm is used after employing Boussinesq approximation. These equations after discretization were solved by using the tridiagonal matrix algorithm. Results clearly demonstrate that partition location has a significant effect on heat transfer.
APA, Harvard, Vancouver, ISO, and other styles
3

Kang, Zhao, Zipeng Guo, Shudong Huang, Siying Wang, Wenyu Chen, Yuanzhang Su, and Zenglin Xu. "Multiple Partitions Aligned Clustering." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/375.

Full text
Abstract:
Multi-view clustering is an important yet challenging task due to the difficulty of integrating the information from multiple representations. Most existing multi-view clustering methods explore the heterogeneous information in the space where the data points lie. Such common practice may cause significant information loss because of unavoidable noise or inconsistency among views. Since different views admit the same cluster structure, the natural space should be all partitions. Orthogonal to existing techniques, in this paper, we propose to leverage the multi-view information by fusing partitions. Specifically, we align each partition to form a consensus cluster indicator matrix through a distinct rotation matrix. Moreover, a weight is assigned for each view to account for the clustering capacity differences of views. Finally, the basic partitions, weights, and consensus clustering are jointly learned in a unified framework. We demonstrate the effectiveness of our approach on several real datasets, where significant improvement is found over other state-of-the-art multi-view clustering methods.
APA, Harvard, Vancouver, ISO, and other styles
4

Solovieva, Faina Ivanovna. "On partitions into perfect codes in Hamming metric." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-90.

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

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
6

Belkadi, M., A. Azzi, O. Imine, L. Adjlout, M. Aounallah, and A. Sabeur-Bendehina. "Free Convection in an Inclined Square Cavity With Partial Partitions on a Wavy Hot Wall." In ASME 7th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2004. http://dx.doi.org/10.1115/esda2004-58251.

Full text
Abstract:
In the present investigation, a numerical study of the effect of the hot wavy wall with partial partitions on free convection in an inclined square cavity, differentially heated, was undertaken. This problem is solved by using the partial differential equations which are the equation of mass, momentum, and energy. The tests were performed for different inclination angles, partition lenghts and Rayleigh numbers while the Prandtl number was kept constant. A configuration with three undulations and three partitions has been tested. The results obtained show that the hot wall geometry with partions affects the heat transfer rate in the cavity. The mean Nusselt number decreases notably compared with the heat transfer in the square undulated cavity without partitions.
APA, Harvard, Vancouver, ISO, and other styles
7

Fiala, N. J., I. Jaswal, and F. E. Ames. "Letterbox Trailing Edge Heat Transfer: Effects of Blowing Rate, Reynolds Number, and External Turbulence on Heat Transfer and Film Cooling Effectiveness." In ASME Turbo Expo 2008: Power for Land, Sea, and Air. ASMEDC, 2008. http://dx.doi.org/10.1115/gt2008-50474.

Full text
Abstract:
Heat transfer and film cooling distributions have been acquired for a vane trailing edge with letterbox partitions. Additionally, pressure drop data have been experimentally determined across a pin fin array and a trailing edge slot with letterbox partitions. The pressure drop across the array and letterbox trailing edge arrangement was measurably higher than for the gill slot geometry. Experimental data for the partitions and the inner suction surface region downstream from the slot have been acquired over a four to one range in vane exit condition Reynolds number (500,000, 1,000,000 and 2,000,000), with low (0.7%), grid (8.5%), and aero-combustor (13.5%) turbulence conditions. At these conditions, both heat transfer and adiabatic film cooling distributions have been documented over a range of blowing ratios (0.47 ≤ M ≤ 1.9). Heat transfer distributions on the inner suction surface downstream from the slot ejection were found to be dependent on both ejection flow rate and external conditions. Heat transfer on the partition side surfaces correlated on both exit Reynolds number and blowing ratio. Heat transfer on partition top surfaces largely correlated on exit Reynolds number but blowing ratio had a small effect at higher values. Generally, adiabatic film cooling levels on the inner suction surface are high but decrease near the trailing edge and provide some protection for the trailing edge. Adiabatic effectiveness levels on the partitions correlate with blowing ratio. On the partition sides adiabatic effectiveness is highest at low blowing ratios and decreases with increasing flow rate. On the partition tops adiabatic effectiveness increases with increasing blowing ratio but never exceeds the level on the sides. The present paper, together with a companion paper which documents letterbox trailing edge aerodynamics, is intended to provide engineers with the heat transfer and aerodynamic loss information needed to develop and compare competing trailing edge designs.
APA, Harvard, Vancouver, ISO, and other styles
8

Chatel, Christine. "Cloison (partitions)." In ACM SIGGRAPH 98 Electronic art and animation catalog. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/281388.281837.

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

Wu, Wenjiang, and Chan Y. Ching. "The Effect of Partitions on the Laminar Natural Convection in a Square Cavity." In ASME 2008 Heat Transfer Summer Conference collocated with the Fluids Engineering, Energy Sustainability, and 3rd Energy Nanotechnology Conferences. ASMEDC, 2008. http://dx.doi.org/10.1115/ht2008-56193.

Full text
Abstract:
The effect of a partition on the laminar natural convection flow in an air-filled square cavity driven by a temperature difference across the vertical walls was investigated experimentally. Two partitions with non-dimensional heights of 0.0625 and 0.125 was attached either to the upper half of the heated vertical wall or the top wall at different locations. The experiments were performed for a global Grashof number of approximately 1.24×108 and non-dimensional top wall temperatures of approximately 0.48 to 2.28. At the higher top wall temperatures, a secondary flow circulation region formed between the partition attached to the top wall and the heated vertical wall of the cavity. This secondary flow circulation region was sensitive to the location and height of the partition, in addition to the top wall temperature of the cavity. The secondary flow circulation region moved the location where the upward boundary layer flow along the heated vertical wall turned over to be further away from the top wall, than in the cavity without the partition. A thermal boundary layer was observed to move along the rear surface of the partition attached to the top wall. In the region close to the top wall, the partitions caused the non-dimensional temperature outside of the boundary layer and the local Nusselt number along the heated vertical wall to be different from that in the cavity without the partition. There were no significant effects of the partition on the flow and heat transfer characteristics in the lower half of the cavity.
APA, Harvard, Vancouver, ISO, and other styles
10

Pentiuc, Stefan-Gheorghe, Elena Crenguta Bobric, and Laura-Bianca Bilius. "Analysis with Unsupervised Learning Based Techniques of Load Factor Profiles and Hyperspectral Images." In 12th International Conference on Electronics, Communications and Computing. Technical University of Moldova, 2022. http://dx.doi.org/10.52326/ic-ecco.2022/sec.05.

Full text
Abstract:
The problem of obtaining an optimal partition consistent with a series of partitions resulting from the application of various clustering algorithms is NP complete. A heuristic method based on the concepts of central partition and strong patterns developed by Edwin Diday [3] is proposed. It is presented the experience regarding the use of analysis techniques based on unsupervised learning methods of load factor profiles and hyperspectral images.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Partitions"

1

Ricciardi, Aleta, Andre Schiper, and Kenneth Birman. Understanding Partitions and the No Partition Assumption. Fort Belvoir, VA: Defense Technical Information Center, June 1993. http://dx.doi.org/10.21236/ada266296.

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

Petrov, Miroslav S., and Todor D. Todorov. Successive Partitions of Ideal 4D-domains. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, December 2018. http://dx.doi.org/10.7546/crabs.2018.12.02.

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

Cornacchia, Massimo. Radiation Damping Partitions and RF-Fields. Office of Scientific and Technical Information (OSTI), June 2003. http://dx.doi.org/10.2172/813235.

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

Lindesay, J. CMB Fluctuation Amplitude from Dark Energy Partitions. Office of Scientific and Technical Information (OSTI), December 2004. http://dx.doi.org/10.2172/839718.

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

Serfozo, R. F. Partitions of Point Processes: Multivariate Poisson Approximations. Fort Belvoir, VA: Defense Technical Information Center, May 1985. http://dx.doi.org/10.21236/ada158739.

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

Kukuck, S. Heat and mass transfer through gypsum partitions subjected to fire exposures. Gaithersburg, MD: National Institute of Standards and Technology, 2009. http://dx.doi.org/10.6028/nist.ir.7461.

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

Bhagwat, Nikhil V. Balancing a U-Shaped Assembly Line by Applying Nested Partitions Method. Office of Scientific and Technical Information (OSTI), January 2005. http://dx.doi.org/10.2172/861605.

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

Shi, Leyuan. Hybrid Nested Partitions and Math Programming Framework for Large-scale Combinatorial Optimization. Fort Belvoir, VA: Defense Technical Information Center, March 2010. http://dx.doi.org/10.21236/ada571384.

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

Brunori, Paolo, Francisco H. G. Ferreira, and Guido Neidhöfer. Inequality of Opportunity and Intergenerational Persistence in Latin America. Inter-American Development Bank, October 2023. http://dx.doi.org/10.18235/0005207.

Full text
Abstract:
How strong is the transmission of socio-economic status across generations in Latin America? To answer this question, we first review the empirical literature on intergenerational mobility and inequality of opportunity for the region, summarizing results for both income and educational outcomes. We find that, whereas the income mobility literature is hampered by a paucity of representative datasets containing linked information on parents and children, the inequality of opportunity approach which relies on other inherited and pre-determined circumstance variables has suffered from arbitrariness in the choice of population partitions. Two new data-driven approaches one aligned with the ex-ante and the other with the ex-post conception of inequality of opportunity are introduced to address this shortcoming. They yield a set of new inequality of opportunity estimates for twenty-seven surveys covering nine Latin American countries over various years between 2000 and 2015. In most cases, more than half of the current generations inequality is inherited from the past with a range between 44% and 63%. We argue that on balance, given the parsimony of the population partitions, these are still likely to be underestimates.
APA, Harvard, Vancouver, ISO, and other styles
10

Tavare, Simon. International Conference on Random Mappings, Partitions and Permutations Held in Los Angeles, California on 3-6 January 1992. Fort Belvoir, VA: Defense Technical Information Center, August 1992. http://dx.doi.org/10.21236/ada257259.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Partitions' for particular source types:
Journal articles Dissertations / Theses Books
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