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

Computer Sciences Commons™

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

2003

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 451 - 480 of 628

Full-Text Articles in Computer Sciences

A Multi-Agent Architecture For Internet Distributed Computing System, Rodelyn Reyes Samson Jan 2003

A Multi-Agent Architecture For Internet Distributed Computing System, Rodelyn Reyes Samson

Theses Digitization Project

This thesis presents the developed taxonomy of the agent-based distributed computing systems. Based on this taxonomy, a design, implementation, analysis and distribution protocol of a multi-agent architecture for internet-based distributed computing system was developed. A prototype of the designed architecture was implemented on Spider III using the IBM Aglets software development kit (ASDK 2.0) and the language Java.

Go to article

Simulation Of Soil Water Movement Model (Swamm) Using The Spider Distributed System, Li Wang Jan 2003

Simulation Of Soil Water Movement Model (Swamm) Using The Spider Distributed System, Li Wang

Theses Digitization Project

This project implements a real application on the Spider II, which is a simulation of Soil Water Movement Model. The main objectives of this project were to develop a parallel and distributed algorithm for the Soil Water Model; implement the Soil Water Movement Simulation model on the Spider II distributed system and to evaluate the performance of simulating the Soil Water Movement Model on Spider II.

Go to article

Telephone Directory Web Service, Hua Sun Jan 2003

Telephone Directory Web Service, Hua Sun

Theses Digitization Project

This was a project to develop a Telephone Directory Web service (TDWS) to provide convenient and cost-effective access to public telephone directory data.

Go to article

A Parallel Algorithm To Solve The Mathematical Problem "Double Coset Enumeration Of S₂₄ Over M₂₄", Elena Yavorska Harris Jan 2003

A Parallel Algorithm To Solve The Mathematical Problem "Double Coset Enumeration Of S₂₄ Over M₂₄", Elena Yavorska Harris

Theses Digitization Project

This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the double coset M₂₄ P M₂₄, where P is a permutation on n points of a certain cycle structure, and M₂₄ is the Mathieu group related to a Steiner system S(5, 8, 24) as its automorphism group. The purpose of this work is not to replace the existing algorithms, but rather to explore a possibility to extend calculations of single cosets beyond the limits encountered when using currently available methods.

Go to article

Unified Modeling Language Class Diagram Translator For The Online Design Pattern Library System, Kaiyan Li Jan 2003

Unified Modeling Language Class Diagram Translator For The Online Design Pattern Library System, Kaiyan Li

Theses Digitization Project

The Unified Modeling Language (UML) is the successor to the wave of object-oriented analysis and design (OOA&D) methods that appeared in the late '80s and early '90s. The class diagram is one of the most useful diagrams in UML. The class diagram technique has become truly central within object-oriented methods.

Go to article

Taxonomy Of Synchronization And Barrier As A Basic Mechanism For Building Other Synchronization From It, Pauline Braginton Jan 2003

Taxonomy Of Synchronization And Barrier As A Basic Mechanism For Building Other Synchronization From It, Pauline Braginton

Theses Digitization Project

A Distributed Shared Memory(DSM) system consists of several computers that share a memory area and has no global clock. Therefore, an ordering of events in the system is necessary. Synchronization is a mechanism for coordinating activities between processes, which are program instantiations in a system.

Go to article

A Tabular Propositional Logic: And/Or Table Translator, Chen-Hsiu Lee Jan 2003

A Tabular Propositional Logic: And/Or Table Translator, Chen-Hsiu Lee

Theses Digitization Project

The goal of this project is to design a tool to help users translate any logic statement into Disjunctive Normal Form and present the result as an AND/OR TABLE, which makes the logic relation easier to express by using a two-dimensional grid of values or expressions. This tool is implemented through a web-based and Java-based application. Thus, the user can utilize this tool via World Wide Web.

Go to article

Generalized Metrics And Uniquely Determined Logic Programs, Pascal Hitzler, Anthony K. Seda Jan 2003

Generalized Metrics And Uniquely Determined Logic Programs, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

The introduction of negation into logic programming brings the benefit of enhanced syntax and expressibility, but creates some semantical problems. Specifically, certain operators which are monotonic in the absence of negation become non-monotonic when it is introduced, with the result that standard approaches to denotational semantics then become inapplicable. In this paper, we show how generalized metric spaces can be used to obtain fixed-point semantics for several classes of programs relative to the supported model semantics, and investigate relationships between the underlying spaces we employ. Our methods allow the analysis of classes of programs which include the acyclic, locally hierarchical, …

Go to article

Semantic N-Gram Language Modeling With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao Jan 2003

Semantic N-Gram Language Modeling With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao

Kno.e.sis Publications

