Digital Commons Network^™

Characteristics Of Erp Software Maintenance: A Multiple Case Study, Fiona Fui-Hoon Nah, Silvana Faja, Teuta Cata

Research Collection School Of Computing and Information Systems

A multiple case study approach was employed to identify maintenance activities pertaining to enterprise resource planning (ERP) implementation, classify them into maintenance categories, and assess their relative frequency at various stages of the ERP maintenance lifecycle. Five maintenance categories (corrective, adaptive, perfective, preventive, user support) were identified from a review of the literature on software maintenance. A new category pertaining to ‘communication, coordination and knowledge exchange with external parties’ and herein labeled ‘external parties’ is introduced to highlight the supporting role of external parties in ERP maintenance. This category includes reporting problems to vendors and consultants, tracking their progress towards …

Automated Online News Classification With Personalization, Chee-Hong Chan, Aixin Sun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Classification of online news, in the past, has often been done manually. In our proposed Categorizor system, we have experimented an automated approach to classify online news using the Support Vector Machine (SVM). SVM has been shown to deliver good classification results when ample training documents are given. In our research, we have applied SVM to personalized classification of online news.

A Confidence Measure For Boundary Detection And Object Selection, William A. Barrett, Eric N. Mortensen

Faculty Publications

We introduce a confidence measure that estimates the assurance that a graph arc (or edge) corresponds to an object boundary in an image. A weighted, planar graph is imposed onto the watershed lines of a gradient magnitude image and the confidence measure is a function of the cost of fixed-length paths emanating from and extending to each end of a graph arc. The confidence measure is applied to automate the detection of object boundaries and thereby reduces (often greatly) the time and effort required for object boundary definition within a user-guided image segmentation environment.

Fast Focal Length Solution In Partial Panoramic Image Stitching, William A. Barrett, Kirk L. Duffin

Faculty Publications

Accurate estimation of effective camera focal length is crucial to the success of panoramic image stitching. Fast techniques for estimating the focal length exist, but are dependent upon a close initial approximation or the existence of a full circle panoramic image sequence. Numerical solutions of the focal length demonstrate strong coupling between the focal length and the angles used to position each component image about the common spherical center. This paper demonstrates that parameterizing panoramic image positions using spherical arc length instead of angles effectively decouples the focal length Ji.om the image position. This new parameterization does not require an …

Development Of A Systems Engineering Model Of The Chemical Separations Process: Quarterly Progress Report 8/16/01- 11/15/01, Yitung Chen, Randy Clarksean, Darrell Pepper

Separations Campaign (TRP)

The AAA program is developing technology for the transmutation of nuclear waste to address many of the long-term disposal issues. An integral part of this program is the proposed chemical separations scheme.

Two activities are proposed in this Phase I task: the development of a systems engineering model and the refinement of the Argonne code AMUSE (Argonne Model for Universal Solvent Extraction). The detailed systems engineering model is the start of an integrated approach to the analysis of the materials separations associated with the AAA Program. A second portion of the project is to streamline and improve an integral part …

Profile Combinatorics For Fragment Selection In Comparative Protein Structure Modeling, Deacon Sweeney, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Sequencing of the human genome was a great stride towards modeling cellular complexes, massive systems whose key players are proteins and DNA. A major bottleneck limiting the modeling process is structure and function annotation for the new genes. Contemporary protein structure prediction algorithms represent the sequence of every protein of known structure with a profile to which the profile of a protein sequence of unknown structure is compared for recognition. We propose a novel approach to increase the scope and resolution of protein structure profiles. Our technique locates equivalent regions among the members of a structurally similar fold family, and …

Parameter Synthesis Of Higher Kinematic Planars, Min-Ho Kyung, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.

Using Ssm Proxies To Provide Efficient Multiple-Source Multicast Delivery, Daniel Zappala, Aaron Fabbri

Faculty Publications

