Theory and Algorithms Commons^™

A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem

Engineering Management & Systems Engineering Faculty Publications

In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedules makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the …

Fast Bounds On The Distribution Of Smooth Numbers, Scott T. Parsell, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

In this paper we present improvements to Bernstein’s algorithm, which finds rigorous upper and lower bounds for (x, y).

The Pseudosquares Prime Sieve, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

We present the pseudosquares prime sieve, which finds all primes up to n.

Realtime Query Expansion And Procedural Interfaces For Information Hierarchies, Saverio Perugini

Computer Science Faculty Publications

We demonstrate the use of two user interfaces for interacting with web hierarchies. One uses the dependencies underlying a hierarchy to perform real-time query expansion and, in this way, acts as an in situ feedback mechanism. The other enables the user to cascade the output from one interaction to the input of another, and so on, and, in this way, supports procedural information-seeking tasks without disrupting the flow of interaction.

Information Assurance Through Binary Vulnerability Auditing, William B. Kimball, Saverio Perugini

Computer Science Faculty Publications

The goal of this research is to develop improved methods of discovering vulnerabilities in software. A large volume of software, from the most frequently used programs on a desktop computer, such as web browsers, e-mail programs, and word processing applications, to mission-critical services for the space shuttle, is unintentionally vulnerable to attacks and thus insecure. By seeking to improve the identification of vulnerabilities in software, the security community can save the time and money necessary to restore compromised computer systems. In addition, this research is imperative to activities of national security such as counterterrorism. The current approach involves a systematic …

Hybrid Committee Classifier For A Computerized Colonic Polyp Detection System, Jiang Li, Jianhua Yao, Nicholas Petrick, Ronald M. Summers, Amy K. Hara, Joseph M. Reinhardt (Ed.), Josien P.W. Pluim (Ed.)

Electrical & Computer Engineering Faculty Publications

We present a hybrid committee classifier for computer-aided detection (CAD) of colonic polyps in CT colonography (CTC). The classifier involved an ensemble of support vector machines (SVM) and neural networks (NN) for classification, a progressive search algorithm for selecting a set of features used by the SVMs and a floating search algorithm for selecting features used by the NNs. A total of 102 quantitative features were calculated for each polyp candidate found by a prototype CAD system. 3 features were selected for each of 7 SVM classifiers which were then combined to form a committee of SVMs classifier. Similarly, features …

Unsymmetrical And Symmetrical Sparse Iterative Algorithm With Multiple Right-Hand-Sides Strategies, D. T. Nguyen, A. P. Honrao, G. Hou, O. Akan, O. Baysal

Civil & Environmental Engineering Faculty Publications

Unified unsymmetrical and symmetrical iterative solvers for handling multiple right-hand-side vectors are examined in this work. Efficient computer implementation strategies (to reduce computational time and in-core memory requirements) are proposed. In-core, out-of-core, linear, multiple right hand side (RHS) vectors, non-linear, symmetrical, and unsymmetrical capabilities of the developed software are demonstrated by solving variety of problems selected form different engineering disciplines. Results indicate that the developed algorithm and software is reliable and efficient.

Group Key Management In Wireless Ad-Hoc And Sensor Networks, Mohammed A. Moharrum

Computer Science Theses & Dissertations

A growing number of secure group applications in both civilian and military domains is being deployed in WAHNs. A Wireless Ad-hoc Network (WARN) is a collection of autonomous nodes or terminals that communicate with each other by forming a multi-hop radio network and maintaining connectivity in a decentralized manner. A Mobile Ad-hoc Network (MANET) is a special type of WARN with mobile users. MANET nodes have limited communication, computational capabilities, and power. Wireless Sensor Networks (WSNs) are sensor networks with massive numbers of small, inexpensive devices pervasive throughout electrical and mechanical systems and ubiquitous throughout the environment that monitor and …

Classical And Quantum Algorithms For Finding Cycles, Jill Cirasella

Publications and Research

Quantum computing—so weird, so wonderful—inspires much speculation about the line between the possible and the impossible. (Of course, there is still unclarity about how “impossible” intractable problems are and about how “possible” quantum computers are.) This thesis takes a slightly different tack: instead of focusing on how to make the impossible possible, it focuses on how to make the possible easier.

More specifically, this paper discusses quantum algorithms for finding cycles in graphs, a problem for which polynomial-time classical algorithms already exist. It explains and compares the classical and quantum algorithms, and it introduces a few new algorithms and observations. …

