Log in

Relevant bibliographies by topics / Modified systems of algorithmic algebras / Journal articles

To see the other types of publications on this topic, follow the link: Modified systems of algorithmic algebras.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Bergami, Giacomo, Samuel Appleby, and Graham Morgan. "Quickening Data-Aware Conformance Checking through Temporal Algebras." Information 14, no. 3 (2023): 173. http://dx.doi.org/10.3390/info14030173.

Full text

Abstract:

A temporal model describes processes as a sequence of observable events characterised by distinguishable actions in time. Conformance checking allows these models to determine whether any sequence of temporally ordered and fully-observable events complies with their prescriptions. The latter aspect leads to Explainable and Trustworthy AI, as we can immediately assess the flaws in the recorded behaviours while suggesting any possible way to amend the wrongdoings. Recent findings on conformance checking and temporal learning lead to an interest in temporal models beyond the usual business proces

APA, Harvard, Vancouver, ISO, and other styles

12

Senturk, Ibrahim, Tahsin Oner, Duygu Selin Turan, Gozde Nur Gurbuz, and Burak Ordin. "Axiomatic analysis of state operators in Sheffer stroke BCK-algebras associated with algorithmic approaches." AIMS Mathematics 10, no. 1 (2025): 1555–88. https://doi.org/10.3934/math.2025072.

Full text

Abstract:

<p>In this paper, we have presented a novel exploration of the construction of Riečan, Bosbach, internal, and general states within the framework of Sheffer stroke BCK-algebra $ \mathcal{B} $. We highlighted the originality of our work by examining key characteristics and the independence of the axiomatic systems associated with these states. Notably, we demonstrated that a Riečan state can correspond to a Bosbach state and vice versa, revealing significant interconnections between these concepts. Additionally, we introduced the innovative concepts of faithful and fixed sets generated by

APA, Harvard, Vancouver, ISO, and other styles

13

Dean, Andrew J. "Classification of AF Flows." Canadian Mathematical Bulletin 46, no. 2 (2003): 164–77. http://dx.doi.org/10.4153/cmb-2003-018-0.

Full text

Abstract:

AbstractAn AF flow is a one-parameter automorphism group of an AF C*-algebra A such that there exists an increasing sequence of invariant finite dimensional sub-C*-algebras whose union is dense in A. In this paper, a classification of C*-dynamical systems of this form up to equivariant isomorphism is presented. Two pictures of the actions are given, one in terms of a modified Bratteli diagram/pathspace construction, and one in terms of a modified K0 functor.

APA, Harvard, Vancouver, ISO, and other styles

14

A, Doroshenko, Sinitsyn I, Shevchenko V, Yatsenko O, and Achour I. "Integration of the methods of algebra of algorithms and computational intelligence for automation of program systems design." Artificial Intelligence 28, AI.2023.28(2)) (2023): 66–75. http://dx.doi.org/10.15407/jai2023.02.066.

Full text

Abstract:

An approach to the creation of intelligent systems is considered, which combines the ideas of Glushkov’s algebra of algorithms with the well-known neuroevolutionary algorithms of computational intelligence, which can be used to automate the design and synthesis of programs. The method of neuroevolution of augmenting topologies is intended to reduce the dimensionality of the space for searching for neural network parameters in the form of gradual development of its structure in the process of evolution. A software toolkit has been developed to support the approach, which is based on the constru

APA, Harvard, Vancouver, ISO, and other styles

15

Tsyganov, Andrey, and Julia Tsyganova. "Algorithmic Differentiation of the MWGS-Based Arrays for Computing the Information Matrix Sensitivity Equations within the Problem of Parameter Identification." Mathematics 10, no. 1 (2022): 126. http://dx.doi.org/10.3390/math10010126.

Full text

Abstract:

The paper considers the problem of algorithmic differentiation of information matrix difference equations for calculating the information matrix derivatives in the information Kalman filter. The equations are presented in the form of a matrix MWGS (modified weighted Gram–Schmidt) transformation. The solution is based on the usage of special methods for the algorithmic differentiation of matrix MWGS transformation of two types: forward (MWGS-LD) and backward (MWGS-UD). The main result of the work is a new MWGS-based array algorithm for computing the information matrix sensitivity equations. The

APA, Harvard, Vancouver, ISO, and other styles

16

