HOW DO SECURITY TECHNOLOGIES INTERACT WITH EACH OTHER TO CREATE VALUE? THE ANALYSIS OF FIREWALL AND INTRUSION DETECTION SYSTEM

Size: px
Start display at page:

Download "HOW DO SECURITY TECHNOLOGIES INTERACT WITH EACH OTHER TO CREATE VALUE? THE ANALYSIS OF FIREWALL AND INTRUSION DETECTION SYSTEM"

Transcription

1 HOW O SECURTY TECHNOLOGES NTERACT WTH EACH OTHER TO CREATE VALUE? THE ANALYSS O REWALL AN NTRUSON ETECTON SYSTEM Huseyin CAVUSOGLU Srinivasan RAGHUNATHAN Hasan CAVUSOGLU Tulane University University of Texas at allas University of British Columbia Extene Abstract 1. ntrouction The goal of T security is to balance the nees of information protection an information. To achieve this goal firms eploy multiple security technologies often arrange in the form of a layere security architecture. T security research along with its traitional emphasis on security technology has recently begun analyzing T security from an economics perspective. T security researchers have initiate research on the impact of vulnerability level on firms security investment ecisions (Goron an Loeb 2002) the effect of security interepenency on firms risk management strategies (Ogut et al. 2005) market for vulnerability iscovery (Kannan an Telang 2005) responsible security vulnerability isclosure policies (Cavusoglu et al. 2004a) an security patch management (Cavusoglu et al. 2004b). The goal of our research is to unerstan the rivers of economic value erive from T security technologies so that firms can balance their information an protection nees efficiently. Recently Cavusoglu Mishra an Raghunathan (2005) hereafter referre to as CMR analyze the value of ntrusion etection Systems (Ss). Because CMR focuse on the value of etection of security breaches it consiere only users that ha to the system. Consequently CMR i not consier the traeoff between an protection of information. n this paper we analyze the value of firewalls an Ss the two security technologies commonly use to satisfy the information an protection nees when they are use iniviually an together. The funamental motivation for our research is the ebate within the T security community about whether a firewall obviates or complements the nee for S an vice versa. Axelsson (2000) summarize the ebate as The best effort [security] is often achieve when several security measures are brought to bear together. How shoul intrusion etection collaborate with other security mechanisms to this synergy effect? How o we ensure that the combination of security measures provies at least the same level of security as each applie singly woul provie or that the combination oes in fact lower the overall security of the protecte system? an he continue they [these questions] remain largely unaresse by the research community. This is perhaps not surprising since many of these questions are ifficult to formulate an answer. Our research aresses precisely those questions. Our moel of an S is ientical to that of CMR in that Ss are characterize by etection an false alarm rates that are relate by a ROC (Receiver Operating Characteristic) curve. irewalls control entry into an out of T systems. Just like Ss firewalls also suffer from false positive (i.e. enying entry for an authorize user) an false negative (i.e. allowing entry for an unauthorize user) errors. However while the purpose of an S is to etect hacking by any user irrespective of whether the user is an internal user that oes not have to pass through a firewall or an external user that nees to pass through a firewall to use (or abuse) the system the purpose of a firewall is to allow or isallow the use of the system by external users. n essence firewalls aress requirements an Ss aress protection nees. One of our most significant results is that eployment of both a firewall an an S is not necessarily better than eploying either one of them alone. That is firewall an S can conflict with each other. When eploying both a firewall an an S is better than eploying only one of them whether one complements (i.e. enhances the value of) or substitutes (iminishes the value of) the other epens critically on whether the firm allows to external users when it eploys neither of them which in turn epens on the ratio of cost to benefit of proviing to an external user. Our results on complementarity an substitution reveal how proper eployment of technologies such as firewalls an Ss mitigate the traeoff between an protection nees. rom the practitioners point of view the finings of our research offer specific insights about the conitions uner which each technology shoul be implemente an the appropriate T security architecture for a given firm.

