Two Methods to Release a New Real-time Task
|
|
- Theresa Parker
- 5 years ago
- Views:
Transcription
1 Two Methods to Release a New Real-tme Task Abstract Guangmng Qan 1, Xanghua Chen 2 College of Mathematcs and Computer Scence Hunan Normal Unversty Changsha, , Chna qqyy@hunnu.edu.cn Gang Yao 3 Sebel Center for Computer Scence 201 N. Goodwn Avenue Urbana, IL 61801, USA. yaog99@gmal.com In some real-tme systems, sometmes there s a need to nsert a new task at run tme. If the system s fully loaded, the scheduler has to compress one or more current tasks to free some bandwdth. Naturally, fndng the earlest tme to start the nserton wthout deadlne mssng s nterestng, whch s stll under nvestgaton. Instead of ths, ths paper dscusses how to do the compresson and nserton to make the nserton as early as possble, based on the conclusons n the publshed lterature wth the earlest deadlne frst algorthm(edf). By ntroducng the nstance remanng bandwdth(rb), an algorthm called maxmum remanng bandwdth compresson(mrbc) s provded to choose a proper task as the compressed one. An assocated theorem and ts lemma are also provded, whch declares that the safety adjustment can be mplemented mmedately upon request f the ncrease of the bandwdth due to nserton does not exceed the lowest utlzaton of ndvdual current tasks n the system and f every task s allowed to be compressed. Another algorthm named part utlzaton frst(puf) s also proposed, accordng to whch a new task s nserted wth a lower speed frst, then to ts full utlzaton after a certan tme. Keywords: remanng bandwdth; task nserton; real-tme system; deadlne. I. INTRODUCTION The utlzaton of a real-tme task s often referred to as ts bandwdth n perodc real-tme systems. Wth a fully loaded system scheduled wth EDF, the sum of the utlzatons of the tasks n the system s equal to 1 [1]. In ths case, f a new task requests to be nserted, the system wll become unschedulable,.e. deadlne mssng wll occur. Compressng one or more current tasks (decreasng ther utlzatons) to free some bandwdth s usually a way to tackle ths [2, 3]. In [2], Buttazzo presented an elastc schedulng model for the task set based on EDF, the problem of new tasks nserton was dscussed n detal [2, 4]. An expresson was gven to calculate the tme the nserton can be done wthout deadlne mssng. A deeper research was made and a modfed expresson was proved to evaluate an earler tme n [3], whch s the concluson to date wth the problem of nserton wth EDF. Fndng the earlest tme for startng the nserton wthout deadlne mssng s nterestng, whch s stll under nvestgaton. The purpose of ths paper s not on ths, but on the choce of a proper task for compressng and the way of the release of the new task to make the nserton as early as possble. By ntroducng the remanng bandwdth of an nstance, an algorthm s provded to choose a proper task as the compressed one. A useful theorem and ts lemma are also provded, whch declares that the safety adjustment can be mplemented mmedately upon request f the ncrease of the bandwdth due to nserton does not exceed the lowest utlzaton of ndvdual current tasks n the system and every task s allowed to be compressed. The part utlzaton frst algorthm s also proposed, accordng to whch a new task s nserted wth a lower speed frst, then to ts full utlzaton after a certan tme. In the next secton, two requrements wth task nserton are revewed. The concept of the remanng bandwdth s defned n Secton III, based on whch the algorthm MRBC s descrbed and the theorem for judgng mmedate nserton s provded. The PUF algorthm s also proposed n ths secton. The paper concludes n secton IV. Ths work has been supported by Hunan Provncal Natural Scence Foundaton of Chna under grant agreement No. 09JJ5040. ISSN : Vol. 3 No. 1 Feb-Mar
2 II. TWO REQUIREMENTS In Fgure 1, suppose there are two tasks n a real-tme system, 0 (8,16) and 1 (12,24). The task model s (C,T ), where C s ts computaton, T s ts perod, and utlzaton U = C /T. In ths example, we have U 0 =C 0 /T 0 =8/16=1/2, and U 1 =C 1 /T 1 =12/24=1/2. The total utlzaton of the task set s U =U 0 + U 1 =1, whch ndcates the system s schedulable based on EDF and fully loaded. Fgure 1 shows ts part of executon. If at some tme t r, a new task 2 (1,4) requests to run. Because U= U 0 + U 1 + U 2 =1+1/4>1 makes the new task set unschedulable, so certan bandwdth has to be freed from current tasks. Let us compress 0 (8,16) to 0 (8,32) so that U 0 =1/4 and U = U 0 + U 1 + U 2 =1. However, both [2] and [3] ponted out that even f U 1 after nserton, deadlne mssng may occur f the nserton of 2 s too early. The operaton of compresson nserton s anyway a type of nterference n the runnng system. Fgure 1. The schedulng of a smple task set It s not welcome that any deadlne s mssed for any task, even lower prorty tasks. An accurate schedulng algorthm should behave as what t declares. For example, f an Internet Servce Provder declares that the bandwdth allocated to a user s decreased, then the decreased bandwdth should be guaranteed. Therefore, generally, the frst requrement for the nserton of a new task s smooth,.e. no deadlne wll be mssed after nserton. A tme pont from whch on a smooth nserton can be mplemented s called a smooth nserton tme. Fgure 2. An example of smooth nserton Agan take the example n Fgure 1. Suppose t r =6 and the perod of 0 s prolonged from 16 to 32. The remanng computaton tme of the current nstance of 0 s equal to C 0 (t r )= C 0 (6)=2. Accordng to [2], a smooth nserton tme 0 =12 can be calculated. Comparatvely, an earler smooth nserton pont from [3] s = 0 =8. Fgure 2 shows the smooth nserton based on [3]. Although an earler smooth nserton tme may be evaluated from [3] than from [2], the accurate algorthm for the earlest smooth tme s stll under nvestgaton. Let us lst the expresson of n [3] as Equaton (1) for convenence. ' C ( tr ) δ d. ' U U ISSN : Vol. 3 No. 1 Feb-Mar
3 Where d represents the deadlne of the current nstance of the compressed task. C (t r ) s ts remanng computaton tme up to d. U and U are ts utlzatons before and after compresson respectvely. In our dscusson n ths paper, we assume d =T. In the example of Fgure 2, we have d =16, U =1/2, U =1/4, and C (t r ) =2. In [3], t s also ponted out that f from Equaton (1) s less than or equal to t r, then we take = t r, whch means an mmedate smooth nserton can be done at t r. An obvous observaton from Equaton (1) s that an nserton at the end pont of the current nstance of (as d =16 n Fgure 2) s defntely smooth. However, f a larger tme nterval between t r and d exsts, the new task has to wat mpatently. Reasonably we should nsert the new task as early as possble. Ths s our second requrement. As n Fgure 2, nsertng 2 at t = = 8 s normally welcome than at t = d =16, especally n urgent cases. III. THE MRBC AND PUF ALGORITHMS 3.1 The maxmum remanng bandwdth compressng(mrbc) algorthm In Fgure 2, f 1 s selected to be compressed nstead of 0,.e. from 1 (12,24) to 1 (12,48), then we have = 6, whch mples an mmedate smooth nserton. There s no earler than mmedate. To fnd ths reason, we convert (1) to Equaton (2). ' C ( tr ) U U. ' d The left sde ndcates the freed bandwdth from the compressed task. The rght s the utlzaton of the remanng computaton tme C (t r ) between and d. Defnton 1(the remanng bandwdth of the current nstance) If compressng starts at t r, C (t r ) s the remanng computaton tme of the current nstance, d s ts deadlne, then C (t r )/(d t r ) s called the remanng bandwdth of the current nstance of at t r,or the nstance remanng bandwdth, s represented by RB (t r ). If =t r, then the rght sde of Equaton (2) s the remanng bandwdth of the current nstance of at t r. Through careful observaton, t s found that the greater the remanng bandwdth at t r s, the earler the smooth nserton pont can be gotten. The earlest possble tme s of course t r. Defnton 2 At t r, for every task n the current task set, we calculate the value of the remanng bandwdth of every current nstance. The maxmum one s defned as the maxmum nstance remanng bandwdth, represented wth RB max (t r ). Smlarly, the mnmum one s called the mnmum nstance remanng bandwdth and named RB mn (t r ). Agan take the example n Fgure 2. The utlzaton of the new task s U 2 =1/4. The remanng bandwdth of 0 at t r =6 s RB 0 (6)=2/(16 6)=1/5, whle 1 has RB 1 (6)=12/(24 6)=2/3. Obvously, selectng 1 as the compressed task other than 0 possbly produces an earler smooth nserton tme. Here RB max (t r )=RB max (6)=RB 1 (6)=2/3, and RB mn (t r )=RB mn (6) =RB 0 (6) =1/5. Now we formally gve out the algorthm n Fgure 3 for selectng a current task to compress based on the remanng bandwdth. The Algorthm MRBC: maxmum remanng bandwdth compresson. Step 1. Wth t r, fnd out the current task to make RB (t r ) U U hold and go to Step 4. If no such a task s found, then choose the one that has the maxmum nstance remanng bandwdth as and go to Step 2. Step 2. Evaluate the smooth nserton tme wth U U = C (t r )/( d ) and go to Step 3. Step 3. Compress, nsert j from t= on, and fnsh the algorthm. Step 4. Compress, nsert j from t= t r on, and fnsh the algorthm. Fgure 3. The descrpton for the MRBC Algorthm. ISSN : Vol. 3 No. 1 Feb-Mar
4 Suppose there are n(n 1) current tasks n the system. In order to fnd that makes RB (t r ) U U hold or has the maxmum nstance remanng bandwdth, the step 1 of the algorthm may have to go through n nstances. The remanng computaton tme of every nstance must be evaluated, and thus n counters have to be mantaned at run tme. Ths s a type of expendture. The temporal complexty of the algorthm s apparently(n). Ths algorthm shows that the maxmum nstance remanng bandwdth RB max (t r ) s mportant to the task nserton. Theorem 1 dscovers a useful rule for judgng ths maxmum bandwdth. Theorem 1 Suppose arbtrary preempton s allowed n a perodc real-tme system at run tme based on EDF, and task mn has the lowest utlzaton U mn among all the tasks. Then, no matter whch task s selected to be compressed and when ths compresson starts, RB max (t r ) U mn s always true. Proof Consderng a current task (C,T ) at run tme. At the begnnng of an nstance, the nstance remanng bandwdth s U. At any other tme, accordng to the preempton before that tme, three possble cases exst. Case1. It has been preempted more by other tasks so that ts nstance remanng bandwdth s greater than U. Case2. It has preempted other tasks so that the nstance remanng bandwdth s less than U. Case3. The results from has been preempted and has preempted are the same up to now, and thus t has the nstance remanng bandwdth equal to U. For case 1 at t r, we have RB max (t r ) > U U mn. For case 2 at t r, suppose there s a task j (C j, T j) that has been preempted more by, and the utlzaton of j s U j, whch mples that the remanng bandwdth of the current nstance of j s greater than U j, and thus RB max (t r ) > U j U mn. For case 3 at t r, RB max (t r ) s at least not less than U, and greater than or equal to U mn. Therefore, n any case, RB max (t r ) U mn always holds. Ths proves Theorem 1. Lemma 1 If the utlzaton of a new task s not greater than the lowest utlzaton U mn of the current tasks, and any of them s permtted to be compressed, then ths new task can be mmedately nserted at any tme. Proof It s obvous from Theorem 1. Now wth Theorem 1 and Lemma 1, for the problem of the task nserton, we fnd out the lowest value among all the sngle task s utlzatons of the current tasks, f the bandwdth of the new task n a perod s less than or equal to ths value and f every task s allowed to be compressed, then an mmedate nserton s smooth whenever t requests to jon n the system. Wth a fxed utlzaton of every task, we can even predct ths before runnng the system. Let us come back to the example n Fgure 1. U mn =U 0 = U 1 =1/2, and the task set ( 0, 1 ) has a hyperperod (least common multple perod) T LCM =48. Accordng to dfferent expressons, we can lst RB max (t) durng the frst hyperperod as follows. At tme t =0, RB max (0)=U mn =1/2. t, 0 t 16, RB max (t)= RB 1 (t) 1/2. At tme t =16, RB max (16)=U mn =1/2. t, 16 t 24, RB max (t)= RB 0 (t) 1/2. At tme t =24, RB max (24)=U mn =1/2. t, 24 t 32, RB max (t)= RB 1 (t) 1/2. At tme t =32, RB max (32)=U mn =1/2. t, 32 t 48, RB max (t)= RB 0 (t) 1/2. Totally, there are 4 ponts at whch RB max (t)=u mn =1/2, at any other tme RB max (t) > U mn s always satsfed. Actually, n many systems RB max (t) > U mn holds at any tme. Fgure 4 llustrates such an example. There are three tasks n the set. The hyperperod T LCM s equal to 16. U mn =U 0 =U 2 =1/4. Smlarly, RB max (t) s lsted as follows. t, 0 t (17 97) / 2, RB max (t)= RB 1 (t) U mn. ISSN : Vol. 3 No. 1 Feb-Mar
5 t, ( 17 97) / 2 t 8, RB max (t)= RB 0 (t) U mn. t, 8 t 14, RB max (t)= RB 1 (t) U mn. t, 14 t 16, RB max (t)= RB 2 (t) U mn. Fgure 4. An example of RBmax(t r ) Umn at any tme. 3.2 The part utlzaton frst(puf) algorthm Possbly, the remanng bandwdths wth n tasks have to be compared based on MRBC. If the new task can not start at t r, then the nserton has to be delayed. Actually, sometmes a real-tme task has a flexble perod, that s, t can vary from a mnmum perod T mn to a maxmum perod T max. Suppose the perod T j of a new task j (C j,t j ) ranges from T jmn to T jmax. The selected compressed task s stll represented by (C,T ). In order to make the system schedulable, we assume ' C j U U. (3) T j mn Ths mples that after the end of the current nstance of, the new task s allowed to run wth T jmn n full speed, but before that, t may be executed wth T jmax and thus part of ts full utlzaton to get a possble earler release of ts frst nstance. Ths s the dea of the PUF algorthm, whch s formally descrbed as n Fgure 5. The Algorthm PUF: part utlzaton frst. Step 1. If C j /T jmn s less than or equal to the lowest utlzaton U mn n the current task set and f every task s permtted to be compressed, then compress any of the current tasks, nsert the new task j wth T jmn from t= t r on, and fnsh the algorthm. Step 2. Wth t r, fnd out the current task to make RB (t r ) C j /T jmn hold and go to Step 5. If no such a task s found, then choose the one that has the maxmum nstance remanng bandwdth as and go to Step 3. Step 3. Calculate wth Cj /T jmax = C (t r )/( d ). If tr, then take = t r. Go to Step 4. Step 4. If <d, then compress, release every nstance of j startng before d wth T jmax, run ts nstances startng after d wth T jmn, and fnsh the algorthm. If =d, then compress, nsert j wth T jmn from t =d on and fnsh the algorthm. Step 5. Compress, nsert j wth T jmn from t = t r on and fnsh the algorthm. There are three ponts that should be notced. Fgure 5. The descrpton for the PUF algorthm The concluson from Theorem 1 and Lemma 1 s ncluded n Step 1 of PUF. If the full utlzaton C j /T jmn s less than or equal to the lowest utlzaton U mn n the system, then Step 2 to Step 5 are not needed. If a task s found wth RB (t r ) C j /T jmn, then the new task j can be nserted mmedately from t r on. Otherwse, the smooth tme s evaluated wth ts part utlzaton C j /T jmax. ISSN : Vol. 3 No. 1 Feb-Mar
6 t = d s used as a crtcal tme. If the release of the frst nstance of j s wth T jmax, then other nstances of ths task startng before d, f any, wll also be wth T jmax. The nstances after d can defntely be released wth T jmn because Equaton (1) declares d. Fgure 6 s an example of PUF. Suppose 0 (6,16) s the only task allowed to be compressed. The freed utlzaton s U 0 -U 0 =6/16-6/48=1/4. The request tme s t r =4. The remanng bandwdth of the current nstance of 0 s (6-4)/(16-4)=1/6, whch s less than the full utlzaton 1/4 of the new task 2 (1,4). The perod of 2 ranges from T jmn = T 2mn =4 to T jmax = T 2max =6. If the frst nstance of 2 starts at t=4 wth T 2mn =4, then the deadlne at t=16 wll be mssed snce up to t=16 the sum of the processor demands by 2 and 1 exceeds the length of the nterval, that s, 3+10=13>12, whch makes the system unschedulable [5, 6]. Fgure 6. An example of the PUF algorthm. Therefore, n order to start the frst nstance early at t=4 and make every deadlne satsfed, we nsert the new task 2 n two steps. The frst two nstances are wth T 2max =6, whle other nstances startng after t=16 are released wth T 2mn =4, whch s shown n Fgure 6. IV. CONCLUSIONS How to nsert a new real-tme task as early as possble? Two approaches are provded n ths paper. The frst approach relates manly wth compresson. Theorem 1 s very smple and useful snce t says the new task can be nserted mmedately at any tme f the utlzaton of the new task does not exceed the lowest utlzaton of ndvdual current tasks n the system and f every task s allowed to be compressed. The MRBC algorthm chooses a task to compress that has the maxmum remanng bandwdth, based on whch the earlest nserton can be mplemented, but t has the temporal complexty (n). The second approach relates wth nserton. Wth an accepted varaton of ts perod to some extent, the new task can be nserted n two steps, frst wth a longest perod T jmax then a shortest one T jmn. In ths way, not only the schedulablty s guaranteed, but also the nserton can be done as quckly as possble. ACKNOWLEDGMENT Guangmng Qan thanks Hunan Provncal Natural Scence Foundaton of Chna under grant agreement No. 09JJ5040 for fnancal support to ths research. REFERENCES [1] C.L.Lu, J.W.Laylan, Schedulng Algorthms for Multprogrammng n a Hard Real Tme Envronment, J.ACM, vol.20, no.1, pp.40-61, [2] G.C.Buttazzo, G.Lpar, M.Caccamo, and L. Aben, Elastc Schedulng for Flexble Workload Management, IEEE.Trans.Computers, vol. 51, no.3, pp , [3] Q.Guangmng, An Earler Tme for Insertng and/or Acceleratng Tasks, Sprnger. Real Tme Systems, vol.41, no.3, pp , [4] G.C.Buttazzo, G.Lpar, and L.Aben, Elastc Task Model for Adaptve Rate Control, In Proc.19th IEEE Real-Tme Systems Symp., pp , Madrd, Span, Dec [5] S.Kbarauh, R.R.Howell, and L.E.Roser, Algorthms and Complexty Concernng the Preemptve Schedulng of Perodc Real-Tme Tasks on One Processor, Sprnger. Real Tme Systems, vol.2, pp ,1990. [6] K.Jeffay, and D.L.Stone, Accountng for Interrupt Handlng Costs n Dynamc Prorty Task Systems, In Proc.14th IEEE Real-Tme Systems Symp., pp , Ralegh Durham, NC, Dec ISSN : Vol. 3 No. 1 Feb-Mar
7 AUTHORS PROFILE Guangmng Qan s a professor at College of Mathematcs and Computer Scence, Hunan Normal Unversty, Chna(P.R.C). Hs current research nterests nclude real-tme schedulng and network swtchng. Xanghua Chen s a postgraduate student of Hunan Normal Unversty. Gang Yao s a Postdoctoral Research Collaborator at the Unversty of Illnos at Urbana Champagn. He receved a Ph.D. n Computer Engneerng from the Scuola Superore Sant'Anna of Psa, Italy, n 2010, the BE and ME degrees from Tsnghua Unversty, Bejng, Chna. Hs man nterests nclude real-tme schedulng algorthms, safety-crtcal systems and shared resource protocols. ISSN : Vol. 3 No. 1 Feb-Mar
Embedded Systems. 4. Aperiodic and Periodic Tasks
Embedded Systems 4. Aperodc and Perodc Tasks Lothar Thele 4-1 Contents of Course 1. Embedded Systems Introducton 2. Software Introducton 7. System Components 10. Models 3. Real-Tme Models 4. Perodc/Aperodc
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationCHAPTER 17 Amortized Analysis
CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average
More informationLast Time. Priority-based scheduling. Schedulable utilization Rate monotonic rule: Keep utilization below 69% Static priorities Dynamic priorities
Last Tme Prorty-based schedulng Statc prortes Dynamc prortes Schedulable utlzaton Rate monotonc rule: Keep utlzaton below 69% Today Response tme analyss Blockng terms Prorty nverson And solutons Release
More informationGlobal EDF Scheduling for Parallel Real-Time Tasks
Washngton Unversty n St. Lous Washngton Unversty Open Scholarshp Engneerng and Appled Scence Theses & Dssertatons Engneerng and Appled Scence Sprng 5-15-2014 Global EDF Schedulng for Parallel Real-Tme
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationOverhead-Aware Compositional Analysis of Real-Time Systems
Overhead-Aware ompostonal Analyss of Real-Tme Systems Lnh T.X. Phan, Meng Xu, Jaewoo Lee, nsup Lee, Oleg Sokolsky PRESE enter Department of omputer and nformaton Scence Unversty of Pennsylvana ompostonal
More informationAN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS
AN EXENDIBLE APPROACH FOR ANALYSING FIXED PRIORIY HARD REAL-IME ASKS K. W. ndell 1 Department of Computer Scence, Unversty of York, England YO1 5DD ABSRAC As the real-tme computng ndustry moves away from
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationQuantifying the Sub-optimality of Uniprocessor Fixed Priority Pre-emptive Scheduling for Sporadic Tasksets with Arbitrary Deadlines
Quantfyng the Sub-optmalty of Unprocessor Fxed Prorty Pre-emptve Schedulng for Sporadc Tasksets wth Arbtrary Deadlnes Robert Davs, Sanjoy Baruah, Thomas Rothvoss, Alan Burns To cte ths verson: Robert Davs,
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationClock-Driven Scheduling (in-depth) Cyclic Schedules: General Structure
CPSC-663: Real-me Systems n-depth Precompute statc schedule o-lne e.g. at desgn tme: can aord expensve algorthms. Idle tmes can be used or aperodc jobs. Possble mplementaton: able-drven Schedulng table
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationOptimal Static Partition Configuration in ARINC653 System
JOURNAL OF ELECTRONIC SCIENCE AND TECHNOLOGY, VOL. 9, NO. 4, DECEMBER 7 Optmal Statc rtton Confguraton n ARINC6 System Sheng-Ln Gu, Le Luo, Sen-Sen Tang, and Yang Meng Abstract ARINC6 systems, whch have
More informationParallel Real-Time Scheduling of DAGs
Washngton Unversty n St. Lous Washngton Unversty Open Scholarshp All Computer Scence and Engneerng Research Computer Scence and Engneerng Report Number: WUCSE-013-5 013 Parallel Real-Tme Schedulng of DAGs
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationGeneral theory of fuzzy connectedness segmentations: reconciliation of two tracks of FC theory
General theory of fuzzy connectedness segmentatons: reconclaton of two tracks of FC theory Krzysztof Chrs Ceselsk Department of Mathematcs, West Vrgna Unversty and MIPG, Department of Radology, Unversty
More informationThis column is a continuation of our previous column
Comparson of Goodness of Ft Statstcs for Lnear Regresson, Part II The authors contnue ther dscusson of the correlaton coeffcent n developng a calbraton for quanttatve analyss. Jerome Workman Jr. and Howard
More informationPartitioned Mixed-Criticality Scheduling on Multiprocessor Platforms
Parttoned Mxed-Crtcalty Schedulng on Multprocessor Platforms Chuanca Gu 1, Nan Guan 1,2, Qngxu Deng 1 and Wang Y 1,2 1 Northeastern Unversty, Chna 2 Uppsala Unversty, Sweden Abstract Schedulng mxed-crtcalty
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationDouble Layered Fuzzy Planar Graph
Global Journal of Pure and Appled Mathematcs. ISSN 0973-768 Volume 3, Number 0 07), pp. 7365-7376 Research Inda Publcatons http://www.rpublcaton.com Double Layered Fuzzy Planar Graph J. Jon Arockaraj Assstant
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationOn the Repeating Group Finding Problem
The 9th Workshop on Combnatoral Mathematcs and Computaton Theory On the Repeatng Group Fndng Problem Bo-Ren Kung, Wen-Hsen Chen, R.C.T Lee Graduate Insttute of Informaton Technology and Management Takmng
More informationA Simple Inventory System
A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationComputer Control: Task Synchronisation in Dynamic Priority Scheduling
Computer Control: Task Synchronsaton n Dynamc Prorty Schedulng Sérgo Adrano Fernandes Lopes Department of Industral Electroncs Engneerng School Unversty of Mnho Campus de Azurém 4800 Gumarães - PORTUGAL
More informationLimited Preemptive Scheduling for Real-Time Systems: a Survey
Lmted Preemptve Schedulng for Real-Tme Systems: a Survey Gorgo C. Buttazzo, Fellow Member, IEEE, Marko Bertogna, Senor Member, IEEE, and Gang Yao Abstract The queston whether preemptve algorthms are better
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationWorst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
Real-Tme Syst (2009) 42: 63 119 DOI 10.1007/s11241-009-9071-z Worst-case response tme analyss of real-tme tasks under fxed-prorty schedulng wth deferred preempton Render J. Brl Johan J. Lukken Wm F.J.
More informationFixed-Priority Multiprocessor Scheduling with Liu & Layland s Utilization Bound
Fxed-Prorty Multprocessor Schedulng wth Lu & Layland s Utlzaton Bound Nan Guan, Martn Stgge, Wang Y and Ge Yu Department of Informaton Technology, Uppsala Unversty, Sweden Department of Computer Scence
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationFixed-Priority Multiprocessor Scheduling with Liu & Layland s Utilization Bound
Fxed-Prorty Multprocessor Schedulng wth Lu & Layland s Utlzaton Bound Nan Guan, Martn Stgge, Wang Y and Ge Yu Department of Informaton Technology, Uppsala Unversty, Sweden Department of Computer Scence
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationFREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,
FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then
More informationImproving the Sensitivity of Deadlines with a Specific Asynchronous Scenario for Harmonic Periodic Tasks scheduled by FP
Improvng the Senstvty of Deadlnes wth a Specfc Asynchronous Scenaro for Harmonc Perodc Tasks scheduled by FP P. Meumeu Yoms, Y. Sorel, D. de Rauglaudre AOSTE Project-team INRIA Pars-Rocquencourt Le Chesnay,
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationEPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski
EPR Paradox and the Physcal Meanng of an Experment n Quantum Mechancs Vesseln C Nonnsk vesselnnonnsk@verzonnet Abstract It s shown that there s one purely determnstc outcome when measurement s made on
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationComments on a secure dynamic ID-based remote user authentication scheme for multiserver environment using smart cards
Comments on a secure dynamc ID-based remote user authentcaton scheme for multserver envronment usng smart cards Debao He chool of Mathematcs tatstcs Wuhan nversty Wuhan People s Republc of Chna Emal: hedebao@63com
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationOperating conditions of a mine fan under conditions of variable resistance
Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety
More informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationValuated Binary Tree: A New Approach in Study of Integers
Internatonal Journal of Scentfc Innovatve Mathematcal Research (IJSIMR) Volume 4, Issue 3, March 6, PP 63-67 ISS 347-37X (Prnt) & ISS 347-34 (Onlne) wwwarcournalsorg Valuated Bnary Tree: A ew Approach
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationImproved Worst-Case Response-Time Calculations by Upper-Bound Conditions
Improved Worst-Case Response-Tme Calculatons by Upper-Bound Condtons Vctor Pollex, Steffen Kollmann, Karsten Albers and Frank Slomka Ulm Unversty Insttute of Embedded Systems/Real-Tme Systems {frstname.lastname}@un-ulm.de
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationQueuing system theory
Elements of queung system: Queung system theory Every queung system conssts of three elements: An arrval process: s characterzed by the dstrbuton of tme between the arrval of successve customers, the mean
More informationCounterexamples to the Connectivity Conjecture of the Mixed Cells
Dscrete Comput Geom 2:55 52 998 Dscrete & Computatonal Geometry 998 Sprnger-Verlag New York Inc. Counterexamples to the Connectvty Conjecture of the Mxed Cells T. Y. L and X. Wang 2 Department of Mathematcs
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More informationRegulation No. 117 (Tyres rolling noise and wet grip adhesion) Proposal for amendments to ECE/TRANS/WP.29/GRB/2010/3
Transmtted by the expert from France Informal Document No. GRB-51-14 (67 th GRB, 15 17 February 2010, agenda tem 7) Regulaton No. 117 (Tyres rollng nose and wet grp adheson) Proposal for amendments to
More informationx i1 =1 for all i (the constant ).
Chapter 5 The Multple Regresson Model Consder an economc model where the dependent varable s a functon of K explanatory varables. The economc model has the form: y = f ( x,x,..., ) xk Approxmate ths by
More informationLecture 4. Instructor: Haipeng Luo
Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/887/32963 holds varous fles of ths Leden Unversty dssertaton uthor: Zha, Jal Teddy Ttle: daptve streamng applcatons : analyss and mplementaton models Issue Date:
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationDurban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications
Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department
More informationSINGLE EVENTS, TIME SERIES ANALYSIS, AND PLANETARY MOTION
SINGLE EVENTS, TIME SERIES ANALYSIS, AND PLANETARY MOTION John N. Harrs INTRODUCTION The advent of modern computng devces and ther applcaton to tme-seres analyses permts the nvestgaton of mathematcal and
More informationImproving the Quality of Control of Periodic Tasks Scheduled by FP with an Asynchronous Approach
Improvng the Qualty of Control of Perodc Tasks Scheduled by FP wth an Asynchronous Approach P. Meumeu Yoms, L. George, Y. Sorel, D. de Rauglaudre AOSTE Project-team INRIA Pars-Rocquencourt Le Chesnay,
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More information