Relevant bibliographies by topics / Coset enumeration

Contents

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

Academic literature on the topic 'Coset enumeration'

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

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

Select a source type:

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

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 "Coset enumeration"

1

Linton, Stephen A. "Double coset enumeration." Journal of Symbolic Computation 12, no. 4-5 (October 1991): 415–26. http://dx.doi.org/10.1016/s0747-7171(08)80094-6.

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

Sayed, Mohamed. "Coset enumeration of groups generated by symmetric sets of involutions." International Journal of Mathematics and Mathematical Sciences 2005, no. 23 (2005): 3739–50. http://dx.doi.org/10.1155/ijmms.2005.3739.

Full text
Abstract:
All non-abelian finite simple groups can be symmetrically generated by involutions. An algorithm which performs coset enumeration for a group defined in this manner on the cosets of a subgroup of automorphisms of these involutions is presented.
APA, Harvard, Vancouver, ISO, and other styles
3

PIGGOTT, ADAM. "THE MANIFESTATION OF GROUP ENDS IN THE TODD–COXETER COSET ENUMERATION PROCEDURE." International Journal of Algebra and Computation 17, no. 01 (February 2007): 203–20. http://dx.doi.org/10.1142/s0218196707003561.

Full text
Abstract:
The issue of recognizing group properties, such as the cardinality of the group, directly from the dynamics of an incomplete coset enumeration is discussed. In particular, it is shown that the property of having two ends is recognizable in such a way. Further, sufficient conditions are given for termination of a coset enumeration with the declaration that the group under consideration has infinitely-many ends.
APA, Harvard, Vancouver, ISO, and other styles
4

Reinert, Birgit, and Dirk Zeckzer. "Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach." LMS Journal of Computation and Mathematics 4 (2001): 74–134. http://dx.doi.org/10.1112/s1461157000000826.

Full text
Abstract:
AbstractThe authors study a new method for coset enumeration in finitely presented groups. Their method uses prefix Gröbner basis computation in the monoid ring ${\mathbb{K}}[{\cal M}]$, where ${\mathbb{K}}$ is a computable field and ${\cal M}$ a monoid presented by a convergent string-rewriting system. The method is compared to well-known methods for Todd-Coxeter enumeration, using examples from the literature where studies of these methods are reported. New insights into coset enumeration were gained using three different kinds of orderings, combined with new frameworks and strategies implemented in MRC 1.2.
APA, Harvard, Vancouver, ISO, and other styles
5

Havas, George, and Colin Ramsay. "Proving a group trivial made easy: A case study in coset enumeration." Bulletin of the Australian Mathematical Society 62, no. 1 (August 2000): 105–18. http://dx.doi.org/10.1017/s0004972700018529.

Full text
Abstract:
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for investigating finitely presented groups. The process is not well understood, and various pathological presentations of, for example, the trivial group have been suggested as challenge problems. Here we consider one such family of presentations proposed by B.H. Neumann. We show that the problems are much easier than they first appear, albeit at the expense of considerable preliminary ‘experimentation’. This demonstrates how far the range of applicability of coset enumeration has improved.
APA, Harvard, Vancouver, ISO, and other styles
6

HARTUNG, RENÉ. "COSET ENUMERATION FOR CERTAIN INFINITELY PRESENTED GROUPS." International Journal of Algebra and Computation 21, no. 08 (December 2011): 1369–80. http://dx.doi.org/10.1142/s0218196711006637.

Full text
Abstract:
We describe an algorithm that computes the index of a finitely generated subgroup in a finitely L-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in a finitely L-presented group is decidable. As an application, we consider the low-index subgroups of some self-similar groups including the Grigorchuk group, the twisted twin of the Grigorchuk group, the Grigorchuk super-group, and the Hanoi 3-group.
APA, Harvard, Vancouver, ISO, and other styles
7

Sayed, Mohamed. "Double-coset enumeration algorithm for symmetrically generated groups." International Journal of Mathematics and Mathematical Sciences 2005, no. 5 (2005): 699–715. http://dx.doi.org/10.1155/ijmms.2005.699.

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

Clark, Jeffrey W. "An APL implementation of Todd-Coxeter coset enumeration." ACM SIGAPL APL Quote Quad 21, no. 3 (March 1991): 7–11. http://dx.doi.org/10.1145/122442.122446.

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