2 2. Moel escription We consier an T security architecture that is commonly referre to by the T security community as efense-in-epth (Whitman an Mattor 2003). n this architecture three layers the firewall at the network layer the S at the host layer an manual investigation at the ata layer are employe to implement security. We iscuss the broa components of our moel below. User: Two types of users can use the system that is being protecte by the security architecture. All internal users have to the system from insie the firewall. The external users the system from outsie the firewall an hence they are valiate by the firewall if one exists before ing the system. We assume that ε fraction of users is external users an (1 ε ) fraction is internal users. While all internal users are legal users of the system only a proportion ζ of external users are legal users. The objective of the firewall is to allow all legal external users an to stop all illegal external users. After gaining to the system a user (internal or external) may choose to abuse (hack) the system. A hacker erives a benefit of if the intrusion is unetecte. f the intrusion is etecte the hacker incurs a penalty of for a net benefit of ( ). We assume that ; that is a hacker that is etecte oes not enjoy a positive benefit. We enote the probability of hacking for a user as. Note that in orer to hack a user has to gain first. Cracking a firewall alone is not consiere an intrusion because by cracking a firewall a user simply gets to the system. irm: The firm may use a firewall an S both a firewall an S or neither in its security architecture. The firm oes not gain or lose anything just because a user is given. However hacking by any user legal or illegal an external or internal imposes a loss to the firm an normal use by a legal user offers a positive benefit to the firm. We assume that the benefit to the firm for normal usage by a legal user is ω. When a user hacks the system an the intrusion is unetecte the firm incurs a amage of. However the firm can etect intrusions using Ss an manual investigations. irms can confirm or rule out intrusions only through manual investigation (Cavusoglu et al. 2005). f the firm etects an intrusion the firm prevents or recovers a fraction φ 1 of. t is reasonable to assume that c φ so that the firm s cost of investigation is not higher than the benefit it gets if it etects an intrusion. irewall: The firewall is eploye to control the by external users. ollowing the literature (Cavusoglu et al. 2004c) we measure the effectiveness of a firewall through two parameters:. is the probability that the firewall stops an illegal external user. an is the probability that the firewall stops a legal external user. S: The moel for the S is similar to that of a firewall an is ientical to that of CMR. That is is the probability that the S raises an alarm for an intrusion. is the probability that the S raises an alarm when there is no intrusion. Unlike a firewall which takes action against suspecte hackers an S simply raises an alarm. Only manual investigation confirms or rules out intrusions. 3. Moel Analysis We moel the security problem as a game between the firm an users of the system it protects. The firm ecies on the technologies it woul implement. Then given the technology structure an their quality profile the firm ecies on its manual investigation strategy while the users ecie on their hacking strategies. inally the payoffs are realize. We assume that the firm an users are risk neutral We perform the analysis using backwar inuction. That is first we erive the equilibrium for the firm s investigation strategy an a user s hacking strategy given that the firm has ecie to implement either one both or none of the security technologies. Subsequently we etermine the value of implementing ifferent technologies an the firm s optimal technology implementation strategy. The cases when the firm implements only the firewall or only the S or neither are special cases of the case when the firm implements both the firewall an S. Consequently we analyze the firewall plus S case first. (Note: erivations of results were omitte ue to size limit but available from authors upon request) roposition 1: The equilibrium when the firm implements a firewall an an S is given by the following.

3 c if then 0 * * * 1 2 c( ) c(1 ) Otherwise 1 ( ) (1 ) (1 ) * * * 1 2 c or the firewall only case we substitute 1. That is the S is assume to generate an alarm for every user. The S only case is slightly more complex because of two possibilities that arise when there is no firewall. n the first possibility which we refer to as no-external- scenario the firm oes not use a firewall because it oes not allow to any external user an restricts only to internal users. The secon possibility which we refer to as full-external- scenario is one in which the firm oes not use a firewall because it allows to every external user an hence it oes not nee a firewall to selectively block or allow. The former scenario can be analyze by setting 1 in our moel an the latter scenario is equivalent to substituting 0. or the no technology case we make the following substitutions: 1 an epening on how we view the absence of a firewall either 0 or 1 Base on these substitutions we fin the following result. Corollary 1. (a) The equilibrium for the S only case both for no-external- an full-external scenarios is ientical to that for the firewall an S case given in roposition 1. (b) The equilibria for the firewall only case an the no technology case both for no-external- an full- * * external- scenarios are ientical an is given by the strategy profile ( / c / ). We can show that in the no-technology case the firm oes allow external iif ( c / φ ) ( c / φ ) / ( ωζ ( 1 ( c / φ ))) < 1. We enote the quantity as the cost-to-benefit-ratio- ωζ (1 c / φ ) ( ) for-external-. 4. The Value of irewall an S Having erive the firm s optimal strategies for ifferent T security architectures we next erive the value of firewall an S when each is eploye alone or both are eploye together. We compute the value of a specific technology or the combination of technologies as (firm s expecte payoff when it implements a specific technology or the combination of technologies firm s expecte payoff when it oes not implement any technology) The Value of irewall Only The value of a firewall can be compute to be (1 ) c 1 c c in the fullexternal- scenario an (1 ) 1 1 (1 ) c c in the no-external scenario. roposition 2. The value from implementing only a firewall is positive iff c / (1 ). (1 ) c (1 ) 1 (1 )(1 ) roposition 2 shows that the firm erives a positive value from a firewall only when the cost-tobenefit-ratio-for-external- is neither too high nor too low. Clearly the upper limit is greater than one while the lower limit is less than one which implies that a firewall can be beneficial in both fullexternal- an no-external- scenarios The Value of S Only