We describe a unified probabilistic framework for statistical language modeling-the latent maximum entropy principle-which can effectively incorporate various aspects of natural language, such as local word interaction, syntactic structure and semantic document information. Unlike previous work on maximum entropy methods for language modeling, which only allow explicit features to be modeled, our framework also allows relationships over hidden features to be captured, resulting in a more expressive language model. We describe efficient algorithms for marginalization, inference and normalization in our extended models. We then present experimental results for our approach on the Wall Street Journal corpus.

Go to article

Protein Structure, Function, And Folding, Dan E. Krane, Michael L. Raymer Jan 2003

Protein Structure, Function, And Folding, Dan E. Krane, Michael L. Raymer

Computer Science and Engineering Faculty Publications

Presentation prepared for Intro to Bioinformatics. The lecture comprises material from the text Fundamental Concepts of Bioinformatics.

Go to article

The Window Least Mean Square Error Algorithm, Anna Semenovna Degtyarena Jan 2003

The Window Least Mean Square Error Algorithm, Anna Semenovna Degtyarena

Theses Digitization Project

In order to improve the performance of LMS (least mean square) algorithm by decreasing the amount of calculations this research proposes to make an update on each step only for those elements from the input data set, that fall within a small window W near the separating hyperplane surface. This work aims to describe in detail the results that can be achieved by using the proposed LMS with window learning algorithm in information systems that employ the methodology of neural network for the purposes of classification.

Go to article

Littlebee: User's Online Interactive Design Of Baby's Wear, Yan Hai Jan 2003

Littlebee: User's Online Interactive Design Of Baby's Wear, Yan Hai

Theses Digitization Project

The purpose of this project is to develop a web-based application called Littlebee that allows customers to do online design of babies' wear. The online designing options include combining appliques with clothing styles and changing fabric colors; it utilizes images pre-stored in the database.

Go to article

Website Developer: Web Application, Venkata Krishna Reddy Tummeti Jan 2003

Website Developer: Web Application, Venkata Krishna Reddy Tummeti

Theses Digitization Project

The purpose of the project is to use Java Server Page (JSP) technology to create a web application that could be used by any person who has the basic knowledge of browsing through the Web. There are many programs on the market that aid users in creating web pages, but the process involved in creating web pages using the available software and hosting their website is fairly complex for general people.

Go to article

Web-Based E-Mail Client For Computer Science, Jichuan Wu Jan 2003

Web-Based E-Mail Client For Computer Science, Jichuan Wu

Theses Digitization Project

The project is a web e-mail application to provide a web page interface for all CSCI faculty, staff and students to handle their e-mails. The application is written by JSP, Java Servlets, JavaScript and custom JSP tag libraries. Regular e-mail capabilities have been enhanced by the feature of allowing users to store and manage messages by day (store to daily folders, view in daily folders, append notes for that day).

Go to article

Tr-2003003: Finite Information Logic, Rohit Parikh, Jouko Väänänen Jan 2003

Tr-2003003: Finite Information Logic, Rohit Parikh, Jouko Väänänen

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003008: Learning And Applying Temporal Patterns Through Experience, Esther Lock Jan 2003

Tr-2003008: Learning And Applying Temporal Patterns Through Experience, Esther Lock

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003011: Data Modelling And Description: A Guide To Using The Sylmodel Library, Jayson E. Rome, Alexei D. Miasnikov, Robert M. Haralick Jan 2003

Tr-2003011: Data Modelling And Description: A Guide To Using The Sylmodel Library, Jayson E. Rome, Alexei D. Miasnikov, Robert M. Haralick

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003013: Qr-Like Algorithms For Generalized Semiseparable Matrices, Dario A. Bini, Luca Gemignani, Victor Y. Pan Jan 2003

Tr-2003013: Qr-Like Algorithms For Generalized Semiseparable Matrices, Dario A. Bini, Luca Gemignani, Victor Y. Pan

Computer Science Technical Reports

No abstract provided.

Go to article

Graduate School Of Computer And Information Sciences-Doctoral Degree Programs 2003-2005, Nova Southeastern University Jan 2003

Graduate School Of Computer And Information Sciences-Doctoral Degree Programs 2003-2005, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Go to article

Tr-2003001: States Of Knowledge And Group Action, Rohit Parikh Jan 2003

Tr-2003001: States Of Knowledge And Group Action, Rohit Parikh

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003007: On The Complexity Of The Reflected Logic Of Proofs, Nikolai V. Krupski Jan 2003

Tr-2003007: On The Complexity Of The Reflected Logic Of Proofs, Nikolai V. Krupski

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003010: A Semantic Proof Of The Realizability Of Modal Logic In The Logic Of Proofs, Melvin Fitting Jan 2003

Tr-2003010: A Semantic Proof Of The Realizability Of Modal Logic In The Logic Of Proofs, Melvin Fitting

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003014: A High-Performance Abstract Machine For Prolog And Its Extensions, Neng-Fa Zhou Jan 2003

