OS and Networks Commons^™

Spring­11: Pdc In Cs1/2 And A Mobile/Cloud Intermediate Mobile/Cloud Intermediate Software Design Course, Joseph P. Kaylor, Konstantin Läufer, Chandra N. Sekharan, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

Recent changes in the environment of Loyola University Chicago’s Department of Computer Science include a better differentiation of our four undergraduate majors, growing interest in computing among science majors, and an increased demand for graduates with mobile and cloud skills. In our continued effort to incorporate parallel and distributed computing topics into the undergraduate curriculum, we are focusing on these three existing courses:

CS1: In response to a request from the physics department, we started to offer a CS1 section aimed at majors in physics and other hard sciences this spring semester. This section includes some material on numerical methods …

Building Capable, Energy-Efficient, Flexible Visualization And Sensing Clusters From Commodity Tablets, Thomas Delgado Dias, Xian Yan, Konstantin Läufer, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

We explore the application of clusters of commodity tablet devices to problems spanning a “trilogy” of concerns: visualization, sensing, and computation. We conjecture that such clusters provide a low-cost, energy-efficient, flexible, and ultimately effective platform to tackle a wide range of problems within this trilogy. This is a work in progress, and we now elaborate our position and give a preliminary status report.

A wide range of Android tablet devices are available in terms of price and capabilities. “You get what you pay for” w.r.t. display resolution, sensors, and chipset---corresponding to the trilogy. $200 gets one a 1280x800-pixel touch display, …

Network Technologies Used To Aggregate Environmental Data, Paul Stasiuk, Konstantin Läufer, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

The goal of the Loyola Weather Service (lws) project is to design and build a system of functioning environmental monitoring widgets that can intelligently and autonomously control the environment around them based on set thresholds and triggers. The widgets will also have the ability to aggregate their data and easily display this data in various ways: through a user interface in the room that the widget is placed, via a web application, and programmatically via a RESTful web service.

An Online Algorithm For The 2-Server Problem On The Line With Improved Competitiveness, Lucas Adam Bang

UNLV Theses, Dissertations, Professional Papers, and Capstones

In this thesis we present a randomized online algorithm for the 2-server problem on the line, named R-LINE (for Randomized Line). This algorithm achieves the lowest competitive ratio of any known randomized algorithm for the 2-server problem on the line.

The competitiveness of R-LINE is less than 1.901. This result provides a significant improvement over the previous known competitiveness of 155/78 (approximately 1.987), by Bartal, Chrobak, and Larmore, which was the first randomized algorithm for the 2-server problem one the line with competitiveness less than 2. Taking inspiration from this algorithm,we improve this result by utilizing ideas from T-theory, game …

Behind The Magical Numbers: Hierarchical Chunking And The Human Working Memory Capacity, Guoqi Li, Ning Ning, Kiruthika Ramanathan, Wei He, Li Pan, Luping Shi

Research Collection School Of Computing and Information Systems

To explore the influence of chunking on the capacity limits of working memory, a model for chunking in sequential working memory is proposed, using hierarchical bidirectional inhibition-connected neural networks with winnerless competition. With the assumption of the existence of an upper bound to the inhibitory weights in neurobiological networks, it is shown that chunking increases the number of memorized items in working memory from the "magical number 7" to 16 items. The optimal number of chunks and the number of the memorized items in each chunk are the "magical number 4".

A Semantic Situation Awareness Framework For Indoor Cyber-Physical Systems, Pratikkumar Desai

Kno.e.sis Publications

Recently, the domain of cyber-physical systems (CPSs) has emerged as a successor to the traditional embedded systems and the wireless sensor networks. The relatively new cyber-physical domain offers tight integration of control, communication and computation components to develop advanced web based application in various heterogeneous domains such as health care, disaster management, automation and environment monitoring. The applications of indoor CPSs include remote patient monitoring, smart home, etc. with focus on situation awareness via event identification from context information. The principal challenges associated with the development of situation awareness applications include uncertainty in contextual data, incomplete domain knowledge, interoperability between …

Operating System Scheduling: Linux Preemptive Scheduling Algorithms, Andrew Brand

Honors Capstones

Capstone submitted as a graduation requirement for the BSU Honors Program.