4 roposition 3. (i) The value of implementing only an S is positive iff ( / ) µ β. (ii) The value of implementing only an S is positive iff the S is a eterrent to hackers. The results state in roposition 3 were foun by CMR also an the intuitions unerlying these results are explaine in CMR. An important question not aresse by CMR is whether the implementation of an S has any impact on the firm s ecision to allow or eny external. The following result answers this question. Corollary 2. When the firm implements an S it will allow external iff cost-to-benefit-ratio-forexternal- is less than /. Corollary 2 implies that eployment of an S may cause a firm to alter its policy of isallowing external to one of allowing external. The reason is that the S eters hackers which in turn increases the benefit an ecreases the cost from external. Our most surprising fining about Ss is that while an S is commonly viewe as a etective control its value pertains to its effect on both prevention an control. Specifically our fining that the S offers positive value only when it eters hackers shows that an S acts as a preventive control an the fining that the S may encourage the firm to allow external shows that an S may also act as an control The Value of S an irewall Combination The key research question here is how the presence of one technology affects the value obtaine from the other technology. We use the following efinitions for these effects where V x = Value of technology x when eploye alone an V x+y = Value of technologies x an y when eploye together. Technologies x an y are complementary if V x+y > Max(V x V y ) an V x+y > Max(0V x )+Max(0V y ); substitutes if V x+y Max(V x V y ) an V x+y Max(0V x )+Max(0V y ); conflicting if V x+y < Max(V x V y ). The efinition of complementary technologies implies that eploying both technologies results in a higher value than eploying either technology alone an further that the incremental value offere by a technology is greater when the firm eploys the other technology than when it oes not. n case of substitutes while eploying both technologies still results in a higher value than eploying either technology alone the incremental value from eploying a technology when the other is alreay eploye is less than its value when eploye alone. inally when the technologies are conflicting eployment of both technologies hurts the firm i.e. the firm realizes the greatest value by eploying only one of the technologies. Unerstaning which of the above three categories a given firewall an S fit into is paramount to firms while setting up the security architecture. ailure to assess these interaction effects may cause the firm to implement some technologies that shoul have not been implemente or to not implement some technologies that shoul have been implemente. Now we show one of the most significant results of this stuy which escribes the interaction between the values of firewall an S technologies. roposition 4. (1) When : ( c / ) 1 f Min Max (1 ) c (1 ) 1 (1 ) (1 ) then S an firewall substitute each other. 1 ( c / ) 1 f Min Max (1 ) 1 (1 ) c 1 (1 ) (1 ) then S an firewall complement each other.

