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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 27571 - 27600 of 30346

Full-Text Articles in Entire DC Network

Automatic Annotation Of Database Images For Query-By-Concept, Nualsawat Hiransakolwong Jan 2004

Automatic Annotation Of Database Images For Query-By-Concept, Nualsawat Hiransakolwong

Electronic Theses and Dissertations

As digital images become ubiquitous in many applications, the need for efficient and effective retrieval techniques is more demanding than ever. Query by Example (QBE) and Query by Concept (QBC) are among the most popular query models. The former model accepts example images as queries and searches for similar ones based on low-level features such as colors and textures. The latter model allows queries to be expressed in the form of high-level semantics or concept words, such as "boat" or "car," and finds images that match the specified concepts. Recent research has focused on the connections between these two models …


Toward Building A Social Robot With An Emotion-Based Internal Control, Andreas Marpaung Jan 2004

Toward Building A Social Robot With An Emotion-Based Internal Control, Andreas Marpaung

Electronic Theses and Dissertations

In this thesis, we aim at modeling some aspects of the functional role of emotions on an autonomous embodied agent. We begin by describing our robotic prototype, Cherry--a robot with the task of being a tour guide and an office assistant for the Computer Science Department at the University of Central Florida. Cherry did not have a formal emotion representation of internal states, but did have the ability to express emotions through her multimodal interface. The thesis presents the results of a survey we performed via our social informatics approach where we found that: (1) the idea of having emotions …


Metadata And Buckets In The Smart Object, Dumb Archive (Soda) Model, Michael L. Nelson, Kurt Maly, Delwin R. Croom Jr., Steven W. Robbins Jan 2004

Metadata And Buckets In The Smart Object, Dumb Archive (Soda) Model, Michael L. Nelson, Kurt Maly, Delwin R. Croom Jr., Steven W. Robbins

Computer Science Faculty Publications

We present the Smart Object, Dumb Archive (SODA) model for digital libraries (DLs), and discuss the role of metadata in SODA. The premise of the SODA model is to "push down" many of the functionalities generally associated with archives into the data objects themselves. Thus the data objects become "smarter", and the archives "dumber". In the SODA model, archives become primarily set managers, and the objects themselves negotiate and handle presentation, enforce terms and conditions, and perform data content management. Buckets are our implementation of smart objects, and da is our reference implementation for dumb archives. We also present our …


Optimal Design Of Engineering Systems Using Mpi-Enabled Genetic Algorithm, S. D. Rajan, D. T. Nguyen, M. D. Deshpande, L. Harrell Jan 2004

Optimal Design Of Engineering Systems Using Mpi-Enabled Genetic Algorithm, S. D. Rajan, D. T. Nguyen, M. D. Deshpande, L. Harrell

Civil & Environmental Engineering Faculty Publications

The focus of this paper is on the development and implementation of a genetic algorithm (GA)-based software system using message passing interface (MPI) protocol and library. A customized form of simple GA used in previous research [1-4] is parallelized. This MPI-enabled version is used to find the solution to finite element based design optimization problems. Results show that an almost linear speedup is obtained on homogenous hardware cluster and, with proper reworking of the software, on heterogeneous hardware cluster.


Disjoint Np-Pairs, Christian Glasser, Alan L. Selman, Samik Sengupta, Liyu Zhang Jan 2004

Disjoint Np-Pairs, Christian Glasser, Alan L. Selman, Samik Sengupta, Liyu Zhang

Computer Science Faculty Publications

We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provides additional evidence for the existence of P-inseparable disjoint NP-pairs. We construct an oracle relative to which the class of disjoint NP-pairs does not have a complete pair; an oracle relative to which …


Integrating Experiments And Simulators Into A Distributed E-Learning Environment, Frank Koehler Jan 2004

Integrating Experiments And Simulators Into A Distributed E-Learning Environment, Frank Koehler

Theses

New information and communication technologies have emerged in the last few years which have made an impact on learning at all levels. At universities, the spectrum of learning support ranges from enriching traditional lectures and courses with multi- media elements to complete web-based interactive learning environments. A special aspect based on the new media technologies is learning within model worlds by use of simulations or real-life experiments. There are normally no links between these applications and the learning content, so it is impossible to tap the full potential of these applications. Research activities in the area of e-learning underline the …


