In the era of big data, facing the data-intensive scientific paradigm shift and the explosion of scientific big data, there is an urgent need for alliance cooperation between heterogeneous research groups to actively open and share scientific big data to support China's economic development, technological innovation and national security. Therefore, the study of scientific big data sharing mechanism has very important practical significance. We think science big data sharing is an ecosystem that is constantly evolving to higher-order ecological evolution. Based on the dual perspectives of psychological contract and contractual contract, the scientific big data sharing strategy evolution mechanism and sharing strategy incentive mechanism are explored.The research finds that the cooperation of scientific research groups is bound by psychological contract and contractual contract; stochastic evolutionary game has stronger explanatory power for sharing strategy evolution, complementarity is positive indicator, random interference and moral risk are negative indicators; two-way principal agent can describe Alliance members are mutually entrusted, and the shared strategy incentive contract consists of fixed wages and incentive wages, which are proportional to risk.
Citation: Wang Zhang, Jingkun Zhang. Stability of scientific big data sharing mechanism based on two-way principal-agent[J]. AIMS Mathematics, 2023, 8(8): 18762-18779. doi: 10.3934/math.2023955
[1] | Anna Gołȩbiewska, Marta Kowalczyk, Sławomir Rybicki, Piotr Stefaniak . Periodic solutions to symmetric Newtonian systems in neighborhoods of orbits of equilibria. Electronic Research Archive, 2022, 30(5): 1691-1707. doi: 10.3934/era.2022085 |
[2] | Xiaofei Zhang, Fanjing Wang . Brake orbits with minimal period estimates of first-order variant subquadratic Hamiltonian systems. Electronic Research Archive, 2022, 30(11): 4220-4231. doi: 10.3934/era.2022214 |
[3] | Xing Zhang, Xiaoyu Jiang, Zhaolin Jiang, Heejung Byun . Algorithms for solving a class of real quasi-symmetric Toeplitz linear systems and its applications. Electronic Research Archive, 2023, 31(4): 1966-1981. doi: 10.3934/era.2023101 |
[4] | Jun Pan, Haijun Wang, Feiyu Hu . Revealing asymmetric homoclinic and heteroclinic orbits. Electronic Research Archive, 2025, 33(3): 1337-1350. doi: 10.3934/era.2025061 |
[5] | Xiaoxing Chen, Chungen Liu, Jiabin Zuo . A discrete second-order Hamiltonian system with asymptotically linear conditions. Electronic Research Archive, 2023, 31(9): 5151-5160. doi: 10.3934/era.2023263 |
[6] | Haijun Wang, Jun Pan, Guiyao Ke . Multitudinous potential homoclinic and heteroclinic orbits seized. Electronic Research Archive, 2024, 32(2): 1003-1016. doi: 10.3934/era.2024049 |
[7] | Minzhi Wei . Existence of traveling waves in a delayed convecting shallow water fluid model. Electronic Research Archive, 2023, 31(11): 6803-6819. doi: 10.3934/era.2023343 |
[8] | Alessandro Portaluri, Li Wu, Ran Yang . Linear instability of periodic orbits of free period Lagrangian systems. Electronic Research Archive, 2022, 30(8): 2833-2859. doi: 10.3934/era.2022144 |
[9] | Xiaojun Huang, Zigen Song, Jian Xu . Amplitude death, oscillation death, and stable coexistence in a pair of VDP oscillators with direct–indirect coupling. Electronic Research Archive, 2023, 31(11): 6964-6981. doi: 10.3934/era.2023353 |
[10] | Xijun Hu, Li Wu . Decomposition of spectral flow and Bott-type iteration formula. Electronic Research Archive, 2020, 28(1): 127-148. doi: 10.3934/era.2020008 |
In the era of big data, facing the data-intensive scientific paradigm shift and the explosion of scientific big data, there is an urgent need for alliance cooperation between heterogeneous research groups to actively open and share scientific big data to support China's economic development, technological innovation and national security. Therefore, the study of scientific big data sharing mechanism has very important practical significance. We think science big data sharing is an ecosystem that is constantly evolving to higher-order ecological evolution. Based on the dual perspectives of psychological contract and contractual contract, the scientific big data sharing strategy evolution mechanism and sharing strategy incentive mechanism are explored.The research finds that the cooperation of scientific research groups is bound by psychological contract and contractual contract; stochastic evolutionary game has stronger explanatory power for sharing strategy evolution, complementarity is positive indicator, random interference and moral risk are negative indicators; two-way principal agent can describe Alliance members are mutually entrusted, and the shared strategy incentive contract consists of fixed wages and incentive wages, which are proportional to risk.
In this paper, let J=(0−II0) and N=(−I00I) with I being the identity matrix on Rn. Denote by Ls(R2n) the space of all symmetric matrices in R2n and Sp(2n) the symplectic group of 2n×2n matrices.
We call B∈C(S1,Ls(R2n)) satisfies condition (BS1) if B(−t)=NB(t)N for all t∈R and B is 12-periodic, where S1=R/Z.
Let H∈C1(R×R2n,R) and H′ denote the gradient of H with respect to the last 2n variables. We assume H satisfies the following conditions:
(H1)H′(t,x)=B0(t)x+o(|x|) as |x|→0 uniformly in t,
(H2)H′(t,x)=B∞x+o(|x|) as |x|→∞ uniformly in t,
(H3) H(−t,Nx)=H(t,x)=H(t,−x)=H(t+12,−x), ∀(t,x)∈(R×R2n).
In [1] of 2008, the second author of this paper considered the multiplicity of 1-periodic brake orbits of asymptotically linear symmetric reversible Hamiltonian systems. Since condition (H3) holds, it is natural to consider 1-periodic solution of the asymptotically linear Hamiltonian systems
˙x=JH′(t,x), | (1.1) |
x(t+1)=x(t),x(12+t)=Nx(12−t),x(12+t)=−x(t),∀t∈R. | (1.2) |
We call the above 1-periodic solutions symmetric brake orbits. If H(−t,Nx)=H(t,x) for all (t,x)∈(R×R2n), we say H is reversible.
Note that conditions (H1)-(H3) yield that both B0 and B∞ belong to C(S1,Ls(R2n)) and satisfy the above (BS1) condition.
In 1948, Seifert firstly studied brake orbits in Hamiltonian system in [2]. For the existences and multiple existence results and more details on brake orbits one can refer the paper [3,4] and the references therein. In [1] the second author of this paper obtained multiple existence of brake orbits of the asymptotically linear Hamiltonian systems (1.1)-(1.2) under certain conditions. In this paper we will study multiplicity of symmetric brake orbits of Hamiltonian systems (1.1)-(1.2).
In [5], the difference between B0 and B∞, i.e., the different behaviors of H at zero and infinity plays an important role in the study of 1-periodic solutions of (1.1). For this reason we also define the relative Morse index to measure the "true" difference between B0 and B∞ under symmetric brake orbit boundary value. We shall study the relation between the relative Morse index and the Maslov-type index iL0√−1 and νL0√−1 defined below. As application, we obtain a multiplicity of symmetric brake orbits (1.1)-(1.2).
For any symplectic path γ in Sp(2n), the Maslov-type index for symmetric brake orbits boundary values of γ is defined in [6] to be a pair of integers (iL0(γ),νL0(γ))∈Z×{0,1,2,...,n}.
For any continuous path B in Ls(R2n) satisfying condition (BS1), as in [6], we define
(iL0√−1(B),νL0√−1(B))=(iL0√−1(γB,[0,14]),νL0√−1(γB(14))), | (1.3) |
where the symplectic path γB is the fundamental solution of the following linear Hamiltonian system
ddtγB(t)=JB(t)γB(t)andγB(0)=I2n. | (1.4) |
We will briefly introduce such Malov-type index theory in Section 2.
In order to consider the multiplicity of symmetric brake orbits, define
˜E={x∈W1/2,2(S1,R2n)∣x(−t)=Nx(t),x(t+12)=−x(t)a.e.t∈R}. | (1.5) |
Equip ˜E with the usual W1/2,2 norm. Then ˜E is a Hilbert space with the associated inner product ⟨,⟩. We define two self adjoint liner operators ˜A, ˜B from ˜E to ˜E by
⟨˜Ax,y⟩=∫10(−J˙x,y)dt,⟨˜Bx,y⟩=∫10(B(t)x,y)dt,∀x,y∈˜E, | (1.6) |
where B is a continuous path in Ls(R2n) satisfying condition (BS1).
As in [5], we denote by M+(⋅), M−(⋅), and M0(⋅) the positive definite, negative definite, and null subspaces of the self adjoint linear operator defining it respectively.
Definition 1.1. Let B1 and B2 be continuous paths in Ls(R2n) satisfying condition (BS1). We define the relative Morse index of ˜B1 and ˜B2 by
I(˜B1,˜B2)=dim(M+(˜A−˜B1)∩M−(˜A−˜B2))−dim((M−(˜A−˜B1)⊕M0(˜A−˜B1))⋂(M+(˜A−˜B2)⊕M0˜A−˜B2)), | (1.7) |
where we also denote by ˜B1 and ˜B2 the operators defined by (1.6) respectively. We call I(˜B1,˜B2) the relative Morse index, following [5]. By Theorem 1.2 below this relative More index is well defined. Note that such definition of relative Morse index is different from those defined in [7], [8], and [9] etc, which is difference of Morse index or spectral flow or definition from Garlerkin approximation, the definition if dimker(A−B1).
Using the iteration theory of Maslov-type index theory and result in [1], we obtain the relation between the Maslov-type index (iL0√−1, νL0√−1) and the relative Morse index as the following
Theorem 1.1. Let B1 and B2 be be continuous paths in Ls(R2n) satisfying condition (BS1). We have
I(˜B1,˜B2)=iL0√−1(B2)−iL0√−1(B1)−νL0√−1(B1). | (1.8) |
As application, we obtain the main result of this paper.
Theorem 1.2. Suppose that H satisfies (H1), (H2), (H3), and νL0√−1(B0)=νL0√−1(B∞)=0. Then (1.1)-(1.2) has at least |iL0√−1(B1)−iL0√−1(B∞)| pairs of nontrivial 1-periodic symmetric brake orbits.
Organization: In Section 2, we will briefly introduce the Maslov-type index and its iteration theory for symplectic path under brake orbit boundary value. Based on this index theory we give he proof of Theorem 1.1. As application, in Section 3, we give he proof of Theorem 1.2.
Throughout this paper, let N, Z, R, C and U denote the set of natural integers, integers, rational numbers, real numbers, complex numbers and the unit circle in C, respectively.
In this section we will prove Theorem 1.1. We first simply recall the Maslov-type index and its iteration theory for brake orbits.
As we know, in 1984, Conley and Zehnder in their celebrated paper [10] introduced an index theory for the non-degenerate symplectic paths in the real symplectic matrix group Sp(2n) for n≥2. Since then, there are tremendous works about this kind of index theory developed or generalized in various directions. In 2006, combined with the Maslov index formulated in [11], Long, Zhang and Zhu developed an index theory called μ-index in [12] and obtained an result on the existence of multiple brake orbits. The difference of the Maslove-type μ-index in [12] and the Maslov-type L-index in that paper is constant n (half of the dimension). In [13], Liu and Zhang established the Bott-type iteration formulas and some precise iteration formula of the L-index theory and proved the multiplicity of brake orbits on every C2 compact convex symmetric hypersurface in R2n.
Set
PT(2n)={γ∈C([0,T],Sp(2n))∣γ(0)=I2n}, |
where we omit T from the notation of PT if [0,T] is replaced by [0,+∞). Let J be the standard almost complex in (R2n,ω0) and J is a compatible with ω0, i.e.,
ω0(x,y)=Jx⋅y,ω0(Jx,Jy)=ω0(x,y)andω0(x,Jx)>0forx≠0. |
A n-dimensional subspace Λ⊆R2n is called a Lagrangian subspace if ω0(x,y)=0, for any x,y∈Λ. Let F=R2n⨁R2n be equipped with symplectic form (−ω0)⨁ω0. Then J=(−J)⨁J is an almost complex structure on F and J is compatible with (−ω0)⨁ω0. Denote by Lag(F) the set of Lagrangian subspaces of F. Then for any M∈Sp(2n), its graph
Gr(M)={(xMx)|x∈R2n}∈Lag(F). |
Denote by L0={0}×Rn and L1=Rn×{0} the two fixed Lagrangian subspaces of R2n and let
V0=L0×L0, V1=L1×L1,Gr(M)|Vj={(xMy)|x,y∈Lj}. | (2.1) |
Then both Vj,Gr(M)|Vj∈Lag(F) for M∈Sp(2n) and j=0,1.
Denote by μCLMF(V,W,[a,b]) the Maslov-type index for (ordered) pair of paths of Lagrangian subspaces (V,W) in F on [a,b], which is defined by Cappel, Lee and Miller in [11].
Definition 2.1. (cf. [6,12,13]) For γ∈Pτ(2n), define
iLjω(γ)={μCLMF(Gr(eθJ)|Vj,Gr(γ(t)),t∈[0,τ]),ω=e√−1θ∈U∖{1}, μCLMF(Vj,Gr(γ(t)),t∈[0,τ])−n,ω=1, | (2.2) |
νLjω(γ)=νLjω(γ(τ))=dimC(γ(τ)Lj∩eθJLj), ω=e√−1θ∈U. | (2.3) |
For j=0,1, we define (iLj(γ),νLj(γ))=(iLjω(γ),νLjω(γ)) if ω=1. Note that, for any continuous path Ψ∈Pτ, the following Maslov-type indices of Ψ is defined by (cf [1,12])
μ1(Ψ,[a,b])=μCLMF(V0,Gr(Ψ),[0,τ]),ν(Ψ,[0,τ])=dimΨ(τ)L0∩L0. | (2.4) |
When there is no confusion we will omit the intervals in the above definitions. Hence we have
iL0(γ)=μ1(γ)−n,νL0(γ)=ν1(γ), | (2.5) |
For B∈C(ST,Ls(R2n)), the fundamental solution γB of the linear Hamiltonian system
{˙γ(t)=JB(t)γ(t),γ(0)=I2n. | (2.6) |
satisfies γB∈PT(2n), and is called the associated symplectic path of B. For ω∈U, we define the Maslov-type indices of B via the restriction γB|[0,T/2]∈PT/2(2n) :
(iLjω(B,T2),νLjω(B,T2)):=(iLjω(γB|[0,T/2]),νLjω(γB(T2))). |
In 1956, Bott in [14] established the famous iteration formula of the Morse index for closed geodesics on Riemannian manifolds. For convex Hamiltonian systems, Ekeland developed the similar Bott-type iteration index formulas for the Ekeland index theory (cf. [15] of 1990). In 1999 (cf. [16]), Long established the Bott-type iteration formulas for the Maslov-type index theory. Motivated by the above results, in [13] of Liu and Zhang in 2014, the following Bott-type iteration formulas for the L0-index was established.
Definition 2.2. (cf. [13]) Given an τ>0, a positive integer k and a path γ∈Pτ(2n), the k-th iteration γk of γ in brake orbit boundary sense is defined by ˜γ|[0,kτ] with
˜γ(t)={γ(t−2jτ)(γ(2τ))j,t∈[2jτ,(2j+1)τ],j∈N∪{0}, Nγ((2j+2)τ−t)N(γ(2τ))j+1,t∈[(2j+1)τ,(2j+2)τ],j∈N∪{0}, |
where γ(2τ):=Nγ(τ)−1Nγ(τ). $
Theorem 2.1. (cf. [13] of Liu and Zhang in 2014) Suppose γ∈Pτ(2n), for the iteration symplectic paths γk, when k is odd, there hold
iL0(γk)=iL0(γ1)+k−12∑i=1iω2ik(γ2),νL0(γk)=νL0(γ1)+k−12∑i=1νω2ik(γ2); |
when k is even, there hold
iL0(γk)=iL0(γ1)+iL0√−1(γ1)+k2−1∑i=1iω2ik(γ2),νL0(γk)=νL0(γ1)+νL0√−1(γ1)+k2−1∑i=1νω2ik(γ2), |
where ωk=eπ√−1/k, and (iω,νω) is the ω-index pair defined by Long(cf. [16]).
Proof of Theorem 1.1. For any B∈Ls(R2n) satisfying condition (BS1), as in [1], we define
E={x∈W1/2,2(S1,R2n)∣x(−t)=Nx(t),a.e.t∈R}. | (2.7) |
Equip E with the usual W1/2,2 norm. Then E is a Hilbert space with the associated inner product ⟨,⟩. We define two self adjoint liner operators A, B from E to E by
⟨Ax,y⟩=∫10(−J˙x,y)dt,⟨Bx,y⟩=∫10(B(t)x,y)dt,∀x,y∈E. | (2.8) |
We also define
ˆE={x∈W1/2,2(S1,R2n)∣x(−t)=Nx(t),x(t+12)=x(t),a.e.t∈R}. | (2.9) |
Equip ˆE with the usual W1/2,2 norm. We define two self adjoint liner operators ˆA, ˆB from ˆE to ˆE by
⟨ˆAx,y⟩=∫10(−J˙x,y)dt,⟨ˆBx,y⟩=∫10(B(t)x,y)dt,∀x,y∈ˆE. | (2.10) |
Then ˜E and ˆE are both subspaces of E and A invariant, we have both the A orthogonal and B orthogonal decomposition
E=˜E⊕ˆE,˜A=A|˜E,ˆA=A|ˆE. |
Since B satisfies condition (BS1), one can verify the following orthogonal decomposition
B=˜B⊕ˆB,˜B=B|˜E,ˆB=B|ˆE. |
Then we have the orthogonal decomposition
M∗(A−B)=M∗(˜A−˜B)⊕M∗(ˆA−^B),for∗=±,0, |
where M∗(A−B)⊂E, M∗(˜A−˜B)⊂˜E, M∗(ˆA−ˆB)⊂ˆE. So by the definitions of I(B1,B2), I(˜B1,˜B2), I(ˆB1,ˆB2) we have
I(B1,B2)=I(˜B1,˜B2)+I(ˆB1,ˆB2), | (2.11) |
where I(B1,B2) and I(ˆB1,ˆB2) are defined similarly as (1.3).
Since B satisfies condition (BS1), one has B∈C(S1/2,Ls(R2n)). Thus
⟨ˆAx,y⟩=2∫120(−J˙x,y)dt,⟨ˆBx,y⟩=2∫120(B(t)x,y)dt,∀x,y∈ˆE. |
So by Theorem 1.2 of [1] and (2.8) we have
I(ˆB1,ˆB2)=iL0(γB2(t),[0,14])−iL0(γB1(t),[0,14])−ν1(γB1(14)) | (2.12) |
Also by Theorem 1.2 of [1] and (2.8) we have
I(B1,B2)=iL0(γB2(t),[0,12])−iL0(γB1(t),[0,12])−ν1(γB1(12)) | (2.13) |
Since both B1 and B2 satisfy condition (BS1), for j=1,2, by Theorem 2.3 we have
iL0(γBj(t),[0,12])=iL0(γBj(t),[0,14])+iL0√−1(γBj(t),[0,14]), | (2.14) |
νL0(γBj(t),[0,12])=νL0(γBj(t),[0,14])+νL0√−1(γBj(t),[0,14]). | (2.15) |
By (2.11)–(2.15) one has
I(˜B1,˜B2)=iL0√−1(γB2(t),[0,14])−iL0√−1(γB2(t),[0,14])−νL0√−1(γB2(t),[0,14]). | (2.16) |
Thus Theorem 1.1 holds by the definitions of (iL0√−1(γB),νL0√−1(γB)) in (1.3).
In this section we prove Theorem 1, 2.
We study the 1-periodic brake orbit solution of Hamiltonian system (1.1)-(1.2)
˙x=JH′(t,x),x(t+1)=x(t),x(12+t)=Nx(12−t). |
It is well know that x is a solution of (1.1)-(1.2) if and only if it is a critical point of the functional f defined on ˜E as follows
f(x)=12⟨˜Ax,x⟩+˜Φ(x),x∈˜E, | (3.1) |
where ˜E is defined by (1.5), ˜A is defined in (1.6), ˜Φ(x)=∫10−H(t,x)dt. It is easy to check that ˜Φ′(x) is compact.
In [17], Benci proved the following important abstract theorem:
Theorem 3.1. Let f∈C1(E,R) have the form (3.1) and satisfy
(f1) Every sequence {uj} such that f(uj)→c<˜Φ(0) and ||f′(uj)||→0 as j→+∞ is bounded.
(f2) ˜Φ(u)=˜Φ(−u), u∈˜E.
(f3) There are two closed subspaces of ˜E, E+ and E−, and a constant ρ>0 such that
(a) f(u)>0 for u∈E+, where c0<c∞<˜Φ(0) be two constants.
(b) f(u)<c∞<˜Φ(0) for u∈E−∩Sρ, (Sρ={u∈E|||u||=ρ}).
Then the number of pairs of nontrivial critical points of f is greater than or equalto dim(E+∩E−)−cod(E−+E+). More over, the corresponding critical values belong toto [c0,c∞].
Proof of Theorem 1.2. We take the method in [1,5] to prove this theorem.
We set ˜E+=M+(˜A−˜B∞) and ˜E−=M−(˜A−B0). By Definition 1.1 and Theorem 1.2, we have
dim(˜E+∩˜E−)−cod(˜E−+˜E+)=dim(M+(˜A−˜B∞)∩M0(˜A−˜B0))−dim((M−(˜A−˜B∞)⊕M−(˜A−˜B∞))∩(M+(˜A−˜B0)⊕M0(˜A−˜B0)))=I(˜B∞,˜B0)=iL0√−1(˜B0)−iL0√−1(˜B∞). | (3.2) |
Here ˜B0 and ˜B∞ are compact operators from ˜E to ˜E defined by (1.6). Since 0 is an isolated eigenvalue of ˜A with n-dimensional eigenspace ˜E0, by (4-4′) of [17], there exist two real numbers α<0 and β>0 such that
⟨˜A−˜B0u,u⟩≤α||u||2,∀u∈˜E−, | (3.3) |
⟨˜A−˜B∞u,u⟩≥β||u||2,∀u∈˜E+. | (3.4) |
Define
V∞(t,x)=H(t,x)−12⟨˜B∞(t)x,x⟩,V0(t,x)=H(t,x)−12⟨˜B0(t)x,x⟩, | (3.5) |
and let g∞(x)=∫10V∞(t,x)dt and g0(x)=∫10V0(t,x)dt, then we have
f(x)=12⟨(˜A−˜B∞)x,x⟩−g∞(x),∀x∈˜E, | (3.6) |
f(x)=12⟨(˜A−˜B0)x,x⟩−g0(x),∀x∈˜E. | (3.7) |
By (H1)-(H2) and the same arguments in the proof of Lemma 5.5 of [17], we get
lim||x||→+∞||g′∞(x)||||x||=0, | (3.8) |
lim||x||→+0||g′0(x)||||x||=0. | (3.9) |
So by definition of g0 and (3.9), we have
g0(u)=−˜Φ(0)+o(||u||2),for||u||→0. | (3.10) |
By (3.3) and (3.10) we have
f(u)≤α||u||2+˜Φ(0)+o(||u||2),foru∈E−and||u||→0. | (3.11) |
Since α<0, there exist a constant ρ>0 and γ1<0 such that
f(u)<γ1+˜Φ(0),∀u∈E−∩Sρ. | (3.12) |
Setting c∞=γ12+˜Φ(0), (f3)(b) of Theorem 3.1 is satisfied.
By (H2) for there exist M>0 such that
|V∞(t,x)|≤β2|x|2+M|x|,∀x∈R2n. | (3.13) |
Thus
|g∞(u)|=|∫10V∞(t,u)dt|≤∫10|V∞(t,u)|dt≤∫10β2|u|2+M|u|≤β2||u||2+M||u||. | (3.14) |
Then by (3.4) and (3.14), for every u∈˜E+, we get
f(u)=12⟨(˜A−˜B∞)u,u⟩+g∞(u)≥β||u||2−|g∞(u)|≥β2||u||2−M||u||. | (3.15) |
This implies that f is bounded from below on ˜E+ and we can set
c0=infu∈E+f(u)−wwithw>0suchthatc0<c∞. |
Thus (f3)(a) of Theorem 3.1 is satisfied.
Since ν1(˜B∞)=0, M0(˜A−˜B∞)=0. Now we prove that (f1) is satisfied. other wise we can suppose ||uj||→+∞ as j→+∞, then by (3.6) and (3.8) we have
0=limj→+∞f′(uj)=limj→+∞((˜A−˜B∞)uj+g′∞(uj))=limj→+∞(˜A−˜B∞)uj. | (3.16) |
But by (4-4′) of [17] there exists a real number α′>0 such that
||(˜A−˜B∞)u||≥α′||u||,∀u∈E. | (3.17) |
Hence by (3.17) we have
limj→+∞||(˜A−˜B∞)uj||=+∞, | (3.18) |
which contradicts (3.16). This proves (f1) in Theorem 3.1.
(H3) implies (f2) of Theorem 3.1 holds. Hence by Theorem 3.1, (1.1)-(1.2) has at least iL0√−1(˜B0)−iL0√−1(˜B∞) pairs of nontrivial solutions whenever iL0√−1(˜B0)−iL0√−1(˜B∞)>0. If iL0√−1(˜B0)−iL0√−1(˜B∞)>0, we replace f by −f and let E+=M−(˜A−˜B∞) and E−=M+(˜A−˜B0). By almost the same proof we can show that (f1)-(f3) of Theorem 3.1 hold. And by Theorems 1.2 and 3.1 (1.1)-(1.2) has at least iL0√−1(˜B∞)−iL0√−1(˜B0) pairs of nontrivial brake orbit solution. The proof of Theorem 1.3 is completed.
Similarly to Theorems 1.4 and 1.5 of [5] or [1]), we have
Remark 3.1. If νL0√−1(˜B∞)>0, we can prove (f1) of Theorem 3.1 under other additional conditions while we can prove (f2) and (f3) are satisfied under (H1)-(H3) by the same proof of Theorem 1.3.
Suppose the following condition:
(H4) V′∞(t,x) is bounded and V(t,x)→+∞ as |x|→+∞, uniformly in t.
By the proof of Theorem 5.2 of [17] and Theorem 4.1 of [18] (f1) holds.
Suppose the following conditions:
(H5) There is r>0 and p∈(1,2) such that
pV∞(t,x)≥(z,V′∞(t,x))>0for|z|≥r,t∈R. |
(H6) ¯lim|x|→∞|x|−1|V′∞(t,x)|≤c<12.
(H7) There are constant a1>0 and a2>0 such that V∞(t,x)≥a|z|p−a2.
By the proof of Theorem 4.11 of [18] (f1) holds.
Then under either additional condition (H4) or (H5)-(H7), (1.1)-(1.2) has at least iL0√−1(˜B0)−iL0√−1(˜B∞)−νL0√−1(˜B∞) pairs of nontrivial solutions whenever iL0√−1(˜B0)−iL0√−1(˜B∞)−νL0√−1(˜B∞)>0.
This work is partially supported by the NSFC Grants 11790271 and 11171341, National Key R & D Program of China 2020YFA0713301, and LPMC of Nankai University. The authors sincerely thanks the referees for their careful reading and valuable comments and suggestions.
The authors declare there is no conflict of interest.
[1] | R. Kitchin, Big data, new epistemologies and paradigm shift, Big Data Soc., 1 (2014), 1–12. |
[2] |
H. Guo, L. Wang, C. Fang, D. Liang, Scientific big data and digital earth, Chinese Sci. Bull., 59 (2014), 5066–5073. https://doi.org/10.1007/s11434-014-0645-3 doi: 10.1007/s11434-014-0645-3
![]() |
[3] |
C. L. Borgman, The conundrum of sharing research data, New Technol. Library Inf. Ser., 5 (2013), 1–20. https://doi.org/10.11925/infotech.1003-3513.2013.05.01 doi: 10.11925/infotech.1003-3513.2013.05.01
![]() |
[4] |
Z. Yang, Y. Shi, Y. Li, Analysis of intellectual property cooperation behavior and its simulation under two types of scenarios using evolutionary game theory, Comput. Ind. Eng., 125 (2018), 739–750. https://doi.org/10.1016/j.cie.2018.02.040 doi: 10.1016/j.cie.2018.02.040
![]() |
[5] |
J. Zuo, Y. Chen, The analysis on sharing mode of scientific data in the environment of big data, J. Intell., 32 (2013), 151–154. https://doi.org/10.1007/978-3-319-50627-2 doi: 10.1007/978-3-319-50627-2
![]() |
[6] |
D. S. Sayogo, T. A. Pardo, Exploring the determinants of scientific data sharing: understanding the motivation to publish research data, Gov. Inform. Q., 30 (2013), 519–531. https://doi.org/10.1016/j.giq.2012.06.011 doi: 10.1016/j.giq.2012.06.011
![]() |
[7] | C. Li, L. Zhang, Scientific big data opening and sharing: models and mechanisms, Inf. Stud.: Theory Pract., 40 (2017), 45–51. |
[8] |
D. L. Nazareth, J. Choi, A system dynamics model for information security management, Inf. Manage., 52 (2015), 123–134. https://doi.org/10.1016/j.im.2014.10.009 doi: 10.1016/j.im.2014.10.009
![]() |
[9] |
Y. Du, R. Zhang, M. Li, Research on a security mechanism for cloud computing based on virtualization, Telecommun. Syst., 53 (2013), 19–24. https://doi.org/10.1007/s11235-013-9672-7 doi: 10.1007/s11235-013-9672-7
![]() |
[10] |
Y. Kim, M. Adler, Social scientists' data sharing behaviors: investigating the roles of individual motivations, institutional pressures, and data repositories, Int. J. Inf. Manag., 35 (2015), 408–418. https://doi.org/10.1016/j.ijinfomgt.2015.04.007 doi: 10.1016/j.ijinfomgt.2015.04.007
![]() |
[11] |
M. Janssen, Y. Charalabidis, A. Zuiderwijk, Benefits, adoption barriers and myths of open data and open government, Inf. Syst. Manag., 29 (2012), 258–268. https://doi.org/10.1080/10580530.2012.716740 doi: 10.1080/10580530.2012.716740
![]() |
[12] |
B. V. Loenen, H. J. Onsrud, Geographic data for academic research: assessing access policies, Cartogr. Geogr. Inf. Sci., 31 (2004), 3–17. https://doi.org/10.1559/152304004773112730 doi: 10.1559/152304004773112730
![]() |
[13] |
C. Peng, X. Song, H. Jiang, Q. Zhu, H. Chen, J. M. Chen, et al., Towards a paradigm for open and free sharing of scientific data on global change science in China, Ecosyst. Health Sustain., 2 (2016), 23–45. https://doi.org/10.1002/ehs2.1225 doi: 10.1002/ehs2.1225
![]() |
[14] |
X. Gao, W. Zhong, S. Mei, Stochastic evolutionary game dynamics and their selection mechanisms, Comput. Econ., 41 (2013), 233–247. https://doi.org/10.1007/s10614-012-9320-4 doi: 10.1007/s10614-012-9320-4
![]() |
[15] |
S. Dai, G. Nie, N. Xiao, The study of the two-way principal-agent model based on asymmetric information, Wireless Pers. Commun., 102 (2018), 629–639. https://doi.org/10.1007/s11277-017-5071-9 doi: 10.1007/s11277-017-5071-9
![]() |
[16] | Y. Wei, G. Liu, Analysis of research data management and sharing policy in foreign universities based on data lifecycle, J. Intell., 5 (2017), 153–158. |
[17] |
D. Hingu, K. S. M. Rao, A. J. Shaiju, Evolutionary stability of polymorphic population states in continuous games, Dyn. Games Appl., 8 (2016), 141–156. https://doi.org/10.1007/s13235-016-0207-1 doi: 10.1007/s13235-016-0207-1
![]() |
[18] | A. Erwin, P. Alex, On the stability of evolutionary dynamics in games with incomplete information, Math. Soc. Sci., 58 (2009), 310–321. |
[19] | Y. Xu, B. Hu, R. Qian, Analysis on stability of strategic alliances based on stochastic evolutionary game including simulations, Syst. Eng.-Theory Pract., 31 (2011), 920–926. |
[20] |
J. M. Huang, H. W. Zhang, A method for selecting defense strategies based on stochastic evolutionary game model, Acta Electron. Sinica, 46 (2018), 2222–2228. https://doi.org/10.3969/j.issn.0372-2112.2018.09.025 doi: 10.3969/j.issn.0372-2112.2018.09.025
![]() |
[21] | S. Hu, C. Huang, Stochastic differential equation, Beijing: Science Press, 5 (2008), 66–70. |
[22] | H. Sun, X. Wang, Y. Xue, Stochastic evolutionary game model for unexpected incidents involving mass participation based on different scenarios, Operat. Res. Manage. Sci., 25 (2016), 23–29. |
[23] | B. Holmastrom, P. Milgrom, Aggregation and linearity in the provision of intertemporal incentives, Econometrica, 55 (1987), 303–328. |
[24] | W. Zhang, Game theory and information economics, Shanghai: People's Publishing House, 5 (2012), 242–262. |
[25] |
Y. Ren, F. Zhu, P. K. Sharma, T. Wang, J. Wang, O. Alifarraj, et al., Data query mechanism based on hash computing power of blockchain in internet of things, Sensors, 20 (2020), 207–229. https://doi.org/10.3390/s20010207 doi: 10.3390/s20010207
![]() |
[26] |
Y. Ren, F. Zhu, J. Wang, P. K. Sharma, U. Ghosh, Novel vote scheme for decision-making feedback based on blockchain in internet of vehicles, IEEE Trans. Intell. Transp. Syst., 23 (2022), 1639–1648. https://doi.org/10.1109/TITS.2021.3100103 doi: 10.1109/TITS.2021.3100103
![]() |