Akl, S., G. Labonté, M. Leeder, and K. Qiu. "On doing Todd-Coxeter coset enumeration in parallel." Discrete Applied Mathematics 34, no. 1-3 (November 1991): 27–35. http://dx.doi.org/10.1016/0166-218x(91)90076-9.

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

Robertson, Edmund F., and Yusuf Ünlü. "On semigroup presentations." Proceedings of the Edinburgh Mathematical Society 36, no. 1 (February 1993): 55–68. http://dx.doi.org/10.1017/s0013091500005897.

Full text
Abstract:
Semigroup presentations have been studied over a long period, usually as a means of providing examples of semigroups. In 1967 B. H. Neumann introduced an enumeration method for finitely presented semigroups analogous to the Todd–Coxeter coset enumeration process for groups. A proof of Neumann's enumeration method was given by Jura in 1978.In Section 3 of this paper we describe a machine implementation of a semigroup enumeration algorithm based on that of Neumann. In Section 2 we examine certain semigroup presentations, motivated by the fact that the corresponding group presentation has yielded interesting groups. The theorems, although proved algebraically, were suggested by the semigroup enumeration program.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Coset enumeration"

1

Edeson, Margaret, and n/a. "Investigations in coset enumeration." University of Canberra. Information Sciences & Engineering, 1989. http://erl.canberra.edu.au./public/adt-AUC20050712.083514.

Full text
Abstract:
The process of coset enumeration has become a significant factor in group theoretical investigations since the advent of modern computing power, but in some respects the process is still not well understood. This thesis investigates some features of coset enumeration, working mainly with the group F(2,7). Chapter 1 describes the characteristics of coset enumeration and algorithms used for it. A worked example of the method is provided. Chapter 2 discusses some features which would be desirable in computer programs for use in investigating the coset enumeration process itself, and reviews the Havas/Alford program which to date best meets the requirements. Chapter 3 deals with the use of coset ammeration in proofs, either in its own right or as a basis for other workings. An example of one attempt to obtain a proof by coset enumeration is given. Chapter 4 reviews techniques designed to reduce the length of coset enumerations and proposes the 'equality list' technique as a way to reduce enumeration length for some groups. Extra insights obtainable using the equality list method are also discussed. Chapter 5 summarises the factors by which the success of different coset enumerations can be compared and proposes an algorithm for making systematic comparisons among enumerations. Chapter 6 reports five coset enumerations, obtained manually by three main methods on the group F(2,7). All these enumerations were shorter than is so far obtainable by machine and one is shorter than other known hand enumerations. The enumerations were compared by applying the process developed in Chapter 5. Chapter 7 presents a shorter proof of the cyclicity of the group F(2,7) than was hitherto available. The proof derives from the workings for one of the coset enumerations described in Chapter 6. There are eight appendices and an annotated bibliography. The appendices contain, inter alia, edited correspondence between well-known coset-enumerators, a guide to the Havas/Alford program, further details on the equality list method and listings of various enumerations.
APA, Harvard, Vancouver, ISO, and other styles
2

Seager, Charles. "Symmetric Presentations and Double Coset Enumeration." CSUSB ScholarWorks, 2018. https://scholarworks.lib.csusb.edu/etd/783.

Full text
Abstract:
In this project, we demonstrate our discovery of original symmetric presentations and constructions of important groups, including nonabelian simple groups, and groups that have these as factor groups. The target nonabelian simple groups include alternating, linear, and sporadic groups. We give isomorphism types for each finite homomorphic image that has been found. We present original symmetric presentations of $M_{12}$, $M_{21}:(2 \times 2)$, $L_{3}(4):2^2$, $2:^{\cdot}L_{3}(4):2$, $S(4,3)$, and $S_{7}$ as homomorphism images of the progenitors $2^{*20}$ $:$ $A_{5}$, $2^{*10}$ $:$ $PGL(2,9)$, $2^{*10}$ $:$ $Aut(A_{6})$, $2^{*10}$ $:$ $A_{6}$, $2^{*10}$ $:$ $A_{5}$, and $2^{*24}$ $:$ $S_{5}$, respectively. We also construct $M_{12}$, $M_{21}:(2 \times 2)$, $L_{3}(4):2^2$, $L_{3}(4):2^2$, $2:^{\cdot}L_{3}(4):2$, $S(4,3)$, and $S_{7}$ over $A_{5}$, $PGL(2,9)$, $Aut(A_{6})$, $A_{6}$, $A_{5}$, and $S_{5}$, respectively, using our technique of double coset enumeration. All of the symmetric presentations given are original to the best of our knowledge.
APA, Harvard, Vancouver, ISO, and other styles
3

