Relevant bibliographies by topics / ENUMERATIVE ANALYSIS

Academic literature on the topic 'ENUMERATIVE ANALYSIS'

Author: Grafiati
Published: 10 March 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'ENUMERATIVE ANALYSIS.'

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 "ENUMERATIVE ANALYSIS"

1

Antonova, Maryna. "ENUMERATION AS A MEANS TO STRUCTURE THE PROCESSES DOMAIN WITHIN ECONOMIC SYSTEM." Bulletin of Taras Shevchenko National University of Kyiv. Literary Studies. Linguistics. Folklore Studies, no. 30 (2021): 5–7. http://dx.doi.org/10.17721/1728-2659.2021.30.1.

Full text
Abstract:
This paper explores cognitive aspects of enumeration. The material of the study is economic discourse. Enumeration is considered as a means to structure and represent conceptual information within economic discourse. Cognitive approach to enumeration involves analysing both homogeneous and heterogeneous enumerative series. In economic discourse semantically homogeneous enumerations are represented by economic spheres of human activity, while semantically heterogeneous enumerative series presuppose correlation between economic and other spheres of human activity. In economic discourse the structure of enumerative sequence is represented by linear and hierarchical constituents. The linear structure may consist of at least two different components of enumeration. In some cases more than one linear enumeration is used in one sentence. In case of a hierarchical structure one of the elements of the main enumerative sequence is subdivided into a subordinate enumerative block. The analysis of enumerative series provided conceptual knowledge represented by the following domains within economic system: the processes domain, the institutes domain, the instruments domain and the indicators domain. The processes domain is analysed in this article. Macroeconomic processes, namely globalisation, regionalisation and transition economy are represented by semantically homogeneous enumerative series. The study of semantically heterogeneous enumerative series allowed to structure knowledge about the macroeconomic processes of globalisation and regionalisation, as well as the microeconomic investment process. Homogeneous and heterogeneous enumerations name, specify, categorise and define the economic system constituents, as well as determine their potential and consequences for the economy.
APA, Harvard, Vancouver, ISO, and other styles
2

MELCZER, STEPHEN, and MARNI MISHNA. "Singularity Analysis Via the Iterated Kernel Method." Combinatorics, Probability and Computing 23, no. 5 (June 10, 2014): 861–88. http://dx.doi.org/10.1017/s0963548314000145.

Full text
Abstract:
In the quarter plane, five lattice path models with unit steps have resisted the otherwise general approach featured in recent works by Fayolle, Kurkova and Raschel. Here we consider these five models, called the singular models, and prove that the univariate generating functions marking the number of walks of a given length are not D-finite. Furthermore, we provide exact and asymptotic enumerative formulas for the number of such walks, and describe an efficient algorithm for exact enumeration.
APA, Harvard, Vancouver, ISO, and other styles
3

Shustin, E. "A tropical approach to enumerative geometry." St. Petersburg Mathematical Journal 17, no. 2 (February 20, 2006): 343–75. http://dx.doi.org/10.1090/s1061-0022-06-00908-3.

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

Readdy, Margaret A. "Enumerative and asymptotic analysis of a moduli space." Advances in Applied Mathematics 47, no. 3 (September 2011): 575–88. http://dx.doi.org/10.1016/j.aam.2010.12.001.

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

Naranjo, Steven E., Jonathan W. Diehl, and Peter C. Ellsworth. "Sampling Whiteflies in Cotton: Validation and Analysis of Enumerative and Binomial Plans." Environmental Entomology 26, no. 4 (August 1, 1997): 777–88. http://dx.doi.org/10.1093/ee/26.4.777.

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

Sasaki, K., S. Kawata, and S. Minami. "Optimal Wavelength Selection for Quantitative Analysis." Applied Spectroscopy 40, no. 2 (February 1986): 185–90. http://dx.doi.org/10.1366/0003702864509385.

Full text
Abstract:
A new computer algorithm has been developed for selecting the optimal set of wavelengths for spectroscopic quantitative analysis of mixture samples. The method is based on the criterion of the minimum mean square error between concentrations of the mixture components and their estimates. The branch and bound algorithm finds the optimal set from all possible combinations of wavelengths. This algorithm saves computation time significantly, compared with the enumerative method. The mathematical formulation of the lower bound of the mean square errors for the combinations in a given subset is derived as a recurrence inequality. Experimental results of wavelength selection for infrared absorption spectra of xylene-isomer mixtures are shown to demonstrate the effectiveness of the algorithm in terms of computation complexity and accuracy in quantitative analysis for the fixed measurement time.
APA, Harvard, Vancouver, ISO, and other styles
7

