Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 8 of 8

Full-Text Articles in Engineering

Trends. War On Personality And Personality And War: Comments On Nass And Lee (2002), Ibpp Editor Sep 2002

Trends. War On Personality And Personality And War: Comments On Nass And Lee (2002), Ibpp Editor

International Bulletin of Political Psychology

This Trends article discusses another article – Identity and deconstruction, by Clifford Nass and Kwan Min Yee – published in volume 3 (2002) of Archives of Psychiatry & Psychotherapy in which the authors demonstrate that people reliably attribute personality characteristics to computer-synthesized speech, exploring the ramifications in a political psychological context.


Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang Sep 2002

Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang

Research Collection School Of Computing and Information Systems

In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon' s benchmark test cases for VRPTW. Experimental results show that our approach yields very …


Analysis For Cooperative Behavior Effectiveness Of Autonomous Wide Area Search Munitions, Sang M. Park Aug 2002

Analysis For Cooperative Behavior Effectiveness Of Autonomous Wide Area Search Munitions, Sang M. Park

Theses and Dissertations

The purpose of this study is to investigate how a simulation model can accurately represent the performance of the autonomous wide area search munitions, and to find the effectiveness of the cooperative behavior on the autonomous munitions. Though it does not provide a practical solution for the development of the autonomous wide area search munitions, this research will show some meaningful allocations of the munitions tasks that are applicable to the development of the autonomous munitions. For the first phase, this thesis presents how accurately a simplified simulation model can represent a proposed weapon system by comparing the simulation results …


Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li Aug 2002

Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li

Research Collection School Of Computing and Information Systems

In this paper, we describe how an integrated web‐based application, code‐named FOCI (Flexible Organizer for Competitive Intelligence), can help the knowledge worker in the gathering, organizing, tracking and dissemination of competitive intelligence (CI). It combines the use of a novel user‐configurable clustering, trend analysis and visualization techniques to manage information gathered from the web. FOCI allows its users to define and personalize the organization of the information clusters according to their needs and preferences into portfolios. These personalized portfolios created are saved and can be subsequently tracked and shared with other users. The paper runs through an example to show …


Integrating Local Search And Network Flow To Solve The Inventory Routing Problem, Hoong Chuin Lau, Q Liu, H. Ono Jul 2002

Integrating Local Search And Network Flow To Solve The Inventory Routing Problem, Hoong Chuin Lau, Q Liu, H. Ono

Research Collection School Of Computing and Information Systems

The inventory routing problem is one of important and practical problems in logistics. It involves the integration of inventory management and vehicle routing, both of which are known to be NP-hard. In this paper, we combine local search and network flows to solve the inventory management problem, by utilizing the minimum cost flow sub-solutions as a guiding measure for local search. We then integrate with a standard VRPTW solver to present experimental results for the overall inventory routing problem, based on instances extended from the Solomon benchmark problems.


Modular Machine Learning Methods For Computer-Aided Diagnosis Of Breast Cancer, Mia Kathleen Markey '94 Jun 2002

Modular Machine Learning Methods For Computer-Aided Diagnosis Of Breast Cancer, Mia Kathleen Markey '94

Doctoral Dissertations

The purpose of this study was to improve breast cancer diagnosis by reducing the number of benign biopsies performed. To this end, we investigated modular and ensemble systems of machine learning methods for computer-aided diagnosis (CAD) of breast cancer. A modular system partitions the input space into smaller domains, each of which is handled by a local model. An ensemble system uses multiple models for the same cases and combines the models' predictions.

Five supervised machine learning techniques (LDA, SVM, BP-ANN, CBR, CART) were trained to predict the biopsy outcome from mammographic findings (BIRADS™) and patient age based on a …


A New Approach For Weighted Constraint Satisfaction, Hoong Chuin Lau Apr 2002

A New Approach For Weighted Constraint Satisfaction, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider the Weighted Constraint Satisfaction Problem which is an important problem in Artificial Intelligence. Given a set of variables, their domains and a set of constraints between variables, our goal is to obtain an assignment of the variables to domain values such that the weighted sum of satisfied constraints is maximized. In this paper, we present a new approach based on randomized rounding of semidefinite programming relaxation. Besides having provable worst-case bounds for domain sizes 2 and 3, our algorithm is simple and efficient in practice, and produces better solutions than some other polynomial-time algorithms such as greedy and …


Investigation Of Cooperative Behavior In Autonomous Wide Search Munitions, Robert E. Dunkel Iii Mar 2002

Investigation Of Cooperative Behavior In Autonomous Wide Search Munitions, Robert E. Dunkel Iii

Theses and Dissertations

The purpose of this research is to investigate the effectiveness of wide-area search munitions in various scenarios using different cooperative behavior algorithms. The general scenario involves multiple autonomous munitions searching for an unknown number of targets of different priority in unknown locations. Three cooperative behavior algorithms are used in each scenario: no cooperation, cooperative attack only, and cooperative classification and attack. In the cooperative cases, the munitions allocate tasks on-line as a group, using linear programming techniques to determine the optimum allocation. Each munition provides inputs to the task allocation routine in the form of probabilities of successfully being able …