Computer Sciences Commons^™

Low-Reynolds-Number Locomotion Via Reinforcement Learning, Yuexin Liu

Dissertations

This dissertation summarizes computational results from applying reinforcement learning and deep neural network to the designs of artificial microswimmers in the inertialess regime, where the viscous dissipation in the surrounding fluid environment dominates and the swimmer’s inertia is completely negligible. In particular, works in this dissertation consist of four interrelated studies of the design of microswimmers for different tasks: (1) a one-dimensional microswimmer in free-space that moves towards the target via translation, (2) a one-dimensional microswimmer in a periodic domain that rotates to reach the target, (3) a two-dimensional microswimmer that switches gaits to navigate to the designated targets in …

Parameter Selection In Fully Homomorphic Encryption Schemes And Fhe Applications, Cavidan Yakupoglu

Dissertations

Quantum computing has been gaining momentum as a result of recent technological advances. Existing cryptographic systems rely on the difficult problems that can be solved by sufficiently powerful quantum computers. As the quantum age approaches, the desire to discover new difficult problems that cannot be solved by quantum systems has increased. Lattice-based cryptography is a prominent tool for the post-quantum era that facilitates the implementation of encryption systems for practical applications.

The Learning with Error (LWE) and Ring-LWE problems introduce new lattice hardness assumptions that have been incorporated into public-key cryptosystems to facilitate the implementation of numerous privacy-enhancing applications. Fully …

How Order And Disorder Affect People's Behavior: An Explanation, Sofia Holguin, Vladik Kreinovich

Departmental Technical Reports (CS)

Experimental data shows that people placed in orderly rooms donate more to charity and make healthier food choices that people placed in disorderly rooms. On the other hand, people placed in disorderly rooms show more creativity. In this paper, we provide a possible explanation for these empirical phenomena.

Why Decision Paralysis, Sean Aguilar, Vladik Kreinovich

Departmental Technical Reports (CS)

If a person has a small number of good alternatives, this person can usually make a good decision, i.e., select one of the given alternatives. However, when we have a large number of good alternatives, people take much longer to make a decision -- sometimes so long that, as a result, no decision is made. How can we explain this seemingly no-optimal behavior? In this paper, we show that this "decision paralysis" can be naturally explained by using the usual decision making ideas.

Why Five Stages Of Solar Activity, Why Five Stages Of Grief, Why Seven Plus Minus Two: A General Geometric Explanation, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

A recent paper showed that the solar activity cycle has five clear stages, and that taking theses stages into account helps to make accurate predictions of future solar activity. Similar 5-stage models have been effective in many other application area, e.g., in psychology, where a 5-stage model provides an effective description of grief. In this paper, we provide a general geometric explanations of why 5-stage models are often effective. This result also explains other empirical facts, e.g., the seven plus minus two law in psychology and the fact that only five space-time dimensions have found direct physical meaning.

Why Micro-Size Objects Affect The Flow Much More Than Larger Ones: A Geometric Explanations With Applications Ranging From Volcanoes And Tornadoes To Blood, Fish, And Building Preservation, Laxman Bokati, Vladik Kreinovich

Departmental Technical Reports (CS)

At first glance, the larger the object, the larger should be its effect on the surroundings -- in particular, the larger should be its effect on the surrounding flow. However, in many practical situations, we observe the opposite effect: micro-size particles affect the flow much more than larger-size particles. This seemingly counterintuitive phenomena has been observed in many situations: lava flow in the volcanoes, air circulation in tornadoes, blood flow in a body, the effect of fish on water circulation in the ocean, and the effect of added particles on seeping water that damages historic buildings. In this paper, we …

How To Make Inflation Optimal And Fair, Sean Aguilar, Vladik Kreinovich

Departmental Technical Reports (CS)

A reasonably small inflation helps economy as a whole -- by encouraging spending, but it also hurts people by decreasing the value of their savings. It is therefore reasonably to come up with an optimal (and fair) level of inflation, that would stimulate economy without hurting people too much. In this paper, we describe how this can be potentially done.

Development Of Graphical Models And Statistical Physics Motivated Approaches To Genomic Investigations, Yashwanth Lagisetty

Dissertations and Theses (Open Access)

