Relevant bibliographies by topics / Modified systems of algorithmic algebras

Contents

  1. Journal articles
  2. Book chapters
  3. Conference papers

Academic literature on the topic 'Modified systems of algorithmic algebras'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 July 2025

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 'Modified systems of algorithmic algebras.'

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 "Modified systems of algorithmic algebras"

1

Potebnia, Artem, and Sergiy Pogorilyi. "Formation and investigation of Kruskal’s algorithm parallel scheme for shared memory systems." Informatics, Cybernetics and Computer Science. Scientific Papers of Donetsk National Technical University 16(204) (March 23, 2012): 82–89. https://doi.org/10.5281/zenodo.16440.

Full text
Abstract:
Formalization of Kruskal’s algorithm for constructing a minimal spanning tree of an undirected graph using mathematical means of V.M. Glushkov’s algorithmic algebras modified systems is done. The conception of its paralleling for shared memory computer systems architectures is proposed. A set of algorithm investigations is conducted and its temporal characteristics are formed. Recommendations of algorithm usage for applied tasks solving are provided.
APA, Harvard, Vancouver, ISO, and other styles
2

Pogorilyy, S. D., and M. S. Slynko. "Research and development of Johnson's algorithm parallel schemes in GPGPU technology." PROBLEMS IN PROGRAMMING, no. 2-3 (June 2016): 105–12. http://dx.doi.org/10.15407/pp2016.02-03.105.

Full text
Abstract:
Johnson’s all pairs shortest path algorithm application in an edge weighted, directed graph is considered. Its formalization in terms of Glushkov’s modified systems of algorithmic algebras was made. The expediency of using GPGPU technology to accelerate the algorithm is proved. A number of schemas of parallel algorithm optimized for using in GPGPU were obtained. Suggested approach to the implementation of the schemes obtained using computing architecture NVIDIA CUDA. An experimental study of improved performance by using GPU for computations was made.
APA, Harvard, Vancouver, ISO, and other styles
3

Ovsiak, Oleksandr, and Ihor Okonchenko. "Methods of Ordering in Computer Sciences and Information Technologies." Digital Platform: Information Technologies in Sociocultural Sphere 5, no. 1 (2022): 56–66. https://doi.org/10.31866/2617-796X.5.1.2022.261288.

Full text
Abstract:
The purpose of the article is to analyze the known methods of ordering in computer science. The research methodology consists of methods of ordered pairs, relations, Gödel numbering, and Glushkov’s system of algorithmic algebras. The scientific novelty is to create a method of both description and transformation of orders. Conclusions. In the methods of ordered pairs, relations, Gödel numbering, mathematical logic, Post and Turing machines, and the modified system of Glushkov’s algorithmic algebras there is no possibility of equivalent transformations
APA, Harvard, Vancouver, ISO, and other styles
4

Yushchenko, E. L., and G. E. Tseitlin. "Issues of algorithmics and glushkov’s systems of algorithmic algebras." Cybernetics and Systems Analysis 34, no. 4 (1998): 532–39. http://dx.doi.org/10.1007/bf02666997.

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

ZÁDORI, LÁSZLÓ. "SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS." International Journal of Algebra and Computation 17, no. 04 (2007): 821–35. http://dx.doi.org/10.1142/s0218196707003809.

Full text
Abstract:
We study the algorithmic complexity of determining whether a system of polynomial equations over a finite algebra admits a solution. We prove that the problem has a dichotomy in the class of finite groupoids with an identity element. By developing the underlying idea further, we present a dichotomy theorem in the class of finite algebras that admit a non-trivial idempotent Maltsev condition. This is a substantial extension of most of the earlier results on the topic.
APA, Harvard, Vancouver, ISO, and other styles
6

Koprowski, Przemysław. "Computing Square Roots in Quaternion Algebras." Fundamenta Informaticae 190, no. 1 (2023): 1–15. http://dx.doi.org/10.3233/fi-222163.

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

Ivanov, Ievgen, Artur Korniłowicz, and Mykola Nikitchenko. "On Algebras of Algorithms and Specifications over Uninterpreted Data." Formalized Mathematics 26, no. 2 (2018): 141–47. http://dx.doi.org/10.2478/forma-2018-0011.

