Computer Sciences Commons^™

A Study On The Effects Of Mutation On Populations Using Strategies While Playing Iterative Prisoner's Dilemma, Ramses Romulus De Guzman Reyes

Theses and Dissertations

This thesis examines the effects different types of mutation and mutation rates have on populations using strategies while playing the Iterative Prisoners Dilemma (IPD). The system used in order to conduct this study was used in Leas et al. (2016), which uses genetic algorithms as a means of studying memory and its impact on populations playing IPD. For this study, experiments are organized into three different environments: Control, Static and Dynamic. The Control Environment focuses on analyzing the system and forming initial results. The Static Environment focuses on studying the effects of different rates on strategic populations playing IPD, while …

Impact Of Artificial Intelligence, Robotics, And Machine Learning On Sales And Marketing, Keng Siau, Y. Yang

Research Collection School Of Computing and Information Systems

AI, robotics, and machine learning are impacting the field of sales and marketing in an unprecedented way. A perfect storm is brewing! On one hand, online retail stores like Amazon are crushing the bricks and mortar stores. Sales and marketing professionals in bricks and mortar stores are facing a grim future. On the other hand, AI, robotics, and machine learning are replacing sales and marketing professionals in online stores. In fact, salespersons and marketers are predicted to be among the first to be replaced by robots. In a face-to-face environment, human may still prefer to interact with another human. In …

Machine Learning Csc 461, Amanda Izenstark

Library Impact Statements

No abstract provided.

A Sandbox In Which To Learn And Develop Soar Agents, Daniel Lugo

Theses and Dissertations

It is common for military personnel to leverage simulations (and simulators) as cost-effective tools to train and become proficient at various tasks (e.g., flying an aircraft and/or performing a mission, among others). These training simulations often need to represent humans within the simulated world in a realistic manner. Realistic implies creating simulated humans that exhibit behaviors that mimic real-world decision making and actions. Typically, to create the decision-making logic, techniques developed from the domain of artificial intelligence are used. Although there are several approaches to developing intelligent agents; we focus on leveraging and open source project called Soar, to define …

Playful Ai Education, Todd W. Neller

Computer Science Faculty Publications

In this talk, Neller shared how games can serve as a fun means of teaching not only game-tree search in Artificial Intelligence (AI), but also such diverse topics as constraint satisfaction, logical reasoning, planning, uncertain reasoning, machine learning, and robotics. He observed that teachers teach best when they enjoy what they share and encouraged AI educators present to teach to their unique strengths and enthusiasms.

Streaming Classification With Emerging New Class By Class Matrix Sketching, Xin Mu, Feida Zhu, Juan Du, Ee-Peng Lim, Zhi-Hua Zhou

Research Collection School Of Computing and Information Systems

Streaming classification with emerging new class is an important problem of great research challenge and practical value. In many real applications, the task often needs to handle large matrices issues such as textual data in the bag-of-words model and large-scale image analysis. However, the methodologies and approaches adopted by the existing solutions, most of which involve massive distance calculation, have so far fallen short of successfully addressing a real-time requested task. In this paper, the proposed method dynamically maintains two low-dimensional matrix sketches to 1) detect emerging new classes; 2) classify known classes; and 3) update the model in the …

Collective Multiagent Sequential Decision Making Under Uncertainty, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Multiagent sequential decision making has seen rapid progress with formal models such as decentralized MDPs and POMDPs. However, scalability to large multiagent systems and applicability to real world problems remain limited. To address these challenges, we study multiagent planning problems where the collective behavior of a population of agents affects the joint-reward and environment dynamics. Our work exploits recent advances in graphical models for modeling and inference with a population of individuals such as collective graphical models and the notion of finite partial exchangeability in lifted inference. We develop a collective decentralized MDP model where policies can be computed based …

Recurrent Neural Networks With Auxiliary Labels For Cross-Domain Opinion Target Extraction, Ying Ding, Jianfei Yu, Jing Jiang

Research Collection School Of Computing and Information Systems

Opinion target extraction is a fundamental task in opinion mining. In recent years, neural network based supervised learning methods have achieved competitive performance on this task. However, as with any supervised learning method, neural network based methods for this task cannot work well when the training data comes from a different domain than the test data. On the other hand, some rule-based unsupervised methods have shown to be robust when applied to different domains. In this work, we use rule-based unsupervised methods to create auxiliary labels and use neural network models to learn a hidden representation that works well for …

Enhanced Prediction Of Network Attacks Using Incomplete Data, Jacob D. Arthur

CCAC Theses and Dissertations

For years, intrusion detection has been considered a key component of many organizations’ network defense capabilities. Although a number of approaches to intrusion detection have been tried, few have been capable of providing security personnel responsible for the protection of a network with sufficient information to make adjustments and respond to attacks in real-time. Because intrusion detection systems rarely have complete information, false negatives and false positives are extremely common, and thus valuable resources are wasted responding to irrelevant events. In order to provide better actionable information for security personnel, a mechanism for quantifying the confidence level in predictions is …

Learning Conditional Preference Networks From Optimal Choices, Cory Siler

Theses and Dissertations--Computer Science

Conditional preference networks (CP-nets) model user preferences over objects described in terms of values assigned to discrete features, where the preference for one feature may depend on the values of other features. Most existing algorithms for learning CP-nets from the user's choices assume that the user chooses between pairs of objects. However, many real-world applications involve the the user choosing from all combinatorial possibilities or a very large subset. We introduce a CP-net learning algorithm for the latter type of choice, and study its properties formally and empirically.

Special Issue: Neutrosophic Theories Applied In Engineering, Florentin Smarandache, Jun Ye

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic sets and logic are generalizations of fuzzy and intuitionistic fuzzy sets and logic. Neutrosophic sets and logic are gaining significant attention in solving many real life decision making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistent, and indeterminacy. They have been applied in computational intelligence, multiple criteria decision making, image processing, medical diagnoses, etc. This Special Issue presents original research papers that report on state-of-the-art and recent advancements in neutrosophic sets and logic in soft computing, artificial intelligence, big and small data mining, decision making problems, and practical achievements.

Adapting The Search Space While Limiting Damage During Learning In A Simulated Flapping Wing Micro Air Vehicle, Monica Sam

Browse all Theses and Dissertations

Cyber-Physical Systems (CPS) are characterized by closely coupled physical and software components that operate simultaneously on different spatial and temporal scales; exhibit multiple and distinct behavioral modalities; and interact with one another in ways not entirely predictable at the time of design. A commonly appearing type of CPS are systems that contain one or more smart components that adapt locally in response to global measurements of whole system performance. An example of a smart component robotic CPS system is a Flapping Wing Micro Air Vehicle (FW-MAV) that contains wing motion oscillators that control their wing flapping patterns to enable the …

Human-Intelligence/Machine-Intelligence Decision Governance: An Analysis From Ontological Point Of View, Faisal Mahmud, Teddy Steven Cotter

Engineering Management & Systems Engineering Faculty Publications

The increasing CPU power and memory capacity of computers, and now computing appliances, in the 21st century has allowed accelerated integration of artificial intelligence (AI) into organizational processes and everyday life. Artificial intelligence can now be found in a wide range of organizational processes including medical diagnosis, automated stock trading, integrated robotic production systems, telecommunications routing systems, and automobile fuzzy logic controllers. Self-driving automobiles are just the latest extension of AI. This thrust of AI into organizations and everyday life rests on the AI community’s unstated assumption that “…every aspect of human learning and intelligence could be so precisely described …

The Habits Of Highly Effective Researchers: An Empirical Study, Subhajit Datta, Partha Basuchowdhuri, Surajit Acharya, Subhashis Majumder

Research Collection School Of Computing and Information Systems

Interest in the habits of influential individuals cuts across domains. As researchers, we are intrigued why few attain significant eminence in their fields, whereas many operate in obscurity. An empirical examination of this question has been made possible by the recent availability of large scale publication data. In this paper, we use information from the AMiner Paper Citation and Author Collaboration Networks to discern factors that relate to the impact of influential researchers across five domains in the computing discipline. We propose and apply a novel algorithm to identify influential vertices in co-authorship networks built from total corpora of 1,00,000+papers …

Aspect-Based Helpfulness Prediction For Online Product Reviews, Yinfei Yang, Cen Chen, Forrest Sheng Bao

Research Collection School Of Computing and Information Systems

Product reviews greatly influence purchase decisions in online shopping. A common burden of online shopping is that consumers have to search for the right answers through massive reviews, especially on popular products. Hence, estimating and predicting the helpfulness of reviews become important tasks to directly improve shopping experience. In this paper, we propose a new approach to helpfulness prediction by leveraging aspect analysis of reviews. Our hypothesis is that a helpful review will cover many aspects of a product at different emphasis levels. The first step to tackle this problem is to extract proper aspects. Because related products share common …

Monte Carlo Approaches To Parameterized Poker Squares, Todd W. Neller, Zuozhi Yang, Colin M. Messinger, Calin Anton, Karo Castro-Wunsch, William Maga, Steven Bogaerts, Robert Arrington, Clay Langely

Computer Science Faculty Publications

The paper summarized a variety of Monte Carlo approaches employed in the top three performing entries to the Parameterized Poker Squares NSG Challenge competition. In all cases AI players benefited from real-time machine learning and various Monte Carlo game-tree search techniques.

