Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Adjustable range (1)
- Agent-based simulation (1)
- Area coverage (1)
- Baseball (1)
- Baserunning (1)
-
- Bayesian modeling (1)
- Biological validation (1)
- Collaboration (1)
- Computer aided design (1)
- Computer graphics (1)
- Crowdsourcing (1)
- DNA (1)
- Data visualization (1)
- Design (1)
- Development (1)
- Flexibility (1)
- Framework (1)
- Geometric constraint system (1)
- Graphics and multimedia (1)
- Human complexity (1)
- Human computation (1)
- Independent (1)
- Lifetime (1)
- Mutations (1)
- Pebble game (1)
- Political science (1)
- Protein modeling (1)
- Protein rigidity (1)
- Proteins (1)
- RNA (1)
Articles 1 - 20 of 20
Full-Text Articles in Physical Sciences and Mathematics
An Affordance-Based Framework For Human Computation And Human-Computer Collaboration, R. Jordan Crouser, Remco Chang
An Affordance-Based Framework For Human Computation And Human-Computer Collaboration, R. Jordan Crouser, Remco Chang
Computer Science: Faculty Publications
Visual Analytics is “the science of analytical reasoning facilitated by visual interactive interfaces” [70]. The goal of this field is to develop tools and methodologies for approaching problems whose size and complexity render them intractable without the close coupling of both human and machine analysis. Researchers have explored this coupling in many venues: VAST, Vis, InfoVis, CHI, KDD, IUI, and more. While there have been myriad promising examples of human-computer collaboration, there exists no common language for comparing systems or describing the benefits afforded by designing for such collaboration. We argue that this area would benefit significantly from consensus about …
Using Variable-Rate Alerting To Counter Boredom In Human Supervisory Control, Armen A. Mkrtchyan, Jamie C. Macbeth, Erin T. Solovey, Jason C. Ryan, M. L. Cummings
Using Variable-Rate Alerting To Counter Boredom In Human Supervisory Control, Armen A. Mkrtchyan, Jamie C. Macbeth, Erin T. Solovey, Jason C. Ryan, M. L. Cummings
Computer Science: Faculty Publications
A low task load, long duration experiment was conducted to evaluate the impact of cyclical attention switching strategies on operator performance in supervisory domains. The impetus for such a study stems from the lack of prior work to improve human-system performance in low task load supervisory domains through the use of design interventions. In this study, a design intervention in the form of auditory alerts is introduced and the effects of the alerts are examined. The test bed consists of a video game-like simulation environment, which allows a single opera-tor the ability to supervise multiple unmanned vehicles. Each participant in …
Interface Design For Unmanned Vehicle Supervision Through Hybrid Cognitive Task Analysis, Jamie C. Macbeth, M. L. Cummings, Luca F. Bertuccelli, Amit Surana
Interface Design For Unmanned Vehicle Supervision Through Hybrid Cognitive Task Analysis, Jamie C. Macbeth, M. L. Cummings, Luca F. Bertuccelli, Amit Surana
Computer Science: Faculty Publications
While there is currently significant interest in developing Unmanned Aerial Systems (UASs) that can be supervised by a single operator, the majority of these systems focus on Intelligence, Surveillance, and Reconnaissance (ISR) domains. One domain that has received significantly less attention is the use of multiple UASs to insert or extract supplies or people. To this end, MAVIES (Multi-Autonomous Vehicle Insertion-Extraction System) was developed to allow a single operator the ability to supervise a primary cargo Unmanned Aerial Vehicle (UAV) along with multiple scouting UAVs. This paper will detail the development of the design requirements generated through a Hybrid Cognitive …
String-Wrapped Rotating Disks, Joseph O'Rourke
String-Wrapped Rotating Disks, Joseph O'Rourke
Computer Science: Faculty Publications
Let the centers of a finite number of disjoint, closed disks be pinned to the plane, but with each free to rotate about its center. Given an arrangement of such disks with each labeled + or -, we investigate the question of whether they can be all wrapped by a single loop of string so that, when the string is taut and circulates, it rotates by friction all the ⊕-disks counterclockwise and all the ⊖-disks clockwise, without any string-rubbing conflicts. We show that although this is not always possible, natural disk-separation conditions guarantee a solution. We also characterize the hexagonal …
Towards Biophysical Validation Of Constraint Modeling For Rigidity Analysis Of Proteins, Filip Jagodzinski, Ileana Streinu
Towards Biophysical Validation Of Constraint Modeling For Rigidity Analysis Of Proteins, Filip Jagodzinski, Ileana Streinu
Computer Science: Faculty Publications
Proteins are dynamic molecules, and understanding how they flex and bend provides fundamental insights to their functions. Methods such as molecular dynamics are computationally expensive, and can simulate protein motions on limited timescales. Rigidity analysis is an alternative method, in which a protein structure is analyzed to infer which portions of the molecule are flexible. To perform rigidity analysis, a model is first constructed in which various inter-atomic stabilizing interactions are modeled according to their strength. No detailed study has been conducted as to what is the most plausible, chemically validated modeling scheme. All previous implementations have relied on heuristics, …
Towards Sequence-Based Dna Flexibility Analysis, Emily Flynn, Filip Jagodzinski, Ileana Streinu
Towards Sequence-Based Dna Flexibility Analysis, Emily Flynn, Filip Jagodzinski, Ileana Streinu
Computer Science: Faculty Publications
In this poster, we present an extension to our freely available KINARI-Web server to identify rigid and flexible regions of nucleic acids and protein-nucleic acid complexes contained in the Protein Data Bank (PDB). The goal is to explore the effect of DNA and RNA on the rigidity and stability of these structures. We also propose an approach for determining DNA rigidity based solely on sequence. Currently, only the rigidity of DNA molecules whose structures have been deposited in the PDB (approx. <4,000 files) can be analyzed. Once fine-tuned and validated, this new coordinate-free method for investigating DNA flexibility could be applied to the more than 135 million sequences in GenBank, and to nanostructure design.
Understanding Visualization By Understanding Individual Users, Caroline Ziemkiewicz, Alvitta Ottley, R. Jordan Crouser, Krysta Chauncey, Sara L. Su, Remco Chang
Understanding Visualization By Understanding Individual Users, Caroline Ziemkiewicz, Alvitta Ottley, R. Jordan Crouser, Krysta Chauncey, Sara L. Su, Remco Chang
Computer Science: Faculty Publications
No abstract provided.
Priming Locus Of Control To Affect Performance, Alvitta Ottley, R. Jordan Crouser, Caroline Ziemkiewicz, Remco Chang
Priming Locus Of Control To Affect Performance, Alvitta Ottley, R. Jordan Crouser, Caroline Ziemkiewicz, Remco Chang
Computer Science: Faculty Publications
Recent research suggests that the personality trait Locus of Control (LOC) can be a reliable predictor of performance when learn- ing a new visualization tool. While these results are compelling and have direct implications to visualization design, the relation- ship between a user’s LOC measure and their performance is not well understood. We hypothesize that there is a dependent relation- ship between LOC and performance; specifically, a person’s orientation on the LOC scale directly influences their performance when learning new visualizations. To test this hypothesis, we conduct an experiment with 300 subjects using Amazon’s Mechanical Turk. We adapt techniques from …
Body-And-Cad Geometric Constraint Systems, Kirk Haller, Audrey Lee-St.John, Meera Sitharam, Ileana Streinu, Neil White
Body-And-Cad Geometric Constraint Systems, Kirk Haller, Audrey Lee-St.John, Meera Sitharam, Ileana Streinu, Neil White
Computer Science: Faculty Publications
Motivated by constraint-based CAD software, we develop the foundation for the rigidity theory of a very general model: the body-and-cad structure, composed of rigid bodies in 3D constrained by pairwise coincidence, angular and distance constraints. We identify 21 relevant geometric constraints and develop the corresponding infinitesimal rigidity theory for these structures. The classical body-and-bar rigidity model can be viewed as a body-and-cad structure that uses only one constraint from this new class. As a consequence, we identify a new, necessary, but not sufficient, counting condition for minimal rigidity of body-and-cad structures: nested sparsity. This is a slight generalization of the …
Massively Distributed Authorship Of Academic Papers, Bill Tomlinson, Joel Ross, Paul Andre, Eric P.S. Baumer, Donald J. Patterson, Joseph Corneli, Martin Mahaux, Syavash Nobarany, Marco Lazzari, Birgit Penzenstadler, Andrew W. Torrance, David J. Callele, Gary M. Olson, Six Silberman, Marcus Ständer, Fabio Romancini Palamedi, Albert Ali Salah, Eric Morrill, Xavier Franch, Florian Mueller, Joseph Kaye, Rebecca W. Black, Marisa L. Cohn, Patrick C. Shih, Johanna Brewer, Nitesh Goyal, Pirjo Näkki, Jeff Huang, Nilufar Baghaei, Craig Saper
Massively Distributed Authorship Of Academic Papers, Bill Tomlinson, Joel Ross, Paul Andre, Eric P.S. Baumer, Donald J. Patterson, Joseph Corneli, Martin Mahaux, Syavash Nobarany, Marco Lazzari, Birgit Penzenstadler, Andrew W. Torrance, David J. Callele, Gary M. Olson, Six Silberman, Marcus Ständer, Fabio Romancini Palamedi, Albert Ali Salah, Eric Morrill, Xavier Franch, Florian Mueller, Joseph Kaye, Rebecca W. Black, Marisa L. Cohn, Patrick C. Shih, Johanna Brewer, Nitesh Goyal, Pirjo Näkki, Jeff Huang, Nilufar Baghaei, Craig Saper
Computer Science: Faculty Publications
Wiki-like or crowdsourcing models of collaboration can provide a number of benefits to academic work. These techniques may engage expertise from different disciplines, and potentially increase productivity. This paper presents a model of massively distributed collaborative authorship of academic papers. This model, developed by a collective of thirty authors, identifies key tools and techniques that would be necessary or useful to the writing process. The process of collaboratively writing this paper was used to discover, negotiate, and document issues in massively authored scholarship. Our work provides the first extensive discussion of the experiential aspects of large-scale collaborative research.
Indy R&D: Doing Hci Research Off The Beaten Path, Amanda Williams, Johanna Brewer
Indy R&D: Doing Hci Research Off The Beaten Path, Amanda Williams, Johanna Brewer
Computer Science: Faculty Publications
This panel discusses independent research and development in HCI. We focus on possible models for Indy R&D operations, supporting infrastructures, practical methods, and taking advantage of academic skills in the transition. Panel participants have experience in several different models of funding, conducting, and disseminating results from independent research. We will provide the audience with practical tips to help them decide if Indy R&D is right for them, and if so, help them do it. © 2012 Authors.
Using Rigidity Analysis To Probe Mutation-Induced Structural Changes In Proteins, Filip Jagodzinski, Jeanne Hardy, Ileana Streinu
Using Rigidity Analysis To Probe Mutation-Induced Structural Changes In Proteins, Filip Jagodzinski, Jeanne Hardy, Ileana Streinu
Computer Science: Faculty Publications
Predicting the effect of a single amino acid substitution on the stability of a protein structure is a fundamental task in macromolecular modeling. It has relevance to drug design and understanding of disease-causing protein variants. We present KINARI-Mutagen, a web server for performing in silico mutation experiments on protein structures from the Protein Data Bank. Our rigidity-theoretical approach permits fast evaluation of the effects of mutations that may not be easy to perform in vitro, because it is not always possible to express a protein with a specific amino acid substitution. We use KINARI-Mutagen to identify critical residues, and we …
Mixed-Initiative Strategies For Real-Time Scheduling Of Multiple Unmanned Vehicles, Andrew S. Clare, Jamie Macbeth, Mary L. Cummings
Mixed-Initiative Strategies For Real-Time Scheduling Of Multiple Unmanned Vehicles, Andrew S. Clare, Jamie Macbeth, Mary L. Cummings
Computer Science: Faculty Publications
Advances in autonomy have made it possible to invert the typical operator-to-unmanned vehicle ratio so that a single operator can now control multiple heterogeneous Unmanned Vehicles (UVs). Real-time scheduling and task assignment for multiple UVs in uncertain environments will require the computational ability of optimization algorithms combined with the judgment and adaptability of human supervisors through mixed-initiative systems. The goal of this paper is to analyze the interactions between operators and scheduling algorithms in two human- in-the-loop multiple UV control experiments. The impact of real-time operator modifications to the objective function of an optimization algorithm for multi-UV scheduling is described. …
Unfolding Prismatoids As Convex Patches: Counterexamples And Positive Results, Joseph O'Rourke
Unfolding Prismatoids As Convex Patches: Counterexamples And Positive Results, Joseph O'Rourke
Computer Science: Faculty Publications
We address the unsolved problem of unfolding prismatoids in a new context, viewing a “topless prismatoid” as a convex patch—a polyhedral subset of the surface of a convex polyhedron homeomorphic to a disk. We show that several natural strategies for unfolding a prismatoid can fail, but obtain a positive result for “petal unfolding” topless prismatoids. We also show that the natural extension to a convex patch consisting of a face of a polyhedron and all its incident faces, does not always have a nonoverlapping petal unfolding. However, we obtain a positive result by excluding the problematical patches. This then leads …
Source Unfoldings Of Convex Polyhedra Via Certain Closed Curves, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu
Source Unfoldings Of Convex Polyhedra Via Certain Closed Curves, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu
Computer Science: Faculty Publications
Abstract. We extend the notion of a source unfolding of a convex polyhedron P to be based on a closed polygonal curve Q in a particular class rather than based on a point. The class requires that Q “lives on a cone” to both sides; it includes simple, closed quasigeodesics. Cutting a particular subset of the cut locus of Q (in P) leads to a non-overlapping unfolding of the polyhedron. This gives a new general method to unfold the surface of any convex polyhedron to a simple, planar polygon
Outerplanar Graphs And Delaunay Triangulations, Ashraful Alam, Igor Rivin, Ileana Streinu
Outerplanar Graphs And Delaunay Triangulations, Ashraful Alam, Igor Rivin, Ileana Streinu
Computer Science: Faculty Publications
Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs. © 2012 Springer-Verlag.
Maximizing Network Lifetime On The Line With Adjustable Sensing Ranges, Amotz Bar-Noy, Ben Baumer
Maximizing Network Lifetime On The Line With Adjustable Sensing Ranges, Amotz Bar-Noy, Ben Baumer
Statistical and Data Sciences: Faculty Publications
Given n sensors on a line, each of which is equipped with a unit battery charge and an adjustable sensing radius, what schedule will maximize the lifetime of a network that covers the entire line? Trivially, any reasonable algorithm is at least a 1/2-approximation, but we prove tighter bounds for several natural algorithms. We focus on developing a linear time algorithm that maximizes the expected lifetime under a random uniform model of sensor distribution. We demonstrate one such algorithm that achieves an average-case approximation ratio of almost 0.9. Most of the algorithms that we consider come from a family based …
Two Visualization Tools For Analyzing Agent-Based Simulations In Political Science, R. Jordan Crouser, Daniel Kee, Dong Jeong, Remco Chang
Two Visualization Tools For Analyzing Agent-Based Simulations In Political Science, R. Jordan Crouser, Daniel Kee, Dong Jeong, Remco Chang
Computer Science: Faculty Publications
Agent-based modeling has become a key technique for modeling and simulating dynamic, complicated behaviors in the social and political sciences. Although many robust toolkits for developing and running these simulations exist, systems that support analysis of their results are few and tend to be overly general. So, social scientists have had difficulty interpreting the results of their increasingly complex simulations. To help bridge this gap between data generation and interpretation, researchers collaborated with political science analysts to design two tools for interactive data exploration and domain-specific data analysis. Testing by the analysts validated that these tools provided an efficient framework …
Parsing The Relationship Between Baserunning And Batting Abilities Within Lineups, Ben S. Baumer, James Piette, Brad Null
Parsing The Relationship Between Baserunning And Batting Abilities Within Lineups, Ben S. Baumer, James Piette, Brad Null
Statistical and Data Sciences: Faculty Publications
A baseball team's offensive prowess is a function of two types of abilities: batting and baserunning. While each has been studied extensively in isolation, the effects of their interaction is not well understood. We model offensive output as a scalar function f of an individual player's batting and baserunning profile z. Each of these profiles is in turn estimated from Retrosheet data using heirarchical Bayesian models. We then use the SimulOutCome simulation engine as a method to generate values of f(z) over a fine grid of points. Finally, for each of several methods of taking the extra base, we graphically …
Π/2-Angle Yao Graphs Are Spanners, Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, Stefanie Wuhrer
Π/2-Angle Yao Graphs Are Spanners, Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, Stefanie Wuhrer
Computer Science: Faculty Publications
We show that the Yao graph Y4 in the L2 metric is a spanner with stretch factor 8(29+23√ 2). Enroute to this, we also show that the Yao graph Y∞4 in the L∞ metric is a planar spanner with stretch factor 8.