Computer Sciences Commons^™

A Theoretical Model Of Multi-Agent Quantum Computing, F. Matthew Mihelic

Faculty Publications

The best design for practical quantum computing is one that emulates the multi-agent quantum logic function of natural biological systems. Such systems are theorized to be based upon a quantum gate formed by a nucleic acid Szilard engine (NASE) that converts Shannon entropy of encountered molecules into useful work of nucleic acid geometric reconfiguration. This theoretical mechanism is logically and thermodynamically reversible in this special case because it is literally constructed out of the (nucleic acid) information necessary for its function, thereby allowing the nucleic acid Szilard engine to function reversibly because, since the information by which it functions exists …

Paper Abstracts (2011), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2011

Eighteenth Conference of the Association of Christians in the Mathematical Sciences

Introduction (2011), Russell Howell

ACMS Conference Proceedings 2011

Eighteenth Conference of the Association of Christians in the Mathematical Sciences

Reader-Writer Exclusion Supporting Upgrade And Downgrade With Reader-Priority, Michael I. Diamond

Dartmouth College Undergraduate Theses

The Reader-Writer Exclusion problem seeks to provide a lock that protects some critical section of code for two classes of processes, readers and writers, where multiple readers are permitted to hold the lock at a time, but only one writer can hold the lock to the exclusion of all other processes. The difficulties in solving this problem lie not only in developing a good algorithm, but in rigorously formulating desirable properties for such an algorithm to have. Recently, Bhatt and Jayanti accomplished both of these tasks for several variants of the Reader-Writer Exclusion problem. We seek to extend their work …

Ieee 802.15.4 Wireless Security: Self-Assessment Frameworks, Ryan Speers

Dartmouth College Undergraduate Theses

This thesis analyzes the security of networks built upon the IEEE 802.15.4 standard, specifically in regard to the ability of an attacker to manipulate such networks under real-world conditions. The author presents a set of tools, both hardware and software, that advance the state-of-the-art in reconnaissance and site surveying, intelligent packet generation, and launching of attacks. Specifically, tools provide increased hardware support for the KillerBee toolkit, a Scapy layer for forming 802.15.4 packets, reflexive jamming of packets, and other research enablers. This work aims to advance the ability of security auditors to understand the threats to IEEE 802.15.4 networks by …

Exploiting The Hard-Working Dwarf: Trojan And Exploit Techniques Without Native Executable Code, James M.H. Oakley

Dartmouth College Undergraduate Theses

The study of vulnerabilities and exploitation is one of finding mechanisms affecting the flow of computation and of finding new means to perform unexpected computation. In this paper we show the extent to which exception handling mechanisms as implemented and used by \gcc can be used to control program execution. We show that the data structures used to store exception handling information on UNIX-like systems actually contain Turing-complete bytecode, which is executed by a virtual machine during the course of exception unwinding and handling. We discuss how a malicious attacker could gain control over these structures and how such an …

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

ACMS Conference Proceedings 2011

Eighteenth Conference of the Association of Christians in the Mathematical Sciences

Constant-Rmr Abortable Reader-Priority Reader-Writer Algorithm, Nan Zheng

Dartmouth College Undergraduate Theses

The concurrent reader-writer problem (Courtois, 1971) involves two classes of processes: readers and writers, both of which wish to access a shared resource. Many readers can access the shared resource at the same time. However, if a writer is accessing the resource, no readers or other writers can access the resource at the same time. In the reader-priority version of the problem, readers are prioritized over writers when processes from both classes are trying to access the shared resource. Previous research (Bhatt, 2010) showed a reader-priority constant-RMR multi-reader, multi-writer algorithm for Cache-Coherent (CC) systems. However, this algorithm does not allow …

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

ACMS Conference Proceedings 2011

Eighteenth Conference of the Association of Christians in the Mathematical Sciences

Numerical Modeling Of The Cn Spectral Emission Of The Stardust Re-Entry Vehicle, Alexandre Martin, Erin D. Farbar, Iain D. Boyd

Mechanical Engineering Faculty Publications

Re-entry vehicles designed for space exploration are usually equipped with thermal protection systems made of ablative material. In order to properly model and predict the aerothermal environment of the vehicle, it is imperative to account for the gases produced by ablation processes. In the case of charring ablators, where an inner resin is pyrolyzed at a relatively low temperature, the composition of the gas expelled into the boundary layer is complex and may lead to thermal chemical reactions that cannot be captured with simple ow chemistry models. In order to obtain better predictions, an appropriate gas ow chemistry model needs …

