Reducing Power Consumption And Latency In Mobile Devices Using A Push Event Stream Model, Kernel Display Server, And Gui Scheduler, 2016 University of Tennessee, Knoxville
Reducing Power Consumption And Latency In Mobile Devices Using A Push Event Stream Model, Kernel Display Server, And Gui Scheduler, Stephen Gregory Marz
The power consumed by mobile devices can be dramatically reduced by improving how mobile operating systems handle events and display management. Currently, mobile operating systems use a pull model that employs a polling loop to constantly ask the operating system if an event exists. This constant querying prevents the CPU from entering a deep sleep, which unnecessarily consumes power.
We’ve improved this process by switching to a push model which we refer to as the event stream model (ESM). This model leverages modern device interrupt controllers which automatically notify an application when events occur, thus removing the need to ...
Dynamic Machine Level Resource Allocation To Improve Tasking Performance Across Multiple Processes, 2016 Boise State University
Dynamic Machine Level Resource Allocation To Improve Tasking Performance Across Multiple Processes, Richard Walter Thatcher
Boise State University Theses and Dissertations
Across the landscape of computing, parallelism within applications is increasingly important in order to track advances in hardware capability and meet critical performance metrics. However, writing parallel applications is difficult to do in a scalable way, which has led to the creation of tasking libraries and language extensions like OpenMP, Intel Threading Building Blocks, Qthreads, and more. These tools abstract parallel execution by expressing it in terms of work units (tasks) rather than specific hardware details. This abstraction enables scaling and allows programmers to write software solutions that can leverage whatever level of parallelism is available.However, the typical task ...
User Identity Linkage By Latent User Space Modelling, 2016 Singapore Management University
User Identity Linkage By Latent User Space Modelling, Xin Mu, Feida Zhu, Ee-Peng Lim, Jing Xiao, Jianzong Wang, Zhi-Hua Zhou
Research Collection School Of Information Systems
User identity linkage across social platforms is an important problem of great research challenge and practical value. In real applications, the task often assumes an extra degree of difficulty by requiring linkage across multiple platforms. While pair-wise user linkage between two platforms, which has been the focus of most existing solutions, provides reasonably convincing linkage, the result depends by nature on the order of platform pairs in execution with no theoretical guarantee on its stability. In this paper, we explore a new concept of “Latent User Space” to more naturally model the relationship between the underlying real users and their ...
Optimizing Main Memory Usage In Modern Computing Systems To Improve Overall System Performance, 2016 Florida International University
Optimizing Main Memory Usage In Modern Computing Systems To Improve Overall System Performance, Daniel Jose Campello
FIU Electronic Theses and Dissertations
Operating Systems use fast, CPU-addressable main memory to maintain an application’s temporary data as anonymous data and to cache copies of persistent data stored in slower block-based storage devices. However, the use of this faster memory comes at a high cost. Therefore, several techniques have been implemented to use main memory more efficiently in the literature. In this dissertation we introduce three distinct approaches to improve overall system performance by optimizing main memory usage.
First, DRAM and host-side caching of file system data are used for speeding up virtual machine performance in today’s virtualized data centers. The clustering ...
Packet Filter Approach To Detect Denial Of Service Attacks, 2016 California State University, San Bernardino
Packet Filter Approach To Detect Denial Of Service Attacks, Essa Yahya M Muharish
Electronic Theses, Projects, and Dissertations
Denial of service attacks (DoS) are a common threat to many online services. These attacks aim to overcome the availability of an online service with massive traffic from multiple sources. By spoofing legitimate users, an attacker floods a target system with a high quantity of packets or connections to crash its network resources, bandwidth, equipment, or servers. Packet filtering methods are the most known way to prevent these attacks via identifying and blocking the spoofed attack from reaching its target. In this project, the extent of the DoS attacks problem and attempts to prevent it are explored. The attacks categories ...
Raspberry Pi Vpn Travel Router, 2016 California Polytechnic State University, San Luis Obispo
Raspberry Pi Vpn Travel Router, Daniel S. Pierson
Consumers are increasingly relying on public wireless hotspots to access the internet from a growing number of devices. Usage of these hotspots has expanded from just laptops to everything from iPhones to tablets, which are expected to be internet-connected for full functionality. It has become common for one to check if there’s an open wireless hotspot connection available at places like coffee shops, hotels, restaurants, or even a doctor’s waiting room. The issue that arises is that these public connections present an inherent security risk, as anyone can connect and gain access to the network. For increased security ...
A Region-Centric Analysis Of The Internet Peering Ecosystem, 2016 Iowa State University
A Region-Centric Analysis Of The Internet Peering Ecosystem, Rajesh Putta Venkata, Lu Ruan
Computer Science Technical Reports
The Internet is transitioning from a hierarchical structure to a flat structure where more and more networks participate in public peering at IXPs and private peering at interconnection facilities to increase performance and reduce transit costs. PeeringDB is a public online database containing information about IXPs, facilities, and networks participating at IXPs and facilities. In this paper, we perform an in-depth analysis of the PeeringDB data to gain an understanding of the public and private peering ecosystems in the five regions of the world (i.e., North America, Europe, Asia Pacific, Latin America, and Africa). We study how IXPs, facilities ...
Hp Laserjet 2015 Pcl5 Printer Driver, 2016 ICIT, Gomal University, Dera Ismail Khan
Hp Laserjet 2015 Pcl5 Printer Driver, Dr. Muhammad Zubair Asghar
Dr. Muhammad Zubair Asghar
Concurrent Compaction In Jvm Garbage Collection, 2016 University of Minnesota, Morris
Concurrent Compaction In Jvm Garbage Collection, Jacob P. Opdahl
Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal
This paper provides a brief overview of both garbage collection (GC) of memory and parallel processing. We then cover how parallel processing applies to GC. Specifically, these concepts are focused within the context of the Java Virtual Machine (JVM). With that foundation, we look at various algorithms that perform compaction of fragmented memory during the GC process. These algorithms are designed to run concurrent to the application running. Such concurrently compacting GC behavior stems from a desire to reduce \stop-the-world" pauses of an application.
Secure And Authenticated Message Dissemination In Vehicular Ad Hoc Networks And An Incentive-Based Architecture For Vehicular Cloud, Kiho Lim
Theses and Dissertations--Computer Science
Vehicular ad hoc Networks (VANETs) allow vehicles to form a self-organized network. VANETs are likely to be widely deployed in the future, given the interest shown by industry in self-driving cars and satisfying their customers various interests. Problems related to Mobile ad hoc Networks (MANETs) such as routing, security, etc.have been extensively studied. Even though VANETs are special type of MANETs, solutions proposed for MANETs cannot be directly applied to VANETs because all problems related to MANETs have been studied for small networks. Moreover, in MANETs, nodes can move randomly. On the other hand, movement of nodes in VANETs ...
On The Limits And Practice Of Automatically Designing Self-Stabilization, 2016 Michigan Technological University
On The Limits And Practice Of Automatically Designing Self-Stabilization, Alex Klinkhamer
Dissertations, Master's Theses and Master's Reports
A protocol is said to be self-stabilizing when the distributed system executing it is guaranteed to recover from any fault that does not cause permanent damage. Designing such protocols is hard since they must recover from all possible states, therefore we investigate how feasible it is to synthesize them automatically. We show that synthesizing stabilization on a fixed topology is NP-complete in the number of system states. When a solution is found, we further show that verifying its correctness on a general topology (with any number of processes) is undecidable, even for very simple unidirectional rings. Despite these negative results ...
Maia And Mandos: Tools For Integrity Protection On Arbitrary Files, 2016 Michigan Technological University
Maia And Mandos: Tools For Integrity Protection On Arbitrary Files, Paul J. Bonamy
Dissertations, Master's Theses and Master's Reports
We present the results of our dissertation research, which focuses on practical means of protecting system data integrity. In particular, we present Maia, a language for describing integrity constraints on arbitrary file types, and Mandos, a Linux Security Module which uses verify-on-close to enforce mandatory integrity guarantees. We also provide details of a Maia-based verifier generator, demonstrate that Maia and Mandos introduce minimal delay in performing their tasks, and include a selection of sample Maia specifications.
A Study Of Social Web Data On Buprenorphine Abuse Using Semantic Web Technology, 2016 Wright State University - Main Campus
A Study Of Social Web Data On Buprenorphine Abuse Using Semantic Web Technology, Raminta Daniulaityte, Amit P. Sheth
The Specific Aims of this application are to use a paradigmatic approach that combines Semantic Web technology, Natural Language Processing and Machine Learning techniques to:
1) Describe drug users’ knowledge, attitudes, and behaviors related to the non-medical use of Suboxone and Subutex as discussed on Web-based forums.
2) Identify and describe temporal patterns of non-medical use of Suboxone and Subutex as discussed on Web-based forums.
The research was carried out by an interdisciplinary team of members of the Center for Interventions, Treatment and Addictions Research (CITAR) and the Ohio Center of Excellence in Knowledge- enabled Computing (Kno.e.sis) at ...
Effective Performance Analysis And Debugging, 2016 University of Massachusetts - Amherst
Effective Performance Analysis And Debugging, Charles M. Curtsinger
Doctoral Dissertations May 2014 - current
Performance is once again a first-class concern. Developers can no longer wait for the next generation of processors to automatically "optimize" their software. Unfortunately, existing techniques for performance analysis and debugging cannot cope with complex modern hardware, concurrent software, or latency-sensitive software services.
While processor speeds have remained constant, increasing transistor counts have allowed architects to increase processor complexity. This complexity often improves performance, but the benefits can be brittle; small changes to a program’s code, inputs, or execution environment can dramatically change performance, resulting in unpredictable performance in deployed software and complicating performance evaluation and debugging. Developers seeking ...
Randomized Algorithms For Approximating A Connected Dominating Set In Wireless Sensor Networks, Akshaye Dhawan, Michelle Tanco, Aaron Yeiser
Mathematics and Computer Science Faculty Publications
A Connected Dominating Set (CDS) of a graph representing a Wireless Sensor Network can be used as a virtual backbone for routing through the network. Since the sensors in the network are constrained by limited battery life, we desire a minimal CDS for the network, a known NP-hard problem. In this paper we present three randomized algorithms for constructing a CDS. We evaluate our algorithms using simulations and compare them to the two-hop K2 algorithm and two other greedy algorithms from the literature. After pruning, the randomized algorithms construct a CDS that are generally equivalent in size to those constructed ...
An Immersive Telepresence System Using Rgb-D Sensors And Head-Mounted Display, 2015 University of Dayton
An Immersive Telepresence System Using Rgb-D Sensors And Head-Mounted Display, Xinzhong Lu, Ju Shen, Saverio Perugini, Jianjun Yang
Computer Science Faculty Publications
We present a tele-immersive system that enables people to interact with each other in a virtual world using body gestures in addition to verbal communication. Beyond the obvious applications, including general online conversations and gaming, we hypothesize that our proposed system would be particularly beneficial to education by offering rich visual contents and interactivity. One distinct feature is the integration of egocentric pose recognition that allows participants to use their gestures to demonstrate and manipulate virtual objects simultaneously. This functionality enables the instructor to effectively and efficiently explain and illustrate complex concepts or sophisticated problems in an intuitive manner. The ...
Intent Classification Of Short-Text On Social Media, 2015 Wright State University - Main Campus
Intent Classification Of Short-Text On Social Media, Hemant Purohit, Guozhu Dong, Valerie L. Shalin, Krishnaprasad Thirunarayan, Amit P. Sheth
Social media platforms facilitate the emergence of citizen communities that discuss real-world events. Their content reflects a variety of intent ranging from social good (e.g., volunteering to help) to commercial interest (e.g., criticizing product features). Hence, mining intent from social data can aid in filtering social media to support organizations, such as an emergency management unit for resource planning. However, effective intent mining is inherently challenging due to ambiguity in interpretation, and sparsity of relevant behaviors in social data. In this paper, we address the problem of multiclass classification of intent with a use-case of social data generated ...
Learning And Controlling Network Diffusion In Dependent Cascade Models, 2015 Singapore Management University
Learning And Controlling Network Diffusion In Dependent Cascade Models, Jiali Du, Pradeep Varakantham, Akshat Kumar, Shih-Fen Cheng
Research Collection School Of Information Systems
Diffusion processes have increasingly been used to represent flow of ideas, traffic and diseases in networks. Learning and controlling the diffusion dynamics through management actions has been studied extensively in the context of independent cascade models, where diffusion on outgoing edges from a node are independent of each other. Our work, in contrast, addresses (a) learning diffusion taking management actions to alter the diffusion dynamics to achieve a desired outcome in dependent cascade models. A key characteristic of such dependent cascade models is the flow preservation at all nodes in the network. For example, traffic and people flow is preserved ...
Data Verifications For Online Social Networks, 2015 Florida International University
Data Verifications For Online Social Networks, Mahmudur Rahman
FIU Electronic Theses and Dissertations
Social networks are popular platforms that simplify user interaction and encourage collaboration. They collect large amounts of media from their users, often reported from mobile devices. The value and impact of social media makes it however an attractive attack target. In this thesis, we focus on the following social media vulnerabilities. First, review centered social networks such as Yelp and Google Play have been shown to be the targets of significant search rank and malware proliferation attacks. Detecting fraudulent behaviors is thus paramount to prevent not only public opinion bias, but also to curb the distribution of malware. Second, the ...
Cache-Aware Compositional Analysis Of Real-Time Multicore Virtualization Platforms, 2015 University of Pennsylvania
Cache-Aware Compositional Analysis Of Real-Time Multicore Virtualization Platforms, Meng Xu, Linh T.X. Phan, Oleg Sokolsky, Sisu Xi, Chenyang Lu, Christopher Gill, Insup Lee
Departmental Papers (CIS)
Multicore processors are becoming ubiquitous, and it is becoming increasingly common to run multiple real-time systems on a shared multicore platform. While this trend helps to reduce cost and to increase performance, it also makes it more challenging to achieve timing guarantees and functional isolation. One approach to achieving functional isolation is to use virtualization. However, virtualization also introduces many challenges to the multicore timing analysis; for instance, the overhead due to cache misses becomes harder to predict, since it depends not only on the direct interference between tasks but also on the indirect interference between virtual processors and the ...