Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3880)
- Singapore Management University (296)
- Old Dominion University (273)
- Embry-Riddle Aeronautical University (58)
- Air Force Institute of Technology (56)
-
- University of Nevada, Las Vegas (40)
- University of Arkansas, Fayetteville (37)
- Missouri University of Science and Technology (36)
- University of Nebraska - Lincoln (31)
- New Jersey Institute of Technology (28)
- University of South Florida (28)
- Chapman University (26)
- University of Dar es Salaam (25)
- University of Denver (25)
- Western University (20)
- University of Kentucky (19)
- California Polytechnic State University, San Luis Obispo (18)
- University of Texas at El Paso (18)
- Clemson University (17)
- Purdue University (17)
- City University of New York (CUNY) (16)
- Michigan Technological University (15)
- Washington University in St. Louis (15)
- Southern Methodist University (14)
- Chinese Academy of Sciences (13)
- Louisiana State University (13)
- University of Malaya (13)
- Fordham University (12)
- West Virginia University (12)
- MBZUAI (11)
- Keyword
-
- Machine learning (175)
- Deep learning (159)
- Simulation (145)
- Artificial intelligence (125)
- Machine Learning (85)
-
- Path planning (81)
- Reinforcement learning (61)
- Deep Learning (52)
- Genetic algorithm (52)
- Robotics (52)
- Artificial Intelligence (49)
- Virtual reality (47)
- Numerical simulation (45)
- Digital twin (43)
- Optimization (43)
- Computer vision (42)
- Multi-objective optimization (40)
- Neural network (40)
- Modeling and simulation (39)
- Modeling (38)
- Deep reinforcement learning (37)
- Particle swarm optimization (35)
- Scheduling (33)
- UAV (33)
- Fault diagnosis (32)
- Neural networks (31)
- Attention mechanism (29)
- Natural language processing (25)
- Simulation model (25)
- Visualization (25)
- Publication Year
- Publication
-
- Journal of System Simulation (3880)
- Research Collection School Of Computing and Information Systems (291)
- Electrical & Computer Engineering Faculty Publications (72)
- Theses and Dissertations (71)
- Electrical & Computer Engineering Theses & Dissertations (37)
-
- Electronic Theses and Dissertations (33)
- Dissertations (31)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (30)
- USF Tampa Graduate Theses and Dissertations (26)
- Tanzania Journal of Engineering and Technology (TJET) (24)
- Doctoral Dissertations (23)
- Faculty Publications (23)
- Computer Science Faculty Publications (21)
- Engineering Technology Faculty Publications (20)
- Graduate Theses and Dissertations (20)
- Publications (20)
- Electrical and Computer Engineering Publications (19)
- Open Access Theses & Dissertations (18)
- Doctoral Dissertations and Master's Theses (17)
- Engineering Management & Systems Engineering Faculty Publications (17)
- Master's Theses (17)
- Engineering Management & Systems Engineering Theses & Dissertations (16)
- Journal of Computer Science Integration (16)
- Discovery Day - Daytona Beach (15)
- Dissertations, Master's Theses and Master's Reports (15)
- McKelvey School of Engineering Graduate Student Theses & Dissertations (15)
- Electrical and Computer Engineering Faculty Research & Creative Works (14)
- Bulletin of Chinese Academy of Sciences (Chinese Version) (13)
- Dissertations and Theses (13)
- Graduate Theses, Dissertations, and Problem Reports (ETD) (12)
- Publication Type
- File Type
Articles 5221 - 5250 of 5388
Full-Text Articles in Engineering
Simulation, Application, And Resilience Of An Organic Neuromorphic Architecture, Made With Organic Bistable Devices And Organic Field Effect Transistors, Robert A. Nawrocki
Simulation, Application, And Resilience Of An Organic Neuromorphic Architecture, Made With Organic Bistable Devices And Organic Field Effect Transistors, Robert A. Nawrocki
Electronic Theses and Dissertations
This thesis presents work done simulating a type of organic neuromorphic architecture, modeled after Artificial Neural Network, and termed Synthetic Neural Network, or SNN. The first major contribution of this thesis is development of a single-transistor-single-organic-bistable-device-per-input circuit that approximates behavior of an artificial neuron. The efficacy of this design is validated by comparing the behavior of a single synthetic neuron to that of an artificial neuron as well as two examples involving a network of synthetic neurons. The analysis utilizes electrical characteristics of polymer electronic elements, namely Organic Bistable Device and Organic Field Effect Transistor, created in the laboratory at …
Imbalanced Learning For Functional State Assessment, Feng Li, Frederick Mckenzie, Jiang Li, Guanfan Zhang, Roger Xu, Carl Richey, Tom Schnell, Thomas E. Pinelli (Ed.)
Imbalanced Learning For Functional State Assessment, Feng Li, Frederick Mckenzie, Jiang Li, Guanfan Zhang, Roger Xu, Carl Richey, Tom Schnell, Thomas E. Pinelli (Ed.)
Electrical & Computer Engineering Faculty Publications
This paper presents results of several imbalanced learning techniques applied to operator functional state assessment where the data is highly imbalanced, i.e., some function states (majority classes) have much more training samples than other states (minority classes). Conventional machine learning techniques usually tend to classify all data samples into majority classis and perform poorly for minority classes. In this study, we implemented five imbalanced learning techniques, including random under-sampling, random over-sampling, synthetic minority over-sampling technique (SMOTE), borderline-SMOTE and adaptive synthetic sampling (ADASYN) to solve this problem. Experimental results on a benchmark driving test dataset show that accuracies for minority classes …
An Integrated Computer-Aided Robotic System For Dental Implantation, Xiaoyan Sun, Yongki Yoon, Jiang Li, Frederic D. Mckenzie
An Integrated Computer-Aided Robotic System For Dental Implantation, Xiaoyan Sun, Yongki Yoon, Jiang Li, Frederic D. Mckenzie
Electrical & Computer Engineering Faculty Publications
This paper describes an integrated system for dental implantation including both preoperative planning utilizing computer-aided technology and automatic robot operation during the intra-operative stage. A novel two-step registration procedure was applied for transforming the preoperative plan to the operation of the robot, with the help of a Coordinate Measurement Machine (CMM). Experiments with a patient-specific phantom were carried out to evaluate the registration error for both position and orientation. After adopting several improvements, registration accuracy of the system was significantly improved. Sub-millimeter accuracy with the Target Registration Errors (TREs) of 0.38±0.16 mm (N=5) was achieved. The target orientation errors after …
Eeg Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen, John Musson, Jiang Li, Frederick Mckenzie, Guangfan Zhang, Roger Xu, Carl Richey, Tom Schnell, Thomas E. Pinelli (Ed.)
Eeg Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen, John Musson, Jiang Li, Frederick Mckenzie, Guangfan Zhang, Roger Xu, Carl Richey, Tom Schnell, Thomas E. Pinelli (Ed.)
Electrical & Computer Engineering Faculty Publications
In this paper we developed a wavelet neural network. (WNN) algorithm for Electroencephalogram (EEG) artifact removal without electrooculographic (EOG) recordings. The algorithm combines the universal approximation characteristics of neural network and the time/frequency property of wavelet. We compared the WNN algorithm with the ICA technique and a wavelet thresholding method, which was realized by using the Stein's unbiased risk estimate (SURE) with an adaptive gradient-based optimal threshold. Experimental results on a driving test data set show that WNN can remove EEG artifacts effectively without diminishing useful EEG information even for very noisy data.
Prediction Of Brain Tumor Progression Using Multiple Histogram Matched Mri Scans, Debrup Banerjee, Loc Tran, Jiang Li, Yuzhong Shen, Frederic Mckenzie, Jihong Wang, Ronald M. Summers (Ed.), Bram Van Ginneken (Ed.)
Prediction Of Brain Tumor Progression Using Multiple Histogram Matched Mri Scans, Debrup Banerjee, Loc Tran, Jiang Li, Yuzhong Shen, Frederic Mckenzie, Jihong Wang, Ronald M. Summers (Ed.), Bram Van Ginneken (Ed.)
Electrical & Computer Engineering Faculty Publications
In a recent study [1], we investigated the feasibility of predicting brain tumor progression based on multiple MRI series and we tested our methods on seven patients' MRI images scanned at three consecutive visits A, B and C. Experimental results showed that it is feasible to predict tumor progression from visit A to visit C using a model trained by the information from visit A to visit B. However, the trained model failed when we tried to predict tumor progression from visit B to visit C, though it is clinically more important. Upon a closer look at the MRI scans …
Marine Buoy Detection Using Circular Hough Transform, Loc Tran, Justin Selfridge, Gene Hou, Jiang Li
Marine Buoy Detection Using Circular Hough Transform, Loc Tran, Justin Selfridge, Gene Hou, Jiang Li
Electrical & Computer Engineering Faculty Publications
A low cost method for buoy detection in maritime settings is presented using inexpensive digital cameras. In this method, the circular Hough transform is applied to an edge image to circular objects in the image. The center of these circles will signify the locations of each buoy. The known color information of the buoys is also used to enhance the performance by removing false detections. The algorithm is compared to an approach that locates buoys purely on color information. In order to validate the method, we test the approach synthetically and also with real images captured from a small surface …
Instance-Based Parameter Tuning Via Search Trajectory Similarity Clustering, Linda Lindawati, Hoong Chuin Lau, David Lo
Instance-Based Parameter Tuning Via Search Trajectory Similarity Clustering, Linda Lindawati, Hoong Chuin Lau, David Lo
Research Collection School Of Computing and Information Systems
This paper is concerned with automated tuning of parameters in local-search based meta-heuristics. Several generic approaches have been introduced in the literature that returns a ”one-size-fits-all” parameter configuration for all instances. This is unsatisfactory since different instances may require the algorithm to use very different parameter configurations in order to find good solutions. There have been approaches that perform instance-based automated tuning, but they are usually problem-specific. In this paper, we propose CluPaTra, a generic (problem-independent) approach to perform parameter tuning, based on CLUstering instances with similar PAtterns according to their search TRAjectories. We propose representing a search trajectory as …
Improving Service Through Just-In-Time Concept In A Dynamic Operational Environment, Kar Way Tan, Hoong Chuin Lau, Na Fu
Improving Service Through Just-In-Time Concept In A Dynamic Operational Environment, Kar Way Tan, Hoong Chuin Lau, Na Fu
Research Collection School Of Computing and Information Systems
This paper is concerned with the problem of Just-In-Time (JIT) job scheduling in a dynamic environment under uncertainty to attain timely service. We provide an approach, based on robust scheduling concepts, to analytically evaluate the expected cost of earliness and tardiness for each job and also the project. In addition, we search for a schedule execution policy with the minimum robust cost such that for a given risk level (epsilon), the actual realized schedule has (1 - epsilon) probability of completing with less than or equal to this robust cost. Our method is quite generic, and can be applied to …
Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy Gunawan, Hoong Chuin Lau, Linda Lindawati
Fine-Tuning Algorithm Parameters Using The Design Of Experiments Approach, Aldy Gunawan, Hoong Chuin Lau, Linda Lindawati
Research Collection School Of Computing and Information Systems
Optimizing parameter settings is an important task in algorithm design. Several automated parameter tuning procedures/configurators have been proposed in the literature, most of which work effectively when given a good initial range for the parameter values. In the Design of Experiments (DOE), a good initial range is known to lead to an optimum parameter setting. In this paper, we present a framework based on DOE to find a good initial range of parameter values for automated tuning. We use a factorial experiment design to first screen and rank all the parameters thereby allowing us to then focus on the parameter …
Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein
Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Computing a maximum a posteriori (MAP) assignment in graphical models is a crucial inference problem for many practical applications. Several provably convergent approaches have been successfully developed using linear programming (LP) relaxation of the MAP problem. We present an alternative approach, which transforms the MAP problem into that of inference in a finite mixture of simple Bayes nets. We then derive the Expectation Maximization (EM) algorithm for this mixture that also monotonically increases a lower bound on the MAP assignment until convergence. The update equations for the EM algorithm are remarkably simple, both conceptually and computationally, and can be implemented …
Electroencephalogram Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen
Electroencephalogram Artifact Removal Using A Wavelet Neural Network, Hoang-Anh T. Nguyen
Electrical & Computer Engineering Theses & Dissertations
A wavelet neural network (WNN) technique rs developed for electroencephalogram (EEG) artifact removal without electrooculographic (EOG) recordings. The algorithm combines the universal approximation characteristics of neural networks and the time/frequency property of wavelet, where the neural network was trained on a simulated dataset with known ground truths. The contribution of this thesis is two-fold. First, many EEG artifact removal algorithms, including regression based methods, require reference EOG signals, which are not always available. To remove EEG ai1ifacts, a WNN tries to learn the characteristics of the artifacts first and does not need reference EOG signals once trained. Second, WNNs are …
Event Study Method For Validating Agent-Based Trading Simulations, Shih-Fen Cheng
Event Study Method For Validating Agent-Based Trading Simulations, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
In this paper, we introduce how one can validate an event-centric trading simulation platform that is built with multi-agent technology. The issue of validation is extremely important for agent-based simulations, but unfortunately, so far there is no one universal method that would work in all domains. The primary contribution of this paper is a novel combination of event-centric simulation design and event study approach for market dynamics generation and validation. In our event-centric design, the simulation is progressed by announcing news events that affect market prices. Upon receiving these events, event-aware software agents would adjust their views on the market …
Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau
Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we discuss the problem of route planning and scheduling by a group of agents. Each agent is responsible for designing a route plan and schedule over a geographical network, and the goal is to obtain a conflict-free plan/schedule that optimizes a global objective. We present a hybrid conflict resolution method that involves coalition formation and distributed constraint satisfaction depending on the level of coupling between agents. We show how this approach can be effectively applied to solve a distributed convoy movement planning problem.
Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau
Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper is concerned with solving decentralized resource allocation and scheduling problems via auctions with negotiable agents by allowing agents to switch their bid generation strategies within the auction process, such that a better system wide performance is achieved on average as compared to the conventional walrasian auction running with agents of fixed bid generation strategy. We propose a negotiation mechanism embedded in auctioneer to solicit bidders’ change of strategies in the process of auction. Finally we benchmark our approach against conventional auctions subject to the real-time large-scale dynamic resource coordination problem to demonstrate the effectiveness of our approach.
The Bi-Objective Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau
The Bi-Objective Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Physician scheduling is the assignment of physicians to perform different duties in the hospital timetable. In this paper, the goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We present a mathematical programming model to represent the problem as a bi-objective optimization problem. Three different methods based on ε–Constraint Method, Weighted-Sum Method and HillClimbing algorithm are proposed. These methods were tested on a real case from the Surgery Department of a large local government hospital, as well as on randomly generated problem instances. The strengths and weaknesses of the …
A Decision Theoretic Approach To Data Leakage Prevention, Janusz Marecki, Mudhakar Srivastava, Pradeep Reddy Varakantham
A Decision Theoretic Approach To Data Leakage Prevention, Janusz Marecki, Mudhakar Srivastava, Pradeep Reddy Varakantham
Research Collection School Of Computing and Information Systems
In both the commercial and defense sectors a compelling need is emerging for rapid, yet secure, dissemination of information. In this paper we address the threat of information leakage that often accompanies such information flows. We focus on domains with one information source (sender) and many information sinks (recipients) where: (i) sharing is mutually beneficial for the sender and the recipients, (ii) leaking a shared information is beneficial to the recipients but undesirable to the sender, and (iii) information sharing decisions of the sender are determined using imperfect monitoring of the (un)intended information leakage by the recipients.We make two key …
Effect Of Human Biases On Human-Agent Teams, Praveen Paruchuri, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Effect Of Human Biases On Human-Agent Teams, Praveen Paruchuri, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri
Research Collection School Of Computing and Information Systems
As human-agent teams get increasingly deployed in the real-world, agent designers need to take into account that humans and agents have different abilities to specify preferences. In this paper, we focus on how human biases in specifying preferences for resources impacts the performance of large, heterogeneous teams. In particular, we model the inclination of humans to simplify their preference functions and to exaggerate their utility for desired resources, and show the effect of these biases on the team performance. We demonstrate this on two different problems, which are representative of many resource allocation problems addressed in literature. In both these …
Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau
Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper introduces the SoI problem, that of finding nonoptimal solutions of interest for constrained optimization models. SoI problems subsume finding FoIs (feasible solutions of interest), and IoIs (infeasible solutions of interest). In all cases, the interest addressed is post-solution analysis in one form or another. Post-solution analysis of a constrained optimization model occurs after the model has been solved and a good or optimal solution for it has been found. At this point, sensitivity analysis and other questions of import for decision making (discussed in the paper) come into play and for this purpose the SoIs can be of …
Anytime Planning For Decentralized Pomdps Using Expectation Maximization, Akshat Kumar, Shlomo Zilberstein
Anytime Planning For Decentralized Pomdps Using Expectation Maximization, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDPs provide an expressive framework for multi-agent sequential decision making. While finite-horizon DECPOMDPs have enjoyed signifcant success, progress remains slow for the infinite-horizon case mainly due to the inherent complexity of optimizing stochastic controllers representing agent policies. We present a promising new class of algorithms for the infinite-horizon case, which recasts the optimization problem as inference in a mixture of DBNs. An attractive feature of this approach is the straightforward adoption of existing inference techniques in DBNs for solving DEC-POMDPs and supporting richer representations such as factored or continuous states and actions. We also derive the Expectation Maximization (EM) …
Point-Based Backup For Decentralized Pompds: Complexity And New Algorithms, Akshat Kumar, Shlomo Zilberstein
Point-Based Backup For Decentralized Pompds: Complexity And New Algorithms, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up existing algorithms, largely due to the use of point-based methods. Performing point-based backup is a fundamental operation in state-of-the-art algorithms. We show that even a single backup step in the multi-agent setting is NP-Complete. Despite this negative worst-case result, we present an efficient and scalable optimal algorithm as well as a principled approximation scheme. The optimal algorithm exploits recent advances in the weighted CSP literature to overcome the complexity of the backup operation. The polytime approximation scheme …
Towards Finding Robust Execution Strategies For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau
Towards Finding Robust Execution Strategies For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max) have been studied extensively in the literature. However, the more realistic RCPSP/max problems — ones where durations of activities are not known with certainty – have received scant interest and hence are the main focus of the paper. Towards addressing the significant computational complexity involved in tackling RCPSP/max with durational uncertainty, we employ a local search mechanism to generate robust schedules. In this regard, we make two key contributions: (a) Introducing and studying the key properties of a new decision rule to specify start times of activities with …
Artificial Intelligence: Soon To Be The World’S Greatest Intelligence, Or Just A Wild Dream?, Edward R. Kollett
Artificial Intelligence: Soon To Be The World’S Greatest Intelligence, Or Just A Wild Dream?, Edward R. Kollett
Academic Symposium of Undergraduate Scholarship
The purpose of the paper was to examine the field of artificial intelligence. In particular, the paper focused on what has been accomplished towards the goal of making a machine that can think like a human, and the hardships that researchers in the field has faced. It also touched upon the potential outcomes of success. Why is this paper important? As computers become more powerful, the common conception is that they are becoming more intelligent. As computers become more integrated with society and more connected with each other, people again believe they are becoming smarter. Therefore, it is important that …
Developing An Effective And Efficient Real Time Strategy Agent For Use As A Computer Generated Force, Kurt Weissgerber
Developing An Effective And Efficient Real Time Strategy Agent For Use As A Computer Generated Force, Kurt Weissgerber
Theses and Dissertations
Computer Generated Forces (CGF) are used to represent units or individuals in military training and constructive simulation. The use of CGF significantly reduces the time and money required for effective training. For CGF to be effective, they must behave as a human would in the same environment. Real Time Strategy (RTS) games place players in control of a large force whose goal is to defeat the opponent. The military setting of RTS games makes them an excellent platform for the development and testing of CGF. While there has been significant research in RTS agent development, most of the developed agents …
Autonomous Satellite Operations For Cubesat Satellites, Jason Lionel Anderson
Autonomous Satellite Operations For Cubesat Satellites, Jason Lionel Anderson
Master's Theses
In the world of educational satellites, student teams manually conduct operations daily, sending commands and collecting downlinked data. Educational satellites typically travel in a Low Earth Orbit allowing line of sight communication for approximately thirty minutes each day. This is manageable for student teams as the required manpower is minimal. The international Global Educational Network for Satellite Operations (GENSO), however, promises satellite contact upwards of sixteen hours per day by connecting earth stations all over the world through the Internet. This dramatic increase in satellite communication time is unreasonable for student teams to conduct manual operations and alternatives must be …
An Analysis Of Extreme Price Shocks And Illiquidity Among Trend Followers, Bernard Lee, Shih-Fen Cheng, Annie Koh
An Analysis Of Extreme Price Shocks And Illiquidity Among Trend Followers, Bernard Lee, Shih-Fen Cheng, Annie Koh
Research Collection School Of Computing and Information Systems
We construct an agent-based model to study the interplay between extreme price shocks and illiquidity in the presence of systematic traders known as trend followers. The agent-based approach is particularly attractive in modeling commodity markets because the approach allows for the explicit modeling of production, capacities, and storage constraints. Our study begins by using the price stream from a market simulation involving human participants and studies the behavior of various trend-following strategies, assuming initially that their participation will not impact the market. We notice an incremental deterioration in strategy performance as and when strategies deviate further and further from the …
Inversion Of 2d And 3d Dc Resistivity Imaging Data Forhigh Contrast Geophysical Regions Using Artificial Neuralnetworks., Ahmad Neyamadpour
Inversion Of 2d And 3d Dc Resistivity Imaging Data Forhigh Contrast Geophysical Regions Using Artificial Neuralnetworks., Ahmad Neyamadpour
Student Works (2010-2019)
In electrical resistivity imaging surveys, the field data along a profile are normally acquired as a subsurface distribution of apparent resistivity. One common method to obtain the true resistivity distribution is by inverting the apparent resistivity values. However, the inversion of DC resistivity imaging data is complex due to its non-linearity. This is especially true for regions with high resistivity contrast. For the complicated subsurface structure, especially when regions of high resistivity contrast exist, a conventional inversion technique based on least squares methods may not be able to invert the DC resistivity data with adequate accuracy. Therefore, in this study, …
Introducing Communication In Dis-Pomdps With Locality Of Interaction, Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Reddy Varakantham, Milind Tambe
Introducing Communication In Dis-Pomdps With Locality Of Interaction, Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Reddy Varakantham, Milind Tambe
Research Collection School Of Computing and Information Systems
The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has failed to address communication. Without communication, the size of a local policy at each agent within the ND-POMDPs grows exponentially in the time horizon. To overcome this problem, we extend existing algorithms so that agents periodically communicate their observation and action histories with each other. After communication, agents can start from new synchronized belief state. Thus, we can avoid the exponential growth in the size of local policies at agents. Furthermore, we introduce …
Periodic Resource Reallocation In Two-Echelon Repairable Item Inventory Systems, Hoong Chuin Lau, Jie Pan, Huawei Song
Periodic Resource Reallocation In Two-Echelon Repairable Item Inventory Systems, Hoong Chuin Lau, Jie Pan, Huawei Song
Research Collection School Of Computing and Information Systems
Given an existing stock allocation in an inventory system, it is often necessary to perform reallocation over multiple time points to address inventory imbalance and maximize availability. In this paper, we focus on the situation where there are two opportunities to perform reallocation within a replenishment cycle. We derive a mathematical model to determine when and how to perform reallocation. Furthermore, we consider the extension of this model to the situation allowing an arbitrary number of reallocations. Experimental results show that the two-reallocation approach achieves better performance compared with the single-reallocation approach found in the literature. We also illustrate how …
Prediction Of Brain Tumor Progression Using A Machine Learning Technique, Yuzhong Shen, Debrup Banerjee, Jiang Li, Adam Chandler, Yufei Shen, Frederic D. Mckenzie, Jihong Wang, Nico Karssemeijer (Ed.), Ronald M. Summers (Ed.)
Prediction Of Brain Tumor Progression Using A Machine Learning Technique, Yuzhong Shen, Debrup Banerjee, Jiang Li, Adam Chandler, Yufei Shen, Frederic D. Mckenzie, Jihong Wang, Nico Karssemeijer (Ed.), Ronald M. Summers (Ed.)
Electrical & Computer Engineering Faculty Publications
A machine learning technique is presented for assessing brain tumor progression by exploring six patients' complete MRI records scanned during their visits in the past two years. There are ten MRI series, including diffusion tensor image (DTI), for each visit. After registering all series to the corresponding DTI scan at the first visit, annotated normal and tumor regions were overlaid. Intensity value of each pixel inside the annotated regions were then extracted across all of the ten MRI series to compose a 10 dimensional vector. Each feature vector falls into one of three categories:normal, tumor, and normal but progressed to …
A Neural Network Approach To Border Gateway Protocol Peer Failure Detection And Prediction, Cory B. White
A Neural Network Approach To Border Gateway Protocol Peer Failure Detection And Prediction, Cory B. White
Master's Theses
The size and speed of computer networks continue to expand at a rapid pace, as do the corresponding errors, failures, and faults inherent within such extensive networks. This thesis introduces a novel approach to interface Border Gateway Protocol (BGP) computer networks with neural networks to learn the precursor connectivity patterns that emerge prior to a node failure. Details of the design and construction of a framework that utilizes neural networks to learn and monitor BGP connection states as a means of detecting and predicting BGP peer node failure are presented. Moreover, this framework is used to monitor a BGP network …