Gomez, David R. Jr. "SYMMETRIC PRESENTATIONS AND CONSTRUCTIONS." CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/96.

Full text
Abstract:
In this thesis we have investigated permutation and monomial progenitors of the form p^*n:N (p=2,3,5,...) and p^*n:_m N (p=3,5,7,...) respectively. We have discovered new symmetric presentations of several finite nonabelian simple groups including linear groups, unitary groups, orthogonal groups, and sporadic groups. We have constructed interesting groups found using the technique of double coset enumeration and found the isomorphic types of the numerous groups that appeared as homorphic images. These include the sympletic group, S_4(5) and the Janko groups, J_2 and J_1 which were found using a variety of different control groups over finite fields.
APA, Harvard, Vancouver, ISO, and other styles
4

Harris, Elena Yavorska. "A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄"." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2432.

Full text
Abstract:
This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the double coset M₂₄ P M₂₄, where P is a permutation on n points of a certain cycle structure, and M₂₄ is the Mathieu group related to a Steiner system S(5, 8, 24) as its automorphism group. The purpose of this work is not to replace the existing algorithms, but rather to explore a possibility to extend calculations of single cosets beyond the limits encountered when using currently available methods.
APA, Harvard, Vancouver, ISO, and other styles
5

Baccari, Kevin J. "Homomorphic Images And Related Topics." CSUSB ScholarWorks, 2015. https://scholarworks.lib.csusb.edu/etd/224.

Full text
Abstract:
We will explore progenitors extensively throughout this project. The progenitor, developed by Robert T Curtis, is a special type of infinite group formed by a semi-direct product of a free group m*n and a transitive permutation group of degree n. Since progenitors are infinite, we add necessary relations to produce finite homomorphic images. Curtis found that any non-abelian simple group is a homomorphic image of a progenitor of the form 2*n: N. In particular, we will investigate progenitors that generate two of the Mathieu sporadic groups, M11 and M11, as well as some classical groups. We will prove their existences a variety of different ways, including the process of double coset enumeration, Iwasawa's Lemma, and linear fractional mappings. We will also investigate the various techniques of finding finite images and their corresponding isomorphism types.
APA, Harvard, Vancouver, ISO, and other styles
6

Lamp, Leonard B. "SYMMETRIC PRESENTATIONS OF NON-ABELIAN SIMPLE GROUPS." CSUSB ScholarWorks, 2015. https://scholarworks.lib.csusb.edu/etd/222.

Full text
Abstract:
The goal of this thesis is to show constructions of some of the sporadic groups such as the Mathieu group, M12, J1, Projective Special Linear groups, PSL(2,8), and PSL(2,11), Unitary group U(3,3) and many other non-abelian simple groups. Our purpose is to find all simple non-abelian groups as homomorphic images of permutation or monomial progenitors, as well grasping a deep understanding of group theory and extension theory to determine groups up to isomorphisms. The progenitor, developed by Robert T. Curtis, is a semi-direct product of the following form: P≅2*n: N = {πw | π ∈ N, w a reduced word in the ti} where 2*n denotes a free product of n copies of the cyclic group of order 2 generated by involutions ti for 1 ≤ i≤ n; and N is a transitive permutation group of degree n which acts on the free product by permuting the involuntary generators by conjugation. Thus we develop methods for factoring by a suitable any number of relations in the hope of finding all non-abelian simple groups, and in particular one of the 26 Sporadic simple groups. Then the algorithm for double coset enumeration together with the first isomorphic theorem aids us in proving the homomorphic image of the group we have constructed. After being presented with a group G, we then compute the composition series to solve extension problems. Given a composition such as G = G0 ≥ G1 ≥ ….. ≥ Gn-1 ≥ Gn = 1 and the corresponding factor groups G0/G1 = Q1,…,Gn-2/Gn-1 = Qn-1,Gn-1/Gn = Qn. We note that G1 = 1, implying Gn-1 = Qn. As we move through the next composition factor we see that Gn-2/Qn = Qn-1, so that Gn-2 is an extension of Qn-1 by Qn. Following this procedure we can recapture G from the products of Qi and thus solve the extension problem. The Jordan-Holder theorem then allows us to develop a process to analyze all finite groups if we knew all finite simple groups and could solve their extension problem, hence arriving at the isomorphism type of the group. We will present how we solve extensions problems while our main focus will lie on extensions that will include the following: semi-direct products, direct products, central extensions and mixed extensions.Lastly, we will discuss Iwasawa's Lemma and how double coset enumeration aids us in showing the simplicity of some of our groups.
APA, Harvard, Vancouver, ISO, and other styles
7

