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 56281 - 56310 of 63327

Full-Text Articles in Entire DC Network

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

Analyzing Algorithms & Asymptotic Notation, Dan E. Krane, Michael L. Raymer Jan 2003

Analyzing Algorithms & Asymptotic Notation, 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

Policy Driven Licensing Model For Component Software, Zhao Qian, Zhou Yu, Mark Perry Jan 2003

Policy Driven Licensing Model For Component Software, Zhao Qian, Zhou Yu, Mark Perry

Computer Science Publications

Today, it is almost inevitable that software is licensed, rather than sold outright. As a part of the licensing policy, some protection mechanisms, whether hardware, legal or code-based, are invariably built into the license. The application of such mechanisms has primarily been in the realm of off-the-shelf, packaged, consumer software. However, as component-based software gradually becomes mainstream in software development, new component-oriented licensing systems are required. This paper proposes an enterprise component licensing model for the management of software component licenses. The model provides a comprehensive license management framework allowing for extensibility and flexibility. Furthermore, we identify differences between stand-alone …

Go to article

A Christian Perspective On Mathematics – History Of Mathematics And Study Guides, Johan Deklerk Jan 2003

A Christian Perspective On Mathematics – History Of Mathematics And Study Guides, Johan Deklerk

ACMS Journal 2004

This paper addresses two questions: (1) Will a study of the history of the subject serve any purpose in promoting a Christian perspective on mathematics? (2) Can the "science in context" approach be of further help in promoting such a perspective? The author answers both positively and provides specific examples of how he has done this in his own classes.

Go to article

Creationism – A Viable Philosophy Of Mathematics, Jonathan Zderad Jan 2003

Creationism – A Viable Philosophy Of Mathematics, Jonathan Zderad

ACMS Journal 2004

In this paper, the author addresses two classical questions of the philosophy of mathematics: What, if any, of mathematics exists in the objective sense? How do humans know that our knowledge of mathematics is correct? He argues that the Christian doctrine of God as creator provides a basis for answering these questions. He also provides a critique of eight widely discussed philosophies of mathematics.

Go to article

Protein Alignment Scoring - Pam And Blosum, Dan E. Krane, Michael L. Raymer Jan 2003

Protein Alignment Scoring - Pam And Blosum, 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

E-Commerce Broker Prototype Implementation And Investigation, Rohini Krishnapura Jan 2003

E-Commerce Broker Prototype Implementation And Investigation, Rohini Krishnapura

School of Computing: Technical Reports

Personalization has become a popular solution to today’s Ecomerce challenges. Various personalization techniques have been researched and marketed. But, one technique may not suit all businesses. What is required is a mechanism to enable different policies based possibly on different personalization techniques. The Ebroker architecture presented here provides a mechanism to enable different policies with minimal effort. We present here the various components of the architecture as well as the features that the architecture provides. The details of a prototype design and implementation are also discussed.

Go to article

Mathematics And The Love Of God: An Introduction To The Thought Of Simone Weil, Scott Taylor Jan 2003

Mathematics And The Love Of God: An Introduction To The Thought Of Simone Weil, Scott Taylor

ACMS Journal 2004

Simone Weil was the sister of Andre Weil, one of the twentieth century's foremost mathematicians. She is a widely read and creative writer on spiritual themes. She addressed mathematics extensively in her writings. This paper discusses her views of mathematics and beauty, her critiques of modern science, her views on truth, and her concept that mathematical ideas can serve as symbols of spiritual ideas.

Go to article

Peer-To-Peer Grids, Geoffrey C. Fox, Dennis Gannon, Sung-Hoon Ko, Shrideep Pallickara, Xiaohong Qiu, Ahmet Uyar Jan 2003

Peer-To-Peer Grids, Geoffrey C. Fox, Dennis Gannon, Sung-Hoon Ko, Shrideep Pallickara, Xiaohong Qiu, Ahmet Uyar

Electrical Engineering and Computer Science - All Scholarship

We describe Peer-to-Peer Grids built around Integration of technologies from the peer-to-peer and Grid fields. We focus on the role of Web services linked by a powerful event service using uniform XML interfaces and application level routing. We describe how a rich synchronous and asynchronous collaboration environment can support virtual communities built on top of such infrastructure. Universal access mechanisms are discussed.

Go to article

Combining Ordering Heuristics And Bundling Techniques For Solving Finite Constraint Satisfaction Problems, Amy Beckwith, Berthe Y. Choueiry Jan 2003

Combining Ordering Heuristics And Bundling Techniques For Solving Finite Constraint Satisfaction Problems, Amy Beckwith, Berthe Y. Choueiry

School of Computing: Technical Reports

We investigate techniques to enhance the performance of backtrack search procedure with forward-checking (FC-BT) for finding all solutions to a finite Constraint Satisfaction Problem (CSP). We consider ordering heuristics for variables and/or values and bundling techniques based on the computation of interchangeability. While the former methods allow us to traverse the search space more effectively, the latter allow us to reduce it size. We design and compare strategies that combine static and dynamic versions of these two approaches. We show empirically the utility of dynamic variable ordering combined with dynamic bundling in both random problems and puzzles.

Go to article

A Dynamic Real-Time Scheduling Algorithm For Reduced Energy Consumption In I/O Devices, Rohini Krishnapura, Steve Goddard Jan 2003

A Dynamic Real-Time Scheduling Algorithm For Reduced Energy Consumption In I/O Devices, Rohini Krishnapura, Steve Goddard

School of Computing: Technical Reports

In real-time systems, Dynamic Power Management (DPM) techniques have traditionally centered on the CPU with less focus given to I/O. However, I/O-based DPM techniques have been popularly researched in non-real-time systems. These techniques focus on switching I/O devices to low power states based on some policy. These methods, however, are not applicable to realtime environments because of the non-deterministic nature of the policies. Recently, scheduling techniques to reduce power consumption of I/O devices in real-time systems have emerged. In this paper, we propose an online task scheduling algorithm, Slack Utilization for Reduced Energy (SURE), which utilizes slack in periodic task …

Go to article

First Prev Next Last