Log in

Relevant bibliographies by topics / Minimal generators

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Minimal generators'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 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 'Minimal generators.'

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 "Minimal generators"

1

Porst, Hans-E. "Varieties without minimal generators." Algebra Universalis 45, no. 1 (February 1, 2001): 23–33. http://dx.doi.org/10.1007/s000120050199.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kowalski, Zbigniew. "Minimal generators for ergodic endomorphisms." Studia Mathematica 91, no. 2 (1988): 85–88. http://dx.doi.org/10.4064/sm-91-2-85-88.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zaman, Naveed. "Minimal Generators and Injective Modules." Communications in Algebra 31, no. 2 (January 4, 2003): 869–81. http://dx.doi.org/10.1081/agb-120017348.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Leavitt, W. G., and R. F. Rossa. "Minimal generators of radical classes." Communications in Algebra 14, no. 3 (January 1986): 531–55. http://dx.doi.org/10.1080/00927878608823324.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hillar, Christopher J., and Troels Windfeldt. "Minimal generators for symmetric ideals." Proceedings of the American Mathematical Society 136, no. 12 (June 11, 2008): 4135–37. http://dx.doi.org/10.1090/s0002-9939-08-09427-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lucchini, Andrea. "Generators and minimal normal subgroups." Archiv der Mathematik 64, no. 4 (April 1995): 273–76. http://dx.doi.org/10.1007/bf01198079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Vimieiro, Renato, and Pablo Moscato. "Mining disjunctive minimal generators with TitanicOR." Expert Systems with Applications 39, no. 9 (July 2012): 8228–38. http://dx.doi.org/10.1016/j.eswa.2012.01.141.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Conaway, Rebecca, Felix Gotti, Jesse Horton, Christopher O’Neill, Roberto Pelayo, Mesa Pracht, and Brian Wissman. "Minimal presentations of shifted numerical monoids." International Journal of Algebra and Computation 28, no. 01 (February 2018): 53–68. http://dx.doi.org/10.1142/s0218196718500030.

Full text

Abstract:

A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid [Formula: see text], consider the family of “shifted” monoids [Formula: see text] obtained by adding [Formula: see text] to each generator of [Formula: see text]. In this paper, we examine minimal relations among the generators of [Formula: see text] when [Formula: see text] is sufficiently large, culminating in a description that is periodic in the shift parameter [Formula: see text]. We explore several applications to computation and factorization theory, and improve a recent result of Thanh Vu from combinatorial commutative algebra.

APA, Harvard, Vancouver, ISO, and other styles

9

Fang, Y. P., K. W. Meng, and X. Q. Yang. "On minimal generators for semi-closed polyhedra." Optimization 64, no. 4 (August 6, 2013): 761–70. http://dx.doi.org/10.1080/02331934.2013.820299.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Burckel, Serge, and Marianne Morillon. "Three generators for minimal writing-space computations." RAIRO - Theoretical Informatics and Applications 34, no. 2 (March 2000): 131–38. http://dx.doi.org/10.1051/ita:2000110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Minimal generators"

1

Wong, Kieh (Kieh Yun) 1957 Carleton University Dissertation Mathematics. "The minimal number of generators of a group." Ottawa.:, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Junqueira, Hadura Albano Alexandre Luiz. "Polynomial growth of concept lattices, canonical bases and generators:." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-226980.

Full text

Abstract:

We prove that there exist three distinct, comprehensive classes of (formal) contexts with polynomially many concepts. Namely: contexts which are nowhere dense, of bounded breadth or highly convex. Already present in G. Birkhoff's classic monograph is the notion of breadth of a lattice; it equals the number of atoms of a largest boolean suborder. Even though it is natural to define the breadth of a context as being that of its concept lattice, this idea had not been exploited before. We do this and establish many equivalences. Amongst them, it is shown that the breadth of a context equals the size of its largest minimal generator, its largest contranominal-scale subcontext, as well as the Vapnik-Chervonenkis dimension of both its system of extents and of intents. The polynomiality of the aforementioned classes is proven via upper bounds (also known as majorants) for the number of maximal bipartite cliques in bipartite graphs. These are results obtained by various authors in the last decades. The fact that they yield statements about formal contexts is a reward for investigating how two established fields interact, specifically Formal Concept Analysis (FCA) and graph theory. We improve considerably the breadth bound. Such improvement is twofold: besides giving a much tighter expression, we prove that it limits the number of minimal generators. This is strictly more general than upper bounding the quantity of concepts. Indeed, it automatically implies a bound on these, as well as on the number of proper premises. A corollary is that this improved result is a bound for the number of implications in the canonical basis too. With respect to the quantity of concepts, this sharper majorant is shown to be best possible. Such fact is established by constructing contexts whose concept lattices exhibit exactly that many elements. These structures are termed, respectively, extremal contexts and extremal lattices. The usual procedure of taking the standard context allows one to work interchangeably with either one of these two extremal structures. Extremal lattices are equivalently defined as finite lattices which have as many elements as possible, under the condition that they obey two upper limits: one for its number of join-irreducibles, other for its breadth. Subsequently, these structures are characterized in two ways. Our first characterization is done using the lattice perspective. Initially, we construct extremal lattices by the iterated operation of finding smaller, extremal subsemilattices and duplicating their elements. Then, it is shown that every extremal lattice must be obtained through a recursive application of this construction principle. A byproduct of this contribution is that extremal lattices are always meet-distributive. Despite the fact that this approach is revealing, the vicinity of its findings contains unanswered combinatorial questions which are relevant. Most notably, the number of meet-irreducibles of extremal lattices escapes from control when this construction is conducted. Aiming to get a grip on the number of meet-irreducibles, we succeed at proving an alternative characterization of these structures. This second approach is based on implication logic, and exposes an interesting link between number of proper premises, pseudo-extents and concepts. A guiding idea in this scenario is to use implications to construct lattices. It turns out that constructing extremal structures with this method is simpler, in the sense that a recursive application of the construction principle is not needed. Moreover, we obtain with ease a general, explicit formula for the Whitney numbers of extremal lattices. This reveals that they are unimodal, too. Like the first, this second construction method is shown to be characteristic. A particular case of the construction is able to force - with precision - a high number of (in the sense of "exponentially many'') meet-irreducibles. Such occasional explosion of meet-irreducibles motivates a generalization of the notion of extremal lattices. This is done by means of considering a more refined partition of the class of all finite lattices. In this finer-grained setting, each extremal class consists of lattices with bounded breadth, number of join irreducibles and meet-irreducibles as well. The generalized problem of finding the maximum number of concepts reveals itself to be challenging. Instead of attempting to classify these structures completely, we pose questions inspired by Turán's seminal result in extremal combinatorics. Most prominently: do extremal lattices (in this more general sense) have the maximum permitted breadth? We show a general statement in this setting: for every choice of limits (breadth, number of join-irreducibles and meet-irreducibles), we produce some extremal lattice with the maximum permitted breadth. The tools which underpin all the intuitions in this scenario are hypergraphs and exact set covers. In a rather unexpected, but interesting turn of events, we obtain for free a simple and interesting theorem about the general existence of "rich'' subcontexts. Precisely: every context contains an object/attribute pair which, after removed, results in a context with at least half the original number of concepts.

APA, Harvard, Vancouver, ISO, and other styles

3

Sertkaya, Baris. "Formal Concept Analysis Methods for Description Logics." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2008. http://nbn-resolving.de/urn:nbn:de:bsz:14-ds-1215598189927-85390.

Full text

Abstract:

This work presents mainly two contributions to Description Logics (DLs) research by means of Formal Concept Analysis (FCA) methods: supporting bottom-up construction of DL knowledge bases, and completing DL knowledge bases. Its contribution to FCA research is on the computational complexity of computing generators of closed sets.

APA, Harvard, Vancouver, ISO, and other styles

4

Sertkaya, Baris. "Formal Concept Analysis Methods for Description Logics." Doctoral thesis, Technische Universität Dresden, 2007. https://tud.qucosa.de/id/qucosa%3A23613.

Full text

Abstract:

This work presents mainly two contributions to Description Logics (DLs) research by means of Formal Concept Analysis (FCA) methods: supporting bottom-up construction of DL knowledge bases, and completing DL knowledge bases. Its contribution to FCA research is on the computational complexity of computing generators of closed sets.

