How to Estimate Expected Shortfall When Probabilities Are Known with Interval or Fuzzy Uncertainty

Size: px
Start display at page:

Download "How to Estimate Expected Shortfall When Probabilities Are Known with Interval or Fuzzy Uncertainty"

Transcription

1 How to Estimate Exected Shortfall When Probabilities Are Known with Interval or Fuzzy Uncertainty Christian Servin Information Technology Deartment El Paso Community College El Paso, TX 7995, USA Hung T. Nguyen Deartment of Mathematical Science New Mexico State University Las Cruces, NM 88003, USA and Faculty of Economics Chiang Mai University, Thailand Vladik Kreinovich Deartment of Comuter Science University of Texas at El Paso 500 W. University El Paso, Texas 7996, USA Abstract To gauge the risk corresonding to a ossible disaster, it is imortant to know both the robability of this disaster and the exected damage caused by such otential disaster ( exected shortfall ). Both these measures of risk are easy to estimate in the ideal case, when we know the exact robabilities of different disaster strengths. In ractice, however, we usually only have a artial information about these robabilities: we may have an interval (or, more generally, fuzzy) uncertainty about these robabilities. In this aer, we show how to efficiently estimate the exected shortfall under such interval and/or fuzzy uncertainty. I. FORMULATION OF THE PROBLEM How to gauge risk. In the ideal world, there should be no risk: all engineering designs should be 00% reliable. To achieve such reliability, civil engineers use the record of historic floods, tsunamis, hurricanes, earthquakes, and other natural disasters to estimate the largest ossible strength of such a disaster, and design the buildings, bridges, and other structures so that they can withstand such disasters. The historic exerience shows, however, that there is always a ossibility that the disaster strength S exceeds the estimated threshold s 0 : this was the reason why the hurricane Katrina devastated New Orleans, why in 20, Fukushima nuclear ower station in Jaan was destroyed by an unusually high tsunami, etc. Since we cannot have a threshold s 0 that would guarantee that the disaster strength never exceeds s 0, the next best thing is to select a threshold s 0 for which the robability of exceeding s 0 does not exceed a given small number 0, i.e., for which, with robability = 0, we have S s 0. The choice of the threshold robability 0 deends on the situation. For examle: for manned sace flights, NASA selected 0 = 0 3 ; smaller values were not feasible because of high uncertainty associated with sace flights; on the other extreme, for reliability of a cell forming a comuter memory, we need 0 0 9, because otherwise, if we allow 0 0 9, at least one of the billions of cells will always go wrong. In addition to knowing the threshold s 0, it is also desirable to also know how much damage will come, on average, if this threshold is exceeded. For each ossible value S of the corresonding disaster strength, we can estimate the corresonding damage X; the stronger the disaster, the larger the damage. Let x denote the damage corresonding to the threshold value s 0 ; then, the condition S s 0 is equivalent to X x. In these terms, the robability that the disaster strength exceeds the threshold s 0 is equal to Prob(X > x ). In addition to this robability, it is desirable to also know the conditional exectation of the damage under the condition that the disaster strength exceeds the threshold x, i.e., the value ES = E[X X x ]. The corresonding conditional exectation is known as exected shortfall. These two values: the threshold x, and the exected shortfall ES, is how we gauge the risk. Similar two measures are used in finance to describe the risk that an investment would result in a big loss; see, e.g., [4]. How to estimate the exected shortfall in the ideal case, when we know the robability distribution describing damage. In the ideal case, we know the robability distribution that describes ossible values of the damage X. A usual way to describe a robability distribution is by describing its cumulative distribution function (cdf) F (x) = Prob(X x); see, e.g., [6]. In terms of cdf, the robability of exceeding the threshold value x is simly equal to F (x ). Thus, we have F (x ) = 0 and hence, F (x ) = 0 =. For each robability, the value x for which F (x ) = is known as the -th quantile. For examle: for = 0.5, we get the median;