Vsfs: A Versatile Searchable File System For Hpc Analytics, Lei Xu, Ziling Huang, Hong Jiang, Lei Tian, David Swanson

School of Computing: Technical Reports

Big-data/HPC analytics applications have urgent needs for file-search services to drastically reduce the scale of the input data to accelerate analytics. Unfortunately, the existing solutions either are poorly scalable for large-scale systems, or lack well-integrated interface to allow applications to easily use them. We propose a distributed searchable file system, VSFS, which provide a novel and flexible POSIX-compatible searchable file system namespace that can be seamlessly integrate with any legacy code without modification. Additionally, to provide real-time indexing and searching performance, VSFS uses DRAM-based distributed consistent hashing ring to manages all file-index. The results of our evaluation show that VSFS …

Predicting Parkinson's Disease Progression With Smartphone Data, Pramod Anantharam, Krishnaprasad Thirunarayan, Vahid Taslimi, Amit P. Sheth

Kno.e.sis Publications

Most of the existing approaches for detecting diseases/risk score form observations (sensor and textual) ignore the presence of any prior knowledge of the disease. In this work, we start top-down by enumerating the symptoms of Parkinson's Disease (PD) and map the symptoms to its possible manifestations in sensor observations (bottom-up). We show such manifestations and further use these manifestations as features to build classifiers to differentiate between the PD patients and the control group.

Parallel Copying Tools For Distributed File Systems, Kevin Matthew Nuss

Computer Science Graduate Projects and Theses

Parallel distributed files systems are increasingly being used on clusters to allow greater throughput of data to the many compute nodes. They are also an effective way to store massive amounts of data. However, using the standard core utility cp does not make good use of the potential parallelism of the file systems. Using multiple cp commands has inherent problems too.

Two utilities were created to help recursively copy directories containing large amounts of data on parallel distributed file systems. One of the test data sets contains very many files, and the other contains large files. One utility is a …

Network Structure Of Social Coding In Github, Ferdian Thung, David Lo, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

No abstract provided.

Fault-Tolerant Coverage In Dense Wireless Sensor Networks, Akshaye Dhawan, Magdalena Parks

Mathematics, Computer Science & Statistics Faculty Publications

In this paper, we present methods to detect and recover from sensor failure in dense wireless sensor networks. In order to extend the lifetime of a sensor network while maintaining coverage, a minimal subset of the deployed sensors are kept active while the other sensors can enter a low power sleep state. Several distributed algorithms for coverage have been proposed in the literature. Faults are of particular concern in coverage algorithms since sensors go into a sleep state in order to conserve battery until woken up by active sensors. If these active sensors were to fail, this could lead to …

What Kind Of #Conversation Is Twitter? Mining #Psycholinguistic Cues For Emergency Coordination, Hemant Purohit, Andrew Hampton, Valerie L. Shalin, Amit P. Sheth, John M. Flach, Shreyansh Bhatt

Kno.e.sis Publications

The information overload created by social media messages in emergency situations challenges response organizations to find targeted content and users. We aim to select useful messages by detecting the presence of conversation as an indicator of coordinated citizen action. Using simple linguistic indicators associated with conversation analysis in social science, we model the presence of conversation in the communication landscape of Twitter in a large corpus of 1.5M tweets for various disaster and non-disaster events spanning different periods, lengths of time and varied social significance. Within Replies, Retweets and tweets that mention other Twitter users, we found that domain-independent, linguistic …

A Hybrid Approach To Finding Relevant Social Media Content For Complex Domain Specific Information Needs, Delroy H. Cameron, Amit P. Sheth, Nishita Jaykumar, Gaurish Anand, Krishnaprasad Thirunarayan, Gary Alan Smith

Kno.e.sis Publications

While contemporary semantic search systems offer to improve classical keyword-based search, they are not always adequate for complex, domain specific information needs. Some complex search situations require knowledge of both ontological concepts as well as 'intelligible constructs' not typically modeled in ontologies. Intelligible constructs convey essential information, which may be important to the holistic information needs of information seekers. Such constructs may include notions of intensity, frequency, interval, dosage, emotion, sentiment, equivalence, synonymy, negation, parts-of-speech, etc. However, few search systems utilize both structured background knowledge (ontologies) and the aforementioned knowledge for query interpretation in domain specific searches. Instead, there is …

