University of Texas

Displaying 1-40 of 345 results

  • White Papers // Jun 2013

    Graduates' Perception of Employment in SMEs and Large Enterprises

    This paper looks at non business (n = 66) and business graduates (n = 18) and compares their employment preference in Small and Medium sized Enterprises (SME) or Large Enterprises (LE). In pursuit, a questionnaire was developed measuring the perception of graduates as regards on the content of a job,...

    Provided By University of Texas

  • White Papers // Aug 2012

    Offloading in Heterogeneous Networks: Modeling, Analysis and Design Insights

    Pushing data traffic from cellular to Wi-Fi is an example of inter-Radio Access Technology (RAT) offloading. While this clearly alleviates congestion on the over-loaded cellular network, the ultimate potential of such offloading and its effect on overall system performance is not well understood. To address this, the authors develop a...

    Provided By University of Texas

  • White Papers // Jul 2012

    Frankenstein: Stitching Malware From Benign Binaries

    This paper proposes a new self-camouflaging malware propagation system, Frankenstein, that overcomes shortcomings in the current generation of metamorphic malware. Specifically, although mutants produced by current state-of-the-art metamorphic engines are diverse, they still contain many characteristic binary features that reliably distinguish them from benign software. Frankenstein forgoes the concept of...

    Provided By University of Texas

  • White Papers // Jun 2012

    New Proof Methods for Attribute-Based Encryption: Achieving Full Security Through Selective Techniques

    The authors develop a new methodology for utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full security. This deepens the relationship between the selective and full security models and provides a path for transferring the best qualities of...

    Provided By University of Texas

  • White Papers // May 2012

    Dependency Path Patterns as the Foundation of Access Control in Provenance-Aware Systems

    A unique characteristics of provenance data is that it forms a Directed Acyclic Graph (DAG) in accordance with the underlying causality dependencies between entities (acting users, action processes and data objects) involved in transactions. Data provenance raises at least two distinct security-related issues. One is how to control access to...

    Provided By University of Texas

  • White Papers // May 2012

    Tag-Based Information Flow Analysis for Document Classification in Provenance

    A crucial aspect of certain applications such as the ones pertaining to Intelligence domain or Health-care, is to manage and protect sensitive information effectively and efficiently. In this paper, the authors propose a tagging mechanism to track the flow of sensitive or valuable information in a provenance graph and automate...

    Provided By University of Texas

  • White Papers // May 2012

    AnonymousCloud: A Data Ownership Privacy Provider Framework in Cloud Computing

    A means of reliably concealing ownership of cloud data without impeding computation over the data is presented and evaluated. This facilitates information privacy enforcement in cloud environments by withholding data ownership information from cloud nodes that compute using the data. As a result, nodes that have access to private data...

    Provided By University of Texas

  • White Papers // May 2012

    Dual Form Signatures: An Approach for Proving Security From Static Assumptions

    In this paper, the authors introduce the abstraction of Dual Form Signatures as a useful framework for proving security (existential unforgeability) from static assumptions for schemes with special structure that are used as a basis of other cryptographic protocols and applications. They describe the power of this framework by proving...

    Provided By University of Texas

  • White Papers // May 2012

    Hatman: Intra-Cloud Trust Management for Hadoop

    Data and computation integrity and security are major concerns for users of cloud computing facilities. Many production-level clouds optimistically assume that all cloud nodes are equally trustworthy when dispatching jobs; jobs are dispatched based on node load, not reputation. This increases their vulnerability to attack, since compromising even one node...

    Provided By University of Texas

  • White Papers // Apr 2012

    An Empirical Study of Supplementary Bug Fixes

    A recent study finds that errors of omission are harder for programmers to detect than errors of commission. While several change recommendation systems already exist to prevent or reduce omission errors during software development, there have been very few studies on why errors of omission occur in practice and how...

    Provided By University of Texas

  • White Papers // Apr 2012

    Towards Understanding the Fundamentals of Mobility in Cellular Networks

    Despite the central role of mobility in wireless networks, there are surprisingly few fundamental results on its properties. This paper aims to address this gap by proposing a new Random Way-Point (RWP) mobility model defined on the entire plane and applying it to analyze two key cellular network parameters: handover...

    Provided By University of Texas

  • White Papers // Apr 2012

    Vdiff: A Program Differencing Algorithm for Verilog Hardware Description Language

    During code review tasks, comparing two versions of a hardware design description using existing program differencing tools such as diff is inherently limited because these tools implicitly assume sequential execution semantics, while hardware description languages are designed to model concurrent computation. The authors designed a position-independent differencing algorithm to robustly...

    Provided By University of Texas

  • White Papers // Apr 2012

    BRACE: An Assertion Framework for Debugging Cyber-Physical Systems

    Developing Cyber-Physical Systems (CPS) is challenging because correctness depends on both logical and physical states, which are collectively difficult to observe. The developer often need to repeatedly rerun the system while observing its behavior and tweak the hardware and software until it meets minimum requirements. This process is tedious, error-prone,...

    Provided By University of Texas

  • White Papers // Apr 2012

    Extending Java for Android Programming

    Android is one of the most popular platforms for developing mobile applications. However, its framework relies on programming conventions and styles to implement framework-specific concepts like activities and intents, causing problems such as reliability, readability, understandability, and maintainability. The authors propose to extend Java to support Android framework concepts explicitly...

    Provided By University of Texas

  • White Papers // Feb 2012

    A-Serv: A Novel Architecture Providing Scalable Quality of Service

    QoS architectures define how routers process packets to ensure QoS service guarantees enforced. Existing QoS architectures such as Integrated Services (IntServ), Differentiated Services (DiffServ), and Dynamic Packet State (DPS) share one common property that the packet structure and the function of the routers are closely connected. Packets of one data...

    Provided By University of Texas

  • White Papers // Feb 2012

    Security Analysis and Enhancement for Prefix-Preserving Encryption Schemes

    Prefix-Preserving Encryption (PPE) is an important type of encryption scheme, having a wide range of applications, such as IP addresses anonymization, prefix-matching search, and rang search. There are two issues in PPE schemes, security proof and single key requirement. Existing security proofs for PPE only reduce the security of a...

    Provided By University of Texas

  • White Papers // Feb 2012

    Decoupled Dynamic Cache Segmentation

    The Least Recently Used (LRU) replacement policy performs poorly in the Last-Level Cache (LLC) because temporal locality of memory accesses is filtered by first and second level caches. The authors propose a cache segmentation technique that dynamically adapts to cache access patterns by predicting the best number of not-yet-referenced and...

    Provided By University of Texas

  • White Papers // Jan 2012

    Identifying Failure-Inducing Combinations in a Combinatorial Test Set

    A t-way combinatorial test set is designed to detect failures that are triggered by combinations involving no more than t parameters. Assume that the authors have executed a t-way test set and some tests have failed. A natural question to ask is: what combinations have caused these failures? Identifying such...

    Provided By University of Texas

  • White Papers // Jan 2012

    Optimal Surface Deployment Problem in Wireless Sensor Networks

    Sensor deployment is a fundamental issue in a wireless sensor network, which often dictates the overall network performance. Previous studies on sensor deployment mainly focused on sensor networks on 2D plane or in 3D volume. In this paper, the authors tackle the problem of optimal sensor deployment on 3 surfaces,...

    Provided By University of Texas

  • White Papers // Jan 2012

    Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security

    The authors present a new approach for creating chosen ciphertext secure encryption. The focal point of their work is a new abstraction that they call Detectable Chosen Ciphertext Security (DCCA). Intuitively, this notion is meant to capture systems that are not necessarily Chosen Ciphertext Attack (CCA) secure, but where they...

    Provided By University of Texas

  • White Papers // Jan 2012

    A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems

    Causally ordered message delivery is a required property for several distributed applications particularly those that involve human interactions (such as teleconferencing and collaborative work). In this paper, the authors present an efficient protocol for causal ordering in mobile computing systems. This protocol requires minimal resources on mobile hosts and wireless...

    Provided By University of Texas

  • White Papers // Jan 2012

    XML Query Routing in Structured P2P Systems

    This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. The authors' architecture scales gracefully to the network and data sizes, is fully distributed, fault tolerant and self-organizing, and handles complex queries efficiently, even those queries that use...

    Provided By University of Texas

  • White Papers // Dec 2011

    Making Argument Systems for Outsourced Computation Practical (Sometimes)

    This paper describes the design, implementation, and evaluation of a system for performing verifiable outsourced computation. It has long been known that this problem can be solved in theory using Probabilistically Checkable Proofs (PCPs) coupled with modern cryptographic tools, and these solutions have wholly impractical performance, according to the conventional...

    Provided By University of Texas

  • White Papers // Nov 2011

    Heterogeneous Cellular Networks: From Theory to Practice

    The proliferation of internet-connected mobile devices will continue to drive growth in data traffic in an exponential fashion, forcing network operators to dramatically increase the capacity of their networks. To do this cost-effectively, a paradigm shift in cellular network infrastructure deployment is occurring away from traditional (expensive) high-power tower-mounted base...

    Provided By University of Texas

  • White Papers // Nov 2011

    Efficient Similarity Search Over Encrypted Data

    In recent years, due to the appealing features of cloud computing, large amount of data have been stored in the cloud. Although cloud based services offer many advantages, privacy and security of the sensitive data is a big concern. To mitigate the concerns, it is desirable to outsource sensitive data...

    Provided By University of Texas

  • White Papers // Nov 2011

    Insider Threat Detection Using Stream Mining and Graph Mining

    Evidence of malicious insider activity is often buried within large data streams, such as system logs accumulated over months or years. Ensemble-based stream mining leverages multiple classification models to achieve highly accurate anomaly detection in such streams even when the stream is unbounded, evolving, and unlabeled. This makes the approach...

    Provided By University of Texas

  • White Papers // Nov 2011

    Program Interferometry

    Modern microprocessors have many micro-architectural features. Quantifying the performance impact of one feature such as dynamic branch prediction can be difficult. On one hand, a timing simulator can predict the difference in performance given two different implementations of the technique, but simulators can be quite inaccurate. On the other hand,...

    Provided By University of Texas

  • White Papers // Nov 2011

    Functional Verification of Class Invariants in CleanJava

    In Cleanroom-style functional program verification, a program is viewed as a mathematical function from one program state to another, and the program is verified by comparing two functions, the implemented and the expected behaviors of a program. The technique requires a minimal mathematical background and supports forward reasoning, but it...

    Provided By University of Texas

  • White Papers // Oct 2011

    An Optimized Scaled Neural Branch Predictor

    Conditional branch prediction remains one of the most important enabling technologies for high-performance microprocessors. A small improvement in accuracy can result in a large improvement in performance as well as a significant reduction in energy wasted on wrong-path instructions. Neural-based branch predictors have been among the most accurate in the...

    Provided By University of Texas

  • White Papers // Sep 2011

    Transmission Capacity of Ad-Hoc Networks With Multiple Antennas Using Transmit Stream Adaptation and Interference Cancelation

    The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Assuming that the transmitter locations are distributed as a Poisson point process, this paper derives upper and lower bounds on...

    Provided By University of Texas

  • White Papers // Sep 2011

    AOVis: A Model-Driven Multiple-Graph Approach to Program Fact Extraction for AspectJ/Java Source Code

    AspectJ reverse engineering and visualization remains a challenge at the architectural and design levels, with fewer tools available for reverse engineers compared to other languages such as Java. Prior work on AspectJ modeling focused on forward engineering or detailed-design reverse engineering, or required special instrumentation to identify cross-cutting relationships. Effective...

    Provided By University of Texas

  • White Papers // Sep 2011

    Toward the Verification of a Simple Hypervisor

    Virtualization promises significant benefits in security, efficiency, dependability, and cost. Achieving these benefits depends upon the reliability of the underlying virtual machine monitors (hypervisors). This paper describes an ongoing project to develop and verify MinVisor, a simple but functional Type-I x86 hypervisor, proving protection properties at the assembly level using...

    Provided By University of Texas

  • White Papers // Sep 2011

    Supervised Learning for Insider Threat Detection Using Stream Mining

    Insider threat detection requires the identification of rare anomalies in contexts where evolving behaviors tend to mask such anomalies. This paper proposes and tests an ensemble-based stream mining algorithm based on supervised learning that addresses this challenge by maintaining an evolving collection of multiple models to classify dynamic data streams...

    Provided By University of Texas

  • White Papers // Aug 2011

    Remote Batch Invocation for SQL Databases

    Batch services are a new approach to distributed computation in which clients send batches of operations for execution on a server and receive hierarchical results sets in response. In this paper, the authors show how batch services provide a simple and powerful interface to relational databases, with support for arbitrary...

    Provided By University of Texas

  • White Papers // Aug 2011

    A Tutorial on Functional Program Verification

    This paper gives a quick tutorial introduction to functional program verification. In functional program verification, a program is viewed as a mathematical function from one program state to another, and proving its correctness is essentially comparing two mathematical functions, the function computed by the program and the specification of the...

    Provided By University of Texas

  • White Papers // Aug 2011

    The CleanJava Language for Functional Program Verification

    Unlike Hoare-style program verification, functional program verification supports forward reasoning by viewing a program as a mathematical function from one program state to another and proving its correctness by essentially comparing two mathematical functions, the function computed by the program and its specification. Since it requires a minimal mathematical background...

    Provided By University of Texas

  • White Papers // Jul 2011

    Distributed SIR-Aware Scheduling in Large-Scale Wireless Networks

    Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small amounts of timely side information. In this paper, the authors propose three related techniques for low-overhead Distributed Opportunistic Scheduling (DOS) and precisely determine their...

    Provided By University of Texas

  • White Papers // Jul 2011

    Heterogeneous Cellular Networks With Flexible Cell Association: A Comprehensive Downlink SINR Analysis

    In this paper, the authors develop a tractable framework for SINR analysis in downlink Heterogeneous Cellular Networks (HCNs) with flexible cell association policies. The HCN is modeled as a multi-tier cellular network where each tier's Base Stations (BSs) are randomly located and have a particular transmit power, path loss exponent,...

    Provided By University of Texas

  • White Papers // Jul 2011

    Capacity Bounds on Multiuser MIMO Transmission in Random Wireless Networks

    The authors consider a large wireless ad hoc network in which each multi-antenna transmitting node sends multiple independent streams to different receivers in a Poisson field of interferers. They provide exact expressions and simplified approximations on the outage probability, contention density, and transmission capacity for dirty paper coding with perfect...

    Provided By University of Texas

  • White Papers // Jul 2011

    Multiuser Zero-Forcing Beamforming With Limited Feedback in Wireless Ad Hoc Networks

    The effect of limited feedback on point-to-multipoint communication is investigated in multi-antennas wireless ad hoc networks. The authors consider zero-forcing beamforming with quantized channel direction information and derive new closed-form expressions for the outage probability, throughput, transmission capacity, and average user rate. Expressions for the performance degradation due to finite...

    Provided By University of Texas

  • White Papers // Dec 2010

    ASSERT: A Wireless Networking Testbed

    As wireless networking is becoming more pervasive, there has been a greater desire to develop communication hardware and protocol stacks that have a number of desirable properties like increased throughput, reduced latency, reduced energy consumption, quality of service, security, etc. Consequently, several academic and industrial research groups are actively working...

    Provided By University of Texas

  • White Papers // Aug 2008

    An Asynchronous Neighbor Discovery Algorithm for Cognitive Radio Networks

    Cognitive Radio (CR) technology is a promising emerging technology that enables a more efficient usage of already assigned spectrum. However, before CR networks can be deployed, new algorithms and protocols need to be developed. When forming an ad-hoc Cognitive Radio Network (CRN), one of the fundamental tasks is to determine...

    Provided By University of Texas

  • White Papers // Jan 2012

    A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems

    Causally ordered message delivery is a required property for several distributed applications particularly those that involve human interactions (such as teleconferencing and collaborative work). In this paper, the authors present an efficient protocol for causal ordering in mobile computing systems. This protocol requires minimal resources on mobile hosts and wireless...

    Provided By University of Texas

  • White Papers // Jul 2012

    Frankenstein: Stitching Malware From Benign Binaries

    This paper proposes a new self-camouflaging malware propagation system, Frankenstein, that overcomes shortcomings in the current generation of metamorphic malware. Specifically, although mutants produced by current state-of-the-art metamorphic engines are diverse, they still contain many characteristic binary features that reliably distinguish them from benign software. Frankenstein forgoes the concept of...

    Provided By University of Texas

  • White Papers // May 2012

    AnonymousCloud: A Data Ownership Privacy Provider Framework in Cloud Computing

    A means of reliably concealing ownership of cloud data without impeding computation over the data is presented and evaluated. This facilitates information privacy enforcement in cloud environments by withholding data ownership information from cloud nodes that compute using the data. As a result, nodes that have access to private data...

    Provided By University of Texas

  • White Papers // May 2012

    Hatman: Intra-Cloud Trust Management for Hadoop

    Data and computation integrity and security are major concerns for users of cloud computing facilities. Many production-level clouds optimistically assume that all cloud nodes are equally trustworthy when dispatching jobs; jobs are dispatched based on node load, not reputation. This increases their vulnerability to attack, since compromising even one node...

    Provided By University of Texas

  • White Papers // Aug 2012

    Offloading in Heterogeneous Networks: Modeling, Analysis and Design Insights

    Pushing data traffic from cellular to Wi-Fi is an example of inter-Radio Access Technology (RAT) offloading. While this clearly alleviates congestion on the over-loaded cellular network, the ultimate potential of such offloading and its effect on overall system performance is not well understood. To address this, the authors develop a...

    Provided By University of Texas

  • White Papers // Jan 2012

    Optimal Surface Deployment Problem in Wireless Sensor Networks

    Sensor deployment is a fundamental issue in a wireless sensor network, which often dictates the overall network performance. Previous studies on sensor deployment mainly focused on sensor networks on 2D plane or in 3D volume. In this paper, the authors tackle the problem of optimal sensor deployment on 3 surfaces,...

    Provided By University of Texas

  • White Papers // Jul 2001

    Product Costing And Pricing Under Long Term Capacity Commitment

    This white paper discusses about a model that is developed to analyze optimal product costing and pricing decisions when a firm must make long term commitments to some activity resource capacities. The problem is complex because of interactions between the initial capacity choices and adjustments in product costs and prices...

    Provided By University of Texas

  • White Papers // Jan 2010

    Orthogonalization to Reduce Interference Alignment Overhead in the MIMO Interference Channel

    Interference channels are useful analytical models for distributed wireless communication networks with multiple simultaneously transmitting users. The degrees-of-freedom optimal transmit strategy for interference channels are interference alignment, which requires substantial channel state knowledge throughout the network. As the network grows, the sum capacity, theoretically, increases linearly. This result, however, neglects...

    Provided By University of Texas

  • White Papers // Feb 2009

    Transmission Capacity of Two-Way Communication in Wireless Ad Hoc Networks

    Wireless ad hoc networks require bidirectional data transmission to support two-way traffic and control functions like packet acknowledgement. Most prior work on the capacity of wireless ad hoc networks, however, has focused only on one-way communication. In this paper, the authors develop the concept of transmission capacity of two-way communication...

    Provided By University of Texas

  • White Papers // Nov 2009

    Feasibility of Interference Alignment of Measured MIMO-OFDM Channels

    Interference Alignment (IA) has been shown to provide all users of an interference channel with half the capacity achievable in an interference free point-to-point link resulting in linear sum capacity scaling with the number of users in the high SNR regime. The linear scaling is achieved by cooperatively precoding transmitted...

    Provided By University of Texas

  • White Papers // Feb 2009

    An Online Learning Framework for Link Adaptation in Wireless Networks

    Current and future wireless networks require the selection of a plurality of parameters at different layers of the communication system to optimize network throughput while satisfying certain reliability constraints. In prior work, mathematical input/output models along with system performance expressions have been used to perform the parameter selection. In practice,...

    Provided By University of Texas

  • White Papers // Feb 2011

    On Secure and Resilient Telesurgery Communications Over Unreliable Networks

    Telesurgical Robot Systems (TRSs) address mission critical operations emerging in extreme fields such as battlefields, underwater, and disaster territories. The lack of wire-lined communication infrastructure in such fields makes the use of wireless technologies including satellite and ad-hoc networks inevitable. TRSs over wireless environments pose unique challenges such as preserving...

    Provided By University of Texas

  • White Papers // Feb 2010

    Open Vs. Closed Access Femtocells in the Uplink

    Femtocells are assuming an increasingly important role in the coverage and capacity of cellular networks. In contrast to existing cellular systems, femtocells are end-user deployed and controlled, randomly located, and rely on third party backhaul (e.g., DSL or cable modem). Femtocells can be configured to be either open access or...

    Provided By University of Texas

  • White Papers // Sep 2011

    AOVis: A Model-Driven Multiple-Graph Approach to Program Fact Extraction for AspectJ/Java Source Code

    AspectJ reverse engineering and visualization remains a challenge at the architectural and design levels, with fewer tools available for reverse engineers compared to other languages such as Java. Prior work on AspectJ modeling focused on forward engineering or detailed-design reverse engineering, or required special instrumentation to identify cross-cutting relationships. Effective...

    Provided By University of Texas

  • White Papers // Jan 2010

    An Adaptive Algorithm for Dynamic Tuning of MAC Parameters in IEEE 802.15.4/ZigBee Sensor Networks

    Recent studies have highlighted that IEEE 802.15.4 based Wireless Sensor Networks (WSNs) suffer from a severe unreliability problem due to the default MAC parameters setting suggested by the standard, although with a more appropriate choice it is possible to achieve the desired reliability and better energy efficiency. However, such setting...

    Provided By University of Texas

  • White Papers // Jul 2010

    Fast Neighbor Discovery With Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks

    An important step in the initialization of a wireless ad hoc network is neighbor discovery in which every node attempts to determine the set of nodes it can communicate with in one wireless hop. In recent years, cognitive radio technology has gained attention as an attractive approach to alleviate the...

    Provided By University of Texas

  • White Papers // Apr 2011

    Get Off My Prefix! the Need for Dynamic, Gerontocratic Policies in Inter-Domain Routing

    Inter-domain routing in today's Internet is plagued by security and reliability issues (e.g., prefix hijacking), which are often caused by malicious or Byzantine misbehavior. The authors argue that route selection policies must move beyond static preferences that select routes on the basis of static attributes such as route length or...

    Provided By University of Texas

  • White Papers // Dec 2010

    It's on Me! the Benefit of Altruism in BAR Environments

    Cooperation, a necessity for any Peer-To-Peer (P2P) cooperative service, is often achieved by rewarding good behavior now with the promise of future benefits. However, in most cases, interactions with a particular peer or the service itself eventually end, resulting in some last exchange in which departing participants have no incentive...

    Provided By University of Texas

  • White Papers // May 2008

    Improving the Interaction Between Overlay Routing and Traffic Engineering

    Overlay routing has been successful as an incremental method to improve Internet routing by allowing its own users to select their logical routing. In the meantime, Traffic Engineering (TE) is being used to reduce the whole network cost by adapting physical routing in response to varying traffic patterns. Previous studies...

    Provided By University of Texas

  • White Papers // Apr 2010

    An Efficient ARQ Scheme for Reliable Video Broadcasting in Wireless LANs

    Video streaming has become a popular and important type of network application. Meanwhile, wireless LANs has been gaining popularity too. It has thus become important to address the reliability problem for video streaming in wireless LANs and for video streaming from the Internet to the users in wireless LANs. This...

    Provided By University of Texas

  • White Papers // Jun 2012

    New Proof Methods for Attribute-Based Encryption: Achieving Full Security Through Selective Techniques

    The authors develop a new methodology for utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full security. This deepens the relationship between the selective and full security models and provides a path for transferring the best qualities of...

    Provided By University of Texas

  • White Papers // May 2012

    Dual Form Signatures: An Approach for Proving Security From Static Assumptions

    In this paper, the authors introduce the abstraction of Dual Form Signatures as a useful framework for proving security (existential unforgeability) from static assumptions for schemes with special structure that are used as a basis of other cryptographic protocols and applications. They describe the power of this framework by proving...

    Provided By University of Texas

  • White Papers // Feb 2012

    Security Analysis and Enhancement for Prefix-Preserving Encryption Schemes

    Prefix-Preserving Encryption (PPE) is an important type of encryption scheme, having a wide range of applications, such as IP addresses anonymization, prefix-matching search, and rang search. There are two issues in PPE schemes, security proof and single key requirement. Existing security proofs for PPE only reduce the security of a...

    Provided By University of Texas

  • White Papers // May 2012

    Dependency Path Patterns as the Foundation of Access Control in Provenance-Aware Systems

    A unique characteristics of provenance data is that it forms a Directed Acyclic Graph (DAG) in accordance with the underlying causality dependencies between entities (acting users, action processes and data objects) involved in transactions. Data provenance raises at least two distinct security-related issues. One is how to control access to...

    Provided By University of Texas

  • White Papers // May 2012

    Tag-Based Information Flow Analysis for Document Classification in Provenance

    A crucial aspect of certain applications such as the ones pertaining to Intelligence domain or Health-care, is to manage and protect sensitive information effectively and efficiently. In this paper, the authors propose a tagging mechanism to track the flow of sensitive or valuable information in a provenance graph and automate...

    Provided By University of Texas

  • White Papers // Dec 2010

    Just-in-Time Analytics on Large File Systems

    As file systems reach the peta-bytes scale, users and administrators are increasingly interested in acquiring high-level analytical information for file management and analysis. Two particularly important tasks are the processing of aggregate and top-k queries which, unfortunately, cannot be quickly answered by hierarchical file systems such as ext3 and NTFS....

    Provided By University of Texas

  • White Papers // Jan 2011

    Qualitative Comparison of Graph-Based and Logicbased Multi-Relational Data Mining: A Case Study

    The goal of this paper is to generate insights about the differences between graph-based and logic-based approaches to multi-relational data mining by performing a case study of graph-based system, Subdue and the inductive logic programming system, CProgol. The authors identify three key factors for comparing graph-based and logic-based multi-relational data...

    Provided By University of Texas

  • White Papers // Aug 2010

    Global Scheduling Based Reliability-Aware Power Management for Multiprocessor Real-Time Systems

    Reliability-Aware Power Management (RAPM) has been a recent research focus due the negative effects of the popular power management technique Dynamic Voltage and Frequency Scaling (DVFS) on system reliability. As a result, several RAPM schemes have been proposed for uniprocessor real-time systems. In this paper, for a set of frame-based...

    Provided By University of Texas

  • White Papers // Jul 2010

    Collective Specification and Verification of Behavioral Models and Object-Oriented Implementations

    The authors present a finite-state-machine-based language, iFSM, to seamlessly integrate the behavioral logic and implementation strategies of object-oriented applications to prevent their design and implementation from being out-of-sync. The language allows developers to focus on higher-level abstractions to support software analysis and design instead of focusing on language or architecture...

    Provided By University of Texas

  • White Papers // Aug 2010

    Identifying Unnecessary Bounds Checks Through Block-Qualified Variable Elimination

    Java's memory-safety relies on the Java Virtual Machine checking that each access to an array does not exceed the bounds of that array. When static analysis can determine that some array access instruction will never use an out of bounds index, the cost of dynamically checking the index each time...

    Provided By University of Texas

  • White Papers // Apr 2010

    Toward Practical Authorization-Dependent User Obligation Systems

    Many authorization system models include some notion of obligation. Little attention has been given to user obligations that depend on and affect authorizations. However, to be usable, the system must ensure users have the authorizations they need when their obligations must be performed. Prior work in this area introduced accountability...

    Provided By University of Texas

  • White Papers // Jul 2009

    An Optimal Boundary-Fair Scheduling Algorithm for Multiprocessor Real-Time Systems

    Although the scheduling problem for multiprocessor real-time systems has been studied for decades, it is still an evolving research field with many open problems. In this paper, focusing on periodic real-time tasks, the authors propose a novel optimal scheduling algorithm, namely Boundary fair (Bfair), which follows the same line of...

    Provided By University of Texas

  • White Papers // Dec 2008

    Multi-Path Planning for Mobile Element to Prolong the Lifetime of Wireless Sensor Networks

    Mobile elements, which can traverse the deployment area and convey the observed data from static sensor nodes to a base station, have been introduced for energy efficient data collection in Wireless Sensor Networks (WSNs). However, most existing solutions only plan a single path for the mobile element, which may lead...

    Provided By University of Texas

  • White Papers // Mar 2011

    Secure Friend Discovery in Mobile Social Networks

    Mobile social networks extend social networks in the cyberspace into the real world by allowing mobile users to discover and interact with existing and potential friends who happen to be in their physical vicinity. Despite their promise to enable many exciting applications, serious security and privacy concerns have hindered wide...

    Provided By University of Texas

  • White Papers // Jun 2011

    XML Query Optimization in Map-Reduce

    The authors present a novel query language for large-scale analysis of XML data on a map-reduce environment, called MRQL, that is expressive enough to capture most common data analysis tasks and at the same time is amenable to optimization. The authors' evaluation plans are constructed using a small number of...

    Provided By University of Texas

  • White Papers // May 2008

    Consensus in Wireless Ad Hoc Networks

    Solving consensus in wireless ad hoc networks has started to be addressed in several papers. Most of these papers adopt system models similar to those developed for wired networks. These models are focused towards node failures while ignoring link failures, and thus are poorly suited for wireless ad hoc networks....

    Provided By University of Texas

  • White Papers // Dec 2010

    Hybrid Partial Evaluation

    The authors present Hybrid Partial Evaluation (HPE), a pragmatic approach to partial evaluation that borrows ideas from both online and offline partial evaluation. HPE performs offline-style specialization using an online approach without static binding time analysis. The goal of HPE is to provide a practical and predictable level of optimization...

    Provided By University of Texas

  • White Papers // Jan 2011

    Programming Many-Core Architectures - A Case Study: Dense Matrix Computations on the Intel SCC Processor

    A message passing, distributed-memory parallel computer on a chip is one possible design for future, many-core architectures. The authors discuss initial experiences with the Intel Single-chip Cloud Computer research processor, which is a prototype architecture that incorporates 48 cores on a single die that can communicate via a small, shared,...

    Provided By University of Texas