Full text
Abstract:
Summary This paper continues formalization in Mizar [2, 1] of basic notions of the composition-nominative approach to program semantics [13] which was started in [8, 11]. The composition-nominative approach studies mathematical models of computer programs and data on various levels of abstraction and generality and provides tools for reasoning about their properties. Besides formalization of semantics of programs, certain elements of the composition-nominative approach were applied to abstract systems in a mathematical systems theory [4, 6, 7, 5, 3]. In the paper we introduce a definition of t
APA, Harvard, Vancouver, ISO, and other styles
8

BURNEL, A., H. CAPRASSE, and A. DRESSE. "COMPUTING THE BRST OPERATOR USED IN QUANTIZATION OF GAUGE THEORIES." International Journal of Modern Physics C 05, no. 06 (1994): 1035–47. http://dx.doi.org/10.1142/s0129183194001136.

Full text
Abstract:
It is shown that for a large class of non-holonomic quantum mechanical systems one can make the computation of BRST charge fully algorithmic. Two computer algebra programs written in the language of REDUCE are described. They are able to realize the complex calculations needed to determine the charge for general nonlinear algebras. Some interesting specific solutions are discussed.
APA, Harvard, Vancouver, ISO, and other styles
9

Dowbor, Piotr, and Yan Kim. "Computational Classification of Tubular Algebras." Fundamenta Informaticae 177, no. 1 (2020): 39–67. http://dx.doi.org/10.3233/fi-2020-1979.

Full text
Abstract:
The effective method (based on Theorem 5.3) of classifying tubular algebras by the Cartan matrices of tilting sheaves over weighted projective lines with all indecomposable direct summands in some finite “fundamental domain” , by the reduction to the two elementary problems of discrete mathematics having algorithmic solutions is presented in details (see Problem A and B). The software package CART_TUB being an implementation of this method yields the precise classification of all up to isomorphism tubular algebras of a fixed tubular type p, by creating the complete lists of their Cartan matric
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
Abstract:
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 invest
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Modified systems of algorithmic algebras"

1

Burrage, Kevin. "Parallel Linear Algebra." In Parallel and Sequential Methods for Ordinary Differential Equations. Oxford University PressOxford, 1995. http://dx.doi.org/10.1093/oso/9780198534327.003.0004.

Full text
Abstract:
Abstract Perhaps one of the most crucial aspects in the development of parallel numerical methods for the solution of both initial value and boundary value problems is the incorporation of efficient parallel linear solution algorithms. These linear algebra aspects arise at the most fundamental of levels, when performing matrix-vector or matrix-matrix computations. They also arise when implicit methods are implemented, because the ensuing nonlinear equations are usually solved by a modified Newton technique which results in systems of linear equations. Thus a thorough understanding of the many
APA, Harvard, Vancouver, ISO, and other styles
2

"Analysis of Defeasible Reasoning." In N-ary Relations for Logical Analysis of Data and Knowledge. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2782-4.ch004.

Full text
Abstract:
This chapter describes implementation of abductive and modified conclusions by means of NTA. The algorithm and rules to form hypotheses for abductive conclusions are proposed. They can be applied not only to NTA objects expressing formulas of propositional calculus, but also to a more general case when attribute domains contain more than two values. Within a specific knowledge system, choosing variables and their values depends on criteria determined by the content of the system. The techniques that we developed simplify generating abductive conclusions for given limitations, for instance, in
APA, Harvard, Vancouver, ISO, and other styles
3

Chiarella, Mauro, and Matias Dalla Costa. "Dynamic Generative Systems." In Advances in Media, Entertainment, and the Arts. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3993-3.ch006.

