Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Artificial Intelligence and Robotics (7)
- Engineering (3)
- Computer Engineering (2)
- Data Science (2)
- Other Computer Sciences (2)
-
- Social and Behavioral Sciences (2)
- Software Engineering (2)
- Systems Architecture (2)
- Art and Design (1)
- Arts and Humanities (1)
- Cognitive Science (1)
- Communication (1)
- Cybersecurity (1)
- Databases and Information Systems (1)
- Digital Communications and Networking (1)
- Electrical and Computer Engineering (1)
- Graphics and Human Computer Interfaces (1)
- Hardware Systems (1)
- Information Security (1)
- Painting (1)
- Signal Processing (1)
- Social Media (1)
- Social Work (1)
- Statistical Models (1)
- Statistics and Probability (1)
- Keyword
-
- Machine learning (19)
- Deep learning (12)
- Classification (5)
- Convolutional neural networks (5)
- Neural networks (5)
-
- Security (5)
- Big data (4)
- Computer vision (4)
- Data mining (4)
- Malware (4)
- MapReduce (4)
- Twitter (4)
- Analysis (3)
- Android (3)
- Cloud computing (3)
- Crowdsourcing (3)
- Fact-checking (3)
- Graph mining (3)
- MRQL (3)
- Multilayer networks (3)
- Privacy (3)
- Recurrent neural networks (3)
- Social media (3)
- AWS (2)
- Activity recognition (2)
- Apriori (2)
- Baum-Welch algorithm (2)
- Deep Learning (2)
- Deep neural networks (2)
- Degree centrality (2)
- Publication Year
- File Type
Articles 241 - 270 of 365
Full-Text Articles in Computer Sciences
Enabling Context-Aware Applications In Smart Environments, Roman Arora
Enabling Context-Aware Applications In Smart Environments, Roman Arora
Computer Science and Engineering Theses - Archive
Recognizing human activities is an important feature for the development of contextaware applications that are so fundamental to enabling assistive environments. Only once these applications are able to determine the activities that their inhabitants are performing can they assist the individuals and their special needs. In order to do this, it is necessary to build models that can accurately capture and recognize the observed patterns. Equally important is the need to manage and distribute the information that has been inferred, and to provide Quality of Service (QoS) guarantees so that context-aware applications can react effectively to emergent situations. In this …
Query Auditing Against Partial Disclosure, Mayur Motgi
Query Auditing Against Partial Disclosure, Mayur Motgi
Computer Science and Engineering Theses - Archive
Many government agencies, businesses, and nonprofit organizations need to collect, analyze, and report data about individuals in order to support their short-term and long-term planning activities. Statistical Databases therefore contain confidential information such as income, credit ratings, type of disease, or test scores of individuals. Such data are typically stored online and analyzed using sophisticated database management systems (DBMS) and software packages. On one hand, such database systems are expected to satisfy user requests of aggregate statistics related to non-confidential and confidential attributes. On the other hand, the system should be secure enough to guard against a user's ability to …
Peon: Privacy-Enhanced Opportunistic Networks With Applications In Assistive Environments, Gauri Vakde
Peon: Privacy-Enhanced Opportunistic Networks With Applications In Assistive Environments, Gauri Vakde
Computer Science and Engineering Theses - Archive
Opportunistic Networking holds a great deal of potential for making communications easier and more flexible in pervasive assistive environments. However, security and privacy must be addressed to make these communications acceptable with respect to protecting patient privacy. We propose Privacy-Enhanced Opportunistic Networking (PEON), a system for using opportunistic networking in privacy-preserving way. PEON uses concepts from anonymous communications, re-routing messages through groups of peer nodes to hide the relation between the sources and destinations. We describe a set of protocols that explore a practical range of trade-offs between privacy and communication costs by modifying how closely the protocol adheres to …
Web Application Integration Using Mashups, Ronda Hilton
Web Application Integration Using Mashups, Ronda Hilton
Computer Science and Engineering Theses - Archive
The HTML DOM is the W3C standard data model for HTML documents. A web page may be viewed as a tree structure with data nodes at each level, according to the HTML DOM, to enable web applications to access it dynamically. If a web page mashes up more than one web application, the data from one web application may flow as input into another. The user may manually transfer such data piecemeal by using the mouse to cut and paste the displayed text. Instead of this tedious and error-prone repetitious method of data transfer, the mashup may contain a software …
Pseudo-Hierarchical Ant-Based Clustering Using A Heterogeneous Agent Hierarchy And Automatic Boundary Formation, Jeremy Bernard Brown
Pseudo-Hierarchical Ant-Based Clustering Using A Heterogeneous Agent Hierarchy And Automatic Boundary Formation, Jeremy Bernard Brown
Computer Science and Engineering Theses - Archive
The behavior and self-organization of ant colonies has been widely studied and served as the inspiration and source of many swarm intelligence models and related clustering algorithms. Unfortunately, most models that directly mimic ants produce too many clusters and converge too slowly. A wide range of research has attempted to address this issue through various means, but a number of problems remain: 1) Ants must still physically move from one cluster to another through intermediate locations, 2) current methods for remote relocation of an item only consider one movement at time to a particular location and do not consider patterns …
Design And Analysis Of Application Architecture For Opportunistic Networks Using Ad Hoc Wi-Fi, Sankalp Vinod Shere
Design And Analysis Of Application Architecture For Opportunistic Networks Using Ad Hoc Wi-Fi, Sankalp Vinod Shere
Computer Science and Engineering Theses - Archive
In recent years, the number of smartphone users has increased by many folds. In fact, it is estimated to reach 100 million by 2013. Current generation of smartphones has better storage, battery, computing capabilities and they come equipped with short range communication technologies like Bluetooth and Wi-Fi. These improved capabilities coupled with staggering rise in number of users, has prompted growing interest in smartphone applications that help users to communicate with each other directly and over the internet. In particular as a result, when a large number of mobile users can communicate directly with each other during opportunistic contacts when …
Reactive Control Composition For Mobile Manipulators, Binu George Mathew
Reactive Control Composition For Mobile Manipulators, Binu George Mathew
Computer Science and Engineering Theses - Archive
A mobile manipulator is a manipulator mounted on a mobile platform. Due to this combination it has increased mobility compared to a fixed manipulator and increased dexterity compared to a mobile platform. At the same time it has a significantly higher number of degrees of freedom than fixed manipulators or mobile platforms and an increased task and workspace. In particular, the size of the workspace of the manipulator is restricted only by the workspace limitations of the mobile platform and the obstacles around the goal location. In addition, the extra degrees of freedom increase the number of ways in which …
Design And Analysis Of A Mobile File Sharing System For Opportunistic Networks, Gautam Ravendra Chavan
Design And Analysis Of A Mobile File Sharing System For Opportunistic Networks, Gautam Ravendra Chavan
Computer Science and Engineering Theses - Archive
In the past several years, wireless mobile devices with advanced computing, sensing, and storing capabilities have been increasingly developed by handset manufacturers, deployed by wireless carriers, and accepted by consumers. A prominent example is the vast success of Apple's iPhone, which witnessed a sale of 1 million units during the first 3 days of sales for its new version iPhone 3GS. As a result of the increasing popularity of these mobile devices, users can carry, utilize, and exchange information embedded therein, ideally wherever they go and whenever they want. A prominent scenario is where information is exchanged among users when …
The Reputation System For Robust, Structured P2p Systems, Apurv Ashok Dhadphale
The Reputation System For Robust, Structured P2p Systems, Apurv Ashok Dhadphale
Computer Science and Engineering Theses - Archive
Structured peer-to-peer systems are distributed communication systems that typically use Distributed Hash Table (DHT) indexing to efficiently locate the resources. These networks are highly scalable and can route the messages correctly even for the extremely dynamic environment. But these networks are vulnerable; even a small fraction of malicious nodes can bias the lookup results when they are present on a lookup path. In our thesis, we address this problem of reliably searching the insecure p2p networks. We propose a reputation system to reduce the number of failed lookups and make the networks more robust. For our study, the concept is …
Liquid: A Detection Resistant Covert Timing Channel Based On Ipd Shaping, Robert J. Walls
Liquid: A Detection Resistant Covert Timing Channel Based On Ipd Shaping, Robert J. Walls
Computer Science and Engineering Theses - Archive
Covert timing channels provide a way to surreptitiously leak information from an entity in a higher-security level to an entity in a lower level. The difficulty of detecting or eliminating such channels makes them a desirable choice for adversaries that value stealth over throughput. When one considers the possibility of such channels transmitting information across network boundaries, the threat becomes even more acute. A promising technique for detecting covert timing channels focuses on using entropy-based tests. This method is able to reliably detect known covert timing channels by using a combination of entropy and conditional entropy to detect anomalies in …
Location Privacy In Sensor Networks Against A Global Eavesdropper, Kiran K. Mehta
Location Privacy In Sensor Networks Against A Global Eavesdropper, Kiran K. Mehta
Computer Science and Engineering Theses - Archive
While many protocols for sensor network security provide con dentiality for the content of messages, contextual information usually remains exposed. Such contextual information can be exploited by an adversary to derive sensitive information such as the locations of monitored objects and data sinks in the eld. Attacks on these components can signi cantly undermine network applications. The existing techniques defend the leakage of location information only from an adversary who sees only local network tra c. However, a stronger adversary, the global eavesdrop- per, is realistic and can defeat all existing techniques. This paper rst formalizes the location privacy issues …
Automated Integration Of Biomedical Information For The Support Of Genome-Wide Association Studies, Abhijit R. Tendulkar
Automated Integration Of Biomedical Information For The Support Of Genome-Wide Association Studies, Abhijit R. Tendulkar
Computer Science and Engineering Theses - Archive
Genome-wide association studies of the genetic underpinnings of complex phenotypes, and human diseases in particular, have been steadily gaining momentum over the past several years. Yet, the number of polymorphic sites in the human genome, including, but not limited to, Single Nucleotide Polymorphisms (SNPs) is so large that identifying the combination of these few which have a significant effect on the condition of interest remains an overwhelming task. The goal of this thesis work was to identify biologically and medically relevant SNPs which could be the best possible candidates for further association studies. In this thesis we present a new …
High Performance Cluster And Grid Computing Solutions For Science, Umeshkumar Ashok Keswani
High Performance Cluster And Grid Computing Solutions For Science, Umeshkumar Ashok Keswani
Computer Science and Engineering Theses - Archive
Computing for science has very peculiar requirements. There is an enormous amount of data to analyze to get useful information. This requires greater computing power, huge data storage and high-capacity network. High Performance Computing (HPC) is the perfect solution that satisfies these requirements. Here, we look at two high performance implementations that provide useful solutions to computing problems in science, making possible scientific experiments and discoveries that otherwise would not have been possible.
Computational Analysis Of Variability Of Recombination In Mice, Vishnukumar Galigekere Nagabhushana
Computational Analysis Of Variability Of Recombination In Mice, Vishnukumar Galigekere Nagabhushana
Computer Science and Engineering Theses - Archive
Rapid advances in engineering and technology have fueled research in areas such as molecular biology and genetics to a new level and thus have given birth to multidisciplinary fields like bioinformatics and computational biology. These fields involve the application of one's expertise in one or more areas including computer science, information science, statistics, chemistry and mathematics to solve problems related to biology in general and molecular biology and genetics in particular. It is a challenging research area which requires one to grasp diverse fields at almost equal rigor and at the same time provides new insights into the fascinating field …
The Dynamics Of Salsa: A Structured Approach To Large-Scale Anonymity, Safwan Mahmud Khan
The Dynamics Of Salsa: A Structured Approach To Large-Scale Anonymity, Safwan Mahmud Khan
Computer Science and Engineering Theses - Archive
Anonymity provides a technical solution for protecting one's online privacy. Highly distributed peer-to-peer (P2P) anonymous systems should have better distribution of trust and more scalability than centralized approaches, but existing systems are vulnerable to attacks as they require nodes to have global knowledge of the system. To overcome these problems and to provide more secure, distributed organization for P2P anonymity systems, prior work proposed the Salsa system. Salsa is designed to select nodes to be used in anonymous circuits randomly from the full set of nodes, even though each node has knowledge of only a small subset of the network. …
Cap: A Context-Aware Privacy Protection System For Location-Based Services, Aniket Pingley
Cap: A Context-Aware Privacy Protection System For Location-Based Services, Aniket Pingley
Computer Science and Engineering Theses - Archive
Location Based Services (LBS) are information services that provide users with customized contents, such as the nearest restaurants/hotels/clinics, retrieved from a dedicated spatial database. They make use of technologies such as Global Positioning System (GPS), triangulation/triliteration etc. to get the geographical position of the user. Since the queries on spatial database include the user's current location, LBS may raise serious concerns on the user's location privacy. If disclosed, a user's location information may be misused in many ways by a malicious adversary who has access to the LBS server or even by the LBS provider. Therefore, our aim in this …
High-Level Constraint Support For Combinatorial Testing, Anthony C. Opara
High-Level Constraint Support For Combinatorial Testing, Anthony C. Opara
Computer Science and Engineering Theses - Archive
Combinatorial testing constructs test cases by combining different input parameter values based on some effective combinatorial strategy. This software testing approach has displayed very promising attributes and is rapidly gaining popularity in recent years. However, existing work does not provide adequate support for constraint handling. Constraints are often specified as part of an input parameter model and they may be due to several reasons such as incompatibility between certain hardware and software components. A test generation algorithm needs to take these constraints into account during the test generation process to exclude combinations that are invalid from the domain semantics. In …
Stepping-Stone Network Attack Kit (Sneak) For Evading Timing-Based Detection Methods Under The Cloak Of Constant Rate Multimedia Streams, Jaideep D. Padhye
Stepping-Stone Network Attack Kit (Sneak) For Evading Timing-Based Detection Methods Under The Cloak Of Constant Rate Multimedia Streams, Jaideep D. Padhye
Computer Science and Engineering Theses - Archive
With the advent of the Internet, network-based security threats have been constantly on the rise. The source of an attack could be traced by studying the system logs and the source IP address of the attack can be used to identify and prosecute the attacker. To avoid getting traced and to mislead the forensic investigators, attackers usually compromise weaker nodes on less secure networks and use them as stepping stones to attack the victim. This technique makes it difficult for the investigators to trace the real source of attack. Hence, it is important to research the stepping stone detection techniques …
Efficient Processing Of Set Queries Using Bitmap Index, Muhammad Assad Safiullah
Efficient Processing Of Set Queries Using Bitmap Index, Muhammad Assad Safiullah
Computer Science and Engineering Theses - Archive
Growing complexity of enterprise-wide data and business processes necessitates the efficiency of complex decision support set queries. However, contemporary DBMS remain unsuccessful in handling set queries efficiently. In this thesis we propose efficient set query processing methods using bitmap index. The methods use bitmap vectors to represent attributes values in binary format. The methods test groups within a schema in a hierarchical fashion. Satisfying groups are bisected further and checked recursively while non-satisfying groups are pruned resulting in significant reduction in response times. In addition, our iterative implementation avoids the inefficiency that can be introduced by recursive implementation by reading …
An Assistive Navigation Paradigm For Semi-Autonomous Wheelchairs Using Force-Feedback And Goal Prediction, John H.C. Staton
An Assistive Navigation Paradigm For Semi-Autonomous Wheelchairs Using Force-Feedback And Goal Prediction, John H.C. Staton
Computer Science and Engineering Theses - Archive
As computer technology advances and facilitates an increased amount of autonomous sensing and control, the interface between the human and autonomous computer systems becomes increasingly important. This applies in particular in the realm of service robotics where robots with increasing levels of autonomy are constantly interacting with human users and where it is paramount to have an efficient way to convey user intentions and commands to the robot system, integrate them into the robot's action and control, and to indicate robot control choices to the user in a "natural", intuitive way. One particular example where semi-autonomous operation of a vii …
An Influenza Virus Molecular Infection Model And Discrete Event, Stochastic Simulation., Richard Burke Squires
An Influenza Virus Molecular Infection Model And Discrete Event, Stochastic Simulation., Richard Burke Squires
Computer Science and Engineering Theses - Archive
Influenza virus is responsible for the greatest pandemic in human history causing 20 - 40 million deaths worldwide during the 1918 flu season. In 1997 fears of a future pandemic arose with the discovery of a new strain of H5N1 avian influenza. In an effort to better understand the dynamics of influenza infection a new model of influenza virus infection at the molecular level has been developed. Comprising nineteen stages and five molecular types (mRNA, cRNA, vRNA, vRNP and proteins) the FluSim model consists of the major contributing pathogen factors to influenza infection. A discrete event, stochastic simulation based upon …
Hierarchical Reinforcement Learning Using Automatic Task Decomposition And Exploration Shaping, Predrag Djurdjevic
Hierarchical Reinforcement Learning Using Automatic Task Decomposition And Exploration Shaping, Predrag Djurdjevic
Computer Science and Engineering Theses - Archive
Reinforcement learning agents situated in real world environments have to be able to address a number of challenges in order to succeed at accomplishing a wide range of tasks over their lifetime. Among these, such systems have to be able to extract control knowledge from already learned tasks and apply them to subsequent ones in order to allow the agent to accomplish the new task faster and to accelerate the learning of an optimal policy. To address skill reuse and skill transfer, a number of approaches using hierarchical state and action spaces have been introduced recently which build on the …
Texture Measurement And Skid Number Prediction Using Laser Data Acquisition, Digital Signal Processing, And Neural Networks, John Michael Kebrle
Texture Measurement And Skid Number Prediction Using Laser Data Acquisition, Digital Signal Processing, And Neural Networks, John Michael Kebrle
Computer Science and Engineering Theses - Archive
Real-time estimation of the skid number of pavement is difficult. Traditional methods of volumetric measurement are cumbersome and time consuming. It is desired to enable prediction of the skid number of pavement using non-contact means, and to doso using a method which provides a reasonable estimate of the pavements skid number. This research used laser data acquisition of macro-texture, Digital Signal Processing and Neural Networks to estimate the skid number of pavement to a reasonable degree. The research used Digital Signal Processing to identify potentially bad data sets, and a Neural Network model for predicting skid number on the refined …
Enhancing Jswat For Monitor-Based Executions, Arun Ramani
Enhancing Jswat For Monitor-Based Executions, Arun Ramani
Computer Science and Engineering Theses - Archive
Concurrent programs contain more than one thread that executes concurrently to accomplish a particular task. Since the threads in a concurrent program work together to accomplish a common goal, they share the data, code, resources and address space of their process. This reduces the overhead involved in creating and managing the threads but leads to side effects like race conditions, critical section problem and deadlocks. There are several operating system constructs to solve these issues such as locks, semaphores, monitors etc. Locks are associated with each object to control access of shared resources. Semaphores can be described as counters used …
Visualization Of Monitor-Based Executions, Keerthika Koteeswaran
Visualization Of Monitor-Based Executions, Keerthika Koteeswaran
Computer Science and Engineering Theses - Archive
Concurrent programs play a vital role in the world of software engineering. Concurrent programs are used in various fields such as safety critical applications, applications involving advanced graphical user interface, operating system implementation etc. Concurrent programs due to their inherent multi-threaded nature pose a challenge to software engineers not only in coding but also in ensuring data consistency and accuracy. One of the important software constructs used by concurrent programmers to handle critical sections and data synchronization is monitors. A monitor is an encapsulation of shared data, operations on the data and any synchronization required to access the data~\cite{CarTai06:ModMulti}. Monitors …
Increasing Localization Precision In Sensor Networks With Mobile Beacons - A Genetic Path Planning Approach, Awais Iqbal
Increasing Localization Precision In Sensor Networks With Mobile Beacons - A Genetic Path Planning Approach, Awais Iqbal
Computer Science and Engineering Theses - Archive
This work describes a genetic algorithm based approach to approximate an optimal path for a mobile beacon node in a grid of stationary wireless sensors. As the beacon moves over the field of sensors it broadcasts its location. Sensors that are currently in the proximity of the beacon will receive this communication and can then use several of these messages to compute estimates on their locations. An optimal path is defined as a path that will result in the highest overall precision of location estimates among sensors given a maximum path length for the beacon. We assume that sensors are …
A Particle Filter Based Framework For Indoor Wireless Localization Using Custom Ieee 802.15.4 Nodes, Vijay Vasant Dixit
A Particle Filter Based Framework For Indoor Wireless Localization Using Custom Ieee 802.15.4 Nodes, Vijay Vasant Dixit
Computer Science and Engineering Theses - Archive
Locating people and objects as soon as possible and fair amount of precision has always been an important part of any organization or industry, especially in manufacturing, healthcare, and logistics. Systems that now have the ability to locate objects or people are called Real Time Location Systems (RTLS). They typically use small low-power transmitters called tags attached to assets (or worn by people) as well as sets of readers that map the location of these tags. Systems that map the longitude and attitude of an object are geo-location systems and generally use GPS for location mapping. Systems that map a …
Dynacet: A Minimum-Effort Driven Dynamic Faceted Search System Over Structured Databases, Haidong Wang
Dynacet: A Minimum-Effort Driven Dynamic Faceted Search System Over Structured Databases, Haidong Wang
Computer Science and Engineering Theses - Archive
In this thesis, we propose minimum-effort driven navigational techniques for enterprise database systems based on the faceted search paradigm. Our proposed techniques dynamically suggest facets for drilling down into the database such that the cost of navigation is minimized. At every step, the system asks the user a question or a set of questions on different facets and depending on the user response, dynamically fetches the next most promising set of facets, and the process repeats. Facets are selected based on their ability to rapidly drill down to the most promising tuples, as well as on the ability of the …
Modeling And Simulation Of A General Motors Conveyor System Using A Custom Decision Optimizer, Mirza Mohammad Lutfe Elahi
Modeling And Simulation Of A General Motors Conveyor System Using A Custom Decision Optimizer, Mirza Mohammad Lutfe Elahi
Computer Science and Engineering Theses - Archive
The temporal behavior of conveyor systems can be modeled using discrete event (DE) simulations. DE modeling provides a quick and cost effective method for analyzing complex problems as different scenarios can be tested rapidly without affecting the day to day activities of production systems. A simulation model coupled with decision optimization on routing choices enables the evaluation of different decision strategies.In the General Motors paint shop at Arlington, Texas, the complex conveyor system moving cars to the paint booths has been observed to mix up same color batches of cars coming from the body shop. At the paint booth, every …
Use Of Wireless Signal Characteristics For Mobile Robotics Localization And Access Point Mapping, Joshua Davies
Use Of Wireless Signal Characteristics For Mobile Robotics Localization And Access Point Mapping, Joshua Davies
Computer Science and Engineering Theses - Archive
Mobile robotics is an interesting and challenging emerging field in computer science.To properly achieve true autonomy, a robot must be able to determine where it is in relationshipto a global frame of reference and it must be able to do so with a minimum of interaction fromhuman operators and impose as few constraints on its surroundings as possible. The uncertainnature of mobility and perception requires that advanced probabilistic inference techniques beapplied to minimize error. This work examines the applicability of radio-frequency signals to the mobile robotlocalization problem to localize quickly over a wide area. Particle filtering techniques areemployed to adjust …