Tr-2003014: A High-Performance Abstract Machine For Prolog And Its Extensions, Neng-Fa Zhou

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003015: Two Counterexamples In The Logic Of Dynamic Topological Systems, Sergey Slavnov Jan 2003

Tr-2003015: Two Counterexamples In The Logic Of Dynamic Topological Systems, Sergey Slavnov

Computer Science Technical Reports

No abstract provided.

Go to article

Searching Sequence Databases, Dan E. Krane, Michael L. Raymer Jan 2003

Searching Sequence Databases, Dan E. Krane, Michael L. Raymer

Computer Science and Engineering Faculty Publications

Presentation prepared for BIO/CS 471: Algorithms for Bioinformatics. The lecture comprises material from the text Fundamental Concepts of Bioinformatics.

Go to article

Web Service: Been There, Done That?, Steffen Staab, Will Van Der Aalst, V. Richard Benjamins, Amit P. Sheth, John A. Miller, Chistoph Bussler, Alexander Maedche, Dieter Fensel, Dennis Gannon Jan 2003

Web Service: Been There, Done That?, Steffen Staab, Will Van Der Aalst, V. Richard Benjamins, Amit P. Sheth, John A. Miller, Chistoph Bussler, Alexander Maedche, Dieter Fensel, Dennis Gannon

Kno.e.sis Publications

Web services can be defined as loosely coupled, reusable software components that semantically encapsulate discrete functionality and are distributed and programmatically accessible over standard Internet protocols. Web services have received a lot of hype, the reasons for which are not easily determined. Some of their benefits might even seem to waste away, once we touch on the nitty-gritty details, because Web services per se do not offer a solution to underlying problems. The contributions included in this section delve into some of these issues, including: pitfalls of workflow issues; structuring procedural knowledge into problem-solving methods; discussing how a low initial …

Go to article

Agent Chameleons: Virtual Agents Real Intelligence, Gregory O'Hare, Brian Duffy, Bianca Schoen-Phelan, Alan Martin, John Bradley` Jan 2003

Agent Chameleons: Virtual Agents Real Intelligence, Gregory O'Hare, Brian Duffy, Bianca Schoen-Phelan, Alan Martin, John Bradley`

Books/Book Chapters

Agent Chameleons provides virtual agents powered by real intelligence, delivering next generation autonomic entities that can seamlessly migrate, mutate and evolve on their journey between and within physical and digital information spaces.

Go to article

A Tail-Recursive Semantics For Stack Inspections, John Clements, Mathias Felleisen Jan 2003

A Tail-Recursive Semantics For Stack Inspections, John Clements, Mathias Felleisen

Computer Science and Software Engineering

Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may have to allocate memory for a source-code tail call, and a program that uses only tail calls (and no other memory-allocating construct) may nevertheless exhaust the available memory. In this paper, we prove this widely held belief wrong. We exhibit an abstract machine for a language with security stack inspection whose space consumption function is equivalent to that of the canonical tail call optimizing abstract machine. Our machine is surprisingly simple and suggests …

Go to article

Research Strategy And Scoping Survey On Spreadsheet Practices, Thomas A. Grossman Jr., O Ozluk Jan 2003

Research Strategy And Scoping Survey On Spreadsheet Practices, Thomas A. Grossman Jr., O Ozluk

Business Analytics and Information Systems

We propose a research strategy for creating and deploying prescriptive recommendations for spreadsheet practice. Empirical data on usage can be used to create a taxonomy of spreadsheet classes. Within each class, existing practices and ideal practices can he combined into proposed best practices for deployment. As a first step we propose a scoping survey to gather non-anecdotal data on spreadsheet usage. The scoping survey will interview people who develop spreadsheets. We will investigate the determinants of spreadsheet importance, identify current industry practices, and document existing standards for creation and use of spreadsheets. The survey will provide insight into user attributes, …

Go to article

Accuracy In Spreadsheet Modelling Systems, Thomas A. Grossman Jr. Jan 2003

Accuracy In Spreadsheet Modelling Systems, Thomas A. Grossman Jr.

Business Analytics and Information Systems

Accuracy in spreadsheet modelling systems can be reduced due to difficulties with the inputs, the model itself, or the spreadsheet implementation of the model. When the "true" outputs from the system are unknowable, accuracy is evaluated subjectively. Less than perfect accuracy can be acceptable depending on the purpose of the model, problems with inputs, or resource constraints. Users build modelling systems iteratively, and choose to allocate limited resources to the inputs, the model, the spreadsheet implementation, and to employing the system for business analysis. When making these choices, users can suffer from expectation bias and diagnosis bias. Existing research results …

Go to article

First Prev Next Last