Full text
Abstract:
This chapter describes that in recent decades, international architecture has used complex geometric systems and experimented widely with building form in an attempt to integrate new concepts and technological tools into spatial exploration. These design processes put forward non-linear multiplicity as an alternative to traditional design methods. The forms and spaces conceived arise out of design approaches whose results are more characteristic of the process itself than of the adoption of compositional categories (order, type, element) or functional-rational categories (system, typology, str
APA, Harvard, Vancouver, ISO, and other styles
4

Abdulelah Ahmed, Ahmed, Azura Che Soh, Mohd Khair Hassan, Samsul Bahari Mohd Noor, and Hafiz Rashidi Harun. "Simulated Real-Time Controller for Tuning Algorithm Using Modified Hill Climbing Approach Based on Model Reference Adaptive Control System." In Deterministic Artificial Intelligence. IntechOpen, 2020. http://dx.doi.org/10.5772/intechopen.88230.

Full text
Abstract:
In this chapter, an intelligent algorithmic tuning technique suitable for real-time system tuning based on hill climbing optimization algorithm and model reference adaptive control (MRAC) system technique is proposed. Although many adaptive control tuning methodologies depend partially or completely on online plant system identification, the proposed method uses only the model that is used to design the original controller, leading to simplified calculations that do not require neither high processing power nor long processing time, as opposed to identification technique calculations. Addition
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Modified systems of algorithmic algebras"

1

Naderi, Mohammad H., and Jose Silva-Martinez. "Algorithmic-pipelined ADC with a modified residue curve for better linearity." In 2017 IEEE 60th International Midwest Symposium on Circuits and Systems (MWSCAS). IEEE, 2017. http://dx.doi.org/10.1109/mwscas.2017.8053205.

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

Jenkins, W. K., C. Radhakrishnan, and D. Sova. "Special properties of the modified DFT to achieve algorithmic fault tolerance in Adaptive Filters." In 2013 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 2013. http://dx.doi.org/10.1109/iscas.2013.6571896.

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

Kale, Vaibhav, Vikram Bapat, and Bernie Bettig. "Geometric Constraint Solving With Solution Selectors." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-50113.

Full text
Abstract:
Current parametric CAD systems are based on solving equality type of constraints between geometric objects and parameters. This includes algebraic equations constraining the values of variables, and geometric constraints, constraining the positions of geometric objects. However, to truly represent design intent, next-generation CAD systems must also allow users to input other types of constraints such as inequality constraints. Inequality constraints are expressed as inequality expressions on variables or as geometric constraints that force geometric objects to be on specific sides or have spe
APA, Harvard, Vancouver, ISO, and other styles
4

Serban, Radu, and Edward J. Haug. "Globally Independent Coordinates for Real-Time Vehicle System Simulation." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/dac-5587.

Full text
Abstract:
Abstract Models of the dynamics of multibody systems generally result in a set of differential–algebraic equations (DAE). State–space methods for solving the DAE of motion are based on reduction of the DAE to ordinary differential equations (ODE), by means of local parameterizations of the constraint manifold that must be often modified during a simulation. In this paper it is shown that, for vehicle multibody systems, generalized coordinates that are dual to suspension and/or control forces in the model are independent for the entire range of motion of the system. In addition to the immediate
APA, Harvard, Vancouver, ISO, and other styles
5

Mangani, Luca, Marwan Darwish, and Fadl Moukalled. "Development of a Pressure-Based Coupled CFD Solver for Turbulent and Compressible Flows in Turbomachinery Applications." In ASME Turbo Expo 2014: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/gt2014-25967.

Full text
Abstract:
In this paper we present a fully coupled algorithm for the resolution of compressible flows at all speed. The pressure-velocity coupling at the heart of the Navier Stokes equations is accomplished by deriving a pressure equation in similar fashion to what is done in the segregated SIMPLE algorithm except that the influence of the velocity fields is treated implicitly. In a similar way, the assembly of the momentum equations is modified to treat the pressure gradient implicitly. The resulting extended system of equations, now formed of matrix coefficients that couples the momentum and pressure
APA, Harvard, Vancouver, ISO, and other styles
6

Gercekovich, D. A., O. Yu Basharina, I. S. Shilnikova, E. Yu Gorbachevskaya, and S. A. Gorsky. "Information and algorithmic support of a multi-level integrated system for the investment strategies formation." In 3rd International Workshop on Information, Computation, and Control Systems for Distributed Environments 2021. Crossref, 2021. http://dx.doi.org/10.47350/iccs-de.2021.06.

Full text
Abstract:
The article summarizes the accumulated practical experience of the authors in the development of algorithms for the formation of investment strategies. For this purpose, the optimization of the studied parameters, information support of investment activities, verification, monitoring and adjustment in the testing mode and the subsequent practical application of the described tools are considered. The system is based on the main provisions of the Markowitz portfolio theory. The analytical block of the Information System Portfolio Investor includes Profitability-Risk model; empirical models of o
APA, Harvard, Vancouver, ISO, and other styles
7

Borodzhieva, Adriana. "MS EXCEL-BASED APPLICATION FOR ENCRYPTION AND DECRYPTION USING THE HILL CIPHER ON THE BASIS OF 2X2-MATRIX AND 64-SYMBOL ALPHABET." In eLSE 2017. Carol I National Defence University Publishing House, 2017. http://dx.doi.org/10.12753/2066-026x-17-049.

Full text
Abstract:
In classical cryptography, the Hill cipher, invented by Lester Hill in 1929, was the first polygraphic substitution cipher based on linear algebra, which practically processed more than three symbols at once. In the classical Hill cipher, each letter is represented by a number modulo 26. To encrypt a message, each block of n letters (considered as an n-component vector) is multiplied by an invertible matrix of size n×n, again modulus 26. In order to decrypt the message, each block is multiplied by the inverse matrix of the matrix used for encryption. In the paper a modified algorithm for encry
APA, Harvard, Vancouver, ISO, and other styles
8

Baqai, Aamer, and Arsalan Shafiq. "Dimensional Analysis of the Generated Design Solutions for Reconfigurable Manufacturing System." In ASME 2013 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/imece2013-64406.

Full text
Abstract:
Reconfigurable Manufacturing Systems (RMS) is the recent addition in the series of different of types manufacturing systems. Various approaches deal with generation of design solutions for such systems. In this paper two and three dimensional tolerance analysis of the generated design solutions using algorithmic approach for reconfigurable manufacturing systems is carried out. In this analysis quality is considered as the key performance indicator. Among the existing techniques and methods used for tolerance evaluation, the approach of representing the tolerances as Small Displacement Torsors
APA, Harvard, Vancouver, ISO, and other styles
9

Maenza, Sara, Andrea Mattioli, and Fabio Paternò. "An Approach to Explainable Automations in Daily Environments." In Intelligent Human Systems Integration (IHSI 2024) Integrating People and Intelligent Systems. AHFE International, 2024. http://dx.doi.org/10.54941/ahfe1004515.

Full text
Abstract:
The main current technological trends are the Internet of Things and Artificial Intelligence. Indeed, current forecasts indicate that while the number of general purpose devices (e.g. smartphones, laptops) is slightly increasing, the number of connected objects (objects of our everyday life) is increasing in an almost exponential way. Thus, such technologies together with AI algorithms based on large data sets and statistical predictions are able to generate automations that can take place in the various places where we live (e.g. stores, older adults residences, industrial sites, smart homes)
APA, Harvard, Vancouver, ISO, and other styles
10

Singh, Ajit, and Reza Baghaei Lakeh. "Thermal Energy Storage Conceptual Design Using Reclaimed Minerals As Heat Storage Material." In ASME 2024 18th International Conference on Energy Sustainability collocated with the ASME 2024 Heat Transfer Summer Conference and the ASME 2024 Fluids Engineering Division Summer Meeting. American Society of Mechanical Engineers, 2024. http://dx.doi.org/10.1115/es2024-131375.

Full text
Abstract:
Abstract Thermal energy storage (TES) plays a crucial role in energy sustainability, enabling the efficient storage and utilization of thermal energy from various sources. In this paper, we propose a novel TES system that utilizes reclaimed minerals as the heat storage medium. The system comprises a tightly packed bed of processed minerals enclosing a circular pathway for heat transfer fluid (HTF). To achieve optimal performance, we develop a computational method and algorithm to estimate the required pipe length for efficient charge and discharge cycles. The analysis encompasses various facto
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Modified systems of algorithmic algebras' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography