当前位置：文档之家› Guaranteed Cost Synchronization of Chaotic Cellular Neural Networks with Time-Varying Delay

Guaranteed Cost Synchronization of Chaotic Cellular Neural Networks with Time-Varying Delay

LETTER Communicated by Zhigang Zeng Guaranteed Cost Synchronization of Chaotic Cellular

Neural Networks with Time-Varying Delay

Jianjun T u

tujianjun1984@https://www.doczj.com/doc/638197557.html,

Hanlin He

hanlinhe62@https://www.doczj.com/doc/638197557.html,

College of Science,Naval University of Engineering,Wuhan,430033,China Synchronization of cellular neural networks with time-varying delay is discussed in this letter.Based on Razumikhin theorem,a guaranteed cost synchronous controller is given.Unlike Lyapunov-Krasovskii anal-ysis process,there is no constraint on the change rate of time delay.The saturated terms emerging in the Razumikhin analysis are ampli?ed by zoned discussion and maximax synthesis rather than by Lipschitz con-dition and vector inequality,which will bring more conservatism.Then the controller criterion is transformed from quadratic matrix inequality form into linear matrix inequality form,with the help of a suf?cient and necessary transformation condition.The minimization of the guar-anteed cost is studied,and a further criterion for getting the controller is presented.Finally,the guaranteed cost synchronous control and its corre-sponding minimization problem are illustrated with examples of chaotic time-varying delay cellular neural networks.

1Introduction

Cellular neural networks(CNNs),proposed by Chua and Yang(1988),have been successfully applied to many scienti?c?elds such as image process-ing,associative memory,and medical science(see Zeng&Wang,2007;Su, Huang,Hou,&Lin,2010;Li&Huang,2010;Vidal,Louchet,Rocchisani,& Lutton,2010).Because the stability of the equilibrium points or the periodic orbits is prerequisite to such applications(Zeng&Wang,2006;Lin&Shih, 2007)and the synchronization is the core of the chaotic CNNs’applica-tion in secrt communication(He,Zhang,&Lu,1999),CNNs have attracted attention in the area theoretical research.

CNNs include saturation nonlinear units,which makes research on satu-rated nonlinearity more important.In many instances,saturation nonlinear-ity should not be neglected or replaced by other smooth links.For example, neglect of the saturation and improper reduction of the controller gain will lead to a waste of the system’s control capacity and cause performance degradation(Sourlas,Choi,&Manousiouthakis,1994).

Neural Computation24,217–233(2012)c 2011Massachusetts Institute of Technology

218J.Tu and H.He So far,the research of saturated nonlinear systems can be classi?ed into three categories:

1.Dynamics of the systems with saturation nonlinearities.A representative

achievement is the convex analysis method presented by Leine and van Campen(2006),Leine(2006),and Leine and van de Wouw(2008).

In addition,Hu,Teel,and Zaccarian(2006)presented a less conser-vative stability condition,based on a pair of conjugate nonquadratic Lyapunov functions,the convex hull quadratic function and the maxi-mum quadratic function.And Dai,Hu,and Teel(2007)used piecewise-quadratic Lyapunov functions to analyze the stability of systems with

a saturation or dead zone.

2.Stability analysis and controller design for the systems with saturation.For

example,complete stability for discrete time CNNs with saturated output functions was analyzed(see Li,2009);robust guaranteed cost control theory was applied to analyze the dynamics of the BSB(brain state in a box)neural networks(Patricia&Carlos,2005);the actuator saturation was ampli?ed to the convex hull of a set(Zhang,Boukas,& Haidar,2008;Shi,Su,&Chu,2010);Lipschitz condition was indirectly used on the transformed systems to deal with the saturating actuators (Yakoubi&Chitour,2007;Xin,Gan,&Qiu,2008);and the actuator characteristics were assumed to reside in the generalized piecewise sector region analysis(Fang,Lin,&Shamash,2006),which was the extension of absolute stability.

3.Synchronization for systems with input saturation.An adaptive controller

was designed to ensure robust synchronization of two different chaotic systems with input nonlinearities,and it was also supposed that the actuator characteristics were bounded in the sector area(Kebriaei& Yazdanpanah,2010).There are some other papers that focus on syn-chronization problems,but the case that the saturation locates inside the system is not discussed much.

From this summary,it can be seen that the techniques for dealing with saturated terms can be grouped into three types:

1.In controller design,the saturated terms are considered as the mem-

oryless functions(Khalil,2002),which satis?es the sector condition, so the absolute stability analysis method can be used in the design process.

2.In synchronization,Lipschitz condition and vector inequality are

used in the ampli?cation process of the Lyapunov method(also see Fliegner,Logemann,&Ryan,2003;Fan,Jiang,&Zhang,2006).

3.The terms emerging in the Lyapunov analysis process are discussed

according to different regions and ampli?ed by convex hull theory (Hu,Lin,&Chen,2002).

Guaranteed Cost Synchronization of Cellular Neural Networks219 The?rst two methods will bring more quadrics to the Lyapunov analysis process,which will induce stronger conservatism;the third one has not been used in synchronization problems.In some papers,the saturated units were approximated by smooth units(Kuo,Wu,Chen,&Gunnala,2004),but precise investigation is more meaningful.In this letter,we extend the third method to the guaranteed cost synchronous control design of chaotic CNNs with time-varying delay.

Another key point of this letter is the treatment of time-varying delay terms in the synchronous error system of two CNNs with time-varying de-lay.In the traditional Lyapunov-Krasovskii analysis process,time-varying delay exists in Lyapunov functional,which induces constraints on˙τ(t)(Qiu, Cui,&Ji,2010;Chen,Bi,&Wu,2010).But in Razumikhin analysis,only a Razumikhin function is needed,so there is no such constraint condition on time delays.

This letter is organized as follows.In section2,we introduce the Razumikhin theorem and present the necessary and suf?cient condition of transformation between a class of quadratic matrix inequality(QMI) and linear matrix inequality(LMI).The model of the investigated subject is given,and the object of control effect is de?ned.In section3,zoned discussion and maximax synthesis(ZDMS)is used in the synchronization problem to deal with the error term containing saturation.Based on the Razumikhin theorem,a QMI criterion is proposed for the guaranteed cost synchronization for CNNs with timevarying delay.In section4,two prob-lems are solved:one is the LMI criterion for gaining synchronous control, which is transformed from the QMI condition given in section3,and the other is the minimization of the guaranteed cost and its corresponding cri-terion.In section5,we use chaotic CNNs with time-varying delay as an example.The effect of guaranteed cost synchronization and the cost mini-mization is veri?ed.