We consider the possibility that single-source multicast (SSM) will become a universal multicast service, enabling large-scale distribution of content from a few well-known sources to a general audience. Operating under this assumption, we explore the problem of building the traditional IP model of any-source multicast on top of SSM. Toward this end, we design an SSM proxy service that allows any sender to efficiently deliver content to a multicast group. We demonstrate the performance improvements this service offers over standard SSM and describe extensions for access control, dynamic proxy discovery, and multicast proxy distribution.

Ecdis Development Laboratory And Navigation Technology Demonstration Center, Lee Alexander, Maxim F. Van Norden, Charles M. Fralick

Center for Coastal and Ocean Mapping

The U.S. Navy is undergoing a major transition from traditional, paper chart navigation to computer-based electronic charting. The Chief of Naval Operations (CNO) has mandated that all Navy ships will navigate strictly through electronic means by FY07. However, due to some recent groundings, the Navy is now striving to accelerate the full implementation of electronic navigation by FY04. The Naval Oceanographic Office (NAVOCEANO) is making a concerted effort to support this transition with upgrades to state-of-the-art survey ships, instrumentation, and data processing equipment. NAVOCEANO is increasing its capability to rapidly collect and process hydrographic survey data, and to quickly produce …

Hierarchical Text Classification And Evaluation, Aixin Sun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Hierarchical Classification refers to assigning of one or more suitable categories from a hierarchical category space to a document. While previous work in hierarchical classification focused on virtual category trees where documents are assigned only to the leaf categories, we propose atop-down level-based classification method that can classify documents to both leaf and internal categories. As the standard performance measures assume independence between categories, they have not considered the documents incorrectly classified into categories that are similar or not far from the correct ones in the category tree. We therefore propose the Category-Similarity Measures and Distance-Based Measures to consider the …

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 good …

Computational Geometry Column 42, Joseph S. B. Mitchell, Joseph O'Rourke

Computer Science: Faculty Publications

A compendium of thirty previously published open problems in computational geometry is presented.

Prioritizing Test Cases For Regression Testing, Gregg Rothermel, Roland H. Untch, Chengyun Chu, Mary Jean Harrold

School of Computing: Faculty Publications

Test case prioritization techniques schedule test cases for execution in an order that attempts to increase their effectiveness at meeting some performance goal. Various goals are possible; one involves rate of fault detection - a measure of how quickly faults are detected within the testing process. An improved rate of fault detection during testing can provide faster feedback on the system under test and let software engineers begin correcting faults earlier than might otherwise be possible. One application of prioritization techniques involves regression testing - the retesting of software following modifications; in this context, prioritization techniques can take advantage of …

Sensor-Assisted Video Mosaicing For Seafloor Mapping, Yuri Rzhanov, Randy G. Cutter Jr., Lloyd C. Huff

Center for Coastal and Ocean Mapping

This paper discusses a proposed processing technique for combining video imagery with auxiliary sensor information. The latter greatly simplifies image processing by reducing complexity of the transformation model. The mosaics produced by this technique are adequate for many applications, in particular habitat mapping. The algorithm is demonstrated through simulations and hardware configuration is described.

Modeling And Simulation Of Steady State And Transient Behaviors For Emergent Socs, Joann M. Paul, Arne Suppe, Donald E. Thomas

Research Collection School Of Computing and Information Systems

We introduce a formal basis for viewing computer systems as mixed steady state and non-steady state (transient) behaviors to motivate novel design strategies resulting from simultaneous consideration of function, scheduling and architecture. We relate three design styles: Hierarchical decomposition, static mapping and directed platform that have traditionally been separate. By considering them together, we reason that once a steady state system is mapped to an architecture, the unused processing and communication power may be viewed as a platform for a transient system, ultimately resulting in more effective design approaches that ease the static mapping problem while still allowing for effective …

Jointly Coordinating Ecn And Tcp For Rapid Adaptation To Varying Bandwidth, Archan Misra, Teunis Ott

Research Collection School Of Computing and Information Systems

