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 301 - 330 of 365
Full-Text Articles in Computer Sciences
Compensation Of Photobleached Images For A Cell Dynamics System, Sowmya Gopinath
Compensation Of Photobleached Images For A Cell Dynamics System, Sowmya Gopinath
Computer Science and Engineering Theses - Archive
Progress in the field of medicine attributes to the discoveries in biology that require an extensive knowledge of cell dynamics. Intracellular Cell Dynamics Analysis System (ICellDAS) is a web based tool aimed at automating sub cellular particle motion estimation, tracking and mobility analysis. The purpose of this tool is to develop a better understanding of specific biology problems by visualizing biological data. For reliable analysis as well as visualization of cell dynamics, it is essential that the acquired images reflect the exact information of the specimen. The goal of the thesis is to design an interface for the ICellDAS project …
Analyzing Differences In Color Variation Sensitivity Between Experts And Novices To Find A Differentiating Process In Pigmented Skin Lesion Diagnosis, Yu-Chin Chai
Computer Science and Engineering Theses - Archive
Fatal skin lesions such as melanomas appear as having high color variation to experts but often as having low variation to novices. This thesis investigated if it is possible to find a function representing an expert's color variation sensitivity to skin lesions without explicitly requiring them to provide a diagnosis. Various pigmented skin images with either normal pigmentation or with diseased lesions were evaluated by experts and novices. To determine the best color space for lesion differentiation, an optimization process based on parametric color dimensions in a RGB color space was used to find the parameters of a color transformation …
Using Part Of Speech Structure Of Text In The Prediction Of Its Readability, Jagadeesh Kondru
Using Part Of Speech Structure Of Text In The Prediction Of Its Readability, Jagadeesh Kondru
Computer Science and Engineering Theses - Archive
Readability formulas predict the reading difficulty associated with text. They typically output a U.S. school grade level that indicates the reading ability required of a person in order for him to comprehend that text. Ability to predict text readability is useful because it helps educators select appropriate texts for students and authors write texts accessible to the audience they target. Existing readability formulas are based on countable aspects of the text such as average sentence length and average word length. We propose a new readability formula, the Readability Index, which is based on the part-of-speech structure of sentences in a …
Ca-Ole- A Collaborative And Adaptive Online Learning Environment, Paola Gomez
Ca-Ole- A Collaborative And Adaptive Online Learning Environment, Paola Gomez
Computer Science and Engineering Theses - Archive
Demand for online learning environments has grown in the past few years, and schools have been offering more distance courses to their students. Designing adequate online learning environments is considerably more challenging than conventional Face-To-Face courses; therefore traditional methods can not be used. This thesis proposes the creation of a Collaborative and Adaptive Online Learning Environment (CA-OLE) that provides a structure where instructors can combine their lesson materials with an adaptive system and collaborative tools. CA-OLE innovative approach consists of an adaptive framework that changes the way the learning materials prepared by instructors are presented to the students depending on …
Personalizing (Re-Ranking) Web Search Results Using Information Present On A Social Network, Sushruth Puttaswamy
Personalizing (Re-Ranking) Web Search Results Using Information Present On A Social Network, Sushruth Puttaswamy
Computer Science and Engineering Theses - Archive
We describe a social search engine paradigm which can be built on top of a classic search engine (e.g. Google, Yahoo, etc.) and a social information network (such as FriendSter). In this thesis, the objective was to design algorithms and develop methods to efficiently combine information available in the underlying systems (Search Engine & Social Information Network) to better satisfy the search needs of a user. We are interested on how to efficiently employ social information to re-order a list of URLs retrieved by querying a search engine. The objective was to re-order the list of URLs in a way …
Adaptive Load Balancing And Change Visualization For Webvigil, Subramanian Chelladurai Hari Hara
Adaptive Load Balancing And Change Visualization For Webvigil, Subramanian Chelladurai Hari Hara
Computer Science and Engineering Theses - Archive
There is a need for selective monitoring, the contents of web pages. Periodical visit for understanding changes to a web page is both inefficient and time consuming. WebVigiL is a system developed for automating the change detection and timely notification of HTML/XML pages based on user specified changes of interest. User interest, specified as a sentinel/profile, is automatically monitored by the system using a combination of learning-based and event-driven techniques. The first prototype concentrated on the functionality of the WebVigiL system. This thesis extends the WebVigiL system in a number of ways. The primary focus of this thesis is the …
Efficient Main Memory Algorithms For Significant Interval And Frequent Episode Discovery, Sagar Hasmukh Savla
Efficient Main Memory Algorithms For Significant Interval And Frequent Episode Discovery, Sagar Hasmukh Savla
Computer Science and Engineering Theses - Archive
There is a considerable research on sequential mining of time-series data. Sensor-based applications such as MavHome require prediction of events for automating the environment using time-series data collected over a period of time. In these applications, it is important to predict tight and accurate intervals of interest to effectively automate the application. Also, detection of frequent patterns is needed for the automation of sequence of happenings. Although, there is a considerable body of work on sequential mining of transactional data, most of them deal with time point data and make several iterations over the entire data set for discovering frequently …
Automated Software Testing Using Covering Arrays, Chinmay P. Jayaswal
Automated Software Testing Using Covering Arrays, Chinmay P. Jayaswal
Computer Science and Engineering Theses - Archive
Modern society is increasingly dependent on the quality of software systems. Software testing is a widely used approach to ensure software quality. Since exhaustive testing is impractical due to resource constraints, it is necessary to strike a balance between test efforts and quality assurance. Interaction testing is one approach to marrying these two qualities. It characterizes the system under test by a set of parameters and the respective test values (domain size) for each parameter. Instead of testing all possible combinations of values for all the parameters, interaction testing constructs a covering array as a test set to cover all …
End-To-End Optimal Algorithms For Traffic Engineering, Failure Detection And Recovery In Connectionless Networks, Sukruth Srikantha
End-To-End Optimal Algorithms For Traffic Engineering, Failure Detection And Recovery In Connectionless Networks, Sukruth Srikantha
Computer Science and Engineering Theses - Archive
In this thesis we propose a novel scheme to achieve intra-domain Traffic Engineering (TE), Failure Detection and Recovery (FR) in connectionless networks. This scheme addresses rate adaptation, load balancing and stability issues of the OSPF protocol namely, network convergence times and route flapping. With the current default settings of the OSPF parameters, the network takes several tens of seconds to recover from a failure. The main component in this delay is the time required to detect the failure using the Hello protocol. Route flap is another undesirable phenomenon and needs to be eliminated to achieve greater stability and robustness in …
Evading Existing Stepping Stone Detection Methods Using Buffering, Madhu Venkateshaiah
Evading Existing Stepping Stone Detection Methods Using Buffering, Madhu Venkateshaiah
Computer Science and Engineering Theses - Archive
To gain anonymity and complicate their apprehension, attackers launch attacks not from their own systems but from previously compromised systems called stepping stones. An effective way to detect stepping stones is by comparing of incoming and outgoing connections in a network to find correlations. For the sake of simplicity, earlier approaches ignore that an attacker can add chaff to a traffic stream. But in reality, the attacker may be able to modify applications to use cover traffic. We loosen some assumptions made by earlier researchers and propose a simple buffering technique that could be used by an attacker to evade …
A Distributed Sensor Data Management Infrastructure Based On 802.15.4/Zigbee Networks, Tianqiang Li
A Distributed Sensor Data Management Infrastructure Based On 802.15.4/Zigbee Networks, Tianqiang Li
Computer Science and Engineering Theses - Archive
Wireless sensor networks consist of a certain number of autonomous devices with sensor, every device has certain detection functionality like light, temperature pressure etc. Communication by using the radio frequency make these spatially distributed devices feasible to oversee the activities in a large scale of area/space. 802.15.4/ZigBee networks are slated to run in the unlicensed frequencies. It is a packet-based radio protocol aimed at very low-cost, battery-operated widgets and sensors that can intercommunicate and send low-bandwidth data to each other. This thesis covers the content of a software solution of data management for an 802.15.4 networks. Its main contribution lies …
Context Aware Energy Conservation In Pervasive Computing Environments, Prathiba Joseph
Context Aware Energy Conservation In Pervasive Computing Environments, Prathiba Joseph
Computer Science and Engineering Theses - Archive
Extending battery lifetime is one of the most critical and challenging problems in mobile systems. When the mobile device sounds a low battery alarm, the user is given an ultimatum to quickly find a power source or suspend work. The greatest utility of mobile devices is their ability to be used anywhere, and at anytime. But power limitations of these devices seem to hinder this goal. The ever-growing needs of mobile users for increased lifetime of wireless devices imply that emerging wireless systems must be more energy-efficient than ever before. Cyber foraging or remote resource exploitation may be an efficient …
Evaluating Indexing And Routing Schemes For Spatial Queries In Sensor Networks, Raja Rajeshwari Anugula
Evaluating Indexing And Routing Schemes For Spatial Queries In Sensor Networks, Raja Rajeshwari Anugula
Computer Science and Engineering Theses - Archive
Recent advances in low-power sensing devices coupled with widespread availability of wireless ad-hoc networks, has fueled the development of sensor networks. These senor networks have various applications such as to monitor conditions at different locations (temperature, pressure, rainfall, vibrations etc.,), tracking of objects and so on. Each device is equipped with an energy source (usually with a battery), memory, CPU and communication bandwidth, which is severely constrained. Hence each sensor network is comprised of hardware for sensing, software for communication and computational algorithms. Spatial queries are commonly applied to sensor network, for example: "Find the highest temperature sensed in a …
An Application Of Parallel And Distributed Computing Methods To Approximate Pattern Matching Of Genetic Regulatory Motifs, Tushar Kumar Jayantilal
An Application Of Parallel And Distributed Computing Methods To Approximate Pattern Matching Of Genetic Regulatory Motifs, Tushar Kumar Jayantilal
Computer Science and Engineering Theses - Archive
Bioinformatics is a relatively new scientific field concerned with providing computational means and support to research in molecular biology and genetics. It draws from many different areas of computer science, including database theory, algorithm design and analysis, and artificial intelligence, to name just a few. In many applications, such as one described in this thesis, a biologist is interested in locating a particular pattern, or sequence motif, in a given string or set of strings over the four-letter DNA alphabet. In this thesis we present an efficient approach to locating promoter and other regulatory sequences in entire genomes or in …
A Relational Database Approach For Frequent Subgraph Mining, Subhesh Kumar Pradhan
A Relational Database Approach For Frequent Subgraph Mining, Subhesh Kumar Pradhan
Computer Science and Engineering Theses - Archive
Data mining aims at discovering interesting and previously unknown patterns from data sets. Further more, graph-based data mining represents a collection of techniques for mining the relational aspects of data represented as a graph. Complex relationships in data can be represented using graphs and hence graph mining is appropriate for analyzing data that is rich in structural relationships. Database mining of graphs, on the other hand, aims at directly mining graphs stored in a database using SQL queries. Several SQL-based mining algorithms have been developed successfully and their efficiency and scalability have been established. One of them is HDB-Subdue which …
Simulation Of Sensor Responses Of Advanced Security Systems, Janakiram Natarajan
Simulation Of Sensor Responses Of Advanced Security Systems, Janakiram Natarajan
Computer Science and Engineering Theses - Archive
Security systems are becoming an increasingly important area of research. Advanced security detection and surveillance systems that integrates a variety of detection mechanisms, like signals from different kinds of sensors, is expected to yield more accurate assessment than any one sensor analyzed individually. Designing and investigating these systems, to date, has relied primarily on physical deployments and experimentation. While the quality of the results from such efforts is excellent, the need to work with the physical systems directly imposes a substantial research impediment. One obvious possibility for widening the scope of what can be investigated is to employ simulation as …
Exception Handling Using Class Diversity, Qizhi Ye
Exception Handling Using Class Diversity, Qizhi Ye
Computer Science and Engineering Theses - Archive
Software reliability has been received more and more attention not only in mission critical system but also in commercial software system. Developing robust software must consider faults caused by abnormal situations or exceptions. Although modern programming languages like Java and C++ provide sophisticated exception handling mechanisms for detecting and handling exceptions, many potential runtime exceptions are not caught and handled because runtime exceptions could occur anywhere and could be numerous in a typical program. If an uncaught runtime exception occurs during program execution, then the execution will terminate abnormally, resulting in a system crash. The thesis proposes a framework that …
Relative Clock Drift Rate Based Secure Time Synchronization For Wireless Sensor Networks, Jae Sung Choi
Relative Clock Drift Rate Based Secure Time Synchronization For Wireless Sensor Networks, Jae Sung Choi
Computer Science and Engineering Theses - Archive
Time synchronization is critical issue to many wireless sensor network applications such that target tracking, TDMA radio scheduling, and secure localization. However, the most of existing time synchronization algorithms in wireless sensor networks did not consider malicious attacks in hostile environments. In this thesis, we propose a Relative Clock Drift Rate Based Secure Time Synchronization (RSTS) schemes to address security problems. RSTS alleviates delay attacks and incorrect time stamp transmissions caused by external or internal malicious attackers. We discuss a simple estimation technique to calculate a relative clock drift rate between sender-receiver clocks, because the estimated relative clock drift rate …
Towards Optimum Play-Out Buffering Delay In Voice Over Ip, Ruchir Pramod Shende
Towards Optimum Play-Out Buffering Delay In Voice Over Ip, Ruchir Pramod Shende
Computer Science and Engineering Theses - Archive
Voice over Internet Protocol (VoIP) or transmission of real-time voice packets over the Internet is slowly emerging as a cost-effective alternative to the traditional Public Switched Telephone Network (PSTN). However, varying end-to-end delay and packet loss, which are inherent in a packet-switched network like the Internet, lead to relatively lower quality of VoIP calls. The call quality can be improved by adaptively adjusting the play-out buffer at the receiver to reduce the impact of the delay and jitter. A standard play-out strategy uses a weighted moving average of the mean and variance of network delay to adaptively set the play-out …
Concept-Based Search Using Parallel Query Expansion, Rahul Rajiv Joshi
Concept-Based Search Using Parallel Query Expansion, Rahul Rajiv Joshi
Computer Science and Engineering Theses - Archive
We address the problem of irrelevant results for short queries on Web search engines. Short queries fail to provide sufficient context to disambiguate possible meanings associated with the search terms resulting in a set of irrelevant pages that the user has to filter through navigation and sometimes examination. First, we predict the potential concept topics, which are the domains for the search terms. This prediction is based on word occurrences and relationships observed in the various domains (categories) of a corpus. Next, we expand the search terms in each of the predicted domains in parallel. We then submit separate queries, …
Ubca: A Utility Based Clustering Architecture For Peer-To-Peer Networks, Brent Lagesse
Ubca: A Utility Based Clustering Architecture For Peer-To-Peer Networks, Brent Lagesse
Computer Science and Engineering Theses - Archive
Use of the Peer-to-Peer (P2P) architecture has recently spread in popularity. File sharing and ad hoc networks have contributed to the architecture's usage. P2P generates new challenges in scalability, fairness, and quality of service. Current solutions tend to fall into two main areas: incentives and system design. Incentive-based approaches appeal to the self-interested nature of peers by requiring service to the system in order to access resources. System design includes distributed hash tables and graph-theoretical based designs which have seen some success, but also result in new problems. We introduce a Utility-Based Clustering Architecture, UBCA, designed to address scalability, fairness, …
Alternative Architectures For Improving Document Readability, Ankur Bora
Alternative Architectures For Improving Document Readability, Ankur Bora
Computer Science and Engineering Theses - Archive
A number of tools have been developed to improve the readability of documents. These tools assist users to make changes which result in an easy to read document. Most of these tools were developed for users who work independently with little interaction with other users. However, in recent years, because of the proliferation of Internet, there has been increased collaboration between users. A user may need to share his document repositories with others so that both can benefit. Another set of users may work with information from a specific domain. These domains may be located in different geographical areas. Some …
Anytime Top-K Queries On Exact And Fuzzy Data, Bhushan P. Chaudhari
Anytime Top-K Queries On Exact And Fuzzy Data, Bhushan P. Chaudhari
Computer Science and Engineering Theses - Archive
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this thesis, we initiate research on the anytime behavior of top-k algorithms on exact and fuzzy data. In particular given specific topk algorithms we are interested in studying their progress towards identification of the correct result at any point of the algorithms' execution. We adopt a probabilistic approach where we seek to report at any point the scores of the top-k results the algorithm has identified, as well as associate a confidence with this prediction. Such functionality can be a valuable asset when …
Towards A Stronger Peer-To-Peer Anonymous System, Arjun R. Nambiar
Towards A Stronger Peer-To-Peer Anonymous System, Arjun R. Nambiar
Computer Science and Engineering Theses - Archive
Anonymous communications systems on the Internet provides protection against eavesdroppers and others that seek to link users with their communications. These systems have many important applications in areas such as law enforcement, intelligence gathering, business privacy, anonymous publishing, and personal privacy. Currently deployed systems rely on a relatively small set of advertised servers to forward messages for the user. These systems can suffer from scalability problems, with potentially large bandwidth and system overhead costs, and the servers themselves can be targets of direct attacks. Peer-to-peer anonymous communications systems, such as Tarzan[1] and MorphMix [2], have been proposed as a way …
Investigation Of Techniques To Increase The Scalability Of Graph-Based Data Mining Algorithms., Srilatha Inavolu
Investigation Of Techniques To Increase The Scalability Of Graph-Based Data Mining Algorithms., Srilatha Inavolu
Computer Science and Engineering Theses - Archive
Frequent subgraph pattern recognition and graph-based relational learning have been an emerging area of data mining research with scientific and commercial applications. At the kernel of these algorithms are the computationally-expensive graph and subgraph isomorphism tests. The graph isomorphism problem consists in deciding whether two graphs are isomorphic i.e., whether there is a one-one mapping between the vertices of the two graphs that respects the edge connections. Many graphs will be depicted quite differently but in actuality have the same inherent structure. This leads to the isomorphism problem. The graph isomorphism problem belongs to the class of NP problems and …
Multiple Object Tracking Using Particle Filters, Hwangryol Ryu
Multiple Object Tracking Using Particle Filters, Hwangryol Ryu
Computer Science and Engineering Theses - Archive
We describe a novel extension to the Particle filter algorithm for tracking multiple objects. The recently proposed algorithms and the variants for multiple object tacking algorithms estimate multi-modal posterior distributions that potentially represent the multiple peaks (i.e., multiple tracked objects). However, the speci¯c state representation does not demonstrate birth, death and more importantly partial/complete occlusion of the objects. Furthermore, the weakness of the Particle Filter such that the representation may increasingly bias the posterior density estimates toward objects with dominant likelihood makes the multiple object tracking algorithms more di±cult. To circumvent a sample depletion problem and maintain the computational complexity …
Application Of Software Engineering Best Practices And Principles To Small Development Teams, Miles Phillips
Application Of Software Engineering Best Practices And Principles To Small Development Teams, Miles Phillips
Computer Science and Engineering Theses - Archive
The motivation of this thesis comes from the professional experience of the author. Having worked with very small software development teams in various capacities, he realized that significant improvements could be achieved by the application of modern software engineering practices and principles. This paper is the result of researching how the principles and practices promoted by the leading software development authors can be applied to the small development team as they transition from "programming in the small" to "programming in the medium." This paper investigates the best practices and principles in various case studies with the objective to clearly define …
The Advantages Of Implementing Software Engineering Process Models, Ricky Don Preuninger
The Advantages Of Implementing Software Engineering Process Models, Ricky Don Preuninger
Computer Science and Engineering Theses - Archive
The North Atlantic Treaty Organization Science Committee had discussions on the topic concerned the state of Computer Science. There were worldwide issues with the development of software, the crisis being that software projects did not seem ever to complete. The study group coined the term "software engineering" to be provocative and implying need for software manufacturing to be similar to traditional branches of engineering. In the beginning, individual programmers used whatever means worked to build software. Formal methods of design or programming did not exist. Programmers were never able to give a definitive estimate as to how long a project …
A Performance Evaluation Of Alternate Numbering Based Xml Indexing Techniques, Chul Ho Ahn
A Performance Evaluation Of Alternate Numbering Based Xml Indexing Techniques, Chul Ho Ahn
Computer Science and Engineering Theses - Archive
Since XML became a standard of representing semi-structured data and exchanging format over the web, the sheer volume of XML data has become larger. While relational database represents data as a structured format, XML represents data in a self-describing way as a hierarchical tree structure. For expediting query processing over XML, many different types of indexing techniques have emerged. We will focus on numbering-based indexing techniques in this thesis. We will present performance comparison according to different XPath queries among three distinct numbering based XML indexing named GENE (Generic numbering based), XISS (Range based numbering), and XACC (Dimension based numbering) …
Monitorexplorer: A State-Space Exploration Based Tool To Test Java Monitors Implementations, Vidur Gupta
Monitorexplorer: A State-Space Exploration Based Tool To Test Java Monitors Implementations, Vidur Gupta
Computer Science and Engineering Theses - Archive
A monitor is a concurrency construct that encapsulates data. There are many application classes which are written using the Java Monitors and these are difficult to test due to the inherent complexities of the concurrent programs. The key challenge is to be able to trace all possible execution paths and then able to reproduce them for regression testing. Our work explores the state-space of the monitor application. The state space is explored in the depth first fashion. At each state the next possible transition is executed. This process is repeated till a duplicate or invalid state is detected. The key …