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 55981 - 56010 of 63428

Full-Text Articles in Entire DC Network

Storage Coalescing, Delvin C. Defoe Oct 2003

Storage Coalescing, Delvin C. Defoe

All Computer Science and Engineering Research

Typically, when a program executes, it creates objects dynamically and requests storage for its objects from the underlying storage allocator. The patterns of such requests can potentially lead to internal fragmentation as well as external fragmentation. Internal fragmentation occurs when the storage allocator allocates a contiguous block of storage to a program, but the program uses only a fraction of that block to satisfy a request. The unused portion of that block is wasted since the allocator cannot use it to satisfy a subsequent allocation request. External fragmentation, on the other hand, concerns chunks of memory that reside between allocated …

Go to article

Data Mining And Mining Disasters: Terrorism Information Awareness, Ibpp Editor Oct 2003

Data Mining And Mining Disasters: Terrorism Information Awareness, Ibpp Editor

International Bulletin of Political Psychology

This article identifies problems with data mining approaches to antiterrorism and counterterrorism.

Go to article

The Psychology Of Intelligent Video Analysis, Ibpp Editor Oct 2003

The Psychology Of Intelligent Video Analysis, Ibpp Editor

International Bulletin of Political Psychology

This article examines issues surrounding software-enhanced video analysis in an intelligence context.

Go to article

Ustranscom: Corporate Information-Centric Environment, Collaborative Agent Design Research Center Oct 2003

Ustranscom: Corporate Information-Centric Environment, Collaborative Agent Design Research Center

Collaborative Agent Design (CAD) Research Center

As a result of foresight and planning that has established a logical data model (i.e., the Master Model), a set of standard reference tables and 17 migration software systems as the foundation of a disciplined Corporate Data Environment (CDE), USTRANSCOM now finds itself in the enviable position of being able to implement DoD’s vision of a Global Information Grid (GIG) with speed and confidence. The urgency with which DoD views the need to shift the burden of tedious data filtering and interpretation tasks from human operators to automated machine-based processes, is reflected in the CDE and provides the opportunity for …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 2, October 2003, College Of Engineering And Computer Science, Wright State University Oct 2003

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 2, October 2003, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Go to article

Where's (The) Computer Science In Service-Learning?, Pete Sanderson Oct 2003

Where's (The) Computer Science In Service-Learning?, Pete Sanderson

Mathematics Faculty Scholarship

Service-learning is a form of experiential learning that integrates classroom concepts with related community service. Computer science faculty and students stand to reap great benefit from the integration of service-learning practice and philosophy into curricula. Many faculty are already doing so, yet computer science is not very visible in the service-learning community. Similarly, service-learning is not very visible in the computer science education community. It is imperative for those computer science faculty involved in service-learning to develop, apply and disseminate effective frameworks for integrating service learning into undergraduate computer science curricula so that its benefits may be more fully realized.

Go to article

Split Knowledge Level Modeling, Michael A. Zang, Jens G. Pohl Oct 2003

Split Knowledge Level Modeling, Michael A. Zang, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

Traditional approaches to building intelligent information systems employ an object model to define a representational structure for the information of interest within the target domain of the system. At runtime, the model provides a constrained template for the creation of the individual object instances and relationships that together define the state of the system at a given point in time. The ontology also provides a vocabulary for expressing domain knowledge typically in the form of rules (declarative knowledge) or methods (procedural knowledge). Agents operating within the system utilize the encoded knowledge to progress the state of the system towards the …

Go to article

Implications Of Test-Driven Development: A Test Study, Reid Kaufmann, David S. Janzen Oct 2003

Implications Of Test-Driven Development: A Test Study, Reid Kaufmann, David S. Janzen

Computer Science and Software Engineering

A Spring 2003 experiment examines the claims that test-driven development or test-first programming improves software quality and programmer confidence. The results indicate support for these claims and inform larger future experiments.

Go to article

A Framework For Management Of Concurrent Xml Markup, Alex Dekhtyar, Ionut E. Iacob Oct 2003