APA, Harvard, Vancouver, ISO, and other styles

5

Maia, Mariana de Brito. "Módulos de Ulrich." Universidade Federal da Paraíba, 2013. http://tede.biblioteca.ufpb.br:8080/handle/tede/8019.

Full text

Abstract:

Submitted by Maike Costa (maiksebas@gmail.com) on 2016-03-21T14:11:17Z No. of bitstreams: 1 arquivo total.pdf: 931330 bytes, checksum: 351b504f68153fb01d23f3fd1d96d2a0 (MD5)
Made available in DSpace on 2016-03-21T14:11:17Z (GMT). No. of bitstreams: 1 arquivo total.pdf: 931330 bytes, checksum: 351b504f68153fb01d23f3fd1d96d2a0 (MD5) Previous issue date: 2013-04-29
In this work, after the introduction of some concepts of Commutative Algebra, for instance dimension, minimal number of generators, and multiplicity, we prove the existence of a very special class of modules over Cohen-Macaulay rings, the so-called Ulrich modules. It is known that, if M is a maximal Cohen-Macaulay module over such ring, then (M) e(M). Our goal in this study is to prove the main cases where the equality (M) e(M) holds.
Neste trabalho, após introduzirmos alguns conceitos de Álgebra Comutativa, como dimensão, número mínimo de geradores, e multiplicidade, provamos a existência de uma classe de módulos bastante especial sobre anéis Cohen-Macaulay, os chamados módulos de Ulrich. É sabido que, se M é um A-módulo Cohen-Macaulay maximal sobre um tal anel, então (M) e(M). O objetivo do nosso estudo é demonstrar os principais casos em que vale (M) = e(M).

APA, Harvard, Vancouver, ISO, and other styles

6

Elliott, Paul Harrison 1979. "An efficient projected minimal conflict generator for projected prime implicate and implicant generation." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17766.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2004.
Includes bibliographical references (p. 109-111).
Performing real-time reasoning on models of physical systems is essential in many situations, especially when human intervention is impossible. Since many deductive reasoning tasks take memory or time that is exponential in the number of variables that appear in the model, efforts need to be made to reduce the size of the models used online. The model can be reduced without sacrificing reasoning ability by targeting the model for a specific task, such as diagnosis or reconfiguration. A model may be reduced through model compilation, an offline process where relations and variables that have no bearing on the particular task are removed. This thesis introduces a novel approach to model compilation, through the generation of projected prime implicates and projected prime implicants. Prime implicates and prime implicants compactly represent the consequences of a logical theory. Projection eliminates model variables and their associated prime implicates or implicants that do not contribute to the particular task. This elimination process reduces the size and number of variables appearing in the model and therefore the complexity of the real-time reasoning problem. This thesis presents a minimal conflict generator that efficiently generates projected prime implicates and projected prime implicants. The projected minimal conflict generator uses a generate-and-test approach, in which the candidate generator finds potential minimal conflicts that are then accepted or rejected by the candidate tester. The candidate generator uses systematic search in combination with an iterative deepening algorithm, in order to reduce the space required by the algorithm to a space that is linear in the number of variables rather than exponential.
(cont.) In order to make the algorithm more time efficient, the candidate generator prunes the search space using previously found implicants, as well as minimal conflicts, which identify the sub-spaces that contain no new minimal conflicts. The candidate tester identifies implicants of the model by testing for validity. The tester uses a clause-directed approach along with finite-domain variables to efficiently test for validity. Combined, these techniques allow the tester to test for validity without assigning a value to every variable. The conflict generator was evaluated on randomly generated models; problems in which models with 20 variables, 5 domain elements each, were projected onto 5 variables. All projected prime implicates were generated from models with 20 clauses within 2 seconds, and from models with 80 clauses within 13 seconds.
by Paul Harrison Elliott.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

7

Marques, Felipe de Souza. "Technology mapping for virtual libraries based on cells with minimal transistor stacks." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2008. http://hdl.handle.net/10183/16130.

Full text

Abstract:

Atualmente, as tecnologias disponíveis para a fabricação de dispositivos eletrônicos permitem um alto grau de integração de semicondutores. Entretanto, esta integração torna o projeto, a verificação e o teste de circuitos integrados mais difíceis. Normalmente, o projeto de circuitos integrados é consideravelmente afetado com a diminuição do tamanho dos dispositivos eletrônicos em tecnologias sub-micrônicas. Conseqüentemente, os projetistas adotam metodologias rígidas para produzir circuitos de alta qualidade em tempo razoável. Ferramentas de auxílio ao projeto de circuitos eletrônicos são utilizadas para automatizar algumas das etapas do projeto, ajudando o projetista a encontrar boas soluções rapidamente. Uma das tarefas mais difíceis no projeto de circuitos integrados é fazer com que o circuito respeite as restrições de atraso. Isto depende de várias etapas do processo de síntese. Em metodologias baseadas em bibliotecas de células, isto está diretamente relacionado ao algoritmo para mapeamento tecnológico e as células disponíveis na biblioteca. O atraso de cada célula depende do tamanho dos transistores e da topologia da rede de transistores. Isso determina as características de atraso, potência e área de uma célula. O mapeamento tecnológico define as principais características estruturais do circuito, principalmente em área, potência e atraso. A qualidade do circuito mapeado depende das células disponíveis na biblioteca de células. Este trabalho propõe um novo método para mapeamento com bibliotecas virtuais para redução de atraso em circuitos combinacionais. Ambos os algoritmos baseiam-se em uma topologia de células capaz de implementar funções Booleanas com cadeias mínimas de transistores em série. Os algoritmos reduzem o número de transistores em série do caminho mais longo do circuito, considerando que cada célula é implementada por uma rede de transistores que obedecem um número máximo de transistores em série. O número de transistores em série é calculado de forma Booleana, garantindo que este seja o número mínimo necessário para implementar a função lógica da célula. Os algoritmos estão integrados a um gerador de células que utiliza tal topologia e realiza o dimensionamento dos transistores. Ganhos significativos podem ser obtidos combinando estas duas técnicas em uma ferramenta para mapeamento tecnológico.
Currently, microelectronic technologies enable high degrees of semiconductor integration. However, this integration makes the design, verification, and test challenges more difficult. The circuit design is often the first area under assault by the effects of aggressive scaling in deep-submicron technologies. Therefore, designers have adopted strict methodologies to deal with the challenge of developing high quality designs on a reasonable time. Electronic Design Automation tools play an important role, automating some of the design phases and helping the designer to find a good solution faster. One of the hardest challenges of an integrated circuit design is to meet the timing requirements. It depends on several steps of the synthesis flow. In standard cell based flows, it is directly related to the technology mapping algorithm and the cells available in the library. The performance of a cell is directly related to the transistor sizing and the cell topology. It determines the timing, power and area characteristics of a cell. Technology mapping has a major impact on the structure of the circuit, and on its delay and area characteristics. The quality of the mapped circuit depends on the richness of the cell library. This thesis proposes two different approaches for library-free technology mapping aiming delay reduction in combinational circuits. Both algorithms rely on a cell topology able to implement Boolean functions using minimal transistors stacks. They reduce the overall number of serial transistors through the longest path, considering that each transistor network of a cell has to obey to a maximum admitted chain. The mapping algorithms are integrated to a cell generator that creates cells with minimal transistor stacks. This cell generator is also in charge of performing the transistor sizing. Significant gains can be obtained in delay due to both aspects combined into the proposed mapping tool.

APA, Harvard, Vancouver, ISO, and other styles

8

Moreau, Daniel. "Minimum built form for maximum urban impact: exploring the minimum built form that generates the greatest urban impact through architecture of closed-loop material systems." Master's thesis, University of Cape Town, 2018. http://hdl.handle.net/11427/28076.

Full text

Abstract:

Current top-down city planning strategies implement abstract ideas and impose them on a society while neglecting a crucial sense of public voice and inclusion (Krause, 2011). Through exploring ideas of community ownership of space and flexibility of social inhabitation, the design dissertation aims to understand the minimum built form that generates the greatest urban impact through architecture of closed-loop material systems. The inquiry focuses on urban upgrade that is low in embodied energy and holistic in its processes and implementation, where the social side of community participation is overlapped with technical explorations of material re-use and local procurement that promotes inclusive architecture. The use of low-tech materials requires high amounts of labour, which generates a positive state of community buy-in and inclusion both qualitatively (dignity and ownership) and qualitatively (Job creation). The design dissertation demonstrates how a relatively small building can make massive improvements in activation of site and precinct, being catalytic with community participation and urban upgrade of a rich, authentic nature. The aspiration of this design research is to generate a speculative design framework and set of experimental design details that are useful to local municipalities, planners, urban designers, architects and NGO's that are interested in developing sustainable models for upgrade in under-resourced neighbourhoods of the Cape Town townships. With enough planning and unique tailoring of the building contract, procurement, project management and community involvement, these new typologies can offer more integrity than current and conventional builds. Unique teams require brave and unconventional practices that step out of the rigid comfort zone architects call the industry.

APA, Harvard, Vancouver, ISO, and other styles

9

Saccani, Michele. "Whole ship energy optimization: the case study of a chemical tanker." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/6324/.

Full text

Abstract:

La presente dissertazione investiga la possibilità di ottimizzare l’uso di energia a bordo di una nave per trasporto di prodotti chimici e petrolchimici. Il software sviluppato per questo studio può essere adattato a qualsiasi tipo di nave. Tale foglio di calcolo fornisce la metodologia per stimare vantaggi e miglioramenti energetici, con accuratezza direttamente proporzionale ai dati disponibili sulla configurazione del sistema energetico e sui dispositivi installati a bordo. Lo studio si basa su differenti fasi che permettono la semplificazione del lavoro; nell’introduzione sono indicati i dati necessari per svolgere un’accurata analisi ed è presentata la metodologia adottata. Inizialmente è fornita una spiegazione sul layout dell’impianto, sulle sue caratteristiche e sui principali dispositivi installati a bordo. Vengono dunque trattati separatamente i principali carichi, meccanico, elettrico e termico. In seguito si procede con una selezione delle principali fasi operative della nave: è seguito tale approccio in modo da comprendere meglio la ripartizione della richiesta di potenza a bordo della nave e il suo sfruttamento. Successivamente è svolto un controllo sul dimensionamento del sistema elettrico: ciò aiuta a comprendere se la potenza stimata dai progettisti sia assimilabile a quella effettivamente richiesta sulla nave. Si ottengono in seguito curve di carico meccanico, elettrico e termico in funzione del tempo per tutte le fasi operative considerate: tramite l’uso del software Visual Basic Application (VBA) vengono creati i profili di carico che possono essere gestiti nella successiva fase di ottimizzazione. L’ottimizzazione rappresenta il cuore di questo studio; i profili di potenza ottenuti dalla precedente fase sono gestiti in modo da conseguire un sistema che sia in grado di fornire potenza alla nave nel miglior modo possibile da un punto di vista energetico. Il sistema energetico della nave è modellato e ottimizzato mantenendo lo status quo dei dispositivi di bordo, per i quali sono considerate le configurazioni di “Load following”, “two shifts” e “minimal”. Una successiva investigazione riguarda l’installazione a bordo di un sistema di accumulo di energia termica, così da migliorare lo sfruttamento dell’energia disponibile. Infine, nella conclusione, sono messi a confronto i reali consumi della nave con i risultati ottenuti con e senza l’introduzione del sistema di accumulo termico. Attraverso la configurazione “minimal” è possibile risparmiare circa l’1,49% dell’energia totale consumata durante un anno di attività; tale risparmio è completamente gratuito poiché può essere raggiunto seguendo alcune semplici regole nella gestione dell’energia a bordo. L’introduzione di un sistema di accumulo termico incrementa il risparmio totale fino al 4,67% con un serbatoio in grado di accumulare 110000 kWh di energia termica; tuttavia, in questo caso, è necessario sostenere il costo di installazione del serbatoio. Vengono quindi dibattuti aspetti economici e ambientali in modo da spiegare e rendere chiari i vantaggi che si possono ottenere con l’applicazione di questo studio, in termini di denaro e riduzione di emissioni in atmosfera.

