Academic literature on the topic 'P-partitions'

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 'P-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 "P-partitions"

1

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
2

Féray, Valentin, and Victor Reiner. "$p$-partitions revisited." Journal of Commutative Algebra 4, no. 1 (March 2012): 101–52. http://dx.doi.org/10.1216/jca-2012-4-1-101.

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

Stembridge, John R. "Enriched $P$-Partitions." Transactions of the American Mathematical Society 349, no. 2 (1997): 763–88. http://dx.doi.org/10.1090/s0002-9947-97-01804-7.

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

KAAVYA, S. J. "CRANK 0 PARTITIONS AND THE PARITY OF THE PARTITION FUNCTION." International Journal of Number Theory 07, no. 03 (May 2011): 793–801. http://dx.doi.org/10.1142/s1793042111004381.

Full text
Abstract:
A well-known problem regarding the integer partition function p(n) is the parity problem, how often is p(n) even or odd? Motivated by this problem, we obtain the following results: (1) A generating function for the number of crank 0 partitions of n. (2) An involution on the crank 0 partitions whose fixed points are called invariant partitions. We then derive a generating function for the number of invariant partitions. (3) A generating function for the number of self-conjugate rank 0 partitions.
APA, Harvard, Vancouver, ISO, and other styles
5

Hu, Z. X. "On ([n], P)-partitions." Advances in Applied Probability 24, no. 4 (December 1992): 775. http://dx.doi.org/10.1017/s000186780002485x.

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

Brändén, Petter, and Madeleine Leander. "Lecture hall $P$-partitions." Journal of Combinatorics 11, no. 2 (2020): 391–412. http://dx.doi.org/10.4310/joc.2020.v11.n2.a9.

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

Assaf, Sami, and Nantel Bergeron. "Flagged (P,ρ)-partitions." European Journal of Combinatorics 86 (May 2020): 103085. http://dx.doi.org/10.1016/j.ejc.2020.103085.

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

Pesovic, Marko, and Tanja Stojadinovic. "Weighted P-partitions enumerator." Applicable Analysis and Discrete Mathematics, no. 00 (2021): 13. http://dx.doi.org/10.2298/aadm200525013p.

Full text
Abstract:
To an extended generalized permutohedron we associate the weighted integer points enumerator, whose principal specialization is the f-polynomial. In the case of poset cones it refines Gessel's P-partitions enumerator. We show that this enumerator is a quasisymmetric function obtained by universal morphism from the Hopf algebra of posets.
APA, Harvard, Vancouver, ISO, and other styles
9

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
10

Hoshikawa, Kyosuke, Takuma Yuri, Hugo Giambini, and Yoshiro Kiyoshige. "Shoulder scaption is dependent on the behavior of the different partitions of the infraspinatus muscle." Surgical and Radiologic Anatomy 43, no. 5 (January 19, 2021): 653–59. http://dx.doi.org/10.1007/s00276-020-02674-6.

Full text
Abstract:
Abstract Purpose The purpose of this study was to investigate if the three partitions (superior, middle, and inferior partitions) of the infraspinatus muscle previously described in anatomical studies will present different behavior during scapular plane abduction (scaption) as described using shear-wave elastography, especially during initial range of motion. Methods Eight volunteers held their arm against gravity 15° intervals from 30° to 150° in scaption. Shear-wave elastography was implemented at each position to measure shear modulus at rest and during muscle contraction, as a surrogate for muscle stiffness, of each partition. Muscle activity was defined as the difference in stiffness values between the resting positions and those during muscle contraction (ΔE = stiffness at contraction—stiffness at rest). Results The activity value for the middle partition was 25.1 ± 10.8 kPa at 30° and increased up to 105° (52.2 ± 10.8 kPa), with a subsequent decrease at larger angle positions (p < .001). The superior partition showed a flatter and constant behavior with smaller activity values except at higher angles (p < .001). Peak activity values for the superior partition were observed at 135° (23.0 ± 12.0 kPa). Increase activity for inferior partition began at 60° and showed a peak at 135° (p < .001; 32.9 ± 13.8 kPa). Conclusion Stiffness measured using shear-wave elastography in each partition of the infraspinatus muscle demonstrated different behavior between these partitions during scaption. The middle partition generated force throughout scaption, while the superior and inferior partitions exerted force at end range.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "P-partitions"

