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 27031 - 27060 of 29975

Full-Text Articles in Entire DC Network

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

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 …


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

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 Sep 2001

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 Aug 2001

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 …


Hyper-Polynomial Hierarchies And The Polynomial Jump, Stephen Fenner, Steven Homer, Randall J. Pruim, Marcus Schaefer Aug 2001

Hyper-Polynomial Hierarchies And The Polynomial Jump, Stephen Fenner, Steven Homer, Randall J. Pruim, Marcus Schaefer

University Faculty Publications and Creative Works

Assuming that the polynomial hierarchy (PH) does not collapse, we show the existence of ascending sequences of ptime Turing degrees of length ω1/CK in PSPACE such that successors are polynomial jumps of their predecessors. Moreover these ptime degrees are all uniformly hard for PH. This is analogous to the hyperarithmetic hierarchy, which is defined similarly but with the (computable) Turing degrees. The lack of uniform least upper bounds for ascending sequences of ptime degrees causes the limit levels of our hyper-polynomial hierarchy to be inherently non-canonical. This problem is investigated in depth, and various possible structures for hyper-polynomial hierarchies are …


A Theoretical Study Of The Interactive Communication Process In Video Game Playing: A Symbolic Interactionist Approach, Nevsal Tiryakioglu Aug 2001

A Theoretical Study Of The Interactive Communication Process In Video Game Playing: A Symbolic Interactionist Approach, Nevsal Tiryakioglu

Masters Theses & Specialist Projects

Video games have become the most popular leisure activity among children and adolescents. The increasing popularity of video games has urged researchers to determine the effects of video game playing on youngsters. Given the fact that most popular video games are violent in nature, much of the research has primarily focused on the correlation between playing video games with violent content and aggressive behavior in children. Most researchers have relied on previous media violence research, assuming similarities between television viewing and video game playing. However, video games are interactive media allowing the player to participate in the game scenario, which …


Livelock Avoidance For Meta-Schedulers, Mark J. Clement, John Jardine, Quinn O. Snell Aug 2001

Livelock Avoidance For Meta-Schedulers, Mark J. Clement, John Jardine, Quinn O. Snell

Faculty Publications

Meta-scheduling, a process which allows a user to schedule a job across multiple sites, has a potential for livelock. Current systems avoid livelock by locking down resources at multiple sites and allowing a metascheduler to control the resources during the lock down period or by limiting job size to that which will fit on one site. The former approach leads to poor utilization; the later poses limitations on job size. This research uses BYU's Meta-scheduler (YMS) which allows jobs to be scheduled across multiple sites without the need for locking down the nodes. YMS avoids livelock through exponential back-off This …


Electronic Commerce Application Development: A Comparison Of User And It Professional Perspectives, Douglas Havelka, Deepak Khazanchi Aug 2001

Electronic Commerce Application Development: A Comparison Of User And It Professional Perspectives, Douglas Havelka, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

Based on the theory of reasoned action and previous research identifying differences in beliefs between IS specialists and IS users, this paper outlines a proposed study to investigate differences/similarities in beliefs of users and developers in the context of electronic commerce application development projects. The authors are currently in the process of collecting data to address research question posed in this proposal.


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

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 …


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

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.


Visual Iconic Object-Oriented Programming To Advance Computer Science Education And Novice Programming, Nancy Silva Martinez Aug 2001

Visual Iconic Object-Oriented Programming To Advance Computer Science Education And Novice Programming, Nancy Silva Martinez

Theses and Dissertations - UTB/UTPA

Learning how to program a computer is difficult for most people. Computer programming is a cognitively challenging, time consuming, labor intensive, and frustrating endeavor. Years of formal study and training are required to learn a programming language's world of algorithms and data structures. Instructions are coded in advance before the computer demonstrates the desired behavior. Seeing all the programming steps and instruction code is complicated. There exists a tremendous gap between the representations the human brain uses when thinking about a problem and the representations used in programming a computer. Often people are much better at dealing with specific, concrete …


A Multi-Agent Framework For Supporting Intelligent Fourth-Party Logistics, Hoong Chuin Lau, G. Lo Aug 2001

A Multi-Agent Framework For Supporting Intelligent Fourth-Party Logistics, Hoong Chuin Lau, G. Lo

Research Collection School Of Computing and Information Systems

