检索结果-南通市图书馆

A linear.r.dgelet networ. ap.r.ach for.fault diagnosis of analog cir.uit

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第11期53卷 2251-2264页

作者： XIAO YingQun& HE YiGang college of electrical and information engineering, Hunan university, changsha 410082, china college of electrical and information engineering Hunan University

A linear.r.dgelet networ. combining r.dgelet, linear.ter. and the standar. feed-for.ar. neur.l networ. used for.diagnosing the faults of analog cir.uit is constr.cted, and a tr.ining algor.thm based on the steep.st gr.dient descent method and momentum method for.this networ. and the p.ocedur. for.diagnosing these faults ar. p.op.sed. The r.sulting linear.r.dgelet networ. can lear. mor. r.p.dly fr.m tr.ining samp.es and handle mor. effectively the comp.icated fault information of cir.uit under.test than wavelet networ. and r.dgelet networ., classifying these faults effeciently and cor.ectly and achieving a high classification accur.cy. The simulation r.sults demonstr.te the effectiveness of this ap.r.ach.

关键词： fault diagnosis of analog cir.uit r.dgelet linear.r.dgelet networ. wavelet p.cket decomp.sition

A Heur.stic for.the Job Scheduling p.oblem with a Common Due Window on p.r.llel and Non-Identical Machines

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Jour.al of Systems engineering and Electr.nics 2001年第2期12卷 6-11页

作者： Huang Decai college of information engineering, Zhejiang university of technology,Hangzhou 310014, p. r. china college of information engineering Zhejiang University of Technology Hangzhou 310014 P. R. China

In this p.p.r. we give a mathematical model for.ear.iness-tar.iness job scheduling p.oblem with a common due window on p.r.llel and non-identical machines. Because the job scheduling p.oblem discussed in the p.p.r.contains a p.oblem of minimizing make-sp.n, which is Np.comp.ete on p.r.llel and unifor. machines, a heur.stic algor.thm is p.esented to find an ap.r.ximate solution for.the scheduling p.oblem after.p.oving an imp.r.ant theor.m. Two numer.cal examp.es illustr.te that the heur.stic algor.thm is ver. useful and effective in obtaining the near.op.imal solution.

关键词： Common due window Job scheduling Ear.iness-tar.iness JIT.

Ap.r.ximately op.imal tr.cking contr.l for.discr.te time-delay systems with distur.ances

在线全文

学校读者我要写书评

暂无评论

p.ogr.ss in Natur.l science:Mater.als Inter.ational 2008年第2期18卷 225-231页

作者： Gongyou Tang a,,Huiying Sun b,Haip.ng p.ng c a college of information science and engineering,Ocean university of china,Qingdao 266100,china b college of information and electrical engineering,Shandong university of science and technology,Qingdao 266510,china c college of Automation and Electr.nic engineering,Qingdao university of science and technology,Qingdao 266042,china college of information science and engineering Ocean University of China Qingdao 266100 China college of information and electrical engineering Shandong University of Science and Technology Qingdao 266510 China college of Automation and Electr.nic engineering Qingdao University of Science and Technology Qingdao 266042 China

Op.imal tr.cking contr.l (OTC) for.discr.te time-delay systems affected by p.r.istent distur.ances with quadr.tic p.r.or.ance index is consider.d. By intr.ducing a sensitivity p.r.meter.the or.ginal OTC p.oblem is tr.nsfor.ed into a ser.es of two-p.int boundar. value (Tp.V) p.oblems without time-advance or.time-delay ter.s. The obtained OTC law consists of analytic feedfor.ar. and feedback ter.s and a comp.nsation ter. which is the sum of an infinite ser.es of adjoint vector.. The analytic feedfor.ar. and feedback ter.s can be found by solving a r.ccati matr.x equation and two Stein matr.x equations. The comp.nsation ter. can be obtained by using an iter.tion for.ula of the adjoint vector.. Obser.er. ar. constr.cted to make the ap.r.ximate OTC law p.ysically r.alizable. A simulation examp.e shows that the ap.r.ximate ap.r.ach is effective in tr.cking the r.fer.nce inp.t and r.bust with r.sp.ct to exogenous p.r.istent distur.ances.

关键词： Discr.te systems Time-delay systems Distur.ances Op.imal contr.l Tr.cking contr.l

D(β)-ver.ex-distinguishing total color.ng of gr.p.s

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china Mathematics 2006年第10期49卷 1430-1440页

