Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Video games (2)
- Algebras, Linear (1)
- Biomechanics (1)
- Bipedal (1)
- Bitcoin (1)
-
- Blockchain (1)
- Bootstrapping (1)
- Classification (1)
- Cloud computing (1)
- College seniors (1)
- Comparative (1)
- Computer graphics (1)
- Computer programming (1)
- Constant-space algorithm (1)
- Cryptocurrency (1)
- Data centers (1)
- Data encryption (Computer science) (1)
- Database clustering (1)
- Deep learning (1)
- Development horror of video games (1)
- Dynamic networks (1)
- Economy (1)
- Empirical recurrence rates (1)
- Empirical recurrence rates ratios (1)
- Energetics (1)
- Energy efficiency (1)
- Engineering design, contest (1)
- Engineering, studying and teaching (1)
- Family play (1)
- Green computing (1)
Articles 1 - 14 of 14
Full-Text Articles in Physical Sciences and Mathematics
Self-Stabilizing Token Distribution With Constant-Space For Trees, Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
Self-Stabilizing Token Distribution With Constant-Space For Trees, Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
Computer Science Faculty Research
Self-stabilizing and silent distributed algorithms for token distribution in rooted tree networks are given. Initially, each process of a graph holds at most l tokens. Our goal is to distribute the tokens in the whole network so that every process holds exactly k tokens. In the initial configuration, the total number of tokens in the network may not be equal to nk where n is the number of processes in the network. The root process is given the ability to create a new token or remove a token from the network. We aim to minimize the convergence time, the number …
Loosely-Stabilizing Leader Election With Polylogarithmic Convergence Time, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kukugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
Loosely-Stabilizing Leader Election With Polylogarithmic Convergence Time, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kukugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
Computer Science Faculty Research
A loosely-stabilizing leader election protocol with polylogarithmic convergence time in the population protocol model is presented in this paper. In the population protocol model, which is a common abstract model of mobile sensor networks, it is known to be impossible to design a self-stabilizing leader election protocol. Thus, in our prior work, we introduced the concept of loose-stabilization, which is weaker than self-stabilization but has similar advantage as self-stabilization in practice. Following this work, several loosely-stabilizing leader election protocols are presented. The loosely-stabilizing leader election guarantees that, starting from an arbitrary configuration, the system reaches a safe configuration with a …
College Of Engineering Senior Design Competition Fall 2018, University Of Nevada, Las Vegas
College Of Engineering Senior Design Competition Fall 2018, University Of Nevada, Las Vegas
Fred and Harriet Cox Senior Design Competition Projects
Part of every UNLV engineering student’s academic experience, the senior design project stimulates engineering innovation and entrepreneurship. Each student in their senior year chooses, plans, designs, and prototypes a product in this required element of the curriculum. A capstone to the student’s educational career, the senior design project encourages the student to use everything learned in the engineering program to create a practical, real world solution to an engineering challenge. The senior design competition helps focus the senior students in increasing the quality and potential for commercial application for their design projects. Judges from local industry evaluate the projects on …
Review Of: The World Of Scary Video Games: A Study In Videoludic Horror, Approaches To Digital Game Studies, Matthew Murray
Review Of: The World Of Scary Video Games: A Study In Videoludic Horror, Approaches To Digital Game Studies, Matthew Murray
Library Faculty Publications
No abstract provided.
Linking Gait Dynamics To Mechanical Cost Of Legged Locomotion, David V. Lee, Sarah L. Harris
Linking Gait Dynamics To Mechanical Cost Of Legged Locomotion, David V. Lee, Sarah L. Harris
Life Sciences Faculty Research
For millenia, legged locomotion has been of central importance to humans for hunting, agriculture, transportation, sport, and warfare. Today, the same principal considerations of locomotor performance and economy apply to legged systems designed to serve, assist, or be worn by humans in urban and natural environments. Energy comes at a premium not only for animals, wherein suitably fast and economical gaits are selected through organic evolution, but also for legged robots that must carry sufficient energy in their batteries. Although a robot's energy is spent at many levels, from control systems to actuators, we suggest that the mechanical cost of …
Review Of: Families At Play: Connecting And Learning Through Video Games, Matthew Murray
Review Of: Families At Play: Connecting And Learning Through Video Games, Matthew Murray
Library Faculty Publications
No abstract provided.
Mining Association Rules For Low-Frequency Itemsets, Jimmy Ming-Tai Wu, Justin Zhan, Sanket Chobe
Mining Association Rules For Low-Frequency Itemsets, Jimmy Ming-Tai Wu, Justin Zhan, Sanket Chobe
Computer Science Faculty Research
High utility itemset mining has become an important and critical operation in the Data Mining field. High utility itemset mining generates more profitable itemsets and the association among these itemsets, to make business decisions and strategies. Although, high utility is important, it is not the sole measure to decide efficient business strategies such as discount offers. It is very important to consider the pattern of itemsets based on the frequency as well as utility to predict more profitable itemsets. For example, in a supermarket or restaurant, beverages like champagne or wine might generate high utility (profit), but also sell less …
Deep Learning For Link Prediction In Dynamic Networks Using Weak Estimators, Carter Chiu, Justin Zhan
Deep Learning For Link Prediction In Dynamic Networks Using Weak Estimators, Carter Chiu, Justin Zhan
Computer Science Faculty Research
Link prediction is the task of evaluating the probability that an edge exists in a network, and it has useful applications in many domains. Traditional approaches rely on measuring the similarity between two nodes in a static context. Recent research has focused on extending link prediction to a dynamic setting, predicting the creation and destruction of links in networks that evolve over time. Though a difficult task, the employment of deep learning techniques have shown to make notable improvements to the accuracy of predictions. To this end, we propose the novel application of weak estimators in addition to the utilization …
Using Empirical Recurrence Rates Ratio For Time Series Data Similarity, Moinak Bhaduri, Justin Zhan
Using Empirical Recurrence Rates Ratio For Time Series Data Similarity, Moinak Bhaduri, Justin Zhan
Computer Science Faculty Research
Several methods exist in classification literature to quantify the similarity between two time series data sets. Applications of these methods range from the traditional Euclidean type metric to the more advanced Dynamic Time Warping metric. Most of these adequately address structural similarity but fail in meeting goals outside it. For example, a tool that could be excellent to identify the seasonal similarity between two time series vectors might prove inadequate in the presence of outliers. In this paper, we have proposed a unifying measure for binary classification that performed well while embracing several aspects of dissimilarity. This statistic is gaining …
Energy Saving In Data Centers, Wolfgang W. Bein
Energy Saving In Data Centers, Wolfgang W. Bein
Computer Science Faculty Research
Globally CO2 emissions attributable to Information Technology are on par with those resulting from aviation. Recent growth in cloud service demand has elevated energy efficiency of data centers to a critical area within green computing. Cloud computing represents a backbone of IT services and recently there has been an increase in high-definition multimedia delivery, which has placed new burdens on energy resources. Hardware innovations together with energy-efficient techniques and algorithms are key to controlling power usage in an ever-expanding IT landscape. This special issue contains a number of contributions that show that data center energy efficiency should be addressed from …
Linear Algebra Applications In 3d Computer Graphics, Albert A. Antero, Chris Choung, Chris Goff
Linear Algebra Applications In 3d Computer Graphics, Albert A. Antero, Chris Choung, Chris Goff
Math 365 Class Projects
Linear Transformations, Homogenous Coordinates, World Matrix, Project Matrices, Normalized Device Coordinates, View Matrix
Encryption And Decryption Using Matricies, Amit Etiel, James Parsons, Shawn Jenkins-Edwards
Encryption And Decryption Using Matricies, Amit Etiel, James Parsons, Shawn Jenkins-Edwards
Math 365 Class Projects
Mathematician Lester Hill developed the Hill Cipher, the first mathematical encryption method ever developed, in 1929. This method was created in order to strengthen the level of security of previous methods and made it possible to encrypt more than three symbols at a time.
Modeling Programming Language Trends Using Markov Processes, Cody Clymer, Adrian Alberto, Mike Merrill
Modeling Programming Language Trends Using Markov Processes, Cody Clymer, Adrian Alberto, Mike Merrill
Math 365 Class Projects
Which Languages Are Worth Investing In? One of the many issues in the computer science industry is knowing which technologies to invest in. Programming languages are a prime example of these technologies, so investors and innovators need to know which programming languages will grow in use over time so that new businesses can grow alongside them.
Dynamically Adjusting The Mining Capacity In Cryptocurrency With Binary Blockchain, Yoohwan Kim, Ju-Yeon Jo
Dynamically Adjusting The Mining Capacity In Cryptocurrency With Binary Blockchain, Yoohwan Kim, Ju-Yeon Jo
Computer Science Faculty Research
Many cryptocurrencies rely on Blockchain for its operation. Blockchain serves as a public ledger where all the completed transactions can be looked up. To place transactions in the Blockchain, a mining operation must be performed. However, due to a limited mining capacity, the transaction confirmation time is increasing. To mitigate this problem many ideas have been proposed, but they all come with own challenges. We propose a novel parallel mining method that can adjust the mining capacity dynamically depending on the congestion level. It does not require an increase in the block size or a reduction of the block confirmation …