Pandey, Palak, and Pravin D. Kunte. "Geospatial approach towards enumerative analysis of suspended sediment concentration for Ganges–Brahmaputra Bay." Computers & Geosciences 95 (October 2016): 32–58. http://dx.doi.org/10.1016/j.cageo.2016.06.019.

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

Borgwardt, Karl Heinz, and Jürgen Brzank. "Average Saving Effects in Enumerative Methods for Solving Knapsack Problems." Journal of Complexity 10, no. 1 (March 1994): 129–41. http://dx.doi.org/10.1006/jcom.1994.1005.

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

Georgieva, Penka, and Aleksey Zinger. "Real Gromov–Witten theory in all genera and real enumerative geometry: computation." Journal of Differential Geometry 113, no. 3 (November 2019): 417–91. http://dx.doi.org/10.4310/jdg/1573786971.

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

Irving, John. "Minimal Transitive Factorizations of Permutations into Cycles." Canadian Journal of Mathematics 61, no. 5 (October 1, 2009): 1092–117. http://dx.doi.org/10.4153/cjm-2009-052-2.

Full text
Abstract:
Abstract. We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings, that is, we study the number ${{H}_{\alpha }}({{i}_{2}},{{i}_{3}},...)$) of ways a given permutation (with cycles described by the partition $\alpha $) can be decomposed into a product of exactly ${{i}_{2}}$ 2-cycles, ${{i}_{3}}$ 3-cycles, etc., with certain minimality and transitivity conditions imposed on the factors. The method is to encode such factorizations as planar maps with certain descent structure and apply a new combinatorial decomposition to make their enumeration more manageable. We apply our technique to determine ${{H}_{\alpha }}({{i}_{2}},{{i}_{3}},...)$ when $\alpha $ has one or two parts, extending earlier work of Goulden and Jackson. We also show how these methods are readily modified to count inequivalent factorizations, where equivalence is defined by permitting commutations of adjacent disjoint factors. Our technique permits us to generalize recent work of Goulden, Jackson, and Latour, while allowing for a considerable simplification of their analysis.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "ENUMERATIVE ANALYSIS"

1

Carroll, Christina C. "Enumerative combinatorics of posets." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22659.

Full text
Abstract:
Thesis (Ph. D.)--Mathematics, Georgia Institute of Technology, 2008.
Committee Chair: Tetali, Prasad; Committee Member: Duke, Richard; Committee Member: Heitsch, Christine; Committee Member: Randall, Dana; Committee Member: Trotter, William T.
APA, Harvard, Vancouver, ISO, and other styles
2

Oliveira, Saullo Haniell Galvão de 1988. "On biclusters aggregation and its benefits for enumerative solutions = Agregação de biclusters e seus benefícios para soluções enumerativas." [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259072.

Full text
Abstract:
Orientador: Fernando José Von Zuben
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação
Made available in DSpace on 2018-08-27T03:28:44Z (GMT). No. of bitstreams: 1 Oliveira_SaulloHaniellGalvaode_M.pdf: 1171322 bytes, checksum: 5488cfc9b843dbab6d7a5745af1e3d4b (MD5) Previous issue date: 2015
Resumo: Biclusterização envolve a clusterização simultânea de objetos e seus atributos, definindo mo- delos locais de relacionamento entre os objetos e seus atributos. Assim como a clusterização, a biclusterização tem uma vasta gama de aplicações, desde suporte a sistemas de recomendação, até análise de dados de expressão gênica. Inicialmente, diversas heurísticas foram propostas para encontrar biclusters numa base de dados numérica. No entanto, tais heurísticas apresen- tam alguns inconvenientes, como não encontrar biclusters relevantes na base de dados e não maximizar o volume dos biclusters encontrados. Algoritmos enumerativos são uma proposta recente, especialmente no caso de bases numéricas, cuja solução é um conjunto de biclusters maximais e não redundantes. Contudo, a habilidade de enumerar biclusters trouxe mais um cenário desafiador: em bases de dados ruidosas, cada bicluster original se fragmenta em vá- rios outros biclusters com alto nível de sobreposição, o que impede uma análise direta dos resultados obtidos. Essa fragmentação irá ocorrer independente da definição escolhida de co- erência interna no bicluster, sendo mais relacionada com o próprio nível de ruído. Buscando reverter essa fragmentação, nesse trabalho propomos duas formas de agregação de biclusters a partir de resultados que apresentem alto grau de sobreposição: uma baseada na clusteriza- ção hierárquica com single linkage, e outra explorando diretamente a taxa de sobreposição dos biclusters. Em seguida, um passo de poda é executado para remover objetos ou atributos indesejados que podem ter sido incluídos como resultado da agregação. As duas propostas foram comparadas entre si e com o estado da arte, em diversos experimentos, incluindo bases de dados artificiais e reais. Essas duas novas formas de agregação não só reduziram significa- tivamente a quantidade de biclusters, essencialmente defragmentando os biclusters originais, mas também aumentaram consistentemente a qualidade da solução, medida em termos de precisão e recuperação, quando os biclusters são conhecidos previamente
Abstract: Biclustering involves the simultaneous clustering of objects and their attributes, thus defin- ing local models for the two-way relationship of objects and attributes. Just like clustering, biclustering has a broad set of applications, ranging from an advanced support for recom- mender systems of practical relevance to a decisive role in data mining techniques devoted to gene expression data analysis. Initially, heuristics have been proposed to find biclusters, and their main drawbacks are the possibility of losing some existing biclusters and the inca- pability of maximizing the volume of the obtained biclusters. Recently efficient algorithms were conceived to enumerate all the biclusters, particularly in numerical datasets, so that they compose a complete set of maximal and non-redundant biclusters. However, the ability to enumerate biclusters revealed a challenging scenario: in noisy datasets, each true bicluster becomes highly fragmented and with a high degree of overlapping, thus preventing a direct analysis of the obtained results. Fragmentation will happen no matter the boundary condi- tion adopted to specify the internal coherence of the valid biclusters, though the degree of fragmentation will be associated with the noise level. Aiming at reverting the fragmentation, we propose here two approaches for properly aggregating a set of biclusters exhibiting a high degree of overlapping: one based on single linkage and the other directly exploring the rate of overlapping. A pruning step is then employed to filter intruder objects and/or attributes that were added as a side effect of aggregation. Both proposals were compared with each other and also with the actual state-of-the-art in several experiments, including real and artificial datasets. The two newly-conceived aggregation mechanisms not only significantly reduced the number of biclusters, essentially defragmenting true biclusters, but also consistently in- creased the quality of the whole solution, measured in terms of Precision and Recall when the composition of the dataset is known a priori
Mestrado
Engenharia de Computação
Mestre em Engenharia Elétrica
APA, Harvard, Vancouver, ISO, and other styles
3

Zinger, Aleksey 1975. "Enumerative algebraic geometry via techniques of symplectic topology and analysis of local obstructions." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/8402.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2002.
Includes bibliographical references (p. 239-240).
Enumerative geometry of algebraic varieties is a fascinating field of mathematics that dates back to the nineteenth century. We introduce new computational tools into this field that are motivated by recent progress in symplectic topology and its influence on enumerative geometry. The most straightforward applications of the methods developed are to enumeration of rational curves with a cusp of specified nature in projective spaces. A general approach for counting positive-genus curves with a fixed complex structure is also presented. The applications described include enumeration of rational curves with a (3,4)-cusp, genus-two and genus-three curves with a fixed complex structure in the two-dimensional complex projective space, and genus-two curves with a fixed complex structure in the three-dimensional complex projective space. Our constructions may be applicable to problems in symplectic topology as well.
by Aleksey Zinger.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
4

Fang, Wenjie. "Enumerative and bijective aspects of combinatorial maps : generalization, unification and application." Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC312/document.

Full text
Abstract:
Le sujet de cette thèse est l'étude énumérative des cartes combinatoires et ses applications à l'énumération des autres objet s combinatoires.Les cartes combinatoires, aussi appelées simplement « cartes », sont un modèle combinatoire riche. Elles sont définies d'une manière intuitive et géométrique, mais elles sont aussi liées à des structures algébriques plus complexes. Par exemple, l'étude d'une famille de cartes appelées des « constellations » donne un cadre unifié à plusieurs problèmes d'énumération des factorisations dans le groupe symétrique. À la croisée des différents domaines, les cartes peuvent être analysées par une grande variété de méthodes, et leur énumération peut aussi nous aider à compter des autres objets combinatoires. Cette thèse présente un ensemble de résultats et de connexions très riches dans le domaine de l'énumération des cartes. Cette thèse se divise en quatre grandes parties. La première partie, qui correspond aux chapitres 1 et 2, est une introduction à l'étude énumérative des cartes. La deuxième partie, qui correspond aux chapitres 3 et 4, contient mes travaux sur l'énumération des constellations, qui sont des cartes particulières présentant un modèle unifié de certains types de factorisation de l'identité dans le groupe symétrique. La troisième partie, qui correspond aux chapitres 5 et 6, présente ma recherche sur le lien énumératif entre les cartes et des autres objets combinatoires, par exemple les généralisations du treillis de Tamari et les graphes aléatoires qui peuvent être plongés dans une surface donnée. La dernière partie correspond au chapitre 7, dé ns lequel je conclus cette thèse avec des perspectives et des directions de recherche dans l'étude énumérative des cartes
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and geometric definition, but are also related to some deep algebraic structures. For instance, a special type of maps called \emph{constellations} provides a unifying framework for some enumeration problems concerning factorizations in the symmetric group. Standing on a position where many domains meet, maps can be studied using a large variety of methods, and their enumeration can also help us count other combinatorial objects. This thesis is a sampling from the rich results and connections in the enumeration of maps.This thesis is structured into four major parts. The first part, including Chapter 1 and 2, consist of an introduction to the enumerative study of maps. The second part, Chapter 3 and 4, contains my work in the enumeration of constellations, which are a special type of maps that can serve as a unifying model of some factorizations of die identity in the symmetric group: The third part, composed by Chapter 5 and 6, shows my research on the enumerative link from maps to other combinatori al objects, such as generalizations of the Tamari lattice and random graphs embeddable onto surfaces. The last part is the closing chapter, in which the thesis concludes with some perspectives and future directions in the enumerative study of maps
APA, Harvard, Vancouver, ISO, and other styles
5

Yang, Yingying. "An Application of Combinatorial Methods." VCU Scholars Compass, 2005. http://scholarscompass.vcu.edu/etd/662.

Full text
Abstract:
Probability theory is a branch of mathematics concerned with determining the long run frequency or chance that a given event will occur. This chance is determined by dividing the number of selected events by the number of total events possible, assuming these events are equally likely. Probability theory is simply enumerative combinatorial analysis when applied to finite sets. For a given finite sample space, probability questions are usually "just" a lot of counting. The purpose of this thesis is to provide some in depth analysis of several combinatorial methods, including basic principles of counting, permutations and combinations, by specifically exploring one type of probability problem: C ordered possible elements that are equally likely s independent sampled subjects r distinct elements, where r = 1, 2, 3, …, min (C, s) we want to know P(s subjects utilize exactly r distinct elements). This thesis gives a detailed step by step analysis on techniques used to ultimately finding a general formula to solve the above problem.
APA, Harvard, Vancouver, ISO, and other styles
6

Distler, Andreas. "Classification and enumeration of finite semigroups." Thesis, St Andrews, 2010. http://hdl.handle.net/10023/945.

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

Melczer, Stephen. "Analytic Combinatorics in Several Variables : Effective Asymptotics and Lattice Path Enumeration." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEN013/document.

Full text
Abstract:
La combinatoire analytique étudie le comportement asymptotique des suites à travers les propriétés analytiques de leurs fonctions génératrices. Ce domaine a conduit au développement d’outils profonds et puissants avec de nombreuses applications. Au delà de la théorie univariée désormais classique, des travaux récents en combinatoire analytique en plusieurs variables (ACSV) ont montré comment calculer le comportement asymptotique d’une grande classe de fonctions différentiellement finies:les diagonales de fractions rationnelles. Cette thèse examine les méthodes de l’ACSV du point de vue du calcul formel, développe des algorithmes rigoureux et donne les premiers résultats de complexité dans ce domaine sous des hypothèses très faibles. En outre, cette thèse donne plusieurs nouvelles applications de l’ACSV à l’énumération des marches sur des réseaux restreintes à certaines régions: elle apporte la preuve de plusieurs conjectures ouvertes sur les comportements asymptotiques de telles marches,et une étude détaillée de modèles de marche sur des réseaux avec des étapes pondérées
The field of analytic combinatorics, which studies the asymptotic behaviour ofsequences through analytic properties of their generating functions, has led to thedevelopment of deep and powerful tools with applications across mathematics and thenatural sciences. In addition to the now classical univariate theory, recent work in thestudy of analytic combinatorics in several variables (ACSV) has shown how to deriveasymptotics for the coefficients of certain D-finite functions represented by diagonals ofmultivariate rational functions. This thesis examines the methods of ACSV from acomputer algebra viewpoint, developing rigorous algorithms and giving the firstcomplexity results in this area under conditions which are broadly satisfied.Furthermore, this thesis gives several new applications of ACSV to the enumeration oflattice walks restricted to certain regions. In addition to proving several openconjectures on the asymptotics of such walks, a detailed study of lattice walk modelswith weighted steps is undertaken
APA, Harvard, Vancouver, ISO, and other styles
8

Lladser, Manuel Eugenio. "Asymptotic enumeration via singularity analysis." Connect to this title online, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1060976912.

Full text
Abstract:
Thesis (Ph. D.)--Ohio State University, 2003.
Title from first page of PDF file. Document formatted into pages; contains x, 227 p.; also includes graphics Includes bibliographical references (p. 224-227). Available online via OhioLINK's ETD Center
APA, Harvard, Vancouver, ISO, and other styles
9

Cook, Frederick K. "Rapid bioluminometric enumeration of microorganisms in ground beef." Diss., Virginia Polytechnic Institute and State University, 1988. http://hdl.handle.net/10919/51933.

Full text
Abstract:
Use of the bioluminometric ATP assay was evaluated for estimating total bacterial counts in ground beef. Minimum sensitivity was found to be 10⁶ cfu/g using a double filtration procedure for sample preparation. Although ATP content per cfu decreased approximately 10 fold during storage, correlation of total aerobic plate count (APC) with microbial ATP content was 0.96. Selective non-microbial ATP extraction with ATPase treatment was evaluated for use in conjunction with the double filtration procedure to increase assay sensitivity. The new method was effective for removing additional non-microbial ATP without reducing ATP in bacteria. Estimated APC values were generally accurate to within ±0.50 log for ground beef samples above the detection limit of 5 x 10⁴ cfu/g. ATPase treatment increased sensitivity of the ATP assay and APC estimation by about 1 log while increasing assay time by 40 minutes, for a total of 60 minutes for 4 samples assayed in triplicate. The ATP assay was evaluated for use with ground beef patties inoculated with mixed ground beef spoilage flora, Pseudomonas, or Lactobacillus and stored at 2°C or 10°C using oxygen permeable or impermeable (vacuum) packaging. Excellent correlation (r²=0.95) was obtained for each inoculum and storage condition over the range of 5 x 10⁴ to 1 x 10⁹ cfu/g, when estimated APC values were compared with experimentally observed APC values. Usefulness of the ATP assay for estimating APC values of frozen ground beef was evaluated. Retail ground beef and Lactobacillus- and Pseudomonas-inoculated beef were frozen and thawed at different rates and examined for APC and microbial ATP content. Results indicated that, although freezing and thawing lowered numbers of Pseudomonas, APC values and microbial ATP content closely correlated. APC estimates were generally accurate to within 1/2 log. The importance of using an ATP assay standard to correct for variable enzyme activity and presence of quenching factors was demonstrated, and improved formulae were developed for optimum assay standard use. Alternate regression methods were evaluated for estimation of APC values but did not yield enhanced accuracy. Only one regression equation was needed for estimating APC values of ground beef containing different types of bacteria stored in various ways. Therefore, little knowledge of ground beef history is needed in order to rapidly and accurately estimate microbial numbers in ground beef using the bioluminometric ATP assay.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
10

Khansa, Wael. "Réseaux de Pétri P-Temporels : contribution à l'étude des systèmes à évènements discrets." Chambéry, 1997. http://www.theses.fr/1997CHAMS005.

Full text
Abstract:
Nous montrons dans ce mémoire que parmi les extensions existantes des réseaux de Petri, aucune ne possède la puissance de spécification suffisante pour modéliser et analyser des systèmes à événements discrets à contraintes de temps de séjour minimum et maximum nécessitant des synchronisations sous obligation (cas par exemple des industries de traitement chimique). Nous sommes ainsi amenés à proposer un nouveau modèle temporel permettant de représenter et d'analyser de tels systèmes, dans lequel, des intervalles de temps sont associés aux places, que nous appelons: réseau de Petri p-temporel (p-RdP). La définition d'un nouvel outil nécessite l'établissement de méthodes permettant d'analyser ses propriétés. Nous définissons tout d'abord les propriétés fortes qu'il convient d'extraire (vivacité, finitude des marquages, vivacité de marques,…). Puis, le pouvoir de spécification de cet outil sera comparé à celui d'autres modèles de réseaux de Petri. Nous fournissons des méthodes d'analyse énumérative permettant d'étudier le comportement et de vérifier les propriétés des systèmes modélisés. Ensuite, une approche d'analyse structurelle est établie afin d'étudier les fonctionnements stationnaires et par conséquent les performances des systèmes modélisés. Par ailleurs, les systèmes peuvent être soumis à des perturbations. Il est alors intéressant de trouver des contrôles robustes qui peuvent absorber des telles perturbations. La connaissance des marges sur les instants de tir des transitions peut être un moyen de caractériser la robustesse. L'étude de ces marges est faite d'abord pour les réseaux temporisés puis pour le modèle p-temporel.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "ENUMERATIVE ANALYSIS"

1

Handbook of enumerative combinatorics. Boca Raton: CRC Press, 2015.

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

Enumerative combinatorics. 2nd ed. Cambridge, NY: Cambridge University Press, 2011.

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

Stanley, Richard P. Enumerative combinatorics. Monterey, Calif: Wadsworth & Brooks/Cole Advanced Books & Software, 1986.

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

Enumerative combinatorics. Cambridge: Cambridge University Press, 1997.

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

Introduction to enumerative combinatorics. Boston: McGraw-Hill Higher Education, 2007.

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

Martin, George E. Counting: The Art of Enumerative Combinatorics. New York, NY: Springer New York, 2001.

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

Piotr, Pragacz, ed. Parameter spaces: Enumerative geometry, algebra, and combinatorics. Warszawa: Institute of Mathematics, Polish Academy of Sciences, 1996.

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

Spencer, Joel H. Asymptopia. Providence, Rhode Island: American Mathematical Society, 2014.

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

Marino, Andrea. Analysis and Enumeration. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3.

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

Camina, A. R. An introduction to enumeration. London: Springer, 2011.

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

Book chapters on the topic "ENUMERATIVE ANALYSIS"

1

Reynolds, Andrew, Haniel Barbosa, and Pascal Fontaine. "Revisiting Enumerative Instantiation." In Tools and Algorithms for the Construction and Analysis of Systems, 112–31. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89963-3_7.

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

Dorp, Johannes vom, Joachim von zur Gathen, Daniel Loebenberger, Jan Lühr, and Simon Schneider. "Comparative Analysis of Random Generators." In Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra, 181–96. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44559-1_10.

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

Alur, Rajeev, Arjun Radhakrishna, and Abhishek Udupa. "Scaling Enumerative Program Synthesis via Divide and Conquer." In Tools and Algorithms for the Construction and Analysis of Systems, 319–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-54577-5_18.

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

Carvajal-Schiaffino, Rubén, Giorgio Delzanno, and Giovanni Chiola. "Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets." In Tools and Algorithms for the Construction and Analysis of Systems, 435–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45319-9_30.

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

Niemetz, Aina, Mathias Preiner, Andrew Reynolds, Clark Barrett, and Cesare Tinelli. "Syntax-Guided Quantifier Instantiation." In Tools and Algorithms for the Construction and Analysis of Systems, 145–63. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72013-1_8.

Full text
Abstract:
AbstractThis paper presents a novel approach for quantifier instantiation in Satisfiability Modulo Theories (SMT) that leverages syntax-guided synthesis (SyGuS) to choose instantiation terms. It targets quantified constraints over background theories such as (non)linear integer, reals and floating-point arithmetic, bit-vectors, and their combinations. Unlike previous approaches for quantifier instantiation in these domains which rely on theory-specific strategies, the new approach can be applied to any (combined) theory, when provided with a grammar for instantiation terms for all sorts in the theory. We implement syntax-guided instantiation in the SMT solver CVC4, leveraging its support for enumerative SyGuS. Our experiments demonstrate the versatility of the approach, showing that it is competitive with or exceeds the performance of state-of-the-art solvers on a range of background theories.
APA, Harvard, Vancouver, ISO, and other styles
6

Ferreira, Margarida, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, and Ruben Martins. "FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions." In Tools and Algorithms for the Construction and Analysis of Systems, 152–69. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_9.

Full text
Abstract:
AbstractForm validators based on regular expressions are often used on digital forms to prevent users from inserting data in the wrong format. However, writing these validators can pose a challenge to some users.We present Forest, a regular expression synthesizer for digital form validations. Forest produces a regular expression that matches the desired pattern for the input values and a set of conditions over capturing groups that ensure the validity of integer values in the input. Our synthesis procedure is based on enumerative search and uses a Satisfiability Modulo Theories (SMT) solver to explore and prune the search space. We propose a novel representation for regular expressions synthesis, multi-tree, which induces patterns in the examples and uses them to split the problem through a divide-and-conquer approach. We also present a new SMT encoding to synthesize capture conditions for a given regular expression. To increase confidence in the synthesized regular expression, we implement user interaction based on distinguishing inputs.We evaluated Forest on real-world form-validation instances using regular expressions. Experimental results show that Forest successfully returns the desired regular expression in 70% of the instances and outperforms Regel, a state-of-the-art regular expression synthesizer.
APA, Harvard, Vancouver, ISO, and other styles
7

Marino, Andrea. "Introduction." In Analysis and Enumeration, 1–9. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3_1.

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

Marino, Andrea. "Enumeration Algorithms." In Analysis and Enumeration, 13–35. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3_2.

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

Marino, Andrea. "An Application: Biological Graph Analysis." In Analysis and Enumeration, 37–44. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3_3.

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

Marino, Andrea. "Telling Stories: Enumerating Maximal Directed Acyclic Graphs with Constrained Set of Sources and Targets." In Analysis and Enumeration, 47–63. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3_4.

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

Conference papers on the topic "ENUMERATIVE ANALYSIS"

1

Chen, Yizhao, Junda Chen, Li Wang, Tianhao Tong, Yating Xiang, Ming Tang, and Deming Liu. "Enumerative Sphere Shaping: Performance Analysis and Experimental Demonstration in DMT Systems." In CLEO: Science and Innovations. Washington, D.C.: OSA, 2021. http://dx.doi.org/10.1364/cleo_si.2021.sth1i.2.

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

Li, Simon, and Li Chen. "Model-Based Decomposition Using Non-Binary Dependency Analysis and Heuristic Partitioning Analysis." In ASME 2006 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/detc2006-99175.

Full text
Abstract:
The two-phase method for model-based decomposition (Chen et al. 2005a) has two major functional components: dependency analysis and partitioning analysis. The functions of these two components are enhanced and generalized in this paper in order to improve the method’s capability. On the one hand, the non-binary dependency analysis is developed such that the two-phase method can handle both binary and non-binary dependency information of the model. The essence of this development is to properly select a resemblance coefficient for the quantification of couplings among the model’s elements. On the other hand, as the past version of partitioning analysis takes the enumerative approach to search decomposition solutions, the heuristic partitioning analysis is developed as an alterative to search a reasonably good solution in a shorter time. The working principle of the heuristic approach is to analyze the coupling structure of the model such that the weak coupling links among the model’s elements can be identified for model partitioning. At the end, a relief valve system is applied to illustrate and justify the newly developed method components.
APA, Harvard, Vancouver, ISO, and other styles
3

Fujita, Kikuo, Naoki Ono, and Yutaka Nomaguchi. "Two-Dimensional Lineup Design of Intermediate Functional Products With Enumerative Optimization of Combinatorial Mini-Max Optimality." In ASME 2022 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/detc2022-90899.

Full text
Abstract:
Abstract As mechanical products have become further complicated and diversified, integrative design of their components, such as motors, fans, and pumps, through commonalization has become essential for shorter lead time and more cost-saving behind the mainstream. This paper names those products as intermediate functional products and proposes their lineup design method. Scale and coefficient identify their performance. Thus, they are arranged over a two-dimensional space of design requirements to minimize the lead time and production cost with maintaining performance optimality. The former cannot be measured quantitatively before actual production. Thus, minimizing the process complexity is demanded. The latter criterion translates into optimizing the worst-case performance across the requirement space. Those understanding leads to a design method by enumerating possible commonalization patterns, exclusively arranging the lineup for each pattern optimally, and investigating the best lineup through trade-off analysis. While the lineup arrangement under a pattern takes a mini-max type formulation, its optimization is performed based on monotonicity analysis efficiently. This paper demonstrates the formulation and procedures through an application to universal motors.
APA, Harvard, Vancouver, ISO, and other styles
4

So, Sunbeom, and Hakjoo Oh. "Synthesizing Pattern Programs from Examples." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/224.

Full text
Abstract:
We describe a programming-by-example system that automatically generates pattern programs from examples. Writing pattern programs, which produce various patterns of characters, is one of the most popular programming exercises for entry-level students. However, students often find it difficult to write correct solutions by themselves. In this paper, we present a method for synthesizing pattern programs from examples, allowing students to improve their programming skills efficiently. To that end, we first design a domain-specific language that supports a large class of pattern programs that students struggle with. Next, we develop a synthesis algorithm that efficiently finds a desired program by combining enumerative search, constraint solving, and program analysis. We implemented the algorithm in a tool and evaluated it on 40 exercises gathered from online forums. The experimental results and user study show that our tool can synthesize instructive solutions from 1–3 example patterns in 1.2 seconds on average.
APA, Harvard, Vancouver, ISO, and other styles
5

Alfayyadh, Ekhlas M., Sadeq H. Bakhy, and Yasir M. Shkara. "A New Multi-Objective Evolutionary Algorithm for Optimizing the Aerodynamic Design of HAWT Rotor." In ASME 2014 12th Biennial Conference on Engineering Systems Design and Analysis. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/esda2014-20355.

Full text
Abstract:
This paper presents a new multi-objective evolutionary algorithm (MOEA) for optimum aerodynamic design of horizontal-axis wind turbines (HAWT). The design problem is set to find the blade shape such that optimizing multi-objective at different airfoil profiles. Combined Blade Element Momentum (BEM) theory and two different algorithms (Genetic (GA) and Enumeration) are used. Flow around subsonic airfoils is analyzed using XFOIL software. WINDMEL III wind turbine is selected to improve its aerodynamic performance with different airfoil profiles technique of National Renewable Energy Laboratory (NREL) family. Employing Genetic Algorithm embodied in Blade Element Momentum theory to calculate power, thrust and starting torque coefficients that are the fitness function. Another method, Enumeration method, is used to enhance evolutionary method results. The optimum solution acquired from combination of Genetic Algorithm and Blade Element Momentum theory of three blades configuration increased power coefficient by (25.8 %) and thrust coefficient by (16.6%). Enumeration method results increased power coefficient by (13.8%), while thrust coefficient decreased by (0.2%) from the original design. In general, the evolutionary method of combined GA and BEM theory with different airfoil profiles technique improved the turbine aerodynamic performance, and the results are in good agreement with other published papers.
APA, Harvard, Vancouver, ISO, and other styles
6

Assimakis, N., M. Adam, Ch Massouros, and M. Etairidis. "Enumeration of the roots of Boolean matrices." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2017). Author(s), 2018. http://dx.doi.org/10.1063/1.5043951.

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