Virtual Personal Assistants In A Pervasive Computing World, John F. Bradley, Brian R. Duffy, Gregory O'Hare, Alan Martin, Bianca Schoen-Phelan Jan 2004

Virtual Personal Assistants In A Pervasive Computing World, John F. Bradley, Brian R. Duffy, Gregory O'Hare, Alan Martin, Bianca Schoen-Phelan

Conference papers

Computing paradigms are constantly evolving-from mainframe to desktop, and on to ubiquitous computing. With a wide variety of devices, each with varying constraints, it would be quite difficult to develop services that would operate in a uniform manner across all platforms. With this in mind we offer an agent based solution. Agent attributes of autonomy, adaptability and mobility make them highly suitable for use in pervasive computing environments. Agent Chameleons illustrates a framework for Virtual Personal Assistants (VPA) for the information age. This paper briefly outlines some of the technologies and concepts that underpin the functionality of a VPA.


Developing Software For Wound Measurement, Savo Kordic Jan 2004

Developing Software For Wound Measurement, Savo Kordic

Theses : Honours

Chronic wounds such as leg ulcers, pressure ulcers and diabetic ulcers affect many thousands of people in Australia. In addition to the costs of these wounds in terms of human suffering, loss of income and resources, there are costs related to the treatment of ulcers. Thus, there is a genuine need to develop an accurate and a fully objective application for wound measurement. The aim of this project was to create software for the measurement of wounds. In achieving this goal, several issues were addressed: an accurate measurement method capable of detecting small changes in an open wound surface area, …


Exploring The Possibilities Of Three Dimensional Image Manipulations On Mobile Devices, Thanuja Nuwan Hettiarachchi Jan 2004

Exploring The Possibilities Of Three Dimensional Image Manipulations On Mobile Devices, Thanuja Nuwan Hettiarachchi

Theses : Honours

With the introduction of more powerful mobile microprocessors and colour screen technology, complex image manipulations on various mobile devices such as mobile phones and handheld devices have become a reality. As a consequence of these improvements, there has been an increasing demand by users for interactive computer games which produce complex graphics by utilizing these advanced hardware technologies. Three dimensional (3D) graphics have been used to produce realistic interactive imaging for computer games during recent years. Java, through its mobile device programming platform, provides the framework for such complex image manipulations in computer games deployed on Java compatible mobile devices. …


Analysis Of A Yield Management Model For On Demand Computing Centers, Yezekael Hayel, Laura Wynter, Parijat Dube Jan 2004

Analysis Of A Yield Management Model For On Demand Computing Centers, Yezekael Hayel, Laura Wynter, Parijat Dube

Research Collection School Of Computing and Information Systems

The concept of yield management for IT infrastructures, and in particular for on demand IT utilities was recently introduced in [17]. The present paper provides a detailed analysis of that model, both in simplified cases where an analytical analysis is possible, and numerically on larger problem instances, and confirms the significant revenue benefit that can accrue through use of yield management in an IT on demand operating environment.


Resource Harvesting Within The Oai-Pmh Framework, Herbert Van De Sompel, Michael L. Nelson, Carl Lagoze, Simeon Warner Jan 2004

Resource Harvesting Within The Oai-Pmh Framework, Herbert Van De Sompel, Michael L. Nelson, Carl Lagoze, Simeon Warner

Computer Science Faculty Publications

Motivated by preservation and resource discovery, we examine how digital resources, and not just metadata about resources, can be harvested using the Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH). We review and critique existing techniques for identifying and gathering digital resources using metadata harvested through the OAI-PMH. We introduce an alternative solution that builds on the introduction of complex object formats that provide a more accurate way to describe digital resources. We argue that the use of complex object formats as OAI-PMH metadata formats results in a reliable and attractive approach for incremental harvesting of resources using the OAI-PMH.


Survivable Virtual Topology Routing Under Shared Risk Link Groups In Wdm Networks, Ajay Todimala, Byrav Ramamurthy Jan 2004