Grindstaff, Dustin J. "Symmetric Presentations and Generation." CSUSB ScholarWorks, 2015. https://scholarworks.lib.csusb.edu/etd/202.

Full text
Abstract:
The aim of this thesis is to generate original symmetric presentations for finite non-abelian simple groups. We will discuss many permutation progenitors, including but not limited to 2*14 : D28, 2∗9 : 3•(32), 3∗9 : 3•(32), 2∗21 : (7X3) : 2 as well as monomial progenitors, including 7∗5 :m A5, 3∗5 :m S5. We have included their homomorphic images which include the Mathieu group M12, 2•J2, 2XS(4, 5), as well as, many PGL′s, PSL′s and alternating groups. We will give proofs of the isomorphism types of each progenitor, either by hand using double coset enumeration or computer based using MAGMA. We have also constructed Cayley graphs of the following groups, 25 : S5 over 2∗5 : S5, PSL(2, 8) over 2∗7 : D14, M12 over a maximal subgroup, 2XS5. We have developed a lemma using relations to factor permutation progenitors of the form m∗n : N to give an isomorphism of mn : N . Motivated by Robert T. Curtis’ research, we will present a program using MAGMA that, when given a target finite non-abelian simple group, the program will generate possible control groups to write progenitors that will give the given finite non-abelian simple group. Iwasawa’s lemma is also discussed and used to prove PSL(2, 8) and M12 to be simple groups.
APA, Harvard, Vancouver, ISO, and other styles
8

Baccari, Charles. "Investigation of Finite Groups Through Progenitors." CSUSB ScholarWorks, 2017. https://scholarworks.lib.csusb.edu/etd/600.

Full text
Abstract:
The goal of this presentation is to find original symmetric presentations of finite groups. It is frequently the case, that progenitors factored by appropriate relations produce simple and even sporadic groups as homomorphic images. We have discovered two of the twenty-six sporadic simple groups namely, M12, J1 and the Lie type group Suz(8). In addition several linear and classical groups will also be presented. We will present several progenitors including: 2*12: 22 x (3 : 2), 2*11: PSL2(11), 2*5: (5 : 4) which have produced the homomorphic images: M12 : 2, Suz(8) x 2, and J1 x 2. We will give monomial progenitors whose homomorphic images are: 17*10 :m PGL2(9), 3*4:m Z2 ≀D4 , and 13*2:m (22 x 3) : 2 which produce the homomorphic images:132 : ((2 x 13) : (2 x 3)), 2 x S9, and (22)•PGL4(3). Once we have a presentation of a group we can verify the group's existence through double coset enumeration. We will give proofs of isomorphism types of the presented images: S3 x PGL2(7) x S5, 28:A5, and 2•U4(2):2.
APA, Harvard, Vancouver, ISO, and other styles
9

Juan, Shirley Marina. "Images of Permutation and Monomial Progenitors." CSUSB ScholarWorks, 2018. https://scholarworks.lib.csusb.edu/etd/720.

Full text
Abstract:
We have conducted a systematic search for finite homomorphic images of several permutation and monomial progenitors. We have found original symmetric presentations for several important groups such as the Mathieu sporadic simple groups, Suzuki simple group, unitary group, Janko group, simplectic groups, and projective special linear groups. We have also constructed, using the technique of double coset enumeration, the following groups, L_2(11), S(4,3):2, M11, and PGL(2,11). The isomorphism class of each of the finite images is also given.
APA, Harvard, Vancouver, ISO, and other styles
10

Fernandez, Erica. "CONSTRUCTION OF HOMOMORPHIC IMAGES." CSUSB ScholarWorks, 2017. https://scholarworks.lib.csusb.edu/etd/599.

Full text
Abstract:
We have investigated several monomial and permutation progenitors, including 2*8 : [8 : 2], 2*18 : [(22 x 3) : (3x2)], 2*16 : [22 : 4], and 2*16 : 24, 5*2 :m [4•22], 5*2 :m [(4x2) :• 2], 103∗2 :m [17 : 2] and 103∗4 :m [17 : 4]. We have discovered original, to the best of our knowledge, symmetric presentations of a number of finite groups, including PSL(2, 7), M12 , A6 : 2, A7 , PSL(2, 25), 25 :• S4, 24 : S3, PSL(2, 271), 12 x PSL(2, 13), and U(3, 7) : 2. We will present our construction of several of these images, including the Mathieu sporadic simple group M12 over the maximal subgroup PSL(2, 11), PSL(2, 17) over D9, PSL(2, 16) : 2 over [24 : 5] and PGL(2, 7) over S3. We will also give our method of finding isomorphism classes of images.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Coset enumeration"

