An Extreme Value Approach to Information Technology Security Investment

Size: px
Start display at page:

Download "An Extreme Value Approach to Information Technology Security Investment"

Transcription

1 Association for Information Systems AIS Electronic Library (AISeL) ICIS 2005 Proceedings International Conference on Information Systems (ICIS) December 2005 An Extreme Vale Approach to Information Technology Secrity Investment Jinggo Wang State University of New York, Bffalo Abhijit Chadhry Bryant University Raghav Rao State University of New York, Bffalo Follow this and additional works at: Recommended Citation Wang, Jinggo; Chadhry, Abhijit; and Rao, Raghav, "An Extreme Vale Approach to Information Technology Secrity Investment" (2005). ICIS 2005 Proceedings This material is broght to yo by the International Conference on Information Systems (ICIS) at AIS Electronic Library (AISeL). It has been accepted for inclsion in ICIS 2005 Proceedings by an athorized administrator of AIS Electronic Library (AISeL). For more information, please contact

2 AN EXTREME VALUE APPROACH TO INFORMATION TECHNOLOGY SECURITY INVESTMENT Jinggo Wang School of Management State University of New York, Bffalo Bffalo, NY U.S.A. Aby Chadhry CIS Department Bryant University Smithfield, RI U.S.A. H. Raghav Rao School of Management State University of New York, Bffalo Bffalo, NY U.S.A. Abstract Information technology secrity investment is receiving increasing attention in recent years. Varios methods have been proposed to determine the effective level of secrity investment. In this paper, we introdce an extreme vale approach to address the isses of effective bdgeting and investing in IT secrity. In or model, the secrity stats of a system depends on two factors: system secrity level, which is measred by the level of secrity investment, and system attack level, which reflects the secrity risk with which the system is confronted. Secrity investment level is endogenos to the system, while attack level is exogenos. Extreme vale analysis is sed to characterize the stochastic behavior of high-level attacks based on the historical data and to make inferences on ftre attacks. Based on these inferences, we determine the effective secrity soltions and the level of secrity investment to modlate the likelihood of system failre. For illstration prposes, we se an extreme vale approach to analyze a set of traffic data collected from a regional bank. Keywords: Information assrance, secrity investment, two-factor model, extreme vale theory, denial of service (DoS) Introdction The importance of effective management of information technology secrity has increased in recent years de to the increasing freqency and cost of secrity breaches (Gordon et al. 2005). While high-risk organizations may adopt secrity at any price, most commercial organizations have to consider the cost-benefit tradeoff for sch an investment. How to efficiently invest in IT secrity is a big challenge. In the Ernst & Yong Global Information Secrity Srvey (Ernst & Yong 2003, 2004), bdget constraints are listed as one of the main obstacles to effective information secrity. Qantification tools, if applied prdently, can assist in the anticipation and control of direct and indirect compter secrity cost (Geer et al. 2003; Mercri 2003). In this paper, we propose an approach based on extreme vale theory (Gmbel 1958) for IT secrity investment. In or model the secrity stats of a system depends on two factors: system secrity level, which is measred by the level of secrity investment, and system attack level, which reflects the secrity risk with which the system is confronted. Attack level is treated as an exogenos variable that cases system failre, while secrity investment level is endogenos, preventing system failre, and is determined by organizations. The difference between secrity level and the attack level measres the vlnerability of the system Twenty-Sixth International Conference on Information Systems 347

3 Secrity and Assrance Instead of calclating the expected loss vale, we apply extreme vale theory to stdy the extreme attack behavior and address the isses of effective bdgeting and investing in IT secrity. Extreme vale theory is one of the most important statistical disciplines for the applied science, and has fond applications in engineering (Castillo 1988), insrance and finance (Embrechts et al. 1997), and management strategy (Dahan and Mendelson 2001), as well as in environment and biomedical research. Extreme vale theory qantifies the stochastic behavior of a process at nsally large (or small) levels. It is concerned with probabilistic and statistical qestions related to those extreme events. To or knowledge, this is the first paper to apply the extreme vale theory in secrity investment decisions. With the application of extreme vale theory, we attempt to address the following isses: 1. What is the probability distribtion of high-level attacks (i.e., what is the probability that an attack over a given level will occr dring a given year)? 2. What secrity investment is needed so that the probability of potential system failre is below a certain threshold? 3. What are the factors affecting the behavior of high-level attacks? Are the natre and cases of high-level attacks changing over time? Is it a seasonal phenomenon? By answering these qestions, we make inferences on ftre attacks, ths determining the effective secrity soltions and investment level to modlate the likelihood of system failre. Consider defending against denial of service (DoS) as an example. A DoS attack is an incident in which an organization is deprived of the services of a resorce they wold normally expect to have. A Web site can occasionally be forced to temporarily cease operation when accessed by millions of people. High-level traffic is always regarded as a signal of forthcoming DoS attacks. Sppose that, as part of or design criteria to defend against DoS, the Web server is reqired to be able serve all traffic that it is likely to experience within its projected life span, say 1 year (or more years). Daily traffic is monitored and historical data might be available for the last 2 years. The challenge is to estimate the traffic level that might occr over the next 1 year given the 2-year history. Extreme vale theory provides a framework enabling sch extrapolations. Using extreme vale theory, we may not only estimate the distribtion of high-level traffic and the occrrence probability of the traffic over a given level dring a given year, bt also answer sch qestions as what level of traffic will be exceeded with probability 1/365 in a given day. In addition, we may identify factors that inflence the behavior of high-level traffic with proper regression analyses, ths helping s predict the trend of traffic with the change of environment and time. Based on the characterization of extremely heavy traffic, we make inferences on ftre attacks and determine a proper secrity soltion and the level of investment. The organization of this paper is as follows. In the next section, after a literatre review, we introdce or two-factor secrity model. We then present the extreme vale theory. We apply extreme vale analysis to a set of daily internal traffic data collected from a regional bank for illstrative prposes. Finally, we smmarize or stdy and discss ideas for ftre research. Secrity Risk and Secrity Investment Related Literatre Several models have been proposed to determine the effective level of secrity investment. There are basically two approaches (Cavsogl 2004). 1. Using traditional risk or decision analysis framework. Generally these models apply a standard reslt in optimal-control theoretic certainty eqivalence, which implies that only the mean vales (probability-weighted average otcomes) of target variables matter for an optimal policy setting. Gordon and Loeb (2002) proposed an expected benefits of investment in information secrity (EBIS) model. Hoo (2000) sed a decision analysis approach to evalate different policies for IT secrity. Longstaff et al. (2000) proposed a hierarchical holographic model (HHM) to assess secrity risks and provide a model for assessing the efficacy of risk management. 2. Using game theory to model the strategic interactions between the organizations and attackers. Some researchers arge that IT secrity can be treated as a kind of game between organizations and attackers. While the organizations try to cover vlnerabilities in their systems, attackers race in an effort to exploit them. Secrity investments not only prevent secrity breaches by redcing vlnerabilities that attackers can exploit bt also act as a deterrent for attackers by making attacks less attractive (Schechter and Smith 2003). Longstaff et al. (2000)arged that investment in system risk assessment can redce Twenty-Sixth International Conference on Information Systems

