Digital Commons Network^™

An Evaluation Of Decision Tree And Survival Analysis Techniques For Business Failure Prediction, Adrian Gepp

Adrian Gepp

Accurate business failure prediction models would be extremely valuable to many industry sectors, particularly in financial investment and lending. The potential value of such models has been recently emphasised by the extremely costly failure of high profile businesses in both Australia and overseas, such as HIH (Australia) and Enron (USA). Consequently, there has been a significant increase in interest in business failure prediction, from both industry and academia. Statistical models attempt to predict the failure or success of a business based on publicly available information about that business (or its industry and the overall economy), such as accounting ratios from …

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 …

Implications Of Spatial Autocorrelation And Dispersal For The Modeling Of Species Distributions, Volker Bahn

Electronic Theses and Dissertations

Modeling the geographical distributions of wildlife species is important for ecology and conservation biology. Spatial autocorrelation in species distributions poses a problem for distribution modeling because it invalidates the assumption of independence among sample locations. I explored the prevalence and causes of spatial autocorrelation in data from the Breeding Bird Survey, covering the conterminous United States, using Regression Trees, Conditional Autoregressive Regressions (CAR), and the partitioning of variance. I also constructed a simulation model to investigate dispersal as a process contributing to spatial autocorrelation, and attempted to verify the connection between dispersal and spatial autocorrelation in species' distributions in empirical …

A Case For Exhaustive Optimization, Sanza Kazadi, Michele Lee, Lauren Lee

Sanza Kazadi

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 …

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 …

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 …

Robot Mapping With Real-Time Incremental Localization Using Expectation Maximization, Kevin L. Owens

Theses and Dissertations

This research effort explores and develops a real-time sonar-based robot mapping and localization algorithm that provides pose correction within the context of a single room, to be combined with pre-existing global localization techniques, and thus produce a single, well-formed map of an unknown environment. Our algorithm implements an expectation maximization algorithm that is based on the notion of the alpha-beta functions of a Hidden Markov Model. It performs a forward alpha calculation as an integral component of the occupancy grid mapping procedure using local maps in place of a single global map, and a backward beta calculation that considers the …

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 …

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 …

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 …

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 …

Fibonacci In Contextures, An Application, Rudolf Kaehr

Rudolf Kaehr

No abstract provided.

Contextures. Programming Dynamic Complexity, Rudolf Kaehr

Rudolf Kaehr

No abstract provided.

Gödel Games: "Cloning Gödel's Proofs", Rudolf Kaehr

Rudolf Kaehr

Gödel's Proofs in the context of beautifying (Hehner) and re-beautifying in polycontextural logic. Deconstruction of the relevance.

Lambda Calculi In Polycontextural Situations, Rudolf Kaehr

Rudolf Kaehr

No abstract provided.

Polylogics. Towards A Formalization Of Polycontextural Logics, Rudolf Kaehr

Rudolf Kaehr

No abstract provided.

Srt Division Algorithms As Dynamical Systems, Mark Mccann, Nicholas Pippenger

All HMC Faculty Publications and Research

Sweeney--Robertson--Tocher (SRT) division, as it was discovered in the late 1950s, represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division is still commonly implemented in computers today. Although some bounds on the performance of the original SRT division method were obtained, a great many questions remained unanswered. In this paper, the original version of SRT division is described as a dynamical system. This enables us to bring modern dynamical systems theory, a relatively new development in mathematics, to bear on an older problem. In doing so, we are able …

Introduction: Data Communication And Topology Algorithms For Sensor Networks, Stephan Olariu, David Simplot-Ryl, Ivan Stojmenovic

Computer Science Faculty Publications

(First paragraph) We are very proud and honored to have been entrusted to be Guest Editors for this special issue. Papers were sought to comprehensively cover the algorithmic issues in the “hot” area of sensor networking. The concentration was on network layer problems, which can be divided into two groups: data communication problems and topology control problems. We wish to briefly introduce the five papers appearing in this special issue. They cover specific problems such as time division for reduced collision, fault tolerant clustering, self-stabilizing graph optimization algorithms, key pre-distribution for secure communication, and distributed storage based on spanning trees …

Rcu Semantics: A First Attempt, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

There is not yet a formal statement of RCU (read-copy update) semantics. While this lack has thus far not been an impediment to adoption and use of RCU, it is quite possible that formal semantics would point the way towards tools that automatically validate uses of RCU or that permit RCU algorithms to be automatically generated by a parallel compiler. This paper is a first attempt to supply a formal definition of RCU. Or at least a semi-formal definition: although RCU does not yet wear a tux (though it does run in Linux), at least it might yet wear some …