Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
|
|
- Miranda Thomas
- 5 years ago
- Views:
Transcription
1 Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES 2 Coputational Science Progra University of Texas at El Paso 500 W University El Paso, TX 79968, USA barivera@inersutepedu, irbisg@utepedu, vladik@utepedu Abstract The ain objective of vulnerability analysis is to select the alternative which is the least vulnerable To ake this selection, we ust describe the vulnerability of each alternative by a single nuber then we will select the alternative with the sallest value of this vulnerability index Usually, there are any aspects of vulnerability: vulnerability of a certain asset to a stor, to a terrorist attack, to hackers attack, etc For each aspect, we can usually gauge the corresponding vulnerability, the difficulty is how to cobine these partial vulnerabilities into a single weighted value In our previous research, we proposed an epirical idea of selecting the weights proportionally to the nuber of ties the corresponding aspect is entioned in the corresponding standards and requireents This idea was shown to lead to reasonable results In this paper, we provide a possible theoretical explanation for this epirically successful idea I FORMULATION OF THE PROBLEM Need for vulnerability analysis When it turns out that an iportant syste is vulnerable to a stor, to a terrorist attack, to hackers attack, etc we need to protect it Usually, there are any different ways to protect the sae syste It is therefore desirable to select the protection schee which guarantees the largest degree of protection within the given budget The corresponding analysis of different vulnerability aspects is known as it vulnerability analysis; see, eg, [2], [8], [11], [12], [13], [14] Vulnerability analysis: reinder Aong several possible alternative schees for protecting a syste, we ust select a one under which the syste will be the least vulnerable As we have entioned, there are any different aspects of vulnerability Usually, it is known how to gauge the vulnerability v i of each aspect i Thus, each alternative can be characterized by the corresponding vulnerability values (v 1,, v n ) Soe alternatives results in saller vulnerability of one of the assets, other alternatives leave this asset ore vulnerable but provide ore protection to other assets To be able to copare different alternatives, we need to characterize each alternative by a single vulnerability index v an index that would cobine the values v 1,, v n corresponding to different aspects: v f(v 1,, v n ) If one of the vulnerabilities v i increases, then the overall vulnerability index v ust also increase (or at least reain the sae, but not decrease) Thus, the cobination function f(v 1,, v n ) ust be increasing in each of its variables v i Vulnerability analysis: iportant challenge While there are well-developed ethods for gauging each aspect of vulnerability, there is no well-established way of cobining the resulting values v 1,, v n into a single criterion v f(v 1,, v n ) Usually, vulnerabilities v i are reasonably sall; so ters which are quadratic (or of higher order) in v i can be usually safely ignored As a result, we can expand the (unknown) function f(v 1,, v n ) in Taylor series in v i and keep only linear ters in this expansion As a result, we get a linear dependence v c 0 + c i v i for soe coefficients c i Coparison between different alternatives does not change if we subtract the sae constant c 0 fro all the cobined values: v < v if and only if v c 0 < v c 0 Thus, we can safely assue that v 0 0 and v c i v i Siilarly, coparison does not change if we re-scale all the values, eg, divide the by the sae constant c i This is equivalent to considering a new (re-scaled) cobined function c i v i f(v 1,, v n ) v i, c i v i where def c i c j j1 For these new weights, we have 1
2 The fact the function ust be increasing iplies that 0 The iportant challenge is how to copute the corresponding weights Heuristic solution In [4], [15], [17], we proposed an epirical idea of selecting the weights proportionally to the the frequency with which the corresponding aspect is entioned in the corresponding standards and requireents This idea was shown to lead to reasonable results Reaining proble and what we do in this paper A big proble is that the above approach is purely heuristic, it does not have a solid theoretical explanation In this paper, we provide a possible theoretical explanation for this epirically successful idea II POSSIBLE THEORETICAL EXPLANATION Main idea We consider the situation in which the only inforation about the iportance of different aspects is how frequently these aspects are entioned in the corresponding docuents In this case, the only inforation that we can use to copute the weight assigned to the i-th aspect is the frequency f i with which this aspect is entioned in the docuents In other words, we take F (f i ), where F (x) is an algorith which is used to copute the weight based on the frequency Our goal is to forulate reasonable requireents on the function F (x) and find all the functions F (x) which satisfy this requireent First requireent: onotonicity The ore frequently the aspect is entioned, the ore iportant it is; thus, if f i > f j, we ust have F (f i ) > F (f j ) In atheatical ters, this eans that the function ust be increasing Second requireent: the weights ust add up to one Another natural requireent is that for every cobination of frequencies f 1,, f n for which f i 1, the resulting weights ust add up to 1: F (f i ) 1 We are now ready to forulate our ain result Proposition 1 Let F : [0, 1] [0, 1] be an increasing function for which n f i 1 iplies n F (f i ) 1 Then, F (x) x Coent So, it is reasonable to use the frequencies as weights This justifies the above epirically successful heuristic idea Proof 1 Let us first prove that F (1) 1 This follows fro our ain requireent when n 1 and f 1 1 In this case, the requireent F (f i ) 1 leads to F (f 1 ) F (1) 1 2 Let us prove that F (0) 0 Let us consider n 2, f 1 0, and f 2 1 Then, f i 1 and therefore, F (f i ) F (0) + F (1) 1 Since we already know that F (1) 1, we thus conclude that F (0) 1 F (1) Let us prove that for every 2, we have F 1 Let us consider n and Then, and therefore, f 1 f n 1 f i 1 F (f i ) F We thus conclude that F Let us prove that for every k, we have ( ) k F k Let us consider n k + 1, f 1 k and f 2 f k+1 1
3 Then, and therefore, F (f i ) F We already know that f i 1 ( ) ( ) k 1 + ( k) F 1 F 1 Thus, we have ( ) k F 1 ( k) F 1 ( k) 1 k The stateent is proven 5 We have already proven that for every rational nuber r, we have F (r) r To coplete the proof, we need to show that F (x) x for every real nuber fro the interval [0, 1], not only for rational nubers Let x be any real nuber fro the interval (0, 1) Let x 0x 1 x 2 x n, x i {0, 1}, be its binary expansion Then, for every n, we have l n def 0x 1 x n x u n def l n + 2 n As n tends to infinity, we have l n x and u n x Due to onotonicity, we have F (l n ) F (x) F (u n ) Both bounds l n and u n are rational nubers, so we have F (l n ) l n and F (u n ) u n Thus, the above inequality takes the for l n F (x) u n In the liit n, when l n x and u n x, we get x F (x) x and thus, F (x) x The proposition is proven Possible fuzzy extension Our current analysis is aied at situations when we are absolutely sure which aspects are entioned in each stateent In practice, however, standards and docuents are written in natural language, and a natural language is often iprecise ( fuzzy ) As a result, in any case, we can only decide with soe degree of certainty whether a given phrase refers to this particular aspect A natural way to describe such degrees of certainty is by using fuzzy logic, technique specifically designed to capture iprecision of natural language; see, eg, [6], [10], [19] In this case, instead of the exact frequency f i which is defined as a ratio n i N between the nuber n i of entions of the i-th aspect and the total nuber N of all entions we can use the ratio µ i N, where µ i is a fuzzy cardinality of the (fuzzy) set of all entions of the i-th aspects which is usually defined as the su of ebership degrees ( degrees of certainty) for all the words fro the docuents III TOWARDS A MORE GENERAL APPROACH What we did: reinder In the previous section, we proved that if we select the i-th weight depending only only on the i-th frequency, then the only reasonable selection is F (x) x A ore general approach Alternatively, we can copute a pre-weight F (f i ) based on the frequency, and then we can noralize the pre-weights to ake sure that they add up to one, ie, take F (f i) F (f k ) k1 Reaining proble In this ore general approach, how to select the function? What we do in this section In this section, we describe reasonable requireents on this function, and we describe all possible functions which satisfy these requireents First requireent: onotonicity Our first requireent is that aspects which are entioned ore frequently should be given larger weights In other words, if f i > f j, then we should have F (f i) > F (f j) F (f k ) F (f k ) k1 k1 Multiplying both sides of this inequality by the su F (f k ), k1 we conclude that F (f i ) > F (f j ), ie, that the function should be onotonic Second requireent: independence fro irrelevant factors Let us assue that we have four aspect, and that the i-th aspect is entioned n i ties in the corresponding docuent In this case, the frequency f i of the i-th aspect is equal to n i f i n 1 + n 2 + n 3 + n 4 Based on these frequencies, we copute the weights, and then select the alternative for which the overall vulnerability is the sallest possible w 1 v 1 + w 2 v 2 + w 3 v 3 + w 4 v 4 In particular, we ay consider the case when for this particular proble, the fourth aspect is irrelevant, ie, for which v 4 0 In this case, the overall vulnerability is equal to w 1 v 1 + w 2 v 2 + w 3 v 3 On the other hand, since the fourth aspect is irrelevant for our proble, it akes sense to ignore entions of this aspect, ie, to consider only the values n 1, n 2, and n 3 In this approach, we get new values of the frequencies: f i n i n 1 + n 2 + n 3
4 Based on these new frequencies f i, we can now copute the new weights, and then select the alternative for which the overall vulnerability is the sallest possible w 1 v 1 + w 2 v 2 + w 3 v 3 The resulting selection should be the sae for both criteria As we have entioned, the optiizing proble does not change if we siply ultiple the objective function by a constant So, if w i λ for soe λ, these two objective functions lead to the exact sae selection In this case, the trade-off between each two aspects is the sae: However, if we have a different trade-off between individual criteria, then we ay end up with different selections Thus, to ake sure that the selections are the sae, we ust guarantee that w j Substituting the forulas for the weights into the expression for the weight ratio, we can conclude that F (f i) F (f j ) Thus, the above requireent takes the for F (f i ) F (f j ) F (f i) F (f j ) One can check that the new frequencies f i can be obtained fro the previous ones by ultiplying by the sae constant: f i n i n 1 + n 2 + n 3 n 1 + n 2 + n 3 + n 4 n i n 1 + n 2 + n 3 n 1 + n 2 + n 3 + n 4 where we denoted k f i, k def n 1 + n 2 + n 3 + n 4 n 1 + n 2 + n 3 Thus, the above requireent takes the for F (k f i ) F (k f j ) F (f i) F (f j ) This should be true for all possible values of f i, f j, and k Once we postulate that, we arrive at the following result Proposition 2 An increasing function F : [0, 1] [0, 1] satisfies the property F (k f i ) F (k f j ) F (f i) F (f j ) for all possible real values k, f i, and f j if and only if C f for soe > 0 Coents Proof The previous case corresponds to 1, so this is indeed a generalization of the forula described in the previous section If we ultiply all the values F (f i ) by a constant C, then the noralizing su is also ultiplied by the sae constant, so the resulting weights do not change: F (f i) C f i f i F (f k ) C fk k1 k1 fk k1 Thus, fro the viewpoint of application to vulnerability, it is sufficient to consider only functions f 1 First, it is easy to check that for all possible values C and > 0, the function C f is increasing and satisfies the desired property So, to coplete our proof, we need to check that each increasing function which satisfies this property has this for 2 The desired property can be equivalently reforulated as F (k f i ) F (f i ) F (k f j) F (f j ) This equality holds for all possible values of f i and f j This eans that the ratio F (k f) does not depend on f, it only depends on k Let us denote this ratio by c(k) Then, we get ie, equivalently, F (k f) c(k), F (k f) c(k) 3 Since k f f k, we have F (k f) F (f k), ie, c(k) c(f) F (k) Dividing both sides by c(k) c(f), we conclude that c(f) F (k) c(k) This equality holds for all possible values of f and k This eans that the ratio c(f)
5 does not depend on f at all, it is a constant We will denote this constant by C Fro the condition c(f) C, we conclude that C c(f) So, to prove our results, it is sufficient to find the function c(f) 4 Substituting the expression C c(f) into the forula F (k f) c(k), we get C c(k f) c(k) C c(f) Dividing both sides of this equality by C, we conclude that c(k f) c(k) c(f) Let us use this equality to find the function c(f) 5 For k f 1, we get c(1) c(1) 2 Since c(k) 0, we conclude that c(1) 1 6 Let us denote c(2) by q Let us prove that for every integer n, we have c(2 1/n ) q 1/n Indeed, for f 2 1/n, we have thus, f f f (n ties) 2, q c(2) c(f) c(f) (n ties) (c(f)) n Therefore, we conclude that indeed, c(f) 2 1/n 7 Let us prove that for every two integers and n, we have Indeed, we have Therefore, we have c(2 /n ) q /n 2 /n 2 1/n 2 1/n ( ties) c(2 /n ) c(2 1/n ) c(2 1/n ) ( ties) (c(2 1/n ) We already know that c(2 1/n ) q 1/n ; thus, we conclude that The stateent is proven c(2 /n ) (q 1/n ) q /n 8 So, for rational values r, we have c(2 r ) q r Let us denote def log 2 (q) By definition of a logarith, this eans that q 2 Thus, for x 2 r, we have q r (2 ) r 2 r (2 r ) x So, for values x for which log 2 (x) is a rational nuber, we get c(x) x Siilarly to the proof of Proposition 1, we can use onotonicity to conclude that this equality c(x) x holds for all real values x We have already proven that F (x) C c(x), thus we have F (x) C x The proposition is proven IV POSSIBLE PROBABILISTIC INTERPRETATION OF THE ABOVE FORMULAS Forulation of the proble In the above text, we justified the epirical forula F (x) x without using any probabilities since we do not know any probabilities that we could use here However, in the ideal situation, when we know the exact probability of every possible outcoe and we know the exact consequences of each outcoes, a rational decision aker should use probabilities naely, a rational decision aker should select an alternative for which the expected value of the utility is the largest; see, eg, [3], [7], [9], [16] Fro this viewpoint, it would be nice to show that the above heuristic solution is not only reasonable in the above abstract sense, but that it actually akes perfect sense under certain reasonable assuptions about probability distributions What we do in this section In this section, on the exaple of two aspects v 1 and v 2, we show that there are probability distributions for which the weights should be exactly equal to frequencies Towards a foral description of the proble Let us assue that the actual weights of two aspects are w 1 and w 2 1 w 1 Let us also assue that vulnerabilities v i are independent rando variables For siplicity, we can assue that these two variables are identically distributed In each situation, if the first vulnerability aspect is ore iportant, ie, if w 1 v 1 > w 2 v 2, then the docuent entions the first aspect If the second vulnerability aspect is ore iportant, ie, if w 1 v 1 < w 2 v 2, then the docuent entions the second aspect In this case, the frequency f i with which the first aspect is entioned is equal to the probability that the first aspect is ost iportant, ie, the probability that w 1 v 1 > w 2 v 2 : f 1 P (w 1 v 1 > w 2 v 2 ) We would like to justify the situation in which f i, so we have w 1 P (w 1 v 1 > w 2 v 2 ) This equality ust hold for all possible values of w 1 Analysis of the proble and the resulting solution The desired equality can be equivalently reforulated as ( v1 P > w ) 2 w 1 v 2 w 1 Since w 2 1 w 1, we get ( v1 P > 1 w ) 1 w 1 v 2 w 1 To siply coputations, it is convenient to use logariths: then ratio becoe a difference, and we get where we denoted P (ln(v 1 ) ln(v 2 ) > z) w 1, z def ln ( 1 w1 w 1 )
6 Let us describe w 1 in ters of z Fro the definition of z, we conclude that e z 1 w 1 w 1 1 w 1 1 Thus, and So, we conclude that 1 w e z, w e z P (ln(v 1 ) ln(v 2 ) > z) e z The probability of the opposite event ln(v 1 ) ln(v 2 ) z is equal to one inus this probability: P (ln(v 1 ) ln(v 2 ) z) e z ez 1 + e z This eans that for the auxiliary rando variable ξ def ln(v 1 ) ln(v 2 ), the cuulative distribution function F ξ (z) def P (ξ z) is equal to F ξ (z) ez 1 + e z This distribution is known as a logistic distribution; see, eg, [1], [5], [18] It is known that one way to obtain a logistic distribution is to consider the distribution of ln(v 1 ) ln(v 2 ), where v 1 and v 2 are are independent and exponentially distributed Thus, the desired forula f i (ie, F (x) x) corresponds to a reasonable situation when both vulnerabilities are exponentially distributed ACKNOWLEDGMENTS This work was supported by the University of Texas at El Paso Regional Cyber and Energy Security Center (RCES) supported by the City of El Paso s Planning and Econoic Developent division This work was also supported in part by the National Science Foundation grants HRD and HRD (Cyber-ShARE Center of Excellence) and DUE REFERENCES [1] N Balakrishnan, Handbook of the Logistic Distribution Marcel Dekker, New York, 1992 [2] Departent of Energy, Electricity Subsector Cybersecurity Capability Maturity Model (ES-C2M2), Version 10, 2012, available at [3] P C Fishburn, Nonlinear Preference and Utility Theory, John Hopkins Press, Baltiore, Maryland, 1988 [4] I Gallegos et al, Syste, Method and Apparatus for Assessing a Risk of one or More Assets within an Operational Technology Infrastructure, US Patent No 61/725,474, 2012 [5] N L Johnson, S Kotz, and N Balakrishnan, Continuous Univariate Distributions, Vol 2, Wiley, New York, 1995 [6] G Klir and B Yuan, Fuzzy Sets and Fuzzy Logic, Prentice Hall, Upper Saddle River, New Jersey, 1995 [7] R D Luce and R Raiffa, Gaes and Decisions: Introduction and Critical Survey, Dover, New York, 1989 [8] National Electric Sector CyberSecurity Organization Resource (NESCOR), Electric Sector Failure Scenarios and Ipact Analyses, Version 10, 2012, available at [9] H T Nguyen, V Kreinovich, B Wu, and G Xiang, Coputing Statistics under Interval and Fuzzy Uncertainty, Springer Verlag, Berlin, Heidelberg, 2012 [10] H T Nguyen and E A Walker, A First Course in Fuzzy Logic, Chapan and Hall/CRC, Boca Raton, Florida, 2006 [11] National Institute of Standard and Technology (NIST), Guide for Mapping Types of Inforation and Inforation Systes for Security Categories, NIST Special Publication , Volue 1, Revision 1, 2008 [12] National Institute of Standard and Technology (NIST), Guide for Conducting Risk Assessent, NIST Special Publication , Revision 1, 2011 [13] National Institute of Standard and Technology (NIST), Guide to Industrial Control Systes (ICS) Security, NIST Special Publication , 2011 [14] National Institute of Standard and Technology (NIST), Security and Privacy Controls for Federal Inforation Systes and Organizations, NIST Special Publication , Revision 4, 2012 [15] L Perez, Regional Cyber and Energy Security (RCES) Center 2012 Annual Progress Report Year 1, El Paso, Texas, June 2013, available as clerk/agenda/ / cpdf [16] H Raiffa, Decision Analysis, McGraw-Hill, Colubus, Ohio, 1997 [17] Regional Cyber and Energy Security (RCES) Center at the University of Texas at El Paso, Developing a Fraework to Iprove Critical Infrastructure Cyber Security, National Institute for Standards and Technology (NIST) Report, April 2013, available as coents/rces center pdf [18] D J Sheskin, Handbook of Paraetric and Nonparaetric Statistical Procedures, Chapan & Hall/CRC, Boca Raton, Florida, 2011 [19] L A Zadeh, Fuzzy sets, Inforation and Control, 1965, Vol 8, pp
How to Assign Weights to Different Factors in Vulnerability Analysis: Towards a Justification of a Heuristic Technique
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 6-2014 How to Assign Weights to Different Factors in Vulnerability Analysis: Towards
More informationWhy Bellman-Zadeh Approach to Fuzzy Optimization
Applied Mathematical Sciences, Vol. 12, 2018, no. 11, 517-522 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.8456 Why Bellman-Zadeh Approach to Fuzzy Optimization Olga Kosheleva 1 and Vladik
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationTowards Decision Making under General Uncertainty
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 3-2017 Towards Decision Making under General Uncertainty Andrzej Pownuk University
More informationDetermining OWA Operator Weights by Mean Absolute Deviation Minimization
Deterining OWA Operator Weights by Mean Absolute Deviation Miniization Micha l Majdan 1,2 and W lodziierz Ogryczak 1 1 Institute of Control and Coputation Engineering, Warsaw University of Technology,
More informationInspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information
Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub
More informationChapter 6: Economic Inequality
Chapter 6: Econoic Inequality We are interested in inequality ainly for two reasons: First, there are philosophical and ethical grounds for aversion to inequality per se. Second, even if we are not interested
More informationDecision Making under Interval Uncertainty: What Can and What Cannot Be Computed in Linear Time and in Real Time
Decision Making under Interval Uncertainty: What Can and What Cannot Be Computed in Linear Time and in Real Time O. Kosheleva and V. Kreinovich University of Texas at El Paso, El Paso, TX 79968, USA, olgak@utep.edu,
More informationKeywords: Estimator, Bias, Mean-squared error, normality, generalized Pareto distribution
Testing approxiate norality of an estiator using the estiated MSE and bias with an application to the shape paraeter of the generalized Pareto distribution J. Martin van Zyl Abstract In this work the norality
More informationWhich Bio-Diversity Indices Are Most Adequate
Which Bio-Diversity Indices Are Most Adequate Olga Kosheleva Department of Teacher Education University of Texas at El Paso 500 W. University El Paso, Texas 79968 olgak@utep.edu Craig Tweedie Environmental
More informationHow to Define "and"- and "or"-operations for Intuitionistic and Picture Fuzzy Sets
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Computer Science 3-2019 How to Define "and"- and "or"-operations for Intuitionistic and Picture Fuzzy Sets Christian
More informationThe Methods of Solution for Constrained Nonlinear Programming
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationMembership Functions Representing a Number vs. Representing a Set: Proof of Unique Reconstruction
Membership Functions Representing a Number vs. Representing a Set: Proof of Unique Reconstruction Hung T. Nguyen Department of Mathematical Sciences New Mexico State University Las Cruces, New Mexico 88008,
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationExtension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels
Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique
More informationResearch Article On the Isolated Vertices and Connectivity in Random Intersection Graphs
International Cobinatorics Volue 2011, Article ID 872703, 9 pages doi:10.1155/2011/872703 Research Article On the Isolated Vertices and Connectivity in Rando Intersection Graphs Yilun Shang Institute for
More informationEstimating Parameters for a Gaussian pdf
Pattern Recognition and achine Learning Jaes L. Crowley ENSIAG 3 IS First Seester 00/0 Lesson 5 7 Noveber 00 Contents Estiating Paraeters for a Gaussian pdf Notation... The Pattern Recognition Proble...3
More informationRenato A. Krohling Department of Production Engineering & Graduate Program in Computer Science, PPGI UFES - Federal University of Espírito Santo
Interval-Valued Intuitionistic Fuzzy TODIM Renato A. Krohling Departent of Production Engineering & Graduate Progra in Coputer Science, PPGI FES - Federal niversity of Espírito Santo Vitória ES - Brazil
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationGraphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes
Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationTEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES
TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,
More informationA proposal for a First-Citation-Speed-Index Link Peer-reviewed author version
A proposal for a First-Citation-Speed-Index Link Peer-reviewed author version Made available by Hasselt University Library in Docuent Server@UHasselt Reference (Published version): EGGHE, Leo; Bornann,
More informationWhy Trapezoidal and Triangular Membership Functions Work So Well: Towards a Theoretical Explanation
Journal of Uncertain Systems Vol.8, No.3, pp.164-168, 2014 Online at: www.jus.org.uk Why Trapezoidal and Triangular Membership Functions Work So Well: Towards a Theoretical Explanation Aditi Barua, Lalitha
More informationAbout the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry
About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a ournal published by Elsevier. The attached copy is furnished to the author for internal non-coercial research and education use, including for instruction at the authors institution
More informationApproximation in Stochastic Scheduling: The Power of LP-Based Priority Policies
Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationTowards Decision Making under Interval Uncertainty
Journal of Uncertain Systems Vol.1, No.3, pp.00-07, 018 Online at: www.us.org.uk Towards Decision Making under Interval Uncertainty Andrze Pownuk, Vladik Kreinovich Computational Science Program, University
More informationSampling How Big a Sample?
C. G. G. Aitken, 1 Ph.D. Sapling How Big a Saple? REFERENCE: Aitken CGG. Sapling how big a saple? J Forensic Sci 1999;44(4):750 760. ABSTRACT: It is thought that, in a consignent of discrete units, a certain
More informationBiostatistics Department Technical Report
Biostatistics Departent Technical Report BST006-00 Estiation of Prevalence by Pool Screening With Equal Sized Pools and a egative Binoial Sapling Model Charles R. Katholi, Ph.D. Eeritus Professor Departent
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationNOTES AND CORRESPONDENCE. Two Extra Components in the Brier Score Decomposition
752 W E A T H E R A N D F O R E C A S T I N G VOLUME 23 NOTES AND CORRESPONDENCE Two Extra Coponents in the Brier Score Decoposition D. B. STEPHENSON School of Engineering, Coputing, and Matheatics, University
More informationOn the Existence of Pure Nash Equilibria in Weighted Congestion Games
MATHEMATICS OF OPERATIONS RESEARCH Vol. 37, No. 3, August 2012, pp. 419 436 ISSN 0364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/10.1287/oor.1120.0543 2012 INFORMS On the Existence of Pure
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationA method to determine relative stroke detection efficiencies from multiplicity distributions
A ethod to deterine relative stroke detection eiciencies ro ultiplicity distributions Schulz W. and Cuins K. 2. Austrian Lightning Detection and Inoration Syste (ALDIS), Kahlenberger Str.2A, 90 Vienna,
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationA Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science
A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest
More informationDepartment of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China
6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationEquilibria on the Day-Ahead Electricity Market
Equilibria on the Day-Ahead Electricity Market Margarida Carvalho INESC Porto, Portugal Faculdade de Ciências, Universidade do Porto, Portugal argarida.carvalho@dcc.fc.up.pt João Pedro Pedroso INESC Porto,
More informationConstruction of an index by maximization of the sum of its absolute correlation coefficients with the constituent variables
Construction of an index by axiization of the su of its absolute correlation coefficients with the constituent variables SK Mishra Departent of Econoics North-Eastern Hill University Shillong (India) I.
More informationA MESHSIZE BOOSTING ALGORITHM IN KERNEL DENSITY ESTIMATION
A eshsize boosting algorith in kernel density estiation A MESHSIZE BOOSTING ALGORITHM IN KERNEL DENSITY ESTIMATION C.C. Ishiekwene, S.M. Ogbonwan and J.E. Osewenkhae Departent of Matheatics, University
More informationEXPLICIT CONGRUENCES FOR EULER POLYNOMIALS
EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit
More informationThe Frequent Paucity of Trivial Strings
The Frequent Paucity of Trivial Strings Jack H. Lutz Departent of Coputer Science Iowa State University Aes, IA 50011, USA lutz@cs.iastate.edu Abstract A 1976 theore of Chaitin can be used to show that
More informationLinguistic majorities with difference in support
Linguistic ajorities with difference in support Patrizia Pérez-Asurendi a, Francisco Chiclana b,c, a PRESAD Research Group, SEED Research Group, IMUVA, Universidad de Valladolid, Valladolid, Spain b Centre
More informationINTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN
INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN V.A. Koarov 1, S.A. Piyavskiy 2 1 Saara National Research University, Saara, Russia 2 Saara State Architectural University, Saara, Russia Abstract. This article
More informationA Note on the Applied Use of MDL Approximations
A Note on the Applied Use of MDL Approxiations Daniel J. Navarro Departent of Psychology Ohio State University Abstract An applied proble is discussed in which two nested psychological odels of retention
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October
More informationOptimum Value of Poverty Measure Using Inverse Optimization Programming Problem
International Journal of Conteporary Matheatical Sciences Vol. 14, 2019, no. 1, 31-42 HIKARI Ltd, www.-hikari.co https://doi.org/10.12988/ijcs.2019.914 Optiu Value of Poverty Measure Using Inverse Optiization
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationApplying Genetic Algorithms to Solve the Fuzzy Optimal Profit Problem
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 8, 563-58 () Applying Genetic Algoriths to Solve the Fuzzy Optial Profit Proble FENG-TSE LIN AND JING-SHING YAO Departent of Applied Matheatics Chinese Culture
More informationRevealed Preference with Stochastic Demand Correspondence
Revealed Preference with Stochastic Deand Correspondence Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk Prasanta K. Pattanaik
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationDERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS
DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS N. van Erp and P. van Gelder Structural Hydraulic and Probabilistic Design, TU Delft Delft, The Netherlands Abstract. In probles of odel coparison
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationPattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition
More informationLost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies
OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationTight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
Tight Bounds for axial Identifiability of Failure Nodes in Boolean Network Toography Nicola Galesi Sapienza Università di Roa nicola.galesi@uniroa1.it Fariba Ranjbar Sapienza Università di Roa fariba.ranjbar@uniroa1.it
More informationEnsemble Based on Data Envelopment Analysis
Enseble Based on Data Envelopent Analysis So Young Sohn & Hong Choi Departent of Coputer Science & Industrial Systes Engineering, Yonsei University, Seoul, Korea Tel) 82-2-223-404, Fax) 82-2- 364-7807
More informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
More informationThe Euler-Maclaurin Formula and Sums of Powers
DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More informationA general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics, EPFL, Lausanne Phone: Fax:
A general forulation of the cross-nested logit odel Michel Bierlaire, EPFL Conference paper STRC 2001 Session: Choices A general forulation of the cross-nested logit odel Michel Bierlaire, Dpt of Matheatics,
More informationComputable Shell Decomposition Bounds
Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung
More informationWhy Copulas? University of Texas at El Paso. Vladik Kreinovich University of Texas at El Paso,
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 5-2015 Why Copulas? Vladik Kreinovich University of Texas at El Paso, vladik@utep.edu
More informationRevealed Preference and Stochastic Demand Correspondence: A Unified Theory
Revealed Preference and Stochastic Deand Correspondence: A Unified Theory Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk
More informationComputations Under Time Constraints: Algorithms Developed for Fuzzy Computations can Help
Journal of Uncertain Systems Vol.6, No.2, pp.138-145, 2012 Online at: www.jus.org.uk Computations Under Time Constraints: Algorithms Developed for Fuzzy Computations can Help Karen Villaverde 1, Olga Kosheleva
More informationA Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)
1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu
More informationPropagation of Probabilistic Uncertainty: The Simplest Case (A Brief Pedagogical Introduction)
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 11-2017 Propagation of Probabilistic Uncertainty: The Simplest Case (A Brief Pedagogical
More informationSimilarity Beyond Correlation: Symmetry-Based Approach
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 6-2016 Similarity Beyond Correlation: Symmetry-Based Approach Ildar Batyrshin Instituto
More informationDecision Making Under Interval Uncertainty: Beyond Hurwicz Pessimism-Optimism Criterion
Decision Making Under Interval Uncertainty: Beyond Hurwicz Pessimism-Optimism Criterion Tran Anh Tuan, Vladik Kreinovich, and Thach Ngoc Nguyen Abstract In many practical situations, we do not know the
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6
More informationOn the Maximum Likelihood Estimation of Weibull Distribution with Lifetime Data of Hard Disk Drives
314 Int'l Conf. Par. and Dist. Proc. Tech. and Appl. PDPTA'17 On the Maxiu Likelihood Estiation of Weibull Distribution with Lifetie Data of Hard Disk Drives Daiki Koizui Departent of Inforation and Manageent
More informationTowards a Localized Version of Pearson's Correlation Coefficient
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 7-1-201 Towards a Localized Version of Pearson's Correlation Coefficient Vladik Kreinovich
More information