ZHANG, YUFENG, HONWAH TAM, and WEI JIANG. "TWO ENLARGED LOOP ALGEBRAS FOR OBTAINING NEW INTEGRABLE HIERARCHIES." International Journal of Modern Physics B 25, no. 19 (2011): 2637–56. http://dx.doi.org/10.1142/s0217979211100904.

Full text

Abstract:

Taking a loop algebra [Formula: see text] we obtain an integrable soliton hierarchy which is similar to the well-known Kaup–Newell (KN) hierarchy, but it is not. We call it a modified KN (mKN) hierarchy. Then two new enlarged loop algebras of the loop algebra [Formula: see text] are established, respectively, which are used to establish isospectral problems. Thus, two various types of integrable soliton-equation hierarchies along with multi-component potential functions are obtained. Their Hamiltonian structures are also obtained by the variational identity. The second hierarchy is integrable

APA, Harvard, Vancouver, ISO, and other styles

17

Kitov, V. A. "PIONEER OF INFORMATION SCIENCE AND CYBERNETICS <i>ON THE 100TH ANNIVERSARY OF THE BIRTH OF ACADEMICIAN V.M. GLUSHKOV</i>." Вестник Российской академии наук 93, no. 10 (2023): 996–1005. http://dx.doi.org/10.31857/s0869587323100079.

Full text

Abstract:

The article is devoted to the life and work of the outstanding Soviet scientist, pioneer of informatics and cybernetics, initiator of the development of a nationwide automated management information system, Academician of the Academy of Sciences of the USSR Viktor Mikhailovich Glushkov (1923–1982). The author tells about the main stages of his biography, focusing on the scientific achievements: the solution of the fifth generalized Hilbert problem, the creation of the USSR’s largest Institute of Cybernetics of the Academy of Sciences of the Ukrainian SSR, the development of the theory of digit

APA, Harvard, Vancouver, ISO, and other styles

18

Aribowo, Widi, Bambang Suprianto, and Aditya Prapanca. "A novel modified dandelion optimizer with application in power system stabilizer." IAES International Journal of Artificial Intelligence (IJ-AI) 12, no. 4 (2023): 2033. http://dx.doi.org/10.11591/ijai.v12.i4.pp2033-2041.

Full text

Abstract:

<p>This article presents a newly developed modification of the dandelion optimizer (DO). The proposed method is a chaotic algorithmic integrity and modification of the original dandelion optimizer. Dandelion is one of the plants that rely on wind for seed propagation. This article presents the tuning of the power system stabilizer with the method proposed in a case study of a single machine system. The validation of the proposed method uses the benchmark function and performance on a single engine system against transient response. The method used as a comparison in this article is the w

APA, Harvard, Vancouver, ISO, and other styles

19

Chen, Danhe, K. A. Neusypin, Xiang Zhang, and Chuangge Wang. "The Advanced Algorithmic Method for Navigation System Correction of Spacecraft." Mathematical Problems in Engineering 2019 (July 15, 2019): 1–12. http://dx.doi.org/10.1155/2019/8681418.

Full text

Abstract:

In this paper an advanced method for the navigation system correction of a spacecraft using an error prediction model of the system is proposed. Measuring complexes have been applied to determine the parameters of a spacecraft and the processing of signals from multiple measurement systems is carried out. Under the condition of interference in flight, when the signals of external system (such as GPS) disappear, the correction of navigation system in autonomous mode is considered to be performed using an error prediction model. A modified Volterra neural network based on the self-organization a

APA, Harvard, Vancouver, ISO, and other styles

20

Warveen, Merza Eido, and Sedqi Kareem Omer. "Face Detection in the Wild: Techniques, Applications, and Future Directions." Engineering and Technology Journal 10, no. 05 (2025): 4943–59. https://doi.org/10.5281/zenodo.15388056.

Full text

Abstract:

Face detection is fundamental to computer vision, allowing for applications in human-computer interaction, healthcare, surveillance, and authentication.  Deep learning-based frameworks have recently replaced traditional handcrafted models, providing excellent accuracy, real-time performance, and robustness in a variety of scenarios, including poor lighting and occlusion.  The use of face detection in embedded and edge devices has increased because to lightweight models and mobile-optimized systems.  The detection of small or modified faces, maintaining demographic fairness, and

APA, Harvard, Vancouver, ISO, and other styles