Lessley, Brenton, Talita Perciano, Manish Mathai, Hank Childs, and E. Wes Bethel. "Maximal clique enumeration with data-parallel primitives." In 2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV). IEEE, 2017. http://dx.doi.org/10.1109/ldav.2017.8231847.

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

Himmel, Anne-Sophie, Hendrik Molter, Rolf Niedermeier, and Manuel Sorge. "Enumerating maximal cliques in temporal graphs." In 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 2016. http://dx.doi.org/10.1109/asonam.2016.7752255.

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

Massouros, Christos G. "On the enumeration of rigid hypercompositional structures." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014). AIP Publishing LLC, 2015. http://dx.doi.org/10.1063/1.4912960.

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

Kadenko, Sergey. "Consistency Improvement in Combinatory Spanning Tree Enumeration Method." In International Symposium on the Analytic Hierarchy Process. Creative Decisions Foundation, 2014. http://dx.doi.org/10.13033/isahp.y2014.061.

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

Reports on the topic "ENUMERATIVE ANALYSIS"

1

Dowell, L. J. Maximum-Path Leaves Relative to Vertices and the Vertex One Center of a Spanning Tree: An Enumeration and Analysis of Configurations. Office of Scientific and Technical Information (OSTI), October 1998. http://dx.doi.org/10.2172/1179.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'ENUMERATIVE ANALYSIS' 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