1

Lyons, Corey Francis. "The Γ0 Graph of a p-Regular Partition." University of Akron / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=akron1271082086.

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

Bellissimo, Michael Robert. "A LOWER BOUND ON THE DISTANCE BETWEEN TWO PARTITIONS IN A ROUQUIER BLOCK." University of Akron / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=akron1523039734121649.

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

Wang, Estelle Weiping. "Les partitions pour pipa de Dunhuang : édition et interprétation." Thesis, Paris 4, 2016. http://www.theses.fr/2016PA040169.

Full text
Abstract:
Les partitions pour pipa de Dunhuang (fin dynastie Tang, début époque Song), copiées sur les manuscrits P. 3539, P. 3808 et P. 3719 conservés à la BnF ont été découvertes par Paul Pelliot en 1908 dans la grotte numéro 17 du site de Mogao en Chine. Cette thèse décrit les influences musicales et culturelles apportées en Chine par la route la soie, notamment la musique koutchéenne, puis réalise le bilan des études de ces partitions, menées depuis plus de soixante-quinze ans par les plus grands spécialistes dont Hayashi Kenzō, Ren Erbei, Rao Zongyi, Ye Dong, He Changlin, Chen Yingshi, Xi Zhenguan, Rembrandt Wolpert et François Picard. Il est admis qu’il s’agit de partitions en tablature pour un luth pipa à quatre cordes et quatre frettes, tel qu’il existait à l’époque. Les discussions en cours entre les chercheurs sur la tonalité, le rythme et le tempo, l'origine, le genre et l'organisation de ces pièces sont exposés et critiqués. Le logiciel conçu d'après mes spécifications pour faciliter leur étude et produire leur transcription sur portée est décrit. Mes propositions de transcription des vingt-cinq pièces de P. 3808 sont analysées en détail et comparées entre-elles. L'enregistrement de leur interprétation sur pipa de Nanyin, instrument actuel le plus proche des anciens luths, constitue l'aboutissement de ce travail
The Dunhuang pipa scores (end of Tang dynasty, beginning of Song period), copied on the manuscripts P. 3539, P. 3808 and P. 3719, now kept in the BnF, were discovered by Paul Pelliot in 1908 in the Mogao cave number 17 in China. This thesis describes the musical and cultural influences brought to China by the silk road, including Kuchan music, then reviews the studies of these partitions, conducted over seventy-five years by leading experts including Hayashi Kenzō, Ren Erbei, Rao Zongyi, Ye Dong, He Changlin, Chen Yingshi, Xi Zhenguan, Rembrandt Wolpert and François Picard. It is recognized that they are tablature partitions for a pipa lute with four strings and four frets, as it existed at that time. Ongoing discussions between researchers about the tone, rhythm and tempo, origin, gender and organization of these scores are exposed and criticized. The software designed according to my specifications to facilitate their study and produce their transcription is described. My transcription proposals of the twenty-five pieces of P. 3808 are analysed in detail and compared with each other. The recording of their interpretation with a Nanyin's pipa, current instrument closest to the ancient lutes, is the culmination of that work
APA, Harvard, Vancouver, ISO, and other styles
4

Heller, Julia [Verfasser], and 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.

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

Kreighbaum, Kevin M. "Combinatorial Problems Related to the Representation Theory of the Symmetric Group." University of Akron / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=akron1270830566.

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

Lin, Zhicong. "Eulerian calculus arising from permutation statistics." Phd thesis, Université Claude Bernard - Lyon I, 2014. http://tel.archives-ouvertes.fr/tel-00996105.

