Computer Sciences Commons^™

Nanosensor Data Processor In Quantum-Dot Cellular Automata, Fenghui Yao, Mohamed Saleh Zein-Sabatto, Guifeng Shao, Mohammad Bodruzzaman, Mohan Malkani

Computer Science Faculty Research

Quantum-dot cellular automata (QCA) is an attractive nanotechnology with the potential alterative to CMOS technology. QCA provides an interesting paradigm for faster speed, smaller size, and lower power consumption in comparison to transistor-based technology, in both communication and computation. This paper describes the design of a 4-bit multifunction nanosensor data processor (NSDP). The functions of NSDP contain (i) sending the preprocessed raw data to high-level processor, (ii) counting the number of the active majority gates, and (iii) generating the approximate sigmoid function. The whole system is designed and simulated with several different input data.

Visualization Of Off-Screen Data On Tablets Using Context-Providing Bar Graphs And Scatter Plots, Peter S. Games, Alark Joshi

Computer Science Faculty Publications and Presentations

Visualizing data on tablets is challenging due to the relatively small screen size and limited user interaction capabilities. Standard data visualization apps provide support for pinch-and-zoom and scrolling operations, but do not provide context for data that is off-screen. When exploring data on tablets, the user must be able to focus on a region of interest and quickly find interesting patterns in the data. We present visualization techniques that facilitate seamless interaction with the region of interest on a tablet using context-providing bar graphs and scatter plots. Through aggregation, fisheye-style, and overview+detail representations, we provide context to the users as …

Visualization Of Multidimensional Data With Collocated Paired Coordinates And General Line Coordinates, Boris Kovalerchuk

All Faculty Scholarship for the College of the Sciences

Often multidimensional data are visualized by splitting n-D data to a set of low dimensional data. While it is useful it destroys integrity of n-D data, and leads to a shallow understanding complex n-D data. To mitigate this challenge a difficult perceptual task of assembling low-dimensional visualized pieces to the whole n-D vectors must be solved. Another way is a lossy dimension reduction by mapping n-D vectors to 2-D vectors (e.g., Principal Component Analysis). Such 2-D vectors carry only a part of information from n-D vectors, without a way to restore n-D vectors exactly from it. An alternative way for …

A Computational Approach To Qualitative Analysis In Large Textual Datasets, Michael Evans

Dartmouth Scholarship

In this paper I introduce computational techniques to extend qualitative analysis into the study of large textual datasets. I demonstrate these techniques by using probabilistic topic modeling to analyze a broad sample of 14,952 documents published in major American newspapers from 1980 through 2012. I show how computational data mining techniques can identify and evaluate the significance of qualitatively distinct subjects of discussion across a wide range of public discourse. I also show how examining large textual datasets with computational methods can overcome methodological limitations of conventional qualitative methods, such as how to measure the impact of particular cases on …

Fitts's Law: Towards A Geometric Explanation, Olga Kosheleva, Vladik Kreinovich, Octavio Lerma

Departmental Technical Reports (CS)

In designing human-computer interfaces, designers use an empirical Fitts's Law, according to which the average time T of accessing an icon of size w at a distance d from the center of the screen is proportional to the logarithm of the ratio w/d. There exist explanations for this law, but these explanations have gaps. In this paper, we show that these gaps can be explained if we analyze this problem from the geometric viewpoint. Thus, we get a geometric explanation of the Fitts's Law.

Comparative Trust Management With Applications: Bayesian Approaches Emphasis, Krishnaprasad Thirunarayan, Pramod Anantharam, Cory Andrew Henson, Amit P. Sheth

Kno.e.sis Publications

Trust relationships occur naturally in many diverse contexts such as collaborative systems, e-commerce, interpersonal interactions, social networks, and semantic sensor web. As agents providing content and services become increasingly removed from the agents that consume them, the issue of robust trust inference and update becomes critical. There is a need to find online substitutes for traditional (direct or face-to-face) cues to derive measures of trust, and create efficient and robust systems for managing trust in order to support decision-making. Unfortunately, there is neither a universal notion of trust that is applicable to all domains nor a clear explication of its …

How To Compare Different Range Estimations: A Symmetry-Based Approach, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

How to compare different range estimators for multivariate functions under uncertainty? To answer this question, we analyze which utility functions can be used for this task. Specifically, we: (1) introduce various invariance assumptions, (2) describe the class of all utility functions which satisfy these assumptions, and (3) show how the resulting utility functions can be used to compare different range estimators.