作者： ZHANG Zhongfu,LI Jingwen,CHEN Xiang’en,YAO Bing, WANG Wenjie & QIU p.ngxiang Institute of Ap.lied Mathematic, Lanzhou Jiaotong university, Lanzhou 730070, china college of Mathematics and information science, Nor.hwest Nor.al university, Lanzhou 730070, china college of information and electrical engineering, Lanzhou Jiaotong university, Lanzhou 730070, china Institute of Ap.lied Mathematic Lanzhou Jiaotong University Lanzhou China college of Mathematics and information science Northwest Normal University Lanzhou China college of information and electrical engineering Lanzhou Jiaotong University Lanzhou China

A new concep. of the D(β)-ver.ex-distinguishing total color.ng of gr.p.s, i.e., the p.op.r.total color.ng such that any two ver.ices whose distance is not lar.er.than β have differ.nt color.sets, wher. the color.set of a ver.ex is the set comp.sed of all color. of the ver.ex and the edges incident to it, is p.op.sed in this p.p.r. The D(2)-ver.ex-distinguishing total color.ngs of some sp.cial gr.p.s ar. discussed, meanwhile, a conjectur. and an op.n p.oblem ar. p.esented.

关键词： gr.p., total color.ng, D(β)-ver.ex-distinguishing total color.ng, D(β)-ver.exdistinguishing total chr.matic number.

Dynamic scheduling model of comp.ting r.sour.e based on MAS coop.r.tion mechanism

在线全文

学校读者我要写书评

暂无评论

science in china(Ser.es F) 2009年第8期52卷 1302-1320页

作者： JIANG WeiJin1,2, ZHANG LianMei3 & WANG p.4 1 School of Comp.ter.and Electr.nic engineering, Hunan university of Commer.e, changsha 410205, china 2 School of information engineering, Xiangtan university, Xiangtan 411000, china 3 electrical engineering college, Wuhan university, Wuhan 430072, china 4 School of Commer.e, Centr.l South university, changsha 410083, china School of Comp.ter.and Electr.nic engineering Hunan University of Commerce School of information engineering Xiangtan University electrical engineering college Wuhan University School of Commer.e Central South University

Allocation of gr.d r.sour.es aims at imp.oving r.sour.e utility and gr.d ap.lication p.r.or.ance. Cur.ently, the algor.thms p.op.sed for.this p.r.0}se do not fit well the autonomic, dynamic, distr.butive and heter.geneous featur.s of the gr.d envir.nment. Accor.ing to MAS （multi-agent system） coop.r.tion mechanism and mar.et bidding game r.les, a model of allocating allocation of gr.d r.sour.es based on mar.et economy is intr.duced to r.veal the r.lationship.between sup.ly and demand. This model can make good use of the studying and negotiating ability of consumer.＇ agent and takes full consider.tion of the consumer.s behavior. thus r.nder.ng the ap.lication and allocation of r.sour.e of the consumer. r.tional and valid. In the meantime, the utility function of consumer.is given; the existence and the uniqueness of Nash equilibr.um p.int in the r.sour.e allocation game and the Nash equilibr.um solution ar. discussed. A dynamic game algor.thm of allocating gr.d r.sour.es is designed. Exp.r.mental r.sults demonstr.te that this algor.thm diminishes effectively the unnecessar. latency, imp.oves significantly the smoothness of r.sp.nse time, the r.tio of thr.ughp.t and r.sour.e utility, thus r.nder.ng the sup.ly and demand of the whole gr.d r.sour.e r.asonable and the over.ll gr.d load balanceable.

关键词： multi-agent system (MAS) r.sour.e scheduling model evolutionar. game coop.r.tion mechanism utility function

ON THE ALMOST SUr.LY ASYMp.OTIC BOUNDS OF A CLASS OF Or.STEIN-UHLENBECK p.OCESSES IN INFINITE DIMENSIONS

在线全文

学校读者我要写书评

暂无评论

Jour.al of Systems science & Comp.exity 2008年第3期21卷 416-426页

作者： Yuhong LI college of Hydr.p.wer.and information engineering Huazhong University of Science and Technology Wuhan 430074 China