Handling The Subclassing Anomaly With Object Teams, Jeff Furlong, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Existing Java software or libraries can evolve via subclassing. Unfortunately, subclassing may not properly support code adaptation when there are dependencies between classes. More precisely, subclassing in collections of related classes may require reimplementation of otherwise valid classes. This problem is defined as the subclassing anomaly, which is an issue when software evolution or code reuse is a goal of the programmer who is using existing classes. Object Teams offers an implicit fix to this problem and is largely compatible with the existing JVM’s. In this paper, we evaluate how well Object Teams succeeds in providing a solution for a …

Efficient Scheduling For Sdmg Cioq Switches, Mei Yang, S. Q. Zheng

Electrical & Computer Engineering Faculty Research

Combined input and output queuing (CIOQ) switches are being considered as high-performance switch architectures due to their ability to achieve 100% throughput and perfectly emulate output queuing (OQ) switch performance with a small speedup factor S. To realize a speedup factor S, a conventional CIOQ switch requires the switching fabric and memories to operate S times faster than the line rate. In this paper, we propose to use a CIOQ switch with space-division multiplexing expansion and grouped input/output ports (SDMG CIOQ switch for short) to realize speedup while only requiring the switching fabric and memories to operate at the line …

Robust And Efficient Localization Techniques For Cellular And Wireless Sensor Networks, Haseebulla M. Khan

Computer Science Theses & Dissertations

Localization in wireless networks refers to a collection of tasks that, collectively, determines the location of a mobile user, striving to hide the effects of mobility from the user and/or application. Localization has become an important issue and has drawn considerable attention, as many applications including E-911, cargo tracking, locating patients, location-sensitive billing, etc., require knowledge of the location of user/objects. It was realized, quite a while back, that extending emergency 911-like services (E-911) to continually growing mobile population is one of the extremely important localization applications. The bulk of the proposed solutions to emergency location management in wireless environments …

On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov

Computer Science Faculty Publications

In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, …

Nil Is Not Nothing: Recognition Of Chinese Network Informal Language Expressions, Yunqing Xia, Wong, Wei Gao, Wei Gao

Research Collection School Of Computing and Information Systems

Informal language is actively used in network-mediated communication, e.g. chat room, BBS, email and text message. We refer the anomalous terms used in such context as network informal language (NIL) expressions. For example, “偶(ou3)” is used to replace “我(wo3)” in Chinese ICQ. Without unconventional resource, knowledge and techniques, the existing natural language processing approaches exhibit less effectiveness in dealing with NIL text. We propose to study NIL expressions with a NIL corpus and investigate techniques in processing NIL expressions. Two methods for Chinese NIL expression recognition are designed in NILER system. The experimental results show that pattern matching method produces …

Poster Session A: Address Auto-Configuration In Mobile Ad Hoc Networks Using Olsr, M.U. Saleem, Shoaib Mukhtar

International Conference on Information and Communication Technologies

Mobile Ad Hoc Networks is dynamic multi-hop network that is formed by a set of mobile wireless nodes that are sharing the same bandwidth. So every node possibly acts as a host as well as a router. In traditional networks, hosts can depend on the central servers like DHCP for IP assignment and management, but it cannot be extended to MANET due to its distributed and dynamic nature. Many solutions have been proposed, amongst them some are try to extend the stateless configuration of IPv6 for MANET; others distribute IP addresses among nodes (using binary distribution). Most of these proposed …

Keynote: The Segmentation Problem In Arabic Character Recognition: The State Of The Art, Ahmed M. Zeki

International Conference on Information and Communication Technologies

Arabic characters are used in several languages other than Arabic, despite to this fact; Arabic Character Recognition (ACR) has not received enough interests by researchers. Little researchprogress has been achieved comparing to the one done on the Latin or Chinese and the solutions available in the market are still far from being perfect. However, recent years have shown a considerable increase in the number of research papers. The cursive nature of Arabic writing makes the process of recognition a very challenging one. Several methods to segment the Arabic words into characters have been proposed in the past two decades. This …

A Visual Tool For Trellis Construction And Decoder Debugging Rac Array Codes, Lami Kaya, Muhammad -Al- Qudah

International Conference on Information and Communication Technologies