1

Schweitzer, Martin. Estimating energy and cost savings and emissions reductions for the state energy program based on enumeration indicators data. Oak Ridge, Tenn: Oak Ridge National Laboratory, 2003.

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

Book chapters on the topic "Coset enumeration"

1

Cooperman, Gene, and George Havas. "Practical parallel coset enumeration." In Lecture Notes in Control and Information Sciences, 15–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3540761691_3.

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

Fujita, Shinsaku. "Coset Representations and Orbits." In Symmetry and Combinatorial Enumeration in Chemistry, 45–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-76696-1_5.

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

Fujita, Shinsaku. "Subduction of Coset Representations." In Symmetry and Combinatorial Enumeration in Chemistry, 101–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-76696-1_9.

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

Fujita, Shinsaku. "Local Symmetries and Forbidden Coset Representations." In Symmetry and Combinatorial Enumeration in Chemistry, 75–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-76696-1_7.

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

"Coset Enumeration." In Presentations of Groups, 100–115. Cambridge University Press, 1997. http://dx.doi.org/10.1017/cbo9781139168410.009.

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

"Coset enumeration." In Computation with Finitely Presented Groups, 217–67. Cambridge University Press, 1994. http://dx.doi.org/10.1017/cbo9780511574702.007.

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

"Coset Enumeration." In Discrete Mathematics and Its Applications, 149–98. Chapman and Hall/CRC, 2005. http://dx.doi.org/10.1201/9781420035216.ch5.

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

"Ch 5 Coset Enumeration." In Handbook of Computational Group Theory, 166–215. Chapman and Hall/CRC, 2005. http://dx.doi.org/10.1201/9781420035216-7.

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

Janko, Zvonimir. "Coset Enumeration in Groups and Constructions of Symmetric Designs." In Combinatorics '90 - Recent Trends and Applications, Proceedings of the Conference on Corn binatorics, Gaeta, 275–77. Elsevier, 1992. http://dx.doi.org/10.1016/s0167-5060(08)70919-1.

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

Alessio, Alessandro, and Alberto Bemporad. "Feasible Mode Enumeration and Cost Comparison for Explicit Quadratic Model Predictive Control of Hybrid Systems." In Analysis and Design of Hybrid Systems 2006, 302–8. Elsevier, 2006. http://dx.doi.org/10.1016/b978-008044613-4.50056-2.

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

Conference papers on the topic "Coset enumeration"

1

Havas, George. "Coset enumeration strategies." In the 1991 international symposium. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/120694.120723.

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

HAVAS, GEORGE, and COLIN RAMSAY. "PARALLEL COSET ENUMERATION USING THREADS." In Proceedings of the Fourth Asian Symposium (ASCM 2000). WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812791962_0004.

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

Cooperman, Gene, and Victor Grinberg. "Scalable parallel coset enumeration using bulk definition." In the 2001 international symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/384101.384113.

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

Reinert, Birgit, Klaus Madlener, and Teo Mora. "A note on Nielsen reduction and coset enumeration." In the 1998 international symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/281508.281607.

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

Timmons, Eric, and Brian C. Williams. "Best-first Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation (Extended Abstract)." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/721.

Full text
Abstract:
State estimation methods based on hybrid discrete and continuous state models have emerged as a method of precisely computing belief states for real world systems, however they have difficulty scaling to systems with more than a handful of components. Classical, consistency based diagnosis methods scale to this level by combining best-first enumeration and conflict-directed search. While best-first methods have been developed for hybrid estimation, conflict-directed methods have thus far been elusive as conflicts summarize constraint violations, but probabilistic hybrid estimation is relatively unconstrained. In this paper we present an approach (A*BC) that unifies best-first enumeration and conflict-directed search in relatively unconstrained problems through the concept of "bounding" conflicts, an extension of conflicts that represent tighter bounds on the cost of regions of the search space. Experiments show that an A*BC powered state estimator produces estimates up to an order of magnitude faster than the current state of the art, particularly on large systems.
APA, Harvard, Vancouver, ISO, and other styles
6

