Theory and Algorithms Commons^™

Designing And Comparing Multiple Portfolios 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 …

Robust Partial Order Schedules For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this work, we consider RCPSP/max with durational uncertainty. We focus on computing robust Partial Order Schedules (or, in short POS) which can be executed with risk controlled feasibility and optimality, i.e., there is stochastic posteriori quality guarantee that the derived POS can be executed with all constraints honored and completion before robust makespan. To address this problem, we propose BACCHUS: a solution method on Benders Accelerated Cut Creation for Handling Uncertainty in Scheduling. In our proposed approach, we first give an MILP formulation for the deterministic RCPSP/max and partition the model into POS generation process and start time schedule …

The Contributions Of Anatol Rapoport To Game Theory, Erika Simpson

Political Science Publications

Game theory is used to rationally and dispassionately examine the strategic behaviour of nations, especially superpower behaviour. This article explains how basic game theory - at its simplest level - was used by Anatol Rapoport to generate ideas about how to enhance world peace. Rapoport was at the forefront of the game theoreticians who sought to conceptualize strategies that could promote international cooperation. Accordingly, the basic logic of game theory is explained using the game models of ‘Chicken’ and ‘Prisoner’s Dilemma’. These models were used by Rapoport in his books and lectures in simple and complex ways. Then Rapoport’s revolutionary …

Ant Colony Optimization For Continuous Spaces, Rachel Findley

Computer Science and Computer Engineering Undergraduate Honors Theses

Ant Colony Optimization (ACO) is an optimization algorithm designed to find semi-optimal solutions to Combinatorial Optimization Problems. The challenge of modifying this algorithm to effectively optimize over a continuous domain is one that has been tackled by several researchers. In this paper, ACO has been modified to use several variations of the algorithm for continuous spaces. An aspect of ACO which is crucial to its success when optimizing over a continuous space is choosing the appropriate object (solution component) out of an infinite set to add to the ant's path. This step is highly important in shaping good solutions. Important …

Sparse Feature Learning For Image Analysis In Segmentation, Classification, And Disease Diagnosis., Ehsan Hosseini-Asl

Electronic Theses and Dissertations

The success of machine learning algorithms generally depends on intermediate data representation, called features that disentangle the hidden factors of variation in data. Moreover, machine learning models are required to be generalized, in order to reduce the specificity or bias toward the training dataset. Unsupervised feature learning is useful in taking advantage of large amount of unlabeled data, which is available to capture these variations. However, learned features are required to capture variational patterns in data space. In this dissertation, unsupervised feature learning with sparsity is investigated for sparse and local feature extraction with application to lung segmentation, interpretable deep …

An Arithmetic-Based Deterministic Centroid Initialization Method For The K-Means Clustering Algorithm, Matthew Michael Mayo

Theses and Dissertations

One of the greatest challenges in k-means clustering is positioning the initial cluster centers, or centroids, as close to optimal as possible, and doing so in an amount of time deemed reasonable. Traditional fc-means utilizes a randomization process for initializing these centroids, and poor initialization can lead to increased numbers of required clustering iterations to reach convergence, and a greater overall runtime. This research proposes a simple, arithmetic-based deterministic centroid initialization method which is much faster than randomized initialization. Preliminary experiments suggest that this collection of methods, referred to herein as the sharding centroid initialization algorithm family, often outperforms random …

An Exploration Of Rule Clustering In Cellular Automata Rule Spaces, Jordon Huffman

Theses and Dissertations

The study of complex systems examines the global behavior of a system and how the individual parts of the system affect that behavior [1]. The study of complex systems spans across many fields of science like biology, physics, engineering, and computer science. One area of complex systems that has not been fully explored is cellular automata. Since its discovery by John von Neumann, there have been no consistent ways of categorizing similarities between cellular automata rules or collecting similar rules for observation. This thesis introduces an approach to identifying clusters of similar rules and extracting rules from that cluster. Several …

Online Sparse Passive Aggressive Learning With Kernels, Jing Lu, Peilin Zhao, Hoi, Steven C. H.

Research Collection School Of Computing and Information Systems

Conventional online kernel methods often yield an unboundedlarge number of support vectors, making them inefficient and non-scalable forlarge-scale applications. Recent studies on bounded kernel-based onlinelearning have attempted to overcome this shortcoming. Although they can boundthe number of support vectors at each iteration, most of them fail to bound thenumber of support vectors for the final output solution which is often obtainedby averaging the series of solutions over all the iterations. In this paper, wepropose a novel kernel-based online learning method, Sparse Passive Aggressivelearning (SPA), which can output a final solution with a bounded number ofsupport vectors. The key idea of …

A Core Task Abstraction Approach To Hierarchical Reinforcement Learning [Extended Abstract], Zhuoru Li, Akshay Narayan, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

We propose a new, core task abstraction (CTA) approach to learning the relevant transition functions in model-based hierarchical reinforcement learning. CTA exploits contextual independences of the state variables conditional on the task-specific actions; its promising performance is demonstrated through a set of benchmark problems.

A Horizon Decomposition Approach For The Capacitated Lot-Sizing Problem With Setup Times, Ioannis Fragkos, Zeger Degraeve, Bert De Reyck

Research Collection Lee Kong Chian School Of Business

We introduce horizon decomposition in the context of Dantzig-Wolfe decomposition, and apply it to the capacitated lot-sizing problem with setup times. We partition the problem horizon in contiguous overlapping intervals and create subproblems identical to the original problem, but of smaller size. The user has the flexibility to regulate the size of the master problem and the subproblem via two scalar parameters. We investigate empirically which parameter configurations are efficient, and assess their robustness at different problem classes. Our branch-and-price algorithm outperforms state-of-the-art branch-and-cut solvers when tested to a new data set of challenging instances that we generated. Our methodology …

Deeper Look Into Bug Fixes: Patterns, Replacements, Deletions, And Additions, Mauricio Soto, Ferdian Thung, Chu-Pan Wong, Claire Le Goues, David Lo

Research Collection School Of Computing and Information Systems

Many implementations of research techniques that automatically repair software bugs target programs written in C. Work that targets Java often begins from or compares to direct translations of such techniques to a Java context. However, Java and C are very different languages, and Java should be studied to inform the construction of repair approaches to target it. We conduct a large-scale study of bugfixing commits in Java projects, focusing on assumptions underlying common search-based repair approaches. We make observations that can be leveraged to guide high quality automatic software repair to target Java specifically, including common and uncommon statement modifications …

A Study Of Android Malware Detection Techniques And Machine Learning, Balaji Baskaran, Anca Ralescu

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

Android OS is one of the widely used mobile Operating Systems. The number of malicious applications and adwares are increasing constantly on par with the number of mobile devices. A great number of commercial signature based tools are available on the market which prevent to an extent the penetration and distribution of malicious applications. Numerous researches have been conducted which claims that traditional signature based detection system work well up to certain level and malware authors use numerous techniques to evade these tools. So given this state of affairs, there is an increasing need for an alternative, really tough malware …

Extended Pixel Representation For Image Segmentation, Deeptha Girish, Vineeta Singh, Anca Ralescu

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

We explore the use of extended pixel representation for color based image segmentation using the K-means clustering algorithm. Various extended pixel representations have been implemented in this paper and their results have been compared. By extending the representation of pixels an image is mapped to a higher dimensional space. Unlike other approaches, where data is mapped into an implicit features space of higher dimension (kernel methods), in the approach considered here, the higher dimensions are defined explicitly. Preliminary experimental results which illustrate the proposed approach are promising.

An Autonomic Computing System Based On A Rule-Based Policy Engine And Artificial Immune Systems, Rahmira Rufus, William Nick, Joseph Shelton, Albert Esterline

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