5 Otherwise S an firewall conflict with each other. (2) When : S an firewall conflict with each other. irst a very significant but unexpecte result is that eploying both firewall an S can be worse for the firm than eploying only one of them. f eploying only the S hurts the firm then eploying it along with a firewall results in a value that is lower than that when the firewall is eploye alone. This is because the S that offers a negative value oes not alter the traffic when eploye together with the firewall but increases the hacking probability of every user which in turn reuces the value of the firewall making it less useful. Similarly when eploying only the firewall offers a negative value supplementing an existing S which offers a positive value when use alone with a firewall may reuce the value to the firm. While allowing legal traffic an preventing illegal traffic can be beneficial especially when the firm uses an S if the cost-to-benefit-ratio-of-external- is sufficiently low or is sufficiently high the firm will be better off not controlling the traffic through a firewall even with an S. Secon the substitution an complementary regions are orere from left to right on the cost-tobenefit-ratio-of-external- line. Since firms that have a low (high) cost-to-benefit-ratio-of-external are more likely to allow (isallow) external when a firewall is absent firms appear to enjoy complementary or substitution effect epening on whether they allow or isallow external in the absence of a firewall. We fin that (i) when the firm oes not allow external even when the firm implements an S while complementary effect is possible substitution effect is not an (ii) when the firm allows external when the firm oes not implement any technology while substitution effect is possible complementary effect is not. The intuition for this result is best explaine in terms of how the value of one technology is affecte by the presence or absence of other technology. or complementary (substitution) effect to occur the incremental value offere by a technology shoul be higher (lower) in the presence of the other technology than in the absence. Suppose the firm oes not allow external even when it implements an S. n the presence of a firewall that offers a positive value the same S receives a higher traffic but the hacking probability remains the same. Consequently the incremental value of the S can only be higher in the presence of a firewall than in the absence which inicates the complementary effect. Similar reasoning can be given for why the firewall offers a higher value in the presence than in the absence of an S when the firm oes not allow external even when it implements an S. f the firm allows external when the firm oes not implement any technology then the firm allows external even when it implements only an S. n this scenario if the S is augmente with a firewall while the hacking probability oes not change the traffic to the S ecreases. Consequently the incremental value of the S is lower in the presence of a firewall than in the absence. Thir we fin that in the no-external- scenario even if eploying a firewall alone is not beneficial eploying the firewall along with an S may be more beneficial than eploying the S alone; that is the firewall becomes beneficial in the presence of an S. When only a firewall is eploye it oes not offer a positive value if the expecte gain from legal is less than the expecte loss from hacking. An S reuces the probability of hacking. This enhances the expecte benefit from legal usage an reuces the loss from hacking when external users are allowe to. Consequently a firewall may become beneficial when use with an S even if it is not beneficial when use alone. 5. iscussion an Conclusions The analysis presente in the previous sections offere important theoretical insights into the value of S an firewall technologies. rom a manager s perspective the most important implications of our analysis pertain to insights about the optimal firewall an S eployment policies. We epict the optimal eployment policy in Table 1. t reveals that a firm shoul implement both a firewall an an S only when the cost-to-benefit-ratio-for-external- is moerate an etection rate of S is high. Otherwise firm shoul implement at most one technology. These results run counter to the recommenation by some people in the T security community to rely only on firewalls for balancing the an protection nees (Gartner 2003).

6 igure 1. esign of the optimal security architecture with efault configuration / No technology allow external Only a firewall No technology rop external Only an S allow external Both a firewall an an S Only an S rop external x1 x2 x3 x4 We use a stylize moel to assess the value of an S an a firewall. As with all stylize moels our moel shoul be juge base on the insights it yiels. rom the viewpoint of practical application of our moel estimates of ifferent costs quality an other parameters become essential. We believe that even with limitations with respect to obtaining relevant ata the qualitative insights we erive our stuy are useful to managers. n our analysis we assume that the firewall an S are implemente using efault configuration. However since many security technologies are configurable value of these technologies when they are optimally configure is of paramount interest to firms. As point out in CMR configuration makes every S valuable. Currently we are investigating configuration in firewall an S when they are use alone an together. This analysis will she light into (i) the value of optimally configure security technologies (ii) whether security technologies are configure ifferently when they are use together an alone (iii) the type of interaction effect between security technologies when they are optimally configure an (iv) the esign of optimal security architecture. We hope to have the initial results reay by WSE REERENCES Cavusoglu H. B. K. Mishra an S. Raghunathan (2005) The Value of S in T Security Architecture nformation Systems Research 19(1) pp Cavusoglu H. B. Mishra S. Raghunathan (2004c) "A Moel for Evaluating T Security nvestments" Communications of the ACM 47(7) pp Cavusoglu H. H. Cavusoglu an J. Zhang (2004b) Security atch Management: Can t Live with it Can t Live without it WTS04 Washington C. Cavusoglu H. H. Cavusoglu an S. Raghunathan (2004a) Analysis of Software Vulnerability isclosure olicies CORS/NORMS Banff Alberta Canaa. Gartner (2003) Hype Cycle for nformation Security Gartner Research Report Stamfor C. Goron L. A. an M.. Loeb (2002) "The Economics of nformation Security nvestment" ACM Transactions on nformation an System Security pp Kannan K. an R. Telang (2005) Market for Software Vulnerabilities? Think Again Management Science 51(5) pp Ogut H. N. Menon an S. Raghunathan (2005) "Cyber nsurance an T Security nvestment: mpact of nterepenent Risk" WES05 Boston MA.

