Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Keyword
-
- COVID-19 (7)
- Computational geometry (6)
- Periodic framework (6)
- Protein rigidity (6)
- Unfolding (6)
-
- Flexibility (5)
- Folding (5)
- Review (5)
- Dilution (4)
- Historical manuscripts (4)
- Image Schemas (4)
- Rigid clusters (4)
- Sexuality (4)
- Simulated unfolding (4)
- Theory (4)
- Vulpes vulpes (4)
- Algorithms (3)
- Auxetic deformation (3)
- Circuit polynomial (3)
- Combinatorial resultant (3)
- Conceptual Dependency (3)
- Conceptual dependency (3)
- Education (3)
- Evaluation (3)
- Gender (3)
- Genus-zero (3)
- Gröbner basis elimination (3)
- High performance computing (3)
- Inductive construction (3)
- Knots (3)
- Publication Year
Articles 91 - 120 of 364
Full-Text Articles in Computer Sciences
How To Catch When Proxies Lie: Verifying The Physical Locations Of Network Proxies With Active Geolocation, Zachary Weinberg, Shinyoung Cho, Nicolas Christin, Vyas Sekar, Phillipa Gill
How To Catch When Proxies Lie: Verifying The Physical Locations Of Network Proxies With Active Geolocation, Zachary Weinberg, Shinyoung Cho, Nicolas Christin, Vyas Sekar, Phillipa Gill
Computer Science: Faculty Publications
Internet users worldwide rely on commercial network proxies both to conceal their true location and identity, and to control their apparent location. Their reasons range from mundane to security-critical. Proxy operators offer no proof that their advertised server locations are accurate. IP-to-location databases tend to agree with the advertised locations, but there have been many reports of serious errors in such databases. In this study we estimate the locations of 2269 proxy servers from ping-time measurements to hosts in known locations, combined with AS and network information. These servers are operated by seven proxy services, and, according to the operators, …
Bloomingleaf: A Formal Tool For Requirements Evolution Over Time, Alicia M. Grubb, Marsha Chechik
Bloomingleaf: A Formal Tool For Requirements Evolution Over Time, Alicia M. Grubb, Marsha Chechik
Computer Science: Faculty Publications
Our previous work presented the Evolving Intentions framework, which specified how evolving qualitative goal models can be modeled and analyzed. Recent improvements to the framework allow for precise semantics of goal relationships with propagation of both evidence for and evidence against a goal's satisfaction (as in Tropos), and enables evaluation of evolution with absolute time (in addition to relative time). The reasoning is expressed as a constraint satisfaction problem. In this paper, we present BloomingLeaf, a new web-based tool that implements the new semantics. We showcase how the implementation and architecture of BloomingLeaf can be used to answer time-based questions.
Reflection On Evolutionary Decision Making With Goal Modeling Via Empirical Studies, Alicia M. Grubb
Reflection On Evolutionary Decision Making With Goal Modeling Via Empirical Studies, Alicia M. Grubb
Computer Science: Faculty Publications
Goal models have long been used in academia without wide spread adoption in industry. If the fundamental purpose of goal models is to allow stakeholders to generate scenarios and ask 'what if' questions, then which parts of the process of model construction, analysis, and evolution benefit from and which are hindered by manual activities? The recent expansion of goal modelling to ask time-based questions further amplifies this issue because significant additional information is required from stakeholders. Through a series of empirical studies, we aim to isolate the processes of model construction, analysis, and evolution for the purpose of studying the …
Monitoring Scene Understanders With Conceptual Primitive Decomposition And Commonsense Knowledge, Leilani H. Gilpin, Jamie C. Macbeth, Evelyn Florentine
Monitoring Scene Understanders With Conceptual Primitive Decomposition And Commonsense Knowledge, Leilani H. Gilpin, Jamie C. Macbeth, Evelyn Florentine
Computer Science: Faculty Publications
Although there have been many key advancements in connecting text and perception, computer- generated image captions still lack common sense. As a first step towards constraining these perception mechanisms to commonsense judgment, we have developed reasonableness monitors: a wrapper interface that can explain if the descriptive output of an opaque deep neural network is plausible. These monitor a standalone system that uses careful dependency tracking, commonsense knowledge, and conceptual primitives to explain a perceived scene description to be reasonable or not. If such an explanation cannot be made, it is evidence that something unreasonable has been perceived. The development of …
Red Fox Genome Assembly Identifies Genomic Regions Associated With Tame And Aggressive Behaviours, Anna V. Kukekova, Jennifer L. Johnson, Xueyan Xiang, Shaohong Feng, Shiping Liu, Halie M. Rando, Anastasiya V. Kharlamova, Yury Herbeck, Natalya A. Serdyukova, Zijun Xiong, Violetta Beklemischeva, Klaus Peter Koepfli, Rimma G. Gulevich, Anastasiya V. Vladimirova, Jessica P. Hekman, Polina L. Perelman, Aleksander S. Graphodatsky, Stephen J. O’Brien, Xu Wang, Andrew G. Clark, Gregory M. Acland, Lyudmila N. Trut, Guojie Zhang
Red Fox Genome Assembly Identifies Genomic Regions Associated With Tame And Aggressive Behaviours, Anna V. Kukekova, Jennifer L. Johnson, Xueyan Xiang, Shaohong Feng, Shiping Liu, Halie M. Rando, Anastasiya V. Kharlamova, Yury Herbeck, Natalya A. Serdyukova, Zijun Xiong, Violetta Beklemischeva, Klaus Peter Koepfli, Rimma G. Gulevich, Anastasiya V. Vladimirova, Jessica P. Hekman, Polina L. Perelman, Aleksander S. Graphodatsky, Stephen J. O’Brien, Xu Wang, Andrew G. Clark, Gregory M. Acland, Lyudmila N. Trut, Guojie Zhang
Computer Science: Faculty Publications
Strains of red fox (Vulpes vulpes) with markedly different behavioural phenotypes have been developed in the famous long-term selective breeding programme known as the Russian farm-fox experiment. Here we sequenced and assembled the red fox genome and re-sequenced a subset of foxes from the tame, aggressive and conventional farm-bred populations to identify genomic regions associated with the response to selection for behaviour. Analysis of the re-sequenced genomes identified 103 regions with either significantly decreased heterozygosity in one of the three populations or increased divergence between the populations. A strong positional candidate gene for tame behaviour was highlighted: SorCS1, which encodes …
Auxetics Abounding, Ciprian S. Borcea, Ileana Streinu
Auxetics Abounding, Ciprian S. Borcea, Ileana Streinu
Computer Science: Faculty Publications
Auxetic behavior refers to lateral widening upon stretching. Although a structural origin for this rather counterintuitive type of deformation was often suggested, a theoretical understanding of the role of geometry in auxetic behavior has been a challenge for a long time. However, for structures modeled as periodic bar-and-joint frameworks, including atom-and-bond frameworks in crystalline materials, there is a complete geometric solution which opens endless possibilities for new auxetic designs. We construct a large family of three-dimensional auxetic periodic mechanisms and discuss the ideas involved in their design.
Open Problems From Cccg 2017, Joseph O'Rourke
Open Problems From Cccg 2017, Joseph O'Rourke
Computer Science: Faculty Publications
The following is a description of the problems presented on July 26th, 2017 at the open-problem session of the 29th Canad. Conf. Computational Geometry held at Carleton University, in Ottawa.
Offline Signature Verification Via Structural Methods: Graph Edit Distance And Inkball Models, Paul Maergner, Nicholas Howe, Kaspar Riesen, Rolf Ingold, Andreas Fischer
Offline Signature Verification Via Structural Methods: Graph Edit Distance And Inkball Models, Paul Maergner, Nicholas Howe, Kaspar Riesen, Rolf Ingold, Andreas Fischer
Computer Science: Faculty Publications
For handwritten signature verification, signature images are typically represented with fixed-sized feature vectors capturing local and global properties of the handwriting. Graphbased representations offer a promising alternative, as they are flexible in size and model the global structure of the handwriting. However, they are only rarely used for signature verification, which may be due to the high computational complexity involved when matching two graphs. In this paper, we take a closer look at two recently presented structural methods for handwriting analysis, for which efficient matching methods are available: keypoint graphs with approximate graph edit distance and inkball models. Inkball models, …
Challenging The Estrangela / Serto Divide: Why The Standard Model Of Syriac Scripts Just Doesn't Work, Kristina Bush, Michael Philip Penn, R. Jordan Crouser, Nicholas Howe, Shuangxia Wu
Challenging The Estrangela / Serto Divide: Why The Standard Model Of Syriac Scripts Just Doesn't Work, Kristina Bush, Michael Philip Penn, R. Jordan Crouser, Nicholas Howe, Shuangxia Wu
Computer Science: Faculty Publications
As part of a larger digital paleography project, our team has assembled a database of tens of thousands of individual Syriac letters and letter data from 96% of extant early Syriac manuscripts that have a secure composition date. Long term, such data can help scholars develop more accurate ways to classify Syriac scripts. In the present article we use this data to illustrate just how frequently the most common way of categorizing Syriac scripts as either Estrangela or Serto does not accurately convey the ways early scribes actually wrote. In addition to challenging this “Standard Model” of Syriac scripts, the …
Construction Of Red Fox Chromosomal Fragments From The Short-Read Genome Assembly, Halie M. Rando, Marta Farré, Michael P. Robson, Naomi B. Won, Jennifer L. Johnson, Ronak Buch, Estelle R. Bastounes, Xueyan Xiang, Shaohong Feng, Shiping Liu, Zijun Xiong, Jaebum Kim, Guojie Zhang, Lyudmila N. Trut, Denis M. Larkin, Anna V. Kukekova
Construction Of Red Fox Chromosomal Fragments From The Short-Read Genome Assembly, Halie M. Rando, Marta Farré, Michael P. Robson, Naomi B. Won, Jennifer L. Johnson, Ronak Buch, Estelle R. Bastounes, Xueyan Xiang, Shaohong Feng, Shiping Liu, Zijun Xiong, Jaebum Kim, Guojie Zhang, Lyudmila N. Trut, Denis M. Larkin, Anna V. Kukekova
Computer Science: Faculty Publications
The genome of a red fox (Vulpes vulpes) was recently sequenced and assembled using next-generation sequencing (NGS). The assembly is of high quality, with 94X coverage and a scaffold N50 of 11.8 Mbp, but is split into 676,878 scaffolds, some of which are likely to contain assembly errors. Fragmentation and misassembly hinder accurate gene prediction and downstream analysis such as the identification of loci under selection. Therefore, assembly of the genome into chromosome-scale fragments was an important step towards developing this genomic model. Scaffolds from the assembly were aligned to the dog reference genome and compared to the alignment of …
Toward Unfolding Doubly Covered N-Stars, Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik Demaine, Martin L. Demaine, Robin Flatland, Irina Kostitsyna, Jason S. Ku, Stephan Langerman, Joseph O'Rourke, Ryuhei Uehara
Toward Unfolding Doubly Covered N-Stars, Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik Demaine, Martin L. Demaine, Robin Flatland, Irina Kostitsyna, Jason S. Ku, Stephan Langerman, Joseph O'Rourke, Ryuhei Uehara
Computer Science: Faculty Publications
No abstract provided.
Edge-Unfolding Nearly Flat Convex Caps, Joseph O'Rourke
Edge-Unfolding Nearly Flat Convex Caps, Joseph O'Rourke
Computer Science: Faculty Publications
The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in ℝ3 has an edge-unfolding to a non-overlapping polygon in the plane. A convex cap is the intersection of the surface of a convex polyhedron and a halfspace. "Nearly flat" means that every outer face normal forms a sufficiently small angle φ < Φ with the z-axis orthogonal to the halfspace bounding plane. The size of Φ depends on the acuteness gap α: if every triangle angle is at most π/2 - α, then Φ ≈ 0.36√α suffices; e.g., for α = 3°, Φ ≈ 5°. The proof employs the recent concepts of angle-monotone and radially monotone curves. The proof is constructive, leading to a polynomial-time algorithm for finding the edge-cuts, at worst O(n); a version has been implemented.
Periodic Auxetics: Structure And Design, Ciprian S. Borcea, Ileana Streinu
Periodic Auxetics: Structure And Design, Ciprian S. Borcea, Ileana Streinu
Computer Science: Faculty Publications
Materials science has adopted the term of auxetic behavior for structural deformations where stretching in some direction entails lateral widening, rather than lateral shrinking. Most studies, in the last three decades, have explored repetitive or cellular structures and used the notion of negative Poisson's ratio as the hallmark of auxetic behavior. However, no general auxetic principle has been established from this perspective. In the present article, we show that a purely geometric approach to periodic auxetics is apt to identify essential characteristics of frameworks with auxetic deformations and can generate a systematic and endless series of periodic auxetic designs. The …
Periodic Auxetics: Structure And Design, Ciprian S. Borcea, Ileana Streinu
Periodic Auxetics: Structure And Design, Ciprian S. Borcea, Ileana Streinu
Computer Science: Faculty Publications
Materials science has adopted the term of auxetic behavior for structural deformations where stretching in some direction entails lateral widening, rather than lateral shrinking. Most studies, in the last three decades, have explored repetitive or cellular structures and used the notion of negative Poisson's ratio as the hallmark of auxetic behavior. However, no general auxetic principle has been established from this perspective. In the present article, we show that a purely geometric approach to periodic auxetics is apt to identify essential characteristics of frameworks with auxetic deformations and can generate a systematic and endless series of periodic auxetic designs. The …
Auxetic Deformations And Elliptic Curves, Ciprian S. Borcea, Ileana Streinu
Auxetic Deformations And Elliptic Curves, Ciprian S. Borcea, Ileana Streinu
Computer Science: Faculty Publications
The problem of detecting auxetic behavior, originating in materials science and mathematical crystallography, refers to the property of a flexible periodic bar-and-joint framework to widen, rather than shrink, when stretched in some direction. The only known algorithmic solution for detecting infinitesimal auxeticity is based on the rather heavy machinery of fixed-dimension semi-definite programming. In this paper we present a new, simpler algorithmic approach which is applicable to a natural family of 3D periodic bar-and-joint frameworks with 3 degrees-of-freedom. This class includes most zeolite structures, which are important for applications in computational materials science. We show that the existence of auxetic …
Exploring Connections Between Primitive Decomposition Of Natural Language And Hierarchical Planning, Jamie C. Macbeth, Mark Roberts
Exploring Connections Between Primitive Decomposition Of Natural Language And Hierarchical Planning, Jamie C. Macbeth, Mark Roberts
Computer Science: Faculty Publications
While recent research has shown that “classical” automated planning systems are effective tools for story generation, the success of automated story understanding systems may require integration between commonsense reasoning and more sophisticated forms of planning to make inferences and deductions about the plans and goals of story actors. Methods that decompose abstractions (i.e., tasks or language expressions) into primitives have played an important role for both automated planning systems and automated story understanding systems, but the two areas have remained largely isolated from each other with few overlaps. We argue that this little-explored connection can benefit both areas of …
Threadable Curves, Joseph O’Rourke, Emmely Rogers
Threadable Curves, Joseph O’Rourke, Emmely Rogers
Computer Science: Faculty Publications
We define a plane curve to be threadable if it can rigidly pass through a point-hole in a line L without otherwise touching L. Threadable curves are in a sense generalizations of monotone curves. We have two main results. The first is a linear-time algorithm for deciding whether a polygonal curve is threadable—O(n) for a curve of n vertices—and if threadable, finding a sequence of rigid motions to thread it through a hole. We also sketch an argument that shows that the threadability of algebraic curves can be decided in time polynomial in the degree of the curve. The second …
Scalable Syriac Paleography Using Interactive Visualization, R. Jordan Crouser, Michael Penn, Nicholas Howe
Scalable Syriac Paleography Using Interactive Visualization, R. Jordan Crouser, Michael Penn, Nicholas Howe
Computer Science: Faculty Publications
Syriac (a dialect of Aramaic) was the primary language spoken in the late ancient Middle East between the second and eighth centuries AD, and continues to be a language of Christian scholarship and liturgy up to the present day. There are approximately 20,000 known surviving Syriac manuscripts. Among early manuscripts, only around 10% include a scribal note that provides information regarding when, where, and by whom a given manuscript was written. For the remaining 90%, close examination of subtle differences in the handwritten script remains the primary tool for determining provenance. Prior to this study, scholars classified early Syriac manuscripts …
Aligned Sub-Hierarchies: A Structure-Based Approach To The Cover Song Task, Katherine M. Kinnaird
Aligned Sub-Hierarchies: A Structure-Based Approach To The Cover Song Task, Katherine M. Kinnaird
Computer Science: Faculty Publications
Extending previous structure-based approaches to the song comparison tasks such as the fingerprint and cover song tasks, this paper introduces the aligned sub-hierarchies (AsH) representation. Built by applying a post-processing technique to the aligned hierarchies of a song, the AsH representation is the set of unique aligned hierarchies for repeats (called AHR ) encoded in the original aligned hierarchies of the whole song. Effectively each AHR within AsH is a section of the aligned hierarchies for the original song. Like aligned hierarchies, the AsH representation can be embedded into a classification space with a natural metric that makes inter-song comparisons …
Development Of A Genotype-By-Sequencing Immunogenetic Assay As Exemplified By Screening For Variation In Red Fox With And Without Endemic Rabies Exposure, Michael E. Donaldson, Yessica Rico, Karsten Hueffer, Halie M. Rando, Anna V. Kukekova, Christopher J. Kyle
Development Of A Genotype-By-Sequencing Immunogenetic Assay As Exemplified By Screening For Variation In Red Fox With And Without Endemic Rabies Exposure, Michael E. Donaldson, Yessica Rico, Karsten Hueffer, Halie M. Rando, Anna V. Kukekova, Christopher J. Kyle
Computer Science: Faculty Publications
Pathogens are recognized as major drivers of local adaptation in wildlife systems. By determining which gene variants are favored in local interactions among populations with and without disease, spatially explicit adaptive responses to pathogens can be elucidated. Much of our current understanding of host responses to disease comes from a small number of genes associated with an immune response. High-throughput sequencing (HTS) technologies, such as genotype-by-sequencing (GBS), facilitate expanded explorations of genomic variation among populations. Hybridization-based GBS techniques can be leveraged in systems not well characterized for specific variants associated with disease outcome to “capture” specific genes and regulatory regions …
Repairing Gaps In Kinari-2 For Large Scale Protein And Flexibility Analysis Applications, Magdalena Metlicka, Mojtaba Nouri Bygi, Ileana Streinu
Repairing Gaps In Kinari-2 For Large Scale Protein And Flexibility Analysis Applications, Magdalena Metlicka, Mojtaba Nouri Bygi, Ileana Streinu
Computer Science: Faculty Publications
Pebble game rigidity analysis is a combinatorial method, implemented in our free web server KinariWeb, for extracting protein rigidity and flexibility information without performing costly molecular dynamics simulations. Due to the idiosynchrasies of the data in the Protein Data Bank (PDB), Kinari succeeds only on a fraction of the available files. Motivated by large scale applications, aiming at processing almost all the PDB files, we have recently developed a faster and more robust version, the phased pebble game algorithm. It is specifically designed to take advantage of the sequential structure of biopolymers. However, the structural data available in the Protein …
Repairing Gaps In Kinari-2 For Large Scale Protein And Flexibility Analysis Applications, Magdalena Metlicka, Mojtaba Nouri Bygi, Ileana Streinu
Repairing Gaps In Kinari-2 For Large Scale Protein And Flexibility Analysis Applications, Magdalena Metlicka, Mojtaba Nouri Bygi, Ileana Streinu
Computer Science: Faculty Publications
Pebble game rigidity analysis is a combinatorial method, implemented in our free web server KinariWeb, for extracting protein rigidity and flexibility information without performing costly molecular dynamics simulations. Due to the idiosynchrasies of the data in the Protein Data Bank (PDB), Kinari succeeds only on a fraction of the available files. Motivated by large scale applications, aiming at processing almost all the PDB files, we have recently developed a faster and more robust version, the phased pebble game algorithm. It is specifically designed to take advantage of the sequential structure of biopolymers. However, the structural data available in the Protein …
A Churn For The Better: Localizing Censorship Using Network-Level Path Churn And Network Tomography, Shinyoung Cho, Abbas Razaghpanah, Rishab Nithyanand, Phillipa Gill
A Churn For The Better: Localizing Censorship Using Network-Level Path Churn And Network Tomography, Shinyoung Cho, Abbas Razaghpanah, Rishab Nithyanand, Phillipa Gill
Computer Science: Faculty Publications
Recent years have seen the Internet become a key vehicle for citizens around the globe to express political opinions and organize protests. This fact has not gone unnoticed, with countries around the world repurposing network management tools (e.g., URL iltering products) and protocols (e.g., BGP, DNS) for censorship. Previous work has focused on identifying how censorship is performed. However, there is no major studies to identify, at a global scale, the networks responsible for performing censorship. Also, repurposing network products for censorship can have unintended international impact, which we refer to as lcensorship leakagež. While there have been anecdotal reports …
Efficient Pebble Game Algorithms Engineered For Protein Rigidity Applications, Mojtaba Nouri Bygi, Ileana Streinu
Efficient Pebble Game Algorithms Engineered For Protein Rigidity Applications, Mojtaba Nouri Bygi, Ileana Streinu
Computer Science: Faculty Publications
Pebble game rigidity analysis is an efficient method for extracting rigidity and flexibility information of biomolecules without performing costly molecular dynamics simulations. The standard algorithm works on a multi-graph associated to a mechanical model constructed from an arbitrary atom-bond network. Motivated by large scale protein flexibility and simulated unfolding applications, we have developed a faster and more robust variation tailored to the specificities of bio-polymers. We describe this new phased pebble game as implemented in the new version of our software Kinari-2.
Efficient Pebble Game Algorithms Engineered For Protein Rigidity Applications, Mojtaba Nouri Bygi, Ileana Streinu
Efficient Pebble Game Algorithms Engineered For Protein Rigidity Applications, Mojtaba Nouri Bygi, Ileana Streinu
Computer Science: Faculty Publications
Pebble game rigidity analysis is an efficient method for extracting rigidity and flexibility information of biomolecules without performing costly molecular dynamics simulations. The standard algorithm works on a multi-graph associated to a mechanical model constructed from an arbitrary atom-bond network. Motivated by large scale protein flexibility and simulated unfolding applications, we have developed a faster and more robust variation tailored to the specificities of bio-polymers. We describe this new phased pebble game as implemented in the new version of our software Kinari-2.
Chronological Profiling For Paleography, Nicholas Howe, Stephanie Xie
Chronological Profiling For Paleography, Nicholas Howe, Stephanie Xie
Computer Science: Faculty Publications
This paper approaches manuscript dating from a Bayesian perspective. Prior work on paleographic date recovery has generally sought to predict a single date for a manuscript. Bayesian analysis makes it possible to estimate a probability distribution that varies with respect to time. This in turn enables a number of alternative analyses that may be of more use to practitioners. For example, it may be useful to identify a range of years that will include a document’s creation date with a particular confidence level. The methods are demonstrated on a selection of Syriac documents created prior to 1300 CE.
Isolated Character Forms From Dated Syriac Manuscripts, Nicholas Howe, Minyue Dai, Michael Penn
Isolated Character Forms From Dated Syriac Manuscripts, Nicholas Howe, Minyue Dai, Michael Penn
Computer Science: Faculty Publications
This paper describes a set of hand-isolated character samples selected from securely dated manuscripts written in Syriac between 300 and 1300 C.E., which are being made available for research purposes. The collection can be used for a number of applications, including ground truth for character segmentation and form analysis for paleographical dating. Several applications based upon convolutional neural networks demonstrate the possibilities of the data set.
Modeling And Reasoning With Changing Intentions: An Experiment, Alicia M. Grubb, Marsha Chechik
Modeling And Reasoning With Changing Intentions: An Experiment, Alicia M. Grubb, Marsha Chechik
Computer Science: Faculty Publications
Existing modeling approaches in requirements engineering assume that stakeholder goals are static: Once set, they remain the same throughout the lifecycle of the project. Of course, such goals, like anything else, may change over time. In earlier work, we introduced Evolving Intentions: An approach that allows stakeholders to specify how evaluations of goal model elements change over time. Simulation over Evolving Intentions enables stakeholders to ask a variety of 'what if' questions, and evaluate possible evolutions of a goal model. GrowingLeaf is a web-based tool that implements both the modeling and analysis components of this approach. In this paper, we …
Y-Chromosome Markers For The Red Fox, Halie M. Rando, Jeremy T. Stutchman, Estelle R. Bastounes, Jennifer L. Johnson, Carlos A. Driscoll, Christina S. Barr, Lyudmila N. Trut, Benjamin N. Sacks, Anna V. Kukekova
Y-Chromosome Markers For The Red Fox, Halie M. Rando, Jeremy T. Stutchman, Estelle R. Bastounes, Jennifer L. Johnson, Carlos A. Driscoll, Christina S. Barr, Lyudmila N. Trut, Benjamin N. Sacks, Anna V. Kukekova
Computer Science: Faculty Publications
The de novo assembly of the red fox (Vulpes vulpes) genome has facilitated the development of genomic tools for the species. Efforts to identify the population history of red foxes in North America have previously been limited by a lack of information about the red fox Y-chromosome sequence. However, a megabase of red fox Y-chromosome sequence was recently identified over 2 scaffolds in the reference genome. Here, these scaffolds were scanned for repeated motifs, revealing 194 likely microsatellites. Twenty-Three of these loci were selected for primer development and, after testing, produced a panel of 11 novel markers that …
Retrospective On A Decade Of Research In Visualization For Cybersecurity, R. Jordan Crouser, Erina Fukuda, Subashini Sridhar
Retrospective On A Decade Of Research In Visualization For Cybersecurity, R. Jordan Crouser, Erina Fukuda, Subashini Sridhar
Computer Science: Faculty Publications
Over the past decade, the visualization for cybersecurity (VizSec) research community has adapted many information visualization techniques to support the critical work of cyber analysts. While these efforts have yielded many specialized tools and platforms, the community lacks a unified approach to the design and implementation of these systems. In this work, we provide a retrospective analysis of the past decade of VizSec publications, with an eye toward developing a more cohesive understanding of the emerging patterns of design at work in our community. We identify common thematic groupings among existing work, as well as several interesting pat- terns of …