Filters








1,402,253 Hits in 4.9 sec

A random set characterization of possibility measures

Enrique Miranda, Inés Couso, Pedro Gil
2004 Information Sciences  
Several authors have pointed out the relationship between consonant random sets and possibility measures.  ...  However, this relationship has only been proven for the finite case, where the inverse Möbius of the upper probability induced by the random set simplifies the computations to a great extent.  ...  random sets and see if the one-point coverage function suffices to characterize the random set).  ... 
doi:10.1016/j.ins.2003.09.028 fatcat:dzueijab5fccblaaymkqbiesei

An existence theorem for measures on partially ordered sets, with applications to random set theory

Tommy Norberg
1987 Stochastic Processes and their Applications  
A careful study of the geometry of the set of singularities has now made possible a completely general solution and an outline of this will be presented.  ...  spatial change in a system since the last measurement was taken and T(n) is a random variable representing the measured time since the last measurement was taken.  ...  A careful study of the geometry of the set of singularities has now made possible a completely general solution and an outline of this will be presented.  ... 
doi:10.1016/0304-4149(87)90110-4 fatcat:gp2m5xesdjazxdrid2vumrpqme

Quantum randomness extraction for various levels of characterization of the devices

Yun Zhi Law, Le Phuc Thinh, Jean-Daniel Bancal, Valerio Scarani
2014 Journal of Physics A: Mathematical and Theoretical  
The amount of intrinsic randomness that can be extracted from measurement on quantum systems depends on several factors: notably, the power given to the adversary and the level of characterization of the  ...  We present for this case a systematic and efficient approach to quantifying the amount of intrinsic randomness, and show that setups involving ancillas (POVMs, pointer measurements) may not be interesting  ...  We thank two anonymous referees for useful comments that lead to improving the structure of the paper, and Gonzalo de la Torre for discussions.  ... 
doi:10.1088/1751-8113/47/42/424028 fatcat:uh5vrcxg4bew5egqmcvshxqv4e

Information-theoretic characterizations of conditional mutual independence and Markov random fields

R.W. Yeung, T.T. Lee, Zhongxing Ye
2002 IEEE Transactions on Information Theory  
Using the theory of -Measure, we have obtained a number of fundamental characterizations related to conditional mutual independence and Markov random fields.  ...  Toward the end of the paper, we obtain a hypergraph characterization of a Markov random field which makes it legitimate to view a Markov random field as a hypergraph.  ...  ACKNOWLEDGMENT The authors wish to thank both reviewers for the three rounds of very helpful comments on the manuscript.  ... 
doi:10.1109/tit.2002.1013139 fatcat:cfkbavwqaffy3bzobwqoufxbju

Inequalities in Information Theory [chapter]

2005 Elements of Information Theory  
This motivated researchers to seek a formal method to check all possible inequalities.  ...  measures of probability distributions.  ...  For any set of random variables, all possible such measures are non-negative. This non negativity of all Shannon's information measures form a set of inequalities known as basic inequalities.  ... 
doi:10.1002/047174882x.ch17 fatcat:oy23t5cdlvcadnl4cpl2ndkus4

On some characterization problems connected with stochastic integrals

Robert Iugannani, John B. Thomas
1971 Quarterly of Applied Mathematics  
then the associated measure G factors into the product of Lebesgue measure on the Borel sets of R and a finite measure on(_oo, a>).Two important random measures are those characterized by normal laws  ...  Thus B = i*kBit is a set of V2-measure zero.  ... 
doi:10.1090/qam/288872 fatcat:fbfqgrbj35ej5h3nccmcres3ry

Evolution models for dynamic networks

Pedro J. Zufiria, Iker Barriales-Valbuena
2015 2015 38th International Conference on Telecommunications and Signal Processing (TSP)  
This paper proposes a mathematical framework for modelling the evolution of dynamic networks.  ...  Such framework allows the time analysis of the relationship between the dynamic laws and the network characterizing features (degree distribution, clustering coefficient, controllability indexes, etc.)  ...  Such space can be denoted by (Q,Y¡g,P) , where Q is the sample space (or set of possible networks), Eg corresponds with the set of all possible events, and P is a probability measure on Eg. A.  ... 
doi:10.1109/tsp.2015.7296262 dblp:conf/tsp/ZufiriaB15 fatcat:cdr6kno7j5hyxmu5qumttc5adq

Maybe there's no such thing as a random sequence [article]