Autonomic computing systems arose from the notion that complex computing systems should have properties like those of the autonomic nervous system, which coordinates bodily functions and allows attention to be directed to more pressing needs. An autonomic system allows the system administrator to specify high-level policies, which the system maintains without administrator assistance. Policy enforcement can be done with a rule based system such as Jess (a java expert system shell). An autonomic system must be able to monitor itself, and this is often a limiting factor. We are developing an automatic system that has a policy engine and uses …

Towards The Development Of A Cyber Analysis & Advisement Tool (Caat) For Mitigating De-Anonymization Attacks, Siobahn Day, Henry Williams, Joseph Shelton, Gerry Dozier

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

We are seeing a rise in the number of Anonymous Social Networks (ASN) that claim to provide a sense of user anonymity. However, what many users of ASNs do not know that a person can be identified by their writing style.

In this paper, we provide an overview of a number of author concealment techniques, their impact on the semantic meaning of an author's original text, and introduce AuthorCAAT, an application for mitigating de-anonymization attacks. Our results show that iterative paraphrasing performs the best in terms of author concealment and performs well with respect to Latent Semantic Analysis.

Situations And Evidence For Identity Using Dempster-Shafer Theory, William Nick, Yenny Dominguez, Albert Esterline

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

We present a computational framework for identity based on Barwise and Devlin’s situation theory. We present an example with constellations of situations identifying an individual to create what we call id-situations, where id-actions are performed, along with supporting situations. We use Semantic Web standards to represent and reason about the situations in our example. We show how to represent the strength of the evidence, within the situations, as a measure of the support for judgments reached in the id-situation. To measure evidence of an identity from the supporting situations, we use the Dempster-Shafer theory of evidence. We enhance Dempster- Shafer …

Student Understanding And Engagement In A Class Employing Comps Computer Mediated Problem Solving: A First Look, Jung Hee Kim, Michael Glass, Taehee Kim, Kelvin Bryant, Angelica Willis, Ebonie Mcneil, Zachery Thomas

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

COMPS computer-mediated group discussion exercises are being added to a second-semester computer programming class. The class is a gateway for computer science and computer engineering students, where many students have difficulty succeeding well enough to proceed in their major. This paper reports on first results of surveys on student experience with the exercises. It also reports on the affective states observed in the discussions that are candidates for analysis of group functioning. As a step toward computer monitoring of the discussions, an experiment in using dialogue features to identify the gender of the participants is described.

A Tool For Staging Mixed-Initiative Dialogs, Joshua W. Buck, Saverio Perugini

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

We discuss and demonstrate a tool for prototyping dialog-based systems that, given a high-level specification of a human-computer dialog, stages the dialog for interactive use. The tool enables a dialog designer to evaluate a variety of dialogs without having to program each individual dialog, and serves as a proof-of-concept for our approach to mixed-initiative dialog modeling and implementation from a programming language-based perspective.

Keynote Talk 2: Social And Perceptual Fidelity Of Avatars And Autonomous Agents In Virtual Reality, Benjamin Kunz

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

Advances in display, computing and sensor technologies have led to a revival of interest and excitement surrounding immersive virtual reality. Here, on the cusp of the arrival of practical and affordable virtual reality technology, are open questions regarding the factors that contribute to compelling and immersive virtual worlds.

In order for virtual reality to be useful as a tool for use in training, education, communication, research, content-creation and entertainment, we must understand the degree to which the perception of the virtual environment and virtual characters resembles perception of the real world.

Relatedly, virtual reality's utility in these contexts demands evidence …

Exploring Web-Based Visual Interfaces For Searching Research Articles On Digital Library Systems, Maxwell Fowler, Chris Bellis, Chris Perry, Beomjin Kim

MAICS: The Modern Artificial Intelligence and Cognitive Science Conference

Previous studies that present information archived in digital libraries have used either document meta-data or document content. The current search mechanisms commonly return text-based results that were compiled from the meta-data without reflecting the underlying content. Visual analytics is a possible solution for improving searches by presenting a large amount of information, including document content alongside meta-data, in a limited screen space. This paper introduces a multi-tiered visual interface for searching research articles stored in Digital Library systems. The goals of this system are to allow users to find research papers about their interests in a large work space, to …