2 for = 0.25 and = 0.75, we get quartiles, etc. In mathematical terms, the function that mas to x is an inverse function to the cdf F (x). The conditional exectation can then be comuted as the ratio x ES = x df (x). () In ractice, we only have artial information about the robabilities. In ractice, we rarely know the exact values of all the robabilities, we only have artial information about these robabilities. This may mean that, instead of the exact values F (x) corresonding to different values x, we only know an interval [F (x), F (x)] that contains the actual (unknown) value F (x). Such situation when, for each d, we only know the corresonding intervals, is known as a robability box or, for short, a -box; see, e.g., [], [2]. Even more generally, for each x, we may have several intervals [F (x), F (x)] corresonding to different degrees of certainty α [0, ], i.e., in effect, a fuzzy number; see, e.g., [3], [5], [7]. How to gauge risk under such an uncertainty? For different distributions F (x) [F (x), F (x)] within a given -box, we get different values of quantiles x for which F (x ) =. One can easily check that: the smallest value x corresonds to the largest values F (x) of the cdf; while the largest value x corresonds to the smallest values F (x) of the cdf. Thus, ossible values of the quantile x form an interval [x, x ] in which F (x ) = F (x ) =. Such quantile intervals are often useful when we erform comutations with -boxes; see, e.g., [], [2]. We can use this idea to handle the case when we have a fuzzy-valued function F(x), if we take into account the known fact that for all ossible comutation y = f(x,..., x n ) with fuzzy numbers, the alha-cut α y = {y : µ(y) α} of the result is equal to the range f( α x,..., α x n ) = {f(x,..., x n ) : x α x,..., x n α x n (α)} of the values f(x,..., x n ) when each x i belongs to the corresonding α-cut α x i = {x i : µ i (x i ) α}; see, e.g., [3], [5]. Thus, to find the α-cut of the quantile x, it is sufficient to comute the interval [x, x ] in situation when each F (x) belongs to the corresonding α-cut of the fuzzy number F(x). Such straightforward comutation is ossible because the deendence of the robability = F (x ) on the unknown function F (x) is monotonic (namely, increasing), and that each cdf F (x) is also an increasing function. So, if we increase the values of the function F (x), then for newly increased function F (x), we will have F (x ) > F (x ) =. Thus, to find the value x for which F (x ) =, we need to decrease the value x : x < x. So, to find the range of ossible values [x, x ] of the quantile x, we do not need to enumerate all ossible functions F (x) from the -box [F (x), F (x)] because of monotonicity, we know that: the smallest value x of the quantile x is attained when the cdf F (x) attains its largest ossible value, i.e., when F (x) = F (x) for all x; and the largest value x of the quantile x is attained when the cdf F (x) attains is smallest ossible value, i.e., when F (x) = F (x) for all x. For exected shortfall, different robability distributions from the -box, in general, lead to different values. We would like to find the range of ossible values of the exected shortfall. Estimating this range, however, is not a very straightforward task: when we increase F (x), it is not a riori clear whether the corresonding integral increases or decreases. Thus, we cannot immediately come u with a simle exression for the range of the exected shortfall. It is therefore necessary to come u with efficient algorithms for estimating the range of the exected shortfall under -box (interval) uncertainty. Similarly, for the fuzzy case, we need to be able to transform the fuzzy-valued cdf F(x) into a fuzzy value for the resulting exected shortfall. What we do in this aer. In this aer, we rovide the efficient algorithms for comuting the exected shortfall under interval (-box) and fuzzy uncertainty. To be more recise, we roduce an algorithm for comuting the exected shortfall under interval (-box) uncertainty. Based on what we mentioned earlier about fuzzy comutations, to find the α-cut of the exected shortfall, it is sufficient to comute the range of ossible values of ES of the exected shortfall in situation when each F (x) belongs to the corresonding α-cut of the fuzzy number F(x). In other words, from the algorithmic viewoint, the roblem of comuting the exected shortfall under fuzzy uncertainty can be indeed reduced to the case of interval (-box) uncertainty. II. ANALYSIS OF THE PROBLEM Let us find an equivalent exression for ES. To find the range of ossible values of exected shortfall ES, let us find an equivalent exression for ES that would simlify the comutation of this range. where Thus: According to formula (), we have ES = I, (3) I = x df (x). (4) x

3 the exected shortfall ES attains its smallest ossible value ES when the integral I attains its smallest ossible value I, and the exected shortfall ES attains its largest ossible value ES when the integral I attains its largest ossible value I. The integral I has an infinite uer bound. This integral can be thus reresented as a limit of integrals I T with a finite uer bound T when T : where Thus, for very large T, we have I I T. I = lim T I T, (5) I T = x df (x). (6) x The integral I T can be integrated by art: I T = x F (x) T x F (x) dx = x T F (T ) x F (x ) F (x) dx. (7) x For large T, we have F (T ) ractically equal to so T F (T ) = T and lim F (T ) =, T I T = T x F (x ) x F (x) dx. (8) By inition of a quantile x, we have F (x ) =, so I T = T x x F (x) dx. (9) When does the integral I T attain its largest and smallest ossible values? According to our analysis: the exected shortfall ES attains its largest ossible value when the value of the integral I T (corresonding to a very large value T ) is the largest ossible, and the exected shortfall ES attains its smallest ossible value when the value of the integral I T (corresonding to a very large value T ) is the smallest ossible. Let us thus analyze when the integral I T attains its largest and smallest ossible values. When does the integral I T attain its largest ossible value? Let us start with the largest ossible value. Different cdfs F (x) from the given -box result, in general, in different values of the integral I T. Let x max be the value corresonding to the cdf F max (x) for which this integral is the largest ossible. This means, in articular, that among all cdfs F (x) with the same value of the -th quantile x max (i.e., for which F (x max ) = ), this articular cdf F max (x) leads to the largest ossible value of the integral I T. One can easily see, from the exression (9), that the integral I T is a decreasing function of the values F (x). Thus, this integral is the largest when all the values F (x) are the smallest. What limitations on the values F (x) do we have? We have a limitation F (x) F (x) F (x) coming from the fact that we only consider cdfs from a given -box [F (x), F (x)]. We also have a limitation F (x) F (x ) =, which, for values x x, comes from the requirement F (x ) = and from the fact that each cdf is an increasing function of x. These constraints F (x) F (x) F (x) and F (x) can be equivalently described by a single constraint max(f (x), ) F (x) F (x). (0) Thus, the smallest ossible values of F (x) corresond to When F (x), we have F (x) = max(f (x), ). () max(f (x), ) = F (x) and hence F (x) = F (x). As we described earlier, the equality F (x) = is equivalent to x = x, thus the condition F (x) is equivalent to x x. On the other hand, when F (x) <, i.e., equivalently, when x < x, we have F (x) =. Thus, x max F (x) dx = x x max dx + x F (x) dx = (x x max ) + F (x) dx. (2) x Thus, the exression (9) takes the form I T = T x max (x x max ) x F (x) dx. (3) The two terms x max and (x x max ) can be easily combined into a single term x, so I T = T x x F (x) dx. (4) Since x is the quantile corresonding to the lower endoint F (x) of the -box, we can therefore conclude that the exression (4) is the value of the integral I T corresonding to F (x) = F (x). Thus, the largest value of the integral I T and hence, of the exected shortfall is attained when F (x) = F (x). When does the integral I T attain its smallest ossible value? Let us now consider the smallest ossible value. Let x min be the value corresonding to the cdf F min (x) for which this integral is the largest ossible. This means, in articular, that among all cdfs F (x) with the same value of the -th quantile x min (i.e., for which F (x min ) = ), this articular cdf F min (x) leads to the smallest ossible value of the integral I T.