21

Hakkarainen, J., A. Ilin, A. Solonen, et al. "On closure parameter estimation in chaotic systems." Nonlinear Processes in Geophysics 19, no. 1 (2012): 127–43. http://dx.doi.org/10.5194/npg-19-127-2012.

Full text

Abstract:

Abstract. Many dynamical models, such as numerical weather prediction and climate models, contain so called closure parameters. These parameters usually appear in physical parameterizations of sub-grid scale processes, and they act as "tuning handles" of the models. Currently, the values of these parameters are specified mostly manually, but the increasing complexity of the models calls for more algorithmic ways to perform the tuning. Traditionally, parameters of dynamical systems are estimated by directly comparing the model simulations to observed data using, for instance, a least squares ap

APA, Harvard, Vancouver, ISO, and other styles

22

Geng, Hui. "Modified A* algorithm for path smoothing and obstacle avoidance." Applied and Computational Engineering 33, no. 1 (2024): 167–75. http://dx.doi.org/10.54254/2755-2721/33/20230262.

Full text

Abstract:

With the rapid development of robotics technology, path planning is a crucial aspect of autonomous robot systems. Among them, planning paths involves using the A* algorithm, which is a common method. However, traditional A* algorithm has several limitations in path planning, such as poor real-time performance, large amount of computation per node, long computation time, low algorithmic search efficiency. Based on this, two improved approaches for the A* algorithm are proposed. The first is expanding the obstacles in the map by increasing their expansion radius. The second is the Hybrid A* algo

APA, Harvard, Vancouver, ISO, and other styles

23

GRIMM, U., and V. RITTENBERG. "THE MODIFIED XXZ HEISENBERG CHAIN: CONFORMAL INVARIANCE, SURFACE EXPONENTS OF c<1 SYSTEMS AND HIDDEN SYMMETRIES OF FINITE CHAINS." International Journal of Modern Physics B 04, no. 05 (1990): 969–78. http://dx.doi.org/10.1142/s0217979290000474.

Full text

Abstract:

The spin-1/2 XXZ Heisenberg chain with two types of boundary terms is considered. For the first type, the Hamiltonian is hermitian but not for the second type which includes the Uq[SU(2)] symmetric case. It is shown that for a certain “tuning” between the anisotropy angle and the boundary terms the spectra present unexpected degeneracies. These degeneracies are related to the structure of the irreducible representations of the Virasoro algebras for c<1.

APA, Harvard, Vancouver, ISO, and other styles

24

Mashkov, Andrey V. "Development of software for information-measuring Systems for frequency analysis of binary-quantized Signals." Vestnik of Samara State Technical University. Technical Sciences Series 31, no. 3 (2024): 69–82. http://dx.doi.org/10.14498/tech.2023.3.5.

Full text

Abstract:

The article discusses the methodology and design template for a complex of structurally, functionally, informationally and metrologically compatible software modules that implement algorithms for calculating estimates of the PSD power spectral density based on binary-signed analog-stochastic quantization with reduced multiplicative complexity. Algorithmic support makes it possible to calculate PSD estimates by the method of averaged modified periodograms and by the correlogram method using time correlation windows based on a discrete-event representation of the results of binary-sign analog-st

APA, Harvard, Vancouver, ISO, and other styles

25

Bolaji, Asaju La’aro, Friday Zinzendoff Okwonu, Peter Bamidele Shola, Babatunde Sulaiman Balogun, and Obinna Damian Adubisi. "A Modified Binary Pigeon-Inspired Algorithm for Solving the Multi-dimensional Knapsack Problem." Journal of Intelligent Systems 30, no. 1 (2020): 90–103. http://dx.doi.org/10.1515/jisys-2018-0450.

Full text

Abstract:

AbstractThe pigeon-inspired optimization algorithm is a category of a newly proposed swarm intelligence-based algorithm that belongs to the population-based solution technique. The MKP is a class of complex optimization problems that have many practical applications in the fields of engineering and sciences. Due to the practical applications of MKP, numerous algorithmic-based methods like local search and population-based search algorithms have been proposed to solve the MKP in the past few decades. This paper proposes a modified binary pigeon-inspired optimization algorithm named (Modified-BP

APA, Harvard, Vancouver, ISO, and other styles

26

Ernst, Thomas. "On the q-exponential of matrix q-Lie algebras." Special Matrices 5, no. 1 (2017): 36–50. http://dx.doi.org/10.1515/spma-2017-0003.

Full text

Abstract:

Abstract In this paper, we define several new concepts in the borderline between linear algebra, Lie groups and q-calculus.We first introduce the ring epimorphism r, the set of all inversions of the basis q, and then the important q-determinant and corresponding q-scalar products from an earlier paper. Then we discuss matrix q-Lie algebras with a modified q-addition, and compute the matrix q-exponential to form the corresponding n × n matrix, a so-called q-Lie group, or manifold, usually with q-determinant 1. The corresponding matrix multiplication is twisted under τ, which makes it possible t

APA, Harvard, Vancouver, ISO, and other styles

27

Mucuk, Osman, and Hüseyin Çakallı. "G-connectedness in topological groups with operations." Filomat 32, no. 3 (2018): 1079–89. http://dx.doi.org/10.2298/fil1803079m.

Full text

Abstract:

It is a well known fact that for a Hausdorff topological group X, the limits of convergent sequences in X define a function denoted by lim from the set of all convergent sequences in X to X. This notion has been modified by Connor and Grosse-Erdmann for real functions by replacing lim with an arbitrary linear functional G defined on a linear subspace of the vector space of all real sequences. Recently some authors have extended the concept to the topological group setting and introduced the concepts of G-continuity, G-compactness and G-connectedness. In this paper we present some results about

APA, Harvard, Vancouver, ISO, and other styles

28

Васюков, Владимир Леонидович. "Quantum categories for quantum logic." Logical Investigations 25, no. 1 (2019): 70–87. http://dx.doi.org/10.21146/2074-1472-2019-25-1-70-87.

Full text

Abstract:

The paper is the contribution to quantum toposophy focusing on the abstract orthomodular structures (following Dunn-Moss-Wang terminology). Early quantum toposophical approach to "abstract quantum logic" was proposed based on the topos of functors $\mathsf{[E,Sets]}$ where $\mathsf{E}$ is a so-called orthomodular preorder category – a modification of categorically rewritten orthomodular lattice (taking into account that like any lattice it will be a finite co-complete preorder category). In the paper another kind of categorical semantics of quantum logic is discussed which is based on the modi

APA, Harvard, Vancouver, ISO, and other styles

29

Huang, Bo, and Wei Niu. "Analysis of Snapback Repellers Using Methods of Symbolic Computation." International Journal of Bifurcation and Chaos 29, no. 04 (2019): 1950054. http://dx.doi.org/10.1142/s0218127419500548.

Full text

Abstract:

This paper presents an algebraic criterion for determining whether all the zeros of a given polynomial are outside the unit circle in the complex plane. This criterion is used to deduce critical algebraic conditions for the occurrence of chaos in multidimensional discrete dynamical systems based on a modified Marotto’s theorem developed by Li and Chen (called “Marotto–Li–Chen theorem”). Using these algebraic conditions we reduce the problem of analyzing chaos induced by snapback repeller to an algebraic problem, and propose an algorithmic approach to solve this algebraic problem by means of sy

APA, Harvard, Vancouver, ISO, and other styles

30

Mary, Francis Remigius Perpetua, Swaminathan Mohanaselvi, and Said Broumi. "A solution approach to minimum spanning tree problem under fermatean fuzzy environment." Bulletin of Electrical Engineering and Informatics 12, no. 3 (2023): 1738–46. http://dx.doi.org/10.11591/eei.v12i3.4794.

Full text

Abstract:

In classical graph theory, the minimal spanning tree (MST) is a subgraph with no cycles that connects each vertex with minimum edge weights. Calculating minimum spanning tree of a graph has always been a common problem throughout ages. Fuzzy minimum spanning tree (FMST) is able to handle uncertainty existing in edge weights for a fuzzy graph which occurs in real world situations. In this article, we have studied the MST problem of a directed and undirected fuzzy graph whose edge weights are represented by fermatean fuzzy numbers (FFN). We focus on determining an algorithmic approach for solvin

APA, Harvard, Vancouver, ISO, and other styles

31

Yavich, Roman, Sergey Malev, and Vladimir Rotkin. "Triangle Generator for Online Mathematical E-learning." Higher Education Studies 10, no. 3 (2020): 72. http://dx.doi.org/10.5539/hes.v10n3p72.

Full text

Abstract:

What constitutes learning in the 21st century is the capacity for e-learning. Integral components of e-education are training content management systems. Existing content generators more transform content than create original content. Creating a methodology and technology for generating original content is important and relevant. In order to form adequate methods for generating content, primarily for mathematical and related disciplines, the problem of generating a triangle, together with its many attributes, is considered as the simplest object of elementary mathematics. We create a simulatio

APA, Harvard, Vancouver, ISO, and other styles

32

Numbere, Numbereye, Ioana Moisini, Ajay Dhakal, et al. "Abstract P4-06-07: Clinical risk-assessment, risk-stratification, and outcomes of ER positive, HER2 negative breast cancer patients using the Rochester modified Magee algorithm (RoMMA)." Cancer Research 82, no. 4_Supplement (2022): P4–06–07—P4–06–07. http://dx.doi.org/10.1158/1538-7445.sabcs21-p4-06-07.

Full text

Abstract:

Abstract INTRODUCTION: In 2013, Klein and Dabbs et al. published three linear regression equations (the new Magee equations) using different combinations of standard histopathologic variables. In 2015, our group published a modification of the new Magee equations. Based on this modification, we published an algorithmic approach using an average Modified Magee equation. This algorithmic approach supported reflex Oncotype DX (ODX) testing based on several cutoff points using an average Modified Magee score. In 2019, we validated this algorithmic approach as the Rochester Modified Magee Algorithm

APA, Harvard, Vancouver, ISO, and other styles

33

Karaseva, Tatiana, and ‪Eugene Semenkin. "Evolutionary Approaches to the Identification of Dynamic Processes in the Form of Differential Equations and Their Systems." Algorithms 15, no. 10 (2022): 351. http://dx.doi.org/10.3390/a15100351.

Full text

Abstract:

Evolutionary approaches are widely applied in solving various types of problems. The paper considers the application of EvolODE and EvolODES approaches to the identification of dynamic systems. EvolODE helps to obtain a model in the form of an ordinary differential equation without restrictions on the type of the equation. EvolODES searches for a model in the form of an ordinary differential equation system. The algorithmic basis of these approaches is a modified genetic programming algorithm for finding the structure of ordinary differential equations and differential evolution to optimize th

APA, Harvard, Vancouver, ISO, and other styles

34

Tewari, Veena, Swapnil Morande, and Mitra Amini. "Beyond the Hype: Transformative Impact of Large Language Models on Clinical Decision-Making and Healthcare Delivery Systems." Journal of Sensors, IoT & Health Sciences 3, no. 2 (2025): 20–42. https://doi.org/10.69996/jsihs.2025007.

Full text

Abstract:

Large language models (LLMs) are rapidly transforming healthcare delivery through unprecedented capabilities in clinical text processing and knowledge synthesis. This research examines the multifaceted impact of LLMs across healthcare settings through a systematic mixed-methods investigation. We analyzed 218 peer-reviewed studies published between 2022-2025 utilizing a framework analysis approach supplemented by expert consensus development via modified Delphi technique. Our findings reveal differentiated adoption patterns across healthcare domains, with administrative applications (documentat

APA, Harvard, Vancouver, ISO, and other styles

35

Adamczyk, Michal, and Teresa Orlowska-Kowalska. "Self-Correcting Virtual Current Sensor Based on the Modified Luenberger Observer for Fault-Tolerant Induction Motor Drive." Energies 14, no. 20 (2021): 6767. http://dx.doi.org/10.3390/en14206767.

Full text

Abstract:

Fault-tolerant control (FTC) solutions are increasingly being used in modern drive systems with AC motors. Such systems provide a higher degree of security and solutions that allow the on-line detection and localization of failures, as well as the switching of the control mode to a mode that allows us to continue the operation or safely stop the drive system. As the current sensors (CSs) are necessary to ensure precise control of the AC motors, in the event of their failure, one of two strategies can be used—hardware or software redundancy. The first strategy requires the use of additional mea

APA, Harvard, Vancouver, ISO, and other styles

36

Keyl, Michael. "Distilling Entanglement from Fermions." Open Systems & Information Dynamics 16, no. 02n03 (2009): 243–58. http://dx.doi.org/10.1142/s1230161209000189.

Full text

Abstract:

Since fermions are based on anti-commutation relations, their entanglement cannot be studied in the usual way, such that the available theory has to be modified appropriately. Recent publications consider in particular the structure of separable and of maximally entangled states. In this paper we want to discuss local operations and entanglement distillation from bipartite fermionic systems. To this end we apply an algebraic point of view where algebras of local observables, rather than tensor product Hilbert spaces play the central role. We apply our scheme in particular to fermionic Gaussian

APA, Harvard, Vancouver, ISO, and other styles

37

Adamczyk, Michal, and Teresa Orlowska-Kowalska. "Influence of Parameter Uncertainty to Stator Current Reconstruction Using Modified Luenberger Observer for Current Sensor Fault-Tolerant Induction Motor Drive." Sensors 22, no. 24 (2022): 9813. http://dx.doi.org/10.3390/s22249813.

Full text

Abstract:

In modern systems with induction motors (IM), in addition to precision, it is also very important to ensure the highest possible reliability and safety. To ensure the above, information about the stator current value is required. If the current sensor (CS) fails, a redundant sensor or an algorithmic solution can be used. The Luenberger observer (LO) can be used to estimate the lost stator current without increasing the cost of the drive system. However, this solution is based on the mathematical model of IM, which is sensitive to its parameters. Therefore, this paper presents a modified LO (ML

APA, Harvard, Vancouver, ISO, and other styles

38

Uyanık, Halit, and Tolga Ovatman. "Early Conflict Checking in Two-Phase Commit Protocol for Replicated State Machines." International Journal of Distributed Systems and Technologies 12, no. 4 (2021): 1–20. http://dx.doi.org/10.4018/ijdst.287861.

Full text

Abstract:

Representing an algorithmic workflow as a state machine is a frequently used technique in distributed systems. Replicating a state machine in a fault tolerant way is one of the main application areas under this context. When implementing a replicated state machine, a crucial problem is to maintain consistency among replicas that might handle various different requests arriving at each different replica. This problem requires maintaining a single consistent ordering of the distributed requests handled separately by replicas. Basic consensus protocols such as two phase commit (2PC), can be used

APA, Harvard, Vancouver, ISO, and other styles

39

Niu, Yingli, Xiangyu Bu, and Xinghua Zhang. "Single Chain Mean-Field Theory Study on Responsive Behavior of Semiflexible Polymer Brush." Materials 14, no. 4 (2021): 778. http://dx.doi.org/10.3390/ma14040778.

Full text

Abstract:

The application of single chain mean-field theory (SCMFT) on semiflexible chain brushes is reviewed. The worm-like chain (WLC) model is the best mode of semiflexible chain that can continuously recover to the rigid rod model and Gaussian chain (GC) model in rigid and flexible limits, respectively. Compared with the commonly used GC model, SCMFT is more applicable to the WLC model because the algorithmic complexity of the WLC model is much higher than that of the GC model in self-consistent field theory (SCFT). On the contrary, the algorithmic complexity of both models in SCMFT are comparable.

APA, Harvard, Vancouver, ISO, and other styles

40

SURIS, YURI B. "INTEGRABLE DISCRETIZATIONS FOR LATTICE SYSTEM: LOCAL EQUATIONS OF MOTION AND THEIR HAMILTONIAN PROPERTIES." Reviews in Mathematical Physics 11, no. 06 (1999): 727–822. http://dx.doi.org/10.1142/s0129055x99000258.

Full text

Abstract:

We develop the approach to the problem of integrable discretization based on the notion of r-matrix hierarchies. One of its basic features is the coincidence of Lax matrices of discretized systems with the Lax matrices of the underlying continuous time systems. A common feature of the discretizations obtained in this approach is non-locality. We demonstrate how to overcome this drawback. Namely, we introduce the notion of localizing changes of variables and construct such changes of variables for a large number of examples, including the Toda and the relativistic Toda lattices, the Volterra an

APA, Harvard, Vancouver, ISO, and other styles

41

Temme, F. P. "Role of democratic SU2 x n dual-group carrier space and group structure in the superboson quantum-Liouville physics of identical spin ensembles: Maximal n tensor product reduction, via symbolic algebraic combinatorics." Canadian Journal of Physics 79, no. 9 (2001): 1175–97. http://dx.doi.org/10.1139/p01-026.

Full text

Abstract:

Structural aspects of superboson mappings and their dual group-based carrier spaces inherent in quantum-Liouville NMR formalisms are presented for their conceptual role in understanding the transformational properties and the spin dynamics of identical [A]n([Formula: see text]n) spin ensembles or [AX]n systems, given in terms of {Tkq (υ)} º {|kqυ > >} tensorial bases. Interest in the explicit democratic labelling of the Liouvillian carrier subspaces of [A]n spin ensembles, prompts an examination of the inner products (ITPs) that define the projective carrier space associated with superbo

APA, Harvard, Vancouver, ISO, and other styles

42

Zhan, Zhengsheng, Dangyue Lai, Canjian Huang, Zhixiang Zhang, Yongle Deng, and Jian Yang. "MSCSO: A Modified Sand Cat Swarm Algorithm for 3D UAV Path Planning in Complex Environments with Multiple Threats." Sensors 25, no. 9 (2025): 2730. https://doi.org/10.3390/s25092730.

Full text

Abstract:

To improve the global search efficiency and dynamic adaptability of the Sand Cat Swarm Optimization (SCSO) algorithm for UAV path planning in complex 3D environments, this study proposes a Modified Sand Cat Swarm Optimization (MSCSO) algorithm by integrating chaotic mapping initialization, Lévy flight–Metropolis hybrid exploration mechanisms, simulated annealing–particle swarm hybrid exploitation strategies, and elite mutation techniques. These strategies not only significantly enhance the convergence speed while ensuring algorithmic precision but also provide effective avenues for enhancing t

APA, Harvard, Vancouver, ISO, and other styles

43

Wen, Jiaxin, Siqi Bu, Bowen Zhou, Qiyu Chen, and Dongsheng Yang. "A Fast-Algorithmic Probabilistic Evaluation on Regional Rate of Change of Frequency (RoCoF) for Operational Planning of High Renewable Penetrated Power Systems." Energies 13, no. 11 (2020): 2780. http://dx.doi.org/10.3390/en13112780.

Full text

Abstract:

The high rate of change of frequency (RoCoF) issue incurred by the integration of renewable energy sources (RESs) into a modern power system significantly threatens the grid security, and thus needs to be carefully examined in the operational planning. However, severe fluctuation of regional frequency responses concerned by system operators could be concealed by the conventional assessment based on aggregated system frequency response. Moreover, the occurrence probability of a high RoCoF issue is actually a very vital factor during the system planner’s decision-making. Therefore, a fast-algori

APA, Harvard, Vancouver, ISO, and other styles

44

Mozaffari, Ahmad, Mehdi Emami, Nasser L. Azad, and Alireza Fathi. "A Modified SSLPS Algorithm with Logistic Pseudo-Random Sequence Generator for Improving the Performance of Neka Power Plant." International Journal of Applied Evolutionary Computation 6, no. 1 (2015): 1–29. http://dx.doi.org/10.4018/ijaec.2015010101.

Full text

Abstract:

Metaheuristic techniques have successfully contributed to the development and optimization of large-scale distributed power systems. The archived literature demonstrate that the modification or tuning of the parameters of specific metaheuristics can provide powerful tools suited for optimization of power plants with different types of constraints. In spite of the high potential of metaheuristics in dealing with such systems, most of the conducted researches only address the optimization of the electrical aspects of power systems. In this research, the authors intend to attest the applicability

APA, Harvard, Vancouver, ISO, and other styles

45

Parízek, Pavel, and Filip Kliber. "Checking Just Pairs of Threads for Efficient and Scalable Incremental Verification of Multithreaded Programs." ACM SIGSOFT Software Engineering Notes 48, no. 1 (2023): 27–31. http://dx.doi.org/10.1145/3573074.3573082.

Full text

Abstract:

Many techniques of automated verification target multithreaded programs, because subtle interactions between threads may trigger concurrency errors such as deadlocks and data races. However, techniques and tools involving systematic exploration of the whole space of possible thread interleavings do not scale to large software systems, despite various clever algorithmic optimizations. A viable approach is to use incremental verification techniques that, in each run, focus just on the recently modified code and the relatively small number of affected execution traces, and therefore can provide r

APA, Harvard, Vancouver, ISO, and other styles

46

Gibson, Perry, José Cano, Elliot Crowley, Amos Storkey, and Michael O'Boyle. "DLAS: A Conceptual Model for Across-Stack Deep Learning Acceleration." ACM Transactions on Architecture and Code Optimization 22, no. 1 (2025): 1. https://doi.org/10.1145/3688609.

Full text

Abstract:

Deep Neural Networks (DNNs) are very computationally demanding, which presents a significant barrier to their deployment, especially on resource-constrained devices. Significant work from both the machine learning and computing systems communities has attempted to accelerate DNNs. However, the number of techniques available and the required domain knowledge for their exploration continue to grow, making design space exploration (DSE) increasingly difficult. To unify the perspectives from these two communities, this article introduces the Deep Learning Acceleration Stack (DLAS), a conceptual mo

APA, Harvard, Vancouver, ISO, and other styles

47

Leddy, Johna, and Joshua Richard Coduto. "(Invited, Digital Presentation) Tafel Analysis Algorithm: Objective Identification of the Linear Region." ECS Meeting Abstracts MA2022-01, no. 45 (2022): 1879. http://dx.doi.org/10.1149/ma2022-01451879mtgabs.

Full text

Abstract:

Electrocatalysts for hydrogen evolution and oxidation (HER and HOR) reactions, oxygen reduction and evolution (ORR and OER) reactions, and carbon dioxide reduction reactions (CO2RR) are evaluated by Tafel analysis. The Tafel equation specifies the log-linear relationship between current and overpotential 𝛈. Heterogenous electron transfer parameters of exchange current density j o and transfer coefficient 𝛂 are found. Standard heterogenous electron transfer rate k 0 can be found from j o. Conventionally, Tafel analysis is an extension of the Butler-Volmer equation applied at high overpotentials

APA, Harvard, Vancouver, ISO, and other styles

48

Najoui, Mohamed, Anas Hatim, Said Belkouch, and Noureddine Chabini. "Novel Implementation Approach with Enhanced Memory Access Performance of MGS Algorithm for VLIW Architecture." Journal of Circuits, Systems and Computers 29, no. 12 (2020): 2050200. http://dx.doi.org/10.1142/s021812662050200x.

Full text

Abstract:

Modified Gram–Schmidt (MGS) algorithm is one of the most-known forms of QR decomposition (QRD) algorithms. It has been used in many signal and image processing applications to solve least square problem and linear equations or to invert matrices. However, QRD is well-thought-out as a computationally expensive technique, and its sequential implementation fails to meet the requirements of many real-time applications. In this paper, we suggest a new parallel version of MGS algorithm that uses VLIW (Very Long Instruction Word) resources in an efficient way to get more performance. The presented pa

APA, Harvard, Vancouver, ISO, and other styles

49

Orlowska-Kowalska, Teresa, Magdalena Miniach, and Michal Adamczyk. "Compensation of Current Sensor Faults in Vector-Controlled Induction Motor Drive Using Extended Kalman Filters." Electronics 13, no. 3 (2024): 641. http://dx.doi.org/10.3390/electronics13030641.

Full text

Abstract:

In electric drive systems, one of the most common faults is related to measurement equipment, including current sensors (CSs). As information about the stator current is crucial to ensure precise control of AC drives, such a fault significantly affects the quality and security of the entire system. For this reason, a modified extended Kalman filter (EKF) has been presented in this paper as an algorithmic solution to restore stator current in the event of CS failure. In order to minimize the impact of rotor and stator resistance variations on the quality of the estimation, the proposed model in

APA, Harvard, Vancouver, ISO, and other styles

50

Price, J. Blair, Aaron E. Rusheen, Abhijeet S. Barath, et al. "Clinical applications of neurochemical and electrophysiological measurements for closed-loop neurostimulation." Neurosurgical Focus 49, no. 1 (2020): E6. http://dx.doi.org/10.3171/2020.4.focus20167.

Full text

Abstract:

The development of closed-loop deep brain stimulation (DBS) systems represents a significant opportunity for innovation in the clinical application of neurostimulation therapies. Despite the highly dynamic nature of neurological diseases, open-loop DBS applications are incapable of modifying parameters in real time to react to fluctuations in disease states. Thus, current practice for the designation of stimulation parameters, such as duration, amplitude, and pulse frequency, is an algorithmic process. Ideal stimulation parameters are highly individualized and must reflect both the specific di

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!