The introduction of service differentiation in the Internet implies that the residual bandwidth available to best-effort traffic becomes highly variable. We explore the design of a rapidly-reactive congestion control framework, where the ECN-aware best-effort flows aggressively go after any unused capacity. By making routers mark packets in a much more aggressive manner, we are able to achieve fast backoff in the network without resorting to the TCP's current drastic step of halving the congestion window. Simulations indicate that our ECN-mod protocol is better than ECN-NewReno in exploiting rapid variations in the available bandwidth. Moreover, the milder backoff policy of ECN-mod …

Mining Multi-Level Rules With Recurrent Items Using Fp'-Tree, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Association rule mining has received broad research in the academic and wide application in the real world. As a result, many variations exist and one such variant is the mining of multi-level rules. The mining of multi-level rules has proved to be useful in discovering important knowledge that conventional algorithms such as Apriori, SETM, DIC etc., miss. However, existing techniques for mining multi-level rules have failed to take into account the recurrence relationship that can occur in a transaction during the translation of an atomic item to a higher level representation. As a result, rules containing recurrent items go unnoticed. …

Hierarchical Mobility Management For Voip Traffic, Archan Misra, Subir Das, Anthony J. Mcauley

Research Collection School Of Computing and Information Systems

A hierarchical IP-based mobility management mechanism is proposed for VoIP applications. The suggested mechanism uses the DMA (dynamic mobility agent) architecture, based on IDMP (intra-domain mobility management protocol), for managing intra-domain mobility and the dynamic binding mechanism of SIP (session initiation protocol) for managing global mobility. This combination of network and application layer mobility management reduces the global signaling load, provides fast handoff for ongoing conversations, enables efficient global transport and supports IP-layer paging.

An Object-Oriented Resource Pool Model In Support Of Discrete Event Simulations, Srinivas Gullapalli

Electrical & Computer Engineering Theses & Dissertations

The proper distribution of resources is a key factor in simulation. Resources provide the supporting facilities, equipment, and personnel for carrying out activities. The number of resources has a direct impact on the overall effectiveness of the simulation as it does in real life. If the number is insufficient, it generally takes more time for the process to complete. On the other hand, if the number is too high, the cost incurred on the resources will be unnecessarily large. Therefore, the count should be a compromise between the two extremes.

In this thesis, an attempt is made to generalize the …

Computing Cyclomatic Complexity With Cubic Flowgraphs, Yongming Tang, Ali H. Dogru, Franz J. Kurfess, Murat M. Tanik

Computer Science and Software Engineering

Two new methods for the computation of cyclomatic complexity especially for decomposable representations are introduced. Building software by integration is a developing paradigm, especially enabled by the emerging component technologies. Decomposition of the design for a top-down approach is a prerequisite for this paradigm. Cubic flowgraphs are instrumental in providing formalisms for decomposition and integration. Cyclomatic complexity analysis of a design representation that is decomposable is the goal of this research. In addition to introducing cyclomatic complexity computation using cubic flowgraphs, preservation of cyclomatic complexity in the decomposition of the cubic flowgraph is also presented.

The Impact Of Test Suite Granularity On The Costeffectiveness Of Regression Testing, Gregg Rothermel, Sebastian Elbaum, Alexey Malishevsky, Praveen Kallakuri, Brian Davia

School of Computing: Technical Reports

Regression testing is an expensive testing process used to validate software following modifications. The cost-effectiveness of regression testing techniques varies with characteristics of test suites. One such characteristic, test suite granularity, involves the way in which test inputs are grouped into test cases within a test suite. Various cost-benefits tradeoffs have been attributed to choices of test suite granularity, but almost no research has formally examined these tradeoffs. To address this lack, we conducted several controlled experiments, examining the effects of test suite granularity on the costs and benefits of several controlled experiments, examining the effects of test suite granularity …

Detecting Steganographic Messages In Digital Images, Hany Farid

Computer Science Technical Reports

Techniques and applications for information hiding have become increasingly more sophisticated and widespread. With high-resolution digital images as carriers, detecting the presence of hidden messages has also become considerably more difficult. It is sometimes possible, nevertheless, to detect (but not necessarily decipher) the presence of embedded messages. The basic approach taken here works by finding predictable higher-order statistics of ``natural'' images within a multi-scale decomposition, and then showing that embedded messages alter these statistics.