4 Since the integral I T is a decreasing function of the values F (x), this integral is the smallest when all the values F (x) are the largest. Under the limitations (0), the largest ossible values are F (x) = F (x). Thus, the smallest value of the integral I T and hence, of the exected shortfall ES is attained when F (x) = F (x). III. RESULTING ALGORITHM: CASE OF INTERVAL UNCERTAINTY Problem: reminder. We want to find the range [ES, ES ] of ossible values of the exected shortfall ES when cdf F (x) is in the given -box [F (x), F (x)]. Conclusion. The above analysis leads to the following conclusion: The largest ossible value ES of the exected shortfall ES is attained when F (x) = F (x) for all x. The smallest ossible value ES of the exected shortfall ES is attained when F (x) = F (x) for all x. Thus, we arrive at the following algorithm: Resulting algorithm. First, we comute the exected shortfall ES corresonding to F (x) = F (x), as the ratio x x df (x), where x = (F ) (). This ratio is the uer endoint ES of the desired interval [ES, ES ]. Then, we comute the exected shortfall ES corresonding to F (x) = F (x), as the ratio IV. x x df (x), where x = (F ) (). This ratio is the lower endoint ES of the desired interval [ES, ES ]. RESULTING ALGORITHM: CASE OF FUZZY UNCERTAINTY Problem: reminder. We have a fuzzy-valued cdf F(x). In other words, for every real number x, we know a fuzzy number F(x) that describes the robability Prob(X x). We are also given a robability. We want to comute the corresonding fuzzy shortfall ES. Idea. To comute the desired fuzzy number ES, we comute, for each value α [0, ], the corresonding α-cut α ES. Of course, in ractice, we can only erform comutations with finitely many values α, so usually, we choose the threshold values α for degrees of certainty in accordance with the accuracy with which we can realistically determine these degrees e.g., for values α = 0, α = 0., α = 0.2,..., α = 0.9, and α =.0. As we have mentioned earlier, the interval forming this α-cut can be comuted by solving the interval-uncertainty roblem in which we use the α-cuts of the inuts. In our case, the inuts are the values of the fuzzy cdf F(x). Thus, to comute the desired α-cut α ES, we can solve the corresonding interval-uncertainty roblem in which the inuts are the α-cuts α F(x) of the fuzzy cdf. We already know how to solve the corresonding intervaluncertainty roblem, so we arrive at the following fuzzy-case algorithm. Resulting algorithm. We start with the α-cuts α F(x) = [ α F (x), α F (x)] corresonding to the values of the fuzzy cdf F(x). Our objective is to comute the α-cuts α ES of the exected shortfall ES. For that urose, for each α, we erform the following comutations: First, we comute the exected shortfall ES corresonding to the cdf α F (x), as the ratio α x x d α F (x), where α x = ( α F ) (). This ratio is the lower endoint α ES of the desired α-cut α ES = [ α ES, α ES ]. Then, we comute the exected shortfall ES corresonding to the cdf α F (x), as the ratio α x x d α F (x), where α x = ( α F ) (). This ratio is the uer endoint α ES of the desired α-cut α ES = [ α ES, α ES ]. ACKNOWLEDGMENT This work was suorted in art by the Faculty of Economics of Chiang Mai University and by the National Science Foundation grants HRD and HRD (Cyber- ShARE Center of Excellence) and DUE The authors are thankful to Scott Ferson and Paul Embrechts for valuable discussions, and to the anonymous referees for imortant suggestions. REFERENCES [] S. Ferson, Risk Assessment with Uncertainty Numbers: RiskCalc, CRC Press, Boca Raton, Florida, [2] S. Ferson, V. Kreinovich, W. Oberkamf, and L. Ginzburg, Exerimental Uncertainty Estimation and Statistics for Data Having Interval Uncertainty, Sandia National Laboratories, Reort SAND , [3] G. J. Klir and B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Alications, Prentice Hall, Uer Saddle River, New Jersey, 995.

5 [4] A. J. McNeil, R. Frey, and P. Embrechts, Quantitative Risk Management: Concets, Techniques, Tools, Princeton University Press, Princeton, New Jersey, 200. [5] H. T. Nguyen and E. A. Walker, A First Course in Fuzzy Logic, Chaman and Hall/CRC, Boca Raton, Florida, [6] D. J. Sheskin, Handbook of Parametric and Nonarametric Statistical Procedures, Chaman & Hall/CRC, Boca Raton, Florida, 20. [7] L. A. Zadeh, Fuzzy sets, Information and Control, 965, Vol. 8,

