
Many current electronic medical record (EMR) sharing schemes that use proxy re-encryption and blockchain do not fully consider the potential threat of malicious node impersonation attacks. This oversight could lead to data leakage as attackers masquerade as legitimate users or proxy nodes during the sharing process. To deal with this problem, we propose an EMR sharing scheme based on proxy re-encryption and blockchain to protect against impersonation attacks. First, we prevent the potential threat of impersonation attacks by generating a shared temporary key and assigning tasks to multiple proxy nodes. Second, we use a random function to ensure that the selection of encrypted proxy nodes is fair. Third, we use a combination of blockchain and the InterPlanetary File System to solve the problem of insufficient storage capacity of shared processes and ensure the storage security of EMRs. Through the security proof, our scheme guarantees anti-impersonation, anti-collusion, and anti-chosen plaintext attack capability in the sharing process of EMRs. Additionally, experiments on the blockchain platform, namely Chain33, show that our scheme significantly increases efficiency.
Citation: Jiayuan Zhang, Rongxin Guo, Yifan Shi, Wanting Tang. An anti-impersonation attack electronic health record sharing scheme based on proxy re-encryption and blockchain[J]. Mathematical Biosciences and Engineering, 2024, 21(6): 6167-6189. doi: 10.3934/mbe.2024271
[1] | Liqin Liu, Chunrui Zhang . Dynamic properties of VDP-CPG model in rhythmic movement with delay. Mathematical Biosciences and Engineering, 2020, 17(4): 3190-3202. doi: 10.3934/mbe.2020181 |
[2] | Xiaoguang Liu, Yubo Wu, Meng Chen, Tie Liang, Fei Han, Xiuling Liu . A double-channel multiscale depthwise separable convolutional neural network for abnormal gait recognition. Mathematical Biosciences and Engineering, 2023, 20(5): 8049-8067. doi: 10.3934/mbe.2023349 |
[3] | Xiaoguang Liu, Meng Chen, Tie Liang, Cunguang Lou, Hongrui Wang, Xiuling Liu . A lightweight double-channel depthwise separable convolutional neural network for multimodal fusion gait recognition. Mathematical Biosciences and Engineering, 2022, 19(2): 1195-1212. doi: 10.3934/mbe.2022055 |
[4] | Zhangjie Wu, Minming Gu . A novel attention-guided ECA-CNN architecture for sEMG-based gait classification. Mathematical Biosciences and Engineering, 2023, 20(4): 7140-7153. doi: 10.3934/mbe.2023308 |
[5] | Wajid Aziz, Lal Hussain, Ishtiaq Rasool Khan, Jalal S. Alowibdi, Monagi H. Alkinani . Machine learning based classification of normal, slow and fast walking by extracting multimodal features from stride interval time series. Mathematical Biosciences and Engineering, 2021, 18(1): 495-517. doi: 10.3934/mbe.2021027 |
[6] | Ting Yao, Farong Gao, Qizhong Zhang, Yuliang Ma . Multi-feature gait recognition with DNN based on sEMG signals. Mathematical Biosciences and Engineering, 2021, 18(4): 3521-3542. doi: 10.3934/mbe.2021177 |
[7] | Yubo Sun, Yuanyuan Cheng, Yugen You, Yue Wang, Zhizhong Zhu, Yang Yu, Jianda Han, Jialing Wu, Ningbo Yu . A novel plantar pressure analysis method to signify gait dynamics in Parkinson's disease. Mathematical Biosciences and Engineering, 2023, 20(8): 13474-13490. doi: 10.3934/mbe.2023601 |
[8] | Leandro Donisi, Giuseppe Cesarelli, Pietro Balbi, Vincenzo Provitera, Bernardo Lanzillo, Armando Coccia, Giovanni D'Addio . Positive impact of short-term gait rehabilitation in Parkinson patients: a combined approach based on statistics and machine learning. Mathematical Biosciences and Engineering, 2021, 18(5): 6995-7009. doi: 10.3934/mbe.2021348 |
[9] | Xuecheng Weng, Chang Mei, Farong Gao, Xudong Wu, Qizhong Zhang, Guangyu Liu . A gait stability evaluation method based on wearable acceleration sensors. Mathematical Biosciences and Engineering, 2023, 20(11): 20002-20024. doi: 10.3934/mbe.2023886 |
[10] | Zhen Liu, Pande Zhang, Ming Yan, Yimin Xie, Guangzhi Huang . Additive manufacturing of specific ankle-foot orthoses for persons after stroke: A preliminary study based on gait analysis data. Mathematical Biosciences and Engineering, 2019, 16(6): 8134-8143. doi: 10.3934/mbe.2019410 |
Many current electronic medical record (EMR) sharing schemes that use proxy re-encryption and blockchain do not fully consider the potential threat of malicious node impersonation attacks. This oversight could lead to data leakage as attackers masquerade as legitimate users or proxy nodes during the sharing process. To deal with this problem, we propose an EMR sharing scheme based on proxy re-encryption and blockchain to protect against impersonation attacks. First, we prevent the potential threat of impersonation attacks by generating a shared temporary key and assigning tasks to multiple proxy nodes. Second, we use a random function to ensure that the selection of encrypted proxy nodes is fair. Third, we use a combination of blockchain and the InterPlanetary File System to solve the problem of insufficient storage capacity of shared processes and ensure the storage security of EMRs. Through the security proof, our scheme guarantees anti-impersonation, anti-collusion, and anti-chosen plaintext attack capability in the sharing process of EMRs. Additionally, experiments on the blockchain platform, namely Chain33, show that our scheme significantly increases efficiency.
Animal gaits are a rhythmic behavior controlled by central pattern generator (CPG), which generates rhythmic signals to the muscle groups of animals, controls their own rhythmic movements, and produces various gaits in animal locomotion. From a biological perspective, CPG is a distributed vibration network composed of neurons in the central nervous system of animals. Human beings get inspiration from the organizational structure, movement mechanism, and behavior of biological bodies, and constantly learn and imitate the characteristics and functions of certain organisms, thereby improving their adaptability to nature and making contributions to the development of science and technology. Therefore, biologists and mathematicians have established some CPG biological and mathematical models by imitating the neural network patterns of animal CPG. Golubitsky et al. [1] has investigated a composition pattern of CPG neurons in quadrupedal gaits and obtained a new primary gait ''jump''. The animal gait network proposed by Buono et al. [2] can generate six primary gaits: walk, trot, pace, bound, pronk, and jump. Furthermore, based on the primary gait, the phase patterns of transverse gallop and rotary gallop in quadruped secondary gait were provided [3]. The present authors have studied CPG neural network models for the primary gait of quadrupeds [4,5].
Animal gait CPG neural networks have wide applications. Inspired by animal movements, in the gait planning of biomimetic robots, a CPG model is set for the robot system by imitating the CPG network of animals in nature. By utilizing the coupling between oscillators in the CPG model, periodic oscillation signals are generated to achieve stable rhythmic gait behavior of the robot. For instance, the CPG network can be used to construct gait networks for hexapod robots gait networks [6,7] and quadruped robots gait networks [8,9,10]. In article [11], a method for designing a robot system controller was proposed using a CPG control network, and in article [12], the robot gait was produced based on animal gait. In [13], a CPG animation model was constructed using the CPG network system.
In quadruped mammals, goats have smaller bodies and stronger bones in their limbs, and their hindlimbs are stronger than their forelimbs specifically. Goats have a brisk and agile gait when walking, and they can walk freely, flexibly, and quickly on the ground, slopes, steep walls and uneven surfaces. Moreover, they can also walk long distances and have good road adaptability and obstacle crossing ability. Goats are less restricted by the environment and, therefore, goat gaits have certain research value. In literature [14], the author used goats as the research object and conducted kinematic analysis on the multimode gait of goats on conventional and unconventional roads. In work [15], the author analyzed the gait of goats from the perspective of structural bionics. At present, there is little research on mathematical models of goat gaits to our knowledge. In this paper, we deal with this problem and propose the CPG neural network models of goat gaits from a mathematical perspective. We study the following model given in [5]
{˙x1(t)=ax1(t)+btanh(x1(t))+dtanh(x7(t))+ctanh(x2(t−τ)),˙x2(t)=ax2(t)+btanh(x2(t))+dtanh(x8(t))+ctanh(x1(t−τ)),˙x3(t)=ax3(t)+btanh(x3(t))+dtanh(x1(t))+ctanh(x4(t−τ)),˙x4(t)=ax4(t)+btanh(x4(t))+dtanh(x2(t))+ctanh(x3(t−τ)),˙x5(t)=ax5(t)+btanh(x5(t))+dtanh(x3(t))+ctanh(x6(t−τ)),˙x6(t)=ax6(t)+btanh(x6(t))+dtanh(x4(t))+ctanh(x5(t−τ)),˙x7(t)=ax7(t)+btanh(x7(t))+dtanh(x5(t))+ctanh(x8(t−τ)),˙x8(t)=ax8(t)+btanh(x8(t))+dtanh(x6(t))+ctanh(x7(t−τ)), | (1.1) |
where a,b,c,d are constants and τ≥0 is the time delay. The state variable (x1(t),x2(t),⋯,x8(t)) is the output signal from the CPG to the legs, where x1(t) and x7(t) are the output signals to the left hind leg, x3(t) and x5(t) are the output signals to the left fore leg, x2(t) and x8(t) are the output signals to the right hind leg, and x4(t) and x6(t) are the output signals to the right fore leg. The network diagram of system (1.1) is shown in Figure 1.
In reference [5], the authors give the conditions (H1):|c|>|a+b+d|if(a+b)d>0, (H2):|c|>|a+b−d|if(a+b)d<0, and critical values τkj(j=1,2,3,4,5,6,7,8) (see Table 1 in [5]) for the Hopf bifurcations of the model (1.1) at the zero equilibrium.
The initial value | Iterations | error f | Numerical solution |
6.1 | 11 | 11.6591 | 6.4300 |
6.3 | 9 | 11.6591 | 6.4300 |
6.5 | 5 | 11.6591 | 6.4300 |
7.2 | 9 | 11.6591 | 6.4300 |
The main objective of this paper is to provide further the bifurcation direction and stability conditions of the bifurcating periodic solutions of the model (1.1). Based on the model (1.1), the CPG neural network models of goat gaits are given by using the parameter inversion algorithm.
In this section, we use the method in reference [16] to calculate the normal forms of Hopf bifurcations on the center manifold of the Eq (1.1) at the zero equilibrium. Normalizing the delay τ by the time-scaling t↦tτ, Eq (1.1) can be rewritten as a functional differential equation in C=C([−1,0],R8),
{˙u1(t)=τ(au1(t)+btanh(u1(t))+dtanh(u7(t))+ctanh(u2(t−1))),˙u2(t)=τ(au2(t)+btanh(u2(t))+dtanh(u8(t))+ctanh(u1(t−1))),˙u3(t)=τ(au3(t)+btanh(u3(t))+dtanh(u1(t))+ctanh(u4(t−1))),˙u4(t)=τ(au4(t)+btanh(u4(t))+dtanh(u2(t))+ctanh(u3(t−1))),˙u5(t)=τ(au5(t)+btanh(u5(t))+dtanh(u3(t))+ctanh(u6(t−1))),˙u6(t)=τ(au6(t)+btanh(u6(t))+dtanh(u4(t))+ctanh(u5(t−1))),˙u7(t)=τ(au7(t)+btanh(u7(t))+dtanh(u5(t))+ctanh(u8(t−1))),˙u8(t)=τ(au8(t)+btanh(u8(t))+dtanh(u6(t))+ctanh(u7(t−1))). | (2.1) |
Denoting U=(u1,u2,u3,u4,u5,u6,u7,u8)T, Ut=U(t+θ),Ut∈C, where θ∈[−1,0]. Let τ=τ02j+μ(j=1,2,3,4), for μ is a bifurcation parameter, then Eq (2.1) can further be written as the following form:
˙U(t)=L(0)Ut+F(Ut,μ), | (2.2) |
where
F(Ut,μ)=(L(μ)−L(0))Ut+F0(Ut,μ), |
L(μ)φ=(τ02j+μ)((a+b)(φ1(0))+dφ7(0)+cφ2(−1)(a+b)(φ2(0))+dφ8(0)+cφ1(−1)(a+b)(φ3(0))+dφ1(0)+cφ4(−1)(a+b)(φ4(0))+dφ2(0)+cφ3(−1)(a+b)(φ5(0))+dφ3(0)+cφ6(−1)(a+b)(φ6(0))+dφ4(0)+cφ5(−1)(a+b)(φ7(0))+dφ5(0)+cφ8(−1)(a+b)(φ8(0))+dφ6(0)+cφ7(−1)), |
and
F0(Ut,μ)=(τ02j+μ)(−b3φ31(0)−d3φ37(0)−c3φ32(−1)−b3φ32(0)−d3φ38(0)−c3φ31(−1)−b3φ33(0)−d3φ31(0)−c3φ34(−1)−b3φ34(0)−d3φ32(0)−c3φ33(−1)−b3φ35(0)−d3φ33(0)−c3φ36(−1)−b3φ36(0)−d3φ34(0)−c3φ35(−1)−b3φ37(0)−d3φ35(0)−c3φ38(−1)−b3φ38(0)−d3φ36(0)−c3φ37(−1))+h.o.t., |
where φ=(φ1,φ2,φ3,φ4,φ5,φ6,φ7,φ8)T∈C. By the Riesz representation theorem, there is η(θ,μ), such that L(μ)φ=∫0−1dη(θ,μ)φ(θ), and we select η(θ,μ)=(τ02j+μ)(Aδ(θ)+Bδ(θ+1)), where
A=(B000D0D0B0000D0B0000D0B0),B=(C00000C00000C00000C0), |
B0=(a+b00a+b),D0=(d00d),C0=(0cc0). |
The Taylor expansion of F(Ut,μ) is denoted as
F(Ut,μ)=12!F2(φ,μ)+13!F3(φ,μ)+h.o.t. |
with
F2(φ,μ)=μ((a+b)(φ1(0))+dφ7(0)+cφ2(−1)(a+b)(φ2(0))+dφ8(0)+cφ1(−1)(a+b)(φ3(0))+dφ1(0)+cφ4(−1)(a+b)(φ4(0))+dφ2(0)+cφ3(−1)(a+b)(φ5(0))+dφ3(0)+cφ6(−1)(a+b)(φ6(0))+dφ4(0)+cφ5(−1)(a+b)(φ7(0))+dφ5(0)+cφ8(−1)(a+b)(φ8(0))+dφ6(0)+cφ7(−1)), |
F3(φ,μ)=τ02j(−b3φ31(0)−d3φ37(0)−c3φ32(−1)−b3φ32(0)−d3φ38(0)−c3φ31(−1)−b3φ33(0)−d3φ31(0)−c3φ34(−1)−b3φ34(0)−d3φ32(0)−c3φ33(−1)−b3φ35(0)−d3φ33(0)−c3φ36(−1)−b3φ36(0)−d3φ34(0)−c3φ35(−1)−b3φ37(0)−d3φ35(0)−c3φ38(−1)−b3φ38(0)−d3φ36(0)−c3φ37(−1)). |
Expanding space C to BC={φ:[−1,0]→C8|φ is continuous on [-1, 0) and limθ→0−φ(θ)∈C8}. The element of BC can be expressed as υ=φ+X0ν,φ∈C,ν∈C8, and
X0(θ)={0,−1≤θ<0I,θ=0 |
with I as the identity matrix.
For ϕ∈C1=C1([−1,0],C8), we define
A0ϕ={˙ϕ,−1≤θ<0∫0−1dη(θ,0)ϕ(θ),θ=0. | (2.3) |
For ψ∈C1∗=C1([−1,0],C8∗), the adjoint operator of A0 is
A∗0ψ={−˙ψ,−1≤s<0,∫0−1ψ(−s)dη(s,0),s=0, | (2.4) |
and a bilinear inner product is the following:
<ψ,ϕ>=ˉψ(0)ϕ(0)−∫0−1∫θ0ˉψ(ξ−θ)dη(θ,0)ϕ(ξ)dξ. | (2.5) |
Let Φ(θ) and Ψ(s) be the eigenvectors corresponding to the eigenvalues iωjτ02j and −iωjτ02j, respectively. Note that Φ(θ)=(ϕ(θ),ˉϕ(θ)), Ψ(s)=(ˉψ(s),ψ(s))T with ˙Φ=Φ(θ)J,˙Ψ(s)=−JΨ(s),<Ψ(s),Φ(θ)>=I, and J=diag(iωjτ02j,−iωjτ02j). It can be easily calculated from (2.3) and (2.4) that
ϕ(θ)=(1,−1,1,−1,1,−1,1,−1)Teiωjτ02jθ, |
ψ(s)=D(−1,1,−1,1,−1,1,−1,1)eiωjτ02js. |
Hence, we obtain D=18(−1+ceiωjτ02j) from <ϕ(s),ϕ(θ)>=1.
Let P be a vector space expanded by ϕ(θ) and ˉϕ(θ), P∗ be a vector space expanded by ϕ(s) and ˉϕ(s), then C can be decomposed as C=P⊕Q, where Q={ϕ∈C:<ψ,ϕ>=0,∀ψ∈P∗}. Define mapping Π:BC→P as Π(φ+X0ν)=Φ[(ψ,ϕ)+ψ(0)ν] and Q1=kerπ⋂C1.
Using the decomposition of U=Φx+y with x=(x1,x2)T,y=(y1,y2,y3,y4,y5,y6,y7,y8)T, system (2.1) can be decomposed as
{˙x=Jx+Ψ(0)F(Φx+y,μ),˙y=AQ1y+(I−Π)X0F(Φx+y,μ). | (2.6) |
We have the Taylor expansion as follows:
{˙x=Jx+12!f12(x,y,μ)+13!f13(x,y,μ)+h.o.t.,˙y=AQ1y+12!f22(x,y,μ)+13!f23(x,y,μ)+h.o.t., | (2.7) |
where
f12(x,y,μ)=Ψ(0)F2(Φx+y,μ),f13(x,y,μ)=Ψ(0)F3(Φx+y,μ), |
f22(x,y,μ)=(I−Π)X0F2(Φx+y,μ),f23(x,y,μ)=(I−Π)X0F3(Φx+y,μ). |
Normal form of Eq (2.7) on the center manifold at the origin is given by
˙x=Jx+12!g12(x,0,μ)+13!g13(x,0,μ)+h.o.t., | (2.8) |
where
g12(x,0,μ)=Projker(M12)f12(x,0,μ), |
g13(x,0,μ)=Projker(M13)˜f13(x,0,μ), |
ker(M12)=span{(μx10),(0μx2)}, |
ker(M13)=span{(μ2x10),(x21x20),(0μ2x2),(0x1x22)}, |
˜f13(x,0,μ)=f13(x,0,μ)+32[(Dxf12)U12(x,μ)+[(Dyf12)h]U22(x,μ), |
U12(x,μ)μ=0=(M12)−1ProjIm(M12)f12(x,0,0),M22U22(x,μ)=f22(x,0,μ). |
After calculating, we obtain
12!g12(x,0,μ)=(ˉa1μx1a1μx2), |
where a1=8D(−a−b−d+ceiωjτ02j).
In the following, we can compute the cubic terms 13!g13(x,0,μ) as
13!g13(x,0,μ)=13!Projker(M13)˜f13(x,0,μ)=13!ProjS˜f13(x,0,0)+O(μ2|x|)=13!ProjSf13(x,0,μ)+14ProjS[(Dxf12)(x,0,0)U12(x,0)+(Dyf12)(x,0,0)U22(x,0)]+O(μ2|x|), |
with
S=span{(x21x20),(0x1x22)}. |
Since f12(x,0,0)=(0,0)T,f12(x,y,0)=(0,0)T, we obtain U12(x,0)=(0,0)T,(Dyf12)(x,0,0)=(0,0)T,
thus
13!g13(x,0,μ)=13!ProjSf13(x,0,0)+O(μ2|x|)=(ˉa2x21x2a2x1x22)+O(μ2|x|), |
where a2=−8τ02jD(−b+ceiωiτ02j−d).
Then, the normal form (2.8) can be written as
{˙x1=iωiτ02jx1+ˉa1μx1+ˉa2x21x2+h.o.t.,˙x2=−iωiτ02jx2+a1μx2+a2x1x22+h.o.t.. | (2.9) |
By transforming the variables x1=w1+iw2, x2=w1−iw2 and w1=rcosξ, w2=rsinξ, Eq (2.9) can be written as
{˙r=k1μr+k2r3+h.o.t,˙ξ=−ωjτ02j+h.o.t, | (2.10) |
where k1=Re(a1),k2=Re(a2).
According to [16], we obtain the following results.
Theorem 2.1 When k2≠0, then
1) If k2<0, then the bifurcation periodic solutions of system (1.1) near τ02j(j=1,2,3,4) are stable; if k2>0, then the bifurcation periodic solutions of system (1.1) are unstable.
2) If k1k2<0, then Hopf bifurcations are supercritical; if k1k2>0, then Hopf bifurcations are subcritical.
In this section, we will provide two numerical examples to validate our theoretical analysis.
Example 1. We consider system (1.1) with a=−4.5,b=1,c=6.5,d=−2, which satisfies the conditions (H1). Using the algorithm in [5], we obtain ω2=7.4772,ω3=6.325,τ04=0.2861,τ06=0.2852. From ω2=7.4772,τ04=0.2861, we get k1=Re(a1)=0.4179>0, k2=Re(a2)=−0.2349<0,k1k2=−0.0982<0. According to Theorem 2.1, the bifurcation periodic solution of system (1.1) is stable and supercritical at τ=0.4>τ04=0.2861, as shown in Figure 2. This periodic solution corresponds to the walking gait of quadrupeds.
From ω3=6.325,τ06=0.2852, we know that k1=Re(a1)=0.6486,k2=Re(a2)=−0.2544<0,k1k2=−0.1650<0. According to Theorem 2.1, the bifurcation periodic solution of system (1.1) is stable and supercritical at τ=0.4>τ06=0.2852 (see Figure 3), and this periodic solution corresponds to the trotting gait of quadrupeds.
Example 2. In system (1.1), we select parameters a=−3,b=0.1,c=4,d=1, which satisfies (H2). By calculation, it is obtained that w1=3.5119,τ02=0.5869,k1=Re(a1)=0.5957>0, k2=Re(a2)=−0.5951<0,k1k2=−0.3545<0. From Theorem 2.1, the bifurcation periodic solution of system (1.1) is stable and supercritical at τ=0.7>τ02=0.5869, as shown in Figure 4. This periodic solution corresponds to the pacing gait of quadrupeds.
In this section. we employ model (1.1) as the inversion model, and use the trust region algorithm [17] to give the goat's diagonal trotting model on flat ground and the walking gait model on the ground with a slope of 18 degrees.
By analyzing the spatiotemporal characteristic diagram of the goat's diagonal trot gait (Figure 3.2(b) in [14]), we obtain that the two legs on the diagonal of the goat are mostly in a supported or airborne state when trotting diagonally on flat ground, and the four legs airborne and single legs support the states only account for a small part of the whole gait cycle and can be ignored. So, we assume that the support state and airborne state of the two legs on the diagonal each account for half of the whole cycle. In the diagonal trotting joint angle change curve of goats (Figures 3 and 4 in [14]), an average of 20 points are extracted from the pastern joint angles and wrist joint angles curves of the two front legs, as well as the toe joint angle and tarsal joint angle curves of the two hind legs, respectively (within one cycle). Next, we translate these points to the vicinity of the origin and convert them into radians as the true values ˆxi(tl)(i=1,2,⋯,8;l=1,2,⋯,20) of CPG oscillators of the corresponding legs of goats. Finally, we averagely select 20 values of periodic solutions x1(t) to x8(t) within one cycle of model (1.1)(a=−2,b=1,d=−2,τ=0.25) as the theoretical values xi(tl,c)(i=1,2,⋯,8;l=1,2,⋯,20) of CPG oscillators, respectively. Using the trust region algorithm [17], the parameter c=6.4300 is obtained, as shown in Table 1. The error in Table 1 is f=128∑i=120∑l=1(ˆxi(tl)−xi(tl,c))2.
Next, in order to better describe the effect of the simulation, we calculated the synchronization error between the theoretical value and the real value. That is, we calculated the point-by-point difference between the 20 pairs of theoretical values and true values of the corresponding joint angles of each leg, as shown in Figures 5 and 6.
As can be seen from Figures 5 and 6, the synchronization error ranges of the pastern joint angle and wrist joint angle of the front leg are [-0.5, 0.6] and [-0.85, 0.08], and the synchronization error ranges of the toe joint angle and the tarsal joint angle of the back leg are [-0.4, 0.95] and [-0.6, 0.95].
For parameters a=−2,b=1,c=6.4300,d=−2,τ=0.25, the critical value τ06=0.2227 of trotting gait and k1=Re(a1)=1>0,k2=Re(a2)=−0.2227<0,k1k2=−0.2227<0 are calculated. According to Theorem 2.1, the bifurcation periodic solution of system (1.1) is stable and supercritical at τ=0.25>τ06=0.2227 (see Figure 7).
Therefore, the model (1.1) (a=−2,b=1,c=6.4300,d=−2,τ=0.25) provides a reference model for the goat's diagonal trot gait on flat ground.
According to the analysis of the spatiotemporal state diagram of each leg of a goat walking on an 18 degree slope (Figures 3–8 in [15]), it is found that during one gait cycle, each leg of the goat takes turns to be suspended while the other three legs are in a supported state, and they took almost the same amount of time. Assuming that within a gait cycle, each leg of the goat is in a suspended state while the other three legs are in a supported state for the same amount of time.
Similar to Section 4.1, we take 20 data from the joint angle curve of each leg in the Figures 3–9 [15] (the curve of the wrist joint angle α of each leg and the curve of the angle β between the thighs of each leg and the forward direction) as the true values ˆxi(tl)(i=1,2,⋯,8;l=1,2,⋯,20) of CPG oscillators, then we select 20 values (within one cycle) from the periodic solutions x1(t) to x8(t) of the model (1.1)(a=−2,b=1,c=6.5,d=−2) as the theoretical values xi(tl,τ)(i=1,2,⋯,8;l=1,2,⋯,20) of CPG oscillators, and the parameter τ=0.2450 is obtained by the trust region algorithm, as shown in Table 2. The precision ε in Table 2 is the degree of accuracy that the gradient of the objective function f=128∑i=120∑l=1(ˆxi(tl)−xi(tl,τ))2 needs to achieve when the objective function f reaches its optimal solution in the trust region algorithm. Similar to Section 4.1, synchronization error diagrams between theoretical values and true values are shown in Figures 8 and 9.
The initial value of τ | Iterations | precision ε | Numerical solution |
0.25 | 5 | 1.85 | 0.2450 |
0.28 | 8 | 1.85 | 0.2450 |
0.39 | 16 | 1.85 | 0.2450 |
0.4 | 13 | 1.85 | 0.2450 |
From the two figures, we see that the synchronization error ranges of the wrist angle of left hind leg, right hind leg, left front leg, and right front leg are [-1.2, 1.2], [-0.9, 0.95], [-1.2, 0.9], and [-0.9, 1.45]. The synchronization error ranges of the angle between the forward direction of thigh movement and the left hind leg, right hind leg, left front leg, and right front leg are, respectively, [-0.95, 0.9], [-1.45, 0.6], [-1.3, 1.5], and [-1.6, -0.6].
For parameters a=−2,b=1,c=6.5,d=−2, the critical values τ04=0.2048 of the walking gait and k1=Re(a1)=0.8232>0,k2=Re(a2)=−0.1867<0,k1k2=−0.1537<0 are calculated. According to Theorem 2.1, the bifurcation periodic solution of system (1.1) is stable and supercritical at τ=0.2450>τ04=0.2048, as shown in Figure 10.
Figure 10 indicates that the periodic solution obtained by the system (1.1) corresponds to a stable walking gait when the parameters a=−2,b=1,c=6.5,d=−2,τ=0.2450. Therefore, model (1.1)(a=−2,b=1,c=6.5,d=−2) provides a reference model for the CPG walking gait model of goats walking uphill on an 18 degree slope when the time delay parameter τ=0.2450.
We employed the normal form theory according to Faria and Magalh˜aes to derive the normal form for Hopf bifurcation of a quadruped gait CPG model on the center manifold, and the bifurcation direction and stability of bifurcating periodic solution at the origin are analyzed. The quadruped gait CPG model was used as an inversion model, and goat gait models were constructed using the trust region inversion algorithm. The feasibility of using the CPG model as a goat gait model was verified through simulations.
The neural network model presented in this article can predict the goat gait to contribute to artificial intelligence. The weakness of this paper is that the synchronization errors of some points are slightly larger when using our mathematical model to simulate goat gait, especially walking gait. We will modify this model further in the future.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This research is supported by the Fundamental Research Funds for the Central Universities, (No.2572022DJ08).
The authors declare there is no conflict of interest.
[1] |
A. ElShafee, W. El-Shafai, Design and analysis of data link impersonation attack for wired LAN application layer services, J. Amb. Intell. Human. Comput., 14 (2023), 13465–13488. https://doi.org/10.1007/s12652-022-03800-5 doi: 10.1007/s12652-022-03800-5
![]() |
[2] |
K. Yang, Y. Shi, Z. Yu, Q. Yang, A. Sangaiah, H. Zeng, Stacked one-class broad learning system for intrusion detection in industry 4.0, IEEE Trans. Industr. Inform., 19 (2023), 251–260. https://doi.org/10.1109/TII.2022.3157727 doi: 10.1109/TII.2022.3157727
![]() |
[3] |
K. Yang, Z. Yu, C. Chen, W. Cao, H. Wong, J. You, et al., Progressive hybrid classifier ensemble for imbalanced data, IEEE Trans. Syst. Man Cybern. Syst., 52 (2022), 2464–2478. https://doi.org/10.1109/TSMC.2021.3051138 doi: 10.1109/TSMC.2021.3051138
![]() |
[4] |
L. Guo, W. Gao, Y. Cao, X. Lai, Research on medical data security sharing scheme based on homomorphic encryption, Math. Biosci. Eng., 20 (2023), 2261–2279. https://doi.org/10.3934/mbe.2023106 doi: 10.3934/mbe.2023106
![]() |
[5] |
Y. Lu, D. Zhao, An anonymous SIP authenticated key agreement protocol based on elliptic curve cryptography, Math. Biosci. Eng., 19 (2022), 66–85. https://doi.org/10.3934/mbe.2022003 doi: 10.3934/mbe.2022003
![]() |
[6] |
J. Xu, Y. Tian, T. Ma, N. Al-Nabhan, Intelligent manufacturing security model based on improved blockchain, Math. Biosci. Eng., 17 (2020), 5633–5650. https://doi.org/10.3934/mbe.2020303 doi: 10.3934/mbe.2020303
![]() |
[7] |
A. Zakzouk, A. El-Sayed, E. Hemdan, A blockchain-based electronic medical records management framework in smart healthcare infrastructure, Mult. Tools Appl., 82 (2023), 35419–35437. https://doi.org/10.1007/s11042-023-15152-z doi: 10.1007/s11042-023-15152-z
![]() |
[8] |
W. Wang, D. Teng, M. Chen, Y. Ge, Y. Zou, A trading matching model for aquatic products based on blockchain and credit mechanisms, Math. Biosci. Eng., 20 (2023), 19732–19762. https://doi.org/10.3934/mbe.2023874 doi: 10.3934/mbe.2023874
![]() |
[9] |
M. Du, Q. Chen, J. Chen, X. Ma, An optimized consortium blockchain for medical information sharing, IEEE Trans. Eng. Manag., 68 (2020), 1677–1689. https://doi.org/10.1109/TEM.2020.2966832 doi: 10.1109/TEM.2020.2966832
![]() |
[10] |
K. Neela, V. Kavitha, Blockchain based chaotic deep gan encryption scheme for securing medical images in a cloud environment, Appl. Intell., 53 (2023), 4733–4747. https://doi.org/10.1007/s10489-022-03730-x doi: 10.1007/s10489-022-03730-x
![]() |
[11] |
J. Qu, Blockchain in medical informatics, J. Industr. Inform. Integr., 25 (2022), 100258. https://doi.org/10.1016/j.jii.2021.100258 doi: 10.1016/j.jii.2021.100258
![]() |
[12] |
H. Huang, P. Zhu, F. Xiao, X. Sun, Q. Huang, A blockchain-based scheme for privacypreserving and secure sharing of medical data, Comput. Secur., 99 (2020), 102010. https://doi.org/10.1016/j.cose.2020.102010 doi: 10.1016/j.cose.2020.102010
![]() |
[13] |
J. Liu, W. Jiang, R. Sun, A. Bashiret, M. Alshehri, Q. Hua, et al., Conditional anonymous remote healthcare data sharing over blockchain, IEEE J. Biomed. Health Inform., 27 (2022), 2231–2242. https://doi.org/10.1109/JBHI.2022.3183397 doi: 10.1109/JBHI.2022.3183397
![]() |
[14] | M. Wang, Y. Guo, C. Zhang, C. Wang, H. Huang, X. Jia, Medshare: A privacy-preserving medical data sharing system by using blockchain, IEEE Trans. Serv. Comput., 16 (2021). https://doi.org/10.1109/TSC.2021.3114719 |
[15] |
V. Marichamy, V. Natarajan, Blockchain based securing medical records in big data analytics, Data Knowl. Eng., 14 (2023), 102122. https://doi.org/10.1016/j.datak.2022.102122 doi: 10.1016/j.datak.2022.102122
![]() |
[16] |
X. Yang, W. Wang, T. Tian, C. Wang, Cryptanalysis and improvement of a blockchain-based certificateless signature for IIoT devices, IEEE Trans. Industr. Inform., 20 (2024), 1884–1894. https://doi.org/10.1109/TII.2023.3282317 doi: 10.1109/TII.2023.3282317
![]() |
[17] |
X. Yang, H. Wen, R. Diao, X. Du, C. Wang, Improved security of a pairing-free certificateless aggregate signature in healthcare wireless medical sensor networks, IEEE Int. Things J., 10 (2023), 10881–10892. https://doi.org/10.1109/JIOT.2023.3240426 doi: 10.1109/JIOT.2023.3240426
![]() |
[18] |
A. Hisham, Detecting impersonation attacks in cloud computing environments using a centric user profiling approach, Future Gener. Comput. Syst., 117 (2021), 299–320. https://doi.org/10.1016/j.future.2020.12.009 doi: 10.1016/j.future.2020.12.009
![]() |
[19] | X. Yang, S. Li, M. Li, X. Du, C. Wang, Heterogeneous signcryption scheme from PKI to IBC with multi-ciphertext equality test in internet of vehicles, IEEE Int. Things J., (2023), 1. https://doi.org/10.1109/JIOT.2023.3341146 |
[20] | M. Ma, M. Luo, S. Fan, D. Feng, An efficient pairing-free certificateless cearchable public key encryption for cloud-based IIoT, Wirel. Commun. Mobile Comput., 2020. https://doi.org/10.1155/2020/8850520 |
[21] |
Z. Zhang, S. Zhou, A decentralized strongly secure attribute-based encryption and authentication scheme for distributed Internet of Mobile Things, Comput. Networks, 201 (2021), 108553. https://doi.org/10.1016/j.comnet.2021.108553 doi: 10.1016/j.comnet.2021.108553
![]() |
[22] | M. Blaze, G. Bleumer, M. Strauss, Divertible protocols and atomic proxy cryptography, Int. Confer. Theory Appl. Cryptographic Techn., (1998), 127–144. https://doi.org/10.1007/BFb0054122 |
[23] |
H. Guo, Z. Zhang, J. Xu, N. An, X. Lan, Accountable proxy re-encryption for secure data sharing, IEEE Trans. Depend. Secure Comput., 18 (2018), 145–159. https://doi.org/10.1109/TDSC.2018.2877601 doi: 10.1109/TDSC.2018.2877601
![]() |
[24] |
C. Fan, J. Chen, S. Huang, J. Huang, W. Chen, Provably secure timed-release proxy conditional reencryption, IEEE Syst. J., 11 (2015), 2291–2302. https://doi.org/10.1109/JSYST.2014.2385778 doi: 10.1109/JSYST.2014.2385778
![]() |
[25] |
K. Azbeg, O. Ouchetto, S. Andaloussi, Blockmedcare: A healthcare system based on iot, blockchain and ipfs for data management security, Egypt. Inform. J., 23 (2022), 320–343. https://doi.org/10.1016/j.eij.2022.02.004 doi: 10.1016/j.eij.2022.02.004
![]() |
[26] |
A. Manzoor, A. Braeken, S. Kanhere, M. Ylianttila, M. Liyanage, Proxy re-encryption enabled secure and anonymous iot data sharing platform based on blockchain, J. Network Comput. Appl., 176 (2021), 102917. https://doi.org/10.1016/j.jnca.2020.102917 doi: 10.1016/j.jnca.2020.102917
![]() |
[27] |
M. Green, G. Ateniese, Identity-Based proxy re-encryption, Appl. Cryptography Network Secur., 4521 (2007), 288–306. https://doi.org/10.1007/978-3-540-72738-5_19 doi: 10.1007/978-3-540-72738-5_19
![]() |
[28] |
H. Wang, Z. Cao, L. Wang, Multi-use and unidirectional identity-based proxy re-encryption schemes, Inform. Sci., 180 (2010), 4042–4059. https://doi.org/10.1016/j.ins.2010.06.029 doi: 10.1016/j.ins.2010.06.029
![]() |
[29] |
H. Xiong, L. Wang, Z. Zhou, Z. Zhao, X. Huang, S. Kumari, Burn after reading: Adaptively secure puncturable identity-based proxy re-encryption scheme for securing group message, IEEE Int. Things J., 9 (2021), 11248–11260. https://doi.org/10.1109/JIOT.2021.3126230 doi: 10.1109/JIOT.2021.3126230
![]() |
[30] |
S. Maiti, S. Misra, P2b: Privacy preserving identity-based broadcast proxy re-encryption, IEEE Trans. Veh. Technol., 69 (2020), 5610–5617. https://doi.org/10.1109/TVT.2020.2982422 doi: 10.1109/TVT.2020.2982422
![]() |
[31] |
C. Ge, Z. Liu, J. Xia, L. Fang, Revocable identity-based broadcast proxy reencryption for data sharing in clouds, IEEE Trans. Depend. Secure Comput., 18 (2019), 1214–1226. https://doi.org/10.1109/TDSC.2019.2899300 doi: 10.1109/TDSC.2019.2899300
![]() |
[32] |
Y. Zhou, L. Zhao, Y. Jin, F. Li, Backdoor-resistant identity-based proxy reencryption for cloud-assisted wireless body area networks, Inform. Sci., 604 (2022), 80–96. https://doi.org/10.1016/j.ins.2022.05.007 doi: 10.1016/j.ins.2022.05.007
![]() |
[33] |
H. Lin, T. Tsai, P. Ting, Y. Fan, Identity-based proxy re-encryption scheme using fog computing and anonymous key generation, Sensors, 23 (2023), 2706. https://doi.org/10.3390/s23052706 doi: 10.3390/s23052706
![]() |
[34] |
P. Xu, T. Jiao, Q. Wu, W. Wang, H. Jin, Conditional identity-based broadcast proxy reencryption and its application to cloud email, IEEE Trans. Comput., 65 (2015), 66–79. https://doi.org/10.1109/TC.2015.2417544 doi: 10.1109/TC.2015.2417544
![]() |
[35] |
S. Yao, R. Dayot, H. Kim, I. Ra, A novel revocable and identity-based conditional proxy re-encryption scheme with ciphertext evolution for secure cloud data sharing, IEEE Access, 9 (2021), 42801–42816. https://doi.org/10.1109/ACCESS.2021.3064863 doi: 10.1109/ACCESS.2021.3064863
![]() |
[36] |
G, Kan, C. Jin, H. Zhu, Y. Xu, N. Liu, An identity-based proxy re-encryption for data deduplication in cloud, J. Syst. Arch., 121 (2021), 102332. https://doi.org/10.1016/j.sysarc.2021.102332 doi: 10.1016/j.sysarc.2021.102332
![]() |
[37] |
J. Bi, F. Luo, S. He, G. Liang, W. Meng, M. Sun, False data injection- and propagation-aware game theoretical approach for microgrids, IEEE Trans. Smart Grid, 13 (2022), 3342–3353. https://doi.org/10.1109/TSG.2022.3174918 doi: 10.1109/TSG.2022.3174918
![]() |
[38] |
J. Bi, S. He, F. Luo, W. Meng, L. Ji, D. Huang, Defense of advanced persistent threat on industrial internet of things with lateral movement modelling, IEEE Trans. Industr. Inform., 19 (2023), 9619–9630. https://doi.org/10.1109/TII.2022.3231406 doi: 10.1109/TII.2022.3231406
![]() |
[39] | J. Bi, S. He, F. Luo, J. Chen, D. Huang, M. Sun, Differential game approach for modelling and defense of false data injection attacks targeting energy metering systems, in 2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), (2022), 97–104. https://doi.org/10.1109/TrustCom56396.2022.00024 |
[40] |
J. Bi, F. Zhang, A. Dorri, C. Zhang, C. Zhang, A risk management approach to double-virus tradeoff problem, IEEE Access, 7 (2019), 144472–144480. https://doi.org/10.1109/ACCESS.2019.2944985 doi: 10.1109/ACCESS.2019.2944985
![]() |
[41] |
J. Bi, F. Luo, G. Liang, X. Yang, S. He, Z. Dong, Impact assessment and defense for smart grids with FDIA against AMI, IEEE Trans. Network Sci. Eng., 10 (2022), 578–591. https://doi.org/10.1109/TNSE.2022.3197682 doi: 10.1109/TNSE.2022.3197682
![]() |
[42] |
D. Huang, F. Luo, J. Bi, M. Sun, An efficient hybrid IDS deployment architecture for multi-hop clustered wireless sensor networks, IEEE Trans. Inform. Forens. Secur., 17 (2022), 2688–2702. https://doi.org/10.1109/TIFS.2022.3191491 doi: 10.1109/TIFS.2022.3191491
![]() |
[43] |
Y. Shi, K. Yang, Z. Yu, C. Chen, H. Zeng, Adaptive ensemble clustering with boosting BLS-based autoencoder, IEEE Trans. Knowl. Data Eng., 35 (2023), 12369–12383. https://doi.org/10.1109/TKDE.2023.3271120 doi: 10.1109/TKDE.2023.3271120
![]() |
[44] |
K. Yang, Z. Yu, C. Chen, W. Cao, J. You, H. Wong, Incremental weighted ensemble broad learning system for imbalanced data, IEEE Trans. Knowl. Data Eng., 12 (2022), 5809–5824. https://doi.org/10.1109/TKDE.2021.3061428 doi: 10.1109/TKDE.2021.3061428
![]() |
[45] |
K. Yang, Y. Liu, Z. Yu, C. Chen, Extracting and composing robust features with broad learning system, IEEE Trans. Knowl. Data Eng., 35 (2023), 3885–3896. https://doi.org/10.1109/TKDE.2021.3137792 doi: 10.1109/TKDE.2021.3137792
![]() |
[46] | Y. Shi, Z. Yu, C. Chen, H. Zeng, Consensus clustering with co-association matrix optimization, IEEE Trans. Neural Networks Learn. Syst., (2022), 1–14. https://doi.org/10.1109/TNNLS.2022.3201975 |
The initial value | Iterations | error f | Numerical solution |
6.1 | 11 | 11.6591 | 6.4300 |
6.3 | 9 | 11.6591 | 6.4300 |
6.5 | 5 | 11.6591 | 6.4300 |
7.2 | 9 | 11.6591 | 6.4300 |
The initial value of τ | Iterations | precision ε | Numerical solution |
0.25 | 5 | 1.85 | 0.2450 |
0.28 | 8 | 1.85 | 0.2450 |
0.39 | 16 | 1.85 | 0.2450 |
0.4 | 13 | 1.85 | 0.2450 |