Herber, Daniel R. "Enhancements to the Perfect Matching Approach for Graph Enumeration-Based Engineering Challenges." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22774.

Full text
Abstract:
Abstract Graphs can be used to represent many engineering systems and decisions because of their ability to capture discrete compositional and relational information. In this article, improved methods for effectively representing and generating all graphs in a space defined by certain complex specifications are presented. These improvements are realized through enhancements to the original perfect matching-inspired approach utilizing a component catalog definition to capture the graphs of interest. These enhancements will come in many forms, including more efficient graph enumeration and labeled graph isomorphism checking, expansion of the definition of the component catalog, and the effective inclusion of new network structure constraints. Several examples are shown, including improvements to the original case studies (with up to 971× reduction in computational cost) as well as graph problems in common system architecture design patterns. The goal is to show that the work presented here and tools developed from it can play a role as the domain-independent architecture decision support tool for a variety of graph enumeration-based engineering design challenges.
APA, Harvard, Vancouver, ISO, and other styles
7

Kuhn, N., and K. Madlener. "A method for enumerating cosets of a group presented by a canonical system." In the ACM-SIGSAM 1989 international symposium. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/74540.74580.

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

Guo, Tinghao, Daniel R. Herber, and James T. Allison. "Reducing Evaluation Cost for Circuit Synthesis Using Active Learning." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85654.

Full text
Abstract:
In this article, an active learning strategy is introduced for reducing evaluation cost associated with system architecture design problems and is demonstrated using a circuit synthesis problem. While established circuit synthesis methods, such as efficient enumeration strategies and genetic algorithms (GAs), are available, evaluation of candidate architectures often requires computationally-expensive simulations, limiting the scale of solvable problems. Strategies are needed to explore architecture design spaces more efficiently, reducing the number of evaluations required to obtain good solutions. Active learning is a semi-supervised machine learning technique that constructs a predictive model. Here we use active learning to interactively query architecture data as a strategy to choose which candidate architectures to evaluate in a way that accelerates effective design search. Active learning is used to iteratively improve predictive model accuracy with strategically-selected training samples. The predictive model used here is an ensemble method, known as random forest. Several query strategies are compared. A circuit synthesis problem is used to test the active learning strategy; two complete data sets for this case study are available, aiding analysis. While active learning has been used for structured outputs, such as sequence labeling task, the interface between active learning and engineering design, particularly circuit synthesis, has not been well studied. The results indicate that active learning is a promising strategy in reducing the evaluation cost for the circuit synthesis problem, and provide insight into possible next steps for this general solution approach.
APA, Harvard, Vancouver, ISO, and other styles
9

Waas, Florian, and César Galindo-Legaria. "Counting, enumerating, and sampling of execution plans in a cost-based query optimizer." In the 2000 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/342009.335451.

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

Cho, Myoung-Ock, Hyo Mi Chang, Yeon Gyu Yu, Hwataik Han, and Jung Kyung Kim. "Selective and Automated Detection of Airborne Asbestos Fibers Using Chrysotile-Adhesive Protein and High-Throughput Microscopy (HTM)." In ASME 2011 International Mechanical Engineering Congress and Exposition. ASMEDC, 2011. http://dx.doi.org/10.1115/imece2011-63721.

Full text
Abstract:
There are several methods to detect asbestos including phase contrast microscopy (PCM), polarized light microscopy, X-ray diffraction, and electron microscopy. Although the PCM method is widely used due to its simple process and relatively low cost, it is a time-consuming and laborious process that is manually performed by a human counter. We developed a high-throughput microscopy (HTM) system for automated counting of airborne asbestos fibers to automate the conventional PCM method. Our results show that automatic image acquisition by synchronization of charge-coupled device (CCD) camera with movement of stages, and image analysis using image processing software, significantly reduced time consumption and labor. In this study, we used DksA chrysotile-adhesive protein for the selective detection of asbestos. DksA, known as the protein that specifically attaches to chrysotile, was extracted from Escherichia coli through a recombinant protein technique. We tried to detect chrysotile selectively from other fibers or particles, and we developed a highly selective and automated low-cost device for automated identification and enumeration of airborne asbestos fibers based on the HTM method.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Coset enumeration"

1

Schweitzer, M. Estimating Energy and Cost Savings and Emissions Reductions for the State Energy Program Based on Enumeration Indicators Data. Office of Scientific and Technical Information (OSTI), February 2003. http://dx.doi.org/10.2172/814516.

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