Membership 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 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 information

Why Copulas? University of Texas at El Paso. Vladik Kreinovich University of Texas at El Paso,

Why 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 information

Modeling Extremal Events Is Not Easy: Why the Extreme Value Theorem Cannot Be As General As the Central Limit Theorem

Modeling Extremal Events Is Not Easy: Why the Extreme Value Theorem Cannot Be As General As the Central Limit Theorem University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 5-2015 Modeling Extremal Events Is Not Easy: Why the Extreme Value Theorem Cannot Be

More information

How to Define "and"- and "or"-operations for Intuitionistic and Picture Fuzzy Sets

How 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 information

Combining Interval, Probabilistic, and Fuzzy Uncertainty: Foundations, Algorithms, Challenges An Overview

Combining Interval, Probabilistic, and Fuzzy Uncertainty: Foundations, Algorithms, Challenges An Overview Combining Interval, Probabilistic, and Fuzzy Uncertainty: Foundations, Algorithms, Challenges An Overview Vladik Kreinovich 1, Daniel J. Berleant 2, Scott Ferson 3, and Weldon A. Lodwick 4 1 University

More information

Computations Under Time Constraints: Algorithms Developed for Fuzzy Computations can Help

Computations 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 information

Why Bellman-Zadeh Approach to Fuzzy Optimization

Why 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 information

Towards a Localized Version of Pearson's Correlation Coefficient

Towards 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

How to Assign Weights to Different Factors in Vulnerability Analysis: Towards a Justification of a Heuristic Technique

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 information

Similarity Beyond Correlation: Symmetry-Based Approach

Similarity 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 information

Towards Decision Making under General Uncertainty

Towards 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 information

Propagation of Probabilistic Uncertainty: The Simplest Case (A Brief Pedagogical Introduction)

Propagation 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 information

4. Score normalization technical details We now discuss the technical details of the score normalization method.

4. Score normalization technical details We now discuss the technical details of the score normalization method. SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules

More information

Why Trapezoidal and Triangular Membership Functions Work So Well: Towards a Theoretical Explanation

Why 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 information

Distributed Rule-Based Inference in the Presence of Redundant Information

Distributed Rule-Based Inference in the Presence of Redundant Information istribution Statement : roved for ublic release; distribution is unlimited. istributed Rule-ased Inference in the Presence of Redundant Information June 8, 004 William J. Farrell III Lockheed Martin dvanced

More information

Computing Standard-Deviation-to-Mean and Variance-to-Mean Ratios under Interval Uncertainty is NP-Hard

Computing Standard-Deviation-to-Mean and Variance-to-Mean Ratios under Interval Uncertainty is NP-Hard Journal of Uncertain Systems Vol.9, No.2, pp.124-132, 2015 Online at: www.jus.org.uk Computing Standard-Deviation-to-Mean and Variance-to-Mean Ratios under Interval Uncertainty is NP-Hard Sio-Long Lo Faculty

More information

How to Distinguish True Dependence from Varying Independence?

How to Distinguish True Dependence from Varying Independence? University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 8-1-2013 How to Distinguish True Dependence from Varying Independence? Marketa Krmelova

More information

How to Define Relative Approximation Error of an Interval Estimate: A Proposal

How to Define Relative Approximation Error of an Interval Estimate: A Proposal Applied Mathematical Sciences, Vol 7, 2013, no 5, 211-216 How to Define Relative Approximation Error of an Interval Estimate: A Proposal Vladik Kreinovich Department of Computer Science University of Texas

More information

On split sample and randomized confidence intervals for binomial proportions

On split sample and randomized confidence intervals for binomial proportions On slit samle and randomized confidence intervals for binomial roortions Måns Thulin Deartment of Mathematics, Usala University arxiv:1402.6536v1 [stat.me] 26 Feb 2014 Abstract Slit samle methods have

More information

STA 250: Statistics. Notes 7. Bayesian Approach to Statistics. Book chapters: 7.2

STA 250: Statistics. Notes 7. Bayesian Approach to Statistics. Book chapters: 7.2 STA 25: Statistics Notes 7. Bayesian Aroach to Statistics Book chaters: 7.2 1 From calibrating a rocedure to quantifying uncertainty We saw that the central idea of classical testing is to rovide a rigorous

More information

How to Make Plausibility-Based Forecasting More Accurate

How to Make Plausibility-Based Forecasting More Accurate University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports CS Department of Computer Science 7-016 How to Make Plausibility-Based Forecasting More Accurate Kongliang Zhu Chiang Mai

More information

Optimal Design of Truss Structures Using a Neutrosophic Number Optimization Model under an Indeterminate Environment

Optimal Design of Truss Structures Using a Neutrosophic Number Optimization Model under an Indeterminate Environment Neutrosohic Sets and Systems Vol 14 016 93 University of New Mexico Otimal Design of Truss Structures Using a Neutrosohic Number Otimization Model under an Indeterminate Environment Wenzhong Jiang & Jun

More information

Multi-Criteria Optimization - an Important Foundation of Fuzzy System Design

Multi-Criteria Optimization - an Important Foundation of Fuzzy System Design University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 1-1-1997 Multi-Criteria Optimization - an Important Foundation of Fuzzy System Design

More information