2Preliminaries and Problem Statement

2.1Preliminaries.Suppose r≥0is a given real number,R=(?∞,∞), R+=[0,∞),R n denotes the n-dimensional real space with Euclidean norm |·|,and C([a,b],R n)is the Banach space of continuous functions mapping

the interval[a,b]into R n with the topology of uniform convergence.If [a,b]=[?r,0],let C=C([?r,0],R n)and designate the norm of an element φin C by|φ|=sup?r≤θ≤0|φ(θ)|.If D is a subset of R×C,f:D→R n is a given function.The relation

˙x(t)=f(t,x t)(2.1) is called the delayed functional differential equation on D(DFDE).

220J.Tu and H.He Lemma1(Hale,1993).Suppose f:R×C→R n takes R×(bounded set of C), into bounded sets of R n,and consider the DFDE(f).Suppose k,g,h:R+→R+ are continuous,nondecreasing functions,and k(s),g(s),h(s)are positive for s>0, k(0)=g(0)=0.If there is a continuous function V:R×R n→R such that

k(|x|)≤V(t,x)≤g(|x|),t∈R,x∈R n,(2.2)

and if there is a continuous nondecreasing function p(s)>s for s>0such that ˙V(t,φ(0))≤?h(|φ(0)|)if V(t+θ,φ(θ))

(2.3)

then the solution x=0of the DFDE(f)is uniformly asymptotically stable.If k(s)→∞as s→∞,then the solution x=0is also a global attractor for the DFDE(f).

Lemma2.Suppose that X22<0and D>0.Then the following quadratic matrix, inequality

X11+H T DH X12

X T12X22

<0,(2.4)

holds if and only if

???

?X11H T X12

H?D?10

X T120X22

?<0,(2.5)

where X11∈R p×p,X12∈R p×q,X22∈R q×q,H∈R d×p,D∈R d×d,and X T11= X11,X T22=X22,D T=D.

Proof.Necessity:If equation2.4holds true,considering the assumption X22<0,by Schur complements,we have

X11+H T DH

X11H T

H?D?1

<0.

Guaranteed Cost Synchronization of Cellular Neural Networks221 For convenience,the matrix on the left side of the above inequality is de-noted as X 11.Consider the following equation,

X 11?

X12

X?122

X T120

=X 11?

X12X?122X T120

X11?X12X?122X T12H T

H?D?1

and equation2.6,according to Schur complements.It follows that

X 11?

X12

X?122

X T120

<0.

Again by using Schur complements,it follows that

??X 11

X12

X T120

X22

??<0.

So inequality2.5holds.

Suf?ciency:If equation2.5holds true,according to Schur complements, it is also easy to derive equation2.4.

2.2Problem Statement.The response system and the driving system are described,respectively,by the following time-varying delay CNNs:˙x=?Cx(t)+Af(x(t))+B f(x(t?τ(t)))+u(t)(2.7) and

˙y=?Cy(t)+Af(y(t))+B f(y(t?τ(t))),(2.8) where x(t),y(t)∈R n are the state vectors;u(t)∈R n is the control;C= diag(c1,c2,...,c n)(c i>0,i=1,2,...,n)represents the rate with which the i th neuron will reset its potential to the resting state in isolation when disconnected from the network and external inputs;and A,B∈R n×n denote the connection weight matrix and the delayed connec-tion weight matrix,respectively.0≤τ(t)≤ˉτ<∞,f(x(t))=col(f j(x j(t))) (j=1,2,...,n)(f j(·)is the activation function),col(·)denotes the column vector(f1(x1),f2(x2),...,f n(x n))T and f j(x j)=0.5(|x j+1|?

222J.Tu and H.He |x j?1|)=sat(x j)(j=1,2,...,n),where sat(x j)is saturation function de-?ned by

sat(x j)=

x j,if|x j|≤1;

sgn(x j),if|x j|>1.

(2.9)

The initial conditions of equations2.7and2.8are x(s)=φx(s),y(s)=φy(s), and s∈[?τ(0),0],andφx(s)andφy(s)are continuous vector functions. De?ne e(t)=x(t)?y(t).Then the error system is

˙e(t)=?Ce(t)+AF(e(t))+B F(e(t?τ(t)))+u(t),(2.10) where F(e(t))=f(x(t))?f(y(t)),and its initial condition is e(s)=φ(s)=φx(s)?φy(s),s∈[?τ(0),0].

For system2.10,we select a commonly used quadratic cost function,

∞

[e T(t)Qe(t)+u T(t)Ru(t)]d t.(2.11)

where Q,R∈R n×n are positive de?nite matrices.The main purpose is to de-sign the controller u(t),which makes the error system2.10globally asymp-totically stable,and the cost function de?ned by equation2.11also satis?es what the following de?nition describes.

De?nition1.Consider the system2.10.If there exists a control law u?(t)and a real number J?>0,such that for all initial states,the state trajectories of equation 2.3converge to the origin with an upper bound J?of cost function2.11,then u?(t) is called a global guaranteed cost control law with a guaranteed cost J?.

3Design of the Guaranteed Cost Synchronization Controller

We develop a guaranteed cost synchronization controller for system2.10. For matrix G∈R n×n,denote the i th row of G as g i,and denote

M(v,G)=?

v1g1

v n g n

Guaranteed Cost Synchronization of Cellular Neural Networks223

where v i=1or0.De?ne the set ={v∈R n:v i=1or0},so there are2n elements in the set .Then we have the following theorem:

Theorem1.For system2.10and cost function2.11,if there exist a positive de?nite matrix solution P∈R n×n and a matrix K∈R n×n such that

?(C+K)T P?P(C+K)+M(v,A T)P+P(M(v,A T))T

ηM(w,B

T)P(M(w,B T))T+ηP+Q+K T RK<0(3.1)

for all v,w∈ and some positive constantη,then u(t)=?K e(t)is a global guaranteed cost control law with a guaranteed cost,

J?=e T(0)Pe(0)=V0.(3.2)

Proof.Let k(s)=λmin(P)s2,g(s)=λmax(P)s2,and h(s)=λmin(Q+ K T RK)s2,whereλmin(X)andλmax(X)represent the minimal eigenvalue and maximal eigenvalue of X,respectively.P is the positive de?nite matrix de?ned by equation3.1.It is obvious that k(s),g(s),h(s)are continuous and nondecreasing functions,k(0)=g(0)=0,and k(s)>0,g(s)>0,h(s)>0as s>0.Consider a quadratic Razumikhin function candidate,

