Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Interval computations (4)
- Statistical methods (2)
- Aerospace structures (1)
- Affine arithmetic (1)
- Black-box techniques (1)
-
- Clustering (1)
- Convex segments of interval data (1)
- Dark matter (1)
- Defect localization (1)
- Dempster-shafer methods (1)
- Differentiation (1)
- Dimension compactification (1)
- Fault detection (1)
- Fault shapes (1)
- Funtional interpretation (1)
- Fuzzy data (1)
- Hermite-obreschkoff method (1)
- Interval data (1)
- Interval uncertainty (1)
- Kolmogorov-Smirnov statistic (1)
- Lamb waves (1)
- Landscape (1)
- Monte-Carlo (1)
- Neural networks (1)
- Nondestructive evaluation (1)
- Optimal selection of approximating family (1)
- Optimization (1)
- Phase intervals (1)
- Possibility theory (1)
- Probabilistic uncertainty (1)
Articles 31 - 36 of 36
Full-Text Articles in Computer Engineering
Detection Of Cracks At Rivet Holes In Thin Plates Using Lamb-Wave Scanning, Roberto A. Osegueda, Vladik Kreinovich, Soheil Nazarian, Enrique Roldan
Detection Of Cracks At Rivet Holes In Thin Plates Using Lamb-Wave Scanning, Roberto A. Osegueda, Vladik Kreinovich, Soheil Nazarian, Enrique Roldan
Departmental Technical Reports (CS)
This paper describes a Lamb-wave scanning method for the detection of notches simulating cracks at rivet holes in thin plates. The approach requires the generation of an ultrasonic So-Mode Lamb wave using an incident transmitter excited with a tone burst centered at a near non-dispersive frequency. Area scans are performed of a plate with a hole with a notch to generate times series information which is used to create animations illustrating the wave propagation characteristics. The time series are subject to a sifting process to obtain intrinsic mode functions which contain narrow frequency banded information of the signals. The Hilbert-Huang …
A New Cauchy-Based Black-Box Technique For Uncertainty In Risk Analysis, Vladik Kreinovich, Scott Ferson
A New Cauchy-Based Black-Box Technique For Uncertainty In Risk Analysis, Vladik Kreinovich, Scott Ferson
Departmental Technical Reports (CS)
Uncertainty is very important in risk analysis. A natural way to describe this uncertainty is to describe a set of possible values of each unknown quantity (this set is usually an interval), plus any additional information that we may have about the probability of different values within this set. Traditional statistical techniques deal with the situations in which we have a complete information about the probabilities; in real life, however, we often have only partial information about them. We therefore need to describe methods of handling such partial information in risk analysis. Several such techniques have been presented, often on …
Can Quantum Computers Be Useful When There Are Not Yet Enough Qubits?, Luc Longpre, Vladik Kreinovich
Can Quantum Computers Be Useful When There Are Not Yet Enough Qubits?, Luc Longpre, Vladik Kreinovich
Departmental Technical Reports (CS)
No abstract provided.
Complexity Of Single-Agent And Equilibrium-Based Multiagent Planning And Plan Checking: Approach When We Have A List Of Valid States, Chitta Baral, Vladik Kreinovich
Complexity Of Single-Agent And Equilibrium-Based Multiagent Planning And Plan Checking: Approach When We Have A List Of Valid States, Chitta Baral, Vladik Kreinovich
Departmental Technical Reports (CS)
In a recent paper M. Bowling, R. Jensen, and M. Veloso proposed a new formalization of the problem of multiagent planning - a formalization that is based on the (intuitively natural) notion of an equilibrium. In this paper we analyze the computational complexity of the corresponding equilibrium-based multiagent planning and plan checking. Within the traditional approach in which states are described by fluents, the computational complexity of planning under incompleteness is PSPACE-hard already for a single agent; therefore, to make a meaningful comparison between the complexity of single-agent and multi-agent planning, we analyze complexity in a different approach, in which …
Are There Easy-To-Check Necessary And Sufficient Conditions For Straightforward Interval Computations To Be Exact?, Vladik Kreinovich, Luc Longpre, James J. Buckley
Are There Easy-To-Check Necessary And Sufficient Conditions For Straightforward Interval Computations To Be Exact?, Vladik Kreinovich, Luc Longpre, James J. Buckley
Departmental Technical Reports (CS)
We prove that no "efficient" (easy-to-check) necessary and sufficient conditions are possible for checking whether straightforward interval computations lead to the exact result.
Towards Foundations Of Processing Imprecise Data: From Traditional Statistical Techniques Of Processing Crisp Data To Statistical Processing Of Fuzzy Data, Hung T. Nguyen, Tonghui Wang, Vladik Kreinovich
Towards Foundations Of Processing Imprecise Data: From Traditional Statistical Techniques Of Processing Crisp Data To Statistical Processing Of Fuzzy Data, Hung T. Nguyen, Tonghui Wang, Vladik Kreinovich
Departmental Technical Reports (CS)
In traditional statistics, we process crisp data - usually, results of measurements and/or observations. Not all the knowledge comes from measurements and observations. In many real-life situations, in addition to the results of measurements and observations, we have expert estimates, estimates that are often formulated in terms of natural language, like "x is large". Before we analyze how to process these statements, we must be able to translate them in a language that a computer can understand. This translation of expert statements from natural language into a precise language of numbers is one of the main original objectives of fuzzy …