Open Access. Powered by Scholars. Published by Universities.®
- Keyword
- Publication Type
Articles 1 - 12 of 12
Full-Text Articles in Computer Sciences
Towards Optimal Implementation Of Decentralized Currencies: How To Best Select Probabilities In An Ethereum-Type Proof-Of-Stake Protocol, Thach N. Nguyen, Christian Servin, Vladik Kreinovich
Towards Optimal Implementation Of Decentralized Currencies: How To Best Select Probabilities In An Ethereum-Type Proof-Of-Stake Protocol, Thach N. Nguyen, Christian Servin, Vladik Kreinovich
Departmental Technical Reports (CS)
Nowadays, most financial transactions are based on a centralized system, when all the transaction records are stored in a central location. This centralization makes the financial system vulnerable to cyber-attacks. A natural way to make the financial system more robust and less vulnerable is to switch to decentralized currencies. Such a transition will also make financial system more transparent. Historically first currency of this type -- bitcoin -- use a large amount of electric energy to mine new coins and is, thus, not scalable to the level of financial system as a whole. A more realistic and less energy-consuming scheme …
Relativistic Effects Can Be Used To Achieve A Universal Square-Root (Or Even Faster) Computation Speedup, Olga Kosheleva, Vladik Kreinovich
Relativistic Effects Can Be Used To Achieve A Universal Square-Root (Or Even Faster) Computation Speedup, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In this paper, we show that special relativity phenomenon can be used to reduce computation time of any algorithm from T to square root of T. For this purpose, we keep computers where they are, but the whole civilization starts moving around the computer -- at an increasing speed, reaching speeds close to the speed of light. A similar square-root speedup can be achieved if we place ourselves near a growing black hole. Combining the two schemes can lead to an even faster speedup: from time T to the 4-th order root of T.
A Symmetry-Based Explanation Of The Main Idea Behind Chubanov's Linear Programming Algorithm, Olga Kosheleva, Vladik Kreinovich, Thongchai Dumrongpokaphan
A Symmetry-Based Explanation Of The Main Idea Behind Chubanov's Linear Programming Algorithm, Olga Kosheleva, Vladik Kreinovich, Thongchai Dumrongpokaphan
Departmental Technical Reports (CS)
Many important real-life optimization problems can be described as optimizing a linear objective function under linear constraints -- i.e., as a linear programming problem. This problem is known to be not easy to solve. Reasonably natural algorithms -- such as iterative constraint satisfaction or simplex method -- often require exponential time. There exist efficient polynomial-time algorithms, but these algorithms are complicated and not very intuitive. Also, in contrast to many practical problems which can be computed faster by using parallel computers, linear programming has been proven to be the most difficult to parallelize. Recently, Sergei Chubanov proposed a modification of …
Why Bohmian Approach To Quantum Econometrics: An Algebraic Explanation, Vladik Kreinovich, Olga Kosheleva, Songsak Sriboonchitta
Why Bohmian Approach To Quantum Econometrics: An Algebraic Explanation, Vladik Kreinovich, Olga Kosheleva, Songsak Sriboonchitta
Departmental Technical Reports (CS)
Many equations in economics and finance are very complex. As a result, existing methods of solving these equations are very complicated and time-consuming. In many practical situations, more efficient algorithms for solving new complex equations appear when it turns out that these equations can be reduced to equations from other application areas -- equations for which more efficient algorithms are already known. It turns out that some equations in economics and finance can be reduced to equations from physics -- namely, from quantum physics. The resulting approach for solving economic equations is known as quantum econometrics. In quantum physics, …
Soft Computing Ideas Can Help Earthquake Geophysics, Solymar Ayala Cortez, Aaron A. Velasco, Vladik Kreinovich
Soft Computing Ideas Can Help Earthquake Geophysics, Solymar Ayala Cortez, Aaron A. Velasco, Vladik Kreinovich
Departmental Technical Reports (CS)
Earthquakes can be devastating, thus it is important to gain a good understanding of the corresponding geophysical processing. One of the challenges in geophysics is that we cannot directly measure the corresponding deep-earth quantities, we have to rely on expert knowledge, knowledge which often comes in terms of imprecise ("fuzzy") words from natural language. To formalize this knowledge, it is reasonable to use techniques that were specifically designed for such a formalization -- namely, fuzzy techniques, In this paper, we formulate the problem of optimally representing such knowledge. By solving the corresponding optimization problem, we conclude that the optimal representation …
Economics Of Commitment: Why Giving Away Some Freedom Makes Sense, Vladik Kreinovich, Olga Kosheleva, Mahdokhat Afravi, Genesis Bejarano, Marisol Chacon
Economics Of Commitment: Why Giving Away Some Freedom Makes Sense, Vladik Kreinovich, Olga Kosheleva, Mahdokhat Afravi, Genesis Bejarano, Marisol Chacon
Departmental Technical Reports (CS)
In general, the more freedom we have, the better choices we can make, and thus, the better possible economic outcomes. However, in practice, people often artificially restrict their future options by making a commitment. At first glance, commitments make no economic sense, and so their ubiquity seems puzzling. Our more detailed analysis shows that commitment often makes perfect economic sense: namely, it is related to the way we take future gains and losses into account. With the traditionally assumed exponential discounting, commitment indeed makes no economic sense, but with the practically observed hyperbolic discounting, commitment is indeed often economically beneficial.
Why Under Stress Positive Reinforcement Is More Effective? Why Optimists Study Better? Why People Become Restless? Simple Utility-Based Explanations, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich
Why Under Stress Positive Reinforcement Is More Effective? Why Optimists Study Better? Why People Become Restless? Simple Utility-Based Explanations, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In this paper, we use the utility-based approach to decision making to provide simple answers to the following three questions: Why under stress positive reinforcement is more effective? Why optimists study better? Why people become restless?
How Interval Measurement Uncertainty Affects The Results Of Data Processing: A Calculus-Based Approach To Computing The Range Of A Box, Andrew Pownuk, Vladik Kreinovich
How Interval Measurement Uncertainty Affects The Results Of Data Processing: A Calculus-Based Approach To Computing The Range Of A Box, Andrew Pownuk, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical applications, we are interested in the values of the quantities y1, ..., ym which are difficult (or even impossible) to measure directly. A natural idea to estimate these values is to find easier-to-measure related quantities x1, ..., xn and to use the known relation to estimate the desired values yi. Measurements come with uncertainty, and often, the only thing we know about the actual value of each auxiliary quantity xi is that it belongs to the interval [Xi − Δi, Xi + Δi …
Why Bellman-Zadeh Approach To Fuzzy Optimization, Olga Kosheleva, Vladik Kreinovich
Why Bellman-Zadeh Approach To Fuzzy Optimization, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In many cases, we need to select the best of the possible alternatives, but we do not know for sure which alternatives are possible and which are not possible. Instead, for each alternative x, we have a subjective probability p(x) that this alternative is possible. In 1970, Richard Bellman and Lotfi Zadeh proposed a heuristic method for selecting an alternative under such uncertainty. Interestingly, this method works very well in many practical applications, while similarly motivated alternative formulas do not work so well. In this paper, we explain the empirical success of the Bellman-Zadeh approach by showing that its formulas …
Why Zipf's Law: A Symmetry-Based Explanation, Daniel Cervantes, Olga Kosheleva, Vladik Kreinovich
Why Zipf's Law: A Symmetry-Based Explanation, Daniel Cervantes, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical situations, we have probability distributions for which, for large values of the corresponding quantity x, the probability density has the form ρ(x) ~ x−αfor some α > 0. While, in principle, we have laws corresponding to different α, most frequently, we encounter situations -- first described by Zipf for linguistics -- when α is close to 1. The fact that Zipf's has appeared frequently in many different situations seems to indicate that there must be some fundamental reason behind this law. In this paper, we provide a possible explanation.
Italian Folk Multiplication Algorithm Is Indeed Better: It Is More Parallelizable, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich
Italian Folk Multiplication Algorithm Is Indeed Better: It Is More Parallelizable, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
Traditionally, many ethnic groups had their own versions of arithmetic algorithms. Nowadays, most of these algorithms are studied mostly as pedagogical curiosities, as an interesting way to make arithmetic more exciting to the kids: by applying to their patriotic feelings -- if they are studying the algorithms traditionally used by their ethic group -- or simply to their sense of curiosity. Somewhat surprisingly, we show that one of these algorithms -- a traditional Italian multiplication algorithm -- is actually in some reasonable sense better than the algorithm that we all normally use -- namely, it is easier to parallelize.
Analysis Of High Performance Scientific Programming Workflows, Withana Kankanamalage Umayanganie Klaassen
Analysis Of High Performance Scientific Programming Workflows, Withana Kankanamalage Umayanganie Klaassen
Open Access Theses & Dissertations
Substantial time is spent on building, optimizing and maintaining large-scale software that is run on supercomputers. However, little has been done to utilize overall resources efficiently when it comes to including expensive human resources. The community is beginning to acknowledge that optimizing the hardware performance such as speed and memory bottlenecks contributes less to the overall productivity than does the development lifecycle of high-performance scientific applications. Researchers are beginning to look at overall scientific workflows for high performance computing. Scientific programming productivity is measured by time and effort required to develop, configure, and maintain a simulation experiment and its constituent …