Online Bayesian Tree-Structured Transformation Of Hmms With Optimal Model Selection For Speaker Adaptation, Shaojun Wang, Yunxin Zhao

Kno.e.sis Publications

This paper presents a new recursive Bayesian learning approach for transformation parameter estimation in speaker adaptation. Our goal is to incrementally transform or adapt a set of hidden Markov model (HMM) parameters for a new speaker and gain large performance improvement from a small amount of adaptation data. By constructing a clustering tree of HMM Gaussian mixture components, the linear regression (LR) or affine transformation parameters for HMM Gaussian mixture components are dynamically searched. An online Bayesian learning technique is proposed for recursive maximum a posteriori (MAP) estimation of LR and affine transformation parameters. This technique has the advantages of …

Intelligent Grouping Of Tcp Flows For Coordinated Congestion Management, Hoi Chang, Rajeev Gopalakrishna, Venkatesh Prabhakar

Department of Computer Science Technical Reports

No abstract provided.

Tcp Congestion Control: Overview And Survey Of Ongoing Research, Sonia Fahmy, Tapan Prem Karwa

Department of Computer Science Technical Reports

No abstract provided.

A Transaction Model To Improve Data Availability In Mobile Computing, Sanjay Kumar Madria, Bharat Bhargava

Computer Science Faculty Research & Creative Works

We incorporate a prewrite operation before a write operation in a mobile transaction to improve data availability. A prewrite operation does not update the state of a data object but only makes visible the future value that the data object will have after the final commit of the transaction. Once a transaction reads all the values and declares all the prewrites, it can pre-commit at mobile host (MH) (computer connected to unreliable mobile communication network). The remaining transaction's execution (writes on database) is shifted to the mobile service station (MSS) (computer connected to the reliable fixed network). Writes on database …

Computationally Efficient Search For Large Primes, Wieslawa E. Amber

Theses

To satisfy the speed of communication and to meet the demand for the continuously larger prime numbers, the primality testing and prime numbers generating algorithms require continuous advancement. To find the most efficient algorithm, a need for a survey of methods arises. Concurrently, an urge for the analysis of algorithms' performances emanates. The critical criteria in the analysis of the prime numbers generation are the number of probes, number of generated primes, and an average time required in producing one prime. Hence, the purpose of this thesis is to indicate the best performing algorithm. The survey the methods, establishment of …

Using Software Engineering Metrics In Ap Modularization., Kwaku Owusu-Tieku

Electronic Theses and Dissertations

Significant amount of work has been done in software engineering in terms of reuse. With the use of object-orientation and design patterns that support the development of reusable modules, it appears that the development and reuse of software modules in creating new systems is becoming more and more common. The software engineering world, however has taken reuse more seriously than database; more research and improvement in reuse has been made in software engineering than in database. This paper investigates how software engineering metrics can be applied in the development of reusable database modules. This research provides a model for predicting …

Video Partitioning By Temporal Slice Coherency, Chong-Wah Ngo, Ting-Chuen Pong, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a novel approach for video partitioning by detecting three essential types of camera breaks, namely cuts, wipes, and dissolves. The approach is based on the analysis of temporal slices which are extracted from the video by slicing through the sequence of video frames and collecting temporal signatures. Each of these slices contains both spatial and temporal information from which coherent regions are indicative of uninterrupted video partitions separated by camera breaks. Properties could further be extracted from the slice for both the detection and classification of camera breaks. For example, cut and wipes are detected by color-texture properties, …

Real-Time Travel Time Estimation Using Macroscopic Traffic Flow Models, Pushkin Kachroo, Kaan Ozbay, Antoine G. Hobeika

Electrical & Computer Engineering Faculty Research

This paper presents the estimation of travel time on highways based on macroscopic modelling. The focus is on real-time values as compared to average or static values. The macroscopic models are used for distributed and time/space lumped settings and corresponding travel time estimation functions and algorithms are developed. The implications of these algorithms for the implementation of various incident management and traffic control strategies are also discussed.