4 Wang et al./it Secrity Investment the likelihood of intrsions, which yields benefits mch higher than the investment. Cavsogl, et al. (2004) constrcted a game tree to describe the interaction between organization and hackers. There are two main isses in these models. 1. The expected loss vale or benefit vale cannot flly characterize secrity failres. Usally secrity failres are lowprobability events, bt once realized, failres can bring hge loss. The loss may be intangible and not amenable to accrate estimation. 2. Rationality of hackers is hard to captre as they may be motivated by a different vale system. They may be rational, bt not in or terms. They may be driven by motivations other than money. It is hard for s to know their cost fnction for attacking the system. A Two-Factor Secrity Model Secrity risk assessment determines the level of secrity risk that exists within the organization. Farahmand et al. (2005) presented a sbjective analysis and probability assessment with a damage evalation of information secrity incidents. Geer et al. (2003) introdced a techniqe called bsiness-adjsted risk (BAR) for classifying secrity defects by their vlnerability type, degree of risk, and potential bsiness impact. In this paper, we define attack level a as a metric, which reflects the threats that an organization confronts, in the same manner as the temperatre reflects the relative warmth and cold of a day and the Dow Jones Index reflects the healthiness of the stock market. Attack level may be evalated daily or monthly based on the information on hackers, worms, virs, and other attack incident. A similar idea is sed in the Homeland Secrity Advisory System ( On a daily basis of monitoring and analyzing threat information, the government may isse a threat level to reflect the crrent sitation (severe red; high orange; elevated yellow; garded ble; and low green). In defending against DoS, organizations may monitor the daily traffic, and regard the level of traffic as the attack level on systems. We define secrity level s as the ability of an organization to defend its IT systems from failre reslting from a secrity attack, sch as the capability that an organization has in defending the system again a DoS attack. The system s secrity level is converted from the organization s secrity investment i. By investing in IT secrity (training secrity staff; bying new technologies sch as an intrsion detection system, a firewall, etc.; timely installation of software patches; and increasing the system capacity), the organization improves its system secrity level. For simplicity in or discssion, we assme that the level of IT secrity investment is eqivalent with the secrity level system in or model. Schechter (2004) arged that when attacking a software system is only as difficlt as it is to obtain a vlnerability to exploit, the secrity strength of that system is eqivalent to the market price of sch vlnerability. He sggested that the strength of a system s secrity shold be qantified from the viewpoint of the attacker rather than the defender, and introdces an approach that secrity strength can be measred sing a market mechanism. In or paper, we se the difference between secrity level and the attack level, which is the term i-a, to measre the vlnerability of the system. We assme that both the investment level i and the attack level a are continos. The secrity stats of information systems is affected only by these two factors. We define a system srvival fnction (the probability fnction of system failre) (F) depending on the probability that i a < L, where L is a certain threshold of vlnerability; that is, F = probability of failre = prob. (i a < L) (1.1) where i is the investment level and a is the attack level. F increases when a increases, and decreases when i increases. When (i a) increases, F decreases. If we assme L = 0, the probability of system failre depends on the probability that i < a (i.e., the probability that investment level is less than eqal to attack level). a (attack level) is exogenos in the fnction F, while i (investment level) is endogenos. An organization follows a dynamic investment strategy, in which it makes investment decisions based on attack level a and the stats of the system F; that is, i = i( a, F) (1.2) 2005 Twenty-Sixth International Conference on Information Systems 349

5 Secrity and Assrance Table 1. Notations Two-Factor Secrity Model F System srvival fnction (the probability fnction of system failre) i Secrity investment level a System attack level Extreme Vale Theory X Random observations, x is one observation from X F Common cmlative distribtion fnction F of random observations M Block maxima, M = max{ X, X,... X }, and n is the nmber of observations. n n 1 2 H ( x) The limiting distribtion of exetrma µ, σ, α Distribtion Parameters of Frechet, Weibll, Gmbel, as well as Generalized Extreme Vale distribtion (GEV) ξ Shape Parameter of GEV Retrn Level x p xˆ Estimated Retrn Level p 1/p Retrn Period, p is a probability High threshold Y Y = X > 0, y is an observation from Y G Generalized Pareto Distribtion (GPD) ξ, σ, ψ Distribtion Parameters of GPD The maximm level in time period t Z t n In the example of defending against DoS, the system stats depends on the system capacity and the daily traffic experienced by the system. The probability of system failre is determined by the probability that the system capacity is less than the daily traffic. Based on the observed daily traffic, the organization determines proper secrity soltions. One of the key reqirements for sch a dynamic investment strategy is to accrately captre and model the dynamic behavior of attacks. With or two-factor secrity model, it is important for s to know the behavior of extreme attacks for an effective investment. To defend against DoS, we need to nderstand the behavior of high-level traffic so that we can make inferences on ftre attacks and design proper defense soltions to prevent the system failre cased by extremely heavy traffic. In the following section, we introdce extreme vale theory, which we se to characterize the stochastic behavior of high-level attacks and to identify the factors (inclding time) that may inflence high-level attacks. Table 1 lists the notations we se in the analysis. Extreme Vale Analysis Classic Extreme Vale Theory The principal reslts of extreme vale theory concern the limiting distribtion of sample extrema (maxima or minima). Since in or model the probability of system failre depends on the probability of the exceedance of attack over investment and we are concerned with the behavior of extreme large attacks, sch as the distribtion of high-level traffic, we will only discss sample maxima here. Sppose that X 1, X 2, X n is a seqence of independent, identically distribted observations, sch as n-day daily traffic in DoS, with a common cmlative distribtion fnction F, which is not necessarily known. Let the sample maximm be denoted by M n = max {X 1, X 2, X n } (M n is also referred as block maxima). We are interested in the stochastic behavior of M n. We know Pr{ M x} = F( x) n n (1.3) Twenty-Sixth International Conference on Information Systems

6 Wang et al./it Secrity Investment Reslt (1.3) is of no immediate interest, since it simply says that for any fixed x for which F(x) < 1, we have Pr{ M x} 0 as n goes to infinity. For nontrivial limit reslts we mst renormalize: find a n > 0, b n sch that n Mn b n Pr x = Fax ( n + bn) Hx ( ) an (1.4) where H(x) is the limiting distribtion of F(a n x + b n ). The fndamental theorem of the extreme vale theorem provides three possible distribtions for H(x) as follow: Theorem 1 (Fisher and Tippett 1928): The only three types of non-degenerate distribtions H(x) satisfying Eqation (1.4) are α x µ σ Frechet: H( x) = e if x µ (1.5) 0 otherwise 1 if x µ α Weibll: H( x) = µ x (1.6) σ e otherwise x µ σ e Gmbel: H() x = e x and σ > 0 (1.7) The three extreme-vale distribtions, normalized to mean and nit variance, are shown in Figre 1 (" = 3.9 for Frechet, and " = -2 for Weibll). The stars indicate the 99 th percentile of the distribtions respectively. Frechet: This is the long-tailed case. The nderlying attack-level distribtion H(x) for Frechet distribtion has a fat tail (e.g., 1 H(x) declines as x -" ). The attack level confronted by organizations has great pside ncertainty. Gmbel: This is the medim-tailed case for which 1 H(x) decreases exponentially for large x. For this type of attack distribtion, there are no specific limits on the attack level, bt the attack level is not likely to be too high or too low. Most attack levels are distribted in a central range. Weibll: This is the short-tailed case in which the distribtion has a finite endpoint. Organizations face predictably finite attack levels. Figre 1. Densities for the Three Extreme Vale Distribtions (: = 0, F² = 1) 2005 Twenty-Sixth International Conference on Information Systems 351

7 Secrity and Assrance There are several reasons why there may be different probability distribtions for the high-level attack. First, it may be de to the natre of digital assets: the perceived vale of digital assets and their criticalness to the pblic and organizations. Terrorism or engineered attacks are more attracted to high-valed digital assets, or the digital assets that can case high-level damage to the pblic and/or organizations. Second, different attack types may have different distribtions. For example, a violation that is initiated from a finite nmber of internal sers in an organization is likely to differ from threats from virses or worms, which can originate anywhere in the world. Third, the exposre range of the digital assets may also reslt in different distribtions of the attack level. The digital assets connected with the Internet are more likely to come nder high-level attack, while application systems having limited access in an isolated environment are less likely to be exposed to same level attack. Forth, de to negative externality of attack (Camp and Wolfram 2004), the size of the organization and its network becomes a factor. A larger organization is more likely to sffer an attack than a smaller one. However, empirical exploration of these hypotheses is needed. The three types may be combined into a single generalized extreme vale (GEV) distribtion (Coles 2001a, p. 48). x µ H ( x) = exp 1+ ξ σ 1/ ξ (1.8) where x µ x :1 ξ + > 0, : is a location parameter, F > 0is a scale parameter and > is a shape parameter. The limit σ 1 ξ 0 corresponding to the Gmbel distribtion, ξ > 0 to the Frechet distribtion with α =, ξ < 0 to the Weibll 1 distribtion with α =. By inversing the eqation (1.8), we obtain ξ ξ x p ξ { [ p ] } σ µ 1 log(1 ), for ξ 0 = ξ µ σ log{ log(1 p) }, for ξ = 0 where G(x p ) = 1 p. In common terminology, x p is the retrn level associated with the retrn period 1/p, since, to a reasonable degree of accracy, the level x p is expected to be once every 1/p periods. In other word, x p is exceeded by the period maximm in any particlar period with probability p. Exceedances over Thresholds Extremes are scarce, so model estimations of block maxima have a large variance (Coles 2001a, p. 66). Modeling block maxima is a wastefl approach to extreme vale analysis especially if one block happens to contain more extreme observations than another. If an entire time series of, say, horly or daily observations are available, the data may be better sed by avoiding the procedre of blocking. Exceedances over thresholds provide a alternative way to model extreme vale by characterizing an observation as extreme if it exceeds a high threshold. Theorem 2 (Coles 2001a, p. 75; Smith 2003): Consider the distribtion of X conditionally on exceeding some high threshold, and let Y = X, and Y > 0. We know F ( y) = Pr{ Y y Y > 0} = F ( + y) F ( ) 1 F ( ) As ω = sp{ x: F( x) < 1}, we fond a limit distribtion, F Twenty-Sixth International Conference on Information Systems

8 Wang et al./it Secrity Investment F ( y) G( y; σ, ξ ) where G is generalized Pareto distribtion (GPD) y G( y; σ, ξ ) = 1 1+ ξ σ 1/ ξ (1.9) defined on {y:y >0 and (1 + >y/f) > 0} The rigoros connection between exceedances over thresholds and the classic extreme vale theory was established by Pickands (1975). Similar with GEV, GPD has three cases depending on the vale of the parameter >: The case > > 0 is the long-tailed case, for which 1 G(x) decays at the same rate as x -1/> for large x. This is reminiscent of 1/ ξ the sal Pareto distribtion, Gx ( ) = 1 cx. For > = 0, we have the exponential distribtion with mean F as the limit y G( y; σ,0) = 1 exp σ σ ξ For > < 0, the distribtion has finite pper endpoint at. Replacing Y = X into (1.9), now we have x Pr{ X > x X > } = 1+ ξ σ 1/ ξ (1.10) It follows that x Pr{ X > x} = ς 1+ ξ σ 1/ ξ (1.11) where ς = Pr{ X > }. By inversing the eqation (1.11), we obtain x p ξ σ ς + 1, for ξ 0 ξ p = ς + σ log, for ξ = 0 p (1.12) x p is the (1/p)-observation retrn level. In other word, the level x p is expected to be once every 1/p observations to a reasonable degree of accracy, or the probability of an observation to exceed x p is p. Sppose that we have one observation for each day. Then a 365-observation retrn level is the same as a 1-year (or 365-day) retrn level, which is the level expected to be exceeded once every 365 observations (or in a year). Factor Analysis In the above discssion, we do not consider that high-level attacks may systemically change throgh time, or be inflenced by the changes of other environmental factors. In the context of DoS, the network traffic or server load may increase over time, 2005 Twenty-Sixth International Conference on Information Systems 353

9 Secrity and Assrance becase the Internet is expanding and the e-bsiness is matring. The organization s internal traffic may be affected significantly by the nmber of employees and the nmber of enterprise applications. The activities of worms, virses, or hackers may vary seasonally. In the following discssion, we introdce the models that captre these changes and inflences. Let GEV(:, F, >) denote the GEV distribtion with parameters :, F, and >. Let Z t denote the maximm attack level in time period t. To examine whether the maximm attack level changes linearly over the observation periods, a sitable model for Z t is (Coles 2001a, p. 107) where for coefficients $ 0 and $ 1. Z ~ GEV( µ ( t), σ, ξ ) t µ () t = β + β t 0 1 To identify other factors that might have significant impact on the maximm attack levels, the model can be extended into a general form µ = β0 β βn 1 ( t) [1, z1( t),..., zn ( t)]... where z i (t) are the factors to be examined (e.g., the nmber of employees and the nmber of enterprise applications in different time periods). The seasonal model with k seasons s 1, s 2,, s n takes the form where I j (t) is the dmmy variable having µ = β1 β βk 2 ( t) [ I1( t), I2( t),..., Ik ( t)]... 1, if s( t) = s j I j ( t) =, j = 1,..., k 0, otherwise Using these regression models, we are able to identify whether high-level attacks are changing over time, and/or whether there is any seasonal effect. We also can identify factors that may inflence the maximm attack level. Following the same logic, we can also test the factors that might have an impact on the parameters " and >. The information helps s nderstand the trend of attacks and ths make strategic investment in IT secrity more effectively with the change of environment. An Empirical Analysis Malicios traffic from self-propagating worms and denial of service attacks constantly threatens everyday operation of an organization s Internet systems. Defending networks from these threats demands appropriate tools to condct comprehensive Twenty-Sixth International Conference on Information Systems

10 Wang et al./it Secrity Investment vlnerability assessments of networked systems (Sommers et al. 2004). The high-level traffic above a certain threshold is perceived as a signal of attack to IT systems. High-level traffic cases network otage and denial of service. In this section, we analyze daily internal traffic collected from a large regional bank sitated in New York state. With 1 year as the retrn period, we estimate the retrn level of traffic. The retrn level of traffic provides valable information, enabling s to design proper defense strategies and adjst the investment level to prevent network otage and denial of service. We record the internal traffic from Janary 16, 2004, to March 20, 2005, daily (see Figre 2). The traffic is comprised by a nmber of activities, inclding employee login/logot, file/printer access, or any other activity done at network level inter-server commnication (most of which happens atomatically or is schedled) application access information (only some applications are monitored) Since a series of daily data is available, exceedances over thresholds is employed in or extreme vale analysis. We se the maximm-likelihood method to estimate the distribtion parameters of generalized Pareto distribtion (GPD) with the S-PLUS fnctions obtained from the website (Coles 2001b). To se exceedances over thresholds, a proper threshold mst be selected. The mean residal life plot (Coles 2001a, p. 78) is a diagnostic plot drawn before fitting any model and gives gidance abot what threshold to se. Figre 3 shows the mean residal life plot with approximate 95 percent confidence intervals for the daily traffic. The plot is initially linear, bt shows sbstantial crvatre in the range of < < For > , the plot is reasonably linear when jdged relative to confidence intervals, sggesting we set = (We also did a sensitivity analysis with = , the reslts do not have mch difference.) The choice leads to 149 exceedences in the series of length Ths ς =149/430=0.347 with var( ˆ ) = The maximm likelihood estimators of GPD parameters are ˆ ς ( ˆ σ, ˆ ξ ) = ( , 0.09), with standard error and 0.09 respectively. The 95 percent confidence interval for > is [-0.09, 0.26] (Figre 4). Therefore, the maximm likelihood estimate corresponds to an nbonded distribtion, althogh the evidence is not overwhelming and 0 lies inside the 95 percent confidence interval. Diagnostic plots for the fitted GPD are shown in Figre 5. Both the set of the probability plot and of the qantile plot are near linear, showing the validity of the fitted model. The retrn level crve asymptotes to an infinite level. The corresponding density estimates are roghly consistent with the histogram of the data, bt not perfect. Traffic 4,000,000 3,500,000 3,000,000 2,500,000 2,000,000 1,500,000 1,000, , /16/04 2/16/04 3/16/04 4/16/04 5/16/04 6/16/04 7/16/04 8/16/04 9/16/04 10/16/04 11/16/04 12/16/04 1/16/05 2/16/05 3/16/05 Event Date Figre 2. Daily Traffic from Janary 16, 2004, to March 20, Twenty-Sixth International Conference on Information Systems 355

11 Secrity and Assrance Mean Excess Figre 3. Mean Residal Life Plot for Daily Traffic Profile Log-likelihood Shape Parameter Figre 4. Profile Likelihood for Shape Parameter > in Threshold Excess Model of Daily Traffic Twenty-Sixth International Conference on Information Systems

12 Wang et al./it Secrity Investment Probability Plot Qantile Plot Model Empirical Empirical Retrn Level Plot Model Density Plot Retrn level f(x) Retrn period (years) x Figre 5. Model Diagnostic Plots for Threshold Excess Model Fitted to Daily Traffic Pattern Profile Log-likelihood *10^6 2.5*10^6 3*10^6 3.5*10^6 4*10^6 4.5*10^6 5*10^6 Retrn Level Figre 6. Profile Likelihood for 1-Year Retrn in Level in the Threshold Excess Model 2005 Twenty-Sixth International Conference on Information Systems 357

13 Secrity and Assrance The GPD model provides a direct method for risk estimation sing retrn level. In or analysis, we se 1 year as or retrn period. Since we have one observation for each day, the 1-year retrn level corresponds to the 365-observation retrn level with 6 p = 1/365. As ˆ ξ > 0, we se the first part of eqation (1.12) to calclate the retrn level and have x ˆ p = Figre 6 plots the profile log-likelihood for the 1-year retrn level. The 95 percent confidence interval is [ , ]. The retrn level of traffic shows the level of investment we shold match for the next year sch that the exceeded probability of traffic 6 at x ˆ = in next year is less than 1/365 with 95% confidence. p In or model, we have (i - a) as a measre of vlnerability, where i is the investment factor and a is the attack factor. In the data analysis, a is the packet traffic rate, while i is the capacity rate in packets per second that the system can handle. Estimated retrn level of traffic x in the data analysis provides an extremal vale estimate of packet traffic rate to which the system is sbject, ˆ p which in trn gives the vale of attack factor a. Taking this vale as the system capacity i, and assming that the secrity system is a simple serial system of three elements connection to the Internet, firewall/roter, and the server we can then specify the bandwidth of the pipe that is connecting to the firewall, the firewall/roter s filtration capacity, and the capacity of the server operating system to handle that TCP/IP traffic, all in terms of packets per nit of time. Given these capacities, we can estimate what the cost of sch a secrity system is likely to be, and decide whether to increase or decrease investment by comparing with crrent configrations. We may also introdce intrsion detection systems (IDS) or reconfigre the existing IDS to properly protect the system. Conclsion In this paper, we introdce an extreme vale approach for secrity investment. Compared with other methods on determining the effective level of secrity investment, or model does not need to calclate the expected loss de to system failre, nor make assmptions relating to hackers behavior. It is a dynamic strategy for secrity investment. With extreme vale analysis, the distribtion of high-level attacks is estimated. We may then determine the retrn level of attacks for a certain retrn period. The retrn level of attacks provides important information for s to design a proper defense capability and make an investment decision. Using the daily traffic data collected from a large regional bank, we examine the distribtion of high-level traffic. Using one year as the retrn period, we estimate the retrn level of traffic. The methodology provides many avenes of research in the ftre. First of all, sing the extreme vale approach, we can examine whether there is any difference in the distribtion of highlevel attacks from different types of attacks, sch as denial of service, malicios code, etc, as well as from different initiators, sch as internal employees, hackers, or competitors. Second, the time-effect on the attack level can be examined empirically. With the extreme vale approach, we can answer whether the maximm attack level is changing over time, and whether there is any seasonal effect. Frther we can identify factors that inflence the maximm attack level. This information will help to make strategic investment in IT secrity more effective. A similar analysis can also be done for spam where we can estimate the capacity of the system to handle the srge in traffic de to spams. There too, we will get a system size in terms of packet handling capacity, which in trn will sggest some dollars as investment. In ftre research, we propose to show how or methodology can help size a secrity system in terms of packet handling capacity systematically and thereby help estimate the dollar investment that may be reqired. There are certain limitations of or paper. First, we only focs on the discssion sing extreme vale theory to characterize the behavior of attacks. We do not look at how to operationally decide a corresponding secrity investment level, nor do we convert it into a real protection level for a system throgh the combination of varios technology and secrity policy. This is an interesting topic that needs frther exploration. Second, in extreme vale analysis we view the system attack as an exogenos variable. The casal isses of the attack are not explored. Third, extreme vale analysis, being a statistical approach based on past data has limited application where the secrity scenario is evolving sch that past data are no longer a reliable indicator of what ftre sitations may entail. Acknowledgements The athors wold like to thank the track chair, the associate editor, and the two referees for their comments, which have greatly improved the paper. This research has been fnded in part by NSF nder grant # The sal disclaimer applies Twenty-Sixth International Conference on Information Systems

14 Wang et al./it Secrity Investment References Camp, L. J., and Wolfram, C. Pricing Secrity, in Economics of Information Secrity, L. J. Camp and S. Lewis (Ed.), Klwer Academic Pblishers, Boston, 2004, pp Castillo, E. Extreme Vale Theory in Engineering, Academic Press, San Diego, Cavsogl, H. Economics of IT Secrity Management, in Economics of Information Secrity, L. J. Camp and S. Lewis (Ed.), Klwer Academic Pblishers, Boston, 2004, pp Cavsogl, H., Mishra, B., and Raghnathan, S. A Model For Evalating IT Secrity Investments, Commnications of the ACM (47:7), 2004, pp Coles, S. An Introdction to Statistical Modeling of Extreme Vales, Springer-Verlag, London, 2001a. Coles, S. How to Use the S-PLUS Fnctions and Datasets, Jne 2001b (available online at ~masgc/ismev/smmary.html). Dahan, E., and Mendelson, H. An Extreme-Vale Model of Concept Testing, Management Science (47:1), 2001, pp Embrechts, P., Klppelberg, C., and Mikosch, T. Modeling Extremal Events for Insrance and Finance, Springer, New York, Ernst & Yong. Global Information Secrity Srvey 2003, Ernst & Yong LLP, 2003 (available online at Ernst & Yong. Global Information Secrity Srvey 2004, Ernst & Yong LLP, 2004 (available online at Farahmand, F., Navathe, S. B., Sharp, G. P., and Enslow, P. H. A Management Perspective on Risk of Secrity Threats to Information Systems, Information Technology and Management (6:2-3), 2005, pp Fisher, R. A., and Tippett, L. H. C. Limiting Forms of The Freqency Distribtions of The Largest or Smallest Member of a Sample, in Proceedings of the Cambridge Philosophical Society (24), Cambridge University Press, London, 1928, pp Geer, D., Hoo, K. S., and Jaqith, A. Information Secrity: Why the Ftre Belongs to the Qants, IEEE Secrity & Privacy (1:4), Jly/Agst 2003, pp Gordon, L. A., and Loeb, M. P. The Economics of Information Secrity Investment, ACM Transactions on Information and Systems Secrity (5:4), 2002, pp Gordon, L. A., Loeb, M. P., Lcyshyn, W., and Richardson, R CSI/FBI Compter Crime and Secrity Srvey, Compter Secrity Institte, 2005 (available online at Gmbel, E. J. Statistics of Extremes, Colmbia University, New York, Hoo, K. J. S. How Mch is Enogh? A Risk-Management Approach to Compter Secrity, CISAC Working Paper, Stanford University, Agst 2000 (available online at Longstaff, T. A., Chittister, C., Pethia, R., and Haimes, Y. Y. Are We Forgetting the Risks of Information Technology? IEEE Compter (33:12), 2000, pp Mercri, R. T. Analyzing Secrity Costs, Commnications of the ACM (46:6), 2003, pp Pickands, J. Statistical Inference Using Extreme Order Statistics, Annals of Statistics (3), 1975, pp Schechter, S. E. Compter Secrity Strength and Risk: A Qantitative Approach, npblished Ph.D. dissertation, Harvard University, Schechter, S. E., and Smith, M. D. How Mch Secrity is Enogh to Stop a Thief? The Economics of Otsider Theft via Compter Systems Networks, in Proceedings of the 7 th Financial Cryptography Conferences, R. N. Wright (Ed.), Gadelope, French West Indies, Janary 27-30, Smith, R. L. Statistics of Extremes, with Applications in Environment, Insrance, and Finance, npblished manscript, Department of Statistics, University of North Carolina, Sommers, J., Yegneswaran, V., and Barford, P. A Framework for Malicios Workload Generation, in Proceedings of the 4 th ACM SIG COMM Conference on Internet Measrement, J. Krose (Ed.), Taormina, Sicily, Italy, 2004, pp Twenty-Sixth International Conference on Information Systems 359

Evaluating Influence Diagrams

Evaluating Influence Diagrams Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will

More information

Networks An introduction to microcomputer networking concepts

Networks An introduction to microcomputer networking concepts Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES

More information

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz

More information

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali

More information

TAKING THE PULSE OF ICT IN HEALTHCARE

TAKING THE PULSE OF ICT IN HEALTHCARE ICT TODAY THE OFFICIAL TRADE JOURNAL OF BICSI Janary/Febrary 2016 Volme 37, Nmber 1 TAKING THE PULSE OF ICT IN HEALTHCARE + PLUS + High-Power PoE + Using HDBaseT in AV Design for Schools + Focs on Wireless

More information

Multi-lingual Multi-media Information Retrieval System

Multi-lingual Multi-media Information Retrieval System Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,

More information

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands

More information

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing 1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity

More information

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the ICC 27 proceedings. The Impact of Avatar Mobility on Distribted Server Assignment

More information

An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast

An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna

More information

Maximum Weight Independent Sets in an Infinite Plane

Maximum Weight Independent Sets in an Infinite Plane Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking

More information

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining

More information

A sufficient condition for spiral cone beam long object imaging via backprojection

A sufficient condition for spiral cone beam long object imaging via backprojection A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral

More information

Preparing better graphs

Preparing better graphs Review Article Page 1 of 11 Preparing better graphs Lara King Medical Writing and Editing Program, The Graham School at the University of Chicago, Chicago, Illinois, USA Correspondence to: Lara King, MA,

More information

Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003

Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information

More information

Topic Continuity for Web Document Categorization and Ranking

Topic Continuity for Web Document Categorization and Ranking Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:

More information

A choice relation framework for supporting category-partition test case generation

A choice relation framework for supporting category-partition test case generation Title A choice relation framework for spporting category-partition test case generation Athor(s) Chen, TY; Poon, PL; Tse, TH Citation Ieee Transactions On Software Engineering, 2003, v. 29 n. 7, p. 577-593

More information

Optimal Sampling in Compressed Sensing

Optimal Sampling in Compressed Sensing Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In

More information

Millimeter-Wave Multi-Hop Wireless Backhauling for 5G Cellular Networks

Millimeter-Wave Multi-Hop Wireless Backhauling for 5G Cellular Networks 2017 IEEE 85th Vehiclar Technology Conference (VTC-Spring) Millimeter-Wave Mlti-Hop Wireless Backhaling for 5G Celllar Networks B. P. S. Sahoo, Chn-Han Yao, and Hng-Y Wei Gradate Institte of Electrical

More information

Towards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions

Towards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions Towards Understanding Bilevel Mlti-objective Optimization with Deterministic Lower Level Decisions Ankr Sinha Ankr.Sinha@aalto.fi Department of Information and Service Economy, Aalto University School

More information

5 Performance Evaluation

5 Performance Evaluation 5 Performance Evalation his chapter evalates the performance of the compared to the MIP, and FMIP individal performances. We stdy the packet loss and the latency to restore the downstream and pstream of

More information

Efficient and Accurate Delaunay Triangulation Protocols under Churn

Efficient and Accurate Delaunay Triangulation Protocols under Churn Efficient and Accrate Delanay Trianglation Protocols nder Chrn Dong-Yong Lee and Simon S. Lam Department of Compter Sciences The University of Texas at Astin {dylee, lam}@cs.texas.ed November 9, 2007 Technical

More information

Tdb: A Source-level Debugger for Dynamically Translated Programs

Tdb: A Source-level Debugger for Dynamically Translated Programs Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,

More information

Computer-Aided Mechanical Design Using Configuration Spaces

Computer-Aided Mechanical Design Using Configuration Spaces Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)

More information

Blended Deformable Models

Blended Deformable Models Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University

More information

A GENERIC MODEL OF A BASE-ISOLATED BUILDING

A GENERIC MODEL OF A BASE-ISOLATED BUILDING Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes

More information

COMPOSITION OF STABLE SET POLYHEDRA

COMPOSITION OF STABLE SET POLYHEDRA COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining

More information

Distributed Systems Security. Authentication Practice - 2. Prof. Steve Wilbur

Distributed Systems Security. Authentication Practice - 2. Prof. Steve Wilbur Distribted Systems Secrity Athentication Practice - 2 Prof. Steve Wilbr s.wilbr@cs.cl.ac.k MSc in Data Commnications Networks and Distribted Systems, UCL Lectre Objectives Examine X.509 as a practical

More information

Date: December 5, 1999 Dist'n: T1E1.4

Date: December 5, 1999 Dist'n: T1E1.4 12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:

More information

TRUSTED WIRELESS HEALTH A New Approach to Medical Grade Wireless

TRUSTED WIRELESS HEALTH A New Approach to Medical Grade Wireless By Mitchell Ross TRUSTED WIRELESS HEALTH A New Approach to Medical Grade Wireless Several crrent trends give case to rethink the design of wireless systems in medical bildings. Increasingly, patients are

More information

Lecture 4: Routing. CSE 222A: Computer Communication Networks Alex C. Snoeren. Thanks: Amin Vahdat

Lecture 4: Routing. CSE 222A: Computer Communication Networks Alex C. Snoeren. Thanks: Amin Vahdat Lectre 4: Roting CSE 222A: Compter Commnication Networks Alex C. Snoeren Thanks: Amin Vahdat Lectre 4 Overview Pop qiz Paxon 95 discssion Brief intro to overlay and active networking 2 End-to-End Roting

More information

CYBER INSURANCE: A DEEP DIVE

CYBER INSURANCE: A DEEP DIVE CYBER INSURANCE: A DEEP DIVE Jdy Selby Febrary 24, 2017 BDO USA, LLP, a Delaware limited liability partnership, is the U.S. member of BDO International Limited, a UK company limited by garantee, and forms

More information

MultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny

MultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny MltiView: Improving Trst in Grop Video Conferencing Throgh Spatial Faithflness David T. Ngyen, John F. Canny CHI 2007, April 28 May 3, 2007, San Jose, California, USA Presented by: Stefan Stojanoski 1529445

More information

Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications

Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the IEEE INFOCOM 007 proceedings Pipelined van Emde Boas Tree: Algorithms, Analysis,

More information

AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING

AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING Mingsheng LIAO, Li ZHANG, Zxn ZHANG, Jiangqing ZHANG Whan Technical University of Srveying and Mapping, Natinal Lab. for Information Eng. in

More information

Appearance Based Tracking with Background Subtraction

Appearance Based Tracking with Background Subtraction The 8th International Conference on Compter Science & Edcation (ICCSE 213) April 26-28, 213. Colombo, Sri Lanka SD1.4 Appearance Based Tracking with Backgrond Sbtraction Dileepa Joseph Jayamanne Electronic

More information

EMC VNX Series. Problem Resolution Roadmap for VNX with ESRS for VNX and Connect Home. Version VNX1, VNX2 P/N REV. 03

EMC VNX Series. Problem Resolution Roadmap for VNX with ESRS for VNX and Connect Home. Version VNX1, VNX2 P/N REV. 03 EMC VNX Series Version VNX1, VNX2 Problem Resoltion Roadmap for VNX with ESRS for VNX and Connect Home P/N 300-014-335 REV. 03 Copyright 2012-2014 EMC Corporation. All rights reserved. Pblished in USA.

More information

Use of Extreme Value Statistics in Modeling Biometric Systems

Use of Extreme Value Statistics in Modeling Biometric Systems Use of Extreme Value Statistics in Modeling Biometric Systems Similarity Scores Two types of matching: Genuine sample Imposter sample Matching scores Enrolled sample 0.95 0.32 Probability Density Decision

More information

Computer User s Guide 4.0

Computer User s Guide 4.0 Compter User s Gide 4.0 2001 Glenn A. Miller, All rights reserved 2 The SASSI Compter User s Gide 4.0 Table of Contents Chapter 1 Introdction...3 Chapter 2 Installation and Start Up...5 System Reqirements

More information

Availability Analysis of Application Servers Using Software Rejuvenation and Virtualization

Availability Analysis of Application Servers Using Software Rejuvenation and Virtualization Thein T, Park J S. Availability analysis of application servers sing software rejvenation and virtalization. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 24(2): 339 346 Mar. 2009 Availability Analysis of

More information

Requirements Engineering. Objectives. System requirements. Types of requirements. FAQS about requirements. Requirements problems

Requirements Engineering. Objectives. System requirements. Types of requirements. FAQS about requirements. Requirements problems Reqirements Engineering Objectives An introdction to reqirements Gerald Kotonya and Ian Sommerville To introdce the notion of system reqirements and the reqirements process. To explain how reqirements

More information

THE Unit Commitment problem (UCP) is the problem of

THE Unit Commitment problem (UCP) is the problem of IEEE TRANS IN POWER SYSTEMS 1 A new MILP-based approach for Unit Commitment in power prodction planning. Ana Viana and João Pedro Pedroso Abstract This paper presents a novel, iterative optimisation algorithm

More information

What s New in AppSense Management Suite Version 7.0?

What s New in AppSense Management Suite Version 7.0? What s New in AMS V7.0 What s New in AppSense Management Site Version 7.0? AppSense Management Site Version 7.0 is the latest version of the AppSense prodct range and comprises three prodct components,

More information

POWER-OF-2 BOUNDARIES

POWER-OF-2 BOUNDARIES Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of

More information

Fault Tolerance in Hypercubes

Fault Tolerance in Hypercubes Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different

More information

PARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT

PARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies

More information

The Disciplined Flood Protocol in Sensor Networks

The Disciplined Flood Protocol in Sensor Networks The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab

More information

Master for Co-Simulation Using FMI

Master for Co-Simulation Using FMI Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany

More information

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,

More information

IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION

IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION ICAS 2 CONGRESS IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION Christophe Le Garrec, Marc Hmbert, Michel Lacabanne Aérospatiale Matra

More information

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition

More information

Uncertainty Determination for Dimensional Measurements with Computed Tomography

Uncertainty Determination for Dimensional Measurements with Computed Tomography Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association

More information

Combined cine- and tagged-mri for tracking landmarks on the tongue surface

Combined cine- and tagged-mri for tracking landmarks on the tongue surface INTERSPEECH 2015 Combined cine- and tagged-mri for tracking landmarks on the tonge srface Honghao Bao 1, Wenhan L 1, Kiyoshi Honda 2,*, Jiango Wei 1, Qiang Fang 3, Jianw Dang 2, 4 1 School of Compter Software,

More information

Ma Lesson 18 Section 1.7

Ma Lesson 18 Section 1.7 Ma 15200 Lesson 18 Section 1.7 I Representing an Ineqality There are 3 ways to represent an ineqality. (1) Using the ineqality symbol (sometime within set-bilder notation), (2) sing interval notation,

More information

StaCo: Stackelberg-based Coverage Approach in Robotic Swarms

StaCo: Stackelberg-based Coverage Approach in Robotic Swarms Maastricht University Department of Knowledge Engineering Technical Report No.:... : Stackelberg-based Coverage Approach in Robotic Swarms Kateřina Staňková, Bijan Ranjbar-Sahraei, Gerhard Weiss, Karl

More information

Real-time mean-shift based tracker for thermal vision systems

Real-time mean-shift based tracker for thermal vision systems 9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University

More information

Minimal Edge Addition for Network Controllability

Minimal Edge Addition for Network Controllability This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,

More information

Congestion-adaptive Data Collection with Accuracy Guarantee in Cyber-Physical Systems

Congestion-adaptive Data Collection with Accuracy Guarantee in Cyber-Physical Systems Congestion-adaptive Data Collection with Accracy Garantee in Cyber-Physical Systems Nematollah Iri, Lei Y, Haiying Shen, Gregori Calfield Department of Electrical and Compter Engineering, Clemson University,

More information

FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES

FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion

More information

EMC ViPR. User Guide. Version

EMC ViPR. User Guide. Version EMC ViPR Version 1.1.0 User Gide 302-000-481 01 Copyright 2013-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished Febrary, 2014 EMC believes the information in this pblication is accrate

More information

On Plane Constrained Bounded-Degree Spanners

On Plane Constrained Bounded-Degree Spanners Algorithmica manscript No. (ill be inserted by the editor) 1 On Plane Constrained Bonded-Degree Spanners 2 3 Prosenjit Bose Rolf Fagerberg André an Renssen Sander Verdonschot 4 5 Receied: date / Accepted:

More information

Putting the dynamic into software security testing

Putting the dynamic into software security testing Ptting the dynamic into software secrity testing Detecting and Addressing Cybersecrity Isses V1.1 2018-03-05 Code ahead! 2 Atomated vlnerability detection and triage + = 3 How did we get here? Vector was

More information

Image Denoising Algorithms

Image Denoising Algorithms Image Denoising Algorithms Xiang Hao School of Compting, University of Utah, USA, hao@cs.tah.ed Abstract. This is a report of an assignment of the class Mathematics of Imaging. In this assignment, we first

More information

Continuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function

Continuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function J Electr Eng Technol Vol., No.?: 74-?, 5 http://dx.doi.org/.537/jeet.5..?.74 ISSN(Print) 975- ISSN(Online) 93-743 Continity Smooth Path Planning Using Cbic Polomial Interpolation with Membership Fnction

More information

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX

More information

Spam detection system: a new approach based on interval type-2 fuzzy sets

Spam detection system: a new approach based on interval type-2 fuzzy sets Ryerson University Digital Commons @ Ryerson Theses and dissertations 1-1-2010 Spam detection system: a new approach based on interval type-2 fzzy sets Reza Ariaeinejad Ryerson University Follow this and

More information

Computing the weights of criteria with interval-valued fuzzy sets for MCDM problems Chen-Tung Chen 1, Kuan-Hung Lin 2, Hui-Ling Cheng 3

Computing the weights of criteria with interval-valued fuzzy sets for MCDM problems Chen-Tung Chen 1, Kuan-Hung Lin 2, Hui-Ling Cheng 3 Compting the weights of criteria with interval-valed fzzy sets for MCDM problems Chen-ng Chen Kan-Hng in 2 Hi-ing Cheng 3 Department of Information Management National nited niversity aiwan 2 Specialist

More information

Stereo Matching and 3D Visualization for Gamma-Ray Cargo Inspection

Stereo Matching and 3D Visualization for Gamma-Ray Cargo Inspection Stereo Matching and 3D Visalization for Gamma-Ray Cargo Inspection Zhigang Zh *ab, Y-Chi H bc a Department of Compter Science, The City College of New York, New York, NY 3 b Department of Compter Science,

More information

Discretized Approximations for POMDP with Average Cost

Discretized Approximations for POMDP with Average Cost Discretized Approximations for POMDP with Average Cost Hizhen Y Lab for Information and Decisions EECS Dept., MIT Cambridge, MA 0239 Dimitri P. Bertsekas Lab for Information and Decisions EECS Dept., MIT

More information

Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN:

Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: 1137-3601 revista@aepia.org Asociación Española para la Inteligencia Artificial España Zaballos, Lis J.; Henning, Gabriela

More information

Method to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot

Method to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot Method to bild an initial adaptive Nero-Fzzy controller for joints control of a legged robot J-C Habmremyi, P. ool and Y. Badoin Royal Military Academy-Free University of Brssels 08 Hobbema str, box:mrm,

More information

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks Open Access Library Jornal A Hybrid Weight-Based Clstering Algorithm for Wireless Sensor Networks Cheikh Sidy Mohamed Cisse, Cheikh Sarr * Faclty of Science and Technology, University of Thies, Thies,

More information

Understanding BGP Misconfiguration

Understanding BGP Misconfiguration Understanding BGP Misconfigration Ratl Mahajan David Wetherall Tom Anderson University of Washington Motivation BGP instabilities have widespread impact Misconfigrations can be a leading case of nreliability

More information

Cost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks

Cost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks Cost Based Local Forwarding Transmission Schemes for Two-hop Celllar Networks Zhenggang Zhao, Xming Fang, Yan Long, Xiaopeng H, Ye Zhao Key Lab of Information Coding & Transmission Sothwest Jiaotong University,

More information

Tu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization

Tu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)

More information

CS224W Final Report. 1 Introduction. 3 Data Collection and Visualization. 2 Prior Work. Cyprien de Lichy, Renke Pan, Zheng Wu.

CS224W Final Report. 1 Introduction. 3 Data Collection and Visualization. 2 Prior Work. Cyprien de Lichy, Renke Pan, Zheng Wu. CS224W Final Report Cyprien de Lichy, Renke Pan, Zheng W 1 Introdction December 9, 2015 Recommender systems are information filtering systems that provide sers with personalized sggestions for prodcts

More information

A personalized search using a semantic distance measure in a graph-based ranking model

A personalized search using a semantic distance measure in a graph-based ranking model Article A personalized search sing a semantic distance measre in a graph-based ranking model Jornal of Information Science XX (X) pp. 1-23 The Athor(s) 2011 Reprints and Permissions: sagepb.co.k/jornalspermissions.nav

More information

Picking and Curves Week 6

Picking and Curves Week 6 CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking

More information

A Wireless MAC Protocol comparison.

A Wireless MAC Protocol comparison. Doc: IEEE P82.1192S1 IEEE 82.11 Wireless Access Method and Physical Layer Specifications Title: Presented by: A Wireless MAC Protocol comparison. Wim Diepstraten NCR SEUtrecht NCRAT&T Network Prodct Grop

More information

NETWORKED CONTROL SYSTEM: THEORY AND SIMULATIONS. A Project by. Sandeep Bimali

NETWORKED CONTROL SYSTEM: THEORY AND SIMULATIONS. A Project by. Sandeep Bimali NETWORKED CONTROL SYSTEM: THEORY AND SIMULATIONS A Project by Sandeep Bimali Bacelor s Degree in Electronics Engineering, Tribvani University, Nepal December 21 Sbmitted to te Department of Electrical

More information

Constructing and Comparing User Mobility Profiles for Location-based Services

Constructing and Comparing User Mobility Profiles for Location-based Services Constrcting and Comparing User Mobility Profiles for Location-based Services Xihi Chen Interdisciplinary Centre for Secrity, Reliability and Trst, University of Lxemborg Jn Pang Compter Science and Commnications,

More information

Nash Convergence of Gradient Dynamics in General-Sum Games. Michael Kearns.

Nash Convergence of Gradient Dynamics in General-Sum Games. Michael Kearns. Convergence of Gradient Dynamics in General-Sm Games Satinder Singh AT&T Labs Florham Park, NJ 7932 bavejaresearch.att.com Michael Kearns AT&T Labs Florham Park, NJ 7932 mkearnsresearch.att.com Yishay

More information

Image Compression Compression Fundamentals

Image Compression Compression Fundamentals Compression Fndamentals Data compression refers to the process of redcing the amont of data reqired to represent given qantity of information. Note that data and information are not the same. Data refers

More information

EECS 487: Interactive Computer Graphics f

EECS 487: Interactive Computer Graphics f Interpolating Key Vales EECS 487: Interactive Compter Graphics f Keys Lectre 33: Keyframe interpolation and splines Cbic splines The key vales of each variable may occr at different frames The interpolation

More information

Risk Based Security. Automotive Safety & Security, 30. Mai 2017 Christof Ebert and Dominik Lieckfeldt, Vector Consulting Services V1.

Risk Based Security. Automotive Safety & Security, 30. Mai 2017 Christof Ebert and Dominik Lieckfeldt, Vector Consulting Services V1. Risk Based Secrity Atomotive Safety & Secrity, 30. Mai 2017 Christof Ebert and Dominik Lieckfeldt, Vector Conslting Services V1.0 2017-05-30 Agenda Motivation Risk-based approach to Cybersecrity Conslsion

More information

Extreme Value Theory in (Hourly) Precipitation

Extreme Value Theory in (Hourly) Precipitation Extreme Value Theory in (Hourly) Precipitation Uli Schneider Geophysical Statistics Project, NCAR GSP Miniseries at CSU November 17, 2003 Outline Project overview Extreme value theory 101 Applying extreme

More information

Resolving Linkage Anomalies in Extracted Software System Models

Resolving Linkage Anomalies in Extracted Software System Models Resolving Linkage Anomalies in Extracted Software System Models Jingwei W and Richard C. Holt School of Compter Science University of Waterloo Waterloo, Canada j25w, holt @plg.waterloo.ca Abstract Program

More information

CS 4204 Computer Graphics

CS 4204 Computer Graphics CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types

More information

Constrained Routing Between Non-Visible Vertices

Constrained Routing Between Non-Visible Vertices Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,

More information

Cohesive Subgraph Mining on Attributed Graph

Cohesive Subgraph Mining on Attributed Graph Cohesive Sbgraph Mining on Attribted Graph Fan Zhang, Ying Zhang, L Qin, Wenjie Zhang, Xemin Lin QCIS, University of Technology, Sydney, University of New Soth Wales fanzhang.cs@gmail.com, {Ying.Zhang,

More information

Compound Catadioptric Stereo Sensor for Omnidirectional Object Detection

Compound Catadioptric Stereo Sensor for Omnidirectional Object Detection Compond Catadioptric Stereo Sensor for mnidirectional bject Detection Ryske Sagawa Naoki Krita Tomio Echigo Yasshi Yagi The Institte of Scientific and Indstrial Research, saka University 8-1 Mihogaoka,

More information

CS 153 Design of Operating Systems Spring 18

CS 153 Design of Operating Systems Spring 18 CS 53 Design of Operating Systems Spring 8 Lectre 2: Virtal Memory Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Recap: cache Well-written programs exhibit

More information

An Introduction to GPU Computing. Aaron Coutino MFCF

An Introduction to GPU Computing. Aaron Coutino MFCF An Introdction to GPU Compting Aaron Cotino acotino@waterloo.ca MFCF What is a GPU? A GPU (Graphical Processing Unit) is a special type of processor that was designed to render and maniplate textres. They

More information

IP Multicast Fault Recovery in PIM over OSPF

IP Multicast Fault Recovery in PIM over OSPF 1 IP Mlticast Falt Recovery in PIM over OSPF Abstract Relatively little attention has been given to nderstanding the falt recovery characteristics and performance tning of native IP mlticast networks.

More information

Data/Metadata Data and Data Transformations

Data/Metadata Data and Data Transformations A Framework for Classifying Scientic Metadata Helena Galhardas, Eric Simon and Anthony Tomasic INRIA Domaine de Volcea - Rocqencort 7853 Le Chesnay France email: First-Name.Last-Name@inria.fr Abstract

More information

Dynamic Maintenance of Majority Information in Constant Time per Update? Gudmund S. Frandsen and Sven Skyum BRICS 1 Department of Computer Science, Un

Dynamic Maintenance of Majority Information in Constant Time per Update? Gudmund S. Frandsen and Sven Skyum BRICS 1 Department of Computer Science, Un Dynamic Maintenance of Majority Information in Constant Time per Update? Gdmnd S. Frandsen and Sven Skym BRICS 1 Department of Compter Science, University of arhs, Ny Mnkegade, DK-8000 arhs C, Denmark

More information

Addressing in Future Internet: Problems, Issues, and Approaches

Addressing in Future Internet: Problems, Issues, and Approaches Addressing in Ftre Internet: Problems, Isses, and Approaches Mltimedia and Mobile commnications Laboratory Seol National University Jaeyong Choi, Chlhyn Park, Hakyng Jng, Taekyong Kwon, Yanghee Choi 19

More information

arxiv: v3 [math.co] 7 Sep 2018

arxiv: v3 [math.co] 7 Sep 2018 Cts in matchings of 3-connected cbic graphs Kolja Knaer Petr Valicov arxiv:1712.06143v3 [math.co] 7 Sep 2018 September 10, 2018 Abstract We discss conjectres on Hamiltonicity in cbic graphs (Tait, Barnette,

More information

QoS-driven Runtime Adaptation of Service Oriented Architectures

QoS-driven Runtime Adaptation of Service Oriented Architectures Qo-driven Rntime Adaptation of ervice Oriented Architectres Valeria ardellini 1 Emiliano asalicchio 1 Vincenzo Grassi 1 Francesco Lo Presti 1 Raffaela Mirandola 2 1 Dipartimento di Informatica, istemi

More information

Estimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function

Estimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function Proceedings 999 IEEE Conf. on Compter Vision and Pattern Recognition, pp. 87-9 Estimating Model Parameters and Bondaries By Minimiing a Joint, Robst Objective Fnction Charles V. Stewart Kishore Bbna Amitha

More information