Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algorithm (1)
- Background Subtraction (1)
- CUDA (1)
- Divide-n-Conquer (1)
- Drug Discovery (1)
-
- Hashing (1)
- Hashing with chaining (1)
- Image Processing (1)
- Linear Integer Arithmetic (1)
- Linear hashing (1)
- Microrobotics (1)
- Molecular Docking (1)
- Multi-Objective Optimization (1)
- Network (1)
- OpenCV (1)
- Parallel Algorithms (1)
- Power of two choices (1)
- Program Synthesis (1)
- Software Development (1)
- Software Simulation (1)
- Stochastic Optimization (1)
- Two choices paradigm (1)
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
A Divide-And-Conquer Approach To Syntax-Guided Synthesis, Peiyuan Shen, Xiaokang Qiu
A Divide-And-Conquer Approach To Syntax-Guided Synthesis, Peiyuan Shen, Xiaokang Qiu
The Summer Undergraduate Research Fellowship (SURF) Symposium
Program synthesis aims to generate programs automatically from user-provided specifications. One critical research thrust is called Syntax-Guideds Synthesis. In addition to semantic specifications, the user should also provide a syntactic template of the desired program, which helps the synthesizer reduce the search space. The traditional symbolic approaches, such as CounterExample-Guided Inductive Synthesis (CEGIS) framework, does not scale to large search spaces. The goal of this project is to explore a compositional, divide-n-conquer approach that heuristically divides the synthesis task into subtasks and solves them separately. The idea is to decompose the function to be synthesized by creating a set of …
Expected Length Of The Longest Chain In Linear Hashing, Pongthip Srivarangkul, Hemanta K. Maji
Expected Length Of The Longest Chain In Linear Hashing, Pongthip Srivarangkul, Hemanta K. Maji
The Summer Undergraduate Research Fellowship (SURF) Symposium
Hash table with chaining is a data structure that chains objects with identical hash values together with an entry or a memory address. It works by calculating a hash value from an input then placing the input in the hash table entry. When we place two inputs in the same entry, they chain together in a linear linked list. We are interested in the expected length of the longest chain in linear hashing and methods to reduce the length because the worst-case look-up time is directly proportional to it.
The linear hash function used to calculate hash value is defined …
Parallelization Of Molecular Docking Algorithms Using Cuda For Use In Drug Discovery, Brandon Stewart, Jonathan Fine, Gaurav Chopra Phd
Parallelization Of Molecular Docking Algorithms Using Cuda For Use In Drug Discovery, Brandon Stewart, Jonathan Fine, Gaurav Chopra Phd
The Summer Undergraduate Research Fellowship (SURF) Symposium
Traditional drug discovery methodology uses a multitude of software packages to design and evaluate new drug-like compounds. While software packages implement a wide variety of methods, the serial (i.e. single core) implementation for many of these algorithms, prohibit large scale docking, such as proteome-wide docking (i.e. thousands of compounds with thousands of proteins). Several docking algorithms can be parallelized, significantly reducing the runtime of the calculations, thus enabling large-scale docking. Implementing algorithms that take advantage of the distributed nature of graphical processing units (GPUs) via the Compute Unified Device Architecture (CUDA) enables us to efficiently implement massively parallel algorithms. Two …
Stochastic Multiple Gradient Decent For Inferring Action-Based Network Generators, Qian Wu, Viplove Arora, Mario Ventresca
Stochastic Multiple Gradient Decent For Inferring Action-Based Network Generators, Qian Wu, Viplove Arora, Mario Ventresca
The Summer Undergraduate Research Fellowship (SURF) Symposium
Networked systems, like the internet, social networks etc., have in recent years attracted the attention of researchers, specifically to develop models that can help us understand or predict the behavior of these systems. A way of achieving this is through network generators, which are algorithms that can synthesize networks with statistically similar properties to a given target network. Action-based Network Generators (ABNG)is one of these algorithms that defines actions as strategies for nodes to form connections with other nodes, hence generating networks. ABNG is parametrized using an action matrix that assigns an empirical probability distribution to vertices for choosing specific …
Improved Microrobotic Control Through Image Processing And Automated Hardware Interfacing, Archit R. Aggarwal, Wuming Jing, David J. Cappelleri
Improved Microrobotic Control Through Image Processing And Automated Hardware Interfacing, Archit R. Aggarwal, Wuming Jing, David J. Cappelleri
The Summer Undergraduate Research Fellowship (SURF) Symposium
Untethered submilliliter-sized robots (microrobots) are showing potential use in different industrial, manufacturing and medical applications. A particular type of these microrobots, magnetic robots, have shown improved performance in power and control capabilities compared to the other thermal and electrostatic based robots. However, the magnetic robot designs have not been assessed in a robust manner to understand the degree of control in different environments and their application feasibility. This research project seeks to develop a custom control software interface to provide a holistic tool for researchers to evaluate the microrobotic performance through advance control features. The software deliverable involved two main …