Einloggen

Thematische Bibliographien / Algorithmic structures / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Algorithmic structures.

Zeitschriftenartikel zum Thema „Algorithmic structures“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 1. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Algorithmic structures" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Esponda-Argüero, Margarita. „Techniques for Visualizing Data Structures in Algorithmic Animations“. Information Visualization 9, Nr. 1 (29.01.2009): 31–46. http://dx.doi.org/10.1057/ivs.2008.26.

Der volle Inhalt der Quelle

Annotation:

This paper deals with techniques for the design and production of appealing algorithmic animations and their use in computer science education. A good visual animation is both a technical artifact and a work of art that can greatly enhance the understanding of an algorithm's workings. In the first part of the paper, I show that awareness of the composition principles used by other animators and visual artists can help programmers to create better algorithmic animations. The second part shows how to incorporate those ideas in novel animation systems, which represent data structures in a visually intuitive manner. The animations described in this paper have been implemented and used in the classroom for courses at university level.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Zhu, Guo Jin, Kai Zhang und Ji Yun Li. „Discovering Algorithmic Relationship between Programming Resources on the Web“. Applied Mechanics and Materials 347-350 (August 2013): 2430–35. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2430.

Der volle Inhalt der Quelle

Annotation:

Algorithmic relationships are discovered here for programming tutoring. There are two kinds of algorithmic relationships between programming resources on the web: associative relationship and structural similarity relationship. They can be organized as a hierarchical body. An algorithm can solve different programming problems and a programming problem also can be solved by different algorithms. Thus, there is such algorithmic relationship, or associative relationship, between these programming resources on the web. The algorithmic structures of source codes can be mined by neural computing. Different source codes may have a structural similarity relationship between them, meaning that they are similar in their algorithmic structures. A learner can learn algorithms from simple to complicated structures or from similarities in their structures. In our experiment, we use a tree structure to organize the algorithmic relationships.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Kalimullin, I. „Algorithmic reducibilities of algebraic structures“. Journal of Logic and Computation 22, Nr. 4 (10.09.2010): 831–43. http://dx.doi.org/10.1093/logcom/exq046.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Cohn, H., und A. Kumar. „Algorithmic design of self-assembling structures“. Proceedings of the National Academy of Sciences 106, Nr. 24 (16.06.2009): 9570–75. http://dx.doi.org/10.1073/pnas.0901636106.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Mikhailovsky, George. „Structuredness as a Measure of the Complexity of the Structure and the Role of Post-Dissipative Structures and Ratchet Processes in Evolution“. Journal of Evolutionary Science 1, Nr. 2 (23.01.2020): 40–52. http://dx.doi.org/10.14302/issn.2689-4602.jes-19-3155.

Der volle Inhalt der Quelle

Annotation:

As shown earlier, the algorithmic complexity, like Shannon information and Boltzmann entropy, tends to increase in accordance with the general law of complification. However, the algorithmic complexity of most material systems does not reach its maximum, i.e. chaotic state, due to the various laws of nature that create certain structures. The complexity of such structures is very different from the algorithmic complexity, and we intuitively feel that its maximal value should be somewhere between order and chaos. I propose a formula for calculation such structural complexity, which can be called - structuredness. The structuredness of any material system is determined by structures of three main types: stable, dissipative, and post-dissipative. The latter are defined as stable structures created by dissipative ones, directly or indirectly. Post-dissipative structures, as well as stable, can exist for an unlimited time, but at the micro level only, without energy influx. The appearance of such structures leads to the “ratchet” process, which determines the structure genesis in non-living and, especially, in living systems. This process allows systems with post-dissipative structures to develop in the direction of maximum structuring due to the gradual accumulation of these structures, even when such structuring contradicts the general law of complification.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Harizanov, Valentina S. „Computability-Theoretic Complexity of Countable Structures“. Bulletin of Symbolic Logic 8, Nr. 4 (Dezember 2002): 457–77. http://dx.doi.org/10.2178/bsl/1182353917.

Der volle Inhalt der Quelle

Annotation:

Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and results. For example, in the 1950's, Fröhlich and Shepherdson realized that the concept of a computable function can make van der Waerden's intuitive notion of an explicit field precise. This led to the notion of a computable structure. In 1960, Rabin proved that every computable field has a computable algebraic closure. However, not every classical result “effectivizes”. Unlike Vaught's theorem that no complete theory has exactly two nonisomorphic countable models, Millar's and Kudaibergenov's result establishes that there is a complete decidable theory that has exactly two nonisomorphic countable models with computable elementary diagrams. In the 1970's, Metakides and Nerode [58], [59] and Remmel [71], [72], [73] used more advanced methods of computability theory to investigate algorithmic properties of fields, vector spaces, and other mathematical structures.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Zenil, Hector, Fernando Soler-Toscano, Jean-Paul Delahaye und Nicolas Gauvrit. „Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility“. PeerJ Computer Science 1 (30.09.2015): e23. http://dx.doi.org/10.7717/peerj-cs.23.

