Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (458)
- Computer Engineering (300)
- Databases and Information Systems (266)
- Electrical and Computer Engineering (236)
- Social and Behavioral Sciences (217)
-
- Information Security (205)
- Software Engineering (170)
- Numerical Analysis and Scientific Computing (166)
- Mathematics (94)
- Life Sciences (87)
- Artificial Intelligence and Robotics (85)
- Programming Languages and Compilers (81)
- Communication (75)
- Graphics and Human Computer Interfaces (74)
- Theory and Algorithms (73)
- Law (71)
- Other Computer Sciences (71)
- OS and Networks (70)
- Computer Law (67)
- Legal Studies (65)
- Education (64)
- Forensic Science and Technology (64)
- Business (63)
- Physics (55)
- Statistics and Probability (55)
- Medicine and Health Sciences (46)
- Bioinformatics (40)
- Sociology (37)
- Institution
-
- Singapore Management University (361)
- TÜBİTAK (121)
- Missouri University of Science and Technology (111)
- University of Nebraska - Lincoln (73)
- Embry-Riddle Aeronautical University (71)
-
- Edith Cowan University (68)
- Purdue University (64)
- Brigham Young University (56)
- Wright State University (53)
- Old Dominion University (49)
- University of Texas at El Paso (46)
- California Polytechnic State University, San Luis Obispo (41)
- City University of New York (CUNY) (41)
- Marquette University (40)
- San Jose State University (40)
- Clemson University (35)
- Nova Southeastern University (32)
- Dartmouth College (24)
- University of Nebraska at Omaha (24)
- University for Business and Technology in Kosovo (22)
- University of Nevada, Las Vegas (21)
- Wayne State University (21)
- Utah State University (20)
- Southwestern Oklahoma State University (18)
- Portland State University (16)
- University of Texas at Arlington (16)
- Air Force Institute of Technology (15)
- Technological University Dublin (15)
- University of Central Florida (15)
- Minnesota State University, Mankato (13)
- Keyword
-
- Applied sciences (40)
- Security (31)
- Data mining (25)
- Machine learning (22)
- Big data (19)
-
- Digital forensics (19)
- Social media (18)
- Privacy (17)
- Algorithms (16)
- Classification (16)
- Education (16)
- Optimization (16)
- Android (15)
- Twitter (14)
- Authentication (12)
- Cloud computing (12)
- Computer science (12)
- Online learning (12)
- Visualization (12)
- Clustering (10)
- Image processing (10)
- Mobile (10)
- Technology (10)
- Wireless sensor networks (10)
- Genetic algorithm (9)
- [RSTDPub] (9)
- AHRC New York City (8)
- Community Engagement (8)
- Computer vision (8)
- Department of Computer Science and Engineering (8)
- Publication
-
- Research Collection School Of Computing and Information Systems (345)
- Turkish Journal of Electrical Engineering and Computer Sciences (121)
- Theses and Dissertations (52)
- Journal of Digital Forensics, Security and Law (50)
- The R Journal (47)
-
- Open Access Theses (37)
- Master's Projects (36)
- Computer Science Faculty Research & Creative Works (33)
- Departmental Technical Reports (CS) (33)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (33)
- Journal of Undergraduate Research (32)
- Computer Science Faculty Publications (31)
- CCAC Theses and Dissertations (30)
- Research outputs 2014 to 2021 (25)
- Kno.e.sis Publications (24)
- Electrical and Computer Engineering Faculty Research & Creative Works (23)
- All Theses (22)
- Computer Science Technical Reports (22)
- Electronic Theses and Dissertations (22)
- Dissertations, Theses, and Capstone Projects (20)
- Master's Theses (20)
- Physics Faculty Research & Creative Works (20)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (19)
- Oklahoma Research Day Abstracts (18)
- Annual ADFSL Conference on Digital Forensics, Security and Law (17)
- Doctoral Dissertations (17)
- Computer Science and Engineering Faculty Publications (16)
- Open Access Dissertations (16)
- All Graduate Theses and Dissertations, Spring 1920 to Summer 2023 (14)
- Australian Digital Forensics Conference (14)
- Publication Type
- File Type
Articles 511 - 540 of 1965
Full-Text Articles in Computer Sciences
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the tasks for large DOPs, the multi-agent reinforcement learning (MARL) framework is adopted wherein an agent is used to learn the performance of each distinct task using reinforcement learning. To coordinate MARL, we propose a novel coordination strategy integrating Motivated Learning (ML) …
Unleashing Dec-Mdps In Security Games: Enabling Effective Defender Teamwork, Eric Shieh, Albert Jiang, Amulya Yadav, Pradeep Reddy Varakantham, Milind Tambe
Unleashing Dec-Mdps In Security Games: Enabling Effective Defender Teamwork, Eric Shieh, Albert Jiang, Amulya Yadav, Pradeep Reddy Varakantham, Milind Tambe
Research Collection School Of Computing and Information Systems
Multiagent teamwork and defender-attacker security games are two areas that are currently receiving significant attention within multiagent systems research. Unfortunately, despite the need for effective teamwork among multiple defenders, little has been done to harness the teamwork research in security games. This paper is the first to remedy this situation by integrating the powerful teamwork mechanisms offered by Dec-MDPs into security games. We offer the following novel contributions in this paper: (i) New models of security games where a defender team’s pure strategy is defined as a DecMDP policy for addressing coordination under uncertainty; (ii) New algorithms based on column …
A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau
A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper presents a generalization of the Orienteering Problem, the Time-Dependent Orienteering Problem (TDOP) which is based on the real-life application of providing automatic tour guidance to a large leisure facility such as a theme park. In this problem, the travel time between two nodes depends on the time when the trip starts. We formulate the problem as an integer linear programming (ILP) model. We then develop various heuristics in a step by step fashion: greedy construction, local search and variable neighborhood descent, and two versions of iterated local search. The proposed metaheuristics were tested on modified benchmark instances, randomly …
Guest Editors Introduction: Extreme Data, Manish Parashar, George K. Thiruvathukal
Guest Editors Introduction: Extreme Data, Manish Parashar, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
The guest editors discuss work that can accelerate insights from extreme data, from innovative algorithmic formulations to implementation frameworks and software stacks.
Problems In The Theory Of Convergence Spaces, Daniel R. Patten
Problems In The Theory Of Convergence Spaces, Daniel R. Patten
Dissertations - ALL
We investigate several problems in the theory of convergence spaces: generalization of Kolmogorov separation from topological spaces to convergence spaces, representation of reflexive digraphs as convergence spaces, construction of differential calculi on convergence spaces, mereology on convergence spaces, and construction of a universal homogeneous pretopological space. First, we generalize Kolmogorov separation from topological spaces to convergence spaces; we then study properties of Kolmogorov spaces. Second, we develop a theory of reflexive digraphs as convergence spaces, which we then specialize to Cayley graphs. Third, we conservatively extend the concept of differential from the spaces of classical analysis to arbitrary convergence spaces; …
Non-Learning Semantic Analysis For Context Discovery And Sentiment Estimation: Transportation Application, Himanshu Verma
Non-Learning Semantic Analysis For Context Discovery And Sentiment Estimation: Transportation Application, Himanshu Verma
UNLV Theses, Dissertations, Professional Papers, and Capstones
With enormous amount of linguistic data present on web, text analysis has become one of the major fields of interest today. This field includes sentiment analysis, information retrieval, text document classification, knowledge based modeling, content similarity measure, data clustering, words prediction/correction, decision making etc. Managing and processing such data has vital importance. The field being quite broad, our focus is mainly on transportation related social media(Twitter) data extraction, text categorization/classification which can be further sub-divided into concept discovery, word sense disambiguation and sentiment analysis to analyze performance of existing transportation system worldwide. Concept discovery is the method of extracting the …
A Palm Vein Identification System Based On Gabor Wavelet Features, Ran Wang, Guoyou Wang, Zhong Chen, Zhigang Zeng, Yong Wang
A Palm Vein Identification System Based On Gabor Wavelet Features, Ran Wang, Guoyou Wang, Zhong Chen, Zhigang Zeng, Yong Wang
Research Collection School Of Computing and Information Systems
As a new and promising biometric feature, thermal palm vein pattern has drawn lots of attention in research and application areas. Many algorithms have been proposed for authentication since palm vein has special characteristics, such as liveness detection and hard to forgery. However, the detection accuracy of palm vein quite depends on the preprocessing and feature representation, which is supposed to be translation and rotation invariant to some extent. In this paper, we proposed an effective method for palm vein identification based on Gabor wavelet features which contains five steps: image acquisition, ROI detection, image preprocessing, features extraction, and matching. …
Pathway Pioneer: Heterogeneous Server Architecture For Scientific Visualization And Pathway Search In Metabolic Network Using Informed Search, Vipul Kantilal Oswal
Pathway Pioneer: Heterogeneous Server Architecture For Scientific Visualization And Pathway Search In Metabolic Network Using Informed Search, Vipul Kantilal Oswal
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
PathwayPioneer is a website to visualize the biological models. The complex metabolic models are hard to perceive when read through text format. It is even more difficult to understand the flow of network and different subsystem or pathways. PathwayPioneer organizes different subsystems into simple graphical representation. We simplify the complex network based on subsystem and compartment. Users can do computation (flux balance analysis) through the user interface and perceive the changed model visually. Our system is one of its kind to handle large model files with quick response time.
Biologists are often interested in knowing different alternative pathways targeting a …
Multi-Scale Modeling Of Microbial Defection In The Presence Of Antibiotics, Darshan Dilip Nahar
Multi-Scale Modeling Of Microbial Defection In The Presence Of Antibiotics, Darshan Dilip Nahar
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Limited environmental resources push life into competition. In terms of microbes, we assume that the only goal is to grow and competition means to grow faster than the peers. Organisms tend to adapt to their environmental conditions and improve their efficiency in using the common resources to grow faster. While different organisms compete they engage into various social behaviors like cooperation to work together towards a common goal, e.g., production of public goods that benefits the entire population. Hence a part of the resources at hand is dedicated to participate in cooperative activities if the cost-to-benefit ratio is less than …
Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain
Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain
Research Collection School Of Computing and Information Systems
We study the problem of online multitask learning for solving multiple related classification tasks in parallel, aiming at classifying every sequence of data received by each task accurately and efficiently. One practical example of online multitask learning is the micro-blog sentiment detection on a group of users, which classifies micro-blog posts generated by each user into emotional or non-emotional categories. This particular online learning task is challenging for a number of reasons. First of all, to meet the critical requirements of online applications, a highly efficient and scalable classification solution that can make immediate predictions with low learning cost is …
Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li
Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li
Research Collection School Of Computing and Information Systems
Kernel-based regression represents an important family of learning techniques for solving challenging regression tasks with non-linear patterns. Despite being studied extensively, most of the existing work suffers from two major drawbacks: (i) they are often designed for solving regression tasks in a batch learning setting, making them not only computationally inefficient and but also poorly scalable in real-world applications where data arrives sequentially; and (ii) they usually assume a fixed kernel function is given prior to the learning task, which could result in poor performance if the chosen kernel is inappropriate. To overcome these drawbacks, this paper presents a novel …
Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao
Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao
Research Collection School Of Computing and Information Systems
In this paper we study how to summarize travel-related information in forum threads to generate supplementary travel guides. Such summaries presumably can provide additional and more up-to-date information to tourists. Existing multi-document summarization methods have limitations for this task because (1) they do not generate structured summaries but travel guides usually follow a certain template, and (2) they do not put emphasis on named entities but travel guides often recommend points of interest to travelers. To overcome these limitations, we propose to use a latent variable model to align forum threads with the section structure of well-written travel guides. The …
Jointly Modeling Aspects, Ratings And Sentiments For Movie Recommendation (Jmars), Qiming Diao, Minghui Qiu, Chao-Yuan Wu, Alexander J. Smola, Jing Jiang, Chong Wang
Jointly Modeling Aspects, Ratings And Sentiments For Movie Recommendation (Jmars), Qiming Diao, Minghui Qiu, Chao-Yuan Wu, Alexander J. Smola, Jing Jiang, Chong Wang
Research Collection School Of Computing and Information Systems
Recommendation and review sites offer a wealth of information beyond ratings. For instance, on IMDb users leave reviews, commenting on different aspects of a movie (e.g. actors, plot, visual effects), and expressing their sentiments (positive or negative) on these aspects in their reviews. This suggests that uncovering aspects and sentiments will allow us to gain a better understanding of users, movies, and the process involved in generating ratings. The ability to answer questions such as “Does this user care more about the plot or about the special effects?” or ”What is the quality of the movie in terms of acting?” …
Automatic Fine-Grained Issue Report Reclassification, Pavneet Singh Kochhar, Ferdian Thung, David Lo
Automatic Fine-Grained Issue Report Reclassification, Pavneet Singh Kochhar, Ferdian Thung, David Lo
Research Collection School Of Computing and Information Systems
Issue tracking systems are valuable resources during software maintenance activities. These systems contain different categories of issue reports such as bug, request for improvement (RFE), documentation, refactoring, task etc. While logging issue reports into a tracking system, reporters can indicate the category of the reports. Herzig et al. Recently reported that more than 40% of issue reports are given wrong categories in issue tracking systems. Among issue reports that are marked as bugs, more than 30% of them are not bug reports. The misclassification of issue reports can adversely affects developers as they then need to manually identify the categories …
Gta-M: Greedy Trajectory-Aware (M Copies) Routing For Airborne Networks, Xiaoping Ma, Hwee Xian Tan, Alvin C. Valera
Gta-M: Greedy Trajectory-Aware (M Copies) Routing For Airborne Networks, Xiaoping Ma, Hwee Xian Tan, Alvin C. Valera
Research Collection School Of Computing and Information Systems
Airborne networks have potential applications in both civilian and military domains - such as passenger in-flight Internet connectivity, air traffic control and in intelligence, surveillance and reconnaissance (ISR) activities. However, airborne networks suffer from frequent disruptions due to high node mobility, ad hoc connectivity and line-of-sight blockages. These challenges can be alleviated through the use of disruption-tolerant networking (DTN) techniques. In this paper, we propose GTA-m, a multi-copy greedy trajectory-aware routing protocol for airborne networks. GTA-m employs DTN capabilities and exploits the use of flight information to forwarded bundles greedily to intended destination(s). To alleviate the local minima issues that …
On Macro And Micro Exploration Of Hashtag Diffusion In Twitter, Yazhe Wang, Baihua Zheng
On Macro And Micro Exploration Of Hashtag Diffusion In Twitter, Yazhe Wang, Baihua Zheng
Research Collection School Of Computing and Information Systems
This exploratory work studies hashtag diffusion in Twitter. The analysis is conducted from two aspects. From the macro perspective, we study general properties of hashtag diffusion, and classify hashtags into three main classes based on their temporal dynamics referred as 'single spike', 'multi-spikes', and 'fluctuation', and find that each of these classes has some unique characteristics. From the micro perspective, we investigate individual diffusion.We adopt Edelman's 'topology of influence' theory to identify four type of users with different influence levels in diffusion based on their dynamic retweet behaviors. The results of our study are useful for gaining more insights of …
Managing Complexity Through Selective Decoupling, C. Jason Woodard, Eric K. Clemons
Managing Complexity Through Selective Decoupling, C. Jason Woodard, Eric K. Clemons
Research Collection School Of Computing and Information Systems
Designers of complex systems are often confounded by the tendency for design changes to increase performance on some dimensions while decreasing it on others. While adopting a more modular architecture may temper these opposing effects, modularization can also deprive designers of opportunities to harness complementarities among system elements. This paper explores this tension using an NK model in which product designers can modify the structure of their fitness landscapes by suppressing or restoring interactions between components. We find that these changes can lead to improved performance by flattening harmful interactions that would otherwise cause search efforts to become trapped on …
The Learning Curves In Open-Source Software (Oss) Development Network, Youngsoo Kim, Lingxiao Jiang
The Learning Curves In Open-Source Software (Oss) Development Network, Youngsoo Kim, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
We examine the learning curves of individual software developers in Open-Source Software (OSS) Development. We collected the dataset of multi-year code change histories from the repositories for five open source software projects involving more than 100 developers. We build and estimate regression models to assess individual developers' learning progress (in reducing the likelihood they may make a bug). Our estimation results show that developer's coding experience does not decrease bug ratios while cumulative bug-fixing experience leads to learning progress. The results may have implications and provoke future research on project management about allocating resources on tasks that add new code …
Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu
Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu
Research Collection School Of Computing and Information Systems
For better viral marketing, there has been a lot of research on social influence maximization. However, the problem that who is influenced and how diverse the influenced population is, which is important in real-world marketing, has largely been neglected. To that end, in this paper, we propose to consider the magnitude of influence and the diversity of the influenced crowd simultaneously. Specifically, we formulate it as an optimization problem, i.e., diversified social influence maximization. First, we present a general framework for this problem, under which we construct a class of diversity measures to quantify the diversity of the influenced crowd. …
An Empirical Study Of Off-Line Configuration And On-Line Adaptation In Operator Selection, Zhi Yuan, Stephanus Daniel Handoko, Duc Thien Nguyen, Hoong Chuin Lau
An Empirical Study Of Off-Line Configuration And On-Line Adaptation In Operator Selection, Zhi Yuan, Stephanus Daniel Handoko, Duc Thien Nguyen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Automating the process of finding good parameter settings is important in the design of high-performing algorithms. These automatic processes can generally be categorized into off-line and on-line methods. Off-line configuration consists in learning and selecting the best setting in a training phase, and usually fixes it while solving an instance. On-line adaptation methods on the contrary vary the parameter setting adaptively during each algorithm run. In this work, we provide an empirical study of both approaches on the operator selection problem, explore the possibility of varying parameter value by a non-adaptive distribution tuned off-line, and incorporate the off-line with on-line …
Hybrid Metaheuristics For Solving The Quadratic Assignment Problem And The Generalized Quadratic Assignment Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau
Hybrid Metaheuristics For Solving The Quadratic Assignment Problem And The Generalized Quadratic Assignment Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper presents a hybrid metaheuristic for solving the Quadratic Assignment Problem (QAP). The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) to construct an initial solution, and then using a hybrid Simulated Annealing and Tabu Search (SA-TS) algorithm to further improve the solution. Experimental results show that the hybrid metaheuristic is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time. The proposed algorithm is extended to solve the Generalized Quadratic Assignment Problem (GQAP), with an emphasis on modelling and solving a practical problem, namely an examination timetabling problem. We found that …
Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau
Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The patrol scheduling problem is concerned with assigning security teams to different stations for distinct time intervals while respecting a limited number of contractual constraints. The objective is to minimise the total distance travelled while maximising the coverage of the stations with respect to their security requirement levels. This paper introduces a hyper-heuristic strategy focusing on generating diverse solutions for a bi-objective patrol scheduling problem. While a variety of hyper-heuristics have been applied to a large suite of problem domains usually in the form of single-objective optimisation, we suggest an alternative approach for solving the patrol scheduling problem with two …
Automated Prediction Of Glasgow Outcome Scale For Traumatic Brain Injury, Bolan Su, Thien Anh Dinh, A. K. Ambastha, Tianxia Gong, Tomi Silander, Shijian Lu, C. C. Tchoyoson Lim, Boon Chuan Pang, Cheng Kiang Lee, Tze-Yun Leong, Chew Lim Tan
Automated Prediction Of Glasgow Outcome Scale For Traumatic Brain Injury, Bolan Su, Thien Anh Dinh, A. K. Ambastha, Tianxia Gong, Tomi Silander, Shijian Lu, C. C. Tchoyoson Lim, Boon Chuan Pang, Cheng Kiang Lee, Tze-Yun Leong, Chew Lim Tan
Research Collection School Of Computing and Information Systems
Clinical features found in brain CT scan images are widely used in traumatic brain injury (TBI) as indicators for Glasgow Outcome Scale (GOS) prediction. However, due to the lack of automated methods to measure and quantify the CT scan image features, the computerized prediction of GOS in TBI has not been well studied. This paper introduces an automated GOS prediction system for traumatic brain CT images. Different from most existing systems that perform the prognosis based on pre-processed data, our system directly works on brain CT scan images based on the image features. Our system can also be extended to …
Urban Planning Process: Can Technology Enhance Participatory Communication?, Rojin Vishkaie, Richard Levy, Anthony Tang
Urban Planning Process: Can Technology Enhance Participatory Communication?, Rojin Vishkaie, Richard Levy, Anthony Tang
Research Collection School Of Computing and Information Systems
Oftentimes, within the urban planning process, urban planners and GIS experts must work together using desktop Computer-Aided Design (CAD) and Geographic Information System (GIS). However, participatory communication and visualization which are important in the urban planning process, are not a central focus in the design of current computer-aided planning technologies. This study tends to provide an understanding of technological challenges and complexities urban planners and GIS experts encounter while engaging in a participatory environment during the urban planning process. This study also explores the perceptions of urban planners and GIS experts about the potential impact and usefulness of interactive surfaces …
Guest Editorial: Special Issue On Brain Inspired Models Of Cognitive Memory, Huajin Tang, Kiruthika Ramanathan, Ning Nign
Guest Editorial: Special Issue On Brain Inspired Models Of Cognitive Memory, Huajin Tang, Kiruthika Ramanathan, Ning Nign
Research Collection School Of Computing and Information Systems
Current memory technologies have experienced significant progress in terms of storage capacity, operation speed, integration capability, etc. However, their functions are highly constrained in storing and transferring data in space and time, prompting the need for improvement. In contrast to physical memories, the biological counterpart – cognitive memory – has versatile functions. For instance, human memory stores data associatively such that different modalities of data could be retrieved simultaneously; it can learn different concepts, categorize and store them in an organized manner; it can process and store data concurrently and in a distributed fashion; it can restore content even if …
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the tasks for large DOPs, the multi-agent reinforcement learning (MARL) framework is adopted wherein an agent is used to learn the performance of each distinct task using reinforcement learning. To coordinate MARL, we propose a novel coordination strategy integrating Motivated Learning (ML) …
Multi-Valued Argumentation Frameworks, Pierpaolo Dondio
Multi-Valued Argumentation Frameworks, Pierpaolo Dondio
Conference papers
In this paper we explore how the seminal Dung’s abstract argumentation framework can be extended to handle arguments containing gradual concepts. We allow arguments to have a degree of truth associated with them and we investigate the degree of truth to which each argument can be considered accepted, rejected and undecided by an abstract argumentation semantics. We propose a truth-compositional recursive computation, and we discuss examples using the major multi-valued logics such as Godel’s, Zadeh’s and Łukasiewicz's logic. The findings are a contribution in the field of non-monotonic approximate reasoning and they also represent a well-grounded proposal towards the introduction …
Evaluation Of String Constraint Solvers Using Dynamic Symbolic Execution, Scott Kausler
Evaluation Of String Constraint Solvers Using Dynamic Symbolic Execution, Scott Kausler
Boise State University Theses and Dissertations
Symbolic execution is a path sensitive program analysis technique used for error detection and test case generation. Symbolic execution tools rely on constraint solvers to determine the feasibility of program paths and generate concrete inputs for feasible paths. Therefore, the effectiveness of such tools depends on their constraint solvers.
Most modern constraint solvers for primitive data types, such as integers, are both efficient and accurate. However, the research on constraint solvers for complex data types, such as strings, is ongoing and less converged. For example, there are several types of string constraint solvers provided by researchers. However, a potential user …
Methods For Efficient Object Categorization, Detection, Scene Recognition, And Image Search, Alessandro Bergamo
Methods For Efficient Object Categorization, Detection, Scene Recognition, And Image Search, Alessandro Bergamo
Dartmouth College Ph.D Dissertations
In the past few years there has been a tremendous growth in the usage of digital images. Users can now access millions of photos, a fact that poses the need of having methods that can efficiently and effectively search the visual information of interest. In this thesis, we propose methods to learn image representations to compactly represent a large collection of images, enabling accurate image recognition with linear classification models which offer the advantage of being efficient to both train and test. The entries of our descriptors are the output of a set of basis classifiers evaluated on the image, …
Approaches For Generating 2d Shapes, Pratik Shankar Hada
Approaches For Generating 2d Shapes, Pratik Shankar Hada
UNLV Theses, Dissertations, Professional Papers, and Capstones
Constructing a two dimensional shape from given a set of point sites is a well known problem in computation geometry. We present a critical review of the existing algorithms for constructing polygonal shapes. We present a new approach calledinward dentingfor constructing simple polygons. We then extend the proposed approach for modeling polygons with holes. This is the
first known algorithm for modeling holes in the interior of 2d shapes. We also present experimental investigations of the quality of the solutions generated by the proposed algorithms.
For this we implemented the proposed algorithms in Java programming language. The prototype program can …