V(e(t))=e T(t)Pe(t).

Then we have k(|e(t)|)≤V(e(t))≤g(|e(t)|).The derivative of V(e(t))along the trajectories of the system2.10is given by

˙V(e(t))=2e T P(?Ce(t)+AF(e(t))+B F(e(t?τ(t)))+u(t))

=?2e T PCe+2e T Pu+2e T P AF(e(t))+2e T P B F(e(t?τ(t)))

=?2e T PCe+2e T Pu+

i=1

2e T Pa i(sat(x i)?sat(y i))

i=1

2e T Pb i(sat(x i(t?τ(t)))?sat(y i(t?τ(t)))),

where a i,b i are the i th column of A and B,respectively.For each term 2e T Pa i(sat(x i)?sat(y i)):

1.If e T Pa i≥0and y i≥x i,then2e T Pa i(sat(x i)?sat(y i))≤0.Here we

note that

sat(x i)?sat(y i)∈[?2,0].

224J.Tu and H.He

Figure1:Relations among0,e i and sat(x i)?sat(y i).

2.If e T Pa i≤0and y i≥x i,then2e T Pa i(sat(x i)?sat(y i))≤2e T Pa i e i.

Here we note that

e i≤sat(x i)?sat(y i)≤0.

3.If e T Pa i≥0and y i≤x i,then2e T Pa i(sat(x i)?sat(y i))≤2e T Pa i e i.

Here we note that

0≤sat(x i)?sat(y i)≤e i.

4.If e T Pa i≤0and y i≤x i,then2e T Pa i(sat(x i)?sat(y i))≤0.Here we

note that

sat(x i)?sat(y i)∈[0,2].

The relations among0,e i,and sat(x i)?sat(y i)are shown in Figure1.

According to the four cases,we have

2e T Pa i(sat(x i)?sat(y i))≤max{2e T Pa i e i,0}.

Similarly,

2e T Pb i(sat(x i(t?τ(t)))?sat(y i(t?τ(t))))≤max{2e T Pb i e i(t?τ(t)),0}.

We refer to above analysis process for2e T Pa i(sat(x i)?sat(y i))and 2e T Pb i(sat(x i(t?τ(t)))?sat(y i(t?τ(t))))as zoned discussion and maxi-max synthesis(ZDMS).Therefore,we have

˙V(e(t))≤?2e T PCe+2e T Pu+

i=1

(max{2e T Pa i e i,0}

+max{2e T Pb i e i(t?τ(t)),0}).

Guaranteed Cost Synchronization of Cellular Neural Networks225 Then we de?ne a vector v(e(t))∈R n as follows.If2e T Pa i e i>0,v i=1;oth-erwise v i=0.Similarly,de?ne a vector w(e(t?τ(t)))∈R n:if2e T Pb i e i(t?τ(t))>0,w i=1;otherwise,w i=0.By inequality2x T y≤ηx T x+1ηy T y,we have

˙V(e(t))≤?2e T PCe+2e T Pu+2

i=1

(v i e T Pa i e i+w i e T Pb i e i(t?τ(t)))

=2e T P[?C+(M(v,A T))T]e

+2e T Pu+2e T P(M(w,B T))T e(t?τ(t))

≤2e T P[?C+(M(v,A T))T]e+2e T Pu+ηe T Pe

ηe

T(t?τ(t))M(w,B T)P(M(w,B T))T e(t?τ(t)).

Let p(s)=q×s,and q>1,which satis?es p(s)>s as s>0.Now consider that if V(t+θ,e(t+θ))

e T(t?τ(t))M(w,B T)P(M(w,B T))T e(t?τ(t))

≤qe T(t)M(w,B T)P(M(w,B T))T e(t).(3.3)

the“=”holds only if w=0.Substitute the controller u=?K e.It follows that

˙V(e(t))≤2e T P[?C+(M(v,A T))T]e+2e T Pu+ηe T Pe

ηe

T(t?τ(t))M(w,B T)P(M(w,B T))T e(t?τ(t))

≤e T[?(C+K)T P?P(C+K)+P(M(v,A T))T+M(v,A T)P

ηM(w,B

T)P(M(w,B T))T+ηP]e(t).

When inequality3.1holds,there exists q>1(suf?ciently small)such that

?(C+K)T P?P(C+K)+M(v,A T)P+P(M(v,A T))T

ηM(w,B

T)P(M(w,B T))T+ηP+Q+K T RK<0.(3.4) Hence,we have

˙V(e(t))≤?e T(t)(Q+K T RK)e(t)≤?h(|e(t)|).(3.5)

226J.Tu and H.He Sinceλmin(P)|e(t)|2≤V(e(t)),andλmin(P)|e(t)|2→∞as e(t)→∞,the glob-ally asymptotically stability result follows from lemma1.e(t)=0is globally asymptotically stable.From inequality3.5,it yields

∞

0(e T Qe+u T Ru)d t≤?

∞

˙V(e(t))d t=V(e(0)).(3.6)

According to de?nition1,theorem1holds.

So far,the guaranteed cost synchronous controller has been designed theoretically,but the quadratic matrix inequality,equation3.1,is not con-venient to solve.In the following section,we convert it to LMI form.

4LMI Formulation

Corollary1.There exist a positive de?nite matrix P1∈R n×n and a matrix N1∈R n×n such that

???

P11√ηP1M(w,B T)N1

P1?Q?100

1√

(M(w,B T))T P10?P10

N T100?R?1

<0(4.1)

if and only if there exist a positive de?nite matrix P∈R n×n and a matrix K∈R n×n such that equation3.1is satis?ed.The relations among P1,N1and P,K are P1= P?1,N1=P1K T,where =?P1C T?C P1+P1M(v,A T)+(M(v,A T))T P1+ηP1?N1?N T1.

Proof.Suf?ciency:Since R>0,according to Schur complements,equation 3.1is equivalent to

1K T K?R?1

<0,(4.2)

where

1=?(C+K)T P?P(C+K)+M(v,A T)P+P(M(v,A T))T +1

ηM(w,B

T)P(M(w,B T))T+ηP+Q.

Guaranteed Cost Synchronization of Cellular Neural Networks227 According to lemma2,equation4.2can be transformed into