Der volle Inhalt der Quelle

Annotation:

We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluatingn-dimensional complexity by using ann-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complexn-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. Algorithmic probability also elegantly connects the frequency of occurrence of a pattern with its algorithmic complexity, hence effectively providing estimations to the complexity of the generated patterns. Experiments to validate estimations of algorithmic complexity based on these concepts are presented, showing that the measure is stable in the face of some changes in computational formalism and that results are in agreement with the results obtained using lossless compression algorithms when both methods overlap in their range of applicability. We then use the output frequency of the set of 2-dimensional Turing machines to classify the algorithmic complexity of the space-time evolutions of Elementary Cellular Automata.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Jarrahi, Mohammad Hossein, Gemma Newlands, Min Kyung Lee, Christine T. Wolf, Eliscia Kinder und Will Sutherland. „Algorithmic management in a work context“. Big Data & Society 8, Nr. 2 (Juli 2021): 205395172110203. http://dx.doi.org/10.1177/20539517211020332.

Der volle Inhalt der Quelle

Annotation:

The rapid development of machine-learning algorithms, which underpin contemporary artificial intelligence systems, has created new opportunities for the automation of work processes and management functions. While algorithmic management has been observed primarily within the platform-mediated gig economy, its transformative reach and consequences are also spreading to more standard work settings. Exploring algorithmic management as a sociotechnical concept, which reflects both technological infrastructures and organizational choices, we discuss how algorithmic management may influence existing power and social structures within organizations. We identify three key issues. First, we explore how algorithmic management shapes pre-existing power dynamics between workers and managers. Second, we discuss how algorithmic management demands new roles and competencies while also fostering oppositional attitudes toward algorithms. Third, we explain how algorithmic management impacts knowledge and information exchange within an organization, unpacking the concept of opacity on both a technical and organizational level. We conclude by situating this piece in broader discussions on the future of work, accountability, and identifying future research steps.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Ratsaby, Joel, und J. Chaskalovic. „On the algorithmic complexity of static structures“. Journal of Systems Science and Complexity 23, Nr. 6 (Dezember 2010): 1037–53. http://dx.doi.org/10.1007/s11424-010-8465-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Chen, Chun-Teh, Francisco J. Martin-Martinez, Gang Seob Jung und Markus J. Buehler. „Polydopamine and eumelanin molecular structures investigated with ab initio calculations“. Chemical Science 8, Nr. 2 (2017): 1631–41. http://dx.doi.org/10.1039/c6sc04692d.

Der volle Inhalt der Quelle

Annotation:

A set of computational methods that contains a brute-force algorithmic generation of chemical isomers, molecular dynamics (MD) simulations, and density functional theory (DFT) calculations is reported and applied to investigate nearly 3000 probable molecular structures of polydopamine (PDA) and eumelanin.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

KOROVINA, MARGARITA, und OLEG KUDINOV. „Positive predicate structures for continuous data“. Mathematical Structures in Computer Science 25, Nr. 8 (13.11.2014): 1669–84. http://dx.doi.org/10.1017/s0960129513000315.

Der volle Inhalt der Quelle

Annotation:

In this paper, we develop a general framework for continuous data representations using positive predicate structures. We first show that basic principles of Σ-definability which are used to investigate computability, i.e., existence of a universal Σ-predicate and an algorithmic characterization of Σ-definability hold on all predicate structures without equality. Then we introduce positive predicate structures and show connections between these structures and effectively enumerable topological spaces. These links allow us to study computability over continuous data using logical and topological tools.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Mersch, Dieter. „Ideen zu einer Kritik ‚algorithmischer‘ Rationalität“. Deutsche Zeitschrift für Philosophie 67, Nr. 5 (02.12.2019): 851–73. http://dx.doi.org/10.1515/dzph-2019-0062.

Der volle Inhalt der Quelle

Annotation:

Abstract A critique of algorithmic rationalisation offers at best some initial reasons and preliminary ideas. Critique is understood as a reflection on validity. It is limited to an “epistemological investigation” of the limits of the calculable or of what appears “knowable” in the mode of the algorithmic. The argumentation aims at the mathematical foundations of computer science and goes back to the so-called “foundational crisis of mathematics” at the beginning of the 20th century with the attempt to formalise concepts such as calculability, decidability and provability. The Gödel theorems and Turing’s halting problem prove to be essential for any critical approach to “algorithmic rationalisation”. Both, however, do not provide unambiguous results, at best they run towards what later became known as “Gödel’s disjunction”. The chosen path here, however, suggests the opposite way, insofar as, on the one hand, the topos of creativity appear constitutive for what can be regarded as cognitive “algorithmic rationalisation” and which encounters systematic difficulties in the evaluation of non-trivial results. On the other hand, the investigations lead to a comparison between the “mediality” of formally generated structures, which have to distinguish between object-and metalanguages, and the “volatile” differentiality of human thought, which calls for syntactically non-simulatable sense structures.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Goldberg, David Theo. „Coding Time“. Critical Times 2, Nr. 3 (01.12.2019): 353–69. http://dx.doi.org/10.1215/26410478-7862517.