Automatic Domain Model Creation Using Pattern-Based Fact Extraction, Christopher Thomas, Pankaj Mehra, Wenbo Wang, Amit P. Sheth, Gerhard Weikum, Victor Chan

Kno.e.sis Publications

This paper describes a minimally guided approach to automatic domain model creation. The first step is to carve an area of interest out of the Wikipedia hierarchy based on a simple query or other starting point. The second step is to connect the concepts in this domain hierarchy with named relationships. A starting point is provided by Linked Open Data, such as DBPedia. Based on these community-generated facts we train a pattern-based fact-extraction algorithm to augment a domain hierarchy with previously unknown relationship occurrences. Pattern vectors are learned that represent occurrences of relationships between concepts. The process described can be …

Multi-Field Visualization For Biomedical Data Sets, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.

Reader-Writer Exclusion Supporting Upgrade And Downgrade With Starvation Freedom, Matthew Elkherj

Dartmouth College Undergraduate Theses

In this thesis we give a constant Remote-Memory-Reference (on CC systems) reader-writer exclusion algorithm supporting upgrade and downgrade, built from a reader-writer exclusion algorithm by Jayanti and Liu. The algorithm is starvation-free, and allows for repeated upgrades and downgrades.

Effects Of Network Trace Sampling Methods On Privacy And Utility Metrics, Phillip A. Fazio

Dartmouth College Undergraduate Theses

Researchers studying computer networks rely on the availability of traffic trace data collected from live production networks. Those choosing to share trace data with colleagues must first remove or otherwise anonymize sensitive information. This process, called sanitization, represents a tradeoff between the removal of information in the interest of identity protection and the preservation of data within the trace that is most relevant to researchers. While several metrics exist to quantify this privacy-utility tradeoff, they are often computationally expensive. Computing these metrics using a sample of the trace, rather than the entire input trace, could potentially save precious time and …

Privacy-By-Design In Federated Social Web Applications, Alexandre Passant, Owen Sacco, Julia Anaya, Pavan Kapanipathi

Kno.e.sis Publications

No abstract provided.

Acms 18th Biennial Conference Proceedings, Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2011

Association of Christians in the Mathematical Sciences 18th Biennial Conference Proceedings, June 1-4, 2011, Westmont College, Santa Barbara, CA.

The R Journal (June 2011) 3(1): Complete Issue, The R Foundation

The R Journal

Contributed Research Articles

testthat: Get Started with Testing, Hadley Wickham

Content-Based Social Network Analysis of Mailing Lists, Angela Bohn, Ingo Feinerer, Kurt Hornik, and Patrick Mair

Rmetrics: timeDate Package, Yohan Chalabi, Martin Mächler, and Diethelm Würtz

The digitize Package: Extracting Numerical Data from Scatterplots, Timothée Poisot

Differential Evolution with DEoptim, David Ardia, Kris Boudt, Peter Carl, Katharine M. Mullen, and Brian G. Peterson

rworldmap: A New R Package for Mapping Global Data, Andy South

Cryptographic Boolean Functions with R, Frédéric Lafitte, Dirk Van Heule and Julien Van hamme

Raster Images in R Graphics, Paul Murrell

Probabilistic Weather Forecasting in R, …

A Cellular Automata Model Of Infection Control On Medical Implants, Alicia Prieto-Langarica, Hristo Kojouharov, Benito Chen-Charpentier, Liping Tang

Applications and Applied Mathematics: An International Journal (AAM)

S. epidermidis infections on medically implanted devices are a common problem in modern medicine due to the abundance of the bacteria. Once inside the body, S. epidermidis gather in communities called biofilms and can become extremely hard to eradicate, causing the patient serious complications. We simulate the complex S. epidermidis-Neutrophils interactions in order to determine the optimum conditions for the immune system to be able to contain the infection and avoid implant rejection. Our cellular automata model can also be used as a tool for determining the optimal amount of antibiotics for combating biofilm formation on medical implants.

Automated Auction Mechanism Design With Competing Markets, Jinzhong Niu

Publications and Research

Resource allocation is a major issue in multiple areas of computer science. Despite the wide range of resource types across these areas, for example real commodities in e-commerce and computing resources in distributed computing, auctions are commonly used in solving the optimization problems involved in these areas, since well designed auctions achieve desirable economic outcomes.