Identifying genes involved in disease pathology has been a goal of genomic research since the early days of the field. However, as technology improves and the body of research grows, we are faced with more questions than answers. Among these is the pressing matter of our incomplete understanding of the genetic underpinnings of complex diseases. Many hypotheses offer explanations as to why direct and independent analyses of variants, as done in genome-wide association studies (GWAS), may not fully elucidate disease genetics. These range from pointing out flaws in statistical testing to invoking the complex dynamics of epigenetic processes. In the …

Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova

Journal of Humanistic Mathematics

This article describes the use of computer software to optimize the design of an academic hat and an ice cream cone!

The Dope Distance Is Sic: A Stable, Informative, And Computable Metric On Ordered Merge Trees, Jose Arbelo, Antonio Delgado, Charley Kirk, Zach Schlamowitz

Mathematics Summer Fellows

When analyzing time series data, it is often of interest to categorize them based on how different they are. We define a new dissimilarity measure between time series: Dynamic Ordered Persistence Editing (DOPE). DOPE satisfies metric properties, is stable to noise, is as informative as alternative approaches, and efficiently computable. Satisfying these properties simultaneously makes DOPE of interest to both theoreticians and data scientists alike.

On The Total Set Chromatic Number Of Graphs, Mark Anthony C. Tolentino, Gerone Russel J. Eugenio, Mari-Jo P. Ruiz

Theory & Applications of Graphs

Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χ_s(G) of a graph G is the minimum number of colors required in a set coloring of G. In this work, we investigate a total analog of set colorings; that is, we study set colorings of the total graph of graphs. Given a graph G = (V, E) …

Finding Approximate Pythagorean Triples (And Applications To Lego Robot Building), Ronald I. Greenberg, Matthew Fahrenbacher, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This assignment combines programming and data analysis to determine good combinations of side lengths that approximately satisfy the Pythagorean Theorem for right triangles. This can be a standalone exercise using a wide variety of programming languages, but the results are useful for determining good ways to assemble LEGO pieces in robot construction, so the exercise can serve to integrate three different units of the Exploring Computer Science high school curriculum: "Programming", "Computing and Data Analysis", and "Robotics". Sample assignment handouts are provided for both Scratch and Java programmers. Ideas for several variants of the assignment are also provided.

Using Magic To Teach Computer Programming, Dale F. Reed, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Magic can be used in project-based instruction to motivate students and provide a meaningful context for learning computer programming. This work describes several magic programs of the “Choose a Number” and “Pick a Card” varieties, making connections to underlying computing concepts.

Magic tricks presented as demonstrations and programming assignments elicit wonder and captivate students’ attention, so that students want to understand and replicate the work to show it to friends and family members. Capturing student interest and curiosity motivates them to learn the underlying programming concepts.

Two “Choose a Number” programs are shown where the computer is able to identify …

How To Detect The Fundamental Frequency: Approach Motivated By Soft Computing And Computational Complexity, Eric Freudenthal, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Psychologists have shown that most information about the mood and attitude of a speaker is carried by the lowest (fundamental) frequency. Because of this frequency's importance, even when the corresponding Fourier component is weak, the human brain reconstruct this frequency based on higher harmonics. The problems is that many people lack this ability. To help them better understand moods and attitudes in social interaction, it is therefore desirable to come up with devices and algorithms that would reconstruct the fundamental frequency. In this paper, we show that ideas from soft computing and computational complexity can be used for this purpose.

Why Time Seems To Pass Slowly For Unpleasant Experiences And Quickly For Pleasant Experiences: An Explanation Based On Decision Theory, Laxman Bokati, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that our perception of time depends on our level of happiness: time seems to pass slower when we have unpleasant experiences and faster if our experiences are pleasant. Several explanations have been proposed for this effect. However, these explanations are based on specific features of human memory and/or human perception, features that, in turn, need explaining. In this paper, we show that this effect can be explained on a much more basic level of decision theory, without utilizing any specific features of human memory or perception.

Monotonic Bit-Invariant Permutation-Invariant Metrics On The Set Of All Infinite Binary Sequences, Irina Padilla, Vladik Kreinovich

Departmental Technical Reports (CS)