Digital Integration, Jacob C. Boccio

USF Tampa Graduate Theses and Dissertations

Artificial intelligence is an emerging technology; something far beyond smartphones, cloud integration, or surgical microchip implantation. Utilizing the work of Ray Kurzweil, Nick Bostrom, and Steven Shaviro, this thesis investigates technology and artificial intelligence through the lens of the cinema. It does this by mapping contemporary concepts and the imagined worlds in film as an intersection of reality and fiction that examines issues of individual identity and alienation. I look at a non-linear timeline of films involving machine advancement, machine intelligence, and stages of post-human development; Elysium (2013) and Surrogates (2009) are about technology as an extension of the self, …

2016-01-A3dsrinp-Csc-Sta-Cmb-522-Bps-542, Raymond Pulver, Neal Buxton, Xiaodong Wang, John Lucci, Jean Yves Hervé, Lenore Martin

Bioinformatics Software Design Projects

Cholesterol is carried and transported through bloodstream by lipoproteins. There are two types of lipoproteins: low density lipoprotein, or LDL, and high density lipoprotein, or HDL. LDL cholesterol is considered “bad” cholesterol because it can form plaque and hard deposit leading to arteries clog and make them less flexible. Heart attack or stroke will happen if the hard deposit blocks a narrowed artery. HDL cholesterol helps to remove LDL from the artery back to the liver.

Traditionally, particle counts of LDL and HDL plays an important role to understanding and prediction of heart disease risk. But recently research suggested that …

Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet

Research Collection School Of Computing and Information Systems

Spatio-temporal matching of services to customers online is a problem that arises on a large scale in many domains associated with shared transportation (ex: taxis, ride sharing, super shuttles, etc.) and delivery services (ex: food, equipment, clothing, home fuel, etc.). A key characteristic of these problems is that matching of services to customers in one round has a direct impact on the matching of services to customers in the next round. For instance, in the case of taxis, in the second round taxis can only pick up customers closer to the drop off point of the customer from the first …

Shortest Path Based Decision Making Using Probabilistic Inference, Akshat Kumar

Research Collection School Of Computing and Information Systems

We present a new perspective on the classical shortest path routing (SPR) problem in graphs. We show that the SPR problem can be recast to that of probabilistic inference in a mixture of simple Bayesian networks. Maximizing the likelihood in this mixture becomes equivalent to solving the SPR problem. We develop the well known Expectation-Maximization (EM) algorithm for the SPR problem that maximizes the likelihood, and show that it does not get stuck in a locally optimal solution. Using the same probabilistic framework, we then address an NP-Hard network design problem where the goal is to repair a network of …

Modeling, Learning And Reasoning About Preference Trees Over Combinatorial Domains, Xudong Liu

Theses and Dissertations--Computer Science

In my Ph.D. dissertation, I have studied problems arising in various aspects of preferences: preference modeling, preference learning, and preference reasoning, when preferences concern outcomes ranging over combinatorial domains. Preferences is a major research component in artificial intelligence (AI) and decision theory, and is closely related to the social choice theory considered by economists and political scientists. In my dissertation, I have exploited emerging connections between preferences in AI and social choice theory. Most of my research is on qualitative preference representations that extend and combine existing formalisms such as conditional preference nets, lexicographic preference trees, answer-set optimization programs, possibilistic …

Automated Conjecturing Approach For Benzenoids, David Muncy

Theses and Dissertations

Benzenoids are graphs representing the carbon structure of molecules, defined by a closed path in the hexagonal lattice. These compounds are of interest to chemists studying existing and potential carbon structures. The goal of this study is to conjecture and prove relations between graph theoretic properties among benzenoids. First, we generate conjectures on upper bounds for the domination number in benzenoids using invariant-defined functions. This work is an extension of the ideas to be presented in a forthcoming paper. Next, we generate conjectures using property-defined functions. As the title indicates, the conjectures we prove are not thought of on our …

Cp-Nets: From Theory To Practice, Thomas E. Allen

Theses and Dissertations--Computer Science

Conditional preference networks (CP-nets) exploit the power of ceteris paribus rules to represent preferences over combinatorial decision domains compactly. CP-nets have much appeal. However, their study has not yet advanced sufficiently for their widespread use in real-world applications. Known algorithms for deciding dominance---whether one outcome is better than another with respect to a CP-net---require exponential time. Data for CP-nets are difficult to obtain: human subjects data over combinatorial domains are not readily available, and earlier work on random generation is also problematic. Also, much of the research on CP-nets makes strong, often unrealistic assumptions, such as that decision variables must …

