Results 91 to 100 of about 16,734 (266)
Algorithmic Computation of Flattenings and of Modular Deformations
An algorithm to compute the ideal of the flattening stratum of a module over a local algebra, modulo a power of the maximal ideal, is described. The algorithm is implemented in \textit{Singular}. As an application, the infinitesimal modular deformations of isolated complete intersection singularities can be computed, as they are characterised as ...
openaire +1 more source
Interpolation in computing science: the semantics of modularization [PDF]
Inspired by ``Module algebra'' [\textit{J. A. Bergstra}, \textit{J. Heering} and \textit{P. Klint}, J. Assoc. Comput. Mach. 37, No.~2, 335--372 (1990; Zbl 0696.68040)], the author introduces Theory Algebra (TA), an algebraic theory of logical theories with three operations: union, hiding and application of interpretations, where a \textit{theory} is a ...
openaire +3 more sources
ABSTRACT Background and Objectives Multiple sclerosis (MS) exhibits racially disparate rates of disease progression. Black people with MS (B‐PwMS) experience a more severe disease course than non‐Hispanic White people with MS (NHW‐PwMS). Here we investigated structural and functional connectivity as well as structure–function decoupling in the ...
Emilio Cipriano +11 more
wiley +1 more source
This article presents an area-efficient hardware architecture for the implementation of elliptic-curve point multiplication (PM) operation over $GF(2^{233})$ .
Amer Aljaedi +5 more
doaj +1 more source
ABSTRACT Objective Considerable efforts have been dedicated to developing effective treatments for post‐stroke executive impairment (PSEI), among which repetitive transcranial magnetic stimulation (rTMS) has shown great potential. This study aimed to investigate the therapeutic effects of high‐frequency rTMS on working memory (WM) and response ...
Mengting Lao +6 more
wiley +1 more source
Computing with endomorphism ringsof modular representations
The representation theory has benefited greatly from computational methods and the benefit may even increase in the next future when dealing with more and more complicated examples. So, this paper which presents new algorithms for computing invariants in modular representation theory may be very appreciated.
openaire +1 more source
Computing modular coincidences
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the number of iterations needed.
Frettlöh, D., Sing, B.
openaire +2 more sources
RNA Sequencing Resolves Cryptic Pathogenic Variants in Mitochondrial Disease
ABSTRACT Objective Mitochondrial diseases are the most common inherited metabolic disorders, characterized by pronounced clinical and genetic heterogeneity that complicates molecular diagnosis. Although DNA‐based sequencing approaches have become standard in genetic testing, up to half of patients remain without a definitive diagnosis.
Zhimei Liu +21 more
wiley +1 more source
Chaotic roots of the modular multiplication dynamical system in Shor's algorithm
Shor's factoring algorithm, believed to provide an exponential speedup over classical computation, relies on finding the period of an exactly periodic quantum modular multiplication operator. This exact periodicity is the hallmark of an integrable system,
Abu Musa Patoary +3 more
doaj +1 more source
Algorithms for estimating modular numbers in floating-point arithmetic
In the residue number system (RNS), the operations of addition, subtraction, and multiplication are executed in parallel for different digits (residues) of the modular numbers.
Konstantin Sergeevich Isupov
doaj

