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 241 - 270 of 628

Full-Text Articles in Computer Sciences

Non-Random Equidistant Letter Sequence Extensions In Ezekiel, Richard E. Sherman, Nathan Jacobi May 2003

Non-Random Equidistant Letter Sequence Extensions In Ezekiel, Richard E. Sherman, Nathan Jacobi

ACMS Conference Proceedings 2003

No abstract provided.


A Pseudo-History Of Number Systems, Richard Laatsch May 2003

A Pseudo-History Of Number Systems, Richard Laatsch

ACMS Conference Proceedings 2003

No abstract provided.


An Application In Bioinformatics : A Comparison Of Affymetrix And Compugen Human Genome Microarrays, Milind Misra May 2003

An Application In Bioinformatics : A Comparison Of Affymetrix And Compugen Human Genome Microarrays, Milind Misra

Theses

The human genome microarrays from Compugen® and Affymetrix® were compared in the context of the emerging field of computational biology. The two premier database servers for genomic sequence data, the National Center for Biotechnology Information and the European Bioinformatics Institute, were described in detail. The various databases and data mining tools available through these data servers were also discussed. Microarrays were examined from a historical perspective and their main current applications-expression analysis, mutation analysis, and comparative genomic hybridization-were discussed. The two main types of microarrays, cDNA spotted microarrays and high-density spotted microarrays were analyzed by exploring the human genome microarray …


Feedback Algorithm For Switch Location : Analysis Of Complexity And Application To Network Design, Yuriy S. Polyakov May 2003

Feedback Algorithm For Switch Location : Analysis Of Complexity And Application To Network Design, Yuriy S. Polyakov

Theses

An accelerated feedback algorithm to solve the single-facility minisum problem is studied with application to designing networks with the star topology. The algorithm, in which the acceleration with respect to the Weiszfeld procedure is achieved by multiplying the current Weiszfeld iterate by an accelerating feedback factor, is shown to converge faster than the accelerating procedures available in the literature. Singularities encountered in the algorithm are discussed in detail. A simple practical exception handling subroutine is developed. Several applications of the algorithm to designing computer networks with the star topology are demonstrated. Applications of the algorithm as a subroutine for multi-switch …


Uber-Claws : Unsupervised Pattern Classification For Multi-Unit Extracellular Neuronal Burst Extraction, Rama Natarajan May 2003

Uber-Claws : Unsupervised Pattern Classification For Multi-Unit Extracellular Neuronal Burst Extraction, Rama Natarajan

Theses

To further an understanding of how a neuronal population generates patterns of rhythmic activity, the temporal dynamics of the group of neurons must be formalized. Essential to this pursuit, is the ability to reliably detect and separate the classes of single-unit neuronal activity from multi-unit extracellular signals recorded in a single channel. This study proposes a unified approach to automatically detect and classify single-unit bursts, and to observe the precise onset and offset of burst activity. Existing approaches to the problem fundamentally depend on the statistics of spike waveform variability, both extrinsic and intrinsic to the neuron. In contrast, the …


Towards Digital Library Service Integration, Prateek Shrivastava May 2003

Towards Digital Library Service Integration, Prateek Shrivastava

Theses

Digital Library Service Integration (DLSI) aims to provide a systematic approach in integrating the services and collections of National Science and Digital Library. The National Science and Digital Library collections can share the services among themselves in a totally integrated environinent. Collections as such will require no change to plug into the DLSI architecture. Collections will keep using the services of NSDL in the similar manner as before. These services will in turn pass few parameters to the services of DLSI. With the help of these parameters, wrappers will fetch the details and priority of the users. These wrappers will …


Spade: Spki/Sdsi For Attribute Release Policies In A Distributed Environment, Sidharth P. Nazareth May 2003

Spade: Spki/Sdsi For Attribute Release Policies In A Distributed Environment, Sidharth P. Nazareth

Dartmouth College Master’s Theses