Full text
Abstract:
In 2010 Chung-Graham-Knuth proved an interesting symmetric identity for the Eulerian numbers and asked for a q-analog version. Using the q-Eulerian polynomials introduced by Shareshian-Wachs we find such a q-identity. Moreover, we provide a bijective proof that we further generalize to prove other symmetric qidentities using a combinatorial model due to Foata-Han. Meanwhile, Hyatt has introduced the colored Eulerian quasisymmetric functions to study the joint distribution of the excedance number and major index on colored permutations. Using the Decrease Value Theorem of Foata-Han we give a new proof of his main generating function formula for the colored Eulerian quasisymmetric functions. Furthermore, certain symmetric q-Eulerian identities are generalized and expressed as identities involving the colored Eulerian quasisymmetric functions. Next, generalizing the recent works of Savage-Visontai and Beck-Braun we investigate some q-descent polynomials of general signed multipermutations. The factorial and multivariate generating functions for these q-descent polynomials are obtained and the real rootedness results of some of these polynomials are given. Finally, we study the diagonal generating function of the Jacobi-Stirling numbers of the second kind by generalizing the analogous results for the Stirling and Legendre-Stirling numbers of the second kind. It turns out that the generating function is a rational function, whose numerator is a polynomial with nonnegative integral coefficients. By applying Stanley's theory of P-partitions we find combinatorial interpretations of those coefficients
APA, Harvard, Vancouver, ISO, and other styles
7

Von, Borries George Freitas. "Partition clustering of High Dimensional Low Sample Size data based on P-Values." Diss., Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/590.

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

Brumfield, Michéla L. "Characterization of Aprotic Solutes and Solvents Using Abraham Model Correlations." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc955029/.

Full text
Abstract:
Experimental data were obtained for the computation of mole fraction solubilities of three dichloronitrobenzenes in organic solvents at 25oC, and solubility ratios were obtained from this data. Abraham model equations were developed for solutes in tributyl phosphate that describe experimental values to within 0.15 log units, and correlations were made to describe solute partitioning in systems that contain either "wet" or "dry" tributyl phosphate. Abraham model correlations have also been developed for solute transfer into anhydrous diisopropyl ether, and these correlations fit in well with those for other ethers. Abraham correlations for the solvation of enthalpy have been derived from experimental and literature data for mesitylene, p-xylene, chlorobenzene, and 1,2-dichlorobenzene at 298.15 K. In addition, the enthalpy contribution of hydrogen bonding between these solutes and acidic solvents were predicted by these correlations and were in agreement with an established method. Residual plots corresponding to Abraham models developed in all of these studies were analyzed for trends in error between experimental and calculated values.
APA, Harvard, Vancouver, ISO, and other styles
9

Viricel, Clement. "Contributions au développement d'outils computationnels de design de protéine : méthodes et algorithmes de comptage avec garantie." Thesis, Toulouse, INSA, 2017. http://www.theses.fr/2017ISAT0019/document.

Full text
Abstract:
Cette thèse porte sur deux sujets intrinsèquement liés : le calcul de la constante de normalisation d’un champ de Markov et l’estimation de l’affinité de liaison d’un complexe de protéines. Premièrement, afin d’aborder ce problème de comptage #P complet, nous avons développé Z*, basé sur un élagage des quantités de potentiels négligeables. Il s’est montré plus performant que des méthodes de l’état de l’art sur des instances issues d’interaction protéine-protéine. Par la suite, nous avons développé #HBFS, un algorithme avec une garantie anytime, qui s’est révélé plus performant que son prédécesseur. Enfin, nous avons développé BTDZ, un algorithme exact basé sur une décomposition arborescente qui a fait ses preuves sur des instances issues d’interaction intermoléculaire appelées “superhélices”. Ces algorithmes s’appuient sur des méthodes issuse des modèles graphiques : cohérences locales, élimination de variable et décompositions arborescentes. A l’aide de méthodes d’optimisation existantes, de Z* et des fonctions d’énergie de Rosetta, nous avons développé un logiciel open source estimant la constante d’affinité d’un complexe protéine protéine sur une librairie de mutants. Nous avons analysé nos estimations sur un jeu de données de complexes de protéines et nous les avons confronté à deux approches de l’état de l’art. Il en est ressorti que notre outil était qualitativement meilleur que ces méthodes
This thesis is focused on two intrinsically related subjects : the computation of the normalizing constant of a Markov random field and the estimation of the binding affinity of protein-protein interactions. First, to tackle this #P-complete counting problem, we developed Z*, based on the pruning of negligible potential quantities. It has been shown to be more efficient than various state-of-the-art methods on instances derived from protein-protein interaction models. Then, we developed #HBFS, an anytime guaranteed counting algorithm which proved to be even better than its predecessor. Finally, we developed BTDZ, an exact algorithm based on tree decomposition. BTDZ has already proven its efficiency on intances from coiled coil protein interactions. These algorithms all rely on methods stemming from graphical models : local consistencies, variable elimination and tree decomposition. With the help of existing optimization algorithms, Z* and Rosetta energy functions, we developed a package that estimates the binding affinity of a set of mutants in a protein-protein interaction. We statistically analyzed our esti- mation on a database of binding affinities and confronted it with state-of-the-art methods. It appears that our software is qualitatively better than these methods
APA, Harvard, Vancouver, ISO, and other styles
10

