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 271 - 300 of 365
Full-Text Articles in Computer Sciences
Towards An Implementation Of Avoip: Anonymous Voice-Over-Ip, Bikas Raj Gurung
Towards An Implementation Of Avoip: Anonymous Voice-Over-Ip, Bikas Raj Gurung
Computer Science and Engineering Theses - Archive
Voice over IP (VoIP) is one of the fastest growing telecommunicaiton market today. However with great popularity comes greater security risk. When we communicate over the Internet we expose our identity to all the prying eyes, even if we do not want to. Even though VoIP data can be secured by using encryption, sometimes the relationships between users can be sensitive. To provide stronger privacy for these users, we propose anonymous VoIP (aVoIP) - a means to secure user privacy in VoIP. The biggest challenge in introducing anonymity to VoIP system is in providing acceptable Quality of Service (QoS). Users …
Temporal Potential Function Approach For Path Planning In Dynamic Environments, Vamsikrishna Gopikrishna
Temporal Potential Function Approach For Path Planning In Dynamic Environments, Vamsikrishna Gopikrishna
Computer Science and Engineering Theses - Archive
A Dynamic environment is one in which either the obstacles or the goal or both are in motion. In most of the current research, robots attempting to navigate in dynamic environments use reactive systems. Although reactive systems have the advantage of fast execution and low overheads, the tradeoff is in performance in terms of the path optimality. Often, the robot ends up tracking the goal, thus following the path taken by the goal, and deviates from this strategy only to avoid a collision with an obstacle it may encounter. In a path planner, the path from the start to the …
Adapting Harmonic Function Path Planning: To Reflect User Motion Preferences, Giles John D'Silva
Adapting Harmonic Function Path Planning: To Reflect User Motion Preferences, Giles John D'Silva
Computer Science and Engineering Theses - Archive
Every human in the real world has a unique motion preference while moving to achieve a given task. These preferences could be expressed by moving in a straight line, following the wall along a corridor, avoiding sharp turns, preferring hard flat surfaces over damp uneven surfaces, choosing the shortest path to the goal or by giving a high priority towards safety by maintaining a definite distance from obstacles. To automatically incorporate user preferences into motion planning we could extract the trajectories taken by the user to achieve a task in a given local vironment and attempt to use them in …
Distributed Predictive Health Monitoring, Jorge David Herrera Gonzalez
Distributed Predictive Health Monitoring, Jorge David Herrera Gonzalez
Computer Science and Engineering Theses - Archive
According to the National Center for Health Statistics the major causes of death in the US are (per year) heart diseases with 654 thousand cases, followed by cancer with 550 thousand cases and stroke with 150 thousand cases. In this project we propose, design, implement and test a prototype of a system that promises to improve the level of detection and prediction of several diseases and improves the quality of life of patients by utilizing non-invasive wireless medical sensors. This system is composed of a set of wireless medical sensors, a nearby (close-proximity) PDA (personal digital accessory) or cell phone …
Cxlengine - A Comprehensive Xml Loosely Structured Search Engine, Indhu Krishna Sivaramakrishnan
Cxlengine - A Comprehensive Xml Loosely Structured Search Engine, Indhu Krishna Sivaramakrishnan
Computer Science and Engineering Theses - Archive
XML keyword search has been a widely researched area. [15] has proposed an XML semantic search engine called OOXSearch, which answers loosely structured queries. The framework of OOXSearch takes into account the semantic relationship between nodes based on their contexts. The context of a node is determined by its parent node. The label "name", for example, could mean the name of a book and could also mean the name of the book's author. If we try to consider the relationship between these two nodes without considering their parent nodes, we would be drawing the incorrect conclusion that these two nodes …
Limitations Of Ieee 802.15.4 Based Wireless Mesh Networks For Wireless Localization, William Anthony Wallace
Limitations Of Ieee 802.15.4 Based Wireless Mesh Networks For Wireless Localization, William Anthony Wallace
Computer Science and Engineering Theses - Archive
It is highly desirable to create rapidly and inexpensively deployable mesh networks in certain scenarios. Consider the case of a large storage warehouse; workers are constantly moving in the area and not only do they need to send data periodically but their location needs to be tracked as well. Setting up such network can be accomplished with the IEEE 802.15.4 standard, but a mesh network must be created. There would need to be stationary 802.15.4 nodes that join together to form a backbone infrastructure. This backbone infrastructure (mesh network) would allow the workers, using mobile 802.15.4 nodes, to transmit their …
Subrosa: An Experimental Platform For Studying Timing Analysis Of Real Time Anonymity Systems, Hatim Asger Daginawala
Subrosa: An Experimental Platform For Studying Timing Analysis Of Real Time Anonymity Systems, Hatim Asger Daginawala
Computer Science and Engineering Theses - Archive
Timing analysis poses a significant challenge for the mix based anonymous systems that wish to support low-latency applications like web browsing, instant messaging and Voice over IP (VOIP). Research in this area so far has been done through simulations on ad hoc simulators or non practical local area networks. We developed SubRosa, an experimental platform for studying timing analysis of real time anonymity systems to facilitate the study of Tor like low-latency anonymous systems. We present results of experiments on a real distributed network test bed PlanetLab, where we studied timing analysis attacks and some of the defenses to protect …
Panda Monitoring - A System To Monitor High Performance Computing For The Atlas Experiment-Design, Development,Implementation And Deployment, Prem A. Thilagar
Panda Monitoring - A System To Monitor High Performance Computing For The Atlas Experiment-Design, Development,Implementation And Deployment, Prem A. Thilagar
Computer Science and Engineering Theses - Archive
Grid resources are gaining wide importance in the wake of experiments such as ATLAS aiding in a bigger goal to understand the complexities of nature. The need for a good monitoring system is realized as grid resources are being implemented widely. This work is an analysis of the existing monitoring system of the Panda which is a grid middleware for the ATLAS experiment running in CERN. The thesis aims at identifying the key bottlenecks of the current monitor and speaks about the implementation of a new monitor for the same .The new monitor which is being designed with scalability and …
Distinct Value Estimation By Sampling On Unstructured Peer To Peer Networks, Zubin Matthew Joseph
Distinct Value Estimation By Sampling On Unstructured Peer To Peer Networks, Zubin Matthew Joseph
Computer Science and Engineering Theses - Archive
Peer-to-Peer networks have become very popular on the Internet, with millions of peers all over the world sharing large volumes of data. The sheer scale of these networks has made it difficult to gather statistics that could be used for building new features. This thesis presents a technique of obtaining estimations of the number of distinct values matching a query on the network. The method is then analyzed by considering simulation results that demonstrate its effectiveness and flexibility in supporting a variety of queries and applications.
Building Energy-Efficient Broadcast Trees Using A Genetic Algorithm In Wireless Sensor Networks, Min Kyung An
Building Energy-Efficient Broadcast Trees Using A Genetic Algorithm In Wireless Sensor Networks, Min Kyung An
Computer Science and Engineering Theses - Archive
In wireless broadcast environment, data can be transmitted to several nodes by a single transmission. The nodes in that environment have limited energy resources; therefore we need to reduce the energy consumption when they broadcast data to all nodes to prolong the lifetime of the networks. We call this problem the MPB (minimum power broadcast) problem, and solving the problem has been shown to be an NP-Complete problem [2], [11]. We focus on finding 'near-optimal' solutions for the problem. An algorithm for constructing the minimum power broadcast trees, named BIP (broadcast incremental power) algorithm, was first proposed by Wieselthier et …
M-Infosift : A Graph-Based Approach For Multiclass Document Classification, Aravind Venkatachalam
M-Infosift : A Graph-Based Approach For Multiclass Document Classification, Aravind Venkatachalam
Computer Science and Engineering Theses - Archive
With the increase in the amount of data being introduced into the Internet on a daily basis, the problem of managing large amount of data is an unavoidable problem. The area of document classification has been examined, explored and experimented as a technique for organizing and managing vast repositories of electronic documents such as emails, text and web pages. Over the past decade, several approaches such as machine learning, data mining, information retrieval and others have been proposed for addressing this problem of classifying electronic documents. While a majority of these techniques rely on extracting high-frequency keywords, they ignore the …
Resource Adaptive Agent Based Fault Tolerant Architecture, Shreyas Shetty
Resource Adaptive Agent Based Fault Tolerant Architecture, Shreyas Shetty
Computer Science and Engineering Theses - Archive
Pervasive environment consists of increasing number of mobile, tiny and heterogeneous devices communicating through interconnected network. As ubiquitous computing has seeped into various aspects of everyday life, there has been an increasing demand for dependable systems. However providing reliability demands fault tolerance mechanisms that require substantial time and resources. The dynamic nature and the uncertainty associated with pervasive systems coupled with the energy constraints of the devices involved makes fault tolerance a challenging task. In general, the techniques used to provide fault-tolerance are based on having redundancy and duplication of the user tasks. However the additional cost and the low …
Incremental Retrieval And Ranking Of Complex Patterns From Text Repositiories, Jayakrishna Thathireddy
Incremental Retrieval And Ranking Of Complex Patterns From Text Repositiories, Jayakrishna Thathireddy
Computer Science and Engineering Theses - Archive
As the volume of information accessible via the electronic medium (such as the Internet) is staggeringly large and growing rapidly, users have to sift through vast reservoirs of information to retrieve relevant data of their choice. It has been estimated that, the Internet consists of 2.5 billion unique, publicly accessible web-pages and this figure is growing at an alarming rate of 7.3 million pages per day. Currently, the only way to wade through such colossal information is by using search engines (such as Google, Live, Yahoo, etc.). Although the popularity of search engines has increased manifold due to -- simplicity …
Top K Query Processing In Distributed Database, Amrita Tamrakar
Top K Query Processing In Distributed Database, Amrita Tamrakar
Computer Science and Engineering Theses - Archive
Today's data is rarely stored in centralized location due to the enormous amount of information that needs to be stored and also to increase reliability, availability and performance of the system. Same data is stored in different format into different company's database as well as they may be partitioned or replicated. We consider various scenarios of distributed database such as horizontal, vertical fragmentation and attribute overlapping. Allowing access to integrated information from these multiple datasets can provide accurate and wholesome information to the end-user. We research on efficient querying to these distributed databases to get top k elements matching the …
Sequence Alignment Editor - A New Tool To Assist With Inferring Phylogenetic And Functional Relationships In Biological Data, Ramya Raghukumar
Sequence Alignment Editor - A New Tool To Assist With Inferring Phylogenetic And Functional Relationships In Biological Data, Ramya Raghukumar
Computer Science and Engineering Theses - Archive
Biologists study evolution, discover functional and structural information in genomic or protein data through the extensive use of sequence alignments. It is very difficult to manually align long regions, so development of methods for this task continues to be an active area of research. Alignment construction algorithms, based on dynamic programming, approach the problem from a mathematical perspective. The optimal alignment is computed relative to a scoring scheme. The resulting layout is guaranteed to be mathematically optimal, though not necessarily biologically meaningful. Sequence alignments usually account only for single letter substitutions and relatively short indels, representing the latter as gaps. …
Performance Analysis Of Caching Effect On Real Time Packet Processing In A Multi-Threaded Processor, Miao Ju
Performance Analysis Of Caching Effect On Real Time Packet Processing In A Multi-Threaded Processor, Miao Ju
Computer Science and Engineering Theses - Archive
Caching has been time proven to be a very effective technique to improve memory access speed and average performance for general processors. Based on the real-world trace simulation, earlier research showed that cache can help improve the route lookup and packet classification performance in a Network Processor (NP). However, the existing studies did not take the packet delay/loss constraints into account. As a result, how effective the caching technique is, in dealing with traffic under stringent delay/loss constraints (as is the case for router interface using an NP for packet processing), is still an open issue. In this thesis, we …
Rate Control Algorithms For Ieee 802.11 Wireless Networks, Bodhisatwa Chakravarty
Rate Control Algorithms For Ieee 802.11 Wireless Networks, Bodhisatwa Chakravarty
Computer Science and Engineering Theses - Archive
This thesis evaluates software driven rate selection algorithms used in IEEE 802.11 wireless network interface cards. The motive of the bit-rate selection techniques is to optimize the throughput over the wireless network out of the many rates that are supported by the IEEE 802.11 link. The decision to switch from one rate to another with the changing link conditions to optimize the throughput is the primary focus of the bit-rate selection algorithms. Due to the uncertainty in the channel quality, it is a challenge to make the correct decision so as to minimize the wastage of network resources and achieve …
Dynamic Push And Pull Strategy Based On Data Interpolation For Web Sensor Networks, Rohita Mohan
Dynamic Push And Pull Strategy Based On Data Interpolation For Web Sensor Networks, Rohita Mohan
Computer Science and Engineering Theses - Archive
Sensor Web, a new trend has been developed recently to effectively network large scale deployed heterogeneous sensors with Internet to make sensor data discoverable, accessible and controllable via World Wide Web. Since sensor nodes are highly resource constrained, continuous back hauling of a large amount of data is not feasible. In this paper, we propose a dynamic push/pull service architecture where sensory quality is dynamically monitored and controlled. The architecture is implemented in a web proxy residing at the gateway of the network. As data is being pushed continuously from the network for effective sketching of the sensing field, interpolation …
Sees - An Adaptive Multimodal User Interface For The Visually Impaired, Aparajit Saigal
Sees - An Adaptive Multimodal User Interface For The Visually Impaired, Aparajit Saigal
Computer Science and Engineering Theses - Archive
The enormous amount of electronic data present today can be a daunting task to access and process for a regular person, let alone someone with a disability. The World Wide Web and Electronic Mail have transformed the way we live. We are constantly become more dependent on this information, communication and commerce medium. The Speech Enabled Email System (SEES) is an alternate user interface that allows for the retrieval of emails and RSS feeds using speech. SEES can be accessed via a desktop application or through a telephony interface such as a regular phone-line or Voice over IP. This thesis …
Flash Crowd Mitigation System, Dongchul Kim
Flash Crowd Mitigation System, Dongchul Kim
Computer Science and Engineering Theses - Archive
Flash crowd means that a web server suffers a sudden surge of traffic since a large number of Internet users access the web server simultaneously. Once a flash crowd occurs in a web server, the response rate for the HTTP requests decreases rapidly, or the web server may even crash. To protect the web server from such flash crowds, in this paper, we propose the Flash Crowd Mitigation System (FCMS) which is based on the cooperation of the web servers and the redirection of the HTTP request. In FCMS, when a flash crowd is predicted by the traffic monitoring module …
Heros: A Patient-Centered Goal-Directed Electronic Medical Record System For The Homeless, Kallol Silas Mahata
Heros: A Patient-Centered Goal-Directed Electronic Medical Record System For The Homeless, Kallol Silas Mahata
Computer Science and Engineering Theses - Archive
Homelessness is a growing problem in the United States. Numerous barriers keep the street homeless from obtaining healthcare. Medical Street Outreach (MSO) programs are designed to reach out to the homeless. Gathering relevant clinical information on the streets is difficult, and carrying paper records in MSO is cumbersome and inefficient. Several complex healthcare record systems have been developed for hospitals, but no such system exists for collecting health data on the streets. In this thesis, we describe a light weight Electronic Medical Record (EMR), called HEROS (Homeless Electronic RecOrd System) that we have built to address the process of healthcare …
Medical Decision Support System Using Augmentable Guideline Engine, Adetayo Afolabi Aiyedun
Medical Decision Support System Using Augmentable Guideline Engine, Adetayo Afolabi Aiyedun
Computer Science and Engineering Theses - Archive
Increasing life expectancy accompanied by existing growth of wireless infrastructure and ubiquitous computing technologies has given healthcare providers access to vital information within their healthcare networks. Medical decision support systems (MDSS) play an increasingly important role in medical practice by assisting physicians with making clinical decisions. MDSS are interactive computer programs, which are designed to assist physicians and other health professionals with decision making. Currently, the strategies for providing MDSS has failed, in part, because they have not provided a secure, timely access to information that is current, ability to modify their knowledge base without hard coding them in their …
Efficient Visualization Of Streaming Sensor Network Data Using Approximation Technique, Sunil Pai
Efficient Visualization Of Streaming Sensor Network Data Using Approximation Technique, Sunil Pai
Computer Science and Engineering Theses - Archive
By commanding a large number of wireless sensor nodes capable of sensing, communicating, and computing, wireless sensor networks have revealed their vast potential in a plethora of applications. However, due to the stringent resources limitations on each sensor node ranging from energy and computation to network bandwidth and storage, efficient and light weight systems must be designed in order to accommodate the resource limited environment. Furthermore, due to the potentially large number of sensor nodes deployed, the amount of sensory data gathered therein can be overwhelming for processing and visualizing in a resource limited central controller, such as mobile devices. …
Hiearchical Overlay For Service Composition In Pervasive Environments, Aparna Kailas
Hiearchical Overlay For Service Composition In Pervasive Environments, Aparna Kailas
Computer Science and Engineering Theses - Archive
The objective of pervasive computing is to allow users to perform their tasks in a transparent way regardless of device features. Resources on devices should be exploited to provide services in order to perform user tasks. When there is no exact match for the user task in the environment, the capabilities of available devices should be combined to perform the user task. Seamless Service Composition (SeSCo) abstracts device capabilities as services and leverages existing work on graph algorithms to perform service composition. A lightweight framework, PerSON (Service Overlay Network for Pervasive Environments) was developed to provide a service overlay network …
A Dynamic Framework For Testing The Synchronization Behavior Of Java Monitors, Andres Yanes
A Dynamic Framework For Testing The Synchronization Behavior Of Java Monitors, Andres Yanes
Computer Science and Engineering Theses - Archive
A Java monitor is a specialized class that is used to synchronize the behavior of threads in a Java program. The monitors in a Java program must be adequately tested to ensure the correctness of the program. In this thesis we propose a dynamic framework in which a Java monitor is tested by exploring its state space in a depth-first manner. The state exploration procedure consists of dynamically creating method sequences to exercise the possible synchronization behavior of the monitor. During exploration, new threads will be created on the fly to simulate different scenarios that result from threads reaching the …
Computing Best Coverage Path In The Presence Of Obstacles In Wireless Sensor Networks, Senjuti Basu Roy
Computing Best Coverage Path In The Presence Of Obstacles In Wireless Sensor Networks, Senjuti Basu Roy
Computer Science and Engineering Theses - Archive
Given a set S = {S1,...,Sn} of n homogeneous wireless sensors deployed in a two dimensional area, a source point s and a destination point t, the least protected point p along a path (s,t) is that point such that the Euclidean distance between p and its closest sensor node Si is maximum. This distance between p and S_{i} is called the Cover value of the path P(s,t). The Best Coverage Path between s and t, denoted as BCP(s,t), is the path that has the minimum cover value. Although there exists efficient algorithms to compute BCP in O(n log n) …
A Random Walk Approach To Sampling Hidden Databases, Arjun Dasgupta
A Random Walk Approach To Sampling Hidden Databases, Arjun Dasgupta
Computer Science and Engineering Theses - Archive
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden back-end database to provide answers to user queries. Generating a uniform random sample of this hidden database by using only the publicly available interface gives us access to the underlying data distribution. In this thesis, we propose a random walk scheme over the query space provided by the interface to sample such databases. We discuss variants where the query space is visualized as a fixed and random ordering of attributes. We also propose techniques to further improve the …
Tracing And Replay Of Real-Time Concurrent Programs In Vxworks, Daxa Keshavji Patel
Tracing And Replay Of Real-Time Concurrent Programs In Vxworks, Daxa Keshavji Patel
Computer Science and Engineering Theses - Archive
Real-time concurrent programs are difficult to analyze, debug and test because of the existence of race conditions. In particular, cyclic debugging requires the ability to reproduce a failed execution. That is, when a failure is observed during a test run, it is often necessary to reproduce the test run as an effort to locate the bug that has caused the failure. However because of the variations in thread scheduling and signal latency, a real-time concurrent execution may not be reproduced simply by re-executing the program under test. In this thesis, we describe a language-based framework for tracing and replay of …
Performance Analysis Of The Beacon Period Contraction Mechanism In Wimedia Mac For Uwb, Shenjin Sun
Performance Analysis Of The Beacon Period Contraction Mechanism In Wimedia Mac For Uwb, Shenjin Sun
Computer Science and Engineering Theses - Archive
The WiMedia MAC for UWB based WPANs is currently preferred among standards for wireless network since it requires non-infrastructure for ad hoc network, and also supports for Quality of Service (QoS). Without infrastructure, coordination of devices within radio range is achieved by the exchange of beacon frames, which is an overhead in WiMedia MAC, since no data transmission is allowed during Beacon Period (BP). In a dynamic network, devices might leave or join in, so beacon slots will be released or reoccupied with the changing of network. And BP contraction mechanism is aimed at reusing the released beacon slots in …
Runtime Optimization And Load Shedding In Mavstream: Design And Implementation, Balakumar Kendai
Runtime Optimization And Load Shedding In Mavstream: Design And Implementation, Balakumar Kendai
Computer Science and Engineering Theses - Archive
In data stream processing systems Quality of Service (or QoS) is extremely important. The system should try its best to meet the QoS requirements specified by a user. On account of this difference, unlike in a database management system, a query cannot be optimized once and executed. It has been shown that different scheduling strategies are useful in trading tuple latency requirements with memory and throughput requirements. In addition, data stream processing systems may experience significant fluctuations in input rates. In order to meet the QoS requirements of data stream processing, a runtime optimizer equipped with several scheduling and load …