Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Artificial Intelligence and Robotics (60)
- Medicine and Health Sciences (53)
- Graphics and Human Computer Interfaces (35)
- Engineering (28)
- Social and Behavioral Sciences (27)
-
- Theory and Algorithms (23)
- Data Science (22)
- Arts and Humanities (18)
- Other Computer Sciences (17)
- Information Security (13)
- Computer Engineering (12)
- Health Information Technology (12)
- Life Sciences (11)
- Art and Design (10)
- Psychology (10)
- Statistics and Probability (10)
- Interactive Arts (9)
- Mathematics (9)
- Applied Mathematics (8)
- OS and Networks (8)
- Cybersecurity (7)
- Interdisciplinary Arts and Media (7)
- Numerical Analysis and Scientific Computing (7)
- Software Engineering (7)
- Systems Architecture (7)
- Applied Statistics (5)
- Databases and Information Systems (5)
- Education (5)
- Keyword
-
- Mobile computing (58)
- Security (58)
- Wireless (46)
- Network (38)
- Privacy (38)
-
- Mhealth (35)
- Parallel computing (27)
- File system (26)
- Distributed computing (25)
- Ubicomp (25)
- Sensors (24)
- Parallel-io (21)
- Wearable (20)
- Machine Learning (18)
- Machine learning (17)
- Mobile-agent (16)
- MHealth (13)
- Deep learning (12)
- Healthcare (12)
- Natural Language Processing (10)
- AI (8)
- Artificial Intelligence (8)
- Intrusion detection (8)
- Mobile (8)
- Mobile health (8)
- Natural language processing (7)
- Algorithms (6)
- Amulet (6)
- Authentication (6)
- Interpretability (6)
- Publication Year
- Publication
-
- Computer Science Technical Reports (374)
- Dartmouth College Undergraduate Theses (225)
- Dartmouth Scholarship (222)
- Dartmouth College Ph.D Dissertations (109)
- Computer Science Senior Theses (83)
-
- Dartmouth College Master’s Theses (77)
- Other Faculty Materials (4)
- ENGS 88 Honors Thesis (AB Students) (2)
- Cognitive Science Senior Theses (1)
- Independent Student Projects and Publications (1)
- Linguistics Undergraduate Senior Theses (1)
- Physics and Astronomy Undergraduate Senior Theses (1)
- Quantitative Social Science Undergraduate Senior Theses (1)
- Wetterhahn Science Symposium Posters (1)
- Wetterhahn Science Symposium Posters 2018 (1)
- Publication Type
- File Type
Articles 451 - 480 of 1103
Full-Text Articles in Computer Sciences
Short Paper: The Netsani Framework For Analysis And Fine-Tuning Of Network Trace Sanitization, Phil Fazio, Keren Tan, Jihwang Yeo, David Kotz
Short Paper: The Netsani Framework For Analysis And Fine-Tuning Of Network Trace Sanitization, Phil Fazio, Keren Tan, Jihwang Yeo, David Kotz
Dartmouth Scholarship
Anonymization is critical prior to sharing wireless-network traces within the research community, to protect both personal and organizational sensitive information from disclosure. One difficulty in anonymization, or more generally, sanitization, is that users lack information about the quality of a sanitization result, such as how much privacy risk a sanitized trace may expose, and how much research utility the sanitized trace may retain. We propose a framework, NetSANI, that allows users to analyze and control the privacy/utility tradeoff in network sanitization. NetSANI can accommodate most of the currently available privacy and utility metrics for network trace sanitization. This framework provides …
A Solution To K-Exclusion With O(Logk) Rmr Complexity, Jonathan H. Choi
A Solution To K-Exclusion With O(Logk) Rmr Complexity, Jonathan H. Choi
Dartmouth College Undergraduate Theses
We specify and prove an algorithm solving k-Exclusion, a generalization of the Mutual Exclusion problem. k-Exclusion requires that at most k processes be in the Critical Section (CS) at once; in addition, we require bounded exit, starvation freedom and fairness properties. The goal within this framework is to minimize the number of Remote Memory References (RMRs) made. Previous algorithms have required Omega(k) RMRs in the worst case. Our algorithm requires O(log k) RMRs in the worst case under the Cache-Coherent (CC) model, a considerable improvement in time complexity.
Obstruction-Free Snapshot, Obstruction-Free Consensus, And Fetch-And-Add Modulo K, Jack R. Bowman
Obstruction-Free Snapshot, Obstruction-Free Consensus, And Fetch-And-Add Modulo K, Jack R. Bowman
Dartmouth College Undergraduate Theses
In this thesis we design algorithms for three problems: snapshot, consensus, and fetch-and-add modulo k. Our solutions for snapshot and consensus are non-anonymous and obstruction-free, and our solution for Fetch-and-add Modulo k is wait-free. We also conjecture an anonymous, obstruction-free solution to consensus.
A Multilevel, Posture-Based Model For Motor Control In Simulation And Robotic Applications, Divya A. Gunasekaran
A Multilevel, Posture-Based Model For Motor Control In Simulation And Robotic Applications, Divya A. Gunasekaran
Dartmouth College Undergraduate Theses
This paper presents a multilevel, posture-based motor control model intended to plan collision-free movements in a 3D environment while maintaining computationally efficiency and accurately imitating human and primate motor function. Our model is a comprehensive approach that addresses the storage and lookup of postures and movements, path planning and the generation of new movements, and learning with experience. We demonstrate the functionality and computational advantages of the model through preliminary testing on a humanoid robot.
Reader-Writer Exclusion Supporting Upgrade And Downgrade With Reader-Priority, Michael I. Diamond
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
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
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 …
Constant-Rmr Abortable Reader-Priority Reader-Writer Algorithm, Nan Zheng
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 …
Reader-Writer Exclusion Supporting Upgrade And Downgrade With Starvation Freedom, Matthew Elkherj
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
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 …
Recognizing Whether Sensors Are On The Same Body, Cory Cornelius, David Kotz
Recognizing Whether Sensors Are On The Same Body, Cory Cornelius, David Kotz
Dartmouth Scholarship
As personal health sensors become ubiquitous, we also expect them to become interoperable. That is, instead of closed, end-to-end personal health sensing systems, we envision standardized sensors wirelessly communicating their data to a device many people already carry today, the cellphone. In an open personal health sensing system, users will be able to seamlessly pair off-the-shelf sensors with their cellphone and expect the system to ıt just work. However, this ubiquity of sensors creates the potential for users to accidentally wear sensors that are not necessarily paired with their own cellphone. A husband, for example, might mistakenly wear a heart-rate …
Minimum Time Kinematic Trajectories For Self-Propelled Rigid Bodies In The Unobstructed Plane, Andrei A. Furtuna
Minimum Time Kinematic Trajectories For Self-Propelled Rigid Bodies In The Unobstructed Plane, Andrei A. Furtuna
Dartmouth College Ph.D Dissertations
The problem of moving rigid bodies efficiently is of particular interest in robotics because the simplest model of a mobile robot or of a manipulated object is often a rigid body. Path planning, controller design and robot design may all benefit from precise knowledge of optimal trajectories for a set of permitted controls. In this work, we present a general solution to the problem of finding minimum time trajectories for an arbitrary self-propelled, velocity-bounded rigid body in the obstacle-free plane. Such minimum-time trajectories depend on the vehicle’s capabilities and on and the start and goal configurations. For example, the fastest …
Assisting Human Motion-Tasks With Minimal, Real-Time Feedback, Paritosh A. Kavathekar
Assisting Human Motion-Tasks With Minimal, Real-Time Feedback, Paritosh A. Kavathekar
Dartmouth College Ph.D Dissertations
Teaching physical motions such as riding, exercising, swimming, etc. to human beings is hard. Coaches face difficulties in communicating their feedback verbally and cannot correct the student mid-action; teaching videos are two dimensional and suffer from perspective distortion. Systems that track a user and provide him real-time feedback have many potential applications: as an aid to the visually challenged, improving rehabilitation, improving exercise routines such as weight training or yoga, teaching new motion tasks, synchronizing motions of multiple actors, etc. It is not easy to deliver real-time feedback in a way that is easy to interpret, yet unobtrusive enough to …
802.15.4/Zigbee Analysis And Security: Tools For Practical Exploration Of The Attack Surface, Ricky A. Melgares
802.15.4/Zigbee Analysis And Security: Tools For Practical Exploration Of The Attack Surface, Ricky A. Melgares
Dartmouth College Undergraduate Theses
This thesis explores methods and techniques for surveying 802.15.4 and ZigBee wireless networks. The tools developed will aid in reconnaissance attacks against target networks; information gathered during this process will be used to profile a target network and its devices, as well as to pinpoint the geolocation of devices for executing physical attacks against the onboard hardware. Attacks against the PHY and MAC layers of the 802.15.4 standard will be explored as well.
Static Analysis For Ruby In The Presence Of Gradual Typing, Michael Edgar
Static Analysis For Ruby In The Presence Of Gradual Typing, Michael Edgar
Dartmouth College Undergraduate Theses
Dynamic languages provide new challenges to traditional static analysis techniques, leaving most errors to be detected at runtime and making many properties of code difficult to infer. Ruby code usually takes advantage of both dynamic typing and metaprogramming to produce elegant yet difficult-to-analyze programs. Function evalpq and its variants, which usually foil static analysis, are used frequently as a primitive runtime macro system. The goal of this thesis is to answer the question: What useful information about real-world Ruby programs can be determined statically with a high degree of accuracy? Two observations lead to a number of statically-discoverable errors and …
A New Artificial Intelligence For Auralux, Edward Mcneill
A New Artificial Intelligence For Auralux, Edward Mcneill
Computer Science Technical Reports
This project focused on developing a more challenging artificial intelligence for the real-time strategy game Auralux. I designed and implemented an AI framework named FlexibleAI that could be configured with various parameters controlling different aspects of the overall algorithm. In this way, the AI could be tuned to be more successful. I then created a testing framework called AuraSim that simplified Auralux into an easily-simulated turn-based format. After testing various configurations and tuning the FlexibleAI's parameters to be more successful, the AI eventually achieved a victory rate several times better than its average opponent. This provides the basis for a …
Screen Capture For Sensitive Systems, Joseph A. Cooley
Screen Capture For Sensitive Systems, Joseph A. Cooley
Dartmouth College Master’s Theses
Maintaining usable security in application domains such as healthcare or power systems requires an ongoing conversation among stakeholders such as end-users, administrators, developers, and policy makers. Each party has power to influence the design and implementation of the application and its security posture, and effective communication among stakeholders is one key to achieving influence and adapting an application to meet evolving needs. In this thesis, we develop a system that combines keyboard/video/mouse (KVM) capture with automatic text redaction to produce precise technical content that can enrich stakeholder communications, improve end-user influence on system evolution, and help reveal the definition of …
Exploiting The Hard-Working Dwarf: Trojans With No Native Executable Code, James Oakley, Sergey Bratus
Exploiting The Hard-Working Dwarf: Trojans With No Native Executable Code, James Oakley, Sergey Bratus
Computer Science Technical Reports
All binaries compiled by recent versions of GCC from C++ programs include complex data and dedicated code for exception handling support. The data structures describe the call stack frame layout in the DWARF format bytecode. The dedicated code includes an interpreter of this bytecode and logic to implement the call stack unwinding. Despite being present in a large class of programs -- and therefore potentially providing a huge attack surface -- this mechanism is not widely known or studied. Of particular interest to us is that the exception handling mechanism provides the means for fundamentally altering the flow of a …
Privacy Analysis Of User Association Logs In A Large-Scale Wireless Lan, Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
Privacy Analysis Of User Association Logs In A Large-Scale Wireless Lan, Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
Dartmouth Scholarship
User association logs collected from a large-scale wireless LAN record where and when a user has used the network. Such information plays an important role in wireless network research. One concern of sharing these data with other researchers, however, is that the logs pose potential privacy risks for the network users. Today, the common practice in sanitizing these data before releasing them to the public is to anonymize users' sensitive information, such as their devices' MAC addresses and their exact association locations. In this work, we aim to study whether such sanitization measures are sufficient to protect user privacy. By …
Catch, Clean, And Release: A Survey Of Obstacles And Opportunities For Network Trace Sanitization, Keren Tan, Jihwang Yeo, Michael E. Locasto, David Kotz
Catch, Clean, And Release: A Survey Of Obstacles And Opportunities For Network Trace Sanitization, Keren Tan, Jihwang Yeo, Michael E. Locasto, David Kotz
Dartmouth Scholarship
Network researchers benefit tremendously from access to traces of production networks, and several repositories of such network traces exist. By their very nature, these traces capture sensitive business and personal activity. Furthermore, network traces contain significant operational information about the target network, such as its structure, identity of the network provider, or addresses of important servers. To protect private or proprietary information, researchers must “sanitize” a trace before sharing it. \par In this chapter, we survey the growing body of research that addresses the risks, methods, and evaluation of network trace sanitization. Research on the risks of network trace sanitization …
Appearance-Design Interfaces And Tools For Computer Cinematography: Evaluation And Application, William B. Kerr
Appearance-Design Interfaces And Tools For Computer Cinematography: Evaluation And Application, William B. Kerr
Dartmouth College Ph.D Dissertations
We define appearance design as the creation and editing of scene content such as lighting and surface materials in computer graphics. The appearance design process takes a significant amount of time relative to other production tasks and poses difficult artistic challenges. Many user interfaces have been proposed to make appearance design faster, easier, and more expressive, but no formal validation of these interfaces had been published prior to our body of work. With a focus on novice users, we present a series of investigations into the strengths and weaknesses of various appearance design user interfaces. In particular, we develop an …
Identifying Unusual Days, Minkyong Kim, David Kotz
Identifying Unusual Days, Minkyong Kim, David Kotz
Dartmouth Scholarship
Pervasive applications such as digital memories or patient monitors collect a vast amount of data. One key challenge in these systems is how to extract interesting or unusual information. Because users cannot anticipate their future interests in the data when the data is stored, it is hard to provide appropriate indexes. As location-tracking technologies, such as global positioning system, have become ubiquitous, digital cameras or other pervasive systems record location information along with the data. In this paper, we present an automatic approach to identify unusual data using location information. Given the location information, our system identifies unusual days, that …
Social Network Analysis Plugin (Snap) For Mesh Networks, Soumendra Nanda, David Kotz
Social Network Analysis Plugin (Snap) For Mesh Networks, Soumendra Nanda, David Kotz
Dartmouth Scholarship
In a network, bridging nodes are those nodes that from a topological perspective, are strategically located between highly connected regions of nodes. Thus, they have high values of the Bridging Centrality (BC) metric. We recently introduced the Localized Bridging Centrality (LBC) metric, which can identify such nodes via distributed computation, yet has an accuracy equal to that of the centralized BC metric. The LBC and BC metrics are based on the Social Network Analysis (SNA) metric "betweenness centrality". We now introduce a new SNA metric that is more suitable for use in wireless mesh networks: the Localized Load-aware Bridging Centrality …
Anonysense: A System For Anonymous Opportunistic Sensing, Minho Shin, Cory Cornelius, Dan Peebles, Apu Kapadia, David Kotz, Nikos Triandopoulos
Anonysense: A System For Anonymous Opportunistic Sensing, Minho Shin, Cory Cornelius, Dan Peebles, Apu Kapadia, David Kotz, Nikos Triandopoulos
Dartmouth Scholarship
We describe AnonySense, a privacy-aware system for realizing pervasive applications based on collaborative, opportunistic sensing by personal mobile devices. AnonySense allows applications to submit sensing \emphtasks\/ to be distributed across participating mobile devices, later receiving verified, yet anonymized, sensor data \emphreports\/ back from the field, thus providing the first secure implementation of this participatory sensing model. We describe our security goals, threat model, and the architecture and protocols of AnonySense. We also describe how AnonySense can support extended security features that can be useful for different applications. We evaluate the security and feasibility of AnonySense through security analysis and prototype …
Privacy Analysis Of User Association Logs In A Large-Scale Wireless Lan, Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
Privacy Analysis Of User Association Logs In A Large-Scale Wireless Lan, Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
Computer Science Technical Reports
User association logs collected from a large-scale wireless LAN record where and when a user has used the network. Such information plays an important role in wireless network research. One concern of sharing these data with other researchers, however, is that the logs pose potential privacy risks for the network users. Today, the common practice in sanitizing these data before releasing them to the public is to anonymize users' sensitive information, such as their devices' MAC addresses and their exact association locations. In this work, we demonstrate that such sanitization measures are insufficient to protect user privacy because the differences …
A Threat Taxonomy For Mhealth Privacy, David Kotz
A Threat Taxonomy For Mhealth Privacy, David Kotz
Dartmouth Scholarship
Networked mobile devices have great potential to enable individuals (and their physicians) to better monitor their health and to manage medical conditions. In this paper, we examine the privacy-related threats to these so-called \emphmHealth\/ technologies. We develop a taxonomy of the privacy-related threats, and discuss some of the technologies that could support privacy-sensitive mHealth systems. We conclude with a brief summary of research challenges.
Some Communication Complexity Results And Their Applications, Joshua E. Brody
Some Communication Complexity Results And Their Applications, Joshua E. Brody
Dartmouth College Ph.D Dissertations
Communication Complexity represents one of the premier techniques for proving lower bounds in theoretical computer science. Lower bounds on communication problems can be leveraged to prove lower bounds in several different areas. In this work, we study three different communication complexity problems. The lower bounds for these problems have applications in circuit complexity, wireless sensor networks, and streaming algorithms. First, we study the multiparty pointer jumping problem. We present the first nontrivial upper bound for this problem. We also provide a suite of strong lower bounds under several restricted classes of protocols. Next, we initiate the study of several non-monotone …
Detecting Photographic Composites Of Famous People, Eric Kee, Hany Farid
Detecting Photographic Composites Of Famous People, Eric Kee, Hany Farid
Computer Science Technical Reports
Photos are commonly falsified by compositing two or more people into a single image. We describe how such composites can be detected by estimating a camera's intrinsic parameters. Differences in these parameters across the image are then used as evidence of tampering. Expanding on earlier work, this approach is more applicable to low-resolution images, but requires a reference image of each person in the photo as they are directly facing the camera. When considering composites of famous people, such a reference photo is easily obtained from an on-line image search.
A Correlation Attack Against User Mobility Privacy In A Large-Scale Wlan Network, Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
A Correlation Attack Against User Mobility Privacy In A Large-Scale Wlan Network, Keren Tan, Guanhua Yan, Jihwang Yeo, David Kotz
Dartmouth Scholarship
User association logs collected from real-world wireless LANs have facilitated wireless network research greatly. To protect user privacy, the common practice in sanitizing these data before releasing them to the public is to anonymize users' sensitive information such as the MAC addresses of their devices and their exact association locations. In this work,we demonstrate that these sanitization measures are insufficient in protecting user privacy from a novel type of correlation attack that is based on CRF (Conditional Random Field). In such a correlation attack, the adversary observes the victim's AP (Access Point) association activities for a short period of time …
Out Of The Depths: Image Statistics Of Space, Water, And The Minuscule World, Nimit S. Dhulekar
Out Of The Depths: Image Statistics Of Space, Water, And The Minuscule World, Nimit S. Dhulekar
Dartmouth College Master’s Theses
In images of natural scenes, a consistent relationship exists between spectral power and spatial frequency. The power spectrum falls off with a form 1/f^p as spatial frequency f increases, with values of p approximately equal to 2. To quantify the extent to which this statistical characteristic is exhibited by other classes of images, we examined astronomical, underwater, and microscale images. It was found that this property holds for all three categories of images, although the value of p varies in the range 1.76 to 2.37. The second statistical characteristic computed was the angular spread of the power spectrum. This metric …