A distributed intelligent agent-based framework that supports fourth-party logistics optimization under a web-based e-Commerce environment has been proposed in this paper. In the framework, customer job requests come through an e-Procurement service. These requests are consolidated and pushed to the e-Market Place service periodically. The e-Market Place then serves as a broker that allows intelligent agents to bid to serve these requests optimally in real-time by solving multiple instances of underlying logistics optimization problem. The resulting system was implemented based on the Java 2 Enterprise Edition (J2EE) platform using distributed system technology for communication between objects.


Autoconfiguration, Registration And Mobility Management For Pervasive Computing, Archan Misra, Subir Das, Anthony Mcauley, Sajal K. Das Aug 2001

Autoconfiguration, Registration And Mobility Management For Pervasive Computing, Archan Misra, Subir Das, Anthony Mcauley, Sajal K. Das

Research Collection School Of Computing and Information Systems

In the vision of pervasive computing, users will exchange information and control their environments from anywhere using various wireline/wireless networks and computing devices. We believe that current protocols, such as DHCP, PPP, and Mobile IP, must be enhanced to support pervasive network access. In particular, this article identifies three fundamental functions: autoconfiguration, registration, and mobility management, that need such enhancements. Realizing that the IP autoconfiguration capabilities must be extended to configure routers and large dynamic networks, we first describe our autoconfiguration solution based on the dynamic configuration and distribution protocol (DCDP). Second, we discuss why providing user-specific services over a …


Role Of Use Case Diagram In Requirement Analysis, Keng Siau, L. Lee Aug 2001

Role Of Use Case Diagram In Requirement Analysis, Keng Siau, L. Lee

Research Collection School Of Computing and Information Systems

Since its debut and acceptance as a de facto standard of the object-oriented paradigm, UML has receivedcontroversial reviews. The most controversial diagramming technique in UML is undoubtedly the Use Casediagrams. Some claim that Use Case diagrams do not play a valuable role in requirement analysis. Othersargue that Use Case diagrams captured neither the static nor the dynamic aspects of the systems. The objective of this study is to investigate the role and value of Use Case diagrams in requirement analysis. We will investigate the information content of Use Case diagram and its role in requirement analysis.


The Meaning Of An Information-Centric Computer Environment, Jens G. Pohl Jul 2001

The Meaning Of An Information-Centric Computer Environment, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

It is often lamented that we human beings are suffering from an information overload. This is a myth, as shown in Fig.1 there is no information overload. Instead we are suffering from a data overload. The confusion between data and information is not readily apparent and requires further explanation. Unorganized data are voluminous but of very little value. Over the past 15 years, industry and commerce have made significant efforts to rearrange this unorganized data into purposeful data, utilizing various kinds of database management systems. However, even in this organized form, we are still dealing with data and not information.


Aurora Working Group: Dsr Front End Lvcsr Evaluation — Baseline Recognition System Description, Naveen Parihar, Joseph Picone Jul 2001

Aurora Working Group: Dsr Front End Lvcsr Evaluation — Baseline Recognition System Description, Naveen Parihar, Joseph Picone

Publications

In this document we describe the features of the baseline system to be used in the Distributed Speech Recognition (DSR) front end large vocabulary continuous speech recognition (LVCSR) evaluations being conducted by the Aurora Working Group of the European Telecommunications Standards Institute (ETSI). The objective of these evaluations is to determine the robustness of different front ends for use in client/server type telecommunications applications. As such, our experiments are designed to test the following focus conditions on the DARPA Wall Street Journal (WSJ0) corpus using a 5000-word closed-loop vocabulary and a bigram language model:

  1. Additive Noise: six noise conditions …


Lazy Training: Improving Backpropagation Learning Through Network Interaction, Timothy L. Andersen, Tony R. Martinez, Michael E. Rimer Jul 2001

Lazy Training: Improving Backpropagation Learning Through Network Interaction, Timothy L. Andersen, Tony R. Martinez, Michael E. Rimer

Faculty Publications

Backpropagation, similar to most high-order learning algorithms, is prone to overfitting. We address this issue by introducing interactive training (IT), a logical extension to backpropagation training that employs interaction among multiple networks. This method is based on the theory that centralized control is more effective for learning in deep problem spaces in a multi-agent paradigm. IT methods allow networks to work together to form more complex systems while not restraining their individual ability to specialize. Lazy training, an implementation of IT that minimizes misclassification error, is presented. Lazy training discourages overfitting and is conducive to higher accuracy in multiclass problems …


Student Survey Of Information Technology, Wku Information Technology, Richard Kirchmeyer Jul 2001

