Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Annotation (1)
- Annotation processor (1)
- Big data (1)
- Biomedical publications (1)
- Body Waves (1)
-
- Computability (1)
- Connections (1)
- Constraints (1)
- Decision making; interval uncertainty; real-time computations. (1)
- Error estimation (1)
- Flexible granules (1)
- Formal specification (1)
- Functional program verification (1)
- Fuzzy sets (1)
- Imprecise properties (1)
- Intelligence analysis (1)
- Intended functions (1)
- Interval computations (1)
- Interval-valued probabilities; interval-valued possibilities; interval computations; constraints. c⃝ (1)
- Java; JUnit (1)
- Keywords; term frequency-inverse document frequency (tf-idf); probabilistic explanation (1)
- Kolmogorov complexity (1)
- Map (1)
- Measurement errors (1)
- Model inaccuracy (1)
- Multi- Objective Optimization (1)
- OCL (1)
- Physical induction (1)
- Primal-Dual Interior Point Method (1)
- Program specification (1)
Articles 31 - 33 of 33
Full-Text Articles in Physical Sciences and Mathematics
Diversity Is Beneficial For A Research Group: One More Quantitative Argument, Komsan Suriya, Tatcha Sudtasan, Tonghui Wang, Octavio Lerma, Vladik Kreinovich
Diversity Is Beneficial For A Research Group: One More Quantitative Argument, Komsan Suriya, Tatcha Sudtasan, Tonghui Wang, Octavio Lerma, Vladik Kreinovich
Departmental Technical Reports (CS)
In this paper, we propose a natural model describing competition between two research groups of the same average research strength. The analysis of this model enables us to conclude that a more diverse group has an advantage: namely, the more diverse the group, the higher the average quality of its publications.
A Feasible Algorithm For Checking N-Scissors Congruence Of Polyhedra In Rd, Olga Kosheleva, Vladik Kreinovich
A Feasible Algorithm For Checking N-Scissors Congruence Of Polyhedra In Rd, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
While in R2, every two polygons of the same area are scissors congruent (i.e., they can be both decomposed into the same finite number of pair-wise congruent polygonal pieces), in R3, there are polyhedra P and P' of the same volume which are not scissors-congruent. It is therefore necessary, given two polyhedra, to check whether they are scissors-congruent (and if yes -- to find the corresponding decompositions). It is known that while there are algorithms for performing this checking-and-finding task, no such algorithm can be feasible -- their worst-case computation time grows (at least) exponentially, so …
From Global To Local Constraints: A Constructive Version Of Bloch's Principle, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich
From Global To Local Constraints: A Constructive Version Of Bloch's Principle, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
Generalizing several results from complex analysis, A. Bloch formulated an informal principle -- that for every global implication there is a stronger local implication. This principle has been formalized for complex analysis, but is has been successfully used in other areas as well. In this paper, we propose a new formalization of Bloch's Principle, and we show that in general, the corresponding localized version can be obtained algorithmically.