In a computer, all the information about an object is described by a sequence of 0s and 1s. At any given moment of time, we only have partial information, but as we perform more measurements and observations, we get longer and longer sequence that provides a more and more accurate description of the object. In the limit, we get a perfect description by an infinite binary sequence. If the objects are similar, measurement results are similar, so the resulting binary sequences are similar. Thus, to gauge similarity of two objects, a reasonable idea is to define an appropriate metric on …

Physical Trajectories Are Smooth, With Velocities At Least As Continuous As Brownian Motion, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

The fact that the kinetic energy of a particle cannot exceed its overall energy implies that the velocity -- i.e. the derivative of the trajectory -- should be bounded. This means, in effect, that all the trajectories are differentiable (smooth). However, at first glance, there seems to be no direct requirement that the velocities continuously depend on time. In this paper, we show that the properties of electromagnetic field necessitate that the velocities are continuous functions of time -- moreover, that they are at least as continuous as the Brownian motion.

Why Would Anyone Invest In A High-Risk Low-Profit Enterprise?, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Strangely enough, investors invest in high-risk low-profit enterprises as well. At first glance, this seems to contradict common sense and financial basics. However, we show that such investments make perfect sense as long as the related risks are independent from the risks of other investments. Moreover, we show that an optimal investment portfolio should allocate some investment to this enterprise.

Why Rectified Power (Repu) Activation Functions Are Efficient In Deep Learning: A Theoretical Explanation, Laxman Bokati, Vladik Kreinovich, Joseph Baca, Natasha Rovelli

Departmental Technical Reports (CS)

At present, the most efficient machine learning techniques is deep learning, with neurons using Rectified Linear (ReLU) activation function s(z) = max(0,z), in many cases, the use of Rectified Power (RePU) activation functions (s(z))^p -- for some p -- leads to better results. In this paper, we explain these results by proving that RePU functions (or their "leaky" versions) are optimal with respect that all reasonable optimality criteria.

Over-Measurement Paradox: Suspension Of Thermonuclear Research Center And Need To Update Standards, Hector Reyes, Saeid Tizpaz-Niari, Vladik Kreinovich

Departmental Technical Reports (CS)

In general, the more measurements we perform, the more information we gain about the system and thus, the more adequate decisions we will be able to make. However, in situations when we perform measurements to check for safety, the situation is sometimes opposite: the more additional measurements we perform beyond what is required, the worse the decisions will be: namely, the higher the chance that a perfectly safe system will be erroneously classified as unsafe and therefore, unnecessary additional features will be added to the system design. This is not just a theoretical possibility: exactly this phenomenon is one of …

Everyone Is Above Average: Is It Possible? Is It Good?, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

Starting with the 1980s, a popular US satirical radio show described a fictitious town Lake Wobegon where ``all children are above average'' -- parodying the way parents like to talk about their children. This everyone-above-average situation was part of the fiction since, if we interpret the average in the precise mathematical sense, as average over all the town's children, then such a situation is clearly impossible. However, usually, when parents make this claim, they do not mean town-wise average, they mean average over all the kids with whom their child directly interacts. Somewhat surprisingly, it turns out that if we …

Why Shapley Value And Its Variants Are Useful In Machine Learning (And In Other Applications), Laxman Bokati, Olga Kosheleva, Vladik Kreinovich, Nguye Ngoc Thach

Departmental Technical Reports (CS)

Shapley value -- a useful way to allocate gains in cooperative games -- has been very successful in machine learning (and in other applications beyond cooperative games). This success is somewhat puzzling, since the usual derivation of the Shapley value is based on requirements like additivity that are natural in cooperative games and but not ents like additivity and is, thus, applicable in the machine learning case as well.

Development Of The Implementation Of Iot Monitoring System Based On Node-Red Technology, Anvar Kabulov, Inomjon Yarashov, Salamat Mirzataev

Karakalpak Scientific Journal

This article describes how to design and implement a process for storing environmental information in a database using the Internet of Things. The problems that need to be solved with the help of this IoT system are the growing demand for forecasts in the world, the demand of the world market for a new sustainable method of implementing the digitization environment through the Internet of Things. The design was implemented using Arduino, Node-Red and sensors, selected when choosing a component based on the required parameters and sent to the database for monitoring and processing. A study of previous work and …

Using Graph Theoretical Methods And Traceroute To Visually Represent Hidden Networks, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

