Monitoring Network Traffic to Detect SteppingStone Intrusion


 Loraine Boone
 1 years ago
 Views:
Transcription
1 Montorng etork Traffc to Detect StengStone Intruson Janhua Yang, Byong Lee, Stehen S. H. Huang Deartment of Math and Comuter Scence, Bennett College Emal: {jhyang, blee Deartment of Comuter Scence, Unversty of Houston Abstract Most netork ntruders tend to use stengstones to attack or to nvade other hosts to reduce the rsks of beng dscovered. There have been many aroaches that ere roosed to detect stengstone snce 995. One of those aroaches roosed by A. Blum detects stengstone by checkng f the dfference beteen the number of the send ackets of an ncomng connecton and the one of an outgong connecton s bounded. One eakness of ths method s n resstng ntruders evason, such as chaff erturbaton. In ths aer, e roose a method based on random alk theory to detect stengstone ntruson. Our theoretcal analyss shos that the roosed method s more effectve than Blum s aroach n terms of resstng ntruders chaff erturbaton.. Introducton Most ntruders tend to nvade a comuter host by launchng ther attacks through a chan of comromsed comuters hch are called stengstones []. The attackers are called stengstone ntruders. One obvous reason hy ntruders use stengstone s that t makes them hard to be caught. Detectng a stengstone ntruson s dffcult because of the nature of TC/I rotocol, n hch a comuter n a TC/I sesson s vsble only to ts mmedate donstream and ustream neghbors, but not to anyone else. That s, f an ntruder uses a chan of more than one comuter to nvade, only the comuter havng a drect TC/I connecton to the vctm host s vsble and the ntruder s dentty ould be hdden. There are many aroaches develoed to detect stengstone ntruson. They are dvded nto to categores: assve and actve aroaches. The assve aroaches use the nformaton gathered from hosts and netorks to detect a stengstone ntruson. One advantage of the assve aroach s that t does not nterfere th the sessons. Ths ork s suorted by SF BCAllance grant: Contract number #CS Its dsadvantage s that t takes more comutatons than the actve aroach does because t fnds a stengstone ar by checkng all the ncomng and outgong connectons of a host. Most aroaches roosed to detect stengstone ntruson, such as Contentbased Thumbrnt [], Tmebased Aroach [], Devatonbased Aroach [3], Roundtr Tme Aroach [4, 5], and acket umber Dfferencebased Aroach [6, 7], are classfed as assve category. StanfordChen and Heberlen roosed the contentbased thumbrnt method that dentfes ntruders by comarng dfferent sessons for suggestve smlartes of connecton chans []. The fatal roblem of ths method s that t cannot be aled to encryted sessons because ther real contents are not avalable and therefore unable to make thumbrnt. Zhang and axson [] roosed the tmebased aroach that can be used to detect stengstones or to trace ntruson even f a sesson s encryted. Hoever, there are three major roblems n the tmebased aroach. Frst, t can be easly manulated by ntruders. Second, the method reures that the ackets of connectons have recse and synchronzed tmestams n order to correlate them roerly. Ths makes dffcult or mractcal to correlate the measurements those ere taken at dfferent onts n the netork. Thrd, Zhang and axson also ere aare of the fact that a large number of legtmate stengstone users routnely traverse a netork for a varety of reasons. Yoda and Etoh [3] roosed the devatonbased aroach that s a netorkbased correlaton scheme. Ths method s based on the observaton that the devaton for to unrelated connectons s large enough to be dstngushed from the devaton of those connectons thn the same connecton chan. In addton to the roblems the tmebased aroach has, ths method has other roblems, such as not effcent and not alcable to comressed sesson and to the added ayload. Yung [5] roosed the roundtr tme (RTT aroach that detects stengstone ntruson by estmatng the donstream length usng the ga beteen a reuest and ts resonse, and the ga beteen the reuest and ts acknoledgement. The roblem of the RTT aroach s that t makes naccurate detecton because t cannot comute the to gas accurately.
2 Blum [7] roosed the acket number dfferencebased (Dbased aroach that detects stengstones by checkng the dfference of Send acket numbers beteen to connectons. Ths method s based on the dea that f the to connectons are relayed, the dfference should be bounded; otherse, t should not. Ths method can resst ntruders evasons such as tme jtterng and chaff erturbaton. D. Donoho et al. [6] sho for the frst tme that there are theoretcal lmts on the ablty of attackers to dsguse ther traffcs usng evasons durng a long nteractve sesson. The major roblem th the Dbased aroach s due to the fact that the uer bound on the number of ackets reured to montor s large, hle the loer bound on the amount of chaff an attacker needs to evade hs detecton s small. Ths fact makes Blum s method very eak n resstng to ntruders chaff evason. In ths aer, e roose a novel aroach that exlots the otmal numbers of TC reuests and resonses to detect stengstones. A random alk rocess can model the dfferences beteen the number of reuests and the number of resonses. A theoretcal analyss n ths aer shos that the erformance of our aroach s better than the Blum s aroach n terms of the number of ackets to be montored under the same confdence th the assumton that the sesson s manulated by tme jtterng or chaff erturbaton. The rest of ths aer s arranged as follong. In Secton, e resent the roblem statement. Secton 3 resents the stengstone detecton algorthm. In secton 4, e analyze the erformance of ths algorthm, and n Secton 5, e resent the result of comarsons th Dbased aroach. Fnally, n Secton 6, e summarze the ork and dscuss about future ork.. roblem Statement The basc dea of detectng a host or a netork of comuters used as a stengstone s to comare an ncomng connecton th one of the outgong connectons. If they are relayed, e call them a stengstone ar; otherse, a normal ar. As Fgure shos, host h has one ncomng connecton C and one outgong connecton C, hle each connecton has one reuest stream and one resonse stream. If e make the three assumtons belo, then n a erod of tme, the number of ackets montored n each connecton should be close to be eual for any to connectons that are relayed: Each acket that aears n one connecton must aear n ts relayed one; An ntruder could hold any acket at any lace, but the holdng tme has an uer bound; 3 An ntruder could nsert meanngless ackets nto an nteractve sesson at any tme, but the nsertng rate s bounded. The assumton means that there are no acket dros, combnatons, or decomostons. It guarantees that the number of the ackets n an ncomng connecton must be greater than or eual to the number of the ackets n the relayed outgong connecton. If to connectons are relayed, e can at least fnd a relatonsh beteen the number of the reuests of the outgong connecton and the number of resonses of the ncomng connecton. The roblem of detectng stengstones becomes the roblem of fndng a correlaton beteen the number of reuests and the number of resonses. The assumton comes from the fact that each user has a tme tolerance of usng an nteractve sesson; and the assumton 3 ndcates that the rate n hch a user can nsert ackets nto an nteractve sesson s bounded. C ( S ( E h C ( E From the above three assumtons, e kno that f to connectons are relayed, there should be a suggestve relatonsh beteen the number of reuests and resonses. We can use the exstence of ths relatonsh to determne hether to connectons are n the same chan. We clam that t s ossble to detect stengstone by comarng the number of Sends n an outgong connecton th the number of Echoes n an ustream connecton. In other ords, t s ossble to detect stengstone ntruson by montorng netork traffc. 3. StengStone Detecton Algorthm 3. Basc Idea to Detect StengStone ( S Fgure. Illustraton of connectons and streams of a host We montor an nteractve TC sesson that s establshed usng OenSSH for a erod of tme, cature all the Send and Echo ackets, and ut them n to seuences, S th n ackets and E th m ackets, resectvely. In an nteractve sesson, the user ll nut a command by tyng a seuence of letters, and then execute the command at the server sde. The executon result ll return to the clent sde n terms of ackets. In general, hen a user tyes one letter (keystroke t ll be echoed by a resonse acket. We call them sngle letter Send and Echo, resectvely. If e flter out the nonsngle letter ackets and kee only the sngle letter Sends and Echoes, then the number of the Sends n an outgong connecton should be
3 close to the number of the Echoes n an ncomng connecton f the to connectons are relayed. ( We use to denote the number of reuests of the (, s ( outgong connecton, and use to denote the number (, e of resonses of the ncomng connecton, and use to ( ( denote (, e, the dfference beteen the to numbers. For relayed connectons, should vary but close to (, s zero. Ideally, t should be zero. Hoever, there are to reasons hy may not be exactly zero. Frst, multle Sends or Echoes may be combned to one acket durng the roagaton. And also due to the nature of the TC/I rotocol, e may not be able to dentfy all sngle letter ackets. Second, e cannot comletely remove the ackets of command executon result by checkng acket sze. Hoever, f the to connectons are relayed, then should be close to zero th a hgh robablty. If to relayed connectons are manulated, should be bounded thn a range [ Ω, l Ω ] based on the assumtons and 3. For tme jtterng evason, e assume u that f a acket s held, a acket holdng tme cannot be larger than Η and the number of ackets that can be held n each connecton cannot be larger than Ω Η. For chaff erturbaton, e assume that the number of ackets that can be ntroduced n a unt tme for each connecton cannot be larger than r. Assumng that e collect the ackets n unts of tme, should be bounded thn a range [ Ω, Ω ] for to relayed connectons, here Ω * r. o, the roblem of detectng a stengstone ar s reduced to the task of judgng f the dfferences of the number of sngle letter ackets beteen to connectons are bounded,.e. for a stengstone ar, the follong relatonsh should hold: Ω ( Ω 3. StengStone Detecton Algorthm To reduce the false alarms and msdetectons n detectng stengstone ar, e check the condton ( every tme hen a acket s receved. If e montor a total of ackets, the condton ( ll be checked tmes. We roose the follong algorthm to detect stengstones. We call ths algorthm Detectng Stengstone Evason (. ( ( ( S, E, Ω, ( ( (, e (, s 0; fo r j : ( ( f j S (, s ( ( f j E (, e + + ; + + ; ( ( (, e (, s ; f < Ω o r > Ω return orm al Endfor return Steng Stone In ths algorthm, e cature and check u to ackets on to connectons to see f formula ( s satsfed. If there s one tme that the formula ( s not satsfed, e conclude that there s no stengstone ar. The concluson about the exstence of a stengstone should be made only after all the connectons are checked. If ( s satsfed thn tmes of checkng, e conclude that there s a stengstone th a very hgh robablty. It s not necessary to check f formula ( holds for all the connectons. The larger the checkng tmes s, the hgher the confdence of the. For a gven confdence, hch s also called false ostve robablty, hat ould be an otmal number of ackets to be montored on the to connectons? 4. erformance Analyss We assume that a collected acket s a Send th robablty, and an Echo th robablty. The dfference beteen the number of the Sends of a stream and the Echoes of another stream can be modeled as a random alk rocess th ndeendent jums Z, Z,, Z,, here s a ostve nteger. If a catured acket s a Send, the dfference ll make a jum Z , otherse, a jum Z ; there s no other choce. We have the follong euatons. rob( Z rob( Z. ( + Table. otatons used n the analyss of random alks C C False negatve robablty False ostve robablty A gven false negatve robablty A gven false ostve robablty We evaluate the erformance of the algorthm by comutng the smallest for a gven false ostve detecton robablty or false negatve detecton robablty.
4 Also, for a gven, e comute the false ostve robablty and the false negatve robablty to evaluate the algorthm. A false negatve robablty ndcates the ossblty that the condton ( does not hold even f the to connectons are n the same chan. A false ostve robablty ndcates the ossblty that the condton ( holds hen the to connectons are not n the same chan. For convenence, e use the notatons n Table n the rest of ths aer. 4. False egatve robablty False negatve robablty C of s actually the sum of the robabltes that the random alk rocess hts the loer bound Ω or the uer bound Ω. Based on the results of the random alk rocess from [8], e have: Ω ( ( Ω C f 0Ω + f0 ( ( Ω + s s s (( Ω + ( Ω (3 here s + ( cos ( cos Ω Ω. One secal case hen e have: ( ( C f0ω + f Ω cos (4 0 s Ω,here s. ( cos cos Ω Ω From the condton (4, e get the least acket number needed for a gven false negatve robablty hen : log + (5 log(cos Ω 4. False ostve robablty False ostve robablty C of s the robablty that the dfference could alk thn the range [ Ω, Ω ] n all tmes checked even though the to connectons are not relayed. From the results n [8], e get the follong: C ( f k + ( k 0Ω + f ( k 0Ω k + (( s k Ω Ω (( + ( Ω Ω Ω + ( k + Ω ( s k (( + ( s s (6,here s. + ( cos ( cos Ω Ω When, e have the follong smlfed results, cos Ω (7 C cos Ω Smlarly, e get from (7 for a gven hen as the follong: log[ ( cos ] Ω (8 log(cos Ω 5. Comarson The best ay to evaluate an algorthm for ts effectveness s to comare ts erformance th the best exstng algorthm. So far, Blum s aroach has been consdered to be the best ay to detect stengstones and Blum s DetectAttacksChaff stengstone detecton algorthm ( s knon to be able to resst to tme erturbaton and to chaff evason. In ths study, e comare th the Blum s for ts erformance. Ther erformances are comared n terms of the number of ackets reured to montor for a gven false ostve rate,.e. the algorthm that reures feer ackets s consdered to erform better. We must menton that Blum dd not gve false negatve analyss n hs aer [7]. Thus, e comare the erformance beteen the to algorthms n terms of false ostve robablty only. We dscuss to cases: the case th consderaton of chaff and the case thout consderaton of chaff. 5. Comarson beteen and the Best Exstng Algorthm thout Chaff erturbaton
5 In order to comare th Blum s, e assume the euaton Ω s satsfed. Let B and be the mnmum number of ackets reured to montor n order to get a gven false ostve robablty by the and the resectvely. Our urose s to comare B and. The feer number reresents the better erformance. The numbers B and can be comuted by the follong formula: B ( + log (9 log[ ( cos ] log cos Fgure. Comarson of number of ackets montored th Blum s method under 0. (0 We cannot comare the to numbers drectly by usng Euatons (9 and (0 because there s no guarantee that one of them s absolutely larger than the other. Fgure and Fgure 3 sho the results of comarsons beteen B and th varyng here the Y axs uses the logarthmc scale, under fxed values 0. and resectvely. Fgure shos that has better erformance than only hen s under eght. When s larger than eght, outerforms. Fgure and Fgure 3 sho that hen becomes smaller, erforms better than Blum s does. Based on the comarsons shon n Fgure and Fgure 3, e conclude that under a hgh confdence (lo false ostve robablty thout chaff erturbaton, outerforms because needs feer ackets to be montored than does 5. Comarson beteen and the Best Exstng Algorthm th Chaff erturbaton When a sesson s manulated th a chaff erturbaton, Blum clamed that hs method stll can detect stengstone, but th a condton that no more than x ackets can be nserted for every 8(x+ ackets. Otherse, hs method ould not ork. We evaluate the erformance of our by comarng t th Blum s agan. We assume that e nsert x ackets nto a send stream for every x send and aroxmate x echo ackets. Ths means / x/(x + x / and the nsertng rate s aroxmately 50%, hch s much bgger than Blum s allos. From euaton (6, e obtan the least number of Fgure 3. Comarson of number of ackets montored th Blum s method under ackets montored by th a gven. log[ ( cos ( o(0.5, + o(, ] log(0.998 cos ( Accordng to [7], the least number of ackets B montored by th a gven can be obtaned by the euaton (: B 8( + log ( Fgure 4 and Fgure 5 sho the results of comarsons beteen and th chaff erturbaton. Fgure 4 shos that outerforms hen the detecton boundary s less than 50 th gven s 0.. Fgure 5 shos the results of comarsons hen the false ostve robablty s decreased to Fgure 4 and Fgure 5 sho that the loer the false ostve robablty, the
6 better erformance of the. Wth chaff erturbaton, our stll outerforms Blum s. 6. Conclusons and Future Work In ths aer e roose an algorthm that detects stengstone ntruson. Wth ths algorthm, e need to montor the TC/I reuest and resonse ackets, count the acket numbers, and coumute the dfference beteen them. The results of theortcal analyss sho that ths method outerforms Blum s, hch s knon to be Fgure 4. Comarson of number of ackets montored th Blum s method under chaff and 0. What e have resented n ths aer s based on urely theortcal analyss under the assumton that ntruder s nsertng rate s bounded. Our future ork s to devele a rogram to do chaff erturbaton over a real nteractve sesson and to determne the uer boundary of an user s chaff rate, as ell as Ω. References [] Yn Zhang, Vern axson: Detectng StengStones. roceedngs of the 9 th USEIX Securty Symosum, Denver, CO, August ( [] S. StanfordChen, L. Todd Heberlen: Holdng Intruders Accountable on the Internet. roc. IEEE Symosum on Securty and rvacy, Oakland, CA, August ( [3] K. Yoda, H. Etoh: Fndng Connecton Chan for Tracng Intruders. roc. 6th Euroean Symosum on Research n Comuter Securty (LCS 985, Toulouse, France, Setember ( [4] Janhua Yang, ShouHsuan Stehen Huang: Matchng TC ackets and Its Alcaton to the Detecton of Long Connecton Chans, roceedngs (IEEE of 9 th Internatonal Conference on Advanced Informaton etorkng and Alcatons (AIA 05, Tae, Taan, Chna, March ( [5] Kong H. Yung: Detectng Long Connectng Chans of Interactve Termnal Sessons. RAID 00, Srnger ress, Zurch, Stzerland, October (006. [6] D. L. Donoho (ed.: Detectng ars of Jttered Interactve Streams by Exlotng Maxmum Tolerable Delay. roceedngs of Internatonal Symosum on Recent Advances n Intruson Detecton, Zurch, Stzerland, Setember ( [7] A. Blum, D. Song, And S. Venkataraman: Detecton of Interactve StengStones: Algorthms and Confdence Bounds. roceedngs of Internatonal Symosum on Recent Advance n Intruson Detecton (RAID, Soha Antols, France, Setember ( [8] D. Cox, H. Mller: The Theory of Stochastc rocess. e York, Y: John Wley & Sons Inc., Fgure 5. Comarson of number of ackets montored th Blum s method under chaff and the best method of detectng stengstone, n resstng to ntruders chaff erturbaton. For the same false ostve robablty, our aroach needs feer ackets to be montored than Blum s Does.
A Study on Secure Data Storage Strategy in Cloud Computing
Journal of Convergence Informaton Technology Volume 5, Number 7, Setember 00 A Study on Secure Data Storage Strategy n Cloud Comutng Danwe Chen, Yanjun He, Frst Author College of Comuter Technology, Nanjng
More informationEvaluation of the information servicing in a distributed learning environment by using monitoring and stochastic modeling
MultCraft Internatonal Journal of Engneerng, Scence and Technology Vol, o, 9, 4 ITERATIOAL JOURAL OF EGIEERIG, SCIECE AD TECHOLOGY wwwestngcom 9 MultCraft Lmted All rghts reserved Evaluaton of the nformaton
More informationDynamic Load Balancing of Parallel Computational Iterative Routines on Platforms with Memory Heterogeneity
Dynamc Load Balancng of Parallel Comutatonal Iteratve Routnes on Platforms wth Memory Heterogenety Davd Clare, Alexey Lastovetsy, Vladmr Rychov School of Comuter Scence and Informatcs, Unversty College
More informationPerformance attribution for multilayered investment decisions
Performance attrbuton for multlayered nvestment decsons 880 Thrd Avenue 7th Floor Ne Yor, NY 10022 212.866.9200 t 212.866.9201 f qsnvestors.com Inna Oounova Head of Strategc Asset Allocaton Portfolo Management
More informationA New Technique for Vehicle Tracking on the Assumption of Stratospheric Platforms. Department of Civil Engineering, University of Tokyo **
Fuse, Taash A New Technque for Vehcle Tracng on the Assumton of Stratosherc Platforms Taash FUSE * and Ehan SHIMIZU ** * Deartment of Cvl Engneerng, Unversty of Toyo ** Professor, Deartment of Cvl Engneerng,
More informationLecture 2: Single Layer Perceptrons Kevin Swingler
Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCullochPtts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses
More informationA Structure Preserving Database Encryption Scheme
A Structure Preservng Database Encryton Scheme Yuval Elovc, Ronen Wasenberg, Erez Shmuel, Ehud Gudes BenGuron Unversty of the Negev, Faculty of Engneerng, Deartment of Informaton Systems Engneerng, Postfach
More informationA Comprehensive Analysis of Bandwidth Request Mechanisms in IEEE 802.16 Networks
A Comrehensve Analyss of Bandwdth Reuest Mechansms n IEEE 802.6 Networks Davd Chuck, KuanYu Chen and J. Morrs Chang Deartment of Electrcal and Comuter Engneerng Iowa State Unversty, Ames, Iowa 500, USA
More informationCLUSTER SAMPLING DR. SHALABH DEPARTMENT OF MATHEMATICS AND STATISTICS INDIAN INSTITUTE OF TECHNOLOGY KANPUR 1
amplng Theory MODULE IX LECTURE  30 CLUTER AMPLIG DR HALABH DEPARTMET OF MATHEMATIC AD TATITIC IDIA ITITUTE OF TECHOLOGY KAPUR It s one of the asc assumptons n any samplng procedure that the populaton
More informationChapter 3: Dualbandwidth Data Path and BOCP Design
Chater 3: Dualbandwdth Data Path and BOCP Desgn 3. Introducton The focus of ths thess s on the 4G wreless moble Internet networks to rovde data servces wthn the overlang areas of CDA2000WLA networks.
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationRequIn, a tool for fast web traffic inference
RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@ntevry.fr, JeanEtenne.Kba@ntevry.fr Abstract As networked
More informationLoad Balancing of Parallelized Information Filters
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. XXX, NO. XX, XXXXXXX 2001 1 Load Balancng of Parallelzed Informaton Flters Nel C. Rowe, Member, IEEE Comuter Socety, and Amr Zaky, Member, IEEE
More informationAnalysis and Modeling of Buck Converter in DiscontinuousOutputInductorCurrent Mode Operation *
Energy and Power Engneerng, 3, 5, 85856 do:.436/ee.3.54b63 Publshed Onlne July 3 (htt://www.scr.org/journal/ee) Analyss and Modelng of Buck Converter n DscontnuousOututInductorCurrent Mode Oeraton
More informationStochastic Protocol Modeling for Anomaly Based Network Intrusion Detection
Stochastc Protocol Modelng for Anomaly Based Network Intruson Detecton Juan M. EstevezTapador, Pedro GarcaTeodoro, and Jesus E. DazVerdejo Department of Electroncs and Computer Technology Unversty of
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationFORECASTING TELECOMMUNICATION NEW SERVICE DEMAND BY ANALOGY METHOD AND COMBINED FORECAST
Yugoslav Journal of Operatons Research 5 (005), Number, 9707 FORECAING ELECOMMUNICAION NEW ERVICE DEMAND BY ANALOGY MEHOD AND COMBINED FORECA FengJenq LIN Department of Appled Economcs Natonal ILan
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More information8 Algorithm for Binary Searching in Trees
8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of IllinoisUrbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of IllnosUrbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationPERFORMANCE ANALYSIS OF PARALLEL ALGORITHMS
Software Analye PERFORMANCE ANALYSIS OF PARALLEL ALGORIHMS Felcan ALECU PhD, Unverty Lecturer, Economc Informatc Deartment, Academy of Economc Stude, Bucharet, Romana Emal: alecu.felcan@e.ae.ro Abtract:
More informationA Secure PasswordAuthenticated Key Agreement Using Smart Cards
A Secure PasswordAuthentcated Key Agreement Usng Smart Cards Ka Chan 1, WenChung Kuo 2 and JnChou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,
More informationPSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 12
14 The Chsquared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationChosen Public Key and Ciphertext Secure Proxy Reencryption Schemes
Internatonal Journal of Dgtal ontent Technology and ts Alcatons Volume 4 Number 9 December 00 hosen Publc Key and hertext Secure Proxy Reencryton Schemes Lmng Fang Wlly Suslo Yongun Ren huneng Ge and
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationApplied Research Laboratory. Decision Theory and Receiver Design
Decson Theor and Recever Desgn Sgnal Detecton and Performance Estmaton Sgnal Processor Decde Sgnal s resent or Sgnal s not resent Nose Nose Sgnal? Problem: How should receved sgnals be rocessed n order
More informationInterdomain Alliance Authentication Protocol Based on Blind Signature
Internatonal Journal of Securty Its Alcatons Vol9 No2 (205) 97206 htt://ddoorg/04257/sa205929 Interdoman Allance Authentcaton Protocol Based on Blnd Sgnature Zhang Je Zhang Qkun Gan Yong Yn Yfeng Tan
More informationOptimal maintenance of a productioninventory system with continuous repair times and idle periods
Proceedngs o the 3 Internatonal Conerence on Aled Mathematcs and Comutatonal Methods Otmal mantenance o a roductonnventory system wth contnuous rear tmes and dle erods T. D. Dmtrakos* Deartment o Mathematcs
More informationA NEW ACTIVE QUEUE MANAGEMENT ALGORITHM BASED ON NEURAL NETWORKS PI. M. Yaghoubi Waskasi MYaghoubi@ece.ut.ac.ir. M. J. Yazdanpanah Yazdan@ut.ac.
A NEW ACTIVE QUEUE MANAGEMENT ALGORITHM BASED ON NEURAL NETWORKS M. Yaghoub Waskas MYaghoub@ece.ut.ac.r M. J. Yazdananah Yazdan@ut.ac.r N. Yazdan Yazdan@ut.ac.r Control and Intellgent Processng Center
More informationInequality and The Accounting Period. Quentin Wodon and Shlomo Yitzhaki. World Bank and Hebrew University. September 2001.
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationStatistical algorithms in Review Manager 5
Statstcal algorthms n Reve Manager 5 Jonathan J Deeks and Julan PT Hggns on behalf of the Statstcal Methods Group of The Cochrane Collaboraton August 00 Data structure Consder a metaanalyss of k studes
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract  Stock market s one of the most complcated systems
More informationTHE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES
The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered
More informationADOPTION OF BIG DATA ANALYTICS IN HEALTHCARE: THE EFFICIENCY AND PRIVACY
ADOPTION OF BIG DATA ANALYTICS IN HEALTHCARE: THE EFFICIENCY AND PRIVACY He L, School of Economc Informaton Engneerng, Southwestern Unversty of Fnance and Economcs, Chengdu, Chna, olverlhe@gmalcom Jng
More informationRelay Secrecy in Wireless Networks with Eavesdropper
Relay Secrecy n Wreless Networks wth Eavesdropper Parvathnathan Venktasubramanam, Tng He and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY 14853 Emal : {pv45, th255,
More informationAn Analytical Model for Multitier Internet Services and Its Applications
An Analytcal Model for Multter Internet Servces and Its Alcatons Bhuvan Urgaonkar, Govann Pacfc, Prashant Shenoy, Mke Sretzer, and Asser Tantaw Det. of Comuter Scence, Servce Management Mddleware Det.,
More informationA Hierarchical Anomaly Network Intrusion Detection System using Neural Network Classification
IDC IDC A Herarchcal Anomaly Network Intruson Detecton System usng Neural Network Classfcaton ZHENG ZHANG, JUN LI, C. N. MANIKOPOULOS, JAY JORGENSON and JOSE UCLES ECE Department, New Jersey Inst. of Tech.,
More information1 Example 1: Axisaligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMAHDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationPortfolio Loss Distribution
Portfolo Loss Dstrbuton Rsky assets n loan ortfolo hghly llqud assets holdtomaturty n the bank s balance sheet Outstandngs The orton of the bank asset that has already been extended to borrowers. Commtment
More informationAn InterestOriented Network Evolution Mechanism for Online Communities
An InterestOrented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationAdaptive Load Balancing of Parallel Applications with MultiAgent Reinforcement Learning on Heterogeneous Systems
Adatve Load Balancng of Parallel Alcatons wth MultAgent Renforcement Learnng on Heterogeneous Systems Johan PAREN, Kata VERBEECK, Ann NOWE, Krs SEENHAU COMO, VUB Brussels, Belgum Emal: ohan@nfo.vub.ac.be,
More informationA Prediction System Based on Fuzzy Logic
Proceedngs of the World Congress on Engneerng and Comuter Scence 2008 WCECS 2008, October 2224, 2008, San Francsco, USA A Predcton System Based on Fuzzy Logc Vadeh.V,Monca.S, Mohamed Shek Safeer.S, Deeka.M
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationNegative Selection and Niching by an Artificial Immune System for Network Intrusion Detection
Negatve Selecton and Nchng by an Artfcal Immune System for Network Intruson Detecton Jungwon Km and Peter Bentley Department of omputer Scence, Unversty ollege London, Gower Street, London, W1E 6BT, U.K.
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? ChuShu L Department of Internatonal Busness, Asa Unversty, Tawan ShengChang
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT09105, Phone: (3705) 2127472, Fax: (3705) 276 1380, Email: info@teltonika.
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths userfrendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationMetaAnalysis of Hazard Ratios
NCSS Statstcal Softare Chapter 458 MetaAnalyss of Hazard Ratos Introducton Ths module performs a metaanalyss on a set of togroup, tme to event (survval), studes n hch some data may be censored. These
More informationPowerofTwo Policies for Single Warehouse MultiRetailer Inventory Systems with Order Frequency Discounts
Powerofwo Polces for Sngle Warehouse MultRetaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationNetwork Security Situation Evaluation Method for Distributed Denial of Service
Network Securty Stuaton Evaluaton Method for Dstrbuted Denal of Servce Jn Q,2, Cu YMn,2, Huang MnHuan,2, Kuang XaoHu,2, TangHong,2 ) Scence and Technology on Informaton System Securty Laboratory, Bejng,
More informationSection 5.4 Annuities, Present Value, and Amortization
Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today
More informationA RatioBased Control Algorithm for Defense of DDoS Attacks
A RatoBased ontrol Algorthm for Defense of DDoS Attacks ShengYa n Yong Xong Jyhharn u Deartment of omuter Scence eas A&M Unversty ollege Staton X 7784 {shengyayonglu}@cs.tamu.edu echncal Reort 0054
More informationA Passive Network Measurementbased Traffic Control Algorithm in Gateway of. P2P Systems
roceedngs of the 7th World Congress The Internatonal Federaton of Automatc Control A assve Network Measurementbased Traffc Control Algorthm n Gateway of 2 Systems Ybo Jang, Weje Chen, Janwe Zheng, Wanlang
More informationConferencing protocols and Petri net analysis
Conferencng protocols and Petr net analyss E. ANTONIDAKIS Department of Electroncs, Technologcal Educatonal Insttute of Crete, GREECE ena@chana.tecrete.gr Abstract: Durng a computer conference, users desre
More informationSearching for Interacting Features for Spam Filtering
Searchng for Interactng Features for Spam Flterng Chuanlang Chen 1, YunChao Gong 2, Rongfang Be 1,, and X. Z. Gao 3 1 Department of Computer Scence, Bejng Normal Unversty, Bejng 100875, Chna 2 Software
More informationLecture 3: Force of Interest, Real Interest Rate, Annuity
Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annutymmedate, and ts present value Study annutydue, and
More informationEnergybased Design of Steel Structures According to the Predefined Interstory Drift Ratio 1
Dgest 01, December 01, 15731593 Energybased Desgn of Steel Structures Accordng to the Predefned Interstory Drft Rato 1 Onur ERTER* Özgür BOZDAĞ** ustafa DÜZGÜ*** ABSTRACT The methods whch take lace n
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationLevel Annuities with Payments Less Frequent than Each Interest Period
Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annutymmedate 2 Annutydue Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annutymmedate 2 Annutydue Symoblc approach
More informationFinite Math Chapter 10: Study Guide and Solution to Problems
Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount
More informationResource Scheduling Scheme Based on Improved Frog Leaping Algorithm in Cloud Environment
Informaton technologes Resource Schedulng Scheme Based on Improved Frog Leapng Algorthm n Cloud Envronment Senbo Chen 1, 2 1 School of Computer Scence and Technology, Nanjng Unversty of Aeronautcs and
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):18841889 Research Artcle ISSN : 09757384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationStudy on Model of Risks Assessment of Standard Operation in Rural Power Network
Study on Model of Rsks Assessment of Standard Operaton n Rural Power Network Qngj L 1, Tao Yang 2 1 Qngj L, College of Informaton and Electrcal Engneerng, Shenyang Agrculture Unversty, Shenyang 110866,
More informationwww.engineerspress.com Neural Network Solutions for Forward Kinematics Problem of Hybrid SerialParallel Manipulator
www.engneersress.com World of Scences Journal ISSN: 307307 Year: 03 Volume: Issue: 8 Pages: 4858 Aahmad Ghanbar,, Arash ahman Deartment of Mechancal Engneerng, Unversty of Tabrz, Tabrz, Iran School of
More informationgreatest common divisor
4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationProactive Secret Sharing Or: How to Cope With Perpetual Leakage
Proactve Secret Sharng Or: How to Cope Wth Perpetual Leakage Paper by Amr Herzberg Stanslaw Jareck Hugo Krawczyk Mot Yung Presentaton by Davd Zage What s Secret Sharng Basc Idea ((2, 2)threshold scheme):
More informationMAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPPATBDClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationDesign and Development of a Security Evaluation Platform Based on International Standards
Internatonal Journal of Informatcs Socety, VOL.5, NO.2 (203) 780 7 Desgn and Development of a Securty Evaluaton Platform Based on Internatonal Standards Yuj Takahash and Yoshm Teshgawara Graduate School
More informationTowards an Effective Personalized Information Filter for P2P Based Focused Web Crawling
Journal of Comuter Scence (1): 97103, 006 ISS 15493636 006 Scence Publcatons Towards an Effectve Personalzed Informaton Flter for PP Based Focused Web Crawlng Fu Xanghua and Feng Boqn Deartment of
More informationFREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES
FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EKMUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan
More informationA graphtheoretic framework for isolating botnets in a network
SECURITY AND COMMUNICATION NETWORKS Securty Comm. Networks (212) Publshed onlne n Wley Onlne Lbrary (wleyonlnelbrary.com)..5 SPECIAL ISSUE PAPER A graphtheoretc framework for solatng botnets n a network
More informationA Statistical Model for Detecting Abnormality in StaticPriority Scheduling Networks with Differentiated Services
A Statstcal odel for Detectng Abnoralty n StatcProrty Schedulng Networks wth Dfferentated Servces ng L 1 and We Zhao 1 School of Inforaton Scence & Technology, East Chna Noral Unversty, Shangha 0006,
More informationLogical Development Of Vogel s Approximation Method (LDVAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77866 Logcal Development Of Vogel s Approxmaton Method (LD An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationOn the Optimal Control of a Cascade of HydroElectric Power Stations
On the Optmal Control of a Cascade of HydroElectrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationTuition Fee Loan application notes
Tuton Fee Loan applcaton notes for new parttme EU students 2012/13 About these notes These notes should be read along wth your Tuton Fee Loan applcaton form. The notes are splt nto three parts: Part 1
More informationTexas Instruments 30X IIS Calculator
Texas Instruments 30X IIS Calculator Keystrokes for the TI30X IIS are shown for a few topcs n whch keystrokes are unque. Start by readng the Quk Start secton. Then, before begnnng a specfc unt of the
More informationA Multimode Image Tracking System Based on Distributed Fusion
A Multmode Image Tracng System Based on Dstrbuted Fuson Ln zheng Chongzhao Han Dongguang Zuo Hongsen Yan School of Electroncs & nformaton engneerng, X an Jaotong Unversty X an, Shaanx, Chna Lnzheng@malst.xjtu.edu.cn
More informationGas Deliverability Model with Different Vertical Wells Properties
PROC. ITB En. Scence Vol. 35 B, No., 003, 538 5 Gas Delverablty Model wth Dfferent Vertcal Wells Proertes L. Mucharam, P. Sukarno, S. Srear,3, Z. Syhab, E. Soewono,3, M. Ar 3 & F. Iral 3 Deartment of
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationMultisensor Data Fusion for Cyber Security Situation Awareness
Avalable onlne at www.scencedrect.com Proceda Envronmental Scences 0 (20 ) 029 034 20 3rd Internatonal Conference on Envronmental 3rd Internatonal Conference on Envronmental Scence and Informaton Applcaton
More informationTrafficlight a stress test for life insurance provisions
MEMORANDUM Date 006097 Authors Bengt von Bahr, Göran Ronge Traffclght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationAN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS
Internatonal Journal of Network Securty & Its Applcatons (IJNSA), Vol.5, No.3, May 2013 AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS Len Harn 1 and Changlu Ln 2 1 Department of Computer Scence
More informationA cooperative connectionist IDS model to identify independent anomalous SNMP situations
A cooperatve connectonst IDS model to dentfy ndependent anomalous SNMP stuatons Álvaro Herrero, Emlo Corchado, José Manuel Sáz Department of Cvl Engneerng, Unversty of Burgos, Span escorchado@ubu.es Abstract
More informationUsing Series to Analyze Financial Situations: Present Value
2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationA New Task Scheduling Algorithm Based on Improved Genetic Algorithm
A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng
More informationRAT Selection in 3GPPbased Cellular Heterogeneous Networks: from Theory to Practical Implementation
Ths full text aer was eer revewed at the drecton of IEEE ommuncatons Socety suject matter exerts for ulcaton n the WN 2007 roceedngs. RAT Selecton n 3GPPased ellular Heterogeneous Networks: from Theory
More informationIn some supply chains, materials are ordered periodically according to local information. This paper investigates
MANUFACTURING & SRVIC OPRATIONS MANAGMNT Vol. 12, No. 3, Summer 2010, pp. 430 448 ssn 15234614 essn 15265498 10 1203 0430 nforms do 10.1287/msom.1090.0277 2010 INFORMS Improvng Supply Chan Performance:
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 6105194390,
More information