APA, Harvard, Vancouver, ISO, and other styles

10

林育匡. "Research on Minimum Sudoku Generator." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/33017447136079919227.

Full text

Abstract:

碩士
國立臺灣師範大學
資訊工程研究所
95
Sudoku can be categorized into several levels depending on the number of hints given. It is known that too few hints may lead to inconsistent solutions: either many or no solutions at all. To date the best-known minimum number of hints to consistently solve a Sudoku is 17. It is still an open question whether there exists a Sudoku with 16 hints which can also give a consistent solution. The strategies of this thesis are as follows. Firstly, we use 17-hints Sudokus as a basis to generate new 17-hints sodukus to widen our search space. We rewrite the “Solver” program to become “Quick Solver” which can filter new 17-hints Sudokus and insure that those new 17-hints Sudokus are all have one solution only. We use the “genes restructuring” algorithm to create new Sudokus which are then filtered to avoid redundant and inconsistent candidates. Secondly, we use these 17-hints Sudokus to generate all 16-hints Sudokus by removing one of the hints. The likelihood that this approach will lead to consistent 16-hits Sudokus is much higher compared to random-generated 16-hints Sudokus. All 16-hints Sudokus are then tested for consistency. After implement the system proposed in this thesis, we found out that more than 200,000 valid 17-hints Sudokus had been produced using about one month of computation time. It’s quick and efficient. Through those 200,000 17-hints Sudokus we can also generate more than 3 million 16-hints candidate Sudokus. Unfortunately, up to now, we still can not find out any valid 16-hints Sudoku. We hope that we can make it in the near future.

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Minimal generators"

1

Spiegel, Laurie. Thoughts on Composing with Algorithms. Edited by Roger T. Dean and Alex McLean. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780190226992.013.26.

Full text

Abstract:

In this chapter Laurie Spiegel, a pioneer of algorithmic logic in music composition, considers various reasons to use algorithms, including their function as descriptors, generators and adjuncts to creative musical practises. Self-simulation (notably, of decision making processes) is juxtaposed against the sonification of external information and various other uses of algorithms are also described. Human input may be minimal or extensive for the logic used to specify parameters of individual sonic events, variations in global informational entropy, inherent structuring or to achieve variation of material. Spiegel values algorithms particularly to allow her to ‘inhabit the state of flow’ of music by freeing her to focus on selected aspects of composing while handing off other aspects to automated procedures. The chapter includes descriptions of the kinds of uses of algorithmic logic that have contributed to the composition of specific musical works.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Minimal generators"

1

Frambourg, Céline, Petko Valtchev, and Robert Godin. "Merge-Based Computation of Minimal Generators." In Conceptual Structures: Common Semantics for Sharing Knowledge, 181–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11524564_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chiantini, L., F. Cioffi, and F. Orecchia. "Computing Minimal Generators of Ideals of Elliptic Curves." In Applications of Algebraic Geometry to Coding Theory, Physics and Computation, 23–35. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-010-1011-5_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Dong, Guozhu, Chunyu Jiang, Jian Pei, Jinyan Li, and Limsoon Wong. "Mining Succinct Systems of Minimal Generators of Formal Concepts." In Database Systems for Advanced Applications, 175–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11408079_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Krause, Matthias, and Stefan Lucks. "On the Minimal Hardware Complexity of Pseudorandom Function Generators." In STACS 2001, 419–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44693-1_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bastos, Gustavo Terra, and Marinês Guerreiro. "Idempotents Generators for Minimal Cyclic Codes of Length p n q." In Coding Theory and Applications, 345–52. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17296-5_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

