Results 121 to 130 of about 153,517 (179)

An image compression-encryption algorithm based on BP neural network optimized with fireworks algorithm. [PDF]

Sci Rep
Liang Y, Peng B, Liu R, Kang N, Zhou H.
europepmc   +1 more source

Deep mechanism design: Learning social and economic policies for human benefit. [PDF]

Proc Natl Acad Sci U S A
Tacchetti A, Koster R, Balaguer J, Leqi L, Pislar M, Botvinick MM, Tuyls K, Parkes DC, Summerfield C.   +8 more
europepmc   +1 more source

Programmable low-coherence wavefronts for enhanced localization. [PDF]

Commun Eng
Bilgin B, Liao JC, Chen HT, Chang CC, Addamane S, Lilly MP, Mittleman DM, Knightly EW.   +7 more
europepmc   +1 more source

Ecological opportunity and the onset of polyploid niche expansion waves

Kauai F, Van de Peer Y, Bonte D.
europepmc   +1 more source

Enhancing automated robotic services efficiency through intelligent dependent robotic computation. [PDF]

PLoS One
Alfahid A, Lhioui C, Asklany S, Hamdaoui R, Hamdi M, Abbas G, Yousef A, Sahbani A.   +7 more
europepmc   +1 more source

The Construction and Application of a Clinical Decision Support System for Cardiovascular Diseases: Multimodal Data-Driven Development and Validation Study.

JMIR Med Inform
Miao S, Ji P, Zhu Y, Meng H, Jing M, Sheng R, Zhang X, Ding H, Guo J, Gao W, Yang G, Liu Y.   +11 more
europepmc   +1 more source

Behavioral Time Scale Synaptic Plasticity (BTSP) endows binding of distributed representations with flexible retrieval options

Yu C, Yang Y, Wu Y, Wang A, Maass W.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

K-ITERATED FUNCTION SYSTEM

Fractals, 2010
In 1969, Kannan1 gave the definition of a new mapping which had presented a condition which is more lenient than contraction condition. The purpose of this note is to introduce K-Iterated Function System using Kannan mapping which will cover a larger range of mappings. We also prove the Collage theorem for the K-Iterated Function System.
Sahu, D. R., Chakraborty, Anindita, Dubey, R. P.   +2 more
openaire   +2 more sources

Recurrent Iterated Function Systems

Constructive Approximation, 1989
Recurrent iterated function systems generalize iterated function systems as introduced by the first author and \textit{S. Demko} [Proc. R. Soc. Lond., Ser. A 399, 243-275 (1985; Zbl 0588.28002)] in that a Markov chain (typically with some zeros in the transition probability matrix) is used to drive a system of maps \(w_ j:\) \(K\to K\), \(j=1,2,...,N\),
Barnsley, Michael F., Elton, John H., Hardin, Douglas P.   +2 more
openaire   +1 more source

Chaos in Iterated Function Systems

International Journal of Bifurcation and Chaos, 2020
In the present paper, we study chaos in iterated function systems (IFS), namely dynamical systems with several generators. We introduce weak Li–Yorke chaos, chaos in branch, and weak topological chaos to perceive the role of branches to create chaos in an IFS. Moreover, we define another type of chaos, [Formula: see text]-chaos, on an IFS.
Mohtashamipour, Maliheh, Bahabadi, Alireza Zamani   +1 more
openaire   +1 more source