Using Topic Modelling Algorithms For Hierarchical Activity Discovery, Eoin Rogers, John D. Kelleher, Robert J. Ross

Conference papers

Activity discovery is the unsupervised process of discovering patterns in data produced from sensor networks that are monitoring the behaviour of human subjects. Improvements in activity discovery may simplify the training of activity recognition models by enabling the automated annotation of datasets and also the construction of systems that can detect and highlight deviations from normal behaviour. With this in mind, we propose an approach to activity discovery based on topic modelling techniques, and evaluate it on a dataset that mimics complex, interleaved sensor data in the real world. We also propose a means for discovering hierarchies of aggregated activities …

Pure Fuzzy Hall Effect Sensors For Permanent Magnet Synchronous Motor, İbrahi̇m Alişkan, Rüstem Yilmazel

Turkish Journal of Electrical Engineering and Computer Sciences

An investigation about Hall effect sensors' efficiency is confirmed in permanent magnet synchronous motor (PMSM) drive systems. A fuzzy control algorithm is used as an artificial intelligence controller. Large scale and low slopes are used for creating membership functions and a sensitive controller is obtained. Speed is wanted to be taken under control and a minimum error value is aimed. PMSM drive systems are established using MATLAB-Simulink/SimPower. Simulations are realized with real-time parameters in discrete mode. A fuzzy logic controller is designed by using the MATLAB/Fuzzy Logic Toolbox. A normalization technique and high resolution output of the fuzzy logic controller …

Online Arima Algorithms For Time Series Prediction, Chenghao Liu, Hoi, Steven C. H., Peilin Zhao, Jianling Sun

Research Collection School Of Computing and Information Systems

Autoregressive integrated moving average (ARIMA) is one of the most popular linear models for time series forecasting due to its nice statistical properties and great flexibility. However, its parameters are estimated in a batch manner and its noise terms are often assumed to be strictly bounded, which restricts its applications and makes it inefficient for handling large-scale real data. In this paper, we propose online learning algorithms for estimating ARIMA models under relaxed assumptions on the noise terms, which is suitable to a wider range of applications and enjoys high computational efficiency. The idea of our ARIMA method is to …

Rapture Of The Geeks, Derek Schuurman

Faculty Work Comprehensive List

"If we are more than machines, what is it that defines our humanity? Is it our intelligence, creativity, or emotion?"

Posting about ­­­­­­­­the distinction between humans and artificial creatures from In All Things - an online hub committed to the claim that the life, death, and resurrection of Jesus Christ has implications for the entire world.

http://inallthings.org/the-rapture-of-the-geeks/

The Effectiveness Of Using A Modified “Beat Frequent Pick” Algorithm In The First International Roshambo Tournament, Proceso L. Fernandez Jr, Sony E. Valdez, Generino P. Siddayao

Department of Information Systems & Computer Science Faculty Publications

In this study, a bot is developed to compete in the first International RoShamBo Tournament test suite. The basic “Beat Frequent Pick (BFP)” algorithm was taken from the supplied test suite and was improved by adding a random choice tailored fit against the opponent's distribution of picks. A training program was also developed that finds the best performing bot variant by changing the bot's behavior in terms of the timing of the recomputation of the pick distribution. Simulation results demonstrate the significantly improved performance of the proposed variant over the original BFP. This indicates the potential of using the core …

Message Passing For Collective Graphical Models, Tao Sun, Daniel Sheldon, Akshat Kumar

Research Collection School Of Computing and Information Systems

Collective graphical models (CGMs) are a formalism for inference and learning about a population of independent and identically distributed individuals when only noisy aggregate data are available. We highlight a close connection between approximate MAP inference in CGMs and marginal inference in standard graphical models. The connection leads us to derive a novel Belief Propagation (BP) style algorithm for collective graphical models. Mathematically, the algorithm is a strict generalization of BP—it can be viewed as an extension to minimize the Bethe free energy plus additional energy terms that are non-linear functions of the marginals. For CGMs, the algorithm is much …

Probabilistic Inference Based Message-Passing For Resource Constrained Dcops, Supriyo Ghosh, Akshat Kumar, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Distributed constraint optimization (DCOP) is an important framework for coordinated multiagent decision making. We address a practically useful variant of DCOP, called resource-constrained DCOP (RC-DCOP), which takes into account agents’ consumption of shared limited resources. We present a promising new class of algorithm for RC-DCOPs by translating the underlying co- ordination problem to probabilistic inference. Using inference techniques such as expectation- maximization and convex optimization machinery, we develop a novel convergent message-passing algorithm for RC-DCOPs. Experiments on standard benchmarks show that our approach provides better quality than previous best DCOP algorithms and has much lower failure rate. Comparisons against an …