Derenne, Sylvie. "Contribution a l'etude des proprietes physiques de mineraux du manteau inferieur." Paris 6, 1988. http://www.theses.fr/1988PA066281.

Full text
Abstract:
Etude de petrologie experimentale sur les transformations a hautes pressions et hautes temperatures, de silicates et de germanates a structure olicine et pyroxene. Il a ete determine en fonction de la pression et de la temperature, la distribution du magnesium, du fer et du calcium entre mineraux mantelliques. Un modele thermodynamique coherent est construit et a permis de determiner le champ de stabilite de la perovskite silicatee et de proposer une interpretation de la discontinuite sismique des 670 km. Des mecanismes microscopiques de transformations de phase de l'olivine sont proposes. De quelques composes etudies par spectroscopie raman, a ete tire des parametres thermodynamiques harmoniques et anharmoniques de ces phases
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "P-partitions"

1

Quotients of Coxeter complexes and P-partitions. Providence, RI: American Mathematical Society, 1992.

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

Alladi, Krishnaswami, Frank Garvan, and Ae Ja Yee. Ramanujan 125: International conference to commemorate the 125th anniversary of Ramanujan's birth, Ramanujan 125, November 5--7, 2012, University of Florida, Gainesville, Florida. Providence, Rhode Island: American Mathematical Society, 2014.

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

Mitchell, Harding, and International Business Machines Corporation. International Technical Support Organization., eds. IBM system P live partition mobility. [Poughkeepsie, NY]: International Technical Support Organization, 2007.

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

Book chapters on the topic "P-partitions"

1

Dahl, Per-Johan, and Caroline Dahl. "The Partitions." In Loft P, 36–37. Vienna: Springer Vienna, 2012. http://dx.doi.org/10.1007/978-3-7091-1260-1_7.

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

Gessel, Ira M. "A historical survey of 𝑃-partitions." In The Mathematical Legacy of Richard P. Stanley, 169–88. Providence, Rhode Island: American Mathematical Society, 2016. http://dx.doi.org/10.1090//mbk/100/10.

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

Krattenthaler, C. "Plane partitions in the work of Richard Stanley and his school." In The Mathematical Legacy of Richard P. Stanley, 231–61. Providence, Rhode Island: American Mathematical Society, 2016. http://dx.doi.org/10.1090//mbk/100/14.

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

Monnot, Jérôme, and Sophie Toulouse. "Approximation Results for the Weighted P 4 Partition Problems." In Fundamentals of Computation Theory, 388–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11537311_34.

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

Jiang, Yun, and Zhiqiang Chen. "Uniform Solution to Partition Problem Using P Systems with Membrane Division." In Communications in Computer and Information Science, 204–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-45049-9_33.

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

Monnot, Jérôme, and Sophie Toulouse. "The P k Partition Problem and Related Problems in Bipartite Graphs." In Lecture Notes in Computer Science, 422–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-69507-3_36.

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