Range Estimation Under Constraints Is Computable Unless There Is A Discontinuity, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the main problems of interval computations is computing the range of a given function over given intervals. It is known that there is a general algorithm for computing the range of computable functions over computable intervals. However, if we take into account that often in practice, not all possible combinations of the inputs are possible (i.e., that there are constraints), then it becomes impossible to have an algorithm which would always compute this range. In this paper, we explain that the main reason why range estimation under constraints is not always computable is that constraints may introduce discontinuity …

Cursing In English On Twitter, Wenbo Wang, Lu Chen, Krishnaprasad Thirunarayan, Amit P. Sheth

Kno.e.sis Publications

Cursing is not uncommon during conversations in the physical world: 0.5% to 0.7% of all the words we speak are curse words, given that 1% of all the words are first-person plural pronouns (e.g., we, us, our). On social media, people can instantly chat with friends without face-to-face interaction, usually in a more public fashion and broadly disseminated through highly connected social network. Will these distinctive features of social media lead to a change in people's cursing behavior? In this paper, we examine the characteristics of cursing activity on a popular social media platform - Twitter, involving the analysis of …

Review Of Whatis.Com, Edited By Margaret Rouse And Ivy Wigmore, Et Al., Michael Knee

University Libraries Faculty Scholarship

No abstract provided.

Interleaving Enhances Learning: A Possible Geometric Explanation, Octavio Lerma, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In the traditional approach to learning, if we want students to learn how to solve different types of problems, we first teach them how to solve problems of the first type, then how to solve problems of the second type, etc. It turns out that we can speed up learning if we interleave problems of different types. In particular, it has bene empirically shown that interleaving problems of four different types leads to a double speed-up. In this paper, we provide a possible geometric explanation for this empirical fact.

Social Correlation In Latent Spaces For Complex Networks, Freddy Chong Tat Chua

Dissertations and Theses Collection (Open Access)

This dissertation addresses the subject of measuring social correlation among users within a complex social network. Social correlation is closely related to the measurement of social influence in social sciences. While social influence focuses on the existence of causal influence among users, we take a computational approach to measure correlation strength among users based on their shared interactions. We call this social correlation. To formally model social correlation, we propose a framework which contains two major parts. The first part is that of representing users behavior in a computationally efficient and accurate manner. For example, social media users perform many …

Analizing Protocols For Layer Three Network Redundancy, Taulant Galimuna

Theses and Dissertations

This thesis will analyze FHRP (First Hop Redundancy Protocols) which are three redundancy protocols of the IP Layer (layer 3). Protocols of the default gateway redundancy or FHRP are HSRP (Hot Standby Router Protocol) which is a Cisco proprietary and is an active/standby redundancy protocol, GLBP (Gateway Load Balancing Protocol) which is an active/active redundancy protocol and also it does Load Balancing, and the last VRRP (Virtual Redundant Routing Protocol) which is typically used with non-Cisco routers (such as Juniper) and is an extension of GLBP. Basically what FHRP protocols do is; they allow multiple redundant routers on the same …

Metodat Për Parandalimi E Rreziqeve Qe Vijnë Nga Shfrytëzimi I Internetit, Nalton Mustafa

Theses and Dissertations

Interneti është bere pjese e pa ndare e punës tone, por me këtë risi ka ardhur edhe rreziku i përhapjes se kodeve te dëmshme. Është fakte qe ne pjesën me te madhe te komunikimit e bëjmë me internet për një çmime shume te volitshëm duke komunikuar ne distanca shume te mëdha por qe kemi një kosto ne siguri te cilës duhet te i adresohemi.

Përfitimet nga interneti janë te shumta nga dërgimi i e-mail-eve, komunikimi me video dhe zë shikimi i videove, bartja e fajlla-ve leximi i gazetave, argëtimet e ndryshme etj.

Ne fokus te kësaj teme do te jete …

Analiza E Redundancës Në Shtresën 2 Të Rrjetës Kampus, Selim Kolgeci

Theses and Dissertations

Përgjatë viteve, kanë ndodhur ndryshime marramendëse në avancimin e teknologjisë së komunikimit dhe ka me mijëra aplikacione të cilat i gjejmë në treg. Shumë nga këto aplikacione janë të llojit (real-time) apo të pa-ndërprera dhe si të tilla janë të ndjeshme ndaj ndërprerjes së trafikut, për shkak të natyrës së tyre të shkëmbimit të të dhënave në kohë reale dhe pa pengesa. Në cilindo lloj të rrjetit, redundanca është tejet e rëndësishme që të sigurojë dhe të “shërojë” lidhjen përmes intervenimit automatik në rast të ndërprerjeve, dështimit apo de-aktivizimit të linkut për çfarëdo lloj arsye. Sido që të jetë, konsideroj …

Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev

Dissertations, Theses, and Capstone Projects

In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and …

Phylogenetic Trees And Their Analysis, Eric Ford

Dissertations, Theses, and Capstone Projects

Determining the best possible evolutionary history, the lowest-cost phylogenetic tree, to fit a given set of taxa and character sequences using maximum parsimony is an active area of research due to its underlying importance in understanding biological processes. As several steps in this process are NP-Hard when using popular, biologically-motivated optimality criteria, significant amounts of resources are dedicated to both both heuristics and to making exact methods more computationally tractable. We examine both phylogenetic data and the structure of the search space in order to suggest methods to reduce the number of possible trees that must be examined to find …

Discovering Regularity In Point Clouds Of Urban Scenes, Sam Friedman

Dissertations, Theses, and Capstone Projects

Despite the apparent chaos of the urban environment, cities are actually replete with regularity. From the grid of streets laid out over the earth, to the lattice of windows thrown up into the sky, periodic regularity abounds in the urban scene. Just as salient, though less uniform, are the self-similar branching patterns of trees and vegetation that line streets and fill parks. We propose novel methods for discovering these regularities in 3D range scans acquired by a time-of-flight laser sensor. The applications of this regularity information are broad, and we present two original algorithms. The first exploits the efficiency of …

Analysis Of Dna Motifs In The Human Genome, Yupu Liang

Dissertations, Theses, and Capstone Projects

DNA motifs include repeat elements, promoter elements and gene regulator elements, and play a critical role in the human genome. This thesis describes a genome-wide computational study on two groups of motifs: tandem repeats and core promoter elements.

Tandem repeats in DNA sequences are extremely relevant in biological phenomena and diagnostic tools. Computational programs that discover tandem repeats generate a huge volume of data, which can be difficult to decipher without further organization. A new method is presented here to organize and rank detected tandem repeats through clustering and classification. Our work presents multiple ways of expressing tandem repeats using …

Criticality And Quenched Disorder: Harris Criterion Versus Rare Regions, Thomas Vojta, José A. Hoyos

Physics Faculty Research & Creative Works

We employ scaling arguments and optimal fluctuation theory to establish a general relation between quantum Griffiths singularities and the Harris criterion for quantum phase transitions in disordered systems. If a clean critical point violates the Harris criterion, it is destabilized by weak disorder. At the same time, the Griffiths dynamical exponent z' diverges upon approaching the transition, suggesting unconventional critical behavior. In contrast, if the Harris criterion is fulfilled, power-law Griffiths singularities can coexist with clean critical behavior, but z' saturates at a finite value. We present applications of our theory to a variety of systems including quantum spin chains, …

Role Of Electron Saddle Swaps In The Photon Spectra Following Li³⁺ Charge-Exchange Collisions With H*(N = 2), Na(3s), Na*(3p), And Li(2s) Targets, Sebastian Otranto, R. Hoekstra, Ronald E. Olson

Physics Faculty Research & Creative Works

The role of electron saddle swaps in collisions of bare Li with metastable hydrogen and alkali-metal atoms is investigated by means of the classical trajectory Monte Carlo method. In particular, we show that oscillations as a function of collision energy in the photon spectra resulting from charge exchange are directly related to the number of potential-saddle crossings that a receding electron can achieve during a given reaction. The range of impact energies spanned is 0.01-50 keV/amu, an area of interest for diagnostic purposes in tokamak nuclear fusion power reactors.

Relating Constraint Answer Set Programming Languages And Algorithms, Yuliya Lierler

Computer Science Faculty Publications

Recently a logic programming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming and constraint logic programming. Soon after that, a CLINGCON language integrating answer set programming and finite domain constraints, as well as an EZCSP language integrating answer set programming and constraint logic programming were introduced. The development of these languages and systems constitutes the appearance of a new AI subarea called constraint answer set programming. All these languages have something in common. In particular, they aim at developing new efficient inference algorithms that combine traditional answer set programming procedures and other methods in …

Unstructured P2p Link Lifetimes Redux, Zhongmei Yao, Daren B. H. Cline

Computer Science Faculty Publications

