Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Engineering (778)
- Physical Sciences and Mathematics (16)
- Computer Sciences (7)
- Mathematics (7)
- Applied Mathematics (6)
-
- Civil and Environmental Engineering (4)
- Arts and Humanities (3)
- Aviation (3)
- History (3)
- Military History (3)
- Oral History (3)
- Construction Engineering and Management (2)
- Education (2)
- Software Engineering (2)
- Civil Engineering (1)
- Computational Engineering (1)
- Data Storage Systems (1)
- Engineering Education (1)
- Physics (1)
- Programming Languages and Compilers (1)
- Robotics (1)
- Science and Mathematics Education (1)
- Keyword
-
- Interval uncertainty (27)
- Interval computations (21)
- Pre and postconditions (11)
- Runtime assertion checking (10)
- Documentation (8)
-
- JML language (8)
- Probabilistic uncertainty (8)
- Uncertainty (8)
- Fuzzy logic (7)
- Aerospace structures (6)
- Computational complexity (6)
- Constraints (6)
- Fuzzy uncertainty (6)
- Human Factors (6)
- Test data generator (6)
- Usability (6)
- Intended function (5)
- Neural networks (5)
- Quantum computing (5)
- Symmetry groups (5)
- Aviation (4)
- Evaluation (4)
- Expert knowledge (4)
- Functional program verification (4)
- Genetic algorithms (4)
- Granularity (4)
- Inverse problem (4)
- Kolmogorov complexity (4)
- Optimization (4)
- Random testing (4)
- Publication Year
- Publication
Articles 91 - 120 of 789
Full-Text Articles in Engineering
Assessment Of Functional Impairment In Human Locomotion: A Fuzzy-Motivated Approach, Murad Alaqtash, Thompson Sarkodie-Gyan, Vladik Kreinovich
Assessment Of Functional Impairment In Human Locomotion: A Fuzzy-Motivated Approach, Murad Alaqtash, Thompson Sarkodie-Gyan, Vladik Kreinovich
Departmental Technical Reports (CS)
Many neurological disorders result in disordered motion. The effects of a disorder can be decrease by an appropriate rehabilitation. To make rehabilitation efficient, we need to monitor the patient and check how well he or she improves. In our previous papers, we proposed a fuzzy-based semi-heuristic method of gauging how well a patient improved. Surprisingly, this semi-heuristic method turned out to be more efficient that we expected. In this paper, we provide a justification for this efficiency.
In the future, it is desirable to combine this fuzzy-assessment approach with results by Alavarez-Alvarez, Trivino, and Cordon who use fuzzy techniques …
Efficient Approximation For Security Games With Interval Uncertainty, Chris Kiekintveld, Vladik Kreinovich
Efficient Approximation For Security Games With Interval Uncertainty, Chris Kiekintveld, Vladik Kreinovich
Departmental Technical Reports (CS)
Constraint Optimization: From Efficient Computation Of What Can Be Achieved To Efficient Computation Of A Way To Achieve The Corresponding Optimum, Ali Jalal-Kamali, Martine Ceberio, Vladik Kreinovich
Constraint Optimization: From Efficient Computation Of What Can Be Achieved To Efficient Computation Of A Way To Achieve The Corresponding Optimum, Ali Jalal-Kamali, Martine Ceberio, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practically useful cases, we know how to efficiently compute the exact range of a function over given intervals (and, possibly, under additional constraints). In other words, we know how to efficiently compute the minimum and maximum of a given function f(x1, ..., xn) on any box. From the practical viewpoint, it is important not only to find the value of the corresponding maximum or minimum, but also to know for what values of the parameters xi this optimum is attained. We prove a general result: that if we can efficiently compute the optimum, …
Visko: Semantic Web Support For Information And Science Visualization, Nicholas Del Rio, Paulo Pinheiro Da Silva
Visko: Semantic Web Support For Information And Science Visualization, Nicholas Del Rio, Paulo Pinheiro Da Silva
Departmental Technical Reports (CS)
Specialized knowledge in visualization software packages such as Visualization Toolkit (VTK), Generic Mapping Tools (GMT), and NCAR Command Language (NCL) is almost always a requisite for writ- ing applications that visualize datasets or information. Technical under- standing of visualization packages including rendering capabilities and data format ingestion is needed before it can be determined whether a package can satisfy some set of visualization requirements. Even after identification of satisfactory visualization packages, an application must still be built on packages that generate the required visualizations. Visualization Knowledge (VisKo) modularized ontology set encodes knowledge about visualization software packages using semantic Web technologies …
Estimating Correlation Under Interval Uncertainty, Ali Jalal-Kamali, Vladik Kreinovich
Estimating Correlation Under Interval Uncertainty, Ali Jalal-Kamali, Vladik Kreinovich
Departmental Technical Reports (CS)
In many engineering situations, we are interested in finding the correlation ρ between different quantities x and y based on the values xi and yi of these quantities measured in different situations i. Measurements are never absolutely accurate; it is therefore necessary to take this inaccuracy into account when estimating the correlation ρ. Sometimes, we know the probabilities of different values of measurement errors, but in many cases, we only know the upper bounds Δxi and Δyi on the corresponding measurement errors. In such situations, after we get the measurement results Xi and Yi …
Constraint Problems: Computability Is Equivalent To Continuity, Martine Ceberio, Vladik Kreinovich
Constraint Problems: Computability Is Equivalent To Continuity, Martine Ceberio, Vladik Kreinovich
Departmental Technical Reports (CS)
Towards Interval Techniques For Model Validation, Jaime Nava, Vladik Kreinovich
Towards Interval Techniques For Model Validation, Jaime Nava, Vladik Kreinovich
Departmental Technical Reports (CS)
Propagating Range (Uncertainty) And Continuity Information Through Computations: From Real-Valued Intervals To General Sets, Vladik Kreinovich
Propagating Range (Uncertainty) And Continuity Information Through Computations: From Real-Valued Intervals To General Sets, Vladik Kreinovich
Departmental Technical Reports (CS)
One of the main problems of interval computations is to find an enclosure Y that contains the range f(X1, ..., Xn) of a given function f(x1, ..., xn) over given intervals X1, ..., Xn. Most of the techniques for estimating this range are based on propagating the range through computations. Specifically, we follow the computations of f(x1, ..., xn) step-by-step: we start with ranges X1, ..., Xn of the inputs, and then we sequentially compute the enclosures for the ranges of …
No-Free-Lunch Result For Interval And Fuzzy Computing: When Bounds Are Unusually Good, Their Computation Is Unusually Slow, Ildar Batyrshin, Martine Ceberio, Vladik Kreinovich
No-Free-Lunch Result For Interval And Fuzzy Computing: When Bounds Are Unusually Good, Their Computation Is Unusually Slow, Ildar Batyrshin, Martine Ceberio, Vladik Kreinovich
Departmental Technical Reports (CS)
A Heuristic For Selecting The Cycle Length For Fairio, Sarala Arunagiri, Y. Kwok, Patricia J. Teller, R. A. Portillo, S. Seelam
A Heuristic For Selecting The Cycle Length For Fairio, Sarala Arunagiri, Y. Kwok, Patricia J. Teller, R. A. Portillo, S. Seelam
Departmental Technical Reports (CS)
Extreme Distributions On Intervals, Monchaya Chiangpradit, Wararit Panichkitkosolkul, Hung T. Nguyen, Vladik Kreinovich
Extreme Distributions On Intervals, Monchaya Chiangpradit, Wararit Panichkitkosolkul, Hung T. Nguyen, Vladik Kreinovich
Departmental Technical Reports (CS)
Reconstructing An Open Order From Its Closure, With Applications To Space-Time Physics And To Logic, Francisco Zapata, Vladik Kreinovich
Reconstructing An Open Order From Its Closure, With Applications To Space-Time Physics And To Logic, Francisco Zapata, Vladik Kreinovich
Departmental Technical Reports (CS)
How To Tell When A Product Of Two Partially Ordered Spaces Has A Certain Property?, Francisco Zapata, Olga Kosheleva, Karen Villaverde
How To Tell When A Product Of Two Partially Ordered Spaces Has A Certain Property?, Francisco Zapata, Olga Kosheleva, Karen Villaverde
Departmental Technical Reports (CS)
In this paper, we describe how checking whether a givenproperty F is true for a product A1 X A2 of partiallyordered spaces can be reduced to checking several relatedproperties of the original spaces Ai.
This result can be useful in the analysis of propertiesof intervals [a,b] = {x: a <= x <= b}over general partially ordered spaces -- such as the spaceof all vectors with component-wise order or the set of allfunctions with component-wise ordering f <= g <-->for all x (f(x) <= g(x)). When we consider sets of pairs ofsuch objects A1 X A2, it is natural to define the orderon this set in terms of orders in A1 and A2 -- this is, e.g.,how ordering and intervals are defined on the set R2 of all2-D vectors.
This result …
Density-Based Fuzzy Clustering As A First Step To Learning The Rules: Challenges And Possible Solutions, Gözde Ulutagay, Vladik Kreinovich
Density-Based Fuzzy Clustering As A First Step To Learning The Rules: Challenges And Possible Solutions, Gözde Ulutagay, Vladik Kreinovich
Departmental Technical Reports (CS)
Linear Neural Networks Revisited: From Pagerank To Family Happiness, Vladik Kreinovich
Linear Neural Networks Revisited: From Pagerank To Family Happiness, Vladik Kreinovich
Departmental Technical Reports (CS)
A Simple Physics-Motivated Equivalent Reformulation Of P=Np That Makes This Equality (Slighty) More Plausible, Jaime Nava, Vladik Kreinovich
A Simple Physics-Motivated Equivalent Reformulation Of P=Np That Makes This Equality (Slighty) More Plausible, Jaime Nava, Vladik Kreinovich
Departmental Technical Reports (CS)
In our opinion, one of the reasons why the problem P=NP? is so difficult is that while there are good intuitive arguments in favor of P=/=NP, there is a lack of intuitive arguments in favor of P=NP. In this paper, we provide such an argument -- based on the fact that in physics, many dependencies are scale-invariant, their expression does not change if we simply change the unit in which we measure the corresponding input quantity (e.g., replace meters by centimeters). It is reasonable to imagine similar behavior for time complexity tA(n) of algorithms A: that the form …
Efficient Geophysical Technique Of Vertical Line Elements As A Natural Consequence Of General Constraints Techniques, Rolando Cardenas, Martine Ceberio
Efficient Geophysical Technique Of Vertical Line Elements As A Natural Consequence Of General Constraints Techniques, Rolando Cardenas, Martine Ceberio
Departmental Technical Reports (CS)
How To Encourage Imperfect Individuals To Care More About Society In General: A Utility-Theory Approach, Vladik Kreinovich
How To Encourage Imperfect Individuals To Care More About Society In General: A Utility-Theory Approach, Vladik Kreinovich
Departmental Technical Reports (CS)
For a society to function efficiently, it is desirable that all members of this society care no only about themselves, but also about the society as a whole, i.e., about all the other individuals from the society. In practice, most people are only capable of caring about a few other individuals. We analyze this problem from the viewpoint of decision theory and show that even with such imperfect individuals, it is possible to make sure that everyone's decisions are affected by the society as a whole: namely, it is sufficient to make sure that people have emotional attachment to those …
I-Complexity And Discrete Derivative Of Logarithms: A Symmetry-Based Explanation, Vladik Kreinovich, Jaime Nava
I-Complexity And Discrete Derivative Of Logarithms: A Symmetry-Based Explanation, Vladik Kreinovich, Jaime Nava
Departmental Technical Reports (CS)
In many practical applications, it is useful to consider Kolmogorov complexity K(s) of a given string s, i.e., the shortest length of a program that generates this string. Since Kolmogorov complexity is, in general, not computable, it is necessary to use computable approximations K~(s) to K(s). Usually, to describe such an approximations, we take a compression algorithm and use the length of the compressed string as K~(s). This approximation, however, is not perfect: e.g., for most compression algorithms, adding a single bit to the string $s$ can drastically change the value K~(s) -- while …
The Cleanjava Language For Functional Program Verification, Yoonsik Cheon, Cesar Yeep, Melisa Vela
The Cleanjava Language For Functional Program Verification, Yoonsik Cheon, Cesar Yeep, Melisa Vela
Departmental Technical Reports (CS)
Computation In Quantum Space-Time Could Lead To A Super-Polynomial Speedup, Vladik Kreinovich, Michael Zakharevich
Computation In Quantum Space-Time Could Lead To A Super-Polynomial Speedup, Vladik Kreinovich, Michael Zakharevich
Departmental Technical Reports (CS)
In theoretical computer science, researchers usually distinguish between feasible problems (that can be solved in polynomial time) and problems that require more computation time. A natural question is: can we use new physical processes, processes that have not been used in modern computers, to make computations drastically faster -- e.g., to make intractable problems feasible? Such a possibility would occur if a physical process provides a super-polynomial (= faster than polynomial) speed-up.
In this direction, the most active research is undertaken in quantum computing. It is well known that quantum processes can drastically speed up computations; however, there are no …
How Accurately Should We Write On The Board? When Marking Comments On Student Papers?, Martine Ceberio, Olga Kosheleva
How Accurately Should We Write On The Board? When Marking Comments On Student Papers?, Martine Ceberio, Olga Kosheleva
Departmental Technical Reports (CS)
A New Justification For Weighted Average Aggregation In Fuzzy Techniques, Jaime Nava
A New Justification For Weighted Average Aggregation In Fuzzy Techniques, Jaime Nava
Departmental Technical Reports (CS)
In many practical situations, we need to decide whether a given solution is good enough, based on the degrees ai to which different criteria are satisfied. In this paper, we show that natural requirements lead to the weighted average decision, according to which a solution is acceptable if w1 * a1 + ... + wn * an > t for some weights wi and threshold t.
Prediction In Econometrics: Towards Mathematical Justification Of Simple (And Successful) Heuristics, Vladik Kreinovich, Hung T. Nguyen, Songsak Sriboonchitta
Prediction In Econometrics: Towards Mathematical Justification Of Simple (And Successful) Heuristics, Vladik Kreinovich, Hung T. Nguyen, Songsak Sriboonchitta
Departmental Technical Reports (CS)
High-Concentration Chemical Computing Techniques For Solving Hard-To-Solve Problems, And Their Relation To Numerical Optimization, Neural Computing, Reasoning Under Uncertainty, And Freedom Of Choice, Vladik Kreinovich, Olac Fuentes
High-Concentration Chemical Computing Techniques For Solving Hard-To-Solve Problems, And Their Relation To Numerical Optimization, Neural Computing, Reasoning Under Uncertainty, And Freedom Of Choice, Vladik Kreinovich, Olac Fuentes
Departmental Technical Reports (CS)
All Kinds Of Behavior Are Possible In Chemical Kinetics: A Theorem And Its Potential Applications To Chemical Computing, Vladik Kreinovich
All Kinds Of Behavior Are Possible In Chemical Kinetics: A Theorem And Its Potential Applications To Chemical Computing, Vladik Kreinovich
Departmental Technical Reports (CS)
Until the late 1950s, it was believed that the processes described by the equations of chemical kinetics are simple: in the course of each chemical reaction, concentrations of some chemical substances decrease while concentrations of other substances increase. This belief was shattered when the first periodic reaction -- the famous Belousov-Zhabotinsky reaction -- was discovered. Since then, it was shown that many other types of unusual behavior are possible for chemical systems. This discovery led to the possibility of finding chemical reactions that emulate non-trivial transformations that occur during computations -- and thus, perform computations "in vitro", by actually performing …
Towards Fast And Accurate Algorithms For Processing Fuzzy Data: Interval Computations Revisited, Gang Xiang, Vladik Kreinovich
Towards Fast And Accurate Algorithms For Processing Fuzzy Data: Interval Computations Revisited, Gang Xiang, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical applications, we need to process data -- e.g., to predict the future values of different quantities based on their current values. Often, the only information that we have about the current values comes from experts, and is described in informal ("fuzzy") terms like "small". To process such data, it is natural to use fuzzy techniques, techniques specifically designed by Lotfi Zadeh to handle such informal information.
In this survey, we start by revisiting the motivation behind Zadeh's formulas for processing fuzzy data, explain how the algorithmic problem of processing fuzzy data can be described in terms of …
Maximum Likelihood Approach To Pointwise Estimation In Statistical Data Processing Under Interval Uncertainty, Nitaya Buntao, Sa-Aat Niwitpong, Vladik Kreinovich
Maximum Likelihood Approach To Pointwise Estimation In Statistical Data Processing Under Interval Uncertainty, Nitaya Buntao, Sa-Aat Niwitpong, Vladik Kreinovich
Departmental Technical Reports (CS)
Traditional statistical estimates C(x1, ..., xn) for different statistical characteristics (such as mean, variance, etc.) implicitly assume that we know the sample values x1, ..., xn exactly. In practice, the sample values Xi come from measurements and are, therefore, in general, different from the actual (unknown) values Xi of the corresponding quantities. Sometimes, we know the probabilities of different values of the measurement error ΔXi = Xi - xi, but often, the only information that we have about the measurement error is the upper bound Δi …
Why Neural Networks Are Computationally Efficient Approximators: An Explanation, Jaime Nava, Vladik Kreinovich
Why Neural Networks Are Computationally Efficient Approximators: An Explanation, Jaime Nava, Vladik Kreinovich
Departmental Technical Reports (CS)
Theoretical Explanation Of Bernstein Polynomials' Efficiency: They Are Optimal Combination Of Optimal Endpoint-Related Functions, Jaime Nava, Vladik Kreinovich
Theoretical Explanation Of Bernstein Polynomials' Efficiency: They Are Optimal Combination Of Optimal Endpoint-Related Functions, Jaime Nava, Vladik Kreinovich
Departmental Technical Reports (CS)
In many applications of interval computations, it turned out to be beneficial to represent polynomials on a given interval [x-, x+] as linear combinations of Bernstein polynomials (x- x - )k * (x+ - x)n-k. In this paper, we provide a theoretical explanation for this empirical success: namely, we show that under reasonable optimality criteria, Bernstein polynomials can be uniquely determined from the requirement that they are optimal combinations of optimal polynomials corresponding to the interval's endpoints.