Littérature scientifique sur le sujet « ENUMERATIVE ANALYSIS »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « ENUMERATIVE ANALYSIS ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "ENUMERATIVE ANALYSIS"
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.
Texte intégralMELCZER, STEPHEN, et MARNI MISHNA. « Singularity Analysis Via the Iterated Kernel Method ». Combinatorics, Probability and Computing 23, no 5 (10 juin 2014) : 861–88. http://dx.doi.org/10.1017/s0963548314000145.
Texte intégralShustin, E. « A tropical approach to enumerative geometry ». St. Petersburg Mathematical Journal 17, no 2 (20 février 2006) : 343–75. http://dx.doi.org/10.1090/s1061-0022-06-00908-3.
Texte intégralReaddy, Margaret A. « Enumerative and asymptotic analysis of a moduli space ». Advances in Applied Mathematics 47, no 3 (septembre 2011) : 575–88. http://dx.doi.org/10.1016/j.aam.2010.12.001.
Texte intégralNaranjo, Steven E., Jonathan W. Diehl et Peter C. Ellsworth. « Sampling Whiteflies in Cotton : Validation and Analysis of Enumerative and Binomial Plans ». Environmental Entomology 26, no 4 (1 août 1997) : 777–88. http://dx.doi.org/10.1093/ee/26.4.777.
Texte intégralSasaki, K., S. Kawata et S. Minami. « Optimal Wavelength Selection for Quantitative Analysis ». Applied Spectroscopy 40, no 2 (février 1986) : 185–90. http://dx.doi.org/10.1366/0003702864509385.
Texte intégralPandey, Palak, et Pravin D. Kunte. « Geospatial approach towards enumerative analysis of suspended sediment concentration for Ganges–Brahmaputra Bay ». Computers & ; Geosciences 95 (octobre 2016) : 32–58. http://dx.doi.org/10.1016/j.cageo.2016.06.019.
Texte intégralBorgwardt, Karl Heinz, et Jürgen Brzank. « Average Saving Effects in Enumerative Methods for Solving Knapsack Problems ». Journal of Complexity 10, no 1 (mars 1994) : 129–41. http://dx.doi.org/10.1006/jcom.1994.1005.
Texte intégralGeorgieva, Penka, et Aleksey Zinger. « Real Gromov–Witten theory in all genera and real enumerative geometry : computation ». Journal of Differential Geometry 113, no 3 (novembre 2019) : 417–91. http://dx.doi.org/10.4310/jdg/1573786971.
Texte intégralIrving, John. « Minimal Transitive Factorizations of Permutations into Cycles ». Canadian Journal of Mathematics 61, no 5 (1 octobre 2009) : 1092–117. http://dx.doi.org/10.4153/cjm-2009-052-2.
Texte intégralThèses sur le sujet "ENUMERATIVE ANALYSIS"
Carroll, Christina C. « Enumerative combinatorics of posets ». Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22659.
Texte intégralCommittee Chair: Tetali, Prasad; Committee Member: Duke, Richard; Committee Member: Heitsch, Christine; Committee Member: Randall, Dana; Committee Member: Trotter, William T.
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.
Texte intégralDissertaçã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
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.
Texte intégralIncludes 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.
Fang, Wenjie. « Enumerative and bijective aspects of combinatorial maps : generalization, unification and application ». Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC312/document.
Texte intégralThis 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
Yang, Yingying. « An Application of Combinatorial Methods ». VCU Scholars Compass, 2005. http://scholarscompass.vcu.edu/etd/662.
Texte intégralDistler, Andreas. « Classification and enumeration of finite semigroups ». Thesis, St Andrews, 2010. http://hdl.handle.net/10023/945.
Texte intégralMelczer, Stephen. « Analytic Combinatorics in Several Variables : Effective Asymptotics and Lattice Path Enumeration ». Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEN013/document.
Texte intégralThe 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
Lladser, Manuel Eugenio. « Asymptotic enumeration via singularity analysis ». Connect to this title online, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1060976912.
Texte intégralTitle 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
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.
Texte intégralPh. D.
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.
Texte intégralLivres sur le sujet "ENUMERATIVE ANALYSIS"
Handbook of enumerative combinatorics. Boca Raton : CRC Press, 2015.
Trouver le texte intégralEnumerative combinatorics. 2e éd. Cambridge, NY : Cambridge University Press, 2011.
Trouver le texte intégralStanley, Richard P. Enumerative combinatorics. Monterey, Calif : Wadsworth & Brooks/Cole Advanced Books & Software, 1986.
Trouver le texte intégralEnumerative combinatorics. Cambridge : Cambridge University Press, 1997.
Trouver le texte intégralIntroduction to enumerative combinatorics. Boston : McGraw-Hill Higher Education, 2007.
Trouver le texte intégralMartin, George E. Counting : The Art of Enumerative Combinatorics. New York, NY : Springer New York, 2001.
Trouver le texte intégralPiotr, Pragacz, dir. Parameter spaces : Enumerative geometry, algebra, and combinatorics. Warszawa : Institute of Mathematics, Polish Academy of Sciences, 1996.
Trouver le texte intégralSpencer, Joel H. Asymptopia. Providence, Rhode Island : American Mathematical Society, 2014.
Trouver le texte intégralMarino, Andrea. Analysis and Enumeration. Paris : Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3.
Texte intégralCamina, A. R. An introduction to enumeration. London : Springer, 2011.
Trouver le texte intégralChapitres de livres sur le sujet "ENUMERATIVE ANALYSIS"
Reynolds, Andrew, Haniel Barbosa et Pascal Fontaine. « Revisiting Enumerative Instantiation ». Dans 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.
Texte intégralDorp, Johannes vom, Joachim von zur Gathen, Daniel Loebenberger, Jan Lühr et Simon Schneider. « Comparative Analysis of Random Generators ». Dans 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.
Texte intégralAlur, Rajeev, Arjun Radhakrishna et Abhishek Udupa. « Scaling Enumerative Program Synthesis via Divide and Conquer ». Dans 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.
Texte intégralCarvajal-Schiaffino, Rubén, Giorgio Delzanno et Giovanni Chiola. « Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets ». Dans 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.
Texte intégralNiemetz, Aina, Mathias Preiner, Andrew Reynolds, Clark Barrett et Cesare Tinelli. « Syntax-Guided Quantifier Instantiation ». Dans 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.
Texte intégralFerreira, Margarida, Miguel Terra-Neves, Miguel Ventura, Inês Lynce et Ruben Martins. « FOREST : An Interactive Multi-tree Synthesizer for Regular Expressions ». Dans 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.
Texte intégralMarino, Andrea. « Introduction ». Dans Analysis and Enumeration, 1–9. Paris : Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3_1.
Texte intégralMarino, Andrea. « Enumeration Algorithms ». Dans Analysis and Enumeration, 13–35. Paris : Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3_2.
Texte intégralMarino, Andrea. « An Application : Biological Graph Analysis ». Dans Analysis and Enumeration, 37–44. Paris : Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3_3.
Texte intégralMarino, Andrea. « Telling Stories : Enumerating Maximal Directed Acyclic Graphs with Constrained Set of Sources and Targets ». Dans Analysis and Enumeration, 47–63. Paris : Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-097-3_4.
Texte intégralActes de conférences sur le sujet "ENUMERATIVE ANALYSIS"
Chen, Yizhao, Junda Chen, Li Wang, Tianhao Tong, Yating Xiang, Ming Tang et Deming Liu. « Enumerative Sphere Shaping : Performance Analysis and Experimental Demonstration in DMT Systems ». Dans CLEO : Science and Innovations. Washington, D.C. : OSA, 2021. http://dx.doi.org/10.1364/cleo_si.2021.sth1i.2.
Texte intégralLi, Simon, et Li Chen. « Model-Based Decomposition Using Non-Binary Dependency Analysis and Heuristic Partitioning Analysis ». Dans ASME 2006 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/detc2006-99175.
Texte intégralFujita, Kikuo, Naoki Ono et Yutaka Nomaguchi. « Two-Dimensional Lineup Design of Intermediate Functional Products With Enumerative Optimization of Combinatorial Mini-Max Optimality ». Dans 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.
Texte intégralSo, Sunbeom, et Hakjoo Oh. « Synthesizing Pattern Programs from Examples ». Dans 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.
Texte intégralAlfayyadh, Ekhlas M., Sadeq H. Bakhy et Yasir M. Shkara. « A New Multi-Objective Evolutionary Algorithm for Optimizing the Aerodynamic Design of HAWT Rotor ». Dans 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.
Texte intégralAssimakis, N., M. Adam, Ch Massouros et M. Etairidis. « Enumeration of the roots of Boolean matrices ». Dans INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2017). Author(s), 2018. http://dx.doi.org/10.1063/1.5043951.
Texte intégralLessley, Brenton, Talita Perciano, Manish Mathai, Hank Childs et E. Wes Bethel. « Maximal clique enumeration with data-parallel primitives ». Dans 2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV). IEEE, 2017. http://dx.doi.org/10.1109/ldav.2017.8231847.
Texte intégralHimmel, Anne-Sophie, Hendrik Molter, Rolf Niedermeier et Manuel Sorge. « Enumerating maximal cliques in temporal graphs ». Dans 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.
Texte intégralMassouros, Christos G. « On the enumeration of rigid hypercompositional structures ». Dans 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.
Texte intégralKadenko, Sergey. « Consistency Improvement in Combinatory Spanning Tree Enumeration Method ». Dans International Symposium on the Analytic Hierarchy Process. Creative Decisions Foundation, 2014. http://dx.doi.org/10.13033/isahp.y2014.061.
Texte intégralRapports d'organisations sur le sujet "ENUMERATIVE ANALYSIS"
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), octobre 1998. http://dx.doi.org/10.2172/1179.
Texte intégral