We revisit link lifetimes in random P2P graphs under dynamic node failure and create a unifying stochastic model that generalizes the majority of previous efforts in this direction. We not only allow nonexponential user lifetimes and age-dependent neighbor selection, but also cover both active and passive neighbor-management strategies, model the lifetimes of incoming and outgoing links, derive churn-related message volume of the system, and obtain the distribution of transient in/out degree at each user. We then discuss the impact of design parameters on overhead and resilience of the network.

Using Online Data Sources To Make Recommendations On Reading Material For K-12 And Advanced Readers, Maria Soledad Pera

Theses and Dissertations

Reading is a fundamental skill that each person needs to develop during early childhood and continue to enhance into adulthood. While children/teenagers depend on this skill to advance academically and become educated individuals, adults are expected to acquire a certain level of proficiency in reading so that they can engage in social/civic activities and successfully participate in the workforce. A step towards assisting individuals to become lifelong readers is to provide them adequate reading selections which can cultivate their intellectual and emotional growth. Turning to (web) search engines for such reading choices can be overwhelming, given the huge volume of …

Vocal Resonance As A Passive Biometric, Cory Cornelius, Zachary Marois, Jacob Sorber, Ron Peterson, Shrirang Mare, David Kotz

Computer Science Technical Reports

We anticipate the advent of body-area networks of pervasive wearable devices, whether for health monitoring, personal assistance, entertainment, or home automation. In our vision, the user can simply wear the desired set of devices, and they "just work"; no configuration is needed, and yet they discover each other, recognize that they are on the same body, configure a secure communications channel, and identify the user to which they are attached. This paper addresses a method to achieve the latter, that is, for a wearable device to identify the wearer, allowing sensor data to be properly labeled or personalized behavior to …

Personal Cloud User Acceptance: The Role Of Trust And Perceived Risk In The Technology Acceptance Model, Murad Moqbel, Valerie L. Bartelt, John Cicala

Information Systems Faculty Publications

This research considers technology adoption issues, as well as risk and trust factors, that lead to behavioral intention of personal cloud computing. We are interested in whether similar results are found in personal cloud computing, a tool that may be perceived as having more risks. Our research found that perceived risk decreased behavioral intentions. Perceived usefulness served as a mediator between trust and behavioral intentions, significantly increasing both relationships. Trust was found to decrease perceived risk; however, it directly increased behavioral intention, perceived usefulness, and perceived ease of use. Interestingly, perceived ease of use did not significantly affect behavioral intentions. …

Development Of Curves On Polyhedra Via Conical Existence, Joseph OʼRourke, Costin Vîlcu

Computer Science: Faculty Publications

We establish that certain classes of simple, closed, polygonal curves on the surface of a convex polyhedron develop in the plane without overlap. Our primary proof technique shows that such curves “live on a cone,” and then develops the curves by cutting the cone along a “generator” and flattening the cone in the plane. The conical existence results support a type of source unfolding of the surface of a polyhedron, described elsewhere.

Understanding Of Computers And Procrastination: A Philosophical Approach, Nick Breems, Andrew Basden

Faculty Work Comprehensive List

Computer procrastination is a complex problem that is under-researched. After identifying a number of key characteristics of it, we survey five existing fields of research that may contribute insights into this interdisciplinary problem, and demonstrate that none of these areas can provide satisfactory insight on their own. A philosophical framework for understanding computer use is introduced, and applied to a case study to demonstrate its potential in understanding the richness of computer procrastination. We then show how this framework can reveal the ways in which each of the existing fields is limited in its ability. The result is both an …

Quantifying The Statistical Impact Of Grappa In Fcmri Data With A Real-Valued Isomorphism, Iain P. Bruce, Daniel B. Rowe

Mathematics, Statistics and Computer Science Faculty Research and Publications

The interpolation of missing spatial frequencies through the generalized auto-calibrating partially parallel acquisitions (GRAPPA) parallel magnetic resonance imaging (MRI) model implies a correlation is induced between the acquired and reconstructed frequency measurements. As the parallel image reconstruction algorithms in many medical MRI scanners are based on the GRAPPA model, this study aims to quantify the statistical implications that the GRAPPA model has in functional connectivity studies. The linear mathematical framework derived in the work of Rowe , 2007, is adapted to represent the complex-valued GRAPPA image reconstruction operation in terms of a real-valued isomorphism, and a statistical analysis is performed …

When Semi-Monotone Implies Monotone, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

The basic theme of this talk is the extrinsic description of objects by means of morphisms. One way to do this is to say that all monomorphisms from the object are “special” in some way; the dual of this is to single out epimorphisms to the object.