Online Appendix to: Generalizing Database Forensics

Online Appendix to: Generalizing Database Forensics Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that

More information

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:

More information

Coupling the User Interfaces of a Multiuser Program

Coupling the User Interfaces of a Multiuser Program Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces

More information

Study of Network Optimization Method Based on ACL

Study of Network Optimization Method Based on ACL Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department

More information

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract

More information

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,

More information

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway

More information

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus

More information

Loop Scheduling and Partitions for Hiding Memory Latencies

Loop Scheduling and Partitions for Hiding Memory Latencies Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:

More information

CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing

CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing Tim Roughgaren October 19, 2016 1 Routing in the Internet Last lecture we talke about elay-base (or selfish ) routing, which

More information

Laboratory I.7 Linking Up with the Chain Rule

Laboratory I.7 Linking Up with the Chain Rule Laboratory I.7 Linking Up with the Chain Rule Goal The stuent will figure out the Chain Rule for certain example functions. Before the Lab The Chain Rule is the erivative rule which accounts for function

More information

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization 1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24

More information

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science

More information

Skyline Community Search in Multi-valued Networks

Skyline Community Search in Multi-valued Networks Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h

More information

Adaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots

Adaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:

More information

Improving Spatial Reuse of IEEE Based Ad Hoc Networks

Improving Spatial Reuse of IEEE Based Ad Hoc Networks mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos

More information

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,

More information

Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks

Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks Coorinating Distribute Algorithms for Feature Extraction Offloaing in Multi-Camera Visual Sensor Networks Emil Eriksson, György Dán, Viktoria Foor School of Electrical Engineering, KTH Royal Institute

More information

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base

More information

The Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract

The Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie

More information

Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs

Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,

More information

On the Placement of Internet Taps in Wireless Neighborhood Networks

On the Placement of Internet Taps in Wireless Neighborhood Networks 1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that

More information

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure

More information

ACE: And/Or-parallel Copying-based Execution of Logic Programs

ACE: And/Or-parallel Copying-based Execution of Logic Programs ACE: An/Or-parallel Copying-base Execution of Logic Programs Gopal GuptaJ Manuel Hermenegilo* Enrico PontelliJ an Vítor Santos Costa' Abstract In this paper we present a novel execution moel for parallel

More information

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication

More information

Architecture Design of Mobile Access Coordinated Wireless Sensor Networks

Architecture Design of Mobile Access Coordinated Wireless Sensor Networks Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,

More information

Comparison of Methods for Increasing the Performance of a DUA Computation

Comparison of Methods for Increasing the Performance of a DUA Computation Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,

More information

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative

More information

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis

More information

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,

More information

Rough Set Approach for Classification of Breast Cancer Mammogram Images

Rough Set Approach for Classification of Breast Cancer Mammogram Images Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems

More information

Lecture 1 September 4, 2013

Lecture 1 September 4, 2013 CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the

More information

filtering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember

filtering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember 107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html

More information

Classical Mechanics Examples (Lagrange Multipliers)

Classical Mechanics Examples (Lagrange Multipliers) Classical Mechanics Examples (Lagrange Multipliers) Dipan Kumar Ghosh Physics Department, Inian Institute of Technology Bombay Powai, Mumbai 400076 September 3, 015 1 Introuction We have seen that the

More information

Robust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks

Robust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science

More information

1 Surprises in high dimensions

1 Surprises in high dimensions 1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic

More information

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita

More information

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,

More information

A shortest path algorithm in multimodal networks: a case study with time varying costs

A shortest path algorithm in multimodal networks: a case study with time varying costs A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via

More information

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks 1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing

More information

Message Transport With The User Datagram Protocol

Message Transport With The User Datagram Protocol Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer

More information

Variable Independence and Resolution Paths for Quantified Boolean Formulas

Variable Independence and Resolution Paths for Quantified Boolean Formulas Variable Inepenence an Resolution Paths for Quantifie Boolean Formulas Allen Van Geler http://www.cse.ucsc.eu/ avg University of California, Santa Cruz Abstract. Variable inepenence in quantifie boolean