Within the scope of a Wide Area Network (WAN), a large geographical communication network in which a collection of networking devices communicate data to each other, an example being the spanning communication network, known as the Internet, around continents. Within WANs exists a collection of Routers that transfer network packets to other devices. An issue pertinent to WANs is their immeasurable size and density, as we are not sure of the amount, or the scope, of all the devices that exists within the network. By tracing the routes and transits of data that traverses within the WAN, we can identify …

(R1881) Impatient Customers In Queueing System With Optional Vacation Policies And Power Saving Mode, Poonam Gupta, Rajni Gupta, Sangeeta Malik

Applications and Applied Mathematics: An International Journal (AAM)

In this manuscript, a queueing system with two optional vacation policies, power-saving mode under reneging and retention of reneged customers in both vacations is analyzed. If the server is free, it chooses either of the vacations, classical vacation or working vacation. During vacations, the customers may get impatient due to delays and may leave the system, but they are retained in the system with some convincing mechanisms. On vacation completion, if the system is empty, the server is turned off to facilitate better utilization of the resources. Some of the operating system characteristics are derived using the probability generating functions …

Analysis Of A Quantum Attack On The Blum-Micali Pseudorandom Number Generator, Tingfei Feng

Mathematical Sciences Technical Reports (MSTR)

In 2012, Guedes, Assis, and Lula proposed a quantum attack on a pseudorandom number generator named the Blum-Micali Pseudorandom number generator. They claimed that the quantum attack can outperform classical attacks super-polynomially. However, this paper shows that the quantum attack cannot get the correct seed and provides another corrected algorithm that is in exponential time but still faster than the classical attack. Since the original classical attacks are in exponential time, the Blum-Micali pseudorandom number generator would be still quantum resistant.

Why Flash Radiotherapy Is Efficient: A Possible Explanation, Julio Urenda, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong

Departmental Technical Reports (CS)

Usually, a cancer radiotherapy session lasts between 10 to 20 minutes. Technically, it is possible to transmit the dose faster, but traditionally, medical doctors were reluctant to do it, since they were afraid of negative effects of such a speedy treatment. Recent experiments show, however, that these fears are unfounded; moreover, transmitting the whole radiation dose in a shorter time turns out to be more beneficial for the patients. In this paper, we provide a possible geometric explanation for this empirical phenomenon.

Why Rejuvenation Attempts Often Lead To Cancer And Why Cyclic Rejuvenation Is Better: A Simple Qualitative Explanation, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Since the 1960s, biologists have shown that, contrary to the previous belief that ageing is irreversible, many undesirable biological effects of ageing can be reversed. First attempts to perform this reversal on living creatures were not fully successful: while mice achieved some rejuvenation, many of these rejuvenated mice developed cancer. Later experiments showed that these cancers can be avoided if we apply cyclic rejuvenation: a short period of rejuvenation followed by a longer pause. This modified strategy led to recent successes of mice that recovered their age-deteriorated vision and mice that recovered their heart tissue after a heart attack. However, …

Computational Paradox Of Deep Learning: A Qualitative Explanation, Jonatan Contreras, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong

Departmental Technical Reports (CS)

In general, the more unknowns in a problem, the more computational efforts is necessary to find all these unknowns. Interestingly, in state-of-the-art machine learning methods like deep learning, computations become easier when we increase the number of unknown parameters way beyond the number of equations. In this paper, we provide a qualitative explanation for this computational paradox.

Efficient Algorithms For Data Processing Under Type-3 (And Higher) Fuzzy Uncertainty, Vladik Kreinovich, Olga Kosheleva, Patricia Melin, Oscar Castillo

Departmental Technical Reports (CS)

It is known that to more adequately describe expert knowledge, it is necessary to go from the traditional (type-1) fuzzy techniques to higher order ones: type-2, probably type-3 and even higher. Until recently, only type-1 and type-2 fuzzy sets were used in practical applications. However, lately, it turned out that type-3 fuzzy sets are also useful in some applications. Because of this practical importance, it is necessary to design efficient algorithms for data processing under such type-3 (and higher order) fuzzy uncertainty. In this paper, we show how we can combine known efficient algorithms for processing type-1 and type-2 uncertainty …