A Framework For Management Of Concurrent Xml Markup, Alex Dekhtyar, Ionut E. Iacob

Computer Science and Software Engineering

The problem of concurrent markup hierarchies in XML encodings of documents has attracted attention of a number of humanities researchers in recent years. The key problem with using concurrent hierarchies to encode documents is that markup in one hierarchy is not necessarily well-formed with respect to the markup in another hierarchy. Previously proposed solutions to this problem rely on the XML expertise of the editors and their ability to maintain correct DTDs for complex markup languages. In this paper, we approach the problem of maintenance of concurrent XML markup from the Computer Science perspective. We propose a framework that allows …

Go to article

Modeling Of The Inverse Heat -Conduction Problem With Application To Laser Chemical Vapor Deposition And Bioheat Transfer, Peng Zhen Oct 2003

Modeling Of The Inverse Heat -Conduction Problem With Application To Laser Chemical Vapor Deposition And Bioheat Transfer, Peng Zhen

Doctoral Dissertations

This dissertation consists of two parts. Part one deals with three-dimensional laser induced chemical vapor deposition (3D-LCVD), whereas part two deals with a Pennes model of a 3D skin structure. LCVD is an important technique in manufacturing complex micro-structures with high aspect ratio. In part one, a numerical model was developed for simulating kinetically-limited growth of an axisymmetric cylindrical rod by pre-specifying the surface temperature distribution required for growing the rod and then by obtaining optimized laser power that gives rise to the pre-specified temperature distribution. The temperature distribution at the surface of the rod was assumed to be at …

Go to article

Mobicom Poster: Evaluating Location Predictors With Extensive Wi-Fi Mobility Data, Libo Song, David Kotz, Ravi Jain, Xiaoning He Oct 2003

Mobicom Poster: Evaluating Location Predictors With Extensive Wi-Fi Mobility Data, Libo Song, David Kotz, Ravi Jain, Xiaoning He

Dartmouth Scholarship

A fundamental problem in mobile computing and wireless networks is the ability to track and predict the location of mobile devices. An accurate location predictor can significantly improve the performance or reliability of wireless network protocols, the wireless network infrastructure itself, and many applications in pervasive computing. These improvements lead to a better user experience, to a more cost-effective infrastructure, or both. Location prediction has been proposed in many areas of wireless cellular networks as a means of enhancing performance, including better mobility management, improved assignment of cells to location areas, more efficient paging, and call admission control. To the …

Go to article

Validating Digital Signatures Without Ttp’S Time-Stamping And Certificate Revocation, Jianying Zhou, Feng Bao, Robert H. Deng Oct 2003

Validating Digital Signatures Without Ttp’S Time-Stamping And Certificate Revocation, Jianying Zhou, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

In non-repudiation services where digital signatures usually serve as irrefutable cryptographic evidence for dispute resolution, trusted time-stamping and certificate revocation services, although very costly in practice, must be available, to prevent big loss due to compromising of the signing key. In [12], a new concept called intrusion-resilient signature was proposed to get rid of trusted time-stamping and certificate revocation services and a concrete scheme was presented. In this paper, we put forward a new scheme that can achieve the same effect in a much more efficient way. In our scheme, forward-secure signature serves as a building block that enables signature …

Go to article

Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura Oct 2003

Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura

Computer Science & Engineering Syllabi

Low-cost parallel computers such as PC clusters are becoming available, and many previously unsolvable problems can be solved using such computers. However, designing algorithms that perform well on parallel computers is often challenging. The focus of this course is on learning how to design algorithms for parallel computers and how to evaluate them.

Go to article

Corner Cases In Value-Based Partial Redundancy Elimination, Thomas Vandrunen, Antony L. Hosking Oct 2003

Corner Cases In Value-Based Partial Redundancy Elimination, Thomas Vandrunen, Antony L. Hosking

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Automatic Video Summarization By Graph Modeling, Chong-Wah Ngo, Yu-Fei Ma, Hong-Jiang Zhang Oct 2003