Survivable Virtual Topology Routing Under Shared Risk Link Groups In Wdm Networks, Ajay Todimala, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Network survivability is one of the most important issues in the design of optical WDM networks. In this work we study the problem of survivable routing of a virtual topology on a physical topology with Shared Risk Link Groups (SRLG). The survivable virtual topology routing problem against single-link failures in the physical topology is proved to be NP-complete in [1]. We prove that survivable virtual topology routing problem against SRLG/node failures is also NP-complete. We present an improved integer linear programming (ILP) formulation (in comparison to [1]) for computing the survivable routing under SRLG/node failures. Using an ILP solver, we …


Imsh: An Iterative Heuristic For Srlg Diverse Routing In Wdm Mesh Networks, Ajay Todimala, Byrav Ramamurthy Jan 2004

Imsh: An Iterative Heuristic For Srlg Diverse Routing In Wdm Mesh Networks, Ajay Todimala, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Survivable routing of a connection involves computation of a pair of diverse routes such that at most one mute fails when failures occur in the network topology. A subset of links in the network that share the risk of failure at the same time are said to belong to a Shared Risk Link Group (SRLG) [3]. A network with shared risk link groups defined over its links is an SRLG network. A failure of an SRLG is equivalent to the failure of all the links in the SRLG. For a connection to he survivable in an SRLG network its working …


Rerouting Schemes For Dynamic Traffic Grooming In Optical Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy Jan 2004

Rerouting Schemes For Dynamic Traffic Grooming In Optical Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Traffic grooming in optical WDM mesh networks is a two-layer routing problem to effectively pack low-rate connections onto high-rate lightpaths, which, in turn, are established on wavelength links. In this work, we employ the rerouting approach to improve the network throughput under the dynamic traffic model. We propose two rerouting schemes, rerouting at lightpath level (RRAL) and rerouting at connection level (RRAC). A qualitative comparison is made between RRAL and RRAC. We also propose the critical-wavelength-avoiding one-lightpath-limited (CWA-1L) and critical-lightpath-avoiding one-connection-limited (CLA-1C) rerouting heuristics, which are based on the two rerouting schemes respectively. Simulation results show that rerouting reduces the …


Maximizing Resource Sharing In Wdm Mesh Networks With Path-Based Protection And Sparse Oeo Regeneration, Xi Yang, Byrav Ramamurthy, Lu Shen Jan 2004

Maximizing Resource Sharing In Wdm Mesh Networks With Path-Based Protection And Sparse Oeo Regeneration, Xi Yang, Byrav Ramamurthy, Lu Shen

School of Computing: Conference and Workshop Papers

We propose a resource-sharing scheme that supports three kinds of sharing scenarios in a WDM mesh network with path-based protection and sparse OEO regeneration. Several approaches are used to maximize the sharing of wavelength-links and OEO regenerators.


Survivable Traffic Grooming With Path Protection At The Connection Level In Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy Jan 2004

Survivable Traffic Grooming With Path Protection At The Connection Level In Wdm Mesh Networks, Wang Yao, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the …


Using Source-Code Analysis To Help End-User Programmers Create Dependable Software, Gregg Rothermel Jan 2004

Using Source-Code Analysis To Help End-User Programmers Create Dependable Software, Gregg Rothermel

School of Computing: Conference and Workshop Papers

Not long ago, most software was written by professional programmers, who could be presumed to have an interest in software engineering methodologies and in tools and techniques for improving software dependability. Today, however, a great deal of software is written not by professionals but by end-users, who create applications such as multimedia simulations, dynamic web pages, and spreadsheets. Applications such as these are often used to guide important decisions or aid in important tasks, and it is important that they be sufficiently dependable, but evidence shows that they frequently are not. For example, studies have shown that a large percentage …


Empirical Studies Of Test Case Prioritization In A Junit Testing Environment, Hyunsook Do, Gregg Rothermel, Alex Kinneer Jan 2004

Empirical Studies Of Test Case Prioritization In A Junit Testing Environment, Hyunsook Do, Gregg Rothermel, Alex Kinneer

School of Computing: Conference and Workshop Papers

Test case prioritization provides a way to run test cases with the highest priority earliest. Numerous empirical studies have shown that prioritization can improve a test suite’s rate of fault detection, but the extent to which these results generalize is an open question because the studies have all focused on a single procedural language, C, and a few specific types of test suites. In particular, Java and the JUnit testing framework are being used extensively in practice, and the effectiveness of prioritization techniques on Java systems tested under JUnit has not been investigated. We have therefore designed and performed a …


