Since the traditional computing paradigm has reached its optimum advancement levels due to saturation in Moore's law and other factors, many researchers are leaning towards other paradigms such as neuromorphic and cytomorphic computing. Thus, in recent decades, the electronic mapping of neural circuits and other biological circuits has attracted widespread attention from various researchers in the field. In the literature on neuromorphic and cytomorphic circuits, we find very rare integrative reviews of the two fields that would suggest a correlation between the two separate but related fields. This survey explores such neuromorphic and cytomorphic designs with biorealistic implementations in the analog, mixed-signal, and digital domains. The trends of the increase in work by eminent researchers in the field suggest an ever-increasing incorporation of biorealism in such designs. We first explored the analog designs in the two fields and find that the earlier designs were mostly based on biophysical mapping of sub-threshold analog circuits with biological time constants, but, later on, some researchers worked with above-threshold complementary metal-oxide semiconductor (CMOS) transistors which allowed time-accelerated implementations with somewhat fewer biophysical aspects incorporated. Analog design facilitates resource-efficient circuits, and we see analog designs still acquired by many eminent researchers in contemporary times. We also see a growing number of researchers taking up analog design with digital programmability and communication techniques as a mixed-signal approach. Then some researchers have resorted to pure digital implementations on account of their flexibility, accuracy and clock speeds, but at the expense of complexity in biorealistic pathways. Digital modeling has gained some traction due to multiplier-less modeling, piecewise linear approximations, and enhanced synaptic communication techniques. In particular, field-programmable gate array-based modeling renders the advantages of low cost, rapid prototyping and accuracy at high speed. Systems based on newer research in neuroscience like the role of astrocytes in neural networks have also been explored. In the past 16 years from 2008 to 2023, where this major shift towards bioplausible design has soared high, we see 50% of the selected publications have used digital design, 31% have used a mixed-signal design, and 19% have used analog design across different levels of bioplausibility. Moreover, we see a growing trend of cytomorphic publications and biorealistic neuromorphic publications over recent years. We have covered many applications of such designs in various emerging fields like synthetic biology, drug testing, neuroprosthetics, and other relevant fields.
Citation: Syeda Ramish Fatima, Maria Waqas. Trends of modeling bio-cellular processes and neural pathways on analog, mixed-signal and digital hardware – a review[J]. AIMS Bioengineering, 2025, 12(2): 177-208. doi: 10.3934/bioeng.2025008
[1] | Yonghong Liu, Ghulam Farid, Dina Abuzaid, Hafsa Yasmeen . On boundedness of fractional integral operators via several kinds of convex functions. AIMS Mathematics, 2022, 7(10): 19167-19179. doi: 10.3934/math.20221052 |
[2] | Ye Yue, Ghulam Farid, Ayșe Kübra Demirel, Waqas Nazeer, Yinghui Zhao . Hadamard and Fejér-Hadamard inequalities for generalized $ k $-fractional integrals involving further extension of Mittag-Leffler function. AIMS Mathematics, 2022, 7(1): 681-703. doi: 10.3934/math.2022043 |
[3] | Maryam Saddiqa, Saleem Ullah, Ferdous M. O. Tawfiq, Jong-Suk Ro, Ghulam Farid, Saira Zainab . $ k $-Fractional inequalities associated with a generalized convexity. AIMS Mathematics, 2023, 8(12): 28540-28557. doi: 10.3934/math.20231460 |
[4] | Maryam Saddiqa, Ghulam Farid, Saleem Ullah, Chahn Yong Jung, Soo Hak Shim . On Bounds of fractional integral operators containing Mittag-Leffler functions for generalized exponentially convex functions. AIMS Mathematics, 2021, 6(6): 6454-6468. doi: 10.3934/math.2021379 |
[5] | Ghulam Farid, Saira Bano Akbar, Shafiq Ur Rehman, Josip Pečarić . Boundedness of fractional integral operators containing Mittag-Leffler functions via (s,m)-convexity. AIMS Mathematics, 2020, 5(2): 966-978. doi: 10.3934/math.2020067 |
[6] | Hengxiao Qi, Muhammad Yussouf, Sajid Mehmood, Yu-Ming Chu, Ghulam Farid . Fractional integral versions of Hermite-Hadamard type inequality for generalized exponentially convexity. AIMS Mathematics, 2020, 5(6): 6030-6042. doi: 10.3934/math.2020386 |
[7] | Xiuzhi Yang, G. Farid, Waqas Nazeer, Muhammad Yussouf, Yu-Ming Chu, Chunfa Dong . Fractional generalized Hadamard and Fejér-Hadamard inequalities for m-convex functions. AIMS Mathematics, 2020, 5(6): 6325-6340. doi: 10.3934/math.2020407 |
[8] | Miguel Vivas-Cortez, Muhammad Uzair Awan, Sehrish Rafique, Muhammad Zakria Javed, Artion Kashuri . Some novel inequalities involving Atangana-Baleanu fractional integral operators and applications. AIMS Mathematics, 2022, 7(7): 12203-12226. doi: 10.3934/math.2022678 |
[9] | Bushra Kanwal, Saqib Hussain, Thabet Abdeljawad . On certain inclusion relations of functions with bounded rotations associated with Mittag-Leffler functions. AIMS Mathematics, 2022, 7(5): 7866-7887. doi: 10.3934/math.2022440 |
[10] | Gauhar Rahman, Iyad Suwan, Kottakkaran Sooppy Nisar, Thabet Abdeljawad, Muhammad Samraiz, Asad Ali . A basic study of a fractional integral operator with extended Mittag-Leffler kernel. AIMS Mathematics, 2021, 6(11): 12757-12770. doi: 10.3934/math.2021736 |
Since the traditional computing paradigm has reached its optimum advancement levels due to saturation in Moore's law and other factors, many researchers are leaning towards other paradigms such as neuromorphic and cytomorphic computing. Thus, in recent decades, the electronic mapping of neural circuits and other biological circuits has attracted widespread attention from various researchers in the field. In the literature on neuromorphic and cytomorphic circuits, we find very rare integrative reviews of the two fields that would suggest a correlation between the two separate but related fields. This survey explores such neuromorphic and cytomorphic designs with biorealistic implementations in the analog, mixed-signal, and digital domains. The trends of the increase in work by eminent researchers in the field suggest an ever-increasing incorporation of biorealism in such designs. We first explored the analog designs in the two fields and find that the earlier designs were mostly based on biophysical mapping of sub-threshold analog circuits with biological time constants, but, later on, some researchers worked with above-threshold complementary metal-oxide semiconductor (CMOS) transistors which allowed time-accelerated implementations with somewhat fewer biophysical aspects incorporated. Analog design facilitates resource-efficient circuits, and we see analog designs still acquired by many eminent researchers in contemporary times. We also see a growing number of researchers taking up analog design with digital programmability and communication techniques as a mixed-signal approach. Then some researchers have resorted to pure digital implementations on account of their flexibility, accuracy and clock speeds, but at the expense of complexity in biorealistic pathways. Digital modeling has gained some traction due to multiplier-less modeling, piecewise linear approximations, and enhanced synaptic communication techniques. In particular, field-programmable gate array-based modeling renders the advantages of low cost, rapid prototyping and accuracy at high speed. Systems based on newer research in neuroscience like the role of astrocytes in neural networks have also been explored. In the past 16 years from 2008 to 2023, where this major shift towards bioplausible design has soared high, we see 50% of the selected publications have used digital design, 31% have used a mixed-signal design, and 19% have used analog design across different levels of bioplausibility. Moreover, we see a growing trend of cytomorphic publications and biorealistic neuromorphic publications over recent years. We have covered many applications of such designs in various emerging fields like synthetic biology, drug testing, neuroprosthetics, and other relevant fields.
Convex functions are very useful in diverse fields of mathematics, statistics, economics etc. They are especially important in the study of optimization problems where they are distinguished due to a number of appropriate properties. Convex functions serve as a model for generalizations and extensions of mathematical concepts [1,2]. Convex functions are defined as follows:
Definition 1. [3] A function f:I→R, where I is an interval in R, is said to be convex function, if the following inequality holds:
f(ta+(1−t)b)≤tf(a)+(1−t)f(b), |
for all a,b∈I and t∈[0,1].
Convex functions have been generalized, refined and extended in various forms. A refinement appears in the form of the strongly convex functions, defined as follows:
Definition 2. [4,5] Let I be a nonempty convex subset of a normed space (X,||.||). A real valued function f is said to be strongly convex, with modulus λ>0, on I if for each a,b∈I and t∈[0,1]
f(ta+(1−t)b)≤tf(a)+(1−t)f(b)−λt(1−t)||b−a||2. |
Strongly convexity is a strengthening notion than convexity. A generalization of convex function defined on right half of real line is called s-convex function, defined as follows:
Definition 3. [6] Let s∈[0,1]. A function f:[0,∞)→R is said to be s-convex function in the second sense if
f(ta+(1−t)b)≤tsf(a)+(1−t)sf(b), | (1.1) |
holds for all a,b∈[0,∞) and t∈[0,1].
An extension of a convex function on right half of real line is called m-convex function, defined as follows:
Definition 4. [7] A function f:[0,b]→R is said to be m-convex function, where m∈[0,1] and b>0, if for every x,y∈[0,b] and t∈[0,1] we have
f(tx+m(1−t)y)≤tf(x)+m(1−t)f(y). | (1.2) |
Definition 5. [8] A function f:[0,+∞)→R is said to be strongly m-convex function with modulus λ if
f(ta+m(1−t)b)≤tf(a)+m(1−t)f(b)−λmt(1−t)(b−a)2. | (1.3) |
with a,b∈[0,+∞), m∈[0,1] and λ>0.
Further generalizations of above functions in the form of (s,m)-convex function and strongly (s,m)-convex function, are defined as follows:
Definition 6. [9] A function f:[0,b]→R is said to be (s,m)-convex function, where (s,m)∈[0,1]2 and b>0, if for every x,y∈[0,b] and t∈[0,1] we have
f(tx+m(1−t)y)≤tsf(x)+m(1−t)sf(y). |
Definition 7. [10] A function f:[0,+∞)→R is said to be strongly (s,m)-convex function with modulus λ>0, for (s,m)∈[0,1]2, if
f(ta+m(1−t)b)≤tsf(a)+m(1−t)sf(b)−mλt(1−t)|b−a|2 | (1.4) |
holds for all a,b∈[0,+∞) and t∈[0,1].
In [9,11,12,13], the authors have studied the bounds of Riemann-Liouville and other well-known fractional integral operators involving Mittag-Leffler functions, for convex and related functions. The goal of this paper is to produce refinements of bounds of these fractional integral operators by applying strongly (s,m)-convexity. It is noted that in "G. Farid, S. B. Akbar, S. U. Rehman, J. Pečarić, Boundedness of fractional integral operators containing Mittag-Leffler functions via (s, m)-convexity, Aims Mathematics, 5 (2020), 966–978." the definition of (s,m)-convex function is not correctly stated, therefore the results of this paper have some errors. We will also give correct versions of results of this paper.
The Mittag-Leffler functions Eα(.) for one parameter is defined as follows[14].
Eα(t)=∞∑n=0tnΓ(αn+1), |
where t,α∈C,ℜ(α)>0 and Γ(.) is the gamma function. It is a natural extension of exponential, hyperbolic and trigonometric functions. The Mittag-Leffler function and its extensions appear in the solutions of fractional integral equations and fractional differential equations. It was further explored by Wiman, Pollard, Humbert, Agarwal and Feller (see [15]). For detail study on the Mittag-Leffler function we refer the reader to [15,16,17,18,19].
The following extended generalized Mittag-Leffler function is introduced by Andrić et al.:
Definition 8. [20] Let μ,α,l,γ,c∈C, ℜ(μ),ℜ(α),ℜ(l)>0, ℜ(c)>ℜ(γ)>0 with p≥0, δ>0 and 0<k≤δ+ℜ(μ). Then the extended generalized Mittag-Leffler function Eγ,δ,k,cμ,α,l(t;p) is defined by:
Eγ,δ,k,cμ,α,l(t;p)=∞∑n=0βp(γ+nk,c−γ)β(γ,c−γ)(c)nkΓ(μn+α)tn(l)nδ, | (1.5) |
where βp is defined by
βp(x,y)=∫10tx−1(1−t)y−1e−pt(1−t)dt |
and (c)nk=Γ(c+nk)Γ(c).
A derivative formula of the extended generalized Mittag-Leffler function is given in following lemma.
Lemma 1. [20] If m∈N,ω,μ,α,l,γ,c∈C,ℜ(μ),ℜ(α),ℜ(l)>0,ℜ(c)>ℜ(γ)>0 with p≥0,δ>0 and 0<k<δ+ℜ(μ), then
(ddt)m[tα−1Eγ,δ,k,cμ,α,l(ωtμ;p)]=tα−m−1Eγ,δ,k,cμ,α−m,l(ωtμ;p)ℜ(α)>m. | (1.6) |
Remark 1. The extended Mittag-Leffler function (1.5) produces the related functions defined in [17,18,19,21,22] (see [23,Remark 1.3]).
Next, we give definition of the generalized fractional integral operator containing the extended generalized Mittag-Leffler function (1.5).
Definition 9 [20] Let ω,μ,α,l,γ,c∈C, ℜ(μ),ℜ(α),ℜ(l)>0, ℜ(c)>ℜ(γ)>0 with p≥0, δ>0 and 0<k≤δ+ℜ(μ). Let f∈L1[a,b] and x∈[a,b]. Then the generalized fractional integral operators containing Mittag-Leffler function are defined by:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)=∫xa(x−t)α−1Eγ,δ,k,cμ,α,l(ω(x−t)μ;p)f(t)dt, | (1.7) |
(ϵγ,δ,k,cμ,α,l,ω,b−f)(x;p)=∫bx(t−x)α−1Eγ,δ,k,cμ,α,l(ω(t−x)μ;p)f(t)dt. | (1.8) |
Remark 2. The operators (1.7) and (1.8) produce in particular several kinds of known fractional integral operators (see [20], also [23,Remark 1.4]).
The classical Riemann-Liouville fractional integral operator is defined as follows:
Definition 10. [22] Let f∈ç1[a,b]. Then the Riemann-Liouville fractional integral operators of order α>0 are defined as follows:
Iαa+f(x)=1Γ(α)∫xa(x−t)α−1f(t)dt,x∈(a,b], | (1.9) |
Iαb−f(x)=1Γ(α)∫bx(t−x)α−1f(t)dt,x∈[a,b). | (1.10) |
It can be noted that (ϵγ,δ,k,cμ,α,l,0,a+f)(x;0)=Iαa+f(x) and (ϵγ,δ,k,cμ,α,l,0,b−f)(x;0)=Iαb−f(x). From the fractional integral operators (1.7) and (1.8), we have (see [24]):
Jα,a+(x;p):=(ϵγ,δ,k,cμ,α,l,ω,a+1)(x;p)=(x−a)αEγ,δ,k,cμ,α+1,l(w(x−a)μ;p), | (1.11) |
Jβ,b−(x;p):=(ϵγ,δ,k,cμ,β,l,ω,b−1)(x;p)=(b−x)βEγ,δ,k,cμ,β+1,l(w(b−x)μ;p). | (1.12) |
The bounds of Riemann-Liouville fractional integrals of convex functions are given in the following theorem.
Theorem 1. [13] Let f:I⟶R be a positive convex function, a,b∈I;a<b and f∈L1[a,b]. Then for α,β≥1, the following inequality for Riemann-Liouville fractional integrals holds:
Γ(α)Iαa+f(x)+Γ(β)Iβb−f(x)≤(x−a)αf(a)+(b−x)βf(b)2+f(x)[(x−a)α+(b−x)β2]. | (1.13) |
The bounds of fractional integrals (1.7) and (1.8) for s-convex functions are given in the following theorem.
Theorem 2. [11] Let f:[a,b]⟶R be a real valued function and f∈L1[a,b]. If f is positive and s-convex, then for α,β≥1, the following fractional integral inequality for generalized integral operators holds:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β,l,ω,b−f)(x;p)≤(f(a)+f(x)s+1)(x−a)Jα−1,a+(x;p)+(f(b)+f(x)s+1)(b−x)Jβ−1,b−(x;p),x∈[a,b]. | (1.14) |
The bounds of fractional integrals (1.7) and (1.8) for convex functions can be obtained by putting s=1, which are given in [12,Corollary 1]. The bounds of Riemann-Liouville fractional integrals can be obtained by putting s=1,p=ω=0 in (1.14). In [11,12] fractional integrals (1.7) and (1.8) are also estimated in the form of Hadamard inequality and in a modulus inequality. Here we provide refinements of all the results proved in [9,11,12] along with corrected versions of results given in [9] for (s,m)-convex functions.
In the upcoming section refinements of the bounds of generalized fractional integral operators are established by using strongly (s,m)-convex functions. The results of [9] are correctly stated which appear in some special cases of presented results. Furthermore, the refinements of bounds of these operators are presented in Hadamard like inequality by using strongly (s,m)-convex functions. Also the results of this paper give refinements of some well-known inequalities.
We use the extended generalized Mittag-Leffler function with the corresponding fractional integral operator in real domain. The first result provides an upper bound of sum of left and right fractional integrals for strongly (s,m)-convex functions on real domain.
Theorem 3. Let f∈L1[a,b],0≤a<b. If f is a positive and strongly (s,m)-convex function on [a,mb] with modulus λ>0, m∈(0,1], then for α,β≥1, the following fractional integral inequality for generalized integral operators (1.7) and (1.8) holds:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β,l,ω,b−f)(x;p)≤(f(a)+mf(xm)s+1−λ(x−ma)26m)(x−a)Jα−1,a+(x;p)+(f(b)+mf(xm)s+1−λ(mb−x)26m)(b−x)Jβ−1,b−(x;p),x∈[a,b]. | (2.1) |
Proof. Let x∈[a,b]. Then for t∈[a,x) and α≥1, one can have the following inequality:
(x−t)α−1Eγ,δ,k,cμ,α,l(ω(x−t)μ;p)≤(x−a)α−1Eγ,δ,k,cμ,α,l(ω(x−a)μ;p). | (2.2) |
The function f is strongly (s,m)-convex function with modulus λ, therefore one can obtain
f(t)≤(x−tx−a)sf(a)+m(t−ax−a)sf(xm)−λ(x−t)(t−a)(x−ma)2m(x−a)2. | (2.3) |
By multiplying (2.2) and (2.3) and then integrating over [a,x], we get
∫xa(x−t)α−1Eγ,δ,k,cμ,α,l(ω(x−t)μ;p)f(t)dt≤(x−a)α−1Eγ,δ,k,cμ,α,l(ω(x−a)μ;p)(f(a)(x−a)s∫xa(x−t)sdt+mf(xm)∫xa(t−ax−a)sdt−λ(x−ma)2m(x−a)2∫xa(x−t)(t−a)dt). |
Therefore, the left fractional integral operator satisfies the following inequality:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)≤(x−a)Jα−1,a+(x;p)(f(a)+mf(xm)s+1−λ(x−ma)26m). | (2.4) |
Now, on the other hand for t∈(x,b] and β≥1, one can have the following inequality:
(t−x)β−1Eγ,δ,k,cμ,β,l(ω(t−x)μ;p)≤(b−x)β−1Eγ,δ,k,cμ,β,l(ω(b−x)μ;p). | (2.5) |
Again, from strongly (s,m)-convexity of f, we have
f(t)≤(t−xb−x)sf(b)+m(b−tb−x)sf(xm)−λ(t−x)(b−t)(mb−x)2m(b−x)2. | (2.6) |
By multiplying (2.5) and (2.6) and then integrating over [x,b], we have
∫bx(t−x)β−1Eγ,δ,k,cμ,β,l(ω(t−x)μ;p)f(t)dt≤(b−x)β−1Eγ,δ,k,cμ,β,l(ω(b−x)μ;p)(f(a)(b−x)s∫bx(t−x)sdt+mf(xm)∫bx(b−tb−x)sdt−λ(mb−x)2m(b−x)2∫bx(t−x)(b−t)dt). |
Therefore, we have that, the right integral operator satisfies the following inequality:
(ϵγ,δ,k,cμ,β,l,ω,b−f)(x;p)≤(b−x)Jβ−1,b−(x;p)(f(b)+mf(xm)s+1−λ(mb−x)26m). | (2.7) |
By adding (2.4) and (2.7), the required inequality (2.1) can be obtained.
Some particular cases are given in the following results:
Theorem 4. Let f∈L1[a,b],0≤a<b. If f is a positive and (s,m)-convex function on [a,mb], m∈(0,1], then for α,β≥1, the following fractional integral inequality for generalized integral operators (1.7) and (1.8) holds:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β,l,ω,b−f)(x;p)≤(f(a)+mf(xm)s+1)(x−a)Jα−1,a+(x;p)+(f(b)+mf(xm)s+1)(b−x)Jβ−1,b−(x;p),x∈[a,b]. | (2.8) |
Proof. For (s,m)-convex functions the inequality (2.4) holds as follows (by setting λ=0):
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)≤(x−a)Jα−1,a+(x;p)(f(a)+mf(xm)s+1). | (2.9) |
Also, for (s,m)-convex functions the inequality (2.7) holds as follows (by setting λ=0):
(ϵγ,δ,k,cμ,β,l,ω,b−f)(x;p)≤(b−x)Jβ−1,b−(x;p)(f(b)+mf(xm)s+1). | (2.10) |
By adding (2.9) and (2.10) the inequality (2.8) can be obtained.
Remark 3. The inequality (2.8) is the correct version of [9,Theorem 1]. The inequality (2.1) provides refinement of inequality (2.8).
Corollary 1. The following inequality holds for strongly convex functions by taking s=m=1 in (2.1):
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,α,l,ω,b−f)(x;p)≤(f(a)+f(x)2−λ(x−a)26)(x−a)Jα−1,a+(x;p)+(f(b)+f(x)2−λ(b−x)26)(b−x)Jα−1,b−(x;p),x∈[a,b]. | (2.11) |
Corollary 2. The following inequality holds for convex functions by taking s=m=1,λ=0 in (2.1) which is proved in [12,Corollary 1]:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,α,l,ω,b−f)(x;p)≤(f(a)+f(x)2)(x−a)Jα−1,a+(x;p)+(f(b)+f(x)2)(b−x)Jα−1,b−(x;p),x∈[a,b]. | (2.12) |
Remark 4. The inequality (2.11) provides refinement of inequality (2.12).
Corollary 3. If we set α=β in (2.1), then the following inequality is obtained:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,α,l,ω,b−f)(x;p)≤(f(a)+mf(xm)s+1−λ(x−ma)26m)(x−a)Jα−1,a+(x;p)+(f(b)+mf(xm)s+1−λ(mb−x)26m)(b−x)Jα−1,b−(x;p),x∈[a,b]. | (2.13) |
Corollary 4. If we set α=β and λ=0 in (2.1), then the following inequality is obtained for (s,m)-convex function:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,α,l,ω,b−f)(x;p)≤(f(a)+mf(xm)s+1)(x−a)Jα−1,a+(x;p)+(f(b)+mf(xm)s+1)(b−x)Jα−1,b−(x;p),x∈[a,b]. | (2.14) |
Remark 5. The inequality (2.14) is the correct version of [9,Corollary 1]. The inequality (2.13) provides refinement of inequality (2.14).
Corollary 5. Along with assumptions of Theorem 1, if f∈L∞[a,b], then the following inequality is obtained:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β,l,ω,b−f)(x;p)≤||f||∞(1+m)s+1[(x−a)Jα−1,a+(x;p)+(b−x)Jβ−1,b−(x;p)]−[λ(x−ma)2(x−a)6mJα−1,a+(x;p)+λ(mb−x)2(b−x)6mJβ−1,b−(x;p)]. | (2.15) |
Corollary 6. Along with assumptions of Theorem 1, if f∈L∞[a,b],λ=0, then the following inequality is obtained for (s,m)-convex function:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β,l,ω,b−f)(x;p)≤||f||∞(1+m)s+1[(x−a)Jα−1,a+(x;p)+(b−x)Jβ−1,b−(x;p)] | (2.16) |
Remark 6. The inequality (2.16) is the correct version of [9,Corollary 2]. The inequality (2.15) provides refinement of inequality (2.16).
Corollary 7. For α=β in (2.15), we get the following result:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,α,l,ω,b−f)(x;p)≤||f||∞(1+m)s+1[(x−a)Jα−1,a+(x;p)+(b−x)Jα−1,b−(x;p)]−[λ(x−ma)2(x−a)6mJα−1,a+(x;p)+λ(mb−x)2(b−x)6mJα−1,b−(x;p)]. | (2.17) |
Corollary 8. For α=β,λ=0 in (2.15), we get the following result for (s,m)-convex function:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,α,l,ω,b−f)(x;p)≤||f||∞(1+m)s+1[(x−a)Jα−1,a+(x;p)+(b−x)Jα−1,b−(x;p)] | (2.18) |
Remark 7. The inequality (2.18) is the correct version of [9,Corollary 3]. The inequality (2.17) provides refinement of inequality (2.18).
Corollary 9. For s=1 in (2.15), we get the following result:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β,l,ω,b−f)(x;p)≤||f||∞(1+m)2[(x−a)Jα−1,a+(x;p)+(b−x)Jβ−1,b−(x;p)]−[λ(x−ma)2(x−a)6mJα−1,a+(x;p)+λ(mb−x)2(b−x)6mJβ−1,b−(x;p)]. | (2.19) |
Corollary 10. For s=1,λ=0 in (2.15), we get the following result for (s,m)-convex function:
(ϵγ,δ,k,cμ,α,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β,l,ω,b−f)(x;p)≤||f||∞(1+m)2[(x−a)Jα−1,a+(x;p)+(b−x)Jβ−1,b−(x;p)]. | (2.20) |
Remark 8. The inequality (2.19) provides refinement of inequality (2.20).
Theorem 5. Let f∈L1[a,b],0≤a<b. If f is a differentiable and |f′| is a strongly (s,m)-convex function on [a,mb] with modulus λ>0, m∈(0,1], then for α,β≥1, the following fractional integral inequality for generalized integral operators (1.7) and (1.8) holds:
|(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(x;p)−(Jα−1,a+(x;p)f(a)+Jβ−1,b−(x;p)f(b))|≤(|f′(a)|+m|f′(xm)|s+1−λ(x−ma)26m)(x−a)Jα−1,a+(x;p)+(|f′(b)|+m|f′(xm)|s+1−λ(mb−x)26m)(b−x)Jβ−1,b−(x;p),x∈[a,b]. | (2.21) |
Proof. As x∈[a,b] and t∈[a,x), by using strongly (s,m)-convexity of |f′|, we have
|f′(t)|≤(x−tx−a)s|f′(a)|+m(t−ax−a)s|f′(xm)|−λ(x−t)(t−a)(x−ma)2m(x−a)2. | (2.22) |
From (2.22), one can have
f′(t)≤(x−tx−a)s|f′(a)|+m(t−ax−a)s|f′(xm)|−λ(x−t)(t−a)(x−ma)2m(x−a)2. | (2.23) |
The product of (2.2) and (2.23), gives the following inequality:
(x−t)α−1Eγ,δ,k,cμ,α,l(ω(x−t)μ;p)f′(t)dt≤(x−a)α−1Eγ,δ,k,cμ,α,l(ω(x−a)μ;p)((x−tx−a)s|f′(a)|+m(t−ax−a)s|f′(xm)|−λ(x−t)(t−a)(x−ma)2m(x−a)2). | (2.24) |
After integrating the above inequality over [a,x], we get
∫xa(x−t)α−1Eγ,δ,k,cμ,α,l(ω(x−t)μ;p)f′(t)dt≤(x−a)α−1Eγ,δ,k,cμ,α,l(ω(x−a)μ;p)(|f′(a)|(x−a)s∫xa(x−t)sdt+m|f′(xm)|∫xa(t−ax−a)sdt−λ(x−ma)2m(x−a)2∫xa(x−t)(t−a)dx)=(x−a)αEγ,δ,k,cμ,α,l(ω(x−a)μ;p)(|f′(a)|+m|f′(xm)|s+1−λ(x−ma)26m). | (2.25) |
To compute the integral in the left-hand side of (2.25) we put x−t=z, that is t=x−z, and use the derivative property (1.6) of the Mittag-Leffler function, to obtain
∫x−a0zα−1Eγ,δ,k,cμ,α,l(ωzμ;p)f′(x−z)dz=(x−a)α−1Eγ,δ,k,cμ,α,l(ω(x−a)μ;p)f(a)−∫x−a0zα−2Eγ,δ,k,cμ,α,l(ωzμ;p)f(x−z)dz. |
Now, putting x−z=t, in the second term of the right hand side of the above equation and then using (1.7), we get
∫x−a0zα−1Eγ,δ,k,cμ,α,l(ωzμ;p)f′(x−z)dz=(x−a)α−1Eγ,δ,k,cμ,α,l(ω(x−a)μ;p)f(a)−(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p). |
Therefore, (2.25) takes the following form:
(Jα−1,a+(x;p))f(a)−(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)≤(x−a)Jα−1,a+(x;p)(|f′(a)|+m|f′(xm)|s+1−λ(x−ma)26m). | (2.26) |
Also, from (2.22), one can have
f′(t)≥−((x−tx−a)s|f′(a)|+m(t−ax−a)s|f′(xm)|−λ(x−t)(t−a)(x−ma)2m(x−a)2). | (2.27) |
Following the same procedure as we did for (2.23), one can obtain:
(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)−Jα−1,a+(x;p)f(a)≤(x−a)Jα−1,a+(x;p)(|f′(a)|+m|f′(xm)|s+1−λ(x−ma)26m). | (2.28) |
From (2.26) and (2.28), we get
|(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)−Jα−1,a+(x;p)f(a)|≤(x−a)Jα−1,a+(x;p)(|f′(a)|+m|f′(xm)|s+1−λ(x−ma)26m). | (2.29) |
Now, we let x∈[a,b] and t∈(x,b]. Then by using strongly (s,m)-convexity of |f′| we have
|f′(t)|≤(t−xb−x)s|f′(b)|+m(b−tb−x)s|f′(xm)|−λ(t−x)(b−t)(mb−x)2m(b−x)2. | (2.30) |
On the same lines as we have done for (2.2), (2.23) and (2.27) one can get from (2.5) and (1.11), the following inequality:
|(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(x;p)−Jβ−1,b−(x;p)f(b)|≤(b−x)Jβ−1,b−(x;p)(|f′(b)|+m|f′(xm)|s+1−λ(mb−x)26m). | (2.31) |
From inequalities (2.29) and (2.31) via triangular inequality, (2.21) is obtained.
Theorem 6. Let f∈L1[a,b],0≤a<b. If f is a differentiable and |f′| is a (s,m)-convex function on [a,mb], m∈(0,1], then for α,β≥1, the following fractional integral inequality for generalized integral operators (1.7) and (1.8) holds:
|(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(x;p)−(Jα−1,a+(x;p)f(a)+Jβ−1,b−(x;p)f(b))|≤(|f′(a)|+m|f′(xm)|s+1)(x−a)Jα−1,a+(x;p)+(|f′(b)|+m|f′(xm)|s+1)(b−x)Jβ−1,b−(x;p),x∈[a,b]. | (2.32) |
Proof. For the (s,m)-convex function |f′| the inequality (2.29) holds as follows (by setting λ=0):
|(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)−Jα−1,a+(x;p)f(a)|≤(x−a)Jα−1,a+(x;p)(|f′(a)|+m|f′(xm)|s+1). | (2.33) |
Also, for the (s,m)-convex function |f′| the inequality (2.31) holds as follows (by setting λ=0):
|(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(x;p)−Jβ−1,b−(x;p)f(b)|≤(b−x)Jβ−1,b−(x;p)(|f′(b)|+m|f′(xm)|s+1). | (2.34) |
By adding (2.33) and (2.34), the inequality (2.32) can be obtained.
Remark 9. The inequality (2.32) is the correct version of [9,Theorem 3]. The inequality (2.21) provides refinement of inequality (2.32).
Corollary 11. If we put α=β in (2.21), then the following inequality is obtained:
|(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,α+1,l,ω,b−f)(x;p)−(Jα−1,a+(x;p)f(a)+Jα−1,b−(x;p)f(b))|≤(|f′(a)|+m|f′(xm)|s+1−λ(x−ma)26m)(x−a)Jα−1,a+(x;p)+(|f′(b)|+m|f′(xm)|s+1−λ(mb−x)26m)(b−x)Jα−1,b−(x;p),x∈[a,b]. | (2.35) |
Corollary 12. If we put α=β and λ=0 in (2.21), then the following inequality is obtained for (s,m)-convex function:
|(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,α+1,l,ω,b−f)(x;p)−(Jα−1,a+(x;p)f(a)+Jα−1,b−(x;p)f(b))|≤(|f′(a)|+m|f′(xm)|s+1)(x−a)Jα−1,a+(x;p)+(|f′(b)|+m|f′(xm)|s+1)(b−x)Jα−1,b−(x;p),x∈[a,b]. | (2.36) |
Remark 10. The inequality (2.36) is the correct version of [9,Corollary 5]. The inequality (2.35) provides refinement of inequality (2.36).
Corollary 13. If we put s=m=1 in (2.21), then the following inequality is obtained for strongly convex function:
|(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(x;p)−(Jα−1,a+(x;p)f(a)+Jβ−1,b−(x;p)f(b))|≤(|f′(a)|+|f′(x)|2−λ(x−a)26)(x−a)Jα−1,a+(x;p)+(|f′(b)|+|f′(x)|2−λ(b−x)26)(b−x)Jβ−1,b−(x;p),x∈[a,b]. | (2.37) |
Corollary 14. If we put s=m=1 and λ=0 in (2.21), then the following inequality is obtained for convex function which is proved in [12,Corollary 2]:
|(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(x;p)+(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(x;p)−(Jα−1,a+(x;p)f(a)+Jβ−1,b−(x;p)f(b))|≤(|f′(a)|+|f′(x)|2)(x−a)Jα−1,a+(x;p)+(|f′(b)|+|f′(x)|2)(b−x)Jβ−1,b−(x;p),x∈[a,b]. | (2.38) |
The following lemma is useful to prove the next result.
Lemma 2. Let f:[a,mb]→R be strongly (s,m)-convex function with modulus λ. If f(a+mb−xm)=f(x) and (s,m)∈[0,1]2, m≠0, then the following inequality holds:
f(a+mb2)≤(1+m)f(x)2s−λ14m(a+mb−x−mx)2. | (2.39) |
Proof. As f is strongly (s,m)-convex function, we have
f(a+mb2)≤12s(f((1−t)a+mtb)+mf(ta+m(1−t)bm))−λ4m(t(1+m)(a−mb)+mb−ma)2. | (2.40) |
Let x=a(1−t)+mtb. Then we have a+mb−x=ta+m(1−t)b.
f(a+mb2)≤f(x)2s+mf(a+mb−xm)2s−λ14m(a+mb−x−mx)2. | (2.41) |
Hence, by using f(a+mb−xm)=f(x), the inequality (2.39) can be obtained.
Theorem 7. Let f∈L1[a,b],0≤a<b. If f is a positive and strongly (s,m)-convex function on [a,mb] with modulus λ>0, m∈(0,1] and f(a+mb−xm)=f(x), then for α,β≥0, the following fractional integral inequality for generalized integral operators (1.7) and (1.8) holds:
2s1+m(f(a+mb2)(Jα+1,a+(b;p)+Jβ+1,b−(a;p))+λ4m(K1+K2))≤(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(b;p)+(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(a;p)≤(Jβ,b−(a;p)+Jα,a+(b;p))(b−a)(f(b)+mf(am)s+1−λ(mb−a)26m). | (2.42) |
where
K1=(b−a)β+2Jβ+1,b−(a;p)−2(1+m)(b−a)β+1Jβ+2,b−(a;p)+2(1+m)2Jβ+3,b−(a;p),K2=(b−a)α+2Jα+1,a+(b;p)−2(1+m)(b−a)α+1Jα+2,a+(b;p)+2(1+m)2Jα+3,a+(b;p). |
Proof. For x∈[a,b], we have
(x−a)βEγ,δ,k,cμ,β+1,l(ω(x−a)μ;p)≤(b−a)βEγ,δ,k,cμ,β+1,l(ω(b−a)μ;p),β>0. | (2.43) |
As f is strongly (s,m)-convex so for x∈[a,b], we have:
f(x)≤(x−ab−a)sf(b)+m(b−xb−a)sf(am)−λ(x−a)(b−x)(mb−a)2m(b−a)2. | (2.44) |
By multiplying (2.43) and (2.44) and then integrating over [a,b], we get
∫ba(x−a)βEγ,δ,k,cμ,β+1,l(ω(x−a)μ;p)f(x)dx≤(b−a)βEγ,δ,k,cμ,β+1,l(ω(b−a)μ;p)(f(b)(b−a)s∫ba(x−a)sdx+mf(am)∫ba(b−xb−a)sdx−λ(mb−a)2m(b−a)2∫ba(x−a)(b−x)dx). |
From which we have
(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(a;p)≤(b−a)β+1Eγ,δ,k,cμ,β+1,l(ω(b−a)μ;p)(f(b)+mf(am)s+1−λ(mb−a)26m), | (2.45) |
that is
(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(a;p)≤(b−a)Jβ,b−(a;p)(f(b)+mf(am)s+1−λ(mb−a)26m). | (2.46) |
Now, on the other hand for x∈[a,b], we have
(b−x)αEγ,δ,k,cμ,α+1,l(ω(b−x)μ;p)≤(b−a)αEγ,δ,k,cμ,α+1,l(ω(b−a)μ;p),α>0. | (2.47) |
By multiplying (2.44) and (2.47) and then integrating over [a,b], we get
∫ba(b−x)αEγ,δ,k,cμ,α+1,l(ω(b−x)μ;p)f(x)dx≤(b−a)αEγ,δ,k,cμ,α+1,l(ω(b−a)μ;p)(f(b)(b−a)s∫ba(x−a)sdx+mf(am)∫ba(b−xb−a)sdx−λ(mb−a)2m(b−a)2∫ba(x−a)(b−x)dx). |
From which we have
(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(b;p)≤(b−a)α+1Eγ,δ,k,cμ,α+1,l(ω(b−a)μ;p)(f(b)+mf(am)s+1−λ(mb−a)26m), | (2.48) |
that is
(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(b;p)≤(b−a)Jα,a+(b;p)(f(b)+mf(am)s+1−λ(mb−a)26m). | (2.49) |
By adding (2.46) and (2.49), the second inequality of (2.42) is obtained. To prove the first inequality; multiplying (2.39) with (x−a)βEγ,δ,k,cμ,β+1,l(ω(x−a)μ;p) and integrating over [a,b], we get
f(a+mb2)∫ba(x−a)βEγ,δ,k,cμ,β+1,l(ω(x−a)μ;p)dx≤1+m2s∫ba(x−a)βEγ,δ,k,cμ,β+1,l(ω(x−a)μ;p)f(x)dx−λ4m∫ba(x−a)βEγ,δ,k,cμ,β+1,l(ω(x−a)μ;p)(a+mb−x−mx)2dx. | (2.50) |
By using (1.8), (1.11) and integrating by parts, we get
f(a+mb2)Jβ+1,b−(a;p)≤1+m2s(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(a;p)−λ4m(ϵγ,δ,k,cμ,β+1,l,ω,b−(a+mb−x−mx)2)(a;p). |
The integral operator appearing in the last term of the right hand side is calculated as follows:
(ϵγ,δ,k,cμ,β+1,l,ω,b−(a+mb−x−mx)2)(a;p)=∞∑n=0βp(γ+nk,c−γ)β(γ,c−γ)(c)nkΓ(μn+β+1)1(l)nδ∫ba(x−a)β+μn(a+mb−x−mx)2dx=∞∑n=0βp(γ+nk,c−γ)β(γ,c−γ)(c)nkΓ(μn+β+1)1(l)nδ((b−a)β+μn+3β+μn+1−2(1+m)(b−a)β+μn+3(β+μn+1)(β+μn+2)+2(1+m)2(b−a)β+μn+2(β+μn+1)(β+μn+2)(β+μn+3))=(b−a)β+2Jβ+1,b−(a;p)−2(1+m)(b−a)β+1Jβ+2,b−(a;p)+2(1+m)2Jβ+3,b−(a;p) |
i.e
f(a+mb2)Jβ+1,b−(a;p)≤1+m2s(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(a;p)−λ4m((b−a)β+2×Jβ+1,b−(a;p)−2(1+m)(b−a)β+1Jβ+2,b−(a;p)+2(1+m)2Jβ+3,b−(a;p)). | (2.51) |
By multiplying (2.39) with (b−x)αEγ,δ,k,cμ,α+1,l(ω(b−x)μ;p) and integrating over [a,b], also using (1.7) and(1.12), we get
f(a+mb2)Jα+1,a+(b;p)≤1+m2s(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(b;p)−λ4m(ϵγ,δ,k,cμ,α+1,l,ω,a+(a+mb−x−mx)2)(b;p). | (2.52) |
The integral operator appearing in last term of right hand side is calculated as follows:
(ϵγ,δ,k,cμ,α+1,l,ω,a+(a+mb−x−mx)2)(b;p)=(b−a)α+2Jα+1,a+(b;p)−2(1+m)(b−a)α+1Jα+2,a+(b;p)+2(1+m)2Jα+3,a+(b;p). |
By using it in (2.52) then adding resulting inequality in (2.51), the first inequality of (2.42) can be obtained.
Theorem 8. Let f∈L1[a,b],0≤a<b. If f is a positive and (s,m)-convex function on [a,mb], m∈(0,1] and f(a+mb−xm)=f(x), then for α,β≥0, the following fractional integral inequality for generalized integral operators (1.7) and (1.8) holds:
2s1+m(f(a+mb2)(Jα+1,a+(b;p)+Jβ+1,b−(a;p)))≤(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(b;p)+(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(a;p)≤(Jβ,b−(a;p)+Jα,a+(b;p))(b−a)(f(b)+mf(am)s+1). | (2.53) |
Proof. For the (s,m)-convex function f the inequality (2.46) holds as follows (by setting λ=0):
(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(a;p)≤(b−a)Jβ,b−(a;p)(f(b)+mf(am)s+1). | (2.54) |
Also, for the (s,m)-convex function f the inequality (2.49) holds as follows (by setting λ=0):
(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(b;p)≤(b−a)Jα,a+(b;p)(f(b)+mf(am)s+1). | (2.55) |
By adding (2.54) and (2.53), the second inequality in (2.53) can be obtained. For first inequality using (2.51) for λ=0 we have
f(a+mb2)Jβ+1,b−(a;p)≤1+m2s(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(a;p). | (2.56) |
Also, from (2.52) for λ=0 we have
f(a+mb2)Jα+1,a+(b;p)≤1+m2s(ϵγ,δ,k,cμ,α+1,l,ω,a+f)(b;p). | (2.57) |
From inequalities (2.56) and (2.57), the first inequality in (2.53) can be obtained.
Remark 11. The inequality (2.53) is the correct version of [9,Theorem 4]. The inequality (2.42) provides refinement of inequality (2.53).
If s=m=1 in (2.42), then the following result obtained for strongly convex function.
Corollary 15. Let f:[a,b]⟶R, 0≤a<b, be a real valued function. If f is a positive, strongly convex and f(a+b−x)=f(x), then for α,β>0, the following fractional integral inequality holds:
f(a+b2)(Jα+1,a+(b;p)+Jβ+1,b−(a;p))+λ4((b−a)β+2Jβ+1,b−(a;p)−4(b−a)β+1Jβ+2,b−(a;p)+8Jβ+3,b−(a;p)+(b−a)α+2×Jα+1,a+(b;p)−4(b−a)α+1Jα+2,a+(b;p)+8Jα+3,a+(b;p))≤((ϵγ,δ,k,cμ,α+1,l,ω,a+f)(b;p)+(ϵγ,δ,k,cμ,β+1,l,ω,b−f)(a;p))≤(Jβ,b−(a;p)+Jα,a+(b;p))(b−a)(f(b)+f(a)2−λ(b−a)26). | (2.58) |
Remark 12. For λ=0 in (2.58) we get [12,Corollary 3]. Therefore (2.58) is the refinement of [12,Corollary 3].
The presented results provide the refinements of the bounds of generalized fractional integral operators given in (1.7) and (1.8), by applying the definition of strongly (s,m)-convex functions. The results for strongly convexity give improvements of previously known results determined in [11,12,13]. In particular cases results for several known integral operators defined in [17,18,19,21,22] can be deduced. The method used in this paper for obtaining refinements of bounds of fractional integral operators can be extended for refinements of inequalities already exist in literature.
The work of Josip Pečarić is supported by the Ministry of Education and Science of the Russian Federation (the Agreement No. 02.a03.21.0008).
It is declared that authors have no competing interests.
Ghulam Farid proposed the work with the consultation of Maja Andrić and Josip Pečarić, Maryam Saddiqa make calculations and verifications of results along with Chahn Yong Jung. Ultimately all authors have equal contributions. Further, all authors are agree for Chahn Yong Jung as corresponding author.
[1] |
Shrestha A, Fang H, Mei Z, et al. (2022) A survey on neuromorphic computing: models and hardware. IEEE Circ Syst Mag 22: 6-35. https://doi.org/10.1109/MCAS.2022.3166331 ![]() |
[2] |
Mead C, Ismail M (1989) Analog VLSI Implementation of Neural Systems. New York: Springer Science & Business Media. https://doi.org/10.1007/978-1-4613-1639-8 ![]() |
[3] | Frenkel CP, Bol D, Indiveri G Bottom-up and top-down neural processing systems design: Neuromorphic intelligence as the convergence of natural and artificial intelligence (2021) ArXiv Prepr. ArXiv210601288. |
[4] | Waqas M (2019) Integrated circuit models of bio-cellular networks [PhD thesis]. Karachi: NED University of Engineering and Technology. |
[5] |
Waqas M, Khurram M, Hasan SMR (2017) Bio-cellular processes modeling on silicon substrate: receptor–ligand binding and Michaelis Menten reaction. Analog Integr Circuits Signal Process 93: 329-340. https://doi.org/10.1007/s10470-017-1044-x ![]() |
[6] |
Woo SS, Kim J, Sarpeshkar R (2015) A cytomorphic chip for quantitative modeling of fundamental bio-molecular circuits. IEEE Trans Biomed Circuits Syst 9: 527-542. https://doi.org/10.1109/TBCAS.2015.2446431 ![]() |
[7] |
Mead CA, Mahowald MA (1988) A silicon model of early visual processing. Neural networks 1: 91-97. https://doi.org/10.1016/0893-6080(88)90024-X ![]() |
[8] |
Douglas R, Mahowald M, Mead C (1995) Neuromorphic analogue VLSI. Annu Rev Neurosci 18: 255-281. https://doi.org/10.1146/annurev.ne.18.030195.001351 ![]() |
[9] |
Schemmel J, Bruderle D, Meier K, et al. (2007) Modeling synaptic plasticity within networks of highly accelerated I&F neurons. 2007 IEEE International Symposium on Circuits and Systems (ISCAS) . USA: IEEE 3367-3370. https://doi.org/10.1109/ISCAS.2007.378289 ![]() |
[10] | Schemmel J, Billaudelle S, Dauer P, et al. (2021) Accelerated analog neuromorphic computing. Analog Circuits for Machine Learning, Current/Voltage/Temperature Sensors, and High-speed Communication . Cham: Springer International Publishing 83-102. https://doi.org/10.1007/978-3-030-91741-8_6 |
[11] |
Maher MAC, Deweerth SP, Mahowald MA, et al. (2002) Implementing neural architectures using analog VLSI circuits. IEEE Circ Syst Mag 36: 643-652. https://doi.org/10.1109/31.31311 ![]() |
[12] | Tanner JE (1986) Integrated Optical Motion Detector (VLSI, Mouse, Image-processing, Smart Sensors). California Institute of Technology. |
[13] |
Mahowald M, Delbrück T (1988) An analog VLSI implementation of the Marr-Poggio stereo correspondence algorithm. Neural Networks 1: 392. https://doi.org/10.1016/0893-6080(88)90418-2 ![]() |
[14] |
Allen T, Mead C, Faggin F, et al. (1988) Orientation-selective VLSI retina. Visual Communications and Image Processing'88: Third in a Series . SPIE 1040-1046. https://doi.org/10.1117/12.969056 ![]() |
[15] |
Hutchinson J, Koch C, Luo J, et al. (1988) Computing motion using analog and binary resistive networks. Computer 21: 52-63. https://doi.org/10.1109/2.31 ![]() |
[16] |
Lyon RF, Mead C (1988) An analog electronic cochlea. IEEE Trans Acoust Speech Signal Process 36: 1119-1134. https://doi.org/10.1109/29.1639 ![]() |
[17] |
Lazzaro J, Mead CA (1989) A silicon model of auditory localization. Neural Comput 1: 47-57. https://doi.org/10.1162/neco.1989.1.1.47 ![]() |
[18] |
Sarpeshkar R, Lyon RF, Mead CA (1996) An analog VLSI cochlea with new transconductance amplifiers and nonlinear gain control. 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96 . IEEE 292-296. https://doi.org/10.1109/ISCAS.1996.541591 ![]() |
[19] |
Andreou AG, Boahen KA, Pouliquen PO, et al. (1991) Current-mode subthreshold MOS circuits for analog VLSI neural systems. IEEE Trans Neural Networks 2: 205-213. https://doi.org/10.1109/72.80331 ![]() |
[20] |
Moore A, Allman J, Goodman RM (1991) A real-time neural system for color constancy. IEEE Trans Neural Networks 2: 237-247. https://doi.org/10.1109/72.80334 ![]() |
[21] |
Andreou AG, Boahen KA (1994) A 48,000 pixel, 590,000 transistor silicon retina in current-mode subthreshold CMOS. Proceedings of 1994 37th Midwest Symposium on Circuits and Systems . IEEE 97-102. https://doi.org/10.1109/MWSCAS.1994.519199 ![]() |
[22] | Boahen KA, Andreou A A contrast sensitive silicon retina with reciprocal synapses (1991). Available from: https://proceedings.neurips.cc/paper/1991/hash/e836d813fd184325132fca8edcdfb40e-Abstract.html |
[23] |
Asai T, Ohtani M, Yonezu H (1999) Analog integrated circuits for the Lotka-Volterra competitive neural networks. IEEE Trans Neural Networks 10: 1222-1231. https://doi.org/10.1109/72.788661 ![]() |
[24] |
Mandal S, Zhak SM, Sarpeshkar R (2009) A bio-inspired active radio-frequency silicon cochlea. IEEE J Solid-State Circuits 44: 1814-1828. https://doi.org/10.1109/JSSC.2009.2020465 ![]() |
[25] |
Houssein A, Papadimitriou KI, Drakakis EM (2015) A 1.26 µW cytomimetic IC emulating complex nonlinear mammalian cell cycle dynamics: synthesis, simulation and proof-of-concept measured results. IEEE Trans Biomed Circuits Syst 9: 543-554. https://doi.org/10.1109/TBCAS.2015.2450021 ![]() |
[26] |
Yang Z, Huang Y, Zhu J, et al. (2020) Analog circuit implementation of LIF and STDP models for spiking neural networks. Proceedings of the 2020 on Great Lakes Symposium on VLSI 2020: 469-474. https://doi.org/10.1145/3386263.3406940 ![]() |
[27] | Sharma S, Dhanoa JK (2020) Analog circuit implementation of a cortical neuron. 2020 5th IEEE International Conference on Recent Advances and Innovations in Engineering (ICRAIE) . IEEE 1-5. https://doi.org/10.1109/ICRAIE51050.2020.9358377 |
[28] |
Ronchini M, Zamani M, Farkhani H, et al. (2020) Tunable voltage-mode subthreshold CMOS neuron. 2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI) . IEEE 252-257. https://doi.org/10.1109/ISVLSI49217.2020.00053 ![]() |
[29] | Asghar MS, Arslan S, Kim HW (2021) Current multiplier based synapse and neuron circuits for compact SNN chip. 2021 IEEE International Symposium on Circuits and Systems (ISCAS) . IEEE 1-4. https://doi.org/10.1109/ISCAS51556.2021.9401173 |
[30] |
Oren I, Sinni RA, Daniel R (2023) Ultra-low power electronic circuits inspired by biological genetic processes. Proceedings of the 16th International Joint Conference on Biomedical Engineering Systems and Technologies . Portugal 150-156. https://doi.org/10.5220/0011707800003414 ![]() |
[31] |
Beahm DR, Deng Y, DeAngelo TM, et al. (2023) Drug cocktail formulation via circuit design. IEEE Trans Mol Biol Multi-Scale Commun 9: 28-48. https://doi.org/10.1109/TMBMC.2023.3246928 ![]() |
[32] | Beahm DR, Carvalho JPT, DeAngelo TM, et al. (2023) Lorenzian-chaos-like dynamics in viral-immune cytomorphic chips. 2023 IEEE Biomedical Circuits and Systems Conference (BioCAS) . IEEE 1-5. https://doi.org/10.1109/BioCAS58349.2023.10388975 |
[33] |
Waqas M, Ainuddin U, Iftikhar U (2022) An analog electronic circuit model for cAMP-dependent pathway-towards creation of Silicon life. AIMS Bioeng 9: 145-162. https://doi.org/10.3934/bioeng.2022011 ![]() |
[34] |
Waqas M, Khurram M, Hasan SMR (2020) Analog electronic circuits to model cooperativity in hill process. Mehran Univ Res J Eng Technol 39: 678-685. https://doi.org/10.22581/muet1982.2004.01 ![]() |
[35] |
Patra T, Chatterjee S, Barman Mandal S (2023) Cytomorphic electrical circuit modeling of tumor suppressor p53 protein pathway. Trans Indian Natl Acad Eng 8: 363-377. https://doi.org/10.1007/s41403-023-00403-0 ![]() |
[36] |
Hasan SMR (2008) A circuit model for bio-chemical cell signaling receptor protein and phosphorylation cascade pathway. 2008 International Conference on Microelectronics . IEEE 284-287. https://doi.org/10.1109/ICM.2008.5393542 ![]() |
[37] |
Hasan SMR (2008) A micro-sequenced CMOS model for cell signaling pathway using G-protein and phosphorylation cascade. 2008 15th International Conference on Mechatronics and Machine Vision in Practice . IEEE 57-62. https://doi.org/10.1109/MMVIP.2008.4749507 ![]() |
[38] |
Hasan SMR (2008) A novel mixed-signal integrated circuit model for DNA-protein regulatory genetic circuits and genetic state machines. IEEE Trans Circuits Syst Regul Pap 55: 1185-1196. https://doi.org/10.1109/TCSI.2008.925632 ![]() |
[39] |
Schemmel J, Brüderle D, Grübl A, et al. (2010) A wafer-scale neuromorphic hardware system for large-scale neural modeling. 2010 ieee international symposium on circuits and systems (iscas) . IEEE 1947-1950. https://doi.org/10.1109/ISCAS.2010.5536970 ![]() |
[40] |
Folowosele F, Harrison A, Cassidy A, et al. (2009) A switched capacitor implementation of the generalized linear integrate-and-fire neuron. 2009 IEEE International Symposium on Circuits and Systems (ISCAS) . IEEE 2149-2152. https://doi.org/10.1109/ISCAS.2009.5118221 ![]() |
[41] |
Folowosele F, Etienne-Cummings R, Hamilton TJ (2009) A CMOS switched capacitor implementation of the Mihalas-Niebur neuron. 2009 IEEE Biomedical Circuits and Systems Conference . IEEE 105-108. https://doi.org/10.1109/BIOCAS.2009.5372072 ![]() |
[42] |
Folowosele F, Hamilton TJ, Etienne-Cummings R (2011) Silicon modeling of the Mihalaş-Niebur neuron. IEEE Trans Neural Network 22: 1915-1927. https://doi.org/10.1109/TNN.2011.2167020 ![]() |
[43] |
Mandal S, Sarpeshkar R (2009) Circuit models of stochastic genetic networks. 2009 IEEE Biomedical Circuits and Systems Conference . IEEE 109-112. https://doi.org/10.1109/BIOCAS.2009.5372073 ![]() |
[44] |
Bamford SA, Murray AF, Willshaw DJ (2012) Spike-timing-dependent plasticity with weight dependence evoked from physical constraints. IEEE Trans Biomed Circuits Syst 6: 385-398. https://doi.org/10.1109/TBCAS.2012.2184285 ![]() |
[45] |
Alam S, Hasan SMR (2013) Integrated circuit modeling of biocellular post-transcription gene mechanisms regulated by microRNA and proteasome. IEEE Trans Circuits Syst Regul Pap 60: 2298-2310. https://doi.org/10.1109/TCSI.2013.2245451 ![]() |
[46] |
Benjamin BV, Gao P, McQuinn E, et al. (2014) Neurogrid: a mixed-analog-digital multichip system for large-scale neural simulations. Proc IEEE 102: 699-716. https://doi.org/10.1109/JPROC.2014.2313565 ![]() |
[47] |
Woo SS, Kim J, Sarpeshkar R (2018) A digitally programmable cytomorphic chip for simulation of arbitrary biochemical reaction networks. IEEE Trans Biomed Circuits Syst 12: 360-378. https://doi.org/10.1109/TBCAS.2017.2781253 ![]() |
[48] |
Kim J, Woo SS, Sarpeshkar R (2018) Fast and precise emulation of stochastic biochemical reaction networks with amplified thermal noise in silicon chips. IEEE Trans Biomed Circuits Syst 12: 379-389. https://doi.org/10.1109/TBCAS.2017.2786306 ![]() |
[49] |
Mayr C, Partzsch J, Noack M, et al. (2015) A biological-realtime neuromorphic system in 28 nm CMOS using low-leakage switched capacitor circuits. IEEE Trans Biomed Circuits Syst 10: 243-254. https://doi.org/10.1109/TBCAS.2014.2379294 ![]() |
[50] |
Rolls ET, Dempere-Marco L, Deco G (2013) Holding multiple items in short term memory: a neural mechanism. PloS one 8: e61078. https://doi.org/10.1371/journal.pone.0061078 ![]() |
[51] | Mayr CG, Partzsch J (2010) Rate and pulse based plasticity governed by local synaptic state variables. Front Synaptic Neurosci 2: 33. https://doi.org/10.3389/fnsyn.2010.00033 |
[52] | Noack M, Mayr C, Partzsch J, et al. (2012) A switched-capacitor implementation of short-term synaptic dynamics. Proceedings of the 19th International Conference Mixed Design of Integrated Circuits and Systems-MIXDES 2012 . IEEE 214-218. |
[53] | Noack M, Partzsch J, Mayr C, et al. (2010) Biology-derived synaptic dynamics and optimized system architecture for neuromorphic hardware. Proceedings of the 17th International Conference Mixed Design of Integrated Circuits and Systems-MIXDES 2010 . IEEE 219-224. |
[54] | Ellguth G, Mayr C, Henker S, et al. (2006) Design techniques for deep submicron CMOS/case study delta-sigma-modulator. Dresdner Arbeitstagung Schaltungs-und Systementwurf 1: 35-40. |
[55] |
Ishida K, Kanda K, Tamtrakarn A, et al. (2006) Managing subthreshold leakage in charge-based analog circuits with low-V/sub TH/transistors by analog T-switch (AT-switch) and super cut-off CMOS (SCCMOS). IEEE J Solid-State Circuits 41: 859-867. https://doi.org/10.1109/JSSC.2006.870761 ![]() |
[56] |
Aamir SA, Müller P, Kiene G, et al. (2018) A mixed-signal structured AdEx neuron for accelerated neuromorphic cores. IEEE Trans Biomed Circuits Syst 12: 1027-1037. https://doi.org/10.1109/TBCAS.2018.2848203 ![]() |
[57] |
Brette R, Gerstner W (2005) Adaptive exponential integrate-and-fire model as an effective description of neuronal activity. J Neurophysiol 94: 3637-3642. https://doi.org/10.1152/jn.00686.2005 ![]() |
[58] |
Touboul J, Brette R (2008) Dynamics and bifurcations of the adaptive exponential integrate-and-fire model. Biol Cybern 99: 319-334. https://doi.org/10.1007/s00422-008-0267-4 ![]() |
[59] | Jolivet R, Rauch A, Lüscher H R, et al. Integrate-and-fire models with adaptation are good enough (2005). Available from: https://proceedings.neurips.cc/paper/2005/hash/42a6845a557bef704ad8ac9cb4461d43-Abstract.html |
[60] |
Aamir SA, Stradmann Y, Müller P, et al. (2018) An accelerated LIF neuronal network array for a large-scale mixed-signal neuromorphic architecture. IEEE Trans Circuits Syst Regul Pap 65: 4299-4312. https://doi.org/10.1109/TCSI.2018.2840718 ![]() |
[61] |
Neckar A, Fok S, Benjamin BV, et al. (2018) Braindrop: a mixed-signal neuromorphic architecture with a dynamical systems-based programming model. Proc IEEE 107: 144-164. https://doi.org/10.1109/JPROC.2018.2881432 ![]() |
[62] |
Teo JJY, Weiss R, Sarpeshkar R (2019) An artificial tissue homeostasis circuit designed via analog circuit techniques. IEEE Trans Biomed Circuits Syst 13: 540-553. https://doi.org/10.1109/TBCAS.2019.2907074 ![]() |
[63] |
Beahm DR, Deng Y, Riley TG, et al. (2021) Cytomorphic electronic systems: a review and perspective. IEEE Nanotechnol Mag 15: 41-53. https://doi.org/10.1109/MNANO.2021.3113192 ![]() |
[64] |
Rubino A, Livanelioglu C, Qiao N, et al. (2020) Ultra-low-power FDSOI neural circuits for extreme-edge neuromorphic intelligence. IEEE Trans Circuits Syst Regul Pap 68: 45-56. https://doi.org/10.1109/TCSI.2020.3035575 ![]() |
[65] |
Jo Y, Mun K, Jeong Y, et al. (2022) A poisson process generator based on multiple thermal noise amplifiers for parallel stochastic simulation of biochemical reactions. Electronics 11: 1039. https://doi.org/10.3390/electronics11071039 ![]() |
[66] |
Zhao H, Sarpeshkar R, Mandal S (2022) A compact and power-efficient noise generator for stochastic simulations. IEEE Trans Circuits Syst Regul Pap 70: 3-16. https://doi.org/10.1109/TCSI.2022.3199561 ![]() |
[67] |
Wang M, Yan B, Hu J, et al. (2011) Simulation of large neuronal networks with biophysically accurate models on graphics processors. The 2011 International Joint Conference on Neural Networks . IEEE 3184-3193. https://doi.org/10.1109/IJCNN.2011.6033643 ![]() |
[68] |
Igarashi J, Shouno O, Fukai T, et al. (2011) Real-time simulation of a spiking neural network model of the basal ganglia circuitry using general purpose computing on graphics processing units. Neural Netw 24: 950-960. https://doi.org/10.1016/j.neunet.2011.06.008 ![]() |
[69] |
Yamaguchi Y, Azuma R, Konagaya A, et al. (2003) An approach for the high speed Monte Carlo simulation with FPGA-toward a whole cell simulation. 2003 46th Midwest Symposium on Circuits and Systems . IEEE 364-367. https://doi.org/10.1109/MWSCAS.2003.1562294 ![]() |
[70] |
Yamaguchi Y, Maruyama T, Azuma R, et al. (2007) Mesoscopic-level simulation of dynamics and interactions of biological molecules using monte carlo simulation. J VLSI Signal Process Syst Signal Image Video Technol 48: 287-299. https://doi.org/10.1007/s11265-007-0072-7 ![]() |
[71] |
Mak TST, Rachmuth G, Lam KP, et al. (2006) A component-based FPGA design framework for neuronal ion channel dynamics simulations. IEEE Trans Neural Syst Rehabil Eng 14: 410-418. https://doi.org/10.1109/TNSRE.2006.886727 ![]() |
[72] |
Graas EL, Brown EA, Lee RH (2004) An FPGA-based approach to high-speed simulation of conductance-based neuron models. Neuroinformatics 2: 417-435. https://doi.org/10.1385/NI:2:4:417 ![]() |
[73] | Mak TS, Rachmuth G, Lam KP, et al. (2005) Field programmable gate array implementation of neuronal ion channel dynamics. Conference Proceedings. 2nd International IEEE EMBS Conference on Neural Engineering . IEEE 144-148. https://doi.org/10.1109/CNE.2005.1419574 |
[74] | Weinstein RK, Lee RH (2005) Design of high performance physiologically-complex motoneuron models in fpgas. Conference Proceedings. 2nd International IEEE EMBS Conference on Neural Engineering . IEEE 526-528. https://doi.org/10.1109/CNE.2005.1419675 |
[75] |
Weinstein RK, Lee RH (2005) Architectures for high-performance FPGA implementations of neural models. J Neural Eng 3: 21. https://doi.org/10.1088/1741-2560/3/1/003 ![]() |
[76] |
Hasan SMR (2010) A digital cmos sequential circuit model for bio-cellular adaptive immune response pathway using phagolysosomic digestion: a digital phagocytosis engine. J Biomed Sci Eng 3: 470-475. https://doi.org/10.4236/jbise.2010.35065 ![]() |
[77] |
Weinstein RK, Reid MS, Lee RH (2007) Methodology and design flow for assisted neural-model implementations in FPGAs. IEEE Trans Neural Syst Rehabil Eng 15: 83-93. https://doi.org/10.1109/TNSRE.2007.891379 ![]() |
[78] |
Soleimani H, Ahmadi A, Bavandpour M (2012) Biologically inspired spiking neurons: piecewise linear models and digital implementation. IEEE Trans Circuits Syst Regul Pap 59: 2991-3004. https://doi.org/10.1109/TCSI.2012.2206463 ![]() |
[79] |
Cassidy AS, Georgiou J, Andreou AG (2013) Design of silicon brains in the nano-CMOS era: spiking neurons, learning synapses and neural architecture optimization. Neural Netw 45: 4-26. https://doi.org/10.1016/j.neunet.2013.05.011 ![]() |
[80] |
Nazari S, Faez K, Karami E, et al. (2014) A digital neurmorphic circuit for a simplified model of astrocyte dynamics. Neurosci Lett 582: 21-26. https://doi.org/10.1016/j.neulet.2014.07.055 ![]() |
[81] |
Smaragdos G, Isaza S, van Eijk MF, et al. (2014) FPGA-based biophysically-meaningful modeling of olivocerebellar neurons. Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays 2014: 89-98. https://doi.org/10.1145/2554688.2554790 ![]() |
[82] |
Moctezuma JC, McGeehan JP, Nunez-Yanez JL (2015) Biologically compatible neural networks with reconfigurable hardware. Microprocess Microsyst 39: 693-703. https://doi.org/10.1016/j.micpro.2015.09.003 ![]() |
[83] |
Pinsky PF, Rinzel J (1994) Intrinsic and network rhythmogenesis in a reduced Traub model for CA3 neurons. J Comput Neurosci 1: 39-60. https://doi.org/10.1007/BF00962717 ![]() |
[84] |
Yang S, Wang J, Zhao A, et al. (2016) A multi-FPGA embedded system for the emulation of modular small-world network with real time dynamics. 2016 12th World Congress on Intelligent Control and Automation (WCICA) . IEEE 2198-2203. https://doi.org/10.1109/WCICA.2016.7578502 ![]() |
[85] |
Deng B, Zhu Z, Yang S, et al. (2016) FPGA implementation of motifs-based neuronal network and synchronization analysis. Phys Stat Mech Its Appl 451: 388-402. https://doi.org/10.1016/j.physa.2016.01.052 ![]() |
[86] |
Rahimian E, Zabihi S, Amiri M, et al. (2017) Digital implementation of the two-compartmental Pinsky-Rinzel pyramidal neuron model. IEEE Trans Biomed Circuits Syst 12: 47-57. https://doi.org/10.1109/TBCAS.2017.2753541 ![]() |
[87] |
Yang S, Wang J, Li S, et al. (2015) Cost-efficient FPGA implementation of basal ganglia and their Parkinsonian analysis. Neural Netw 71: 62-75. https://doi.org/10.1016/j.neunet.2015.07.017 ![]() |
[88] |
Luo J, Coapes G, Mak T, et al. (2015) Real-time simulation of passage-of-time encoding in cerebellum using a scalable FPGA-based system. IEEE Trans Biomed Circuits Syst 10: 742-753. https://doi.org/10.1109/TBCAS.2015.2460232 ![]() |
[89] |
Akopyan F, Sawada J, Cassidy A, et al. (2015) Truenorth: Design and tool flow of a 65 mw 1 million neuron programmable neurosynaptic chip. IEEE Trans Comput-Aided Des Integr Circuits Syst 34: 1537-1557. https://doi.org/10.1109/TCAD.2015.2474396 ![]() |
[90] |
Soleimani H, Drakakis EM (2017) A compact synchronous cellular model of nonlinear calcium dynamics: Simulation and FPGA synthesis results. IEEE Trans Biomed Circuits Syst 11: 703-713. https://doi.org/10.1109/TBCAS.2016.2636183 ![]() |
[91] |
Davies M, Srinivasa N, Lin TH, et al. (2018) Loihi: a neuromorphic manycore processor with on-chip learning. Ieee Micro 38: 82-99. https://doi.org/10.1109/MM.2018.112130359 ![]() |
[92] |
Orchard G, Frady EP, Rubin DBD, et al. (2021) Efficient neuromorphic signal processing with loihi 2. 2021 IEEE Workshop on Signal Processing Systems (SiPS) . IEEE 254-259. https://doi.org/10.1109/SiPS52927.2021.00053 ![]() |
[93] |
Soleimani H, Drakakis EM (2018) A low-power digital IC emulating intracellular calcium dynamics. Int J Circuit Theory Appl 46: 1929-1939. https://doi.org/10.1002/cta.2514 ![]() |
[94] |
Faramarzi F, Azad F, Amiri M, et al. (2019) A neuromorphic digital circuit for neuronal information encoding using astrocytic calcium oscillations. Front Neurosci 13: 998. https://doi.org/10.3389/fnins.2019.00998 ![]() |
[95] |
Yang S, Wang J, Deng B, et al. (2018) Real-time neuromorphic system for large-scale conductance-based spiking neural networks. IEEE Trans Cybern 49: 2490-2503. https://doi.org/10.1109/TCYB.2018.2823730 ![]() |
[96] |
Yang S, Wang J, Lin Q, et al. (2018) Cost-efficient FPGA implementation of a biologically plausible dopamine neural network and its application. Neurocomputing 314: 394-408. https://doi.org/10.1016/j.neucom.2018.07.006 ![]() |
[97] |
Hao X, Yang S, Wang J, et al. (2019) Efficient implementation of cerebellar purkinje cell with the CORDIC algorithm on LaCSNN. Front Neurosci 13: 1078. https://doi.org/10.3389/fnins.2019.01078 ![]() |
[98] |
Hao J, Hao X, Wang J, et al. (2019) Behavior of a hippocampal spiking network and FPGA implementation. 2019 Chinese Control Conference (CCC) . IEEE 8433-8438. https://doi.org/10.23919/ChiCC.2019.8866461 ![]() |
[99] |
Yang S, Wang J, Deng B, et al. (2019) Digital implementation of the retinal spiking neural network under light stimulation. 2019 9th International IEEE/EMBS Conference on Neural Engineering (NER) . IEEE 542-545. https://doi.org/10.1109/NER.2019.8716932 ![]() |
[100] |
George R, Chiappalone M, Giugliano M, et al. (2020) Plasticity and adaptation in neuromorphic biohybrid systems. Iscience 23: 101589. https://doi.org/10.1016/j.isci.2020.101589 ![]() |
[101] |
Yang S, Deng B, Wang J, et al. (2019) Scalable digital neuromorphic architecture for large-scale biophysically meaningful neural network with multi-compartment neurons. IEEE Trans Neural Netw Learn Syst 31: 148-162. https://doi.org/10.1109/TNNLS.2019.2899936 ![]() |
[102] |
Kuang Z, Wang J, Yang S, et al. (2019) Digital implementation of the spiking neural network and its digit recognition. 2019 Chinese Control And Decision Conference (CCDC) . IEEE 3621-3625. https://doi.org/10.1109/CCDC.2019.8832952 ![]() |
[103] | Seyedbarhagh M, Ahmadi A, Ahmadi M (2021) Digital Realization for Ca2+ Waves Stimulated by the (mGlu5) Receptors. 2021 International Symposium on Signals, Circuits and Systems (ISSCS) . IEEE 1-4. https://doi.org/10.1109/ISSCS52333.2021.9497380 |
[104] |
Yang S, Wang J, Deng B, et al. (2021) Neuromorphic context-dependent learning framework with fault-tolerant spike routing. IEEE Trans Neural Netw Learn Syst 33: 7126-7140. https://doi.org/10.1109/TNNLS.2021.3084250 ![]() |
[105] |
Deng B, Fan Y, Wang J, et al. (2021) Reconstruction of a fully paralleled auditory spiking neural network and FPGA implementation. IEEE Trans Biomed Circuits Syst 15: 1320-1331. https://doi.org/10.1109/TBCAS.2021.3122549 ![]() |
[106] | Yang S, Kuang Z, Deng B, et al. (2021) Reconstruction of brain-inspired visual spiking neural network on bicoss. 2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer (ICFTIC) . IEEE 612-616. https://doi.org/10.1109/ICFTIC54370.2021.9647242 |
[107] |
Yang S, Wang J, Hao X, et al. (2022) BiCoSS: toward large-scale cognition brain with multigranular neuromorphic architecture. IEEE Trans Neural Netw Learn Syst 33: 2801-2815. https://doi.org/10.1109/TNNLS.2020.3045492 ![]() |
[108] |
Yang S, Wang J, Zhang N, et al. (2022) CerebelluMorphic: large-scale neuromorphic model and architecture for supervised motor learning. IEEE Trans Neural Netw Learn Syst 33: 4398-4412. https://doi.org/10.1109/TNNLS.2021.3057070 ![]() |
[109] |
Acharya M, Dey S, Chakrabarti A, et al. (2023) FPGA based library subset design for different biochemical reactions involved in a cell. Sādhanā 48: 264. https://doi.org/10.1007/s12046-023-02314-w ![]() |
[110] | Soma BM, Moumita A, Samik B, et al. (2021) FPGA implementation of different stochastic biochemical reactions involved in a cell. 2021 25th International Symposium on VLSI Design and Test (VDAT) . IEEE 1-4. https://doi.org/10.1109/VDAT53777.2021.9601094 |
[111] |
Daniel R, Rubens JR, Sarpeshkar R, et al. (2013) Synthetic analog computation in living cells. Nature 497: 619-623. https://doi.org/10.1038/nature12148 ![]() |
[112] | Sarpeshkar R (2014) Analog synthetic biology. Philos Trans R Soc Math Phys Eng Sci 372: 20130110. https://doi.org/10.1098/rsta.2013.0110 |
[113] |
Teo JJY, Woo SS, Sarpeshkar R (2015) Synthetic biology: a unifying view and review using analog circuits. IEEE Trans Biomed Circuits Syst 9: 453-474. https://doi.org/10.1109/TBCAS.2015.2461446 ![]() |
1. | Ghulam Farid, Yu-Ming Chu, Maja Andrić, Chahn Yong Jung, Josip Pečarić, Shin Min Kang, Xinguang Zhang, Refinements of Some Integral Inequalities for s , m -Convex Functions, 2020, 2020, 1563-5147, 1, 10.1155/2020/8878342 | |
2. | Yanliang Dong, Maryam Saddiqa, Saleem Ullah, Ghulam Farid, José Francisco Gómez Aguilar, Study of Fractional Integral Operators Containing Mittag-Leffler Functions via Strongly α , m -Convex Functions, 2021, 2021, 1563-5147, 1, 10.1155/2021/6693914 |