Results 31 to 40 of about 6,880,808 (309)
This paper is aimed at generating element stiffness matrices for the family of triangular elements using Universal Matrix Method and performing a CPU time efficiency analysis and comparison of stiffness coefficients deviation (error).
P.V. Jeyakarthikeyan +2 more
doaj +1 more source
The development of technologies in generation-grid-load-energy storage has created enormous uncertainties for power system and thus brings great challenges to medium-and long-term operation simulation.
Zheyu Guo, Yanan Zheng, Gengyin Li
doaj +1 more source
Crafting Targeted Universal Adversarial Perturbations: Considering Images as Noise
The vulnerability of Deep Neural Networks (DNNs) to adversarial perturbations has been demonstrated in a large body of research. Compared to image-dependent adversarial perturbations, universal adversarial perturbations(UAPs) is more challenging for ...
Huijiao Wang +3 more
doaj +1 more source
On the universal sequence generated by a class of unimodal functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li Wang 0001, Nicholas D. Kazarinoff
openaire +2 more sources
Universal health plan proposal. Spanish
Title from PDF caption (viewed on September 14, 2022)."El Grupo de Trabajo Conjunto sobre Atención Universal comenzó con la aprobación de la Ley 770 del Senado.
core
Services composition is fundamental to software development in multi-service wireless sensor networks (WSNs). The quality of service (QoS) of services composition applications (SCAs) are confronted with severe challenges due to the open, dynamic, and ...
Naixue Xiong +3 more
doaj +1 more source
The probability of generating a finite simple group [PDF]
We study the probability of generating a finite simple group, together with its generalisation PG,socG(d), the conditional probability of generating an almost simple finite group G by d elements, given that these elements generate G/ socG.
Colva M. Roney-Dougal +5 more
core +1 more source
A relation-centric algorithm for solving text-diagram function problems
A tutorable algorithm for solving text-diagram function (TDF) problems is an essential technology for building the humanoid tutorial service since ”function” is a core portion of mathematics.
Xinguo Yu, Huihui Sun, Chao Sun
doaj +1 more source
Generation of near-optimal universal Boolean functions
AbstractA Boolean function U(z1, z2,…,zm) is universal for given n≥1 if it realizes all Boolean functions f(x1,…,xn) by substituting for each zj a variable of the set {0, 1, x1,…,xn, 1,…,n}). An easily applied method based on linear algebra is developed for finding universal Boolean functions having a small number m of arguments.
Franco P. Preparata, David E. Muller
openaire +2 more sources
The complexity of small universal Turing machines : a survey [PDF]
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines ...
Woods, Damien, Neary, Turlough
core +1 more source