Powerful Change Part 2: Reducing The Power Demands Of Mobile Devices, Rajesh Krishna Balan Jan 2004

Powerful Change Part 2: Reducing The Power Demands Of Mobile Devices, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Consumers expect their mobile devices to be small and light, have a decent battery lifetime, and still be powerful enough to run all their desired applications. The need to satisfy such consumer demands has driven mobile-device manufacturers to make products (such as PDAs and cell phones) that match these needs. However, this inevitably requires tradeoffs. Building smaller, lighter devices requires sacrificing the device's battery capacity because battery technology is still fairly dense and heavy, and contributes most of a mobile device's size and weight. But, mobile devices with the required resources to run useful desktop applications need additional battery power …


A Secure And Privacy Enhanced Location-Based Service Transaction Protocol In Ubiquitous Computing Environment, Konidala Divyan, Robert H. Deng, Jianying Zhou, Kwanjo Kim Jan 2004

A Secure And Privacy Enhanced Location-Based Service Transaction Protocol In Ubiquitous Computing Environment, Konidala Divyan, Robert H. Deng, Jianying Zhou, Kwanjo Kim

Research Collection School Of Computing and Information Systems

Nowadays mobile phones and PDAs are part and parcel of our lives. By carrying a portable mobile device with us all the time we are already living in partial Pervasive Computing Environment (PCE) that is waiting to be exploited very soon. One of the advantages of pervasive computing is that it strongly supports the deployment of Location-Based Service(s) (LBSs). In PCE, there would be many competitive service providers (SPs) trying to sell different or similar LBSs to users. In order to avail a particular service, it becomes very di#cult for a low-computing and resourcepoor mobile device to handle many such …


Web Usage Mining: Algorithms And Results, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng Jan 2004

Web Usage Mining: Algorithms And Results, Ee Peng Lim, Yew-Kwong Woon, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

No abstract provided.


Viscors: A Visual-Content Recommender For The Mobile Web, Chan Young Kim, Jae Kyu Lee, Yoon Ho Cho, Deok Hwan Kim Jan 2004

Viscors: A Visual-Content Recommender For The Mobile Web, Chan Young Kim, Jae Kyu Lee, Yoon Ho Cho, Deok Hwan Kim

Research Collection School Of Computing and Information Systems

Current search methods for mobile-Web content can be frustrating to use. To shorten searches for cell phone wallpaper images, VISCORS combines collaborative filtering with content-based image retrieval. An increasing selection of content is becoming available in the mobile-Web environment, where users navigate the Web using wireless devices such as cell phones and PDAs. The fast growth and excellent prospects of the mobile-Web content market have attracted many content providers.


Logistics Outsourcing And 3pl Challenges, Michelle L. F. Cheong Jan 2004

Logistics Outsourcing And 3pl Challenges, Michelle L. F. Cheong

Research Collection School Of Computing and Information Systems

Logistics has been an important part of every economy and every business entity. The worldwide trend in globalization has led to many companies outsourcing their logistics function to Third-Party Logistics (3PL) companies, so as to focus on their core competencies. This paper attempts to broadly identify and categorize the challenges faced by 3PL companies and discover potential gaps for future research. Some of the challenges will be related with the experience and information collected from interviews with two 3PL companies.


Recent Trends In Software Engineering Research As Seen Through Its Publications, Terry L. Smith Jan 2004

Recent Trends In Software Engineering Research As Seen Through Its Publications, Terry L. Smith

UNF Graduate Theses and Dissertations

This study provides some insight into the field of software engineering through analysis of its recent research publications. Data for this study are taken from the ACM's Guide to Computing Literature (GUIDE) They include both the professionally assigned Computing Classification System (CCS) descriptors and the title text of each software engineering publication reviewed by the GUIDE from 1998 through 2001.

The first part of this study provides a snapshot of software engineering by applying co-word analysis techniques to the data. This snapshot indicates recent themes or areas of interest, which, when compared with the results from earlier studies, reveal current …


Preconceived Physician Attitude Toward Computerized Physician Order Entry (Cpoe): Implications For Successful Implementation, John Arthur Hoffstatter Jan 2004