???

2I1√ηM(w,B T)K T

I?Q?100

1√

(M(w,B T))T0?P?10

K00?R?1

<0,(4.3)

where 2=?(C+K)T P?P(C+K)+M(v,A T)P+P(M(v,A T))T+ηP. Multiply both sides of the matrix in equation4.3by diag(P?1,I,I,I)and let P1=P?1,N1=P1K T.Then equation4.1holds.

Necessity:It is also easy to prove the necessity with the help of lemma2.

Remark1.The following problem is the minimization of the guaranteed cost.Since only P is undetermined in equation3.2,let e(0)be a random variable with E{e(0)e T(0)}=I,it holds that

E{e T(0)Pe(0)}=Trace(P).

Hence,the essence of the minimization of J?is the minimization of Trace(P), which can be expressed as

min

P>0,η>0,K

Trace(P),s.t.,for all v,w∈ .(4.4)

If we?xη>0,the above problem can be transformed into the following LMI problem according to corollary1:

min

P1>0,X>0,N1Trace(X),s.t.

X I

I P1

>0and equation4.1,

for all v,w∈ .(4.5) Ifηis un?xed,equation4.4can be transformed into the following global minimization problem:

inf η>0

min

P1>0,X>0,N1

Trace(X),s.t.

X I

I P1

>0and equation4.1,

for all v,w∈ .(4.6)

The global minimum of Trace(X)will be obtained by runningηfrom 0to∞.

228J.Tu and H.

Figure2:Chaotic phase diagram of equation2.7.

5Example and Simulations of Guaranteed Cost Control

5.1Synchronization Under Guaranteed Cost Control.Consider the following coef?cient matrices of equations2.7and2.8:

1+π

0.11+π

,B=

?1.3

√

2π

0.1

0.1?1.3

√

2π

,C=

and time delayτ(t)=1+0.4sin4t.They become typical CNNs.Sup-pose that the initial states are x(s)=[3,3]T,y(s)=[0.1,0.1]T,s∈[?1.4,0], and u(t)=0.The phase diagrams of equations2.7and2.8are shown in Figures2and3.

Now we use theorem1and corollary1to design a guaranteed cost synchronous controller for equations2.7and2.8.We choose Q=R=I,η=1.Since these systems’order is n=2,there are four elements in .

Hence,with different v,w,equation3.1can be transformed into on LMI condition with16blocks.It is convenient to solve with the help of Matlab’s LMI toolbox.It obtains that

8.225.39 5.3952.042

and

3.885.17

2.3619.05

,Trace(P)=60.27.

Guaranteed Cost Synchronization of Cellular Neural Networks229

Figure3:Chaotic phase diagram of equation2.8.

Figure4:Synchronization under guaranteed cost control.

The error curves are shown in Figure4.We use J1and J?1to denote J and J?in this case.According to the data of the error states,J1≈204.16and J?1=V(e0)=597.46,so J1

5.2Minimization of the Guaranteed Cost.To minimize the guaranteed cost’s upper bound J?,we noted in remark1that we can?nd the minimum of Trace(P).For example,according to equation4.5,we can calculate its minimums withηrunning from0.1to30with the step size chosen as0.1(as shown in Figure5).Whenηis?xed,it is an LMI problem with17blocks in its

230J.Tu and H.

Figure5:Minimums of trace(X)at differentη.

partitioned matrix.Then we?nd the global minimum of Trace(X)=235.81 and its correspondingη=1.5according to Figure5.It obtains that

7.605.25 5.2517.35

and

5.91

6.33

5.6315.34

,Trace(P)=24.96.

The error curves are shown in Figure6.We use J2and J?2to denote J and J?in this case.According to the data of the error states,J2≈170.76and J?2=V(e0)=298.25,so J2

5.3Results Analysis.It is obvious that J i

6Conclusion

CNN is one of the most important neural networks.With appropriate pa-rameters,it is also a typical chaos generator.In this letter,we present a new guaranteed cost chaotic synchronous control for CNNs with time-varying delay,developed based on stability theory.The restraints on its

Guaranteed Cost Synchronization of Cellular Neural Networks231

Figure6:Synchronization under minimal guaranteed cost control.

time-varying delay terms are removed using Razumikhin’s theorem.The suf?cient condition for guaranteed cost synchronous controller is given in QMI form.With the dif?culty of solving QMIs taken into consideration,the condition is transformed into an LMI problem with the help of lemma2. The further result for the minimization of guaranteed cost is also given.The synchronization effects are shown in the simulations.The cost values and the upper bounds of synchronous control are also calculated to verify the effectiveness of the cost-guaranteed design.

Acknowledgments

We acknowledge the support of the National Natural Science Foundation of China(grant no.60974136).

References

Chen,Y.G.,Bi,W.P.,&Wu,Y.Y.(2010).Less conservative results of state estimation for neural networks with time-varying delay.Neurocomputing,73(7–9),1324–1331. Chua,L.O.,&Yang,L.(1988).Cellular neural networks:Theory.IEEE Transactions on Circuits and Systems I,35(10),1257–1272.

Dai,D.,Hu,T.,&Teel,A.R.(2007).Analysis of systems with saturation/deadzone via piecewise-quadratic Lyapunov functions.In Proceedings of the American Control Conference(pp.5822–5827).doi:10.1109/ACC.2007.4283169.

Fan,Y.,Jiang,Z.P.,&Zhang,H.(2006).Network?ow control under capacity con-straints:A case study.Systems and Control Letters,55(8),681–688.

Fang,H.J.,Lin,Z.L.,&Shamash,Y.(2006).Disturbance tolerance and rejection of linear systems with imprecise knowledge of actuator input output characteristics.

Automatica,42(9),1523–1530.

232J.Tu and H.He Fliegner,T.,Logemann,H.,&Ryan,E.P.(2003).Low-gain integral control of continuous-time linear systems subject to input and output nonlinearities.Auto-matica,39(3),455–462.

Hale,J.K.(1993).Introduction to functional differential equations.Berlin:Springer-Verlag.

He,Z.Y.,Zhang,Y.F.,&Lu,H.T.(1999).The dynamic character of cellular neural network with applications to secure communication.Journal of the China Institute of Communications,20(3),59–67.

Hu,T.S.,Lin,Z.L.,&Chen,B.M.(2002).An analysis and design method for linear systems subject to actuator saturation and disturbance.Automatica,38(2), 351–359.

