Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 18 of 18
Full-Text Articles in Physical Sciences and Mathematics
Webalps Implementation And Performance Analysis: Using Trusted Co-Servers To Enhance Privacy And Security Of Web Interactions, Shan Jiang
Dartmouth College Master’s Theses
The client-server model of the Web poses a fundamental trust issue: clients are forced to trust in secrecy and correctness of computation occurring at a remote server of unknown credibility. The current solution for this problem is to use a PKI (Public Key Infrastructure) system and SSL (Secure Sockets Layer) digital certificates to prove the claimed identity of a server and establish an authenticated, encrypted channel between the client and this server. However, this approach does not address the security risks posed by potential malicious server operators or any third parties who may penetrate the server sites. The WebALPS (Web …
A Directory Infrastructure To Support Mobile Services, Ammar Khalid
A Directory Infrastructure To Support Mobile Services, Ammar Khalid
Dartmouth College Undergraduate Theses
Traditional Voice-over-IP applications such as Microsoft NetMeeting assume that the user is on a machine with a fixed IP address. If, however, the user connects to the Internet, via a wireless network, on a handheld device, his IP address frequently changes as he moves from one subnet to another. In such a situation, we need a service that can be queried for the most current IP address of a person whom we wish to contact. In this project, we design and implement such a directory service. The service authenticates all callers and callees, is robust against most host failure, and …
Smartreminder: A Case Study On Context-Sensitive Applications, Arun Mathias
Smartreminder: A Case Study On Context-Sensitive Applications, Arun Mathias
Dartmouth College Undergraduate Theses
Designing context-sensitive applications is challenging. We design and implement SmartReminder to explore designing context-sensitive applications and to demonstrate how the SOLAR system can be used in developing such applications. SmartReminder is an application that reminds the user based on contextual information. Current appointment-reminder applications remind the user about their appointments at an arbitrarily specified time. For instance, they might remind the user ten minutes before each appointment. SmartReminder, on the other hand, uses contextual information, like location, to better estimate the appropriate reminder time for each appointment. It reminds the user based on where they are, where they need to …
Measuring Early Usage Of Dartmouth's Wireless Network, Pablo Stern
Measuring Early Usage Of Dartmouth's Wireless Network, Pablo Stern
Dartmouth College Undergraduate Theses
In Spring 2001, Dartmouth College installed a campus-wide 802.11b wireless network. To understand how that network is used, we examined the usage characteristics of the network over a five-week period. We monitored access points to determine user behavior, and user and network traffic characteristics. Because our study coincided with the deployment of the access points, our analysis captures the growth of a wireless network. The results of this study help understand the behavior of mobile users and provide a reference to network engineers wishing to deploy and expand similar wireless networks.
An Empirical Study Of Training And Testing Error In Boosting, David D. Latham
An Empirical Study Of Training And Testing Error In Boosting, David D. Latham
Dartmouth College Undergraduate Theses
Bounds have been proven for both training and testing error for the boosting algorithm AdaBoost, but in practice neither seem to produce a particularly tight bound. In this paper we share some observations of these bounds from empirical results, and then explore some properties of the algorithm with an eye towards finding an improved bound for the performance of AdaBoost. Based on our empirical evidence, the error of a hypothesis which labels examples probabilistically based upon the confidence of the vote of the weak hypotheses forms a tighter bound for the training error.
Implementing A Database Information System For An Electronic Baseball Scorecard, Tiffany M. Wong
Implementing A Database Information System For An Electronic Baseball Scorecard, Tiffany M. Wong
Dartmouth College Undergraduate Theses
We present our design and implementation of a database system of information storage and retrieval for an electronic baseball scorecard. The program uses the relational MySQL database to hold information and a Tcl API to handle interactions between the database and the user interface code. This paper discusses the inner workings of how information storage was broken down inside the database, how queries were internally constructed in accordance with the user's input, and how statistics for players and teams were calculated and returned to the user. Finally, we discuss some limitations attached to our current implementation of the program and …
A System For Audio Personalization With Applications On Wireless Devices, David Marmaros
A System For Audio Personalization With Applications On Wireless Devices, David Marmaros
Dartmouth College Undergraduate Theses
We present and analyze a system for dynamically tailoring discrete audio content for numerous users based on aggregate data and intuitive feedback mechanisms. The framework for this system utilizes a flexible client-server architecture to facilitate audio dissemination, with particular attention to distribution over wireless networks. We discuss the requirements and specifications of such a system. We further analyze the algorithms and protocols required for its operation. Finally, we outline and provide data from a demonstration of this application.
An Armored Data Vault, Alex Iliev
An Armored Data Vault, Alex Iliev
Dartmouth College Undergraduate Theses
We consider the problem of secure long-term archiving of network traffic, an instance of the problem of storing data securely. We approach the problem using secure hardware, which enables the enforcement of flexible access policy. The policy cannot be circumvented by anyone, even insiders, and so we are assured that access to the data is as originally intended. The policy can be expressed as any feasible computation, as it will be checked inside the secure hardware without possibility of interference. We discuss our design of a device to perform such network data archiving and have implemented a prototpe device. We …
Optimizing The Dimensional Method For Performing Multidimensional, Multiprocessor, Out-Of-Core Ffts, Jeremy T. Fineman
Optimizing The Dimensional Method For Performing Multidimensional, Multiprocessor, Out-Of-Core Ffts, Jeremy T. Fineman
Dartmouth College Undergraduate Theses
We present an improved version of the Dimensional Method for computing multidimensional Fast Fourier Transforms (FFTs) on a multiprocessor system when the data consist of too many records to fit into memory. Data are spread across parallel disks and processed in sections. We use the Parallel Disk Model for analysis. The simple Dimensional Method performs the 1-dimensional FFTs for each dimension in term. Between each dimension, an out-of-core permutation is used to rearrange the data to contiguous locations. The improved Dimensional Method processes multiple dimensions at a time. We show that determining an optimal sequence and groupings of dimensions is …
Ecomrisk.Org : A Site To Classify And Organize The Risks Of Performing Business On The Internet, Aidan Stanley Marcuss
Ecomrisk.Org : A Site To Classify And Organize The Risks Of Performing Business On The Internet, Aidan Stanley Marcuss
Dartmouth College Undergraduate Theses
As the use of the Internet and other computer networks to transact business grows, there is an ever increasing need for those taking part in those transactions to understand the risks of doing so. While there are many web sites that have created valuable databases of specific vulnerabilities for certain types of hardware and software, there is a lack of focus on attempting to analyze the interaction of businesses, their systems, computer networks, and their customers and the risks that are created by either intended or unattended interactions. EcomRISK.org is a web site that presents a clear taxonomy to classify …
Efficient Compression Of Generic Function Dispatch Tables, Eric Kidd
Efficient Compression Of Generic Function Dispatch Tables, Eric Kidd
Dartmouth College Undergraduate Theses
A generic function is similar to an overloaded operator, but provides a way to select an appropriate behavior at run-time instead of compile-time. Dujardin and colleagues have proposed an algorithm for building and compressing generic function dispatch tables. We present several modifications to their algorithm, including an improvement to Pseudo-Closest-Poles and two new algorithms for compressing pole tables. The two new compression algorithms are simple and fast, and one produces smaller output than the original.
Dassfnet: An Extension To Dassf For High-Performance Network Modeling, Mehmet Iyigun
Dassfnet: An Extension To Dassf For High-Performance Network Modeling, Mehmet Iyigun
Dartmouth College Undergraduate Theses
Scalable Simulation Framework (SSF) is a discrete-event simulation framework providing a unified programming interface geared towards network simulation. Dartmouth SSF (DaSSF) is a C++ implementation of SSF, designed for simulating very large-scale multi-protocol communication networks. As of the latest release, DaSSF lacks many features present in SSF and this prevents it from achieving mainstream use. To alleviate this shortcoming we designed and implemented DaSSFNet which extends DaSSF to the levels of functionality found in SSF. In this paper, we show that DaSSFNet and SSFNet are identical in operation given the same input. We also show that DaSSFNet is about twice …
Fastab: Solving The Pitch To Notation Problem, Jeremy I. Robin
Fastab: Solving The Pitch To Notation Problem, Jeremy I. Robin
Dartmouth College Undergraduate Theses
I have always been frustrated with the length of time necessary to notate a piece of music. Computers have simplified so many other aspects of our lives, it seems that they should be able to simplify this task as well. In fact, there are already two distinct ways that engineers have attempted to attack this problem. The first analyzes the waveform generated by microphone input and relies on Fourier Analysis and other similar methods. The other examines the analog signal generated by a electric guitar-like pickup placed beneath the strings. The method used by Fastab relies much less on the …
Market-Based Control Of Mobile-Agent Systems, Jonathan L. Bredin
Market-Based Control Of Mobile-Agent Systems, Jonathan L. Bredin
Dartmouth College Ph.D Dissertations
Modern distributed systems scatter sensors, storage, and computation throughout the environment. Ideally these devices communicate and share resources, but there is seldom motivation for a device's owner to yield control to another user. We establish markets for computational resources to motivate principals to share resources with arbitrary users, to enforce priority in distributed systems, to provide flexible and rational limitations on the potential of an application, and to provide a lightweight structure to balance the workload over time and between devices. As proof of concept, we implement a structure software agents can use to discover and negotiate access to networked …
An Implementation Of Object-Oriented Program Transformation For Thought-Guided Debugging, Tiffany M. Wong
An Implementation Of Object-Oriented Program Transformation For Thought-Guided Debugging, Tiffany M. Wong
Dartmouth College Undergraduate Theses
This paper presents our design and implementation of program transformation for C++ that will be used in the context of a thought-guided debugging system. The program uses a lexical analyzer written in Flex and a grammar written in Bison that work in conjunction to scan the inputted C++ code for function definitions and class definitions. The code is then transformed to produce trace information for each defined function, while the original functionality of the code is left untouched. We also implement two additional data structures that are used for information storage during the course of the program.
Mobile Voice Over Ip (Mvoip): An Application-Level Protocol, Ayorkor Mills-Tettey
Mobile Voice Over Ip (Mvoip): An Application-Level Protocol, Ayorkor Mills-Tettey
Dartmouth College Undergraduate Theses
Current Voice over Internet Protocol (VOIP) protocols require participating hosts to have fixed IP addresses for the duration of a VOIP call. When using a wireless-enabled host, such as a tablet computer on an 802.11 wireless network, it is possible for a participant in a VOIP call to roam around the network, moving from one subnet to another and needing to change IP addresses. This address change creates the need for mobility support in VOIP applications. We present the design of Mobile Voice over IP (MVOIP), an application-level protocol that enables such mobility in a VOIP application based on the …
Tcp/Ip Implementation Within The Dartmouth Scalable Simulation Framework, Michael G. Khankin
Tcp/Ip Implementation Within The Dartmouth Scalable Simulation Framework, Michael G. Khankin
Dartmouth College Undergraduate Theses
This paper discusses TCP/IP networking, and in particular, the DaSSF implementation of TCP/IP. The paper reviews the protocols, outlines the implementation design, and demonstrates some tests. In addition, some performance and memory usage analysis is performed. We find DaSSF TCP/IP to be a viable option to the existing SSF. DaSSF TCP/IP is faster and uses less memory so we can simulate larger, more complex, models.
Improving A Brokering System For Linking Distributed Simulations, Thomas B. Stephens
Improving A Brokering System For Linking Distributed Simulations, Thomas B. Stephens
Dartmouth College Undergraduate Theses
The Agent Based Environment for Linking Simulations (ABELS) is a software framework designed to provide disparate simulations with dynamically updated data sources. It allows simulations and other agents to join a "cloud" of interacting producers and consumers of data. Once they have joined the cloud, they can publish services to other members and use methods published by others. This paper presents the initial design of a set of matchmaking components for the ABELS framework. These components dictate how services describe their abilities and requirements to ABELS. Furthermore, they help ABELS successfully match data producing services to the requests of data …