Shibboleth is a federated administrated system that supports inter-institutional authentication and authorization for sharing of resources. SPKI/SDSI is a public key infrastructure whose creation was motivated by the perception that X.509 is too complex and flawed. This thesis addresses the problem of how users that are part of a Public Key Infrastructure in a distributed computing system can effectively specify, create, and disseminate their Attribute Release Policies for Shibboleth using SPKI/SDSI. This thesis explores existing privacy mechanims, as well as distributed trust management and policy based systems. My work describes the prototype for a Trust Management Framework called SPADE (SPKI/SDSI …


Electronic Documents And Digital Signatures, Kunal Kain May 2003

Electronic Documents And Digital Signatures, Kunal Kain

Dartmouth College Master’s Theses

Often, the main motivation for using PKI in business environments is to streamline workflow, by enabling humans to digitally sign electronic documents, instead of manually signing paper ones. However, this application fails if adversaries can construct electronic documents whose viewed contents can change in useful ways, without invalidating the digital signature. In this paper, we examine the space of such attacks, and describe how many popular electronic document formats and PKI packages permit them.


Discovery, Visualization And Analysis Of Gene Regulatory Sequence Elements In Genomes, Daniel F. Simola May 2003

Discovery, Visualization And Analysis Of Gene Regulatory Sequence Elements In Genomes, Daniel F. Simola

Dartmouth College Undergraduate Theses

The advent of rapid DNA sequencing has produced an explosion in the amount of available sequence information, permitting us to ask many new questions about DNA. There is a pressing need to design algorithms that can provide answers to questions related to the control of gene expression, and thus to the structure, function, and behavior of organisms. Such algorithms must filter through massive amounts of informational noise to identify meaningful conserved regulatory DNA sequence elements. We are approaching these questions with the notion that visualization is a key to exploring data relationships. Understanding the exact nature of these relationships can …


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

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

ACMS Conference Proceedings 2003

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.


Introduction (2003), Association Of Christians In The Mathematical Sciences May 2003

Introduction (2003), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2003

Fourteenth Conference of the Association of Christians in the Mathematical Sciences


A Progressive Folding Algorithm For Rna Secondary Structure Prediction, Samuel J. Stearns May 2003

A Progressive Folding Algorithm For Rna Secondary Structure Prediction, Samuel J. Stearns

Dartmouth College Master’s Theses

RNA secondary structure prediction is an area where computational techniques have shown great promise. Most RNA secondary structure prediction algorithms use dynamic programming to compute a secondary structure with minimum free energy. Energy minimization algorithms are less accurate on larger RNA molecules. One potential reason is that larger RNA molecules do not fold instantaneously. Instead, several studies show that RNA molecules fold progressively during transcription. This process could encourage the molecule to fold into a structure that is not at the global lowest energy level. Additionally, dynamic programming algorithms do not allow for a important type of structure called a …


Schedule (2003), Association Of Christians In The Mathematical Sciences May 2003

Schedule (2003), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2003

Fourteenth Conference of the Association of Christians in the Mathematical Sciences


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

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

ACMS Conference Proceedings 2003

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.


Table Of Contents (2003), Association Of Christians In The Mathematical Sciences May 2003

Table Of Contents (2003), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2003

Fourteenth Conference of the Association of Christians in the Mathematical Sciences


Using Low Level Linear Memory Management For Type-Preserving Mark-Sweep Garbage Collector, Edward Wei May 2003

Using Low Level Linear Memory Management For Type-Preserving Mark-Sweep Garbage Collector, Edward Wei

Dartmouth College Undergraduate Theses

Efficient low-level systems such as garbage collectors need more control over memory than safe high-level languages usually provide. Due to this constraint, garbage collectors are typically written in unsafe languages such as C. A collector of this form usually resides as a trusted primitive runtime service outside the model of the programming language. The type safety of these languages depends on the assumption that the garbage collector will not violate any typing invariants. However, no realistic systems provide proof of this assumption. A garbage collector written in a strongly typed language can guarantee not only the safety of the garbage …


Knot Intervals And Multi-Degree Splines, Thomas W. Sederberg, Jianmin Zheng, Xiaowen Song May 2003

Knot Intervals And Multi-Degree Splines, Thomas W. Sederberg, Jianmin Zheng, Xiaowen Song

Faculty Publications

This paper studies the merits of using knot interval notation for B-spline curves, and presents formulae in terms of knot intervals for common B-spline operations such as knot insertion, differentiation, and degree elevation. Using knot interval notation, the paper introduces MD-splines, which are B-spline-like curves that are comprised of polynomial segments of various degrees (MD stands for \multi-degree"). MD-splines are a generalization of B-spline curves in that if all curve segments in an MD-spline have the same degree, it reduces to a B-spline curve. The paper focuses on MD-splines of degree 1, 2, and 3, as well as degree 1 …


An Analysis Of Convergence Properties Of The Border Gateway Protocol Using Discrete Event Simulation, Brian J. Premore May 2003

An Analysis Of Convergence Properties Of The Border Gateway Protocol Using Discrete Event Simulation, Brian J. Premore

Dartmouth College Ph.D Dissertations

The Internet is an enormous internetwork formed by connecting tens of thousands of independently managed computer networks. Though the Internet has no central authority and is highly heterogeneous, a universally adopted addressing scheme---defined by the Internet Protocol (IP)---makes interaction between the individual networks possible. Complementing IP is the Border Gateway Protocol (BGP), which facilitates communication between parts of the internetwork by determining paths by which data can get from one network to any other. Just as IP is used ubiquitously as an addressing scheme, BGP is used ubiquitously for the purpose of network-to-network routing. Because BGP is universal, its well-being …


Semantic Web Process Lifecycle: Role Of Semantics In Annotation, Discovery, Composition And Orchestration, Amit P. Sheth May 2003

Semantic Web Process Lifecycle: Role Of Semantics In Annotation, Discovery, Composition And Orchestration, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


A Noise Filtering Method Using Neural Networks, Tony R. Martinez, Xinchuan Zeng May 2003

A Noise Filtering Method Using Neural Networks, Tony R. Martinez, Xinchuan Zeng

Faculty Publications

During the data collecting and labeling process it is possible for noise to be introduced into a data set. As a result, the quality of the data set degrades and experiments and inferences derived from the data set become less reliable. In this paper we present an algorithm, called ANR (automatic noise reduction), as a filtering mechanism to identify and remove noisy data items whose classes have been mislabeled. The underlying mechanism behind ANR is based on a framework of multi-layer artificial neural networks. ANR assigns each data item a soft class label in the form of a class probability …


Simplifying Ocr Neural Networks With Oracle Learning, Tony R. Martinez, Joshua Menke May 2003

Simplifying Ocr Neural Networks With Oracle Learning, Tony R. Martinez, Joshua Menke

Faculty Publications

Often the best model to solve a real world problem is relatively complex. The following presents oracle learning, a method using a larger model as an oracle to train a smaller model on unlabeled data in order to obtain (1) a simpler acceptable model and (2) improved results over standard training methods on a similarly sized smaller model. In particular, this paper looks at oracle learning as applied to multi-layer perceptrons trained using standard backpropagation. For optical character recognition, oracle learning results in an 11.40% average decrease in error over direct training while maintaining 98.95% of the initial oracle accuracy.


Authoritative Citation Knn Learning With Noisy Training Datasets, Leen-Kiat Soh, Joseph Bernadt May 2003

Authoritative Citation Knn Learning With Noisy Training Datasets, Leen-Kiat Soh, Joseph Bernadt

School of Computing: Technical Reports

In this paper, we investigate the effectiveness of Citation K-Nearest Neighbors (KNN) learning with noisy training datasets. We devise an authority measure associated with each training instance that changes based on the outcome of Citation KNN classification. The authority is increased when a citer’s classification had been right; and vice versa. We show that by modifying only these authority measures, the classification accuracy of Citation KNN improves significantly in a variety of datasets with different noise levels. We also identify the general characteristics of a dataset that affect the improvement percentages. We conclude that the new algorithm is able to …


Compressed Data Structures For Recursive Flow Classification, Edward W. Spitznagel May 2003

Compressed Data Structures For Recursive Flow Classification, Edward W. Spitznagel

All Computer Science and Engineering Research

High-speed packet classification is crucial to the implementation of several advanced network services and protocols; many QoS implementations, active networking platforms, and security devices (such as firewalls and intrusion-detection systems) require it. But performing classification on multiple fields, at the speed of modern networks, is known to be a difficult problem. The Recursive Flow Classification (RFC) algorithm described by Gupta and McKeown performs classification very quickly, but can require excessive storage when using thousands of rules. This paper studies a compressed representation for the tables used in RFC, trading some memory accesses for space. The compression’s efficiency can be improved …


Development Of A Systems Engineering Model Of The Chemical Separations Process, Yitung Chen, Darrell Pepper, Randy Clarksean May 2003

Development Of A Systems Engineering Model Of The Chemical Separations Process, Yitung Chen, Darrell Pepper, Randy Clarksean

Separations Campaign (TRP)

Two activities are proposed: the development of a systems engineering model and the refinement of the Argonne code AMUSE (Argonne Model for Universal Solvent Extraction). The detailed systems engineering model will be continuously focusing on the integrated approach to the analysis of the materials separations associated with the TRP Program. A second portion of the project will streamline and improve an integral part of the overall systems model, which is the software package AMUSE. AMUSE analyzes the UREX process and other related solvent extraction processes and defines many of the process streams that are integral to the systems engineering model. …


Development Of A Systems Engineering Model Of The Chemical Separations Process: Quarterly Progress Report 2/16/03- 5/15/03, Yitung Chen, Randy Clarksean, Darrell Pepper May 2003

Development Of A Systems Engineering Model Of The Chemical Separations Process: Quarterly Progress Report 2/16/03- 5/15/03, Yitung Chen, Randy Clarksean, Darrell Pepper

Separations Campaign (TRP)

Two activities are proposed in this Phase I task: the development of a systems engineering model and the refinement of the Argonne code AMUSE (Argonne Model for Universal Solvent Extraction). The detailed systems engineering model is the start of an integrated approach to the analysis of the materials separations associated with the AAA Program. A second portion of the project is to streamline and improve an integral part of the overall systems model, which is the software package AMUSE. AMUSE analyzes the UREX process and other related solvent extraction processes and defines many of the process streams that are integral …


Efficient Security For Bgp Route Announcements, David M. Nicol, Sean W. Smith, Meiyuan Zhao May 2003

Efficient Security For Bgp Route Announcements, David M. Nicol, Sean W. Smith, Meiyuan Zhao

Computer Science Technical Reports

The Border Gateway Protocol (BGP) determines how Internet traffic is routed throughout the entire world; malicious behavior by one or more BGP speakers could create serious security issues. Since the protocol depends on a speaker honestly reporting path information sent by previous speakers and involves a large number of independent speakers, the Secure BGP (S-BGP) approach uses public-key cryptography to ensure that a malicious speaker cannot fabricate this information. However, such public-key cryptography is expensive: S-BGP requires a digital signature operation on each announcement sent to each peer, and a linear (in the length of the path) number of verifications …


Reply To "Comment On ‘Atomic Spectral Line Free-Parameter Deconvolution Procedure’”, Vladimir Milosavljevic, Goran Poparic May 2003

Reply To "Comment On ‘Atomic Spectral Line Free-Parameter Deconvolution Procedure’”, Vladimir Milosavljevic, Goran Poparic

Articles

We do not agree with the authors of the preceding Comment [X. Nikolic, X. Ojurovic, and X. Mijatovic, Phys. Rev. E, 67, 058401, 2003]. Our numerical procedure for the deconvolution of the theoretical asymmetric convolution integral of a Gaussian and a plasma broadened spectral line profile jA,R(λ) for spectral lines enables the determination of all broadening parameters. All broadening parameters can be determined directly from the recorded line profile of a single line, with minimal assumptions or prior knowledge. Additional experimental diagnostics are not required.


Extending Csp To Disambiguate Linda Predicate Operations, Kyle Burke May 2003

Extending Csp To Disambiguate Linda Predicate Operations, Kyle Burke

Honors Theses

The Tuple Space communication environment is plagued by the apparent ambiguity present in the predicate operations of Linda, the programming extension used to implement Tuple Space. It bas been shown that by using a method of reasoning which describes only sequentialized traces of events, it is unclear what a failed predicate operation actually means. Using an operational semantics model of Tuple Space, an analysis of the predicate operations using a description of events occurring simultaneously has disambiguated the meanings of the failure cases. Here an algebraic model is provided, using the Communicating Sequential Process (CSP) process algebra as a base. …


Coolest Mud Ever, Kevin Radloff May 2003

Coolest Mud Ever, Kevin Radloff

Honors Theses

MUDs, or Multi-User Dungeons, are text-based online multiplayer roleplaying games. Players type commands that allow them to interact with other players in a virtual world, and also interact with the world itself, for example, picking up objects or casting spells. The goal of The Coolest MUD Ever (CME) was to build the basis of an event driven and completely extensible MUD engine with unheard of levels of environmental realism. Whereas other MUDs are organized as a set of distinct nodes in which gameplay occurs exclusively of each other node, my MUD will blur the lines between nodes. While players still …


Categorizing Non-Functional Requirements Using A Hierarchy In Uml., James David Moody May 2003

Categorizing Non-Functional Requirements Using A Hierarchy In Uml., James David Moody

Electronic Theses and Dissertations

Non-functional requirements (NFRs) are a subset of requirements, the means by which software system developers and clients communicate about the functionality of the system to be built. This paper has three main parts: first, an overview of how non-functional requirements relate to software engineering is given, along with a survey of NFRs in the software engineering literature. Second, a collection of 161 NFRs is diagrammed using the Unified Modelling Language, forming a tool with which developers may more easily identify and write additional NFRs. Third, a lesson plan is presented, a learning module intended for an undergraduate software engineering curriculum. …