We have developed a visual tool for can be added to a specific RAC array positions and their effect can be easily determined by the help of the visual tool. The program environment has been set in a adaptive manner in order to change different parameters of the RAC codes and see their effect directly. decoding of row and column (RAC) array codes. The visual tool provides interface to view all paths corresponding selected input information bits. Errors constructing trellis diagram and tracing Viterbi.

A Performance Comparison Of Data Encryption Algorithms, Aamer Nadeem, Dr. M. Younus Javed

International Conference on Information and Communication Technologies

The principal goal guiding the design of any encryption algorithm must be security against unauthorized attacks. However, for all practical applications, performance and the cost of implementation are also important concerns. A data encryption algorithm would not be of much use if it is secure enough but slow in performance because it is a common practice to embed encryption algorithms in other applications such as e-commerce, banking, and online transaction processing applications. Embedding of encryption algorithms in other applications also precludes a hardware implementation, and is thus a major cause of degraded overall performance of the system. In this paper, …

Using Agents For Unification Of Information Extraction And Data Mining, Sharjeel Imtiaz, Azmat Hussain, Dr. Sikandar Hiyat

International Conference on Information and Communication Technologies

Early work for unification of information extraction and data mining is motivational and problem stated work. This paper proposes a solution framework for unification using intelligent agents. A Relation manager agent extracted feature with cross feedback approach and also provide a Unified Undirected graphical handle. An RPM agent an approach to minimize loop back proposes pooling and model utilization with common parameter for both text and entity level abstractions.

Visualization Of Retrieved Positive Data Using Blending Function, Muhammad Shoaib, Habib -Ur- Rehman, Dr. Abad Ali Shah

International Conference on Information and Communication Technologies

Data visualization is an important technique used in data mining. We present the retrieved data into visual format to discover features and trends inherent to the data. Some features of the data to be retrieved are already known to us. Visualization should preserve these known features inherent to the data. Positivity is one such known feature that is inherent to most of the scientific and business data sets. For example, mass, volume and percentage concentration are meaningful only when they are positive values. However certain visualization techniques do not guarantee to preserve this feature while constructing visualization of retrieved data …

Mobility-Pattern Based Localization Update Algorithm For Mobile Wireless Sensor Networks, Mohammad Yacoub Al-Laho

Electrical & Computer Engineering Theses & Dissertations

In mobile wireless sensor networks, sensors move in the monitored area at any direction and speed. Unlike many other networking hosts, sensor nodes do not have global addresses. They are often identified by using a location-based addressing scheme. Therefore, it is important to have the knowledge of the sensor location indicating where the data came from. In this thesis, three localization update algorithms were designed, Specifically, a sensor movement is divided into three states: Pause, Linear, and Random. Each state adopts different localization update algorithm. Since complex movement involves different mobility patterns, a state transition model is developed to …

Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao

Computer Science Faculty Publications

Clustering is well-suited for Web mining by automatically organizing Web pages into categories, each of which contains Web pages having similar contents. However, one problem in clustering is the lack of general methods to automatically determine the number of categories or clusters. For the Web domain in particular, currently there is no such method suitable for Web page clustering. In an attempt to address this problem, we discover a constant factor that characterizes the Web domain, based on which we propose a new method for automatically determining the number of clusters in Web page data sets. We discover that the …

Aggregate Nearest Neighbor Queries In Spatial Databases, Dimitris Papadias, Yufei Tao, Kyriakos Mouratidis, Chun Kit Hui

Research Collection School Of Computing and Information Systems

Given two spatial datasets P (e.g., facilities) and Q (queries), an aggregate nearest neighbor (ANN) query retrieves the point(s) of P with the smallest aggregate distance(s) to points in Q. Assuming, for example, n users at locations q1,...qn, an ANN query outputs the facility p belongs to P that minimizes the sum of distances |pqi| for 1 is less than or equal to i is less than or equal to n that the users have to travel in order to meet there. Similarly, another ANN query may report the point p belongs to P that minimizes the maximum distance that …

Parallel Versus Iterated: Comparing Population Oriented And Chained Sequential Simulated Annealing Approaches To Cost-Based Abduction, Heba Abdallah Amer

Archived Theses and Dissertations