Hu,T.S.,Teel,A.R.,&Zaccarian,L.(2006).Stability and performance for saturated systems via quadratic and nonquadratic Lyapunov functions.IEEE Transactions on Automatic Control,51(11),1770–1786.

Kebriaei,H.,&Yazdanpanah,M.J.(2010).Robust adaptive synchronization of dif-ferent uncertain chaotic systems subject to input https://www.doczj.com/doc/638197557.html,munications in Nonlinear Science and Numerical Simulation,15(2),430–441.

Khalil,H.K.(2002).Nonlinear systems(3rd ed.).Upper Saddle River,NJ:Prentice Hall.

Kuo,S.M.,Wu,H.T.,Chen,F.K.,&Gunnala,M.K.(2004).Saturation effects in active noise control systems.IEEE Transactions on Circuits and Systems—I:Regular Papers,51(6),1163–1171.

Leine,R.I.(2006).Bifurcations of equilibria in non-smooth continuous systems.

Physica D:Nonlinear Phenomena,223(1),121–137.

Leine,R.I.,&van Campen,D.H.(2006).Bifurcation phenomena in non-smooth dynamical systems.European Journal of Mechanics—A/Solids,25(4),595–616. Leine,R.I.,&van de Wouw,N.(2008).Stability and convergence of mechanical systems with unilateral constraints.Berlin:Springer-Verlag.

Li,L.P.,&Huang,L.H.(2010).Equilibrium analysis for improved signal range model of delayed cellular neural networks.Neural Processing Letters,31(3),177–194.

Li,X.(2009).Analysis of complete stability for discrete-time cellular neural net-works with piecewise linear output functions.Neural Computation,21(5),1434–1458.

Lin,K.H.,&Shih,C.W.(2007).Multiple almost periodic solutions in nonautonomous delayed neural networks.Neural Computation,19(12),3392–3420.

Patricia,P.,&Carlos,D.(2005).Analysis of the BSB model dynamics using control theory.Neural Processing Letters,22(3),345–359.

Qiu,F.,Cui,B.T.,&Ji,Y.(2010).Further results on robust stability of neutral system with mixed time-varying delays and nonlinear perturbations.Nonlinear Analysis: Real World Applications,11(2),895–906.

Shi,T.,Su,H.Y.,&Chu,J.(2010).On stability and stabilization for uncertain stochastic systems with time-delay and actuator saturation.International Journal of Systems Science,41(5),501–509.

Sourlas,D.,Choi,J.,&Manousiouthakis,V.(1994).Best achievable control system performance:The saturation paradox.In Proceedings of the33rd IEEE Conference on Decision and Control(pp.3816–3818).Piscataway,NJ:IEEE Press.

Guaranteed Cost Synchronization of Cellular Neural Networks233 Su,T.J.,Huang,M.Y.,Hou,C.L.,&Lin,Y.J.(2010).Cellular neural networks for gray image noise cancellation based on a hybrid linear matrix inequality and particle swarm optimization approach.Neural Processing Letters,41(5),501–509. Vidal,F.P.,Louchet,J.,Rocchisani,J.M.,&Lutton,E.(2010).New genetic operators in the?y algorithm:Application to medical PET image reconstruction.Lecture Notes in Computer Science,6024,292–301.

Xin,N.,Gan,A.,&Qiu,I.(2008).Stability analysis of linear dynamical systems with saturation nonlinearities and a short time delay.Physics Letters A,372(22), 3999–4009.

Yakoubi,K.,&Chitour,Y.(2007).Linear systems subject to input saturation and time delay:Global asymptotic stabilization.IEEE Transactions on Automatic Control, 52(5),874–879.

Zeng,Z.G.,&Wang,J.(2006).Multiperiodicity and exponential attractivity evoked by periodic external inputs in delayed cellular neural networks.Neural Computa-tion,18(4),848–870.

Zeng,Z.G.,&Wang,J.(2007).Analysis and design of associative memories based on recurrent neural networks with linear saturation activation functions and time-varying delays.Neural Computation,19(8),2149–2182.

Zhang,L.X.,Boukas,E.K.,&Haidar,A.(2008).Delay-range-dependent control synthesis for time-delay systems with actuator saturation.Automatica,44(10), 2691–2695.

Received January3,2011;accepted May22,2011.

Copyright of Neural Computation is the property of MIT Press and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use.

员工入职资料表格汇总26387

入职资料登记表申请职位：入职日期：年月日基本资料姓名性别民族出生年月学历身份证号联系电话身高体重政治面貌是否有驾照及类型婚姻及生育状况户口所在地现居住地紧急联系人联系电话电子邮箱社会统筹情况□养老□医疗□失业□生育□工伤□公积金教育背景起止时间毕业院校专业学历/学位教育性质 □统招□函授□自考□其他 □统招□函授□自考□其他职业资格证书或其他相关证书：时间工作单位、职位离职原因工作经历证明人姓名及联系方式家庭关系姓名年龄工作单位职务联系方式主要

关系招聘渠道：□网络招聘□员工推荐（员工姓名）□人才市场□其他方式其他是否有朋友、亲戚在我公司工作？□是，请说明：□否其他说明事项：公司承诺：此资料将进入公司人才库严格保密，并仅作招聘使用。为全面了解您的优劣势，安排合适的岗位使您扬长避短，请您认真、完整、如实填写。本人承诺：本人授权公司向本人曾任职的公司、介绍人或咨询人查询所有记录，且申明以下提交的一切资料绝对真实，如有不实，可作为被公司辞退的理由，而公司无须做出任何赔偿。填表人确认签名：新员工录用工资确认表姓名录用部门录用岗位入职时间年月日发放日期每月20 日，遇节假日顺延薪酬标准执行①试用期工资：元/ 月；转正后元/月。第种；本岗位工资按公司规定暂实行足额发放。②实行年薪制 ③其他年薪元，试用期工资：元/ 月；转正后元/月；余额根据公司内部规定发放。 ①社会保险福利待遇③其它补助自年月开始缴纳社会保险。（备注说明：）补贴①：试用期发元/月；转正后发元/ 月。