Automatic Video Summarization By Graph Modeling, Chong-Wah Ngo, Yu-Fei Ma, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

We propose a unified approach for summarization based on the analysis of video structures and video highlights. Our approach emphasizes both the content balance and perceptual quality of a summary. Normalized cut algorithm is employed to globally and optimally partition a video into clusters. A motion attention model based on human perception is employed to compute the perceptual quality of shots and clusters. The clusters, together with the computed attention values, form a temporal graph similar to Markov chain that inherently describes the evolution and perceptual importance of video clusters. In our application, the flow of a temporal graph is …

Go to article

Making The Key Agreement Protocol In Mobile Ad Hoc Network More Efficient, Gang Yao, Kui Ren, Feng Bao, Robert H. Deng, Dengguo Feng Oct 2003

Making The Key Agreement Protocol In Mobile Ad Hoc Network More Efficient, Gang Yao, Kui Ren, Feng Bao, Robert H. Deng, Dengguo Feng

Research Collection School Of Computing and Information Systems

Mobile ad hoc networks offer convenient infrastructureless communications over the shared wireless channel. However, the nature of mobile ad hoc networks makes them vulnerable to security attacks, such as passive eavesdropping over the wireless channel and denial of service attacks by malicious nodes. To ensure the security, several cryptography protocols are implemented. Due to the resource scarcity in mobile ad hoc networks, the protocols must be communication efficient and need as less computational power as possible. Broadcast communication is an important operation for many application in mobile ad hoc networks. To securely broadcast a message, all the members in the …

Go to article

Variations Of Diffie-Hellman Problem, Feng Bao, Robert H. Deng, Huafei Zhu Oct 2003

Variations Of Diffie-Hellman Problem, Feng Bao, Robert H. Deng, Huafei Zhu

Research Collection School Of Computing and Information Systems

This paper studies various computational and decisional Diffie-Hellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational Diffie-Hellman problem: square Diffie-Hellman problem, inverse Diffie-Hellman problem and divisible Diffie-Hellman problem, are equivalent with optimal reduction. Also, we are considering variations of the decisional Diffie-Hellman problem in single sample and polynomial samples settings, and we are able to show that all variations are equivalent except for the argument DDH ⇐ SDDH. We are not able to prove or disprove this statement, thus leave an interesting open problem. Keywords: Diffie-Hellman problem, Square Diffie-Hellman …

Go to article

An Is Capstone Project: The Mywick Property Management System, Martha Myers Oct 2003

An Is Capstone Project: The Mywick Property Management System, Martha Myers

Faculty Articles

This paper describes a project suitable for use in an upper division course requiring the completion of analysis, design and implementation of a software system. It is especially useful for illustrating multiple cycles through the development process, as well as for integrating key concepts from a number of fundamental knowledge clusters in a typical undergraduate IS program of study. These knowledge clusters include database management, project management, programming principles, and system analysis and design. In the pilot class, students employed use case analysis as well as standard object-oriented techniques such as class diagrams and sequence diagrams. Students followed a modified …

Go to article

High-Performance Architectures For Ip-Based Multihop 802.11 Networks, Arup Acharya, Archan Misra, Sorav Bansal Oct 2003

High-Performance Architectures For Ip-Based Multihop 802.11 Networks, Arup Acharya, Archan Misra, Sorav Bansal

Research Collection School Of Computing and Information Systems

The concept of a forwarding node, which receives packets from upstream nodes and then transmits these packets to downstream nodes, is a key element of any multihop network, wired or wireless. While high-speed IP router architectures have been extensively studied for wired networks, the concept of a "wireless IP router" has not been addressed so far. We examine the limitations of the IEEE 802.11 MAC protocol in supporting a low-latency and high-throughput IP datapath comprising multiple wireless LAN hops. We first propose a wireless IP forwarding architecture that uses MPLS with modifications to 802.11 MAC to significantly improve packet forwarding …

Go to article