Der volle Inhalt der Quelle

Annotation:

Abstract This article analyzes the various ways algorithmic logic structures, streamlines, and delimits the conception of time and memory; orders the logics of social arrangement; and delimits the political. The author considers the ways in which algorithms extend racial discrimination, rendering it less visible, less discernible, and so more difficult to address. He briefly formulates a notion of crypto-value embedded within algorithmic self-conception and elaborates an algorithmic ontology. The latter is distinguished from the contemporary understanding of the post-human. The essay concludes with a reflection on a politics of street encounter as a counter to prevailing algorithmic constraints on the political. “Coding time” accordingly concerns the coding of time, the conception of time embedded in coding, the sociality and value that coding produces, and the implications for being and being human that the time of coding is manifesting.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Fischer, Michael, Helmut Masching, Matthias Firl und Kai Uwe Bletzinger. „Design of Lightweight Composite Structures: A Parameter Free Structural Optimization Approach“. Key Engineering Materials 504-506 (Februar 2012): 1391–96. http://dx.doi.org/10.4028/www.scientific.net/kem.504-506.1391.

Der volle Inhalt der Quelle

Annotation:

This contribution presents computational concepts and algorithmic techniques for simulation and gradient-based optimization of geometrically nonlinear and large-scale finite element models of composite structures. Several industrial application examples illustrate the methods, show the applicability to large problems, and prove the high parallel efficiency.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Danko, Wktor. „Axiomatizable Classes in Many-Sorted Logics of Programs“. Fundamenta Informaticae 8, Nr. 3-4 (01.07.1985): 269–83. http://dx.doi.org/10.3233/fi-1985-83-402.

Der volle Inhalt der Quelle

Annotation:

In this paper many-sorted logics of programs are considered (cf. Wand [16] and [3]). The aim is to characterize classes of structures axiomatizable by sets of algorithmic formulas. The results are formulated in terms of operations on classes of structures axiomatizable in the first order logic.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Huang, M. „Implications of forbidden structures for extremal algorithmic problems“. Theoretical Computer Science 40 (1985): 245–55. http://dx.doi.org/10.1016/0304-3975(85)90114-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Huang, Ming-Deh A., und Karl J. Lieberherr. „Implications of forbidden structures for extremal algorithmic problems“. Theoretical Computer Science 40 (1985): 195–210. http://dx.doi.org/10.1016/0304-3975(85)90166-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Bazgan, Cristina, Janka Chlebikova und Thomas Pontoizeau. „Structural and Algorithmic Properties of 2-Community Structures“. Algorithmica 80, Nr. 6 (06.02.2017): 1890–908. http://dx.doi.org/10.1007/s00453-017-0283-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Vejdemo-Johansson, Mikael. „Algorithms in A ∞-algebras“. Georgian Mathematical Journal 25, Nr. 4 (01.12.2018): 629–35. http://dx.doi.org/10.1515/gmj-2018-0057.

Der volle Inhalt der Quelle

Annotation:

AbstractBased on Kadeishvili’s original theorem inducing{A_{\infty}}-algebra structures on the homology of dg-algebras, several directions of algorithmic research in{A_{\infty}}-algebras have been pursued. In this paper, we survey the work done on calculating explicit{A_{\infty}}-algebra structures from homotopy retractions, in group cohomology and in persistent homology.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

JONOSKA, NATAŠA, und DARIA KARPENKO. „ACTIVE TILE SELF-ASSEMBLY, PART 2: SELF-SIMILAR STRUCTURES AND STRUCTURAL RECURSION“. International Journal of Foundations of Computer Science 25, Nr. 02 (Februar 2014): 165–94. http://dx.doi.org/10.1142/s0129054114500099.

Der volle Inhalt der Quelle

Annotation:

We introduce a mathematical framework to describe self-similarity and structural recursion within the active tile self-assembly model, thereby providing a connection between substitution tiling and algorithmic self-assembly. We show that one such structurally recursive assembly system can simulate the dynamics of the self-similar substitution tiling known as the L-shape tiling.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

O'Hara, Ian. „Feedback Loops: Algorithmic Authority, Emergent Biases, and Implications for Information Literacy“. Pennsylvania Libraries: Research & Practice 9, Nr. 1 (29.06.2021): 8–15. http://dx.doi.org/10.5195/palrap.2021.231.

Der volle Inhalt der Quelle

Annotation:

Algorithms have become increasingly ubiquitous in our modern, technologically driven society. Algorithmic tools that are embedded to “enhance” the user experience when information-seeking carry problematic epistemological concerns. These algorithms are developed and interjected into search tools by human beings who, consciously or not, tend to impart biases into the functionality of the information retrieval process. These search tools have become our primary arbiters of knowledge and have been granted relatively unmitigated sovereignty over our perceptions of reality and truth. This article provides broader awareness of how the bias embedded within these algorithmic systems structures users’ perception and knowledge of the world, preserving traditional power hierarchies and the marginalization of specific groups of people, and examines the implications of algorithmic search systems on information literacy instruction from a critical pedagogical perspective.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Getling, A. V., und A. A. Buchnev. „Quasi-regular structures in the solar photosphere (trenching in the brightness relief): Algorithmic treatment“. Proceedings of the International Astronomical Union 2, S239 (August 2006): 499–501. http://dx.doi.org/10.1017/s1743921307000981.

Der volle Inhalt der Quelle

Annotation:

AbstractThe results of applying two algorithmic techniques to time-averaged images of the solar granulation are presented. Some quasi-regular structures, which are hidden in the intense noise due to the presence of light blotches in the images, can be detected in this way.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Лавлинский und V. Lavlinskiy. „Theoretical bases of modelling of projected objects of electronic component base for synthesis of virtual reality in the form of the impacts of heavy charged particles“. Modeling of systems and processes 6, Nr. 3 (15.01.2014): 20–24. http://dx.doi.org/10.12737/2384.

Der volle Inhalt der Quelle

Annotation:

The article describes the mathematical and algorithmic foundations of 3D simulation of electronic component base CAD on the basis of synthesis of virtual reality influences of gravity and lead nuclear particles on CMOS structures.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Shynkarenko, V. I., V. M. Ilman und V. V. Skalozub. „Structural models of algorithms in problems of applied programming. I. Formal algorithmic structures“. Cybernetics and Systems Analysis 45, Nr. 3 (Mai 2009): 329–39. http://dx.doi.org/10.1007/s10559-009-9118-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Dewey, T. Gregory. „Algorithmic Complexity and Thermodynamics of Fractal Growth Processes“. Fractals 05, Nr. 04 (Dezember 1997): 697–706. http://dx.doi.org/10.1142/s0218348x97000565.

Der volle Inhalt der Quelle

Annotation:

A statistical mechanical formalism is developed using the computer information concepts of algorithmic complexity and Kolmogorov universal probability. This formalism provides a thermodynamic description of microstates of a system. For an isolated classical system, the algorithmic complexity is equal to the thermodynamic entropy. This approach does not rely on probabilistic ensemble concepts and can be applied to non-ergodic systems. An H-function is developed from the Kolmogorov universal probability that satisfies the properties of an entropy function. Using this approach, the thermodynamics of irreversible growth processes far from equilibrium can be investigated. Entropy functions for fractal growth processes far from equilibrium are developed from the algorithmic complexity and are seen to be similar to Flory-type equilibrium functions. This development does not require energy minimization procedures associated with equilibrium arguments. Using this approach, constraints can be put on the types of mean field models that will yield fractal structures. The algorithmic complexity of a system can also be used to explore the role of fluctuations and criticality in highly ordered systems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Doornbusch, Paul. „Composers' views on mapping in algorithmic composition“. Organised Sound 7, Nr. 2 (August 2002): 145–56. http://dx.doi.org/10.1017/s1355771802002066.

Der volle Inhalt der Quelle

Annotation:

Mapping concerns the connection between gestures, or structures and audible results in a musical performance or composition. While this is of intense interest to performers of new instruments and instrument designers, it has also been an area of interest for some composers. Algorithmic composition is sometimes the process of imagining a gesture or structure - perhaps physical or visual - and then applying a mapping process to turn that ‘gesture’ of the conceptual domain into sound which may display the original conception in some way. This article looks at mapping from the point of view of algorithmic composition, particularly where persistence is an issue, such that the gesture (conceptual domain) is embodied and perceptible in the musical result.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Deka, Biplab, Alex A. Birklykke, Henry Duwe, Vikash K. Mansinghka und Rakesh Kumar. „Markov chain algorithms: a template for building future robust low-power systems“. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 372, Nr. 2018 (28.06.2014): 20130277. http://dx.doi.org/10.1098/rsta.2013.0277.

Der volle Inhalt der Quelle

Annotation:

Although computational systems are looking towards post CMOS devices in the pursuit of lower power, the expected inherent unreliability of such devices makes it difficult to design robust systems without additional power overheads for guaranteeing robustness. As such, algorithmic structures with inherent ability to tolerate computational errors are of significant interest. We propose to cast applications as stochastic algorithms based on Markov chains (MCs) as such algorithms are both sufficiently general and tolerant to transition errors. We show with four example applications—Boolean satisfiability, sorting, low-density parity-check decoding and clustering—how applications can be cast as MC algorithms. Using algorithmic fault injection techniques, we demonstrate the robustness of these implementations to transition errors with high error rates. Based on these results, we make a case for using MCs as an algorithmic template for future robust low-power systems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Koziel, Slawomir, und Adrian Bekasiewicz. „Simulation-driven design of compact ultra-wideband antenna structures“. Engineering Computations 33, Nr. 4 (13.06.2016): 1051–69. http://dx.doi.org/10.1108/ec-06-2015-0163.

