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 56071 - 56100 of 63328

Full-Text Articles in Entire DC Network

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. …


Factors In The Design And Development Of A Data Warehouse For Academic Data., Margaret C. Lester May 2003

Factors In The Design And Development Of A Data Warehouse For Academic Data., Margaret C. Lester

Electronic Theses and Dissertations

Data warehousing is a relatively new field in the realm of information technology, and current research centers primarily around data warehousing in business environments. As new as the field is in these environments, only recently have educational institutions begun to embark on data warehousing projects, and little research has been done regarding the special considerations and characteristics of academic data, and the complexity of analyzing such data. Educational institutions measure success very differently from business-oriented organizations, and the analyses that are meaningful in such environments pose very unique and intricate problems in data warehousing. This research describes the process of …


Healthcare Enterprise Process Development And Integration, Kemafor Anyanwu, Amit P. Sheth, Jorge Cardoso, John A. Miller, Krzysztof J. Kochut May 2003

Healthcare Enterprise Process Development And Integration, Kemafor Anyanwu, Amit P. Sheth, Jorge Cardoso, John A. Miller, Krzysztof J. Kochut

Kno.e.sis Publications

Healthcare enterprises involve complex processes that span diverse groups and organisations. These processes involve clinical and administrative tasks, large volumes of data, and large numbers of patients and personnel. The tasks can be performed either by humans or by automated systems. In the latter case, the tasks are supported by a variety of software applications and information systems which are very often heterogeneous, autonomous, and distributed. The development of systems to manage and automate these processes has increasingly played an important role in improving the efficiency of healthcare enterprises. In this paper we look at four healthcare and medical applications …


A Graphical Query Language For Object Oriented Databases, Ramiji Vandara May 2003

A Graphical Query Language For Object Oriented Databases, Ramiji Vandara

Electronic Dissertations and Theses

Object Oriented Database Management Systems(OOBMS)became popular in the mid-eighties, as a result of the sharply increased popularity of the object oriented programming languages. Many query languages for a number of OODB systems have been proposed, but most of them are similar, in spirit to SQL, which was designed for a relational database model. In an effort to emulate SQL functionality most of the new languages fail to exploit the fact that data in database is arranged intuitively in an OODB. The need for a more intuitive organization of data increased in recent years with the advent of more complex and …


Billiards Adviser As A Search In A Continuous Domain With Significant Uncertainty, Thomas Mueller May 2003

Billiards Adviser As A Search In A Continuous Domain With Significant Uncertainty, Thomas Mueller

Dartmouth College Undergraduate Theses

Typical search algorithms are limited to problems in which there is a certain number of moves for any given state, and the effect of each move is well known. In order to overcome this limitation, we consider the problem of determining the optimal shot given the positions of balls on a billiards table. Our solution includes the image recognition necessary to determine each ball's position, the calculation of the optimal shot, and the presentation of that shot to the player. The focus of the paper is on the second part - determining the angle and force with which the player …


An Active Learning Approach To Efficiently Ranking Retrieval Engines, Lisa A. Torrey May 2003

An Active Learning Approach To Efficiently Ranking Retrieval Engines, Lisa A. Torrey

Dartmouth College Undergraduate Theses

Evaluating retrieval systems, such as those submitted to the annual TREC competition, usually requires a large number of documents to be read and judged for relevance to query topics. Test collections are far too big to be exhaustively judged, so only a subset of documents is selected to form the judgment ``pool.'' The selection method that TREC uses produces pools that are still quite large. Research has indicated that it is possible to rank the retrieval systems correctly using substantially smaller pools. This paper introduces an active learning algorithm whose goal is to reach the correct rankings using the smallest …


Trusted S/Mime Gateways, Mindy J. Pereira May 2003

Trusted S/Mime Gateways, Mindy J. Pereira

Dartmouth College Undergraduate Theses

The utility of Web-based email clients is clear: a user is able to access their email account from any computer anywhere at any time. However, this option is unavailable to users whose security depends on their key pair being stored either on their local computer or in their browser. Our implementation seeks to solve two problems with secure email services. The first that of mobility: users must have access to their key pairs in order to perform the necessary cryptographic operations. The second is one of transition: initially, users would not want to give up their regular email clients. Keeping …


Persistence And Prevalence In The Mobility Of Dartmouth Wireless Network Users, Clara Lee May 2003

Persistence And Prevalence In The Mobility Of Dartmouth Wireless Network Users, Clara Lee

Dartmouth College Undergraduate Theses

Wireless local-area networks (WLANs) are increasing in popularity. As more people use WLANs it is important to understand how these users behave. We analyzed data collected over three months of 2002 to measure the persistence and prevalence of users of the Dartmouth wireless network.

We found that most of the users of Dartmouth's network have short association times and a high rate of mobility. This observation fits with the predominantly student population of Dartmouth College, because students do not have a fixed workplace and are moving to and from classes all day.


Can Probabilistic Databases Help Elect Qualified Officials?, Judy Goldsmith, Alex Dekhtyar, Wenzhong Zhao May 2003

Can Probabilistic Databases Help Elect Qualified Officials?, Judy Goldsmith, Alex Dekhtyar, Wenzhong Zhao

Computer Science and Software Engineering

We present a flexible framework for implementing reasoning with uncertainty: Semistructured Probabilistic Databases. This framework bridges the gap between the process of obtaining probabilistic information from data and its use in AI applications by providing the facilities to store and query diverse and complex probabilistic data.


Genescene: Biomedical Text And Data Mining, Gondy Leroy, Hsinchun Chen, Jesse D. Martinez, Shauna Eggers, Ryan R. Falsey, Kerri L. Kislin, Zan Huang, Jiexun Li, Jie Xu, Daniel M. Mcdonald, Gavin Ng May 2003

Genescene: Biomedical Text And Data Mining, Gondy Leroy, Hsinchun Chen, Jesse D. Martinez, Shauna Eggers, Ryan R. Falsey, Kerri L. Kislin, Zan Huang, Jiexun Li, Jie Xu, Daniel M. Mcdonald, Gavin Ng

CGU Faculty Publications and Research

To access the content of digital texts efficiently, it is necessary to provide more sophisticated access than keyword based searching. GeneScene provides biomedical researchers with research findings and background relations automatically extracted from text and experimental data. These provide a more detailed overview of the information available. The extracted relations were evaluated by qualified researchers and are precise. A qualitative ongoing evaluation of the current online interface indicates that this method to search the literature is more useful and efficient than keyword based searching.