Student Survey Of Information Technology, Wku Information Technology, Richard Kirchmeyer

Board of Regents Documents

Survey of 400 WKU students about information technology used in strategic operations planning for Information Technology. The survey attempted to determine the depth and breadth of student computer use and knowledge of a variety of hardware and software. The report was presented to the WKU Board of Regents at the August 17, 2001 meeting.


Semantic Operators And Fixed-Point Theory In Logic Programming, Anthony K. Seda, Pascal Hitzler Jul 2001

Semantic Operators And Fixed-Point Theory In Logic Programming, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We consider rather general operators mapping valuations to (sets of) valuations in the context of the semantics of logic programming languages. This notion generalizes several of the standard operators encountered in this subject and is inspired by earlier work of M.C. Fitting. The fixed points of such operators play a fundamental role in logic programming semantics by providing standard models of logic programs and also in determining the computability properties of these standard models. We discuss some of our recent work employing topological ideas, in conjunction with order theory, to establish methods by which one can find the fixed points …


Web Spoofing 2001, Yougu Yuan, Eileen Zishuang Ye, Sean Smith Dartmouth College Jul 2001

Web Spoofing 2001, Yougu Yuan, Eileen Zishuang Ye, Sean Smith Dartmouth College

Computer Science Technical Reports

The Web is currently the pre-eminent medium for electronic service delivery to remote users. As a consequence, authentication of servers is more important than ever. Even sophisticated users base their decision whether or not to trust a site on browser cues---such as location bar information, SSL icons, SSL warnings, certificate information, response time, etc. In their seminal work on web spoofing, Felten et al showed how a malicious server could forge some of these cues---but using approaches that are no longer reproducible. However, subsequent evolution of Web tools has not only patched security holes---it has also added new technology to …


Securing Web Servers Against Insider Attack, Shan Jiang, Sean Smith, Kazuhiro Minami Dartmouth College Jul 2001

Securing Web Servers Against Insider Attack, Shan Jiang, Sean Smith, Kazuhiro Minami Dartmouth College

Computer Science Technical Reports

Too often, ``security of Web transactions'' reduces to ``encryption of the channel''---and neglects to address what happens at the server on the other end. This oversight forces clients to trust the good intentions and competence of the server operator---but gives clients no basis for that trust. Furthermore, despite academic and industrial research in secure coprocessing, many in the computer science community still regard ``secure hardware'' as a synonym for ``cryptographic accelerator.' This oversight neglects the real potential of COTS secure coprocessing technology to establish trusted islands of computation in hostile environments---such as at web servers with risk of insider attack. …


On The Utility Of Entanglement In Quantum Neural Computing, Dan A. Ventura Jul 2001

On The Utility Of Entanglement In Quantum Neural Computing, Dan A. Ventura

Faculty Publications

Efforts in combining quantum and neural computation are briefly discussed and the concept of entanglement as it applies to this subject is addressed. Entanglement is perhaps the least understood aspect of quantum systems used for computation, yet it is apparently most responsible for their computational power. This paper argues for the importance of understanding and utilizing entanglement in quantum neural computation.


An Evaluation Of Shared Multicast Trees With Multiple Active Cores, Daniel Zappala, Aaron Fabbri Jul 2001

An Evaluation Of Shared Multicast Trees With Multiple Active Cores, Daniel Zappala, Aaron Fabbri

Faculty Publications

Core-based multicast trees use less router state, but have significant drawbacks when compared to shortest-path trees, namely higher delay and poor fault tolerance. We evaluate the feasibility of using multiple independent cores within a shared multicast tree. We consider several basic designs and discuss how using multiple cores improves fault tolerance without sacrificing router state. We examine the performance of multiple-core trees with respect to single-core trees and find that adding cores significantly lowers delay without increasing cost. Moreover, it takes only a small number of cores, placed with a k-center approximation, for a multiple-core tree to have lower delay …


Cost Optimal Record/Entity Matching, V. S. Verykios, Ahmed K. Elmagarmid, G. V. Moustakides Jul 2001

Cost Optimal Record/Entity Matching, V. S. Verykios, Ahmed K. Elmagarmid, G. V. Moustakides

Department of Computer Science Technical Reports

No abstract provided.


Query Indexing And Velocity Constrained Indexing: Scalable Techniques For Continuous Queries On Moving Objects, Sunil Prabhakar, Y. Xia, D. Kalashnikov, Walid G. Aref, Susanne E. Hambrusch Jul 2001