Der volle Inhalt der Quelle

Annotation:

Purpose – The purpose of this paper is to investigate strategies and algorithms for expedited design optimization and explicit size reduction of compact ultra-wideband (UWB) antennas. Design/methodology/approach – Formulation of the compact antenna design problem aiming at explicit size reduction while maintaining acceptable electrical performance is presented. Algorithmic frameworks are described suitable for handling various design situations and involving simulation models without and with response gradients available. Numerical and experimental case studies are provided demonstrating feasibility of solving real-world miniaturized antenna design tasks. Findings – It is possible, through appropriate combination of the global and local optimization methods, surrogate modeling techniques and response correction methods, to find optimum dimensions of antenna structures that minimize antenna size while maintaining acceptable electrical performance. Design optimization can be performed at practically feasible computational costs. Research limitations/implications – The study summarizes recent advances in miniaturization-oriented design optimization of UWB antennas. The presented techniques reach far beyond the commonly used design approaches based on parameter sweeps and similar hands-on methods, particularly in terms of automation, reliability, and reduction of the computational costs of the design processes. Originality/value – The proposed design problem formulation and algorithmic frameworks proved useful for rapid design of compact UWB antenna structures, which is extremely challenging when using conventional methods. To the knowledge, this is the first attempt to efficient solving of this type of design problems, especially in the context of explicit antenna size reduction.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

IMPETT, JONATHAN. „Projection and interactivity of musical structures in Mirror-Rite“. Organised Sound 1, Nr. 3 (Dezember 1996): 203–11. http://dx.doi.org/10.1017/s1355771896000283.

Der volle Inhalt der Quelle

Annotation:

Mirror-Rite is a work for ‘meta-trumpet’, computer and live electronics. The composition is neither notated nor stored, but forms itself as a complex of rule-based structures, transformations and processes around the improvisation of a live performer, its source of both energy and material. This article discusses the ways in which these algorithms deal with interactivity and projection in time, and how the handling of these aspects might permit the assembly of algorithmic elements into a complex dynamic whole, sensitive to (and existing solely within) present circumstances, but demonstrating unity between different performances.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Tussupov, D. A. „Isomorphisms and Algorithmic Properties of Structures with Two Equivalences“. Algebra and Logic 55, Nr. 1 (März 2016): 50–57. http://dx.doi.org/10.1007/s10469-016-9375-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Dalvandi, Mohammadsadegh, Michael Butler und Abdolbaghi Rezazadeh. „Derivation of algorithmic control structures in Event-B refinement“. Science of Computer Programming 148 (November 2017): 49–65. http://dx.doi.org/10.1016/j.scico.2017.05.010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Censor, Yair, und Rafiq Mansour. „New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses“. SIAM Journal on Optimization 26, Nr. 1 (Januar 2016): 474–87. http://dx.doi.org/10.1137/141001536.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Koziel, Slawomir, und Adrian Bekasiewicz. „Strategies for computationally feasible multi-objective simulation-driven design of compact RF/microwave components“. Engineering Computations 33, Nr. 1 (07.03.2016): 184–201. http://dx.doi.org/10.1108/ec-03-2015-0067.

Der volle Inhalt der Quelle

Annotation:

Purpose – Strategies for accelerated multi-objective optimization of compact microwave and RF structures are investigated, including the possibility of exploiting surrogate modeling techniques for electromagnetic (EM)-driven design speedup for such components. The paper aims to discuss these issues. Design/methodology/approach – Two algorithmic frameworks are described that are based on fast response surface approximation models, structure decomposition, and Pareto front refinement. Numerical case studies are provided demonstrating feasibility of solving real-world problems involving multi-objective optimization of miniaturized microwave passives and expensive EM-simulation models of such structures. Findings – It is possible, through appropriate combination of the surrogate modeling techniques and response correction methods, to identify the set of alternative designs representing the best possible trade-offs between conflicting design objectives in a realistic time frame corresponding to a few dozen of high-fidelity EM simulations of the respective structures. Research limitations/implications – The present study sets a direction for further studied on expedited optimization of computationally expensive simulation models for miniaturized microwave components. Originality/value – The proposed algorithmic framework proved useful for fast design of microwave structures, which is extremely challenging when using conventional methods. To the authors’ knowledge, this is one of the first attempts to surrogate-assisted multi-objective optimization of compact components at the EM-simulation level.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Navarro, Gonzalo. „Indexing Highly Repetitive String Collections, Part II“. ACM Computing Surveys 54, Nr. 2 (April 2021): 1–32. http://dx.doi.org/10.1145/3432999.

Der volle Inhalt der Quelle

Annotation:

Two decades ago, a breakthrough in indexing string collections made it possible to represent them within their compressed space while at the same time offering indexed search functionalities. As this new technology permeated through applications like bioinformatics, the string collections experienced a growth that outperforms Moore’s Law and challenges our ability of handling them even in compressed form. It turns out, fortunately, that many of these rapidly growing string collections are highly repetitive, so that their information content is orders of magnitude lower than their plain size. The statistical compression methods used for classical collections, however, are blind to this repetitiveness, and therefore a new set of techniques has been developed to properly exploit it. The resulting indexes form a new generation of data structures able to handle the huge repetitive string collections that we are facing. In this survey, formed by two parts, we cover the algorithmic developments that have led to these data structures. In this second part, we describe the fundamental algorithmic ideas and data structures that form the base of all the existing indexes, and the various concrete structures that have been proposed, comparing them both in theoretical and practical aspects, and uncovering some new combinations. We conclude with the current challenges in this fascinating field.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Matzner, Tobias. „The Human Is Dead – Long Live the Algorithm! Human-Algorithmic Ensembles and Liberal Subjectivity“. Theory, Culture & Society 36, Nr. 2 (13.02.2019): 123–44. http://dx.doi.org/10.1177/0263276418818877.

Der volle Inhalt der Quelle

Annotation:

The article analyzes the relation of humans and technology concerning so called ‘intelligent’ or ‘autonomous’ algorithms that are applied in everyday contexts but are far removed from any form of substantial artificial intelligence. In particular, the use of algorithms in surveillance and in architecture is discussed. These examples are structured by a particular combination of continuity and difference between humans and technology. The article provides a detailed analysis of boundary practices that establish continuity and oppositions between humans and information technology, referring to their exemplary depiction in movies. Both strands of boundary practices have the potential to challenge as well as sustain the position of the human as liberal, autonomous subject. Finally, it is shown how the particular combination of continuity and difference that structures the use of algorithms maintains the power of liberal, autonomous subject positions, while the shift of decisions to the algorithms seems to decenter the human.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Khan, Zia, Joshua S. Bloom, Benjamin A. Garcia, Mona Singh und Leonid Kruglyak. „Protein quantification across hundreds of experimental conditions“. Proceedings of the National Academy of Sciences 106, Nr. 37 (26.08.2009): 15544–48. http://dx.doi.org/10.1073/pnas.0904100106.

Der volle Inhalt der Quelle

Annotation:

Quantitative studies of protein abundance rarely span more than a small number of experimental conditions and replicates. In contrast, quantitative studies of transcript abundance often span hundreds of experimental conditions and replicates. This situation exists, in part, because extracting quantitative data from large proteomics datasets is significantly more difficult than reading quantitative data from a gene expression microarray. To address this problem, we introduce two algorithmic advances in the processing of quantitative proteomics data. First, we use space-partitioning data structures to handle the large size of these datasets. Second, we introduce techniques that combine graph-theoretic algorithms with space-partitioning data structures to collect relative protein abundance data across hundreds of experimental conditions and replicates. We validate these algorithmic techniques by analyzing several datasets and computing both internal and external measures of quantification accuracy. We demonstrate the scalability of these techniques by applying them to a large dataset that comprises a total of 472 experimental conditions and replicates.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Silva, Jorge M., Eduardo Pinho, Sérgio Matos und Diogo Pratas. „Statistical Complexity Analysis of Turing Machine tapes with Fixed Algorithmic Complexity Using the Best-Order Markov Model“. Entropy 22, Nr. 1 (16.01.2020): 105. http://dx.doi.org/10.3390/e22010105.

Der volle Inhalt der Quelle

Annotation:

Sources that generate symbolic sequences with algorithmic nature may differ in statistical complexity because they create structures that follow algorithmic schemes, rather than generating symbols from a probabilistic function assuming independence. In the case of Turing machines, this means that machines with the same algorithmic complexity can create tapes with different statistical complexity. In this paper, we use a compression-based approach to measure global and local statistical complexity of specific Turing machine tapes with the same number of states and alphabet. Both measures are estimated using the best-order Markov model. For the global measure, we use the Normalized Compression (NC), while, for the local measures, we define and use normal and dynamic complexity profiles to quantify and localize lower and higher regions of statistical complexity. We assessed the validity of our methodology on synthetic and real genomic data showing that it is tolerant to increasing rates of editions and block permutations. Regarding the analysis of the tapes, we localize patterns of higher statistical complexity in two regions, for a different number of machine states. We show that these patterns are generated by a decrease of the tape’s amplitude, given the setting of small rule cycles. Additionally, we performed a comparison with a measure that uses both algorithmic and statistical approaches (BDM) for analysis of the tapes. Naturally, BDM is efficient given the algorithmic nature of the tapes. However, for a higher number of states, BDM is progressively approximated by our methodology. Finally, we provide a simple algorithm to increase the statistical complexity of a Turing machine tape while retaining the same algorithmic complexity. We supply a publicly available implementation of the algorithm in C++ language under the GPLv3 license. All results can be reproduced in full with scripts provided at the repository.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