Evaluating Process Capability Indices for some Quality Characteristics of a Manufacturing Process

Evaluating Process Capability Indices for some Quality Characteristics of a Manufacturing Process Journal of Statistical and Econometric Methods, vol., no.3, 013, 105-114 ISSN: 051-5057 (rint version), 051-5065(online) Scienress Ltd, 013 Evaluating Process aability Indices for some Quality haracteristics

More information

Do It Today Or Do It Tomorrow: Empirical Non- Exponential Discounting Explained by Symmetry and Fuzzy Ideas

Do It Today Or Do It Tomorrow: Empirical Non- Exponential Discounting Explained by Symmetry and Fuzzy Ideas University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 2-207 Do It Today Or Do It Tomorrow: Empirical Non- Exponential Discounting Explained

More information

Product of Partially Ordered Sets (Posets), with Potential Applications to Uncertainty Logic and Space-Time Geometry

Product of Partially Ordered Sets (Posets), with Potential Applications to Uncertainty Logic and Space-Time Geometry University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 6-1-2011 Product of Partially Ordered Sets (Posets), with Potential Applications to

More information

Computing with Words: Towards a New Tuple-Based Formalization

Computing with Words: Towards a New Tuple-Based Formalization Computing with Words: Towards a New Tuple-Based Formalization Olga Kosheleva, Vladik Kreinovich, Ariel Garcia, Felipe Jovel, Luis A. Torres Escobedo University of Teas at El Paso 500 W. University El Paso,

More information

AI*IA 2003 Fusion of Multiple Pattern Classifiers PART III

AI*IA 2003 Fusion of Multiple Pattern Classifiers PART III AI*IA 23 Fusion of Multile Pattern Classifiers PART III AI*IA 23 Tutorial on Fusion of Multile Pattern Classifiers by F. Roli 49 Methods for fusing multile classifiers Methods for fusing multile classifiers

More information

arxiv:cond-mat/ v2 25 Sep 2002

arxiv:cond-mat/ v2 25 Sep 2002 Energy fluctuations at the multicritical oint in two-dimensional sin glasses arxiv:cond-mat/0207694 v2 25 Se 2002 1. Introduction Hidetoshi Nishimori, Cyril Falvo and Yukiyasu Ozeki Deartment of Physics,

More information

A MIXED CONTROL CHART ADAPTED TO THE TRUNCATED LIFE TEST BASED ON THE WEIBULL DISTRIBUTION

A MIXED CONTROL CHART ADAPTED TO THE TRUNCATED LIFE TEST BASED ON THE WEIBULL DISTRIBUTION O P E R A T I O N S R E S E A R C H A N D D E C I S I O N S No. 27 DOI:.5277/ord73 Nasrullah KHAN Muhammad ASLAM 2 Kyung-Jun KIM 3 Chi-Hyuck JUN 4 A MIXED CONTROL CHART ADAPTED TO THE TRUNCATED LIFE TEST

More information

Checking Monotonicity is NP-Hard Even for Cubic Polynomials

Checking Monotonicity is NP-Hard Even for Cubic Polynomials Checking Monotonicity is NP-Hard Even for Cubic Polynomials Andrzej Pownuk 1, Luc Longpré 2, and Vladik Kreinovich 2 Departments of 1 Mathematical Sciences and 2 Computer Science, University of Texas at

More information

An Analysis of Reliable Classifiers through ROC Isometrics

An Analysis of Reliable Classifiers through ROC Isometrics An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit

More information

From Mean and Median Income to the Most Adequate Way of Taking Inequality Into Account

From Mean and Median Income to the Most Adequate Way of Taking Inequality Into Account From Mean and Median Income to the Most Adequate Way of Taking Inequality Into Account Vladik Kreinovich 1, Hung T. Nguyen 2, and Rujira Ouncharoen 3 1 Department of Computer Science, University of Texas

More information

One step ahead prediction using Fuzzy Boolean Neural Networks 1

One step ahead prediction using Fuzzy Boolean Neural Networks 1 One ste ahead rediction using Fuzzy Boolean eural etworks 1 José A. B. Tomé IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa jose.tome@inesc-id.t João Paulo Carvalho IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa

More information

Chapter 1 Fundamentals

Chapter 1 Fundamentals Chater Fundamentals. Overview of Thermodynamics Industrial Revolution brought in large scale automation of many tedious tasks which were earlier being erformed through manual or animal labour. Inventors

More information

Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)

Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO) Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment

More information

arxiv: v1 [physics.data-an] 26 Oct 2012

arxiv: v1 [physics.data-an] 26 Oct 2012 Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch

More information

Towards Decision Making under Interval Uncertainty

Towards 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 information

Monchaya Chiangpradit 1, Wararit Panichkitkosolkul 1, Hung T. Nguyen 1, and Vladik Kreinovich 2. 2 University of Texas at El Paso

Monchaya Chiangpradit 1, Wararit Panichkitkosolkul 1, Hung T. Nguyen 1, and Vladik Kreinovich 2. 2 University of Texas at El Paso From an Interval to a Natural Probability Distribution on the Interval: Weakest-Link Case, Distributions of Extremes, and Their Potential Application to Economics and to Fracture Mechanic Monchaya Chiangpradit

More information

Topic 7: Using identity types

Topic 7: Using identity types Toic 7: Using identity tyes June 10, 2014 Now we would like to learn how to use identity tyes and how to do some actual mathematics with them. By now we have essentially introduced all inference rules