More information

AnyTraffic Labeled Routing

AnyTraffic Labeled Routing AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,

More information

Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation

Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University

More information

Throughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem

Throughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple

More information

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose

More information

On-path Cloudlet Pricing for Low Latency Application Provisioning

On-path Cloudlet Pricing for Low Latency Application Provisioning On-path Cloulet Pricing for Low Latency Application Provisioning Argyrios G. Tasiopoulos, Onur Ascigil, Ioannis Psaras, Stavros Toumpis, George Pavlou Dept. of Electronic an Electrical Engineering, University

More information

Inuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem

Inuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem Inuence of Cross-Interferences on Blocke Loops A Case Stuy with Matrix-Vector Multiply CHRISTINE FRICKER INRIA, France an OLIVIER TEMAM an WILLIAM JALBY University of Versailles, France State-of-the art

More information

EFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER

EFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In

More information

Enabling Rollback Support in IT Change Management Systems

Enabling Rollback Support in IT Change Management Systems Enabling Rollback Support in IT Change Management Systems Guilherme Sperb Machao, Fábio Fabian Daitx, Weverton Luis a Costa Coreiro, Cristiano Bonato Both, Luciano Paschoal Gaspary, Lisanro Zambeneetti

More information

Design and Analysis of Optimization Algorithms Using Computational

Design and Analysis of Optimization Algorithms Using Computational Appl. Num. Anal. Comp. Math., No. 3, 43 433 (4) / DOI./anac.47 Design an Analysis of Optimization Algorithms Using Computational Statistics T. Bartz Beielstein, K.E. Parsopoulos,3, an M.N. Vrahatis,3 Department

More information

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract

More information

PART 2. Organization Of An Operating System

PART 2. Organization Of An Operating System PART 2 Organization Of An Operating System CS 503 - PART 2 1 2010 Services An OS Supplies Support for concurrent execution Facilities for process synchronization Inter-process communication mechanisms

More information

Pairwise alignment using shortest path algorithms, Gunnar Klau, November 29, 2005, 11:

Pairwise alignment using shortest path algorithms, Gunnar Klau, November 29, 2005, 11: airwise alignment using shortest path algorithms, Gunnar Klau, November 9,, : 3 3 airwise alignment using shortest path algorithms e will iscuss: it graph Dijkstra s algorithm algorithm (GDU) 3. References

More information

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks 1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stoylar arxiv:15.4984v1 [cs.ni] 27 May 21 Abstract

More information

Sampling Strategies for Epidemic-Style Information Dissemination

Sampling Strategies for Epidemic-Style Information Dissemination This full text paper was peer reviewe at the irection of IEEE Communications Society subject matter experts for publication in the IEEE INFOCOM 2008 proceeings. Sampling Strategies for Epiemic-Style Information

More information

Modifying ROC Curves to Incorporate Predicted Probabilities

Modifying ROC Curves to Incorporate Predicted Probabilities Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,

More information

NAND flash memory is widely used as a storage

NAND flash memory is widely used as a storage 1 : Buffer-Aware Garbage Collection for Flash-Base Storage Systems Sungjin Lee, Dongkun Shin Member, IEEE, an Jihong Kim Member, IEEE Abstract NAND flash-base storage evice is becoming a viable storage

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.

More information

Disjoint Multipath Routing in Dual Homing Networks using Colored Trees

Disjoint Multipath Routing in Dual Homing Networks using Colored Trees Disjoint Multipath Routing in Dual Homing Networks using Colore Trees Preetha Thulasiraman, Srinivasan Ramasubramanian, an Marwan Krunz Department of Electrical an Computer Engineering University of Arizona,

More information

Considering bounds for approximation of 2 M to 3 N