Preconceived Physician Attitude Toward Computerized Physician Order Entry (Cpoe): Implications For Successful Implementation, John Arthur Hoffstatter

UNF Graduate Theses and Dissertations

There has been a societal and legislative push to implement computerized physician order entry (CPOE) systems throughout hospitals nationally in recent years due in large part to the public's awareness of an inordinate number of patient deaths due to medication errors in hospital settings. This mortality, and untold morbidity, became even more unacceptable when published findings suggested the majority of these 100,000 deaths each year could be avoided through the use of CPOE systems.

Yet acceptance has been slow and only a fraction of the hospitals have implemented this technology due to large start up costs, enormous technological requirements, and …


A Test Suite Generator For Struts Based Applications, Gregory M. Jackson Jan 2004

A Test Suite Generator For Struts Based Applications, Gregory M. Jackson

UNF Graduate Theses and Dissertations

Testing web-based enterprise applications requires the use of automated testing frameworks. The testing framework's ability to run suites of test cases through development ensures enhancements work as required and have not caused defects in previously developed sub systems. Open source testing frameworks like JUnit and Cactus have addressed the requirements to test web-based enterprise applications, however they do not address the generation of test cases based on direct analysis of the code under test.

This paper presents a tool to generate test cases for web-based enterprise applications. The generator focuses on creating test cases used to test applications built on …


Anomaly-Free Component Adaptation With Class Overriding, Atanas Radenski Jan 2004

Anomaly-Free Component Adaptation With Class Overriding, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Software components can be implemented and distributed as collections of classes, then adapted to the needs of specific applications by means of subclassing. Unfortunately, subclassing in collections of related classes may require re-implementation of otherwise valid classes just because they utilize outdated parent classes, a phenomenon that is referred to as the subclassing anomaly. The subclassing anomaly is a serious problem since it can void the benefits of component-based programming altogether. We propose a code adaptation language mechanism called class overriding that is intended to overcome the subclassing anomaly. Class overriding does not create new and isolated derived classes as …


Pperfgrid: A Grid Services-Based Tool For The Exchange Of Heterogeneous Parallel Performance Data, John Jared Hoffman Jan 2004

Pperfgrid: A Grid Services-Based Tool For The Exchange Of Heterogeneous Parallel Performance Data, John Jared Hoffman

Dissertations and Theses

This thesis details the approach taken in developing PPerfGrid. Section 2 discusses other research related to this project. Section 3 provides general background on the technologies utilized in PPerfGrid, focusing on the components that make up the Grid services architecture. Section 4 provides a description of the architecture of PPerfGrid. Section 5 details the implementation of PPerfGrid. Section 6 presents tests designed to measure the overhead and scalability of the PPerfGrid application. Section 7 suggests future work, and Section 8 concludes the thesis.


[Introduction To] Data Structures With Java, John R. Hubbard, Anita Huray Jan 2004

[Introduction To] Data Structures With Java, John R. Hubbard, Anita Huray

Bookshelf

For a freshman/sophomore-level course in Data Structures in Computer Science. This text teaches the use of direct source code implementations and the use of the Java libraries; it helps students prepare for later work on larger Java software solutions by adhering to software engineering principles and techniques such as the UML and the Java Collections Framework (JCF). Using the spiral approach to cover such topics as linked structures, recursion, and algorithm analysis, this text also provides revealing illustrations, summaries, review questions, and specialized reference sections.


Experimenting With Tcpa/Tcg Hardware, Or: How I Learned To Stop Worrying And Love The Bear, John Marchesini, Sean Smith, Omen Wild, Rich Macdonald Dec 2003

Experimenting With Tcpa/Tcg Hardware, Or: How I Learned To Stop Worrying And Love The Bear, John Marchesini, Sean Smith, Omen Wild, Rich Macdonald

Computer Science Technical Reports

Over the last few years, our group has been working on applications of secure coprocessors---but has been frustrated by the limited computational environment and high expense of such devices. Over the last few years, the TCPA (now TCG) has produced a specification for a trusted platform module (TPM)---a small hardware addition intended to improve the overall security of a larger machine (and tied up with a still-murky vision of Windows-based trusted computing). Some commodity desktops now come up with these TPMs. Consequently, we began an experiment to see if (in the absence of a Non-Disclosure Agreement) we could use this …