Algorithm Selection Via Ranking, 2015 Singapore Management University
Algorithm Selection Via Ranking, Jayadi Oentaryo Richard, Handoko Stephanus Daniel, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The abundance of algorithms developed to solve different problems has given rise to an important research question: How do we choose the best algorithm for a given problem? Known as algorithm selection, this issue has been prevailing in many domains, as no single algorithm can perform best on all problem instances. Traditional algorithm selection and portfolio construction methods typically treat the problem as a classification or regression task. In this paper, we present a new approach that provides a more natural treatment of algorithm selection and portfolio construction as a ranking task. Accordingly, we develop a Ranking-Based Algorithm Selection (RAS) …
Research Agenda Into Human-Intelligence/Machine-Intelligence Governance, 2015 Old Dominion University
Research Agenda Into Human-Intelligence/Machine-Intelligence Governance, Teddy Steven Cotter
Engineering Management & Systems Engineering Faculty Publications
Since the birth of modern artificial intelligence (AI) at the 1956 Dartmouth Conference, the AI community has pursued modeling and coding of human intelligence into AI reasoning processes (HI Þ MI). The Dartmouth Conference's fundamental assertion was that every aspect of human learning and intelligence could be so precisely described that it could be simulated in AI. With the exception of knowledge specific areas (such as IBM's Big Blue and a few others), sixty years later the AI community is not close to coding global human intelligence into AI. In parallel, the knowledge management (KM) community has pursued understanding of …
A Comparison Of Cloud Computing Database Security Algorithms, 2015 University of North Florida
A Comparison Of Cloud Computing Database Security Algorithms, Joseph A. Hoeppner
UNF Graduate Theses and Dissertations
The cloud database is a relatively new type of distributed database that allows companies and individuals to purchase computing time and memory from a vendor. This allows a user to only pay for the resources they use, which saves them both time and money. While the cloud in general can solve problems that have previously been too costly or time-intensive, it also opens the door to new security problems because of its distributed nature. Several approaches have been proposed to increase the security of cloud databases, though each seems to fall short in one area or another.
This thesis presents …
Natural Language Processing For Foreign Language Learning, 2015 Ouachita Baptist University
Natural Language Processing For Foreign Language Learning, Jacob Kausler
Honors Theses
This research presents novel algorithms which generate sentences in a natural language, using natural language generation techniques. The purpose of the algorithms is to benefit foreign language learning. As far as we can tell, ours is the first such research being done in the field. In creating the algorithms, we also developed a piece of software to showcase the work and allow testing by users. The main algorithm begins by generating sentence models by using one of two methods, namely modeled sentence generation and semantic sentence generation. Each of these have benefits and drawbacks, which the user must take into …
A Dynamic Programming Algorithm For Finding The Optimal Placement Of A Secondary Structure Topology In Cryo-Em Data, 2015 Old Dominion University
A Dynamic Programming Algorithm For Finding The Optimal Placement Of A Secondary Structure Topology In Cryo-Em Data, Abhishek Biswas, Desh Ranjan, Mohammad Zubair, Jing He
Computer Science Faculty Publications
The determination of secondary structure topology is a critical step in deriving the atomic structures from the protein density maps obtained from electron cryomicroscopy technique. This step often relies on matching the secondary structure traces detected from the protein density map to the secondary structure sequence segments predicted from the amino acid sequence. Due to inaccuracies in both sources of information, a pool of possible secondary structure positions needs to be sampled. One way to approach the problem is to first derive a small number of possible topologies using existing matching algorithms, and then find the optimal placement for each …
Knotswithstanding!, 2015 Rhode Island College
Knotswithstanding!, Erik S. Nestor
Honors Projects
Knotswithstanding! is an internet based application built using HTML5, CSS, and JavaScript. It is a pedagogical utility that facilitates the construction and analysis of mathematical knots, as well as the demonstration of knot theory fundamentals. It uses a "stick based" tile layout system, allowing a user to draw a knot by dragging the mouse pointer across a grid. Once a knot is complete, functionality is available to check for validity, identify the number of crossings, and determine other invariants including tricolorability and Dowker notation. It features 500 iterable storage banks, and functionality for a sequence of knot renderings to be …
Learning Emotions: A Software Engine For Simulating Realistic Emotion In Artificial Agents, 2015 The College of Wooster
Learning Emotions: A Software Engine For Simulating Realistic Emotion In Artificial Agents, Douglas Code
Senior Independent Study Theses
This paper outlines a software framework for the simulation of dynamic emotions in simulated agents. This framework acts as a domain-independent, black-box solution for giving actors in games or simulations realistic emotional reactions to events. The emotion management engine provided by the framework uses a modified Fuzzy Logic Adaptive Model of Emotions (FLAME) model, which lets it manage both appraisal of events in relation to an individual’s emotional state, and learning mechanisms through which an individual’s emotional responses to a particular event or object can change over time. In addition to the FLAME model, the engine draws on the design …
Spiking Neural Networks: Neuron Models, Plasticity, And Graph Applications, 2015 Virginia Commonwealth University
Spiking Neural Networks: Neuron Models, Plasticity, And Graph Applications, Shaun Donachy
Theses and Dissertations
Networks of spiking neurons can be used not only for brain modeling but also to solve graph problems. With the use of a computationally efficient Izhikevich neuron model combined with plasticity rules, the networks possess self-organizing characteristics. Two different time-based synaptic plasticity rules are used to adjust weights among nodes in a graph resulting in solutions to graph prob- lems such as finding the shortest path and clustering.
Operator Calculus Algorithms For Multi-Constrained Paths, 2015 MEDIATRON - SupCom Tunis, Tunisia
Operator Calculus Algorithms For Multi-Constrained Paths, Jamila Ben Slimane, Rene' Schott, Ye Qiong Song, G. Stacey Staples, Evangelia Tsiontsiou
SIUE Faculty Research, Scholarship, and Creative Activity
Classical approaches to multi-constrained routing problems generally require construction of trees and the use of heuristics to prevent combinatorial explosion. Introduced here is the notion of constrained path algebras and their application to multi-constrained path problems. The inherent combinatorial properties of these algebras make them useful for routing problems by implicitly pruning the underlying tree structures. Operator calculus (OC) methods are generalized to multiple non-additive constraints in order to develop algorithms for the multi constrained path problem and multi constrained optimization problem. Theoretical underpinnings are developed first, then algorithms are presented. These algorithms demonstrate the tremendous simplicity, flexibility and speed …
Sorting By Block Moves, 2015 University of North Florida
Sorting By Block Moves, Jici Huang
UNF Graduate Theses and Dissertations
The research in this thesis is focused on the problem of Block Sorting, which has applications in Computational Biology and in Optical Character Recognition (OCR). A block in a permutation is a maximal sequence of consecutive elements that are also consecutive in the identity permutation. BLOCK SORTING is the process of transforming an arbitrary permutation to the identity permutation through a sequence of block moves. Given an arbitrary permutation π and an integer m, the Block Sorting Problem, or the problem of deciding whether the transformation can be accomplished in at most m block moves has been shown to be …
De Novo Protein Structure Modeling And Energy Function Design, 2015 Old Dominion University
De Novo Protein Structure Modeling And Energy Function Design, Lin Chen
Computer Science Theses & Dissertations
The two major challenges in protein structure prediction problems are (1) the lack of an accurate energy function and (2) the lack of an efficient search algorithm. A protein energy function accurately describing the interaction between residues is able to supervise the optimization of a protein conformation, as well as select native or native-like structures from numerous possible conformations. An efficient search algorithm must be able to reduce a conformational space to a reasonable size without missing the native conformation. My PhD research studies focused on these two directions.
A protein energy function—the distance and orientation dependent energy function of …
An Adaptive Gradient Method For Online Auc Maximization, 2015 Nanyang Technological University, Singapore
An Adaptive Gradient Method For Online Auc Maximization, Yi Ding, Peilin Zhao, Steven C. H. Hoi, Yew-Soon Ong
Research Collection School Of Computing and Information Systems
Learning for maximizing AUC performance is an important research problem in machine learning. Unlike traditional batch learning methods for maximizing AUC which often suffer from poor scalability, recent years have witnessed some emerging studies that attempt to maximize AUC by single-pass online learning approaches. Despite their encouraging results reported, the existing online AUC maximization algorithms often adopt simple stochastic gradient descent approaches, which fail to exploit the geometry knowledge of the data observed in the online learning process, and thus could suffer from relatively slow convergence. To overcome the limitation of the existing studies, in this paper, we propose a …
Designing A Portfolio Of Parameter Configurations For Online Algorithm Selection, 2015 Singapore Management University
Designing A Portfolio Of Parameter Configurations For Online Algorithm Selection, Aldy Gunawan, Hoong Chuin Lau, Mustafa Misir
Research Collection School Of Computing and Information Systems
Algorithm portfolios seek to determine an effective set of algorithms that can be used within an algorithm selection framework to solve problems. A limited number of these portfolio studies focus on generating different versions of a target algorithm using different parameter configurations. In this paper, we employ a Design of Experiments (DOE) approach to determine a promising range of values for each parameter of an algorithm. These ranges are further processed to determine a portfolio of parameter configurations, which would be used within two online Algorithm Selection approaches for solving different instances of a given combinatorial optimization problem effectively. We …
Voting Rules As Error Correcting Codes, 2014 Carnegie Mellon University
Voting Rules As Error Correcting Codes, Nisarg Shah, Ariel Procaccia, Yair Zick
Yair Zick
No abstract provided.
Cepsim: A Simulator For Cloud-Based Complex Event Processing, 2014 Western University
Cepsim: A Simulator For Cloud-Based Complex Event Processing, Wilson Higashino, Miriam Capretz, Luiz Bittencourt
Wilson A Higashino
As one of the Vs defining Big Data, data velocity brings many new challenges to traditional data processing approaches. The adoption of cloud environments in complex event processing (CEP) systems is a recent architectural style that aims to overcome these challenges. Validating cloud-based CEP systems at the required Big Data scale, however, is often a laborious, error-prone, and expensive task. This article presents CEPSim, a new simulator that has been developed to facilitate this validation process. CEPSim extends CloudSim, an existing cloud simulator, with an application model based on directed acyclic graphs that is used to represent continuous CEP queries. …
Constraint Answer Set Programming Versus Satisfiability Modulo Theories Or Constraints Versus Theories, 2014 University of Nebraska at Omaha
Constraint Answer Set Programming Versus Satisfiability Modulo Theories Or Constraints Versus Theories, Yuliya Lierler, Benjamin Susman
Yuliya Lierler
Computing Intersection Multiplicity Via Triangular Decomposition, 2014 The University of Western Ontario
Computing Intersection Multiplicity Via Triangular Decomposition, Paul Vrbik
Electronic Thesis and Dissertation Repository
Fulton’s algorithm is used to calculate the intersection multiplicity of two plane curves about a rational point. This work extends Fulton’s algorithm first to algebraic points (encoded by triangular sets) and then, with some generic assumptions, to l many hypersurfaces.
Out of necessity, we give a standard-basis free method (i.e. practically efficient method) for calculating tangent cones at points on curves.
Recommender Systems Research: A Connection-Centric Survey, 2014 University of Dayton
Recommender Systems Research: A Connection-Centric Survey, Saverio Perugini, Marcos André Gonçalves, Edward A. Fox
Saverio Perugini
Recommender systems attempt to reduce information overload and retain customers by selecting a subset of items from a universal set based on user preferences. While research in recommender systems grew out of information retrieval and filtering, the topic has steadily advanced into a legitimate and challenging research area of its own. Recommender systems have traditionally been studied from a content-based filtering vs. collaborative design perspective. Recommendations, however, are not delivered within a vacuum, but rather cast within an informal community of users and social context. Therefore, ultimately all recommender systems make connections among people and thus should be surveyed from …
Automatically Generating Interfaces For Personalized Interaction With Digital Libraries, 2014 University of Dayton
Automatically Generating Interfaces For Personalized Interaction With Digital Libraries, Saverio Perugini, Naren Ramakrishnan, Edward A. Fox
Saverio Perugini
We present an approach to automatically generate interfaces supporting personalized interaction with digital libraries; these interfaces augment the user-DL dialog by empowering the user to (optionally) supply out-of-turn information during an interaction, flatten or restructure the dialog, and inquire about dialog options. Interfaces generated using this approach for CITIDEL are described.
Symbolic Links In The Open Directory Project, 2014 University of Dayton
Symbolic Links In The Open Directory Project, Saverio Perugini
Saverio Perugini
We present a study to develop an improved understanding of symbolic links in web directories. A symbolic link is a hyperlink that makes a directed connection from a web page along one path through a directory to a page along another path. While symbolic links are ubiquitous in web directories such as Yahoo!, they are under-studied, and as a result, their uses are poorly understood. A cursory analysis of symbolic links reveals multiple uses: to provide navigational shortcuts deeper into a directory, backlinks to more general categories, and multiclassification. We investigated these uses in the Open Directory Project (ODP), the …