Considering bounds for approximation of 2 M to 3 N Consiering bouns for approximation of to (version. Abstract: Estimating bouns of best approximations of to is iscusse. In the first part I evelop a powerseries, which shoul give practicable limits for

More information

Learning convex bodies is hard

Learning convex bodies is hard Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples

More information

Divide-and-Conquer Algorithms

Divide-and-Conquer Algorithms Supplment to A Practical Guie to Data Structures an Algorithms Using Java Divie-an-Conquer Algorithms Sally A Golman an Kenneth J Golman Hanout Divie-an-conquer algorithms use the following three phases:

More information

Characterizing Decoding Robustness under Parametric Channel Uncertainty

Characterizing Decoding Robustness under Parametric Channel Uncertainty Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric

More information

Comment on Strategic Information Management Under Leakage in a. Supply Chain

Comment on Strategic Information Management Under Leakage in a. Supply Chain Comment on Strategic Information Management Under Leakage in a Supply Chain Lin Tian 1 School of International Business Administration, Shanghai University of Finance and Economics, 00433 Shanghai, China,

More information

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets

More information

Optimal Oblivious Path Selection on the Mesh

Optimal Oblivious Path Selection on the Mesh Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magon-Ismail Jing Xi Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 280, USA {buschc,magon,xij2}@cs.rpi.eu Abstract

More information

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations

More information

d 3 d 4 d d d d d d d d d d d 1 d d d d d d

d 3 d 4 d d d d d d d d d d d 1 d d d d d d Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching

More information

William S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract

William S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract Optimization Methos for Calculating Design Imprecision y William S. Law Eri K. Antonsson Engineering Design Research Laboratory Division of Engineering an Applie Science California Institute of Technology

More information

6.823 Computer System Architecture. Problem Set #3 Spring 2002

6.823 Computer System Architecture. Problem Set #3 Spring 2002 6.823 Computer System Architecture Problem Set #3 Spring 2002 Stuents are strongly encourage to collaborate in groups of up to three people. A group shoul han in only one copy of the solution to the problem

More information

Using Vector and Raster-Based Techniques in Categorical Map Generalization

Using Vector and Raster-Based Techniques in Categorical Map Generalization Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department

More information

On the Energy Efficiency of Content Delivery Architectures

On the Energy Efficiency of Content Delivery Architectures On the Energy Efficiency of Delivery Architectures Kyle Guan, Gary Atkinson, an Daniel C. Kilper Bell Las, Acatel-Lucent, 79 Holmel Roa, Holmel, NJ 07733 Ece Gulsen MIT, 77 Mass. Ave., Camrige, MA 039

More information

Frequent Pattern Mining. Frequent Item Set Mining. Overview. Frequent Item Set Mining: Motivation. Frequent Pattern Mining comprises

Frequent Pattern Mining. Frequent Item Set Mining. Overview. Frequent Item Set Mining: Motivation. Frequent Pattern Mining comprises verview Frequent Pattern Mining comprises Frequent Pattern Mining hristian Borgelt School of omputer Science University of Konstanz Universitätsstraße, Konstanz, Germany christian.borgelt@uni-konstanz.e

More information

Optimal Routing and Scheduling for Deterministic Delay Tolerant Networks

Optimal Routing and Scheduling for Deterministic Delay Tolerant Networks Optimal Routing an Scheuling for Deterministic Delay Tolerant Networks Davi Hay Dipartimento i Elettronica olitecnico i Torino, Italy Email: hay@tlc.polito.it aolo Giaccone Dipartimento i Elettronica olitecnico

More information

More Raster Line Issues. Bresenham Circles. Once More: 8-Pt Symmetry. Only 1 Octant Needed. Spring 2013 CS5600

More Raster Line Issues. Bresenham Circles. Once More: 8-Pt Symmetry. Only 1 Octant Needed. Spring 2013 CS5600 Spring 03 Lecture Set 3 Bresenham Circles Intro to Computer Graphics From Rich Riesenfel Spring 03 More Raster Line Issues Fat lines with multiple pixel with Symmetric lines n point geometry how shoul

More information

Non-homogeneous Generalization in Privacy Preserving Data Publishing

Non-homogeneous Generalization in Privacy Preserving Data Publishing Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h

More information

Robust Camera Calibration for an Autonomous Underwater Vehicle

Robust Camera Calibration for an Autonomous Underwater Vehicle obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of

More information

Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach

Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach Jian Zhao, Chuan Wu The University of Hong Kong {jzhao,cwu}@cs.hku.hk Abstract Peer-to-peer (P2P) technology is popularly

More information

Verifying performance-based design objectives using assemblybased vulnerability

Verifying performance-based design objectives using assemblybased vulnerability Verying performance-base esign objectives using assemblybase vulnerability K.A. Porter Calornia Institute of Technology, Pasaena, Calornia, USA A.S. Kiremijian Stanfor University, Stanfor, Calornia, USA

More information

Adjusted Probabilistic Packet Marking for IP Traceback

Adjusted Probabilistic Packet Marking for IP Traceback Ajuste Probabilistic Packet Marking for IP Traceback Tao Peng, Christopher Leckie, an Kotagiri Ramamohanarao 2 ARC Special Research Center for Ultra-Broaban Information Networks Department of Electrical

More information

Questions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!

Questions? Post on piazza, or  Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)! EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an