Peter G. Doyle
2011 arXiv   pre-print
There are only countably many such properties, so it would seem that the set of random sequences should have full measure.  ...  An infinite binary sequence is deemed to be random if it has all definable properties that hold almost surely for the usual probability measure on the set of infinite binary sequences.  ...  And so we can't write a formula characterizing random sequences. What we can do is write a formula characterizing random sequences within a given model of set theory.  ... 
arXiv:1103.3494v1 fatcat:65lcx4b6xjbpxc3pze7j6mvqwa

A Novel Algorithm For Finding Equilibrium Strategy In Two Person Zero Sum Game With Fuzzy Strategy Sets And Payoffs

Seyyed Mohammad Reza Farshchi, Gelare Veisi, Taghi Karimi, Morteza Aghaei
2011 Journal of Mathematics and Computer Science  
This paper investigates a two person zero sum matrix game in which the payoffs and strategy are characterized as random fuzzy variables.  ...  After that, based on the constraints, the feasible strategy string sets of the players for multi conflict situations are constructed.  ...  An algorithm based on random fuzzy simulation is designed to seek the minimax equilibrium strategy. P the power set of  , and Pos a possibility measure, then the triplet a possibility space.  ... 
doi:10.22436/jmcs.02.04.02 fatcat:zw4h5ecuibfupe74l377e4hocy

Entropy Characterization of Random Network Models

Pedro Zufiria, Iker Barriales-Valbuena
2017 Entropy  
complexity measures, providing new insight on the generation and characterization of random networks.  ...  This paper elaborates on the Random Network Model (RNM) as a mathematical framework for modelling and analyzing the generation of complex networks.  ...  Acknowledgments: This work has been partially supported by project MTM2015-67396-P of Ministerio de Economía y Competitividad, Spain.  ... 
doi:10.3390/e19070321 fatcat:53kqlhe2cve67o2lcrgofez3ui

Semi-device-independent framework based on natural physical assumptions

Thomas Van Himbeeck, Erik Woodhead, Nicolas J. Cerf, Raúl García-Patrón, Stefano Pironio
2017 Quantum  
We characterize the set of correlations that may be exhibited in the simplest possible scenario compatible with our new framework, based on two energy-constrained state preparations and a two-outcome measurement  ...  Interestingly, we uncover the existence of quantum correlations exceeding the set of classical correlations that can be produced by devices behaving in a purely pre-determined fashion (possibly including  ...  This later process is characterized by a set of unknown measurement operators {M b|y }.  ... 
doi:10.22331/q-2017-11-18-33 fatcat:lsbijwi5nzfp7bjfedvvb6ofvy

Performance Characterization in Computer Vision

R.M. Haralick
1994 CVGIP: Image Understanding  
various kinds of random degradations of the input data.  ...  Determination of the performance of a total computer vision algorithm is possible if the performance of each of the sub-algorithm constituents is given.  ...  ,xj, which can be set, J different variables yi,...,yj characterizing the random perturbation process, and K different measurements z\,..., ZK to be made on each image.  ... 
doi:10.1006/ciun.1994.1050 fatcat:szxvhm4vu5fahmfg23kscuhxjm

Performance Characterization in Computer Vision

R. M. Haralick
1992 Procedings of the British Machine Vision Conference 1992  
various kinds of random degradations of the input data.  ...  Determination of the performance of a total computer vision algorithm is possible if the performance of each of the sub-algorithm constituents is given.  ...  ,xj, which can be set, J different variables yi,...,yj characterizing the random perturbation process, and K different measurements z\,..., ZK to be made on each image.  ... 
doi:10.5244/c.6.1 dblp:conf/bmvc/Haralick92 fatcat:4sznvbesuzg6jaxgdrakcuyifq

Performance Characterization in Computer Vision

R Haralick
1994 Computer Vision and Image Understanding  
various kinds of random degradations of the input data.  ...  Determination of the performance of a total computer vision algorithm is possible if the performance of each of the sub-algorithm constituents is given.  ...  ,xj, which can be set, J different variables yi,...,yj characterizing the random perturbation process, and K different measurements z\,..., ZK to be made on each image.  ... 
doi:10.1006/cviu.1994.1055 fatcat:jzzvj5k2rjfxzfquaq6nqhfg4a

Performance characterization in computer vision [chapter]

Robert M. Haralick
1993 Lecture Notes in Computer Science  
various kinds of random degradations of the input data.  ...  Determination of the performance of a total computer vision algorithm is possible if the performance of each of the sub-algorithm constituents is given.  ...  ,xj, which can be set, J different variables yi,...,yj characterizing the random perturbation process, and K different measurements z\,..., ZK to be made on each image.  ... 
doi:10.1007/3-540-57233-3_1 fatcat:365dj5c5afejtdoittdau6hjru
« Previous Showing results 1 — 15 out of 1,402,253 results