Stochastic search techniques are used to solve NP-hard combinatorial optimization problems. Simulated annealing, genetic algorithms and hybridization of both, all attempt to find the best solution with minimal cost and time. Guided Evolutionary Simulated Annealing is one technique of such hybridization. It is based on evolutionary programming where a number of simulated annealing chains are working in a generation to find the optimum solution for a problem. Abduction is the problem of finding the best explanation to a given set of observations. In AI, this has been modeled by a set of hypotheses that need to be assumed to prove …

An Evolutionary Algorithm To Generate Hyper-Ellipsoid Detectors For Negative Selection, Joseph M. Shapiro, Gary B. Lamont, Gilbert L. Peterson

Faculty Publications

This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-spheres are a specialization of hyper-ellipsoids, hyper-ellipsoids retain the benefits of hyper-spheres. However, hyper-ellipsoids are much more flexible, mostly in that they can be stretched and reoriented. The viability of using hyper-ellipsoids is established using several pedagogical problems. We conjecture that fewer hyper-ellipsoids than hyper-spheres are needed to achieve similar coverage of nonself space in a negative selection problem. Experimentation validates this conjecture. In pedagogical benchmark problems, the number of hyper-ellipsoids to achieve good results is significantly …

Modeling Information Quality Expectation In Unmanned Aerial Vehicle Swarm Sensor Databases, Patrick D. Baldwin

Theses and Dissertations

Swarming Unmanned Aerial Vehicles (UAVs) are the future of Intelligence, Surveillance and Reconnaissance (ISR). Swarms of hundreds of these vehicles, each equipped with multiple sensors, will one day fill the skies over hostile areas. As the sensors collect hundreds of gigabytes of data, telemetry data links will be unable to transmit the complete data picture to the ground in real time. The collected data will be stored on board the UAVs and selectively downloaded through queries issued from analysts on the ground. Analysts expect to find relevant sensor data within the collection of acquired sensor data. This expectation is not …

An Evolutionary Algorithm To Generate Ellipsoid Detectors For Negative Selection, Joseph M. Shapiro

Theses and Dissertations

Negative selection is a process from the biological immune system that can be applied to two-class (self and nonself) classification problems. Negative selection uses only one class (self) for training, which results in detectors for the other class (nonself). This paradigm is especially useful for problems in which only one class is available for training, such as network intrusion detection. Previous work has investigated hyper-rectangles and hyper-spheres as geometric detectors. This work proposes ellipsoids as geometric detectors. First, the author establishes a mathematical model for ellipsoids. He develops an algorithm to generate ellipsoids by training on only one class of …

A Genetic Algorithm For Uav Routing Integrated With A Parallel Swarm Simulation, Matthew A. Russell

Theses and Dissertations

This research investigation addresses the problem of routing and simulating swarms of UAVs. Sorties are modeled as instantiations of the NP-Complete Vehicle Routing Problem, and this work uses genetic algorithms (GAs) to provide a fast and robust algorithm for a priori and dynamic routing applications. Swarms of UAVs are modeled based on extensions of Reynolds' swarm research and are simulated on a Beowulf cluster as a parallel computing application using the Synchronous Environment for Emulation and Discrete Event Simulation (SPEEDES). In a test suite, standard measures such as benchmark problems, best published results, and parallel metrics are used as performance …

A Three Dimensional Helmet Mounted Primary Flight Reference For Paratroopers, Jason I. Thompson

Theses and Dissertations

This thesis seeks to develop a Heads Up Display (HUD) presented on a Helmet Mounted Display (HMD), which presents a three-dimensional, graphical, predictive navigational reference to a paratrooper during a High Altitude, High Opening (HAHO) parachute jump. A Path Generating Algorithm (PGA) takes as input the Landing Zone's (LZ) location, the wind profile, and the paratrooper's parachute's performance characteristics, and returns a set of waypoints for the paratrooper to follow. The PGA attempts to maximize the distance that the paratrooper travels. The PGA's output is used to build a path to the LZ from a Release Point (RP). During the …

Determination Of Structure From Motion Using Aerial Imagery, Paul R. Graham

Theses and Dissertations

The structure from motion process creates three-dimensional models from a sequence of images. Until recently, most research in this field has been restricted to land-based imagery. This research examines the current methods of land-based structure from motion and evaluates their performance for aerial imagery. Current structure from motion algorithms search the initial image for features to track though the subsequent images. These features are used to create point correspondences between the two images. The correspondences are used to estimate the motion of the camera and then the three-dimensional structure of the scene. This research tests current algorithms using synthetic data …