补贴②：试用期发元/月；转正后发元/ 月。以上信息由人力资源部填写，填写人签字确认：确认日期：年月日人力资源部主管领导意见：确认日期：年月日领导签批确认：确认日期：年月日以下信息由新入职员工填写新入职员工身份证号码银行卡号开户行以上薪资及福利内容本人已经知晓，身份证号码、银行卡号、开户行信息由本人自已填写，并确保信息准确无误；因自已填写错误造成的损失由本人承担一切责任。同时本人承诺对自已的薪资福利绝对保密，如自已泄露愿接受公司的一切处理，直至解除劳动合同给予辞退。新入职员工确认签字：确认日期：年月日本表一式一份，仅供人事部与新录用员工核对薪资福利信息用，在经领导核定并经新录用员工签字备注说明确认后作为发放工资的依据。领导核定签批后原件留存于财务部门，人力资源部留存复印件。

新员工入职资料

入职登记表个人基本信息姓名性别民族相片籍贯学历政治面貌婚姻状况□已婚有子女□已婚无子女□未婚□其他现住地址身份证号本人联系电话身份证住址提交资料 (复印件) □身份证□学历证□其他紧急联系人紧急联系人（请填写常住地的亲友）姓名关系工作单位和现住址紧急联系人电话家庭成员姓名关系工作单位家人联系电话健康信息利手：□左□右是否怀孕：□无□有是否曾被认定工伤或持有残疾人证明：□无□有：是否有重大疾病或家族病史：□无□有：是否从事过特别繁重体力劳动及有毒有害工种：□无□有：是否有职业病或慢性影响工作的疾病：□无□有：教育培训起止时间就读学校学历专业持有证书工作经历起止时间工作单位职位离职原因证明人/电话

单位意见：员工签名：年月日入职承诺书本人 , 男/女，学历：，身份证号码： , 1.本人在填写本《入职登记表》时，已保证自己符合国家法定的劳动年龄的标准，且与其他任何用人单位、机构、组织、团体无劳动关系；若违反前述承诺，导致用人单位被追究有关经济责任的，所有责任均由本人承担。 2.本人在填写《入职登记表》时，用人单位已如实告知工作内容、工作地点、工作条件、职业危害、安全生产状况、劳动报酬以及本人所需要了解的所有情况。 3.本人如有传染病、精神病或其他可能影响用人单位工作的病史，本人应以书面形式向用人单位说明。 4.本人承诺已与原单位解除劳动关系，且无仍然生效的保密协议、竞业限制协议。 5.本人填写的《入职登记表》所有信息真实有效，如有任何虚假，用人单位可按严重违反规章制度解除劳动合同，同时承担因此引起的所有责任。 6.本人承诺对用人单位相关信息（包括但不限于工资）承担保密责任。 7.如《入职登记表》中的信息有变化，本人有责任以书面形式向用人单位人事部门提交最新的信息。 8.本人承诺在试用期满经考核合格后即与用人单位签订劳动合同，本人将认真阅读并遵守各项规章制度。 9.本人承诺在用人单位任职期间不从事任何兼职行为。 10.本人所填写的通讯方式（包括地址、手机）均为有效，用人单位向任一通讯方式寄送或发出的文件或物品，如果发生收件人拒绝签收和已发送成功均视为送达。 11.本人承诺无被追究刑事责任记录，如有应以书面形式告知用人单位，如隐瞒事实真相，一切法律后果由本人承担。 12、本人承诺，遵守以下各项入职时的甲乙双方达成的约定：： ①新入职员工的试用期范围为一至三个月，用人单位将视试用期绩效考核确定转正期限。 ②员工在试用期需提前3日书面申请辞职，试用期满后离职必须提前一个月以书面形式向用人单位递交辞职申请，待用人单位批准后按指定日期办理工作交接，双方确认无误后方可离职。 ③凡未经批准或未办理正式离职交接手续而自行离职的员工，均视为自动离职，用人单位有权停发其工作期间的工资，作为离职后给公司带来损失的补偿。 ④自愿遵守公司规章制度，若在试用期3天内（含3天）不合适或自离的，不予工资结算。本人已充分了解上述资料的真实性是双方订立劳动合同的前提条件，本人填写的以上任何信息虚假

新员工入职流程通用版

新员工入职流程New employee orientation process 入职准备 1、人力中心向合格者发送《录用通知书》； 2、确认新员工报到日期,通知新员工在报到之前来公司明确报到需注意事项：所需资料、体检以及其他须知； 3、通知人事助理新员工报到日期，人事助理准备好新员工入职手续办理所需表单并负责依据《新员工入职通知单》内容落实各项工作： --用人部门负责安排办公位，申领电脑、电话； --行政办负责发放办公用品； --信息组负责开通邮箱、帐号、调试电脑设备等。 2入职报到 1、人力中心向新员工发放《新员工报到工作单》，并按要求办理入职手续： --员工填写《应聘登记表》，并交验各种证件：一寸免冠照片3张；身份证原件或户口复印件；学历、学位证书原件（学生提供学生证原件）；资历或资格证件原件；与原单位解除或终止劳动合同的证明；体检合格证明； --与员工签订劳动合同、保密协议、职位说明书； --建立员工档案、考勤卡； --介绍公司情况，引领新员工参观公司、介绍同事； --将新员工移交给用人部门； --OA网上发布加盟信息更新员工通讯录。 2、用人部门负责的工作 --负责安置座位，介绍并帮助熟悉工作环境； --制定专人作为新员工辅导员，介绍岗位职责和工作流程[1]。 3入职手续 1、填写《员工履历表》。 2、发放向新员工介绍公司情况及管理制度的《制度汇编》，使其具备基本公司工作知识，要求其通过公司内部网络了解进一步情况。 3、按照《新员工入职手续清单》逐项办理入职手续。 4、确认该员工调入人事档案的时间。 5、向新员工介绍管理层。 6、带新员工到部门，介绍给部门总经理。

(完整版)HR-9新员工入职办理流程及员工档案资料清单

