Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (752)
- Computer Engineering (596)
- Databases and Information Systems (376)
- Information Security (348)
- Electrical and Computer Engineering (343)
-
- Artificial Intelligence and Robotics (277)
- Numerical Analysis and Scientific Computing (255)
- Software Engineering (249)
- Social and Behavioral Sciences (238)
- Business (163)
- Programming Languages and Compilers (160)
- Graphics and Human Computer Interfaces (131)
- Theory and Algorithms (124)
- Other Computer Sciences (120)
- Life Sciences (112)
- Medicine and Health Sciences (92)
- Operations Research, Systems Engineering and Industrial Engineering (82)
- Communication (78)
- Mathematics (77)
- OS and Networks (75)
- Education (74)
- Law (68)
- Statistics and Probability (68)
- Digital Communications and Networking (61)
- Public Affairs, Public Policy and Public Administration (58)
- Technology and Innovation (57)
- Management Information Systems (53)
- Sociology (53)
- Institution
-
- Singapore Management University (493)
- TÜBİTAK (268)
- University of Nebraska - Lincoln (156)
- University of Texas at El Paso (91)
- City University of New York (CUNY) (86)
-
- San Jose State University (78)
- Technological University Dublin (66)
- University for Business and Technology in Kosovo (66)
- Embry-Riddle Aeronautical University (62)
- Missouri University of Science and Technology (60)
- Wright State University (60)
- Chulalongkorn University (58)
- China Simulation Federation (52)
- Walden University (49)
- Kennesaw State University (47)
- Old Dominion University (45)
- Air Force Institute of Technology (43)
- Dartmouth College (40)
- Nova Southeastern University (40)
- University of Nevada, Las Vegas (35)
- University of Texas at Arlington (34)
- Edith Cowan University (33)
- University of Kentucky (33)
- University of Nebraska at Omaha (33)
- Marquette University (30)
- University of South Florida (29)
- California Polytechnic State University, San Luis Obispo (28)
- Portland State University (28)
- Florida Institute of Technology (27)
- Boise State University (25)
- Keyword
-
- Machine learning (77)
- Machine Learning (53)
- Deep learning (50)
- Security (41)
- Cybersecurity (40)
-
- Classification (36)
- Computer Science (33)
- Intro to Data Science (33)
- Computer science (31)
- Deep Learning (30)
- Artificial intelligence (29)
- Department of Computer Science and Engineering (29)
- Cloud computing (26)
- Privacy (24)
- Technology (23)
- Data mining (22)
- Optimization (21)
- Social media (20)
- Blockchain (16)
- Big data (15)
- Clustering (15)
- Neural networks (15)
- Twitter (15)
- Android (14)
- Computer Vision (14)
- Computer vision (14)
- Information technology (14)
- Neural Networks (14)
- Algorithms (13)
- Internet of Things (13)
- Publication
-
- Research Collection School Of Computing and Information Systems (462)
- Turkish Journal of Electrical Engineering and Computer Sciences (268)
- Theses and Dissertations (123)
- The R Journal (92)
- Departmental Technical Reports (CS) (80)
-
- Master's Projects (62)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (58)
- Journal of System Simulation (52)
- Open Educational Resources (49)
- Walden Dissertations and Doctoral Studies (48)
- Computer Science Faculty Publications (46)
- Dissertations (43)
- Electronic Theses and Dissertations (43)
- CCAC Theses and Dissertations (39)
- International Journal of Business and Technology (36)
- Journal of Digital Forensics, Security and Law (35)
- Faculty Publications (34)
- Browse all Theses and Dissertations (31)
- 3-D Printed Model Structural Files (28)
- Computer Science Faculty Research & Creative Works (28)
- USF Tampa Graduate Theses and Dissertations (28)
- Conference papers (24)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (23)
- Publications and Research (23)
- Computer Science and Information Technology Grants Collections (22)
- Computer Science Faculty Publications and Presentations (20)
- Computer Science: Faculty Publications (20)
- Masters Theses (20)
- School of Computing: Dissertations, Theses, and Student Research (20)
- Computer Science and Engineering Theses - Archive (19)
- Publication Type
- File Type
Articles 631 - 660 of 2925
Full-Text Articles in Computer Sciences
Pfix: Fixing Concurrency Bugs Based On Memory Access Patterns, Huarui Lin, Zan Wang, Shuang Liu, Jun Sun, Dongdi Zhang, Guangning Wei
Pfix: Fixing Concurrency Bugs Based On Memory Access Patterns, Huarui Lin, Zan Wang, Shuang Liu, Jun Sun, Dongdi Zhang, Guangning Wei
Research Collection School Of Computing and Information Systems
Concurrency bugs of a multi-threaded program may only manifest with certain scheduling, i.e., they are heisenbugs which are observed only from time to time if we execute the same program with the same input multiple times. They are notoriously hard to fix. In this work, we propose an approach to automatically fix concurrency bugs. Compared to previous approaches, our key idea is to systematically fix concurrency bugs by inferring locking policies from failure inducing memory-access patterns. That is, we automatically identify memory-access patterns which are correlated with the manifestation of the bug, and then conjecture what is the intended locking …
Break The Dead End Of Dynamic Slicing: Localizing Data And Control Omission Bug, Yun Lin, Jun Sun, Lyly Tran, Guangdong Bai, Haijun Wang, Jin Song Dong
Break The Dead End Of Dynamic Slicing: Localizing Data And Control Omission Bug, Yun Lin, Jun Sun, Lyly Tran, Guangdong Bai, Haijun Wang, Jin Song Dong
Research Collection School Of Computing and Information Systems
Dynamic slicing is a common way of identifying the root cause when a program fault is revealed. With the dynamic slicing technique, the programmers can follow data and control flow along the program execution trace to the root cause. However, the technique usually fails to work on omission bugs, i.e., the faults which are caused by missing executing some code. In many cases, dynamic slicing over-skips the root cause when an omission bug happens, leading the debugging process to a dead end. In this work, we conduct an empirical study on the omission bugs in the Defects4J bug repository. Our …
Toward Audio Beehive Monitoring: Deep Learning Vs. Standard Machine Learning In Classifying Beehive Audio Samples, Vladmir Kulyukin, Sarbajit Mukherjee, Prakhar Amlathe
Toward Audio Beehive Monitoring: Deep Learning Vs. Standard Machine Learning In Classifying Beehive Audio Samples, Vladmir Kulyukin, Sarbajit Mukherjee, Prakhar Amlathe
Computer Science Faculty and Staff Publications
Electronic beehive monitoring extracts critical information on colony behavior and phenology without invasive beehive inspections and transportation costs. As an integral component of electronic beehive monitoring, audio beehive monitoring has the potential to automate the identification of various stressors for honeybee colonies from beehive audio samples. In this investigation, we designed several convolutional neural networks and compared their performance with four standard machine learning methods (logistic regression, k-nearest neighbors, support vector machines, and random forests) in classifying audio samples from microphones deployed above landing pads of Langstroth beehives. On a dataset of 10,260 audio samples where the training and testing …
Reliable Delay Based Algorithm To Boost Puf Security Against Modeling Attacks, Fathi Amsaad, Mohammaed Niamat, Amer Dawoud, Selcuk Kose
Reliable Delay Based Algorithm To Boost Puf Security Against Modeling Attacks, Fathi Amsaad, Mohammaed Niamat, Amer Dawoud, Selcuk Kose
Faculty Publications
Silicon Physical Unclonable Functions (sPUFs) are one of the security primitives and state-of-the-art topics in hardware-oriented security and trust research. This paper presents an efficient and dynamic ring oscillator PUFs (d-ROPUFs) technique to improve sPUFs security against modeling attacks. In addition to enhancing the Entropy of weak ROPUF design, experimental results show that the proposed d-ROPUF technique allows the generation of larger and updated challenge-response pairs (CRP space) compared with simple ROPUF. Additionally, an innovative hardware-oriented security algorithm, namely, the Optimal Time Delay Algorithm (OTDA), is proposed. It is demonstrated that the OTDA algorithm significantly improves PUF reliability under varying …
Human Hexokinase I - Allosteric Regulation: Model File Name: 1dgk-Editb22-Allostery_Sc06.Stl, Michelle Howell, Rebecca Roston
Human Hexokinase I - Allosteric Regulation: Model File Name: 1dgk-Editb22-Allostery_Sc06.Stl, Michelle Howell, Rebecca Roston
3-D Printed Model Structural Files
This is a teaching model of human Hexokinase I in a surface representation with small molecules ADP and G6P included (PDB: 1DGK). It is designed to be hollow with a lever to mimic allosteric regulation. The printable model is already uploaded to Shapeways.com in the MacroMolecules shop under the name “Human Hexokinase I - Allosteric regulation model”. This model has been printed successfully using these parameters on Shapeways’ laser sintering printer in the following material: Processed Versatile Plastic (Strong & Flexible Plastic).
Towards Parallel Quantum Computing: Standard Quantum Teleportation Algorithm Is, In Some Reasonable Sense, Unique, Oscar Galindo, Olga Kosheleva, Vladik Kreinovich
Towards Parallel Quantum Computing: Standard Quantum Teleportation Algorithm Is, In Some Reasonable Sense, Unique, Oscar Galindo, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical problems, the computation speed of modern computers is not sufficient. Due to the fact that all speeds are bounded by the speed of light, the only way to speed up computations is to further decrease the size of the memory and processing cells that form a computational device. At the resulting size level, each cell will consist of a few atoms -- thus, we need to take quantum effects into account. For traditional computational devices, quantum effects are largely a distracting noise, but new quantum computing algorithms have been developed that use quantum effects to speed up …
The Thoralf Plugin: For Your Fancy Type Needs, Divesh Otwani, Richard A. Eisenberg
The Thoralf Plugin: For Your Fancy Type Needs, Divesh Otwani, Richard A. Eisenberg
Computer Science Faculty Research and Scholarship
Many fancy types (e.g., generalized algebraic data types, type families) require a type checker plugin. These fancy types have a type index (e.g., type level natural numbers) with an equality relation that is difficult or impossible to represent using GHC’s built-in type equality. The most practical way to represent these equality relations is through a plugin that asserts equality constraints. However, such plugins are difficult to write and reason about. In this paper, we (1) present a formal theory of reasoning about the correctness of type checker plugins for type indices, and, (2) apply this theory in creating Thoralf, a …
Type Variables In Patterns, Richard A. Eisenberg, Joachim Breitner, Simon Peyton Jones
Type Variables In Patterns, Richard A. Eisenberg, Joachim Breitner, Simon Peyton Jones
Computer Science Faculty Research and Scholarship
For many years, GHC has implemented an extension to Haskell that allows type variables to be bound in type signatures and patterns, and to scope over terms. This extension was never properly specified. We rectify that oversight here. With the formal specification in hand, the otherwise-labyrinthine path toward a design for binding type variables in patterns becomes blindingly clear. We thus extend ScopedTypeVariables to bind type variables explicitly, obviating the Proxy workaround to the dustbin of history.
Measurement-Type "Calibration" Of Expert Estimates Improves Their Accuracy And Their Usability: Pavement Engineering Case Study, Edgar Daniel Rodriguez Velasquez, Carlos M. Chang Albitres, Vladik Kreinovich
Measurement-Type "Calibration" Of Expert Estimates Improves Their Accuracy And Their Usability: Pavement Engineering Case Study, Edgar Daniel Rodriguez Velasquez, Carlos M. Chang Albitres, Vladik Kreinovich
Departmental Technical Reports (CS)
In many applications areas, including pavement engineering, experts are used to estimate the values of the corresponding quantities. Expert estimates are often imprecise. As a result, it is difficult to find experts whose estimates will be sufficiently accurate, and for the selected experts, the accuracy is often barely within the desired accuracy. A similar situations sometimes happens with measuring instruments, but usually, if a measuring instrument stops being accurate, we do not dismiss it right away, we first try to re-calibrate it -- and this re-calibration often makes it more accurate. We propose to do the same for experts -- …
Current Quantum Cryptography Algorithm Is Optimal: A Proof, Oscar Galindo, Vladik Kreinovich, Olga Kosheleva
Current Quantum Cryptography Algorithm Is Optimal: A Proof, Oscar Galindo, Vladik Kreinovich, Olga Kosheleva
Departmental Technical Reports (CS)
One of the main reasons for the current interest in quantum computing is that, in principle, quantum algorithms can break the RSA encoding, the encoding that is used for the majority secure communications -- in particular, the majority of e-commerce transactions are based on this encoding. This does not mean, of course, that with the emergence of quantum computers, there will no more ways to secretly communicate: while the existing non-quantum schemes will be compromised, there exist a quantum cryptographic scheme that will enables us to secretly exchange information. In this scheme, however, there is a certain probability that an …
Why Max And Average Poolings Are Optimal In Convolutional Neural Networks, Ahnaf Farhan, Olga Kosheleva, Vladik Kreinovich
Why Max And Average Poolings Are Optimal In Convolutional Neural Networks, Ahnaf Farhan, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical situations, we do not know the exact relation between different quantities; this relation needs to be determined based on the empirical data. This determination is not easy -- especially in the presence of different types of uncertainty. When the data comes in the form of time series and images, many efficient techniques for such determination use algorithms for training convolutional neural network. As part of this training, such networks "pool" several values corresponding to nearby temporal or spatial points into a single value. Empirically, the most efficient pooling algorithm consists of taking the maximum of the pooled …
A Symmetry-Based Explanation Of The Main Idea Behind Chubanov's Linear Programming Algorithm, Olga Kosheleva, Vladik Kreinovich, Thongchai Dumrongpokaphan
A Symmetry-Based Explanation Of The Main Idea Behind Chubanov's Linear Programming Algorithm, Olga Kosheleva, Vladik Kreinovich, Thongchai Dumrongpokaphan
Departmental Technical Reports (CS)
Many important real-life optimization problems can be described as optimizing a linear objective function under linear constraints -- i.e., as a linear programming problem. This problem is known to be not easy to solve. Reasonably natural algorithms -- such as iterative constraint satisfaction or simplex method -- often require exponential time. There exist efficient polynomial-time algorithms, but these algorithms are complicated and not very intuitive. Also, in contrast to many practical problems which can be computed faster by using parallel computers, linear programming has been proven to be the most difficult to parallelize. Recently, Sergei Chubanov proposed a modification of …
Building Classifiers With Gmdh For Health Social Networks (Bd Askapatient), John Cardiff, Liliya Akhtyamova, Mikhail Alexandrov
Building Classifiers With Gmdh For Health Social Networks (Bd Askapatient), John Cardiff, Liliya Akhtyamova, Mikhail Alexandrov
Conference Papers
Health social media offer useful data for patients and doctors concerning both various medicines and treatments. Usually, these data are accompanied by their assessments in 5- star scale. But such a detail classification has small usefulness because patients and doctors, first of all, want to know about negative cases and to study in detail the extreme ones. In the paper we build classifiers of texts just for these cases using combined classes as negative, all others and worst, satisfactory, best. For this, we study possibilities of different GMDH-based algorithms and compare them with the results of other methods. The selection …
Multi-Task Allocation In Mobile Crowd Sensing With Individual Task Quality Assurance, Jiangtao Wang, Yasha Wang, Daqing Zhang, Feng Wang, Haoyi Xiong, Chao Chen, Qin Lv, Zhaopeng Qiu
Multi-Task Allocation In Mobile Crowd Sensing With Individual Task Quality Assurance, Jiangtao Wang, Yasha Wang, Daqing Zhang, Feng Wang, Haoyi Xiong, Chao Chen, Qin Lv, Zhaopeng Qiu
Computer Science Faculty Research & Creative Works
Task allocation is a fundamental research issue in mobile crowd sensing. While earlier research focused mainly on single tasks, recent studies have started to investigate multi-task allocation, which considers the interdependency among multiple tasks. A common drawback shared by existing multi-task allocation approaches is that, although the overall utility of multiple tasks is optimized, the sensing quality of individual tasks may become poor as the number of tasks increases. To overcome this drawback, we re-define the multi-task allocation problem by introducing task-specific minimal sensing quality thresholds, with the objective of assigning an appropriate set of tasks to each worker such …
Hpc For Predictive Models In Healthcare, Luiz Fernando Capretz
Hpc For Predictive Models In Healthcare, Luiz Fernando Capretz
Electrical and Computer Engineering Publications
Increasingly we are faced with complex health data, thus researchers are limited in their capacity to mine data in a way that accounts for the complex inter-relationships between health variables of interest. This research tackles the challenge of producing accurate health prediction models in order to overcome the limitations of simple multivariate regression techniques and the assumption of linear association, also known as algorithmic models, by combining it with a soft computing approach. Predictive models develop methods to enable healthcare researchers and professionals to predict the likelihood of an individual's proclivity to a disease and the likely effectiveness of possible …
Need To Combine Interval And Probabilistic Uncertainty: What Needs To Be Computed, What Can Be Computed, What Can Be Feasibly Computed, And How Physics Can Help, Songsak Sriboonchitta, Thach N. Nguyen, Vladik Kreinovich, Hung T. Nguyen
Need To Combine Interval And Probabilistic Uncertainty: What Needs To Be Computed, What Can Be Computed, What Can Be Feasibly Computed, And How Physics Can Help, Songsak Sriboonchitta, Thach N. Nguyen, Vladik Kreinovich, Hung T. Nguyen
Departmental Technical Reports (CS)
In many practical situations, the quantity of interest is difficult to measure directly. In such situations, to estimate this quantity, we measure easier-to-measure quantities which are related to the desired one by a known relation, and we use the results of these measurement to estimate the desired quantity. How accurate is this estimate?
Traditional engineering approach assumes that we know the probability distributions of measurement errors; however, in practice, we often only have partial information about these distributions. In some cases, we only know the upper bounds on the measurement errors; in such cases, the only thing we know about …
Krahasimi I Zhvillimit Të Rest Api Me Java(Spring) Dhe C#, Shkelzen Fejzullahu
Krahasimi I Zhvillimit Të Rest Api Me Java(Spring) Dhe C#, Shkelzen Fejzullahu
Theses and Dissertations
Kohëve të fundit teknologjia ka filluar të zhvillohet me hapa shumë të shpejtë dhe ky zhvillim i shpejtë i teknologjisë ka prekur edhe sferën e informacionit. Si çdo zhvillim i shpejtë përveç të mirave, ka edhe efektet negative që i krijon. Një nga efektet negative është de funksionalizimi i sistemeve të decentralizuara të informacionit. Me një fjalë shume aplikacione nuk e kishin përdorsh mërin e njëjtë si më parë dhe kjo shtyu inxhinierët kompjuterik që të kërkojnë zgjidhje të problemit përmes sistemeve të cilat do të ishin të centralizuara, ku mirëmbajtja dhe qasja do të ishte shume më e lehtë, …
Krimet Kibernetike, Dua Gjyshinca
Krimet Kibernetike, Dua Gjyshinca
Theses and Dissertations
Në ditët e sotme moderne ku po mbizotëron e ashtëquajtura Epoka e Internet-it shumë nga punët e përditshme si pagesat, komunikimi në mes njerëzve, ndjekja e kurseve mësimore, shkarkimi dhe ngarkimi i dokumenteve të ndryshme, njoftimet rreth ngjarjeve në botë apo edhe përdorimi i aplikacioneve të ndryshme për argëtim ndodhin online me anë të pajisjeve të ndryshme si kompjuterët personal, telefonat e mençur dhe pajisjet tjera.
Njëra ndër gjërat më të rëndësishme që është e mundur falë internetit është mundësia që çdo kush në botë pavarësisht vendndodhjes i jepet mundësia që të lexojë dhe të njoftohet për ngjarjet nga e …
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 …
Self-Supervised Feature Learning For Semantic Segmentation Of Overhead Imagery, Suriya Singh, Anil Batra, Guansong Pang, Lorenzo Torresani, Saikat Basu, Manohar Paluri, C. V. Jawahar
Self-Supervised Feature Learning For Semantic Segmentation Of Overhead Imagery, Suriya Singh, Anil Batra, Guansong Pang, Lorenzo Torresani, Saikat Basu, Manohar Paluri, C. V. Jawahar
Research Collection School Of Computing and Information Systems
Overhead imageries play a crucial role in many applications such as urban planning, crop yield forecasting, mapping, and policy making. Semantic segmentation could enable automatic, efficient, and large-scale understanding of overhead imageries for these applications. However, semantic segmentation of overhead imageries is a challenging task, primarily due to the large domain gap from existing research in ground imageries, unavailability of large-scale dataset with pixel-level annotations, and inherent complexity in the task. Readily available vast amount of unlabeled overhead imageries share more common structures and patterns compared to the ground imageries, therefore, its large-scale analysis could benefit from unsupervised feature learning …
Personality Recognition For Deception Detection, Guozhen An
Personality Recognition For Deception Detection, Guozhen An
Dissertations, Theses, and Capstone Projects
Personality aims at capturing stable individual characteristics, typically measurable in quantitative terms, that explain and predict observable behavioral differences. Personality has been proved to be very useful in many life outcomes, and there has been huge interests on predicting personality automatically. Previously, there are tremendous amount of approaches successfully predicting personality. However, most previous research on personality detection has used personality scores assigned by annotators based solely on the text or audio clip, and found that predicting self-reported personality is a much more difficult task than predicting observer-report personality. In our study, we will demonstrate how to accurately detect self-reported …
Auracle: Detecting Eating Episodes With An Ear-Mounted Sensor, Shengjie Bi, Tao Wang, Nicole Tobias, Josephine Nordrum, Shang Wang, George Halvorsen, Sougata Sen, Ron Peterson, Kelly Caine, Kofi Odame, Ryan Halter, Jacob Sorber, David Kotz
Auracle: Detecting Eating Episodes With An Ear-Mounted Sensor, Shengjie Bi, Tao Wang, Nicole Tobias, Josephine Nordrum, Shang Wang, George Halvorsen, Sougata Sen, Ron Peterson, Kelly Caine, Kofi Odame, Ryan Halter, Jacob Sorber, David Kotz
Dartmouth Scholarship
In this paper, we propose Auracle, a wearable earpiece that can automatically recognize eating behavior. More specifically, in free-living conditions, we can recognize when and for how long a person is eating. Using an off-the-shelf contact microphone placed behind the ear, Auracle captures the sound of a person chewing as it passes through the bone and tissue of the head. This audio data is then processed by a custom analog/digital circuit board. To ensure reliable (yet comfortable) contact between microphone and skin, all hardware components are incorporated into a 3D-printed behind-the-head framework. We collected field data with 14 participants for …
Saw: Wristband-Based Authentication For Desktop Computers, Shrirang Mare, Reza Rawassizadeh, Ronald Peterson, David Kotz
Saw: Wristband-Based Authentication For Desktop Computers, Shrirang Mare, Reza Rawassizadeh, Ronald Peterson, David Kotz
Dartmouth Scholarship
Token-based proximity authentication methods that authenticate users based on physical proximity are effortless, but lack explicit user intentionality, which may result in accidental logins. For example, a user may get logged in when she is near a computer or just passing by, even if she does not intend to use that computer. Lack of user intentionality in proximity-based methods makes them less suitable for multi-user shared computer environments, despite their desired usability benefits over passwords. \par We present an authentication method for desktops called Seamless Authentication using Wristbands (SAW), which addresses the lack of intentionality limitation of proximity-based methods. SAW …
Entity-Grounded Image Captioning, Annika Lindh, Robert J. Ross, John D. Kelleher
Entity-Grounded Image Captioning, Annika Lindh, Robert J. Ross, John D. Kelleher
Conference papers
An urgent limitation in current Image Captioning models is their tendency to produce generic captions that avoid the interesting detail which makes each image unique. To address this limitation, we propose an approach that enforces a stronger alignment between image regions and specific segments of text. The model architecture is composed of a visual region proposer, a region-order planner and a region-guided caption generator. The region-guided caption generator incorporates a novel information gate which allows visual and textual input of different frequencies and dimensionalities in a Recurrent Neural Network.
Higher-Level Consistencies: Where, When, And How Much, Robert J. Woodward
Higher-Level Consistencies: Where, When, And How Much, Robert J. Woodward
School of Computing: Dissertations, Theses, and Student Research
Determining whether or not a Constraint Satisfaction Problem (CSP) has a solution is NP-complete. CSPs are solved by inference (i.e., enforcing consistency), conditioning (i.e., doing search), or, more commonly, by interleaving the two mechanisms. The most common consistency property enforced during search is Generalized Arc Consistency (GAC). In recent years, new algorithms that enforce consistency properties stronger than GAC have been proposed and shown to be necessary to solve difficult problem instances.
We frame the question of balancing the cost and the pruning effectiveness of consistency algorithms as the question of determining where, when, and how much of a higher-level …
Present A New Method For Energy Efficient Routing For Wireless Body Area Networks, Farshid Bagheri Saravi
Present A New Method For Energy Efficient Routing For Wireless Body Area Networks, Farshid Bagheri Saravi
Student Scholarship
Wireless Body Area Network (WBAN) is a type of wireless sensor network (WSN) that can be used in applications related to the field of health. Wireless body area networks monitor their vital signs by attaching sensors to their bodies and transmitting them to a base station. One of the major challenges of the wireless sensor network is packet routing, which can save energy and reduce network life. This requires accurate and efficient routing of packets to reduce energy consumption in wireless body area networks and increase the lifetime of the network. In this study, a new method of routing in …
Kërcenimi Në Sigurinë E Bazës Së Të Dhënave (Oracle Vs Ms Sql Server), Rasti I Atk-Së, Ragip Avdijaj
Kërcenimi Në Sigurinë E Bazës Së Të Dhënave (Oracle Vs Ms Sql Server), Rasti I Atk-Së, Ragip Avdijaj
Theses and Dissertations
Tani më ne jemi deshmitar se në të gjitha organizatat të vogëla apo të mëdha , private apo publike, shërbimet mvaren nga shërbimet e sistemeve të informacionit. Ku në thelb të çdo sistemi të tillë të informacionit ka një bazë të dhënash. Ashtu edhe te ne në Administratën Tatimore të Kosovës (ATK) zhvillimet dhe shërbimet mvaren nga baza e shënimeve. Këto baza të shënimeve përmbajnë të dhëna të ndijëshme për organizaten dhe për përsonat juridik e fizikë si: informacionet financiare ,transakcionet dhe të gjitha informatat tjera . Organizatat gjithmonë janë përballur me sfidat për mbrojtjen e të dhënave konfidenciale nga …
Semicontinuity Of Betweenness Functions, Paul Bankston, Aisling Mccluskey, Richard J. Smith
Semicontinuity Of Betweenness Functions, Paul Bankston, Aisling Mccluskey, Richard J. Smith
Mathematics, Statistics and Computer Science Faculty Research and Publications
A ternary relational structure〈X,[⋅,⋅,⋅]〉, interpreting a notion of betweenness, gives rise to the family of intervals, with interval [a,b] being defined as the set of elements of X between a and b. Under very reasonable circumstances, X is also equipped with some topological structure, in such a way that each interval is a closed nonempty subset of X. The question then arises as to the continuity behavior—within the hyperspace context—of the betweenness function {x,y}↦[x,y]. We investigate two broad scenarios: the first involves metric spaces and Menger's betweenness interpretation; the second deals with continua and the subcontinuum interpretation.
Domain-Specific Knowledge Exploration With Ontology Hierarchical Re-Ranking And Adaptive Learning And Extension, Grace G. Zhao
Domain-Specific Knowledge Exploration With Ontology Hierarchical Re-Ranking And Adaptive Learning And Extension, Grace G. Zhao
Dissertations, Theses, and Capstone Projects
The goal of this research project is the realization of an artificial intelligence-driven lightweight domain knowledge search framework that returns a domain knowledge structure upon request with highly relevant web resources via a set of domain-centric re-ranking algorithms and adaptive ontology learning models. The re-ranking algorithm, a necessary mechanism to counter-play the heterogeneity and unstructured nature of web data, uses augmented queries and a hierarchical taxonomic structure to get further insight into the initial search results obtained from credited generic search engines. A semantic weight scale is applied to each node in the ontology graph and in turn generates a …