Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 11 of 11
Full-Text Articles in Physical Sciences and Mathematics
A Parallelized Implementation Of Cut-And-Solve And A Streamlined Mixed-Integer Linear Programming Model For Finding Genetic Patterns Optimally Associated With Complex Diseases, Michael Yip-Hin Chan
A Parallelized Implementation Of Cut-And-Solve And A Streamlined Mixed-Integer Linear Programming Model For Finding Genetic Patterns Optimally Associated With Complex Diseases, Michael Yip-Hin Chan
Theses
With the advent of genetic sequencing, there was much hope of finding the inherited elements underlying complex diseases, such as late-onset Alzheimer’s disease (AD), but it has been a challenge to fully uncover the necessary information hidden in the data. A likely contributor to this failure is the fact that the pathogenesis of most complex diseases does not involve single markers working alone, but patterns of genetic markers interacting additively or epistatically. But as we move upwards beyond patterns of size two, it quickly becomes computationally infeasible to examine all combinations in the solution space. A common solution to solving …
Efficient Algorithm For Solving 3sum Problem, Muhamed Retkoceri
Efficient Algorithm For Solving 3sum Problem, Muhamed Retkoceri
International Journal of Business and Technology
In this paper is presented an algorithm for solving 3SUM problem efficiently in general computation model. The algorithm is based on sorting and splits the task into sub-tasks where this approach enables the algorithm to run concurrently at the high-level of computing. The algorithm is O(n2) and running sequentially achieves at least ~1/5 n2 number of basic necessary accesses of data structures. In this paper is also presented a comparison of running performances in practice between the new algorithm and the current most famous algorithm for 3SUM which is in-place and also based on sorting.
The Moving Object Reflected Under Matlab Test-Bench (Simulation Model Through Buit-In Functions), Virtyt Lesha, Jozef Bushati, Dea Strica
The Moving Object Reflected Under Matlab Test-Bench (Simulation Model Through Buit-In Functions), Virtyt Lesha, Jozef Bushati, Dea Strica
UBT International Conference
Digital image processing is an area that finds many applications in three-dimensional graphics. One of the subjects considered in image processing is detection of moving objects. In this paper, we have analyzed the performance of an algorithm that detects a moving object. The performance relates to the speed of moving object during a pre-determined time interval. The methodology supports Matlab integrated with built-in functions. Specifically, as input of the simulation model is a video material containing moving objects. The model reads a video file presenting moving objects; after the model is executed in Matlab, the output emits moving objects associated …
Efficiency Of Calculating Gcd Through Computer With Help Of Modified Euclidean Algorithm, Emin Emini, Azir Jusufi, Ruhada Emini
Efficiency Of Calculating Gcd Through Computer With Help Of Modified Euclidean Algorithm, Emin Emini, Azir Jusufi, Ruhada Emini
UBT International Conference
Euclid’s algorithm remains to be the most efficient method for finding greatest common divisor of two full numbers. By using the meaning of congruences this research paper will make a modification in the note of the Euclid’s algorithm. Here are discussed both classic and modified methods, by putting appropriate codes and observe the duration of the calculation through the computer.
Inexact And Nonlinear Extensions Of The Feast Eigenvalue Algorithm, Brendan E. Gavin
Inexact And Nonlinear Extensions Of The Feast Eigenvalue Algorithm, Brendan E. Gavin
Doctoral Dissertations
Eigenvalue problems are a basic element of linear algebra that have a wide variety of applications. Common examples include determining the stability of dynamical systems, performing dimensionality reduction on large data sets, and predicting the physical properties of nanoscopic objects. Many applications require solving large dimensional eigenvalue problems, which can be very challenging when the required number of eigenvalues and eigenvectors is also large. The FEAST algorithm is a method of solving eigenvalue problems that allows one to calculate large numbers of eigenvalue/eigenvector pairs by using contour integration in the complex plane to divide the large number of desired pairs …
Deep Machine Learning For Mechanical Performance And Failure Prediction, Elijah Reber, Nickolas D. Winovich, Guang Lin
Deep Machine Learning For Mechanical Performance And Failure Prediction, Elijah Reber, Nickolas D. Winovich, Guang Lin
The Summer Undergraduate Research Fellowship (SURF) Symposium
Deep learning has provided opportunities for advancement in many fields. One such opportunity is being able to accurately predict real world events. Ensuring proper motor function and being able to predict energy output is a valuable asset for owners of wind turbines. In this paper, we look at how effective a deep neural network is at predicting the failure or energy output of a wind turbine. A data set was obtained that contained sensor data from 17 wind turbines over 13 months, measuring numerous variables, such as spindle speed and blade position and whether or not the wind turbine experienced …
An Algorithmic Approach To Creating Effective Study Groups Using A Smart Phone App, Kelvin J. Rosado-Ayala
An Algorithmic Approach To Creating Effective Study Groups Using A Smart Phone App, Kelvin J. Rosado-Ayala
Honors College Theses
For many students entering college, meeting new people and studying are a common struggle. Study groups are generally recommended, especially if the groups are comprised of members with complementary personality traits. But the challenge still remains, how do freshmen or transfer students find and form these heterogeneous study groups. In order to help alleviate this issue, an Android application was developed to automatically create study groups for students. Using basic information provided by students upon registration, the algorithm is able to automatically find matching group members. The application was designed using an agile life cycle model over the course of …
Distributed K-Nearest Neighbor Queries In Metric Spaces, Xin Ding, Yuanliang Zhang, Lu Chen, Yunjun Gao, Baihua Zheng
Distributed K-Nearest Neighbor Queries In Metric Spaces, Xin Ding, Yuanliang Zhang, Lu Chen, Yunjun Gao, Baihua Zheng
Research Collection School Of Computing and Information Systems
Metric k nearest neighbor (MkNN) queries have applications in many areas such as multimedia retrieval, computational biology, and location-based services. With the growing volumes of data, a distributed method is required. In this paper, we propose an Asynchronous Metric Distributed System (AMDS), which uniformly partitions the data with the pivot-mapping technique to ensure the load balancing, and employs publish/subscribe communication model to asynchronously process large scale of queries. The employment of asynchronous processing model also improves robustness and efficiency of AMDS. In addition, we develop an efficient estimation based MkNN method using AMDS to improve the query efficiency. Extensive experiments …
Effects Of Dynamic Goals On Agent Performance, Nathan R. Ball
Effects Of Dynamic Goals On Agent Performance, Nathan R. Ball
Theses and Dissertations
Autonomous systems are increasingly being used for complex tasks in dynamic environments. Robust automation needs to be able to establish its current goal and determine when the goal has changed. In human-machine teams autonomous goal detection is an important component of maintaining shared situational awareness between both parties. This research investigates how different categories of goals affect autonomous change detection in a dynamic environment. In order to accomplish this goal, a set of autonomous agents were developed to perform within an environment with multiple possible goals. The agents perform the environmental task while monitoring for goal changes. The experiment tests …
Finding Spanning Trees In Strongly Connected Graphs With Per-Vertex Degree Constraints, Samuel Benjamin Chase
Finding Spanning Trees In Strongly Connected Graphs With Per-Vertex Degree Constraints, Samuel Benjamin Chase
Computer Science and Software Engineering
In this project, I sought to develop and prove new algorithms to create spanning trees on general graphs with per-vertex degree constraints. This means that each vertex in the graph would have some additional value, a degree constraint d. For a spanning tree to be correct, every vertex vi in the spanning tree must have a degree exactly equal to a degree constraint di. This poses an additional constraint on what would otherwise be a trivial spanning tree problem. In this paper, two proofs related to my studies will be discussed and analyzed, leading to my algorithm …
Understanding The Effects Of Taxi Ride-Sharing: A Case Study Of Singapore, Yazhe Wang, Baihua Zheng, Ee Peng Lim
Understanding The Effects Of Taxi Ride-Sharing: A Case Study Of Singapore, Yazhe Wang, Baihua Zheng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
This paper studies the effects of ride-sharing among those calling on taxis in Singapore for similar origin and destination pairs at nearly the same time of day. It proposes a simple yet practical framework for taxi ride-sharing and scheduling, to reduce waiting times and travel times during peak demand periods. The solution method helps taxi users save money while helping taxi drivers serve multiple requests per day, thus increasing their earnings. A comprehensive simulation study is conducted, based on real taxi booking data for the city of Singapore, to evaluate the effect of various factors of the ride-sharing practice, e.g., …