More information

Estimation of the large covariance matrix with two-step monotone missing data

Estimation of the large covariance matrix with two-step monotone missing data Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo

More information

The Mathematics of Winning Streaks

The Mathematics of Winning Streaks The Mathematics of Winning Streaks Erik Leffler lefflererik@gmail.com under the direction of Prof. Henrik Eriksson Deartment of Comuter Science and Communications Royal Institute of Technology Research

More information

Introduction to Probability and Statistics

Introduction to Probability and Statistics Introduction to Probability and Statistics Chater 8 Ammar M. Sarhan, asarhan@mathstat.dal.ca Deartment of Mathematics and Statistics, Dalhousie University Fall Semester 28 Chater 8 Tests of Hyotheses Based

More information

16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes

16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes Infinite Series 6.2 Introduction We extend the concet of a finite series, met in Section 6., to the situation in which the number of terms increase without bound. We define what is meant by an infinite

More information

Thermal Propellant Gauging System for BSS 601

Thermal Propellant Gauging System for BSS 601 5th AIAA International Communications Satellite Systems Conference (organized by APSCC) AIAA 007-3149 Thermal Proellant Gauging System for BSS 601 T. Narita. 1 JSAT Cor, 9-1 Miho-Cho, Midori-ku, Yokohama

More information

Chapter 7 Sampling and Sampling Distributions. Introduction. Selecting a Sample. Introduction. Sampling from a Finite Population

Chapter 7 Sampling and Sampling Distributions. Introduction. Selecting a Sample. Introduction. Sampling from a Finite Population Chater 7 and s Selecting a Samle Point Estimation Introduction to s of Proerties of Point Estimators Other Methods Introduction An element is the entity on which data are collected. A oulation is a collection

More information

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis 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

More information

Which Bio-Diversity Indices Are Most Adequate

Which 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 information

Deriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V.

Deriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deriving ndicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deutsch Centre for Comutational Geostatistics Deartment of Civil &

More information

Keywords: pile, liquefaction, lateral spreading, analysis ABSTRACT

Keywords: pile, liquefaction, lateral spreading, analysis ABSTRACT Key arameters in seudo-static analysis of iles in liquefying sand Misko Cubrinovski Deartment of Civil Engineering, University of Canterbury, Christchurch 814, New Zealand Keywords: ile, liquefaction,

More information

Towards Foundations of Interval and Fuzzy Uncertainty

Towards Foundations of Interval and Fuzzy Uncertainty Journal of Uncertain Systems Vol.12, No.3, pp.164-170, 2018 Online at: www.jus.org.uk Towards Foundations of Interval and Fuzzy Uncertainty Mahdokht Afravi 1, Kehinde Akinola 1, Fredrick Ayivor 1, Ramon

More information

1 Gambler s Ruin Problem

1 Gambler s Ruin Problem Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins

More information

Decision Making Under Interval Uncertainty: Beyond Hurwicz Pessimism-Optimism Criterion

Decision 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 information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

Interval Computations as an Important Part of Granular Computing: An Introduction

Interval Computations as an Important Part of Granular Computing: An Introduction University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 5-1-2007 Interval Computations as an Important Part of Granular Computing: An Introduction

More information

Uncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning

Uncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment

More information

Lower Confidence Bound for Process-Yield Index S pk with Autocorrelated Process Data

Lower Confidence Bound for Process-Yield Index S pk with Autocorrelated Process Data Quality Technology & Quantitative Management Vol. 1, No.,. 51-65, 15 QTQM IAQM 15 Lower onfidence Bound for Process-Yield Index with Autocorrelated Process Data Fu-Kwun Wang * and Yeneneh Tamirat Deartment

More information

Convex Optimization methods for Computing Channel Capacity

Convex Optimization methods for Computing Channel Capacity Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem

More information

Partial Identification in Triangular Systems of Equations with Binary Dependent Variables

Partial Identification in Triangular Systems of Equations with Binary Dependent Variables Partial Identification in Triangular Systems of Equations with Binary Deendent Variables Azeem M. Shaikh Deartment of Economics University of Chicago amshaikh@uchicago.edu Edward J. Vytlacil Deartment

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

Supplementary Materials for Robust Estimation of the False Discovery Rate

Supplementary Materials for Robust Estimation of the False Discovery Rate Sulementary Materials for Robust Estimation of the False Discovery Rate Stan Pounds and Cheng Cheng This sulemental contains roofs regarding theoretical roerties of the roosed method (Section S1), rovides

More information

Casimir Force Between the Two Moving Conductive Plates.

Casimir Force Between the Two Moving Conductive Plates. Casimir Force Between the Two Moving Conductive Plates. Jaroslav Hynecek 1 Isetex, Inc., 95 Pama Drive, Allen, TX 751 ABSTRACT This article resents the derivation of the Casimir force for the two moving

More information

New Algorithms for Statistical Analysis of Interval Data

New Algorithms for Statistical Analysis of Interval Data New Algorithms for Statistical Analysis of Interval Data Gang Xiang, Scott A. Starks, Vladik Kreinovich, and Luc Longpré NASA Pan-American Center for Earth and Environmental Studies PACES) University of

More information

On a Markov Game with Incomplete Information