More information

Recitation Caches and Blocking. 4 March 2019

Recitation Caches and Blocking. 4 March 2019 15-213 Recitation Caches an Blocking 4 March 2019 Agena Reminers Revisiting Cache Lab Caching Review Blocking to reuce cache misses Cache alignment Reminers Due Dates Cache Lab (Thursay 3/7) Miterm Exam

More information

Fuzzy Rules Based System for Diagnosis of Stone Construction Cracks of Buildings

Fuzzy Rules Based System for Diagnosis of Stone Construction Cracks of Buildings Fuzzy Rules Base System for Diagnosis of Stone Construction Cracks of Builings Serhiy Shtovba, Alexaner Rotshtein* an Olga Pankevich Vinnitsa State Technical University Khmelnitskoe Shosse, 95, 21021,

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy

More information

Two Dimensional-IP Routing

Two Dimensional-IP Routing Two Dimensional-IP Routing Mingwei Xu Shu Yang Dan Wang Hong Kong Polytechnic University Jianping Wu Abstract Traitional IP networks use single-path routing, an make forwaring ecisions base on estination

More information

2.7 Implicit Differentiation

2.7 Implicit Differentiation 2.7 Implicit Differentiation [ y] = = = [ x] 1 Sometimes we may be intereste in fining the erivative of an equation that is not solve or able to be solve for a particular epenent variable explicitly. In

More information

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 4, APRIL

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 4, APRIL IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 1, NO. 4, APRIL 01 74 Towar Efficient Distribute Algorithms for In-Network Binary Operator Tree Placement in Wireless Sensor Networks Zongqing Lu,

More information

JigCell Model Connector: building large molecular network models from components

JigCell Model Connector: building large molecular network models from components Simulation Applications JigCell Moel Connector: builing large molecular network moels from components Simulation: Transactions of the Society for Moeling an Simulation International 2018, Vol. 94(11) 993

More information

Computer Organization

Computer Organization Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.

More information

Impact of cache interferences on usual numerical dense loop. nests. O. Temam C. Fricker W. Jalby. University of Leiden INRIA University of Versailles

Impact of cache interferences on usual numerical dense loop. nests. O. Temam C. Fricker W. Jalby. University of Leiden INRIA University of Versailles Impact of cache interferences on usual numerical ense loop nests O. Temam C. Fricker W. Jalby University of Leien INRIA University of Versailles Niels Bohrweg 1 Domaine e Voluceau MASI 2333 CA Leien 78153

More information

Optimizing the quality of scalable video streams on P2P Networks

Optimizing the quality of scalable video streams on P2P Networks Optimizing the quality of scalable vieo streams on PP Networks Paper #7 ASTRACT The volume of multimeia ata, incluing vieo, serve through Peer-to-Peer (PP) networks is growing rapily Unfortunately, high

More information

FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD

FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD Warsaw University of Technology Faculty of Physics Physics Laboratory I P Joanna Konwerska-Hrabowska 6 FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD.

More information

A Framework for Dialogue Detection in Movies

A Framework for Dialogue Detection in Movies A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki

More information

Top-down Connectivity Policy Framework for Mobile Peer-to-Peer Applications

Top-down Connectivity Policy Framework for Mobile Peer-to-Peer Applications Top-own Connectivity Policy Framework for Mobile Peer-to-Peer Applications Otso Kassinen Mika Ylianttila Junzhao Sun Jussi Ala-Kurikka MeiaTeam Department of Electrical an Information Engineering University

More information

THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM

THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao

More information

I see you, you see me: Cooperative Localization through Bearing-Only Mutually Observing Robots

I see you, you see me: Cooperative Localization through Bearing-Only Mutually Observing Robots 2012 IEEE/RSJ International Conference on Intelligent Robots an Systems October 7-12, 2012. Vilamoura, Algarve, Portugal I see you, you see me: Cooperative Localization through Bearing-Only Mutually Observing

More information