D’Emidio, Mattia, und Daniele Frigioni. „Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems”“. Algorithms 12, Nr. 11 (03.11.2019): 229. http://dx.doi.org/10.3390/a12110229.

Der volle Inhalt der Quelle

Annotation:

The purpose of this special issue of Algorithms was to attract papers presenting original research in the area of algorithm engineering. In particular, submissions concerning the design, analysis, implementation, tuning, and experimental evaluation of discrete algorithms and data structures, and/or addressing methodological issues and standards in algorithmic experimentation were encouraged. Papers dealing with advanced models of computing, including memory hierarchies, cloud architectures, and parallel processing were also welcome. In this regard, we solicited contributions from all most prominent areas of applied algorithmic research, which include but are not limited to graphs, databases, computational geometry, big data, networking, combinatorial aspects of scientific computing, and computational problems in the natural sciences or engineering.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Mengay, Adrian. „Digitalization of work and heteronomy“. Capital & Class 44, Nr. 2 (23.02.2020): 273–85. http://dx.doi.org/10.1177/0309816820904032.

Der volle Inhalt der Quelle

Annotation:

Digitalization has two very different effects on work. On the one hand, it leads to a re-Taylorization of work, de-qualification and a loss of workers autonomy. On the other hand, digitalization of work leads to new forms of indirect control and algorithmic control that can be used to manage and instrumentalize the supposed autonomy of workers to actually enable an unequal and exploitative labour process. This article discusses the questions of heteronomy related to the digitalization of work, presents central aspects of new forms of control (direct, indirect, and algorithmic) and explains why formalization, data centred decision making and flexible structures are used to control the labour process and improve heteronomy of work.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

L., Berezko, und Sokolov S. „ALGORITHMIC APPROACH TO DESIGN NEW MEDICAL EQUIPMENT“. Computer systems and network 2, Nr. 1 (23.03.2017): 6–12. http://dx.doi.org/10.23939/csn2020.01.006.

Der volle Inhalt der Quelle

Annotation:

The article investigates the possibility of algorithmic design of complex electronic medical equipment. Such equipment is considered as an element of the biotechnical system, which is a separate variant of the cyber-physical system. A biotech system is a complex that includes a biological object, electronic medical equipment, and a potential user. The design of electronic medical equipment is complex and depends on the characteristics of the biotechnical system. Each new development requires an individual approach, but the analysis of possible generalized structures of biotechnical systems and features of their elements makes it possible to systematize the sequence of operations necessary for their creation and to propose a design algorithm that allows to obtain the desired result. An example of using an algorithmic approach in the design of electroimpedance medical equipment is considered. The obtained results can be used in the design of biotechnical systems for therapeutic purposes. Key words: cyberphysical systems, biotechnical systems, design.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Dzwierzynska, Jolanta. „Shaping of Curvilinear Steel Bar Structures for Variable Environmental Conditions Using Genetic Algorithms—Moving towards Sustainability“. Materials 14, Nr. 5 (02.03.2021): 1167. http://dx.doi.org/10.3390/ma14051167.

Der volle Inhalt der Quelle

Annotation:

The successful and effective shaping of curvilinear steel bar structures is becoming an increasingly complex and difficult task, due to the growing demands to satisfy both economic and environmental requirements. However, computer software for algorithmic-aided design makes it possible to take into account many aspects affecting structures, as early as the initial design stage. In this context, the paper presents an optimization method for shaping the curvilinear steel bar canopies of hyperbolic paraboloid and cylindroid shapes, in order to obtain effective structures adapted to external environmental conditions. The best structural solutions in terms of the structure’s shape, topology and support positions are obtained as the effects of multi-criteria optimizations with the application of genetic algorithms. The following are used as the optimization criteria: minimal structure mass and minimal deflections of the structure’s members, as well as their maximal utilization. Additionally, the best canopy locations in relation to the sides of the world are determined through analyzing their shadow casts for various locations, so the structures have the least impact on the surroundings. This research, with its interdisciplinary character, aims to present the possibility of applying generative shaping tools to obtain structurally effective and environment-adaptive curvilinear steel bar structures in the first phase of their design, which can support sustainable designing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Ceballos, Manuel, Juan Núñez und Ángel F. Tenorio. „Algorithmic method to obtain combinatorial structures associated with Leibniz algebras“. Mathematics and Computers in Simulation 125 (Juli 2016): 126–38. http://dx.doi.org/10.1016/j.matcom.2014.11.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Arkin, Esther M., Sándor P. Fekete und Joseph S. B. Mitchell. „An algorithmic study of manufacturing paperclips and other folded structures“. Computational Geometry 25, Nr. 1-2 (Mai 2003): 117–38. http://dx.doi.org/10.1016/s0925-7721(02)00133-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Schoenenberger, Lukas, Alexander Schmid und Markus Schwaninger. „Towards the algorithmic detection of archetypal structures in system dynamics“. System Dynamics Review 31, Nr. 1-2 (Januar 2015): 66–85. http://dx.doi.org/10.1002/sdr.1526.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Dobrynina, Irina Vasiljevna. „On algorithmic problems in generalized tree structures of Coxeter groups“. Chebyshevskii sbornik 19, Nr. 2 (2018): 477–90. http://dx.doi.org/10.22405/2226-8383-2018-19-2-477-490.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Reddy, Elizabeth, Baki Cakici und Andrea Ballestero. „Beyond mystery: Putting algorithmic accountability in context“. Big Data & Society 6, Nr. 1 (Januar 2019): 205395171982685. http://dx.doi.org/10.1177/2053951719826856.