On a Markov Game with Incomplete Information On a Markov Game with Incomlete Information Johannes Hörner, Dinah Rosenberg y, Eilon Solan z and Nicolas Vieille x{ January 24, 26 Abstract We consider an examle of a Markov game with lack of information

More information

Hotelling s Two- Sample T 2

Hotelling s Two- Sample T 2 Chater 600 Hotelling s Two- Samle T Introduction This module calculates ower for the Hotelling s two-grou, T-squared (T) test statistic. Hotelling s T is an extension of the univariate two-samle t-test

More information

Analysis: The speed of the proton is much less than light speed, so we can use the

Analysis: The speed of the proton is much less than light speed, so we can use the Section 1.3: Wave Proerties of Classical Particles Tutorial 1 Practice, age 634 1. Given: 1.8! 10 "5 kg # m/s; 6.63! 10 "34 J #s Analysis: Use te de Broglie relation, λ. Solution:! 6.63 " 10#34 kg $ m

More information

Monopolist s mark-up and the elasticity of substitution

Monopolist s mark-up and the elasticity of substitution Croatian Oerational Research Review 377 CRORR 8(7), 377 39 Monoolist s mark-u and the elasticity of substitution Ilko Vrankić, Mira Kran, and Tomislav Herceg Deartment of Economic Theory, Faculty of Economics

More information

ON GENERALIZED SARMANOV BIVARIATE DISTRIBUTIONS

ON GENERALIZED SARMANOV BIVARIATE DISTRIBUTIONS TWMS J. A. Eng. Math. V., N., 2,. 86-97 ON GENERALIZED SARMANOV BIVARIATE DISTRIBUTIONS I. BAIRAMOV, B. (YAĞCI) ALTINSOY2, G. JAY KERNS 3 Abstract. A class of bivariate distributions which generalizes

More information

Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models

Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu

More information

LECTURE 7 NOTES. x n. d x if. E [g(x n )] E [g(x)]

LECTURE 7 NOTES. x n. d x if. E [g(x n )] E [g(x)] LECTURE 7 NOTES 1. Convergence of random variables. Before delving into the large samle roerties of the MLE, we review some concets from large samle theory. 1. Convergence in robability: x n x if, for

More information

On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm

On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,

More information

Boundedness Properties for Some Integral Transform

Boundedness Properties for Some Integral Transform Boundedness Proerties for Some Integral Transform V. D. Sharma, A. N. Rangari 2 Deartment of Mathematics, Arts, Commerce and Science College, Amravati- 444606(M.S), India Deartment of Mathematics, Adarsh

More information

ECON 4130 Supplementary Exercises 1-4

ECON 4130 Supplementary Exercises 1-4 HG Set. 0 ECON 430 Sulementary Exercises - 4 Exercise Quantiles (ercentiles). Let X be a continuous random variable (rv.) with df f( x ) and cdf F( x ). For 0< < we define -th quantile (or 00-th ercentile),

More information

Plotting the Wilson distribution

Plotting the Wilson distribution , Survey of English Usage, University College London Setember 018 1 1. Introduction We have discussed the Wilson score interval at length elsewhere (Wallis 013a, b). Given an observed Binomial roortion

More information

State Estimation with ARMarkov Models

State Estimation with ARMarkov Models Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,

More information

Combining Interval and Probabilistic Uncertainty in Engineering Applications

Combining Interval and Probabilistic Uncertainty in Engineering Applications Combining Interval and Probabilistic Uncertainty in Engineering Applications Andrew Pownuk Computational Science Program University of Texas at El Paso El Paso, Texas 79968, USA ampownuk@utep.edu Page

More information

Approximating min-max k-clustering

Approximating min-max k-clustering Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost

More information

8 STOCHASTIC PROCESSES

8 STOCHASTIC PROCESSES 8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular

More information

Damage Identification from Power Spectrum Density Transmissibility

Damage Identification from Power Spectrum Density Transmissibility 6th Euroean Worksho on Structural Health Monitoring - h.3.d.3 More info about this article: htt://www.ndt.net/?id=14083 Damage Identification from Power Sectrum Density ransmissibility Y. ZHOU, R. PERERA

More information

Round-off Errors and Computer Arithmetic - (1.2)

Round-off Errors and Computer Arithmetic - (1.2) Round-off Errors and Comuter Arithmetic - (.). Round-off Errors: Round-off errors is roduced when a calculator or comuter is used to erform real number calculations. That is because the arithmetic erformed

More information

Towards Decision Making under Interval, Set-Valued, Fuzzy, and Z-Number Uncertainty: A Fair Price Approach

Towards Decision Making under Interval, Set-Valued, Fuzzy, and Z-Number Uncertainty: A Fair Price Approach Towards Decision Making under Interval, Set-Valued, Fuzzy, and Z-Number Uncertainty: A Fair Price Approach Joe Lorkowski and Vladik Kreinovich University of Texas at El Paso, El Paso, TX 79968, USA lorkowski@computer.org,

More information

An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem

An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem An Ant Colony Otimization Aroach to the Probabilistic Traveling Salesman Problem Leonora Bianchi 1, Luca Maria Gambardella 1, and Marco Dorigo 2 1 IDSIA, Strada Cantonale Galleria 2, CH-6928 Manno, Switzerland

More information

Finite Mixture EFA in Mplus

Finite Mixture EFA in Mplus Finite Mixture EFA in Mlus November 16, 2007 In this document we describe the Mixture EFA model estimated in Mlus. Four tyes of deendent variables are ossible in this model: normally distributed, ordered

More information

STATISTICAL DISTRIBUTION OF FLOOR RESPONSE SPECTRA DUE TO DIFFERENT TYPES OF EARTHQUAKES GROUND MOTIONS

STATISTICAL DISTRIBUTION OF FLOOR RESPONSE SPECTRA DUE TO DIFFERENT TYPES OF EARTHQUAKES GROUND MOTIONS STATISTICAL DISTRIBUTION OF FLOOR RESPONSE SPECTRA DUE TO DIFFERENT TYPES OF EARTHQUAKES GROUND MOTIONS ABSTRACT: SR Uma, John Zhao and Andrew King Institute of Geological & Nuclear Sciences, Lower Hutt,

More information

A Qualitative Event-based Approach to Multiple Fault Diagnosis in Continuous Systems using Structural Model Decomposition

A Qualitative Event-based Approach to Multiple Fault Diagnosis in Continuous Systems using Structural Model Decomposition A Qualitative Event-based Aroach to Multile Fault Diagnosis in Continuous Systems using Structural Model Decomosition Matthew J. Daigle a,,, Anibal Bregon b,, Xenofon Koutsoukos c, Gautam Biswas c, Belarmino

More information

Thickness and refractive index measurements using multiple beam interference fringes (FECO)

Thickness and refractive index measurements using multiple beam interference fringes (FECO) Journal of Colloid and Interface Science 264 2003 548 553 Note www.elsevier.com/locate/jcis Thickness and refractive index measurements using multile beam interference fringes FECO Rafael Tadmor, 1 Nianhuan

More information

A Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with Consequences for the Training-Test Split

A Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with Consequences for the Training-Test Split A Bound on the Error of Cross Validation Using the Aroximation and Estimation Rates, with Consequences for the Training-Test Slit Michael Kearns AT&T Bell Laboratories Murray Hill, NJ 7974 mkearns@research.att.com

More information

General Linear Model Introduction, Classes of Linear models and Estimation

General Linear Model Introduction, Classes of Linear models and Estimation Stat 740 General Linear Model Introduction, Classes of Linear models and Estimation An aim of scientific enquiry: To describe or to discover relationshis among events (variables) in the controlled (laboratory)

More information

Re-entry Protocols for Seismically Active Mines Using Statistical Analysis of Aftershock Sequences

Re-entry Protocols for Seismically Active Mines Using Statistical Analysis of Aftershock Sequences Re-entry Protocols for Seismically Active Mines Using Statistical Analysis of Aftershock Sequences J.A. Vallejos & S.M. McKinnon Queen s University, Kingston, ON, Canada ABSTRACT: Re-entry rotocols are

More information

System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests

System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests 009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 0-, 009 FrB4. System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests James C. Sall Abstract

More information

On the capacity of the general trapdoor channel with feedback

On the capacity of the general trapdoor channel with feedback On the caacity of the general tradoor channel with feedback Jui Wu and Achilleas Anastasooulos Electrical Engineering and Comuter Science Deartment University of Michigan Ann Arbor, MI, 48109-1 email:

More information

John Weatherwax. Analysis of Parallel Depth First Search Algorithms

John Weatherwax. Analysis of Parallel Depth First Search Algorithms Sulementary Discussions and Solutions to Selected Problems in: Introduction to Parallel Comuting by Viin Kumar, Ananth Grama, Anshul Guta, & George Karyis John Weatherwax Chater 8 Analysis of Parallel

More information

Decision 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 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 information

CSC165H, Mathematical expression and reasoning for computer science week 12

CSC165H, Mathematical expression and reasoning for computer science week 12 CSC165H, Mathematical exression and reasoning for comuter science week 1 nd December 005 Gary Baumgartner and Danny Hea hea@cs.toronto.edu SF4306A 416-978-5899 htt//www.cs.toronto.edu/~hea/165/s005/index.shtml

More information

Shadow Computing: An Energy-Aware Fault Tolerant Computing Model

Shadow Computing: An Energy-Aware Fault Tolerant Computing Model Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms

More information

Improved Capacity Bounds for the Binary Energy Harvesting Channel

Improved Capacity Bounds for the Binary Energy Harvesting Channel Imroved Caacity Bounds for the Binary Energy Harvesting Channel Kaya Tutuncuoglu 1, Omur Ozel 2, Aylin Yener 1, and Sennur Ulukus 2 1 Deartment of Electrical Engineering, The Pennsylvania State University,

More information

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete

More information

On Wald-Type Optimal Stopping for Brownian Motion

On Wald-Type Optimal Stopping for Brownian Motion J Al Probab Vol 34, No 1, 1997, (66-73) Prerint Ser No 1, 1994, Math Inst Aarhus On Wald-Tye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of

More information

Convolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code.

Convolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code. Convolutional Codes Goals Lecture Be able to encode using a convolutional code Be able to decode a convolutional code received over a binary symmetric channel or an additive white Gaussian channel Convolutional

More information

Named Entity Recognition using Maximum Entropy Model SEEM5680

Named Entity Recognition using Maximum Entropy Model SEEM5680 Named Entity Recognition using Maximum Entroy Model SEEM5680 Named Entity Recognition System Named Entity Recognition (NER): Identifying certain hrases/word sequences in a free text. Generally it involves

More information