一、新员工入职办理流程第1步：新员工报到，人事专员接待（谁招聘谁办理）。第2步：人事专员先收集：员工应提供的资料，核对并复印。第3步：人事专员提供我方应准备的资料：劳动合同、保密协议、告知函、人事制度等，给新员工学习，并讲解，时间控制在15分钟以内。第4步：告知其薪酬为面试时的约定，一周内由财务来核定其薪酬如何切分。第5步：员工签订相关资料后，用手机钉钉通知IT部，开通邮箱/钉钉等权限，开通后由IT部发到其钉钉上。第6步：人事讲解公司基本考勤制度。第7步：人事介绍公司/部门/岗位基本情况。第8步：人事协助员工安装钉钉，并讲解基本的钉钉使用技能。第9步：引领员工，认识主要部门负责人，并熟悉公司环境。第10步：引导员工：到IT部领取电脑设备，到行政部领取办公用品。第11步：引导员工到部门负责人处报到，并安排好办公桌。第12步：邮箱发送新员工报道通告，员工档案转交。第13步：员工入职报到流程结束。二、员工基本档案资料员工提供资料： 1.身份证原件、复印件，公司核对原件，留存复印件； 2.学历证书原件、复印件、学位证书原件、复印件（一般为最高学历），公司核对原件，留存复印件； 3.专业技术职称证书原件、职业资格证书原件、上岗证书原件，公司核对原件，留存复印件； 4.上家公司离职证明（原件）； 5.上家公司劳动合同，公司核对原件，留存复印件； 6.体检报告：最近三个月内、三甲医院体检证明原件； 7.银行卡复印件（标配光大银行卡，入职一个星期后收取）； 8.就业失业登记证（上海户籍员工）；

9.公积金账号；人事专员准备资料： 10.个人简历； 11.员工求职/入职信息登记表； 12.面试评估表（给入职者看薪资）； 13.劳动合同（需签收）； 14.保密协议（需签收）； 15.用人单位基本信息告知函。

新员工入职资料审核标准

入职资料审核标准一、审核原则： 1、完整性：所有资料务必全部准备齐全，否则不予办理正式入职手续。 2、真实性：所有资料务必全部真实，如若查出伪造证件，不予办理入职手续。二、详细内容 1.照片 A、规格：一寸彩色照片； B、数量：4张； C、要求：务必在每张照片背后写上姓名，以方便查询； D、范围：往届、应届毕业生、实习生、兼职等均需提供。 2. 身份证 A、规格：原件核查，只收取复印件； B、数量：4份； C、要求：身份证正反面复印在一张A4纸上； D、范围：往届、应届毕业生、实习生、兼职等均需提供。 3. 毕业证、学位证 A、规格：原件核查，只收取复印件； B、数量：各1份； C、要求：分开复印，均复印在A4纸上； D、范围：往届、应届毕业生、兼职等均需提供，实习生暂不提供。 4. 体检报告 A、规格：原件核查，只收取复印件； B、数量：1份； C、要求：必查项目健康，无其它严重疾病。注意传染性疾病的核实； D、范围：往届、应届毕业生、兼职等均需提供，实习生暂不提供。 5、E-HR个人信息 A、规格：外网登陆门户主页https://www.doczj.com/doc/638197557.html,.“XXX”部分，选择、进入“人才库”，进行在线录入； B、数量：1次； C、要求：所填的信息必须真实、完整，打印后签字确认； D、范围：往届、应届毕业生、实习生、兼职等均需提供。 6、原单位离职证明 A、规格：原件核查，只收取复印件； B、数量：1份；

C、要求：必须有离现在最近的工作单位人事或公司公章盖章； D、范围：往届毕业生需提供，其他不提供。 7、户口本复印件1份，用于办理社会保险（要求：户口本首页和个人信息页复印到一张A4纸上，其中户口本首页说明了您的户籍性质；亦可提交户籍证明或户籍卡复印件）。 A、规格：户口本复印件或户籍证明、户籍卡复印件； B、数量：1份； C、要求：如果是户口本复印件，户口本首页和个人信息页复印到一张A4纸上（其中户口本首页说明了您的户籍性质）；如果是户籍证明，需要有户档保管单位的签章；如果是户籍卡，只需要复印件即可。 D、范围：往届、应届毕业生等均需提供，实习生、兼职暂不提供。

企业新员工入职流程及六大步骤

企业新员工入职流程及六大步骤企业新员工入职流程主要共分为六大步骤：一、入职准备；二、入职报到；三、入职手续；四、入职培训；五、转正评估；六、入职结束。入职准备 1、人力中心向合格者发送《录用通知书》 2、用人部门助理负责依据《新员工入职通知单》内容落实各项工作 --用人部门负责安排办公位，申领电脑、电话； --行政办负责发放办公用品； --信息组负责开通邮箱、帐号、调试电脑设备等。入职报到 1、人力中心向新员工发放《新员工报到工作单》，并按要求办理入职手续：--员工填写《员工登记表》，并交验各种证件：一寸免冠照片3张；身份证原件或户口复印件；学历、学位证明原件；资历或资格证件原件；与原单位解除或终止劳动合同的证明；体检合格证明

--与员工签订劳动合同、保密协议、职位说明书 --建立员工档案、考勤卡、 --介绍公司情况，引领新员工参观公司、介绍同事 --将新员工移交给用人部门； --OA网上发布加盟信息更新员工通讯录 2、用人部门负责的工作 --负责安置座位，介绍并帮助熟悉工作环境； --制定专人作为新员工辅导员，介绍岗位职责和工作流程入职手续 1、填写《员工履历表》。 2、发放向新员工介绍公司情况及管理制度的《制度汇编》，使其具备基本公司工作知识，要求其通过公司内部网络了解进一步情况。 3、按照《新员工入职手续清单》逐项办理入职手续。 4、确认该员工调入人事档案的时间。 5、向新员工介绍管理层。 6、带新员工到部门，介绍给部门总经理。 7、将新员工的情况通过E-mail和公司内部刊物向全公司公告。 8、更新员工通讯录。 9、签订《劳动合同》入职培训 1、组织新员工培训。 2、不定期举行由公司管理层进行的企业发展历程、企业文化、各部门职能与关系等方面的培训。转正评估 1、转正是对员工的一次工作评估的机会，也是公司优化人员的一个重要组

新员工入职资料

入职登记表