Adaptive Collusion Attack To A Block Oriented Watermarking Scheme, Yongdong Wu, Robert H. Deng Oct 2003

Adaptive Collusion Attack To A Block Oriented Watermarking Scheme, Yongdong Wu, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper, we propose an adaptive collusion attack to a block oriented watermarking scheme [1]. In this attack, traitors conspire to selectively manipulate watermarked blocks to remove the watermark information. To this end, the traitors compare the watermarked blocks generated from the same original block. If two watermarked block are not equal, they average these two blocks to generate a pirated block. Then, replace the watermarked blocks with the pirated blocks so as to build a pirated image. The pirated image has no watermark but has much higher quality than watermarked images. We also give a theoretical analysis on …

Go to article

An Efficient Public-Key Framework, Jianying Zhou, Feng Bao, Robert H. Deng Oct 2003

An Efficient Public-Key Framework, Jianying Zhou, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Public-key certificates play an important role in binding the public key with the identity of the owner of the corresponding private key. A certificate might be revoked before its scheduled expiry date by the issuing CA. Efficient and timely distribution of certificate revocation information is a big challenge facing the PKI providers. Existing certificate revocation schemes place a considerable processing, communication, and storage overheads on the CA as well as the relying parties. To improve the current situation, we propose a revocation-free public-key framework, in which the maximum lifetime of a certificate is divided into short periods and the certificate …

Go to article

Security Remarks On A Group Signature Scheme With Member Deletion, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng Oct 2003

Security Remarks On A Group Signature Scheme With Member Deletion, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

A group signature scheme allows a group member of a given group to sign messages on behalf of the group in an anonymous and unlinkable fashion. In case of a dispute, however, a designated group manager can reveal the signer of a valid group signature. Based on the Camenisch-Michels group signature scheme, Kim, Lim and Lee proposed the first group signature scheme with a member deletion procedure at ICISC 2000. Their scheme is very efficient in both communication and computation aspects. Unfortunately, their scheme is insecure. In this paper, we first identify an effective way that allows any verifier to …

Go to article

Safe Robot Driving In Cluttered Environments, Chuck Thorpe, Justin Carlson, Dave Duggins, Jay Gowdy, Rob Maclachlan, Christoph Mertz, Arne Suppe, Bob Wang Oct 2003

Safe Robot Driving In Cluttered Environments, Chuck Thorpe, Justin Carlson, Dave Duggins, Jay Gowdy, Rob Maclachlan, Christoph Mertz, Arne Suppe, Bob Wang

Research Collection School Of Computing and Information Systems

The Navlab group at Carnegie Mellon University has a long history of development of automated vehicles and intelligent systems for driver assistance. The earlier work of the group concentrated on road following, cross-country driving, and obstacle detection. The new focus is on short-range sensing, to look all around the vehicle for safe driving. The current system uses video sensing, laser rangefinders, a novel light-stripe rangefinder, software to process each sensor individually, and a map-based fusion system. The complete system has been demonstrated on the Navlab 11 vehicle for monitoring the environment of a vehicle driving through a cluttered urban environment, …

Go to article

Unidirectional Cordic For Efficient Computation Of Trigonometric And Hyperbolic Functions, Satish Ravichandran Oct 2003

Unidirectional Cordic For Efficient Computation Of Trigonometric And Hyperbolic Functions, Satish Ravichandran

Electrical & Computer Engineering Theses & Dissertations

CORDIC (Coordinate Rotation Digital Computer) is an iterative algorithm to compute values of trigonometric, logarithmic and transcendental functions by performing vector rotations, which can be implemented with only shift and add operations in a digital system. CORDIC algorithms are extensively used in the areas of digital signal processing, digital image processing and artificial neural networks. A new technique, named unidirectional CORDIC, for efficient computation of trigonometric and hyperbolic functions is presented in this thesis. In the conventional CORDIC algorithm, the vector rotations are performed in both clockwise and counterclockwise directions, but in the unidirectional CORDIC the vectors are rotated only …