Jiao, Shuai, Paolo Ienne, Xiaochun Ye, Da Wang, Dongrui Fan, and Ninghui Sun. "CRAW/P: A Workload Partition Method for the Efficient Parallel Simulation of Manycores." In Euro-Par 2012 Parallel Processing, 102–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32820-6_12.

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

Bentz, Joe. "Kinetic Design for Establishing Long-Term Stationary Cytosol Concentrations During Drug Transport across P-gp Expressing Confluent Cell Monolayers to Facilitate Measuring Cytosol Concentration, Fitting Drug Molar Partition Coefficients into the Cytosolic Monolayer of the Plasma Membrane, and Kinetically Identifying Drug Uptake Transporters." In Methods in Pharmacology and Toxicology, 41–65. New York, NY: Springer US, 2021. http://dx.doi.org/10.1007/978-1-0716-1250-7_2.

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

Schwartz, Richard Evan. "The Plaid Master Picture Theorem." In The Plaid Model, 93–102. Princeton University Press, 2019. http://dx.doi.org/10.23943/princeton/9780691181387.003.0009.

Full text
Abstract:
This chapter aims to prove Theorem 1.4 and Theorem 0.3, the Plaid Master Picture Theorem. Both of these results are deduced from Theorem 8.2, which says that the union PLA of plaid polygons is generated by an explicitly defined tiling classifying space (ලA, XP). Moreover, there is a nice space X which has the individual spaces XP as rational slices. The space X has a partition into convex polytopes, and one obtains the partition of XP by intersecting the relevant slice with this partition. Section 8.2 describes the space X. Section 8.3 describes the partition of X into convex integer polytopes. The partition is called the checkerboard partition. Section 8.4 explains the classifying map Φ‎A : Π‎ → XP. Section 8.5 states Theorem 8.2 and deduces Theorem 1.4 and Theorem 0.3 from it.
APA, Harvard, Vancouver, ISO, and other styles
10

Baer, Tomas, and William L. Hase. "Theory of Unimolecular Decomposition— The Statistical Approach." In Unimolecular Reaction Dynamics. Oxford University Press, 1996. http://dx.doi.org/10.1093/oso/9780195074949.003.0008.

Full text
Abstract:
The partition function and the sum or density of states are functions which are to statistical mechanics what the wave function is to quantum mechanics. Once they are known, all of the thermodynamic quantities of interest can be calculated. It is instructive to compare these two functions because they are closely related. Both provide a measure of the number of states in a system. The partition function is a quantity that is appropriate for thermal systems at a given temperature (canonical ensemble), whereas the sum and density of states are equivalent functions for systems at constant energy (microcanonical ensemble). In order to lay the groundwork for an understanding of these two functions as well as a number of other topics in the theory of unimolecular reactions, it is essential to review some basic ideas from classical and quantum statistical mechanics. As discussed in chapter 2, the classical Hamiltonian, H(p,q), is the total energy of the system expressed in terms of the momenta (p) and positions (q) of the atoms in the system.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "P-partitions"

1

Terenzi, Gloria, Iacopo Costoli, and Stefano Sorace. "Redesign of a dissipative bracing-based retrofit intervention for an earthquake damaged school building." In IABSE Congress, Christchurch 2021: Resilient technologies for sustainable infrastructure. Zurich, Switzerland: International Association for Bridge and Structural Engineering (IABSE), 2021. http://dx.doi.org/10.2749/christchurch.2021.0605.

Full text
Abstract:
<p>A school building with reinforced concrete structure, seismically retrofitted in 2013 and damaged by the 2016 Central Italy earthquake, is examined in this paper. A time-history assessment analysis is initially carried out in pre-rehabilitated conditions by simulating also the presence of the clay brick masonry infill perimeter walls and partitions in the finite element model of the structure. Based on the results of this analysis, a different retrofit solution is proposed, consisting in the incorporation of dissipative braces equipped with pressurized fluid viscous dampers. The verification analyses developed in this new configuration for the main shock records of the 2016 earthquake highlight slightly damaged and easily repairable response conditions of a little number of partitions — instead of the diffused moderate-to-severe damage surveyed in the building internal and perimeter infills</p><p>— and an elastic response of structural members.</p>
APA, Harvard, Vancouver, ISO, and other styles
2