入职承诺书本人 , 男/女，学历：，身份证号码： , 1.本人在填写本《入职登记表》时，已保证自己符合国家法定的劳动年龄的标准，且与其他任何用人单位、机构、组织、团体无劳动关系；若违反前述承诺，导致用人单位被追究有关经济责任的，所有责任均由本人承担。 2.本人在填写《入职登记表》时，用人单位已如实告知工作内容、工作地点、工作条件、职业危害、安全生产状况、劳动报酬以及本人所需要了解的所有情况。 3.本人如有传染病、精神病或其他可能影响用人单位工作的病史，本人应以书面形式向用人单位说明。 4.本人承诺已与原单位解除劳动关系，且无仍然生效的保密协议、竞业限制协议。 5.本人填写的《入职登记表》所有信息真实有效，如有任何虚假，用人单位可按严重违反规章制度解除劳动合同，同时承担因此引起的所有责任。 6.本人承诺对用人单位相关信息（包括但不限于工资）承担保密责任。 7.如《入职登记表》中的信息有变化，本人有责任以书面形式向用人单位人事部门提交最新的信息。 8.本人承诺在试用期满经考核合格后即与用人单位签订劳动合同，本人将认真阅读并遵守各项规章制度。 9.本人承诺在用人单位任职期间不从事任何兼职行为。 10.本人所填写的通讯方式（包括地址、手机）均为有效，用人单位向任一通讯方式寄送或发出的文件或物品，如果发生收件人拒绝签收和已发送成功均视为送达。 11.本人承诺无被追究刑事责任记录，如有应以书面形式告知用人单位，如隐瞒事实真相，一切法律后果由本人承担。 12、本人承诺，遵守以下各项入职时的甲乙双方达成的约定：： ①新入职员工的试用期范围为一至三个月，用人单位将视试用期绩效考核确定转正期限。 ②员工在试用期需提前3日书面申请辞职，试用期满后离职必须提前一个月以书面形式向用人单位递交辞职申请，待用人单位批准后按指定日期办理工作交接，双方确认无误后方可离职。 ③凡未经批准或未办理正式离职交接手续而自行离职的员工，均视为自动离职，用人单位有权停发其工作期间的工资，作为离职后给公司带来损失的补偿。 ④自愿遵守公司规章制度，若在试用期3天内（含3天）不合适或自离的，不予工资结算。本人已充分了解上述资料的真实性是双方订立劳动合同的前提条件，本人填写的以上任何信息虚假或没有履行以上特别说明的义务，无论任何时候被发现，本人均同意被用人单位视为严重违反《劳动合同法》的诚实信用原则以及用人单位的规章制度，用人单位可以解除劳动合同且不用支付经济补偿金。入职承诺人签名：日期：年月日

新员工入职所需携带资料

新员工入职所需携带资料： 1、一寸白底彩色照片4张，电子版数码照公司留底。 2、相关学历证书及复印件。 3、户口本复印件（首页及本人页） 4、原单位的离职证明。 5、二代身份证复印件（正反面）。 6、北京农村商业银行的银行卡。 7、健康证明或体检报告（一年以内的）新员工入职所需携带资料： 1、一寸白底彩色照片4张，电子版数码照公司留底。 2、相关学历证书及复印件。 3、户口本复印件（首页及本人页） 4、原单位的离职证明。 5、二代身份证复印件（正反面）。 6、北京农村商业银行的银行卡。 7、健康证明或体检报告（一年以内的）新员工入职所需携带资料： 1、一寸白底彩色照片4张，电子版数码照公司留底。 2、相关学历证书及复印件。 3、户口本复印件（首页及本人页） 4、原单位的离职证明。 5、二代身份证复印件（正反面）。 6、北京农村商业银行的银行卡。 7、健康证明或体检报告（一年以内的）新员工入职所需携带资料： 1、一寸白底彩色照片4张，电子版数码照公司留底。 2、相关学历证书及复印件。 3、户口本复印件（首页及本人页） 4、原单位的离职证明。 5、二代身份证复印件（正反面）。 6、北京农村商业银行的银行卡。 7、健康证明或体检报告（一年以内的）新员工入职所需携带资料： 1、一寸白底彩色照片4张，电子版数码照公司留底。 2、相关学历证书及复印件。 3、户口本复印件（首页及本人页） 4、原单位的离职证明。 5、二代身份证复印件（正反面）。 6、北京农村商业银行的银行卡。 7、健康证明或体检报告（一年以内的）新员工入职所需携带资料： 1、一寸白底彩色照片4张，电子版数码照公司留底。 2、相关学历证书及复印件。 3、户口本复印件（首页及本人页） 4、原单位的离职证明。 5、二代身份证复印件（正反面）。 6、北京农村商业银行的银行卡。 7、健康证明或体检报告（一年以内的）新员工入职所需携带资料： 1、一寸白底彩色照片4张，电子版数码照公司留底。 2、相关学历证书及复印件。 3、户口本复印件（首页及本人页） 4、原单位的离职证明。 5、二代身份证复印件（正反面）。 6、北京农村商业银行的银行卡。 7、健康证明或体检报告（一年以内的）

员工基本资料卡

出生日期 1/2 FOR-120,A

员工入厂规定须知一、入厂前辨理手续应缴交1.有效身份证 2.毕业证 3.未(已)婚证 4.相片三张 5.健康证明缺少上列任何一项证件，未能辨理入厂手续者以试工不合格处理。二、入厂后发现上列证件有不符或作假情形，以自动离厂处理。三、工作不满十五天辞工及被解雇者，公司不发给工资。四、试工期为三个月，试用未能达要求无条件接受厂方处理。(新进厂的时间以整月计，只要破月都计)，满三个月再考核与考试，合格通过以成绩评估调薪额度。五、本公司免费提供住宿及伙食于正式员工，新进员工入厂未满一年离职(含辞工、开除)本公司将追扣试用期间之住宿伙食费(伙食费3元宿舍管理费2元每日5元人民币)，以进厂日累计至试工合格日止。六、住宿与伙食依本公司员工干部住宿福利制度执行。七、文員及主管離職需提前30日，普通作業員需提前15日遞交辭職申請單。经核准后即日生效，未满時間離職者依劳工法扣除30日工资。八、工资发放依照本公司薪资结构制度执行。九、确实遵守厂规，自愿接受工作调度与加班安排，如有违反，皆依厂规处理，绝无异议。十、有下列严重情节者，视情节轻重予以罚款或开除处分。 a. 无故旷工半日或一个月内无故旷工三日以上者。 b. 无故抗令或侮辱压迫干部主管人员者。 c. 厂内禁烟区吸烟、饮酒闹事、赌博或有伤风化行为者。 d. 聚众或先动手打架、煽动教唆怠工、停工、罢工之行为者。 e. 毁损盗窃公司或他人财物，文件及造谣生事敲诈行为者。 f. 未经主管人员书面同意，操作非本人之机器或本人操作之机器供他人操作者。以上各项本人全部已看阅仔细并完全了解无误. 保证书本人诚蒙xxx录用，于任用期间，愿意保证任职一年以上并遵守上列规定裁决，若造成公司一切损失，本人愿负赔偿责任，绝无怨言与异议，特立此书。此致年月日身份证号：签章： 2/2 FOR-120,A