Traffic Analytics Using Probabilistic Graphical Models Enhanced With Knowledge Bases, Pramod Anantharam, Krishnaprasad Thirunarayan, Amit P. Sheth

Kno.e.sis Publications

Graphical models have been successfully used to deal with uncertainty, incompleteness, and dynamism within many domains. These models built from data often ignore preexisting declarative knowledge about the domain in the form of ontologies and Linked Open Data (LOD) that is increasingly available on the web. In this paper, we present an approach to leverage such 'top-down' domain knowledge to enhance 'bottom-up' building of graphical models. Specifically, we propose three operations on the graphical model structure to enrich it with nodes, edges, and edge directions. We illustrate the enrichment process using traffic data from 511.org and declarative knowledge from ConceptNet. …

Advancing Data Reuse In Phyloinformatics Using An Ontology-Driven Semantic Web Approach, Maryam Panahiazar, Amit P. Sheth, Ajith Harshana Ranabahu, Rutger Vos, Jim Leebens-Mack

Kno.e.sis Publications

Phylogenetic analyses can resolve historical relationships among genes, organisms or higher taxa. Understanding such relationships can elucidate a wide range of biological phenomena, including, for example, the importance of gene and genome duplications in the evolution of gene function, the role of adaptation as a driver of diversification, or the evolutionary consequences of biogeographic shifts. Phyloinformaticists are developing data standards, databases and communication protocols (e.g. Application Programming Interfaces, APIs) to extend the accessibility of gene trees, species trees, and the metadata necessary to interpret these trees, thus enabling researchers across the life sciences to reuse phylogenetic knowledge. Specifically, Semantic Web …

Twitris: Socially Influenced Browsing, Ashutosh Sopan Jadhav, Wenbo Wang, Raghava Mutharaju, Pramod Anantharam, Vinh Nguyen, Amit P. Sheth, Karthik Gomadam, Meenakshi Nagarajan, Ajith Harshana Ranabahu

Kno.e.sis Publications

In this paper, we present Twitris, a semantic Web application that facilitates browsing for news and information, using social perceptions as the fulcrum. In doing so we address challenges in large scale crawling, processing of real time information, and preserving spatio-temporal-thematic properties central to observations pertaining to real time events. We extract metadata about events from Twitter and bring related news and Wikipedia articles to the user. In developing Twitris, we have used the DBPedia ontology.

Adaptive Semantic Annotation Of Entity And Concept Mentions In Text, Pablo N. Mendes

Kno.e.sis Publications

The recent years have seen an increase in interest for knowledge repositories that are useful across applications, in contrast to the creation of ad hoc or application-specific databases.
These knowledge repositories figure as a central provider of unambiguous identifiers and semantic relationships between entities. As such, these shared entity descriptions serve as a common vocabulary to exchange and organize information in different formats and for different purposes. Therefore, there has been remarkable interest in systems that are able to automatically tag textual documents with identifiers from shared knowledge repositories so that the content in those documents is described in a …

Logical Linked Data Compression, Amit Krishna Joshi, Pascal Hitzler, Guozhu Dong

Computer Science and Engineering Faculty Publications

Linked data has experienced accelerated growth in recent years. With the continuing proliferation of structured data, demand for RDF compression is becoming increasingly important. In this study, we introduce a novel lossless compression technique for RDF datasets, called Rule Based Compression (RB Compression) that compresses datasets by generating a set of new logical rules from the dataset and removing triples that can be inferred from these rules. Unlike other compression techniques, our approach not only takes advantage of syntactic verbosity and data redundancy but also utilizes semantic associations present in the RDF graph. Depending on the nature of the dataset, …

Automatic Detection Of Abnormal Behavior In Computing Systems, James Frank Roberts

Theses and Dissertations--Computer Science

I present RAACD, a software suite that detects misbehaving computers in large computing systems and presents information about those machines to the system administrator. I build this system using preexisting anomaly detection techniques. I evaluate my methods using simple synthesized data, real data containing coerced abnormal behavior, and real data containing naturally occurring abnormal behavior. I find that the system adequately detects abnormal behavior and significantly reduces the amount of uninteresting computer health data presented to a system administrator.