Auctions are markets with strict regulations governing the information available to traders in the market and the possible actions they can take. Auction mechanism design aims to manipulate the rules of an auction in order to achieve specific goals. Economists traditionally use mathematical methods, mainly …

Resizable, Scalable, Concurrent Hash Tables Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Presentation focusing on software synchronization, thread locking, transactional memory, and relativistic programming. Hash table algorithms are presented with examples of relativistic list insertion and removal, and related data structures. Existing approaches are compared to new methodologies and future work with relativistic data structures.

Resizable, Scalable, Concurrent Hash Tables, Josh Triplett, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups. These resize algorithms allow the hash table to maintain constant-time performance as the number of entries grows, and reclaim memory as the number of entries decreases, without delaying or disrupting readers.

We implemented our algorithms in the Linux kernel, to test their performance and scalability. Benchmarks show lookup scalability improved 125x over readerwriter locking, and 56% over the current state-of-the-art for Linux, with no performance degradation for lookups during a resize.

To achieve this performance, this hash table implementation uses a new concurrent …

Coffee_Shop: Investigations Into Modern Word Processors., Nathaniel Welch

Computer Science and Software Engineering

My senior project was spent building a desktop application similar to WriteRoom and OmmWriter. These two applications are both word processors for the Macintosh OS X operating system. Both of these applications are designed to be a reset on word processing software, bringing their interfaces back to the days of Microsoft Word 3.0 and Word Perfect. They do this by spending more time on focusing on the design of the software interface, and focusing on keeping it minimalistic, instead of filling the product with new obscure features, which is a common complaint against the current iterations of Microsoft Word.

The …

Local Closed-World Reasoning With Description Logics Under The Well-Founded Semantics, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler

Computer Science and Engineering Faculty Publications

An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases (Motik and Rosati, 2010 [52]), and it is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. In this paper we propose a well-founded semantics for nondisjunctive hybrid MKNF knowledge bases that promises to provide better efficiency of reasoning, and that is compatible with both the OWL-based …

Raster Images In R Graphics, Paul Murrell

The R Journal

The R graphics engine has new support for rendering raster images via the functions rasterImage() and grid.raster(). This leads to better scaling of raster images, faster rendering to screen, and smaller graphics files. Several examples of possible applications of these new features are described.

Cryptographic Boolean Functions With R, Frédéric Lafitte, Dirk Van Heule, Julien Van Hamme

The R Journal

A new package called boolfun is avail able for R users. The package provides tools to handle Boolean functions, in particular for cryptographic purposes. This document guides the user through some (code) examples and gives a feel of what can be done with the package.

Rmetrics: Timedate Package, Yohan Chalabi, Martin Mächler, Diethelm Würtz

The R Journal

The management of time and holidays can prove crucial in applications that rely on historical data. Atypical example is the aggregation of a data set recorded in different time zones and under different daylight saving time rules. Be sides the time zone conversion function, which is well supported by default classes in R,one might need functions to handle special days or holidays. In this respect, the package timeDate enhances default date-time classes in R and brings new functionalities to time zone management and the creation of holiday calendars

The Digitize Package: Extracting Numerical Data From Scatterplots, Timothée Poisot

The R Journal

I present the small R package digitize, designed to extract data from scatter plots with a simple method and suited to small datasets. I present an application of this method to the ex traction of data from a graph whose source is not available.

Analyzing An Electronic Limit Order Book, David Kane, Andrew Liu, Khanh Nguyen

The R Journal

The orderbook package provides facilities for exploring and visualizing the data associated with an order book: the electronic collection of the outstanding limit orders for a financial instrument. This article provides an overview of the orderbook package and examples of its use.

Testthat: Get Started With Testing, Hadley Wickham

The R Journal

Software testing is important, but many of us don’t do it because it is frustrating and boring. testthat is a new testing framework for R that is easy learn and use, and integrates with your existing workflow. This paper shows how, with illustrations from existing packages.

Rworldmap: A New R Package For Mapping Global Data, Andy South

The R Journal

rworldmap is a relatively new package available on CRAN for the mapping and visualisation of global data. The vision is to make the display of global data easier, to facilitate understanding and communication. The initial focus is on data referenced by country or grid due to the frequency of use of such data in global assessments. Tools to link data referenced by country (either name or code) to a map, and then to display the map are provided as are functions to map global gridded data. Country and gridded functions accept the same arguments to specify the nature of categories …