Der volle Inhalt der Quelle

Annotation:

Critical algorithm scholarship has demonstrated the difficulties of attributing accountability for the actions and effects of algorithmic systems. In this commentary, we argue that we cannot stop at denouncing the lack of accountability for algorithms and their effects but must engage the broader systems and distributed agencies that algorithmic systems exist within; including standards, regulations, technologies, and social relations. To this end, we explore accountability in “the Generated Detective,” an algorithmically generated comic. Taking up the mantle of detectives ourselves, we investigate accountability in relation to this piece of experimental fiction. We problematize efforts to effect accountability through transparency by undertaking a simple operation: asking for permission to re-publish a set of the algorithmically selected and modified words and images which make the frames of the comic. Recounting this process, we demonstrate slippage between the “complication” of the algorithm and the obscurity of the legal and institutional structures in which it exists.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Mohammed, Ο. Μ., und Α. Ζ. Μ. Shammari. „A Procedural Algorithmic Approach for Functional Structure Construction“. Engineering, Technology & Applied Science Research 11, Nr. 1 (06.02.2021): 6819–32. http://dx.doi.org/10.48084/etasr.4012.

Der volle Inhalt der Quelle

Annotation:

Despite the advances in functional structure modeling, the underlying models are lacking formalism and a consistent basis for successive reasoning. Many researchers have worked on functional structures and in standardizing their vocabulary while some undertook the task of benchmarking the process of creating it, although the effects of functional structure modeling methods and strategies on further stages of conceptual design during concept generation have not been discussed in depth. In the present research, a new procedural algorithmic approach for the functional structure is developed and demonstrated.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Schwen, Lars Ole, und Tobias Preusser. „Analysis and Algorithmic Generation of Hepatic Vascular Systems“. International Journal of Hepatology 2012 (2012): 1–17. http://dx.doi.org/10.1155/2012/357687.

Der volle Inhalt der Quelle

Annotation:

A proper geometric model of the vascular systems in the liver is crucial for modeling blood flow, the connection between the organ and the rest of the organism. In vivo imaging does not provide sufficient details, so an algorithmic concept for extending measured vascular tree data is needed such that geometrically realistic structures can be generated. We develop a quantification of similarity in terms of different geometric features. This involves topological Strahler ordering of the vascular trees, statistical testing, and averaging. Invariant features are identified in human clinical in vivo CT scans. Results of the existing “Constrained Constructive Optimization” algorithm are compared to real vascular tree data. To improve bifurcation angles in the algorithmic results, we implement a postprocessing step calibrated to the measured features. This framework is finally applied to generate realistic additional details in a patient-specific hepatic vascular tree data set.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Lu, Baile, Shuai Hao, Michael Pinedo und Yuqian Xu. „Frontiers in Service Science: Fintech Operations—An Overview of Recent Developments and Future Research Directions“. Service Science 13, Nr. 1 (März 2021): 19–35. http://dx.doi.org/10.1287/serv.2021.0270.

Der volle Inhalt der Quelle

Annotation:

In this paper, we provide a survey of recent developments in the fintech (financial technology) industry, focusing on the operational structures, the technologies involved, and the operational risks associated with the new systems. In particular, we discuss payment systems, algorithmic trading, robo-advisory, crowdfunding, and peer-to-peer lending. In the conclusion section, we discuss various promising research directions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Tushaj, Ersilio, Niko Lako und Fatjon Saliu. „Optimal Design of Grillage Structures with Steel Crossed Beams using Genetic Algorithms“. International Journal of Business & Technology 6, Nr. 3 (01.05.2018): 1–6. http://dx.doi.org/10.33107/ijbte.2018.6.3.16.

Der volle Inhalt der Quelle

Annotation:

The optimal problem in the structural design is an important issue in the engineering design. Various authors have analyzed the optimization of steel structures using algorithmic approaches. These techniques are generally grouped in deterministic or meta-heuristic techniques. From the introduction of structural optimization in the 1960’ up to now, various methods have been proposed. A genetic algorithm, is built and applied in this study using MatLab soft R2017a to a crossed beams system. The structural analysis is done with the direct stiffness method with constraints verification based on EuroCode 3:2005 criteria. Results are reported in the study.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!