García-Planas, María Isabel. "Minimal Set of Generators of Controllability Space for Singular Linear Systems." In Recent Advances in Differential Equations and Applications, 195–210. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-00341-8_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Brahmi, Hanen, Tarek Hamrouni, Riadh Ben Messaoud, and Sadok Ben Yahia. "Closed Non Derivable Data Cubes Based on Non Derivable Minimal Generators." In Advanced Data Mining and Applications, 55–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03348-3_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Phan, Huan. "A Novel Algorithm for Mining Minimal Generators of Closed Frequent Significance Itemsets." In Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery, 1768–79. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70665-4_191.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Castillo-Ramirez, Alonso, and Miguel Sanchez-Alvarez. "Bounding the Minimal Number of Generators of Groups and Monoids of Cellular Automata." In Cellular Automata and Discrete Complex Systems, 48–61. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20981-0_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zha, Chao-Zheng. "The Minimal Set of the Generators of Dehn Twists on a High Genus Riemann Surface." In Differential Geometric Methods in Theoretical Physics, 455–63. Boston, MA: Springer US, 1990. http://dx.doi.org/10.1007/978-1-4684-9148-7_46.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Minimal generators"

1

Machida, Hajime, and Michael Pinsker. "Polynomials as Generators of Minimal Clones." In 37th International Symposium on Multiple-Valued Logic. IEEE, 2007. http://dx.doi.org/10.1109/ismvl.2007.41.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Iwanuma, Koji, Kento Yajima, and Yoshitaka Yamamoto. "Mining Consistent, Non-Redundant and Minimal Negative Rules Based on Minimal Generators." In 2020 IEEE International Conference on Big Data (Big Data). IEEE, 2020. http://dx.doi.org/10.1109/bigdata50022.2020.9377846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Cioffi, Francesca, and Ferruccio Orecchia. "Computation of minimal generators of ideals of fat points." In the 2001 international symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/384101.384112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Warren, Vicki. "Condition-Based Assessment of Marine Air-Cooled Medium Voltage Generators." In SNAME Maritime Convention. SNAME, 2013. http://dx.doi.org/10.5957/smc-2013-t23.

Full text

Abstract:

The generators in a marine vessel are reliable and require minimal maintenance; however, as the generator ages and because of the harsh operating and ambient environments shipboard generators will develop problems. Ship maintenance personnel need reliable advanced notice of when and where problems develop within the stator or rotor winding insulation system. Unfortunately, traditional off-line testing does not provide this, as tests are done as a part of planned maintenance and under abnormal operating conditions of mechanical, thermal, ambient and electrical stresses. Advances in on-line monitoring have proven effective in meeting the need of maintenance personnel with a Condition-Based Maintenance program for air-cooled generators in marine vessels.

APA, Harvard, Vancouver, ISO, and other styles

5

Vo, Bay, and Bac Le. "Fast algorithm for mining minimal generators of frequent closed itemsets and their applications." In Industrial Engineering (CIE39). IEEE, 2009. http://dx.doi.org/10.1109/iccie.2009.5223846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hultman, Erik, Boel Ekergård, and Mats Leijon. "Electromagnetic, Mechanical and Manufacturing Properties for Cable Wound Direct-Drive PM Linear Generators for Offshore Environments." In ASME 2012 31st International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/omae2012-83381.

Full text

Abstract:

Renewable energy conversion in offshore environments, such as wave, wind and tidal energy, can potentially give a considerable contribution to the global electric energy demand. These harsh environments require robust generators with minimal need for maintenance at competitive costs. To reduce the generator cost, the electromagnetic design must be done with manufacturing in mind. An optimal design provides high electric efficiency, long device life-time, little need for maintenance and low manufacturing costs. Modern simulation tools can be used to optimize the electromagnetic design of a generator for a specific task and operation mode. Hereby both electromagnetic losses and material stresses can be reduced. Industrial robots might provide new possibilities to automate generator-specific manufacturing tasks. A generator design with a cable wound stator, surface mounted permanent magnets on the translator and direct-drive linear technology is investigated in this article. This concept has a simpler and more robust mechanical design, while both the electromagnetic losses and the need for maintenance are reduced. By reducing the number of generator assembly steps, manufacturing might also be facilitated. Further work is however needed in developing automated assembly methods and comparing them to conventional generator manufacturing.

APA, Harvard, Vancouver, ISO, and other styles

7

Hayes, Austin C., and Gregory L. Whiting. "Coupled Electromagnetic and Lattice Structure Optimization for the Rotor and Stator of Large Electric Machines." In ASME 2021 Power Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/power2021-62625.

Full text

Abstract:

Abstract Permanent magnet direct drive (PMDD) electric machines are advantageous due to higher efficiencies and lower maintenance concerns. For wind turbine generators, especially offshore turbines, this is advantageous to geared machines and is currently implemented by manufacturers such as GE, Siemens and Enercon. By nature, a direct drive machine must be larger than its geared counterpart in order to output the same power. As a result, the structural mass is larger and makes the machine prohibitively large. However, the structural mass and electromagnetic design is coupled and the electromagnetic criteria are an important consideration in the structural design. In this analysis, the electromagnetic design of a 5 MW PMDD generator was coupled to a triply periodic minimal surface (TPMS) lattice generator through means of an evolutionary algorithm. Finite element analysis (FEA) was used to determine the radial, torsional, and axial deformations under simulated wind turbine generator loading conditions subject to critical deflection criteria. Lattice functional grading was completed with the FEA deflection data in order to further optimize the structural mass. For the 5 MW test case, functional graded TPMS support structures maintained stiffness for a generator with a 32% higher force density with inactive mass 4% lower than baseline. This study suggests functional grading of TPMS lattice structures for wind turbine generators has the potential at significant mass savings.

APA, Harvard, Vancouver, ISO, and other styles

8

Buecker, Brad. "Water/Steam Treatment Programs and Chemistry Control for Heat Recovery Steam Generators." In ASME 2013 Power Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/power2013-98004.

Full text

Abstract:

New power generation in the U.S. is being dominated by installation of combined-cycle power plants, where a significant portion of the power is produced from steam turbines supplied by heat recovery steam generators (HRSG). Proper chemistry control and monitoring of HRSG feedwater, boiler water, and steam are essential for high reliability and availability of these units. However, many plants have minimal staff, most if not all of whom have no formal chemistry training and who may not fully understand the importance of water/steam chemistry and monitoring techniques. This paper provides an outline of the most important chemistry control methods and also examines the phenomenon of flow-accelerated corrosion (FAC). FAC is the leading cause of corrosion in HRSGs,[1] and is often the result of the outdated belief that oxygen scavengers are a requirement for feedwater treatment. Since 1986, FAC-induced failures at several coal-fired power plants have killed or injured a number of U.S. utility workers.

APA, Harvard, Vancouver, ISO, and other styles

9

Natarajan, Amla, Vincent A. Magnotta, and Nicole M. Grosland. "Hexahedral Meshing of Subject-Specific Anatomic Structures Using Registered Building Blocks." In ASME 2010 Summer Bioengineering Conference. American Society of Mechanical Engineers, 2010. http://dx.doi.org/10.1115/sbc2010-19391.

Full text

Abstract:

Generating high quality, subject-specific, 3D finite element anatomic models with minimal user-intervention remains a challenge. Numerous automated tetrahedral mesh generators are available, but hexahedral meshes are preferred due to their higher accuracy and faster computational time over tetrahedral meshes. Historically, the generation of hexahedral meshes for analysis is a tedious and time-consuming task. Therefore, the utilization of hexahedral meshes is often limited to baseline models that are powerful, but not patient-specific. Once a high quality mesh has been created, it would be ideal if it can be used to create meshes of similar surfaces from different subjects, without disrupting mesh quality.

APA, Harvard, Vancouver, ISO, and other styles

10

O’Brien, J. E., M. S. Sohal, and P. C. Wallstedt. "Heat Transfer Testing of Enhanced Finned-Tube Bundles Using the Single-Blow Technique." In ASME 2003 Heat Transfer Summer Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/ht2003-47426.

Full text

Abstract:

A single-blow test facility has been developed at the INEEL for pressure-drop and heat transfer performance testing of heat exchanger finned-tube bundles. Initial testing in the facility has been aimed at evaluating several enhanced heat transfer geometries to be used with individually finned tubes in which winglet vortex generators have been punched into the fin surfaces at specific locations. The winglets interact with the air flow to create longitudinal vortices that enhance fin-surface heat transfer performance with minimal increase in pressure drop. Results of two initial studies indicate heat transfer enhancement levels of 20–30% across the tested Reynolds number range (100–3000), with an increase in pressure drop of only 4–12%, over the same range.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!