Go to article

A Computer-Based Articulation Training Aid For Short Words (Cata), Mukund Devarajan Oct 2003

A Computer-Based Articulation Training Aid For Short Words (Cata), Mukund Devarajan

Electrical & Computer Engineering Theses & Dissertations

Several improvements in the vowel articulation training aid (VATA) are described, as well as the efforts to extend the visual feedback system to operate with short words in the form of consonant, vowel and consonant (CVC). The extended version of the visual feedback system is referred to as CATA (Computer-based Articulation Training Aid); the vowel version of the aid (VATA) only operates with ten American English monopthong vowels. Improvements in VATA include the use of a neural network (NN) recognizer method to prune a large database of vowel recordings to eliminate noisy and/or mispronounced tokens. The spectral jitter problem, previously …

Go to article

Adaptive Parallel Framework Algorithm (Apfa) For Environmental Engineering Applications, Lianghua Zhou Oct 2003

Adaptive Parallel Framework Algorithm (Apfa) For Environmental Engineering Applications, Lianghua Zhou

Civil & Environmental Engineering Theses & Dissertations

This research proposes a new framework methodology for integrating environmental computer applications in flexible, open and adaptively and reusable manners so that the resulting application framework could be used to effectively, flexibly and rapidly handle various environmental problems and issues. Research also demonstrates the framework algorithm with a case study. The proposed algorithm is referred as Adaptive Parallel Framework Algorithm (APF A). Core concept of the APF A is based on a parallelism, "many-to-one" mode to communicate among environmental applications, and takes advantages of a loosely coupled technology that helps archiving the required flexibility, extensibility and usability of integrated systems. …

Go to article

An Efficient Known Plaintext Attack On Fea-M, Hongjun Wu, Feng Bao, Robert H. Deng Oct 2003

An Efficient Known Plaintext Attack On Fea-M, Hongjun Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Yi et al. have proposed a cipher called the fast encryption algorithm for multimedia (FEA-M). Recently Mihaljevi and Kohno pointed out that FEA-M is insecure. However, their attacks are not efficient: their chosen plaintext attack and known plaintext attack require 237-bit chosen plaintext and 260-bit known plaintext, respectively. In this paper we give an efficient known plaintext attack against FEA-M. Our attack requires only 228-bit known plaintext and about 233 XOR operations.

Go to article

Multi-Agent Coalition Via Autonomous Price Negotiation In A Real-Time Web Environment, Hoong Chuin Lau, Wei Sian Lim Oct 2003

Multi-Agent Coalition Via Autonomous Price Negotiation In A Real-Time Web Environment, Hoong Chuin Lau, Wei Sian Lim

Research Collection School Of Computing and Information Systems

In e-marketplaces, customers specify job requests in real-time and agents form coalitions to service them. This paper proposes a protocol for self-interested agents to negotiate prices in forming successful coalitions. We propose and experiment with two negotiation schemes: one allows information sharing while the other does not.

Go to article

Semantic Web In Action: Ontology-Driven Information Search, Integration And Analysis, Amit P. Sheth Sep 2003

Semantic Web In Action: Ontology-Driven Information Search, Integration And Analysis, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Thermal Transport Eveluations Related To Waste Package Design -- Model Evaluations -- Task 19, Roald Akberov Sep 2003

Thermal Transport Eveluations Related To Waste Package Design -- Model Evaluations -- Task 19, Roald Akberov

Publications (YM)

The purpose of the “Thermal Transport Evaluations Related to Waste Package Design” Task # 19 of Cooperative Agreement Number DE-FC28-98NV12081 was to develop a new CFDHT model for heat transfer and fluid flow in the potential rsepository at the Yucca Mountain, Nevada and to study the effects of forced convection during the pre-closure period and natural convection during the postclosure period. The analysis was performed for the drift dimensions shown in Figure 4-1 below. The intended use of the model is to estimate the velocity and temperature distribution as well as the highest temperature in the drift during the pre-closure …

Go to article

First Prev Next Last