Given a r.al-valued sep.r.ble M-typ. 2 Banach sp.ce X with the p.th p.wer.of the nor. of C2-class, the almost sur. asymp.otic up.er.bounds of the solutions of the Or.stein-Uhlenbeck p.ocesses descr.bed by the following equations {dz（t）=A（t,z（t））dt＋σ（t,z（t））dW（t）,z（0）=z0∈X,ar. investigated. This study gener.lizes the cor.esp.nding well-known finite dimensional r.sults of Lap.yr. （1989） and Mao （1992）.

关键词： Almost sur.ly asymp.otic bounds infinite dimension M-typ. 2 Banach sp.ce Or.stein-Uhlenbeck p.ocesses

Imp.oving TCp.p.r.or.ance over.Wir.less Links Using Link-Layer.r.tr.nsmission and Exp.icit Loss Notification

在线全文

学校读者我要写书评

暂无评论

Jour.al of Systems engineering and Electr.nics 2002年第4期13卷 17-23页

作者： Zhou Zhizhao & Han Zhengzhi college of Electr.nic and information engineering, Shanghai Jiaotong university, Shanghai 200030, p. r. china college of Electr.nic and information engineering Shanghai Jiaotong University Shanghai 200030 P. R. China

In or.er.to sup.or. the mobility of comp.ter. dur.ng communication, the tr.nsp.r. contr.l p.otocol (TCp. connections between fixed host and mobile host often tr.ver.e wir.d and wir.less networ.s, and the r.cover. of the losses due to wir.less tr.nsmission er.or.is much differ.nt fr.m congestion contr.l. This p.p.r.analyzes the inter.ction between TCp.and link layer.r.tr.nsmission scheme when the cor.elated p.cket ar. losses handled, indicates that a higher.value of the maximum number.of successive link layer.timeout r.tr.nsmissions has an adver.e effect on TCp.ability to p.r.or. congestion contr.l r.p.dly. To achieve a better.TCp.p.r.or.ance, the p.p.r.p.op.ses a str.tegy combining link-layer.selective-r.ject automatic r.p.at r.quest (Ar.) with exp.icit loss notification mechanism, which can r.sp.nd to congestion quickly while keep.ng wir.less link mor. r.liable, and make TCp.r.act to the differ.nt p.cket losses mor. suitably.

关键词： Congestion contr.l (communication) Mechanisms p.r.or.ance Tr.nsmissions

Lattice dynamical simulation of methane hydr.te

在线全文

学校读者我要写书评

暂无评论

Jour.al of Natur.l Gas Chemistr. 2010年第1期19卷 43-46页

作者： Lin Wang, Shunle Dong p.ysics Dep.r.ment, college of information science and engineering, Ocean university of china, Qingdao 266100, Shandong, china p.ysics Dep.r.ment College of Information Science and Engineering Ocean University of China Qingdao 266100 Shandong China

INS （Inelastic Neutr.n Scatter.ng） sp.ctr.m of methane hydr.te was measur.d on MAr. （a dir.ct-geometr. chop.er.sp.ctr.meter. at r.ther.for. Ap.leton Labor.tor., UK. Comp.r.d with ice Ih, it is found that the whole sp.ctr.m of methane hydr.te moves towar. high-ener.y by about 1.5 meV. Using lattice dynamical （LD） technique, comp.ter.simulations of methane hydr.te wer. car.ied out. In the simulations, four.p.tential models （BE TIp.p. TIp.p. MCY） wer. emp.oyed to calculate the p.onon density of states （p.OS）. Comp.r.ng the calculated p.OS sp.ctr.m with the exp.r.mental sp.ctr.m, it is found that BF, TIp.p. and TIp.p.p.tential lattices give out well-sep.r.ted tr.nslational and libr.tional bands while MCY p.tential lattice is unstable to do so and this model is not suitable to descr.be hydr.te system.

关键词： methane hydr.te inelastic neutr.n scatter.ng lattice dynamical simulation

p.edictor.cor.ector.inter.or.p.int algor.thm for.linear.y constr.ined convex p.ogr.mming

在线全文

学校读者我要写书评

暂无评论

Jour.al of Centr.l South university 2001年第3期13卷 208-212页

作者： LIANG Xi-ming (college of information science & engineering, Centr.l South university, Changsh a 410083, china) college of information science & engineering Central South University Changsha China

Active set method and gr.dient p.ojection method ar. cur.e nt ly the main ap.r.aches for.linear.y constr.ined convex p.ogr.mming. Inter.or.p. int method is one of the most effective choices for.linear.p.ogr.mming. In the p.ap.r.a p.edictor.cor.ector.inter.or.p.int algor.thm for.linear.y constr.ined c onvex p.ogr.mming under.the p.edictor.cor.ector.motivation was p.op.sed. In eac h iter.tion, the algor.thm fir.t p.r.or.s a p.edictor.step.to r.duce the dualit y gap.and then a cor.ector.step.to keep.the p.ints close to the centr.l tr.ject or.. Comp.tations in the algor.thm only r.quir. that the initial iter.te be nonn egative while feasibility or.str.ct feasibility is not r.quir.d. It is p.oved th at the algor.thm is equivalent to a level-1 p.r.ur.ed comp.site Newton method. Numer.cal exp.r.ments on twenty-six standar. test p.oblems ar. made. The r.sult s show that the p.op.sed algor.thm is stable and r.bust.

关键词： linear.y constr.ined convex p.ogr.mming p.edictor cor.ector.inter.or p.int algor.thm numer.cal exp.r.ment