Query Indexing And Velocity Constrained Indexing: Scalable Techniques For Continuous Queries On Moving Objects, Sunil Prabhakar, Y. Xia, D. Kalashnikov, Walid G. Aref, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


Minimum Mean Square Error Spectral Peak Envelope Estimation For Automatic Vowel Classification, Jaishree Venugopal Jul 2001

Minimum Mean Square Error Spectral Peak Envelope Estimation For Automatic Vowel Classification, Jaishree Venugopal

Electrical & Computer Engineering Theses & Dissertations

Spectral feature computations continue to be a very difficult problem for accurate machine recognition of speech. In this work, which focuses on vowels, a new spectral peak envelope method for vowel classification is developed, based on a missing frequency components model of speech recognition. According to the missing frequency components model, vowel recognition depends only on the spectral (harmonic) peaks. Smoothing and interpolation of the spectra, performed in the standard cepstral analysis method commonly used in automatic speech recognition, actually loses valuable information and results in reduced recognition accuracy. The new method for feature extraction presented in this thesis is …


Development Of Atlas Based Simulation Capability For Automated Testing, Rami Hanbali Jul 2001

Development Of Atlas Based Simulation Capability For Automated Testing, Rami Hanbali

Electrical & Computer Engineering Theses & Dissertations

Computer software is emerging as a powerful tool for controlling a large number of instruments and for the testing of these instruments. The main aim of this work is to provide a software program capable of controlling a large number of engineering instruments at the touch of a button. In addition, the software is to have the capability of connecting the instruments with the desired Unit Under Test. There is great need for such software driven testing in industry, especially for large complex systems. Advantages of such an approach include: (a) automated testing in a very quick and efficient manner; …


Application-Centric Analysis Of Ip-Based Mobility Management Techniques, Archan Misra, Subir Das, Prathima Agrawal Jul 2001

Application-Centric Analysis Of Ip-Based Mobility Management Techniques, Archan Misra, Subir Das, Prathima Agrawal

Research Collection School Of Computing and Information Systems

This paper considers three applications—VoIP, mobile Web access and mobile server-based data transfers—and evaluates the applicability of various IP-based mobility management mechanisms. We first survey the features and characteristics of various IP mobility protocols, such as MIPv4, MIPv6, MIP-RO, SIP, CIP, HAWAII, MIP-RR and IDMP, and then evaluate their utility on an application-specific basis. The diversity in the mobility-related requirements ensures that no single mobility solution is universally applicable. We recommend a hierarchical mobility architecture. The framework uses our Dynamic Mobility Agent (DMA) architecture for managing intra-domain mobility and multiple application-based binding protocols for supporting inter-domain mobility. Thus, we recommend …


Secure And Private Distribution Of Online Video And Some Related Cryptographic Issues, Feng Bao, Robert H. Deng, Peirong Bao, Yan Guo, Hongjun Wu Jul 2001

Secure And Private Distribution Of Online Video And Some Related Cryptographic Issues, Feng Bao, Robert H. Deng, Peirong Bao, Yan Guo, Hongjun Wu

Research Collection School Of Computing and Information Systems

With the rapid growth of broadband infrastructure, it is thought that the bottleneck for video-on-demand service through Internet is being cleared. However, digital video content protection and consumers privacy protection emerge as new major obstacles. In this paper we propose an online video distribution system with strong content security and privacy protection. We mainly focus on the study of security and privacy problems related to the system. Besides presenting the new system, we intensively discuss some relevant cryptographic issues, such as content protection, private information retrieval, super-speed encryption/decryption for video, and PKC with fast decryption etc. The paper can be …


Mobile Commerce: Promises, Challenges And Research Agenda, Keng Siau, Ee Peng Lim Jul 2001

Mobile Commerce: Promises, Challenges And Research Agenda, Keng Siau, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Advances in wireless technology increase the number of mobile device users and give pace to the rapid development of e-commerce using these devices. The new type of e-commerce, conducting transactions via mobile terminals, is called mobile commerce. Due to its inherent characteristics such as ubiquity, personalization, flexibility, and dissemination, mobile commerce promises businesses unprecedented market potential, great productivity, and high profitability. This paper presents an overview of mobile commerce development by examining the enabling technologies, the impact of mobile commerce on the business world, and the implications to mobile commerce providers. The paper also provides an agenda for future research …