Patrão, Caroline, Luis Kowada, Diane Castonguay, André Ribeiro, and Celina Figueiredo. "Some exact values for the diameter in Cayley graph Hl,p." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6395.

Full text
Abstract:
The family of graphs H,p has been defined in the context of edge partitions. The established properties such as vertex transitivity and low diameter suggest this family as a good topology for the design of interconnection networks. The vertices of the graphH p are the tuples with values between 0 and p1, such that the sum of the values is a multiple of p, and there is an edge between two vertices, if the two corresponding tuples have two pairs of entries whose values differ by one unit. In order to work towards the diameter, the difference between an upper and a lower bounds is established to be at most and we present subfamilies of graphs H p such that, for several values of and p, the bounds are tight.
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

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
5

Simpson, Toby, Dimosthenis Pasadakis, Drosos Kourounis, Kohei Fujita, Takuma Yamaguchi, Tsuyoshi Ichimura, and Olaf Schenk. "Balanced Graph Partition Refinement using the Graph p-Laplacian." In PASC '18: Platform for Advanced Scientific Computing Conference. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3218176.3218232.

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

Belwal, Chaitanya, and Albert M. K. Cheng. "Partitioned Scheduling of P-FRP in Symmetric Homogenous Multiprocessors." In 2011 IEEE/IFIP 9th International Conference on Embedded and Ubiquitous Computing (EUC). IEEE, 2011. http://dx.doi.org/10.1109/euc.2011.55.

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

Diaz-Pernil, Daniel, Miguel A. Gutierrez-Naranjo, Mario J. Perez-Jimenez, and Agustin Riscos-Nunez. "A fast solution to the partition problem by using tissue-like P systems." In 2008 3rd International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2008). IEEE, 2008. http://dx.doi.org/10.1109/bicta.2008.4656702.

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

Chen, H., C. N. Jing, X. Y. Feng, and K. L. Qiu. "The Research on Carbon Partition Model and Calculation of Q&P Steel." In The 2nd International Conference on Advanced High Strength Steel and Press Hardening (ICHSU 2015). WORLD SCIENTIFIC, 2016. http://dx.doi.org/10.1142/9789813140622_0049.

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

Agrawal, Durgesh, Yash Pote, and Kuldeep S. Meel. "Partition Function Estimation: A Quantitative Study." 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/587.

Full text
Abstract:
Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its computation is key to several probabilistic reasoning tasks. Given the #P-hardness of computing the partition function, several techniques have been proposed over the years with varying guarantees on the quality of estimates and their runtime behavior. This paper seeks to present a survey of 18 techniques and a rigorous empirical study of their behavior across an extensive set of benchmarks. Our empirical study draws up a surprising observation: exact techniques are as efficient as the approximate ones, and therefore, we conclude with an optimistic view of opportunities for the design of approximate techniques with enhanced scalability. Motivated by the observation of an order of magnitude difference between the Virtual Best Solver and the best performing tool, we envision an exciting line of research focused on the development of portfolio solvers.
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Xiuling, and Darrell W. Pepper. "Application of an HP-Adaptive Technique for Heat, Mass and Momentum Transport." In ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-80079.

Full text
Abstract:
A three-step hp-adaptive finite element model (FEM) is employed to solve the governing equations for incompressible flow including mass and thermal transport. The adaptive FEM uses both mesh enrichment (h-adaptation) and spectral order incensement (p-adaptation) to maximize the rate of decrease of the interpolation error. The three-step adaptive methodology can be used to solve a wide variety of problems related to incompressible viscous flow including mass dispersion along with thermal transport. Highly accurate solutions are obtained using an optimally refined final mesh. The L2 energy norm is calculated to guide the adaptation procedure. Simulation results for incompressible flow over a backward facing step, natural convection in a partitioned enclosure and mass transport within a partitioned enclosure under thermal effects are presented. Results are compared with experimental data and numerical simulations reported in the literature. The efficiency of the proposed numerical technology is discussed.
APA, Harvard, Vancouver, ISO, and other styles
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