University of Texas

Displaying 41-80 of 253 results

  • 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 // Jul 2011

    Downlink Femtocell Networks: Open or Closed?

    A fundamental choice in femtocell deployments is the set of users which are allowed to access each femtocell. Closed access restricts the set to specifically registered users, while open access allows any mobile subscriber to use any femtocell. The main results of the paper are lemmas which provide expressions for...

    Provided By University of Texas

  • White Papers // Jun 2011

    Fundamentals of Inter-Cell Overhead Signaling in Heterogeneous Cellular Networks

    Heterogeneous base stations (e.g. picocells, microcells, femtocells and distributed antennas) will become increasingly essential for cellular network capacity and coverage. Up until now, little basic research has been done on the fundamentals of managing so many infrastructures - much of it unplanned - together with the carefully planned macrocellular network....

    Provided By University of Texas

  • White Papers // Jun 2011

    Enhancing the Role of Inlining in Effective Interprocedural Parallelization

    The emergence of multi-core architectures makes it essential for optimizing compilers to automatically extract parallelism for large scientific applications composed of many subroutines residing in different files. Inlining is a well-known technique which can be used to erase procedural boundaries and enable more aggressive loop parallelization. However, conventional inlining cannot...

    Provided By University of Texas

  • White Papers // Jun 2011

    A Tractable Framework for Coverage and Outage in Heterogeneous Cellular Networks

    The authors develop a tractable, flexible, and accurate model for downlink heterogeneous cellular networks. It consists of K tiers of randomly-located Base Stations (BSs), where each tier may differ in terms of the average transmit power, the supported data rate and the BS density. This allows elements spanning traditional, micro,...

    Provided By University of Texas

  • White Papers // Jun 2011

    Average Rate Achievable in K-Tier Downlink Heterogeneous Cellular Networks

    Cellular networks are becoming increasingly heterogeneous due to the co-deployment of many disparate infrastructure elements, including micro, pico and femtocells, and distributed antennas. This introduces new challenges in the modeling, analysis, and design of these networks. While grid-based models have been quite popular in modeling classical macrocell networks, they are...

    Provided By University of Texas

  • White Papers // Jun 2011

    3G Meets the Internet: Understanding the Performance of Hierarchical Routing in 3G Networks

    The volume of Internet traffic over 3G wireless networks is sharply rising. In contrast to many Internet services utilizing replicated resources, such as Content Distribution Networks (CDN), the current 3G standard architecture employs hierarchical routing, where all user data traffic goes through a small number of aggregation points using logical...

    Provided By University of Texas

  • White Papers // Jun 2011

    Cloaking Malware With the Trusted Platform Module

    The Trusted Platform Module (TPM) is commonly thought of as hardware that can increase platform security. However, it can also be used for malicious purposes. The TPM, along with other hardware, can implement a cloaked computation, whose memory state cannot be observed by any other software, including the operating system...

    Provided By University of Texas

  • White Papers // Jun 2011

    A Framework for Resource-Aware Data Accumulation in Sparse Wireless Sensor Networks

    Wireless Sensor Networks (WSNs) have become an enabling technology for a wide range of applications. In contrast, with traditional scenarios where static sensor nodes are densely deployed, a sparse WSN architecture can also be used in many cases. In a sparse WSN, special Mobile Data Collectors (MDCs) are used to...

    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 // Jun 2011

    Coverage in Two-Tier Cellular Networks With Fractional Frequency Reuse

    Fractional Frequency Reuse (FFR) is an interference management technique well-suited to OFDMA-based cellular networks wherein the cells are partitioned into spatial regions with different frequency reuse factors. These techniques are of further relevance when considered in the context of heterogeneous networks whose performance is often limited by intercell and inter-tier...

    Provided By University of Texas

  • White Papers // Jun 2011

    Network Control: A Rate-Distortion Perspective

    Today's networks are controlled assuming precompressed and packetized data. For video, this assumption of data packets abstracts out one of the key aspects - the lossy compression problem. Therefore, first, this paper develops a framework for network control that incorporates both source-rate and source-distortion. Next, it decomposes the network control...

    Provided By University of Texas

  • White Papers // May 2011

    Characterizing Decentralized Wireless Networks With Temporal Correlation in the Low Outage Regime

    Communication in decentralized wireless networks is limited by interference. Because transmissions typically last for more than a single contention time slot, interference often exhibits strong statistical dependence over time that results in temporally correlated communication performance. The temporal dependence in interference increases as user mobility decreases and/or the total transmission...

    Provided By University of Texas

  • White Papers // May 2011

    Broadcast Channels With Delayed Finite-Rate Feedback: Predict or Observe?

    Most multiuser pre-coding techniques require accurate Transmitter Channel State Information (CSIT) to maintain orthogonality between the users. Such techniques have proven quite fragile in time-varying channels because the CSIT is inherently imperfect due to estimation and feedback delay, as well quantization noise. An alternative approach recently proposed by Maddah-Ali and...

    Provided By University of Texas

  • White Papers // May 2011

    EVE: Verifying Correct Execution of Cloud-Hosted Web Applications

    The authors present a new approach to verifying that a completely untrusted, Platform-as-a-Service cloud is correctly executing an outsourced web application. Web applications such as blogs, wikis, and online social networks are increasingly hosted on third-party, "Platform-as-a-Service" (PaaS) clouds. The owner outsources the execution of his application to a cloud...

    Provided By University of Texas

  • White Papers // May 2011

    Architecture and Abstractions for Environment and Traffic Aware System-Level Coordination of Wireless Networks

    This paper presents a system level approach to interference management in an infrastructure based wireless network with full frequency reuse. The key idea is to use loose base station coordination that is tailored to the spatial load distribution and the propagation environment to exploit the diversity in a user population's...

    Provided By University of Texas

  • White Papers // May 2011

    Practical Adaptive User Association Policies for Wireless Systems With Dynamic Interference

    The authors study the impact of user association policies on flow-level performance in interference-limited wireless networks. Most research in this area has used static interference models (neighboring base stations are always active) and resorted to intuitive objectives such as load balancing. In this paper, they show that this can be...

    Provided By University of Texas

  • White Papers // May 2011

    Secure Data Processing in a Hybrid Cloud

    Cloud computing has made it possible for a user to be able to select a computing service precisely when needed. However, certain factors such as security of data and regulatory issues will impact a user's choice of using such a service. A solution to these problems is the use of...

    Provided By University of Texas

  • White Papers // May 2011

    Regret-Freedom Isn't Free

    Cooperative, Peer-To-Peer (P2P) services-distributed systems consisting of participants from Multiple Administrative Domains (MAD)|must deal with the threat of arbitrary (Byzan-tine) failures while incentivizing the cooperation of potentially selfish (rational) nodes that such services rely on to function. Although previous work has generally agreed that these types of participants need to...

    Provided By University of Texas

  • White Papers // May 2011

    Consistency, Availability, and Convergence

    The authors examine the limits of consistency in fault-tolerant distributed storage systems. In particular, they identify fundamental tradeoffs among properties of consistency, availability, and convergence, and the authors close the gap between what is known to be impossible (i.e. CAP) and known systems that are highly-available but that provide weaker...

    Provided By University of Texas

  • White Papers // Apr 2011

    Mechanizing the Expert Dense Linear Algebra Developer

    Sustained high performance on the fastest computers in the world has traditionally been accomplished by experts who carefully hand-code key routines. This quickly becomes unmanageable for large bodies of software and/or as architectures change enough that entire libraries need to be rewritten. The authors believe the problem is that a...

    Provided By University of Texas

  • White Papers // Apr 2011

    Towards Security-Aware Program Visualization for Analyzing In-Lined Reference Monitors

    In-lined Reference Monitoring frameworks are an emerging technology for enforcing security policies over untrusted, mobile, binary code. However, formulating correct policy specifications for such frameworks to enforce remains a daunting undertaking with few supporting tools. A visualization approach is proposed to aid in this task; preliminary results are presented in...

    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 // Apr 2011

    Combating Channel Impairments and Impulsive Noise in Local Utility Powerline Communications

    A smart grid intelligently monitors and controls energy flow in order to improve the efficiency and reliability of power delivery. This monitoring and control requires low-delay, real-time, highly reliable communications between customers, local utilities and regional utilities. This paper focuses on PowerLine Communications (PLC) from the customer power meters to...

    Provided By University of Texas

  • White Papers // Apr 2011

    Repair From a Chair: Computer Repair as an Untrusted Cloud Service

    Today, when people need their computers repaired, their process is not very different from hiring someone to fix a television: they either bring the computer to a repair service, or they call a technician (or family member) and ask for a house call. This process is inconvenient. It also risks...

    Provided By University of Texas

  • White Papers // Apr 2011

    Toward Practical and Unconditional Verification of Remote Computations

    This paper revisits a classic question: how can a machine specify a computation to another one and then, without executing the computation, check that the other machine carried it out correctly? The applications of such a primitive include cloud computing (a computationally limited device offloads processing to the cloud but...

    Provided By University of Texas

  • White Papers // Apr 2011

    The K-Observer Problem in Computer Networks

    For any non-negative integer K, a K-observer P of a network N is a set of nodes in N such that each message, that travels at least K hops in N, is handled (and so observed) by at least one node in P. A K-observer P of a network N...

    Provided By University of Texas

  • White Papers // Apr 2011

    Dynamic Focusing of Awareness in Fuzzy Control Systems

    Adaptive fuzzy logic control systems with Gaussian membership functions are described. A systematic simulation study of 'Dynamic focusing of awareness' in fuzzy logic control systems is provided. This study shows how the final steady-state values of the membership functions change in response to varying initial membership functions, changing desired trajectory,...

    Provided By University of Texas

  • White Papers // Mar 2011

    Ergodic Transmission Capacity of Wireless Ad Hoc Networks With Interference Management

    Most work on wireless network throughput ignores the temporal correlation inherent to wireless channels because it degrades tractability. To better model and quantify the temporal variations of wireless network throughput, this paper introduces a metric termed Ergodic Transmission Capacity (ETC), which includes spatial and temporal ergodicity. All transmitters in the...

    Provided By University of Texas

  • White Papers // Mar 2011

    A New Way of Computing Rate in Cellular Networks

    It is common practice to model the Base Station (BS) locations in a cellular system by a grid, such as a hexagonal or square lattice. This model is usually analytically intractable as well as quite idealized. Therefore, system designers resort to complex simulations to evaluate network performance. In this paper,...

    Provided By University of Texas

  • White Papers // Mar 2011

    Secure Multidimensional Range Queries Over Outsourced Data

    In this paper the authors study the problem of supporting multidimensional range queries on encrypted data. The problem is motivated by secure data outsourcing applications where a client may store his/her data on a remote server in encrypted form and want to execute queries using server's computational capabilities. The solution...

    Provided By University of Texas

  • White Papers // Mar 2011

    Deterministic Public-Key Encryption Revisited

    One of the maxims of modern cryptography is that "Randomness is needed for good encryption," meaning the encryption algorithm of a scheme that should be randomized. Such an encryption scheme is called probabilistic. Indeed, probabilistic encryption is necessary to meet the fundamental notion of semantic security introduced by Goldwasser and...

    Provided By University of Texas

  • White Papers // Mar 2011

    Fuzzy Optimization for Mobile Ad Hoc Networks: A Bottom-up Cross-Layer Approach

    In this paper, the authors introduce a new method for cross-layer design in mobile ad hoc networks. They use Fuzzy Logic System (FLS) to coordinate physical layer, data-link layer and application layer for cross-layer design. Ground speed, average delay and packets successful transmission ratio are selected as antecedents for the...

    Provided By University of Texas

  • White Papers // Mar 2011

    Efficient Lattice (H)IBE in the Standard Model

    The authors construct an efficient identity based encryption system based on the standard Learning With Errors (LWE) problem. Their security proof holds in the standard model. The key step in the construction is a family of lattices for which there are two distinct trapdoors for finding short vectors. One trapdoor...

    Provided By University of Texas

  • White Papers // Mar 2011

    Outage Probability for Heterogeneous Cellular Networks With Biased Cell Association

    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 BSs are randomly located and have a unique transmit power, path loss exponent, spatial density,...

    Provided By University of Texas

  • White Papers // Mar 2011

    TPP: The Two-Way Password Protocol

    The need for secure communication in the Internet has led to the widespread deployment of secure application-level protocols. The current state-of-the-art is to use TLS, in conjunction with a password protocol. The password protocol, which the authors call a One-way Password Protocol (OPP), authenticates the client to the server, using...

    Provided By University of Texas

  • White Papers // Mar 2011

    Modeling and Analysis of K-Tier Downlink Heterogeneous Cellular Networks

    Cellular networks are in a major transition from a carefully planned set of large tower-mounted BaseStations (BSs) to an irregular deployment of heterogeneous infrastructure elements that often additionally includes micro, pico, and femtocells, as well as distributed antennas. In this paper, the authors develop a tractable, flexible, and accurate model...

    Provided By University of Texas

  • White Papers // May 2010

    JSZap: Compressing JavaScript Code

    JavaScript is widely used in web-based applications, and gigabytes of JavaScript code are transmitted over the Internet every day. Current efforts to compress JavaScript to reduce network delays and server bandwidth requirements rely on syntactic changes to the source code and content encoding using gzip. This paper considers reducing the...

    Provided By University of Texas

  • White Papers // Feb 2010

    Real-Time, Unobtrusive, and Efficient Program Execution Tracing With Stream Caches and Last Stream Predictors

    This paper introduces a new hardware mechanism for capturing and compressing program execution traces unobtrusively in real-time. The proposed mechanism is based on two structures called stream cache and last stream predictor. The authors explore the effectiveness of a trace module based on these structures and analyze the design space....

    Provided By University of Texas

  • White Papers // Jan 2011

    Practical Utilities for Monitoring Multicast Service Availability

    Monitoring has become one of the key issues for the successful deployment of IP multicast in the Internet. During the last decade, several tools and systems have been developed to monitor several different characteristics of IP multicast. In this paper, the authors focus on one specific monitoring task: monitoring end-to-end...

    Provided By University of Texas

  • White Papers // Dec 2010

    Parallel Graph Partitioning on Multicore Architectures

    Graph partitioning is a common and frequent preprocessing step in many high-performance parallel applications on distributed and shared-memory architectures. It is used to distribute graphs across memory and to improve spatial locality. There are several parallel implementations of graph partitioning for distributed-memory architectures. In this paper, the authors present a...

    Provided By University of Texas

  • White Papers // Feb 2011

    Synthesizing Concurrent Schedulers for Irregular Algorithms

    Scheduling is the assignment of tasks or activities to processors for execution, and it is an important concern in parallel programming. Most prior work on scheduling has focused either on static scheduling of applications in which the dependence graph is known at compile-time or on dynamic scheduling of independent loop...

    Provided By University of Texas

  • White Papers // Aug 2010

    Objective Risk Evaluation for Automated Security Management

    Network security depends on a number of factors. And a common characteristic of these factors is that they are dynamic in nature. Such factors include new vulnerabilities and threats, the network policy structure and traffic. These factors can be divided into two broad categories. Network risk and service risk. As...

    Provided By University of Texas

  • White Papers // Oct 2009

    On the Fundamental Limits of Interweaved Cognitive Radios

    This paper considers the problem of channel sensing in cognitive radios. The system model considered is a set of N parallel (dis-similar) channels, where each channel at any given time is either available or occupied by a legitimate user. The cognitive radio is permitted to sense channels to determine each...

    Provided By University of Texas

  • White Papers // May 2010

    Sensitive White Space Detection With Spectral Covariance Sensing

    This paper proposes a novel, highly effective spectrum sensing algorithm for cognitive radio and whitespace applications. The proposed Spectral Covariance Sensing (SCS) algorithm exploits the different statistical correlations of the received signal and noise in the frequency domain. Test statistics are computed from the covariance matrix of a partial spectrogram...

    Provided By University of Texas

  • White Papers // Feb 2011

    Innovating To Optimize Supply Chain Management

    As an innovator dedicated to collaboration with the network of vendors and customers, Advanced Micro Devices (AMD) considers the supply chain to be a key component to the success and one of the most important competitive assets. How important? Just one change the way the authors handle the supply chain...

    Provided By University of Texas

  • White Papers // Jan 2011

    Operating System Support for Massive Replication

    The increasing number of devices used by each user to access data and services and the increasing importance of the data and services available electronically both favor "Access-anywhere" network-delivered services. Unfortunately, making such services highly available is difficult. For example, even though end servers or service hosting sites advertise an...

    Provided By University of Texas

  • White Papers // Nov 2010

    Corporate Leverage, Debt Maturity And Credit Default Swaps: The Role Of Credit Supply

    Does the ability of suppliers of debt to hedge risk through Credit Default Swap (CDS) contracts impact firms' capital structures? This paper uses CDS markets as a proxy for a relaxation of firms' credit supply constraints and tests whether supply frictions impact capital structure and debt maturity. The authors find...

    Provided By University of Texas

  • White Papers // Jan 2010

    IP Address Assignment in a Mobile Ad Hoc Network

    A Mobile Ad Hoc NETwork (MANET) consists of a set of identical mobile nodes communicating with each other via wireless links. The network's topology may change rapidly and unpredictably. Such networks may operate in a stand-alone fashion, or may be connected to the larger Internet. In traditional networks, hosts rely...

    Provided By University of Texas

  • White Papers // Jan 2010

    PeterNet : An Emergent Technology Based Radio Access Network Architecture for Next Generation Cellular Wireless Systems

    For next generation wireless cellular networks, the Radio Access Network (RAN) component is destined to evolve into a high-capacity, flexible and reconfigurable network architecture supporting smaller cell sites and newer technologies. Based on the well-known Petersen graph, in this paper the authors propose a RAN architecture, named PeterNet, that interconnects...

    Provided By University of Texas

  • White Papers // Jan 2010

    Energy Consumption in Wireless Sensor Networks Using GSP

    One of the main design issues for a sensor network is conservation of the energy available at each sensor node. The authors propose to deploy multiple, mobile base stations to prolong the lifetime of the sensor network. They split the lifetime of the sensor network into equal periods of time...

    Provided By University of Texas

  • White Papers // Aug 2009

    Using Dead Blocks as a Virtual Victim Cache

    Caches mitigate the long memory latency that limits the performance of modern processors. However, caches can be quite inefficient. On average, a cache block in a 2MB L2 cache is dead 59% of the time, i.e., it will not be referenced again before it is evicted. Increasing cache efficiency can...

    Provided By University of Texas

  • White Papers // Mar 2010

    Energy Efficient Block-Partitioned Multicore Processors for Parallel Applications

    Energy management has become an important research area in the last decade. As an energy efficient architecture, multicore has been widely adopted. However, with the number of cores on a single chip continuing to increase, it has been a grand challenge to effectively manage the energy efficiency of multicore-based systems....

    Provided By University of Texas

  • White Papers // Jul 2010

    Source Capture Time Analysis of Privacy Communication Protocols for Wireless Sensor Networks

    Communication privacy techniques that protect the locations of source sensor nodes and sink nodes from either global or local adversaries have received significant attention recently. The improvement in capture time, which is the time it takes for an adversary to identify the location of the source, is often estimated using...

    Provided By University of Texas

  • White Papers // Jun 2010

    SIDEKICK: Genomic Data Driven Analysis and Decision-Making Framework

    Scientists striving to unlock mysteries within complex biological systems face myriad barriers in effectively integrating available information to enhance their understanding. While experimental techniques and available data sources are rapidly evolving, useful information is dispersed across a variety of sources, and sources of the same information often do not use...

    Provided By University of Texas

  • White Papers // Jan 2010

    Safe, Multiphase Bounds Check Elimination in Java

    As part of its type-safety regime, the Java semantics require precise exceptions at runtime when programs attempt out-of-bound array accesses. This paper describes a Java implementation that utilizes a multiphase approach to identifying safe array accesses. This approach reduces runtime overhead by spreading the out-of-bounds checking effort across three phases...

    Provided By University of Texas

  • White Papers // Sep 2009

    Adaptive Spatial Intercell Interference Cancellation in Multicell Wireless Networks

    Downlink spatial InterCell Interference Cancellation (ICIC) is considered for mitigating other-cell interference using multiple transmit antennas. A principle question the authors explore is whether it is better to do ICIC or simply standard single-cell beamforming. They explore this question analytically and show that beamforming is preferred for all users when...

    Provided By University of Texas

  • White Papers // Dec 2009

    Limited Feedback for Temporally Correlated MIMO Channels With Other Cell Interference

    Limited feedback improves link reliability with a small amount of feedback from the receiver back to the transmitter. In cellular systems, the performance of limited feedback will be degraded in the presence of other cell interference, when the base stations have limited or no coordination. This paper establishes the degradation...

    Provided By University of Texas

  • White Papers // Aug 2010

    A Super-Logarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks

    A variety of different classes of sorting networks have been described in the literature. Of particular interest here are the so-called AKS network discovered by Ajtai, Komlos, and Szemeredi, and the sorting networks proposed by Batcher. While the AKS network is the only known sorting network with O (lgn) depth,...

    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 // Jan 2011

    DRES: Dynamic Range Encoding Scheme for TCAM Coprocessors

    One of the most critical resource management issues in the use of Ternary Content Addressable Memory (TCAM) for packet classification/filtering is how to effectively support filtering rules with ranges, known as range matching. In this paper, a Dynamic Range Encoding Scheme (DRES) is proposed to significantly improve TCAM storage efficiency...

    Provided By University of Texas

  • White Papers // Feb 2010

    The Anatomy of a Click: Modeling User Behavior on Web Information Systems

    Providing relevant information to users with minimal effort on their part remains the holy grail of search science. Since the retrieval and presentation of search results as well as any dynamic search engine behavior depend on the estimated user intent, it is highly critical to accurately infer the user intent...

    Provided By University of Texas

  • White Papers // Jan 2011

    Using Valgrind to Detect Undefined Value Errors With Bit-Precision

    The authors present Memcheck, a tool that has been implemented with the dynamic binary instrumentation framework Valgrind. Memcheck detects a wide range of memory errors in programs as they run. This paper focuses on one kind of error that Memcheck detects: undefined value errors. Such errors are common, and often...

    Provided By University of Texas

  • White Papers // Jan 2007

    Disclosure Quality And Its Effect On Litigation Risk

    This paper examines the relationship between the quality of disclosure in companies' 10-K filings and the risk of securities class action litigation. The author uses a dataset containing 10-K documents filed electronically with the SEC in the period 1996-2005. Using two content analysis software programs that analyze the categories of...

    Provided By University of Texas

  • White Papers // Jan 2011

    Discovering Substructures in the Chemical Toxicity Domain

    The researcher's ability to interpret the data and discover interesting patterns within the data is of great importance as it helps in obtaining relevant SARs [Srinivasan et al.], for the cause of chemical cancers (e.g., Progol identified a primary amine group as a relevant SAR for the cause of chemical...

    Provided By University of Texas

  • White Papers // Jan 2011

    Structure Discovery in Sequentially-Connected Data Streams

    Much of current data mining research is focused on discovering sets of attributes that discriminate data entities into classes, such as shopping trends for a particular demographic group. In contrast, the authors are working to develop data mining techniques to discover patterns consisting of complex relationships between entities. Their research...

    Provided By University of Texas

  • White Papers // Jan 2011

    Using a Graph-Based Data Mining System to Perform Web Search

    The World Wide Web provides an immense source of information. Accessing information of interest presents a challenge to scientists and analysts, particularly if the desired information is structural in nature. The authors' goal is to design a structural search engine that uses the hyperlink structure of the Web, in addition...

    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 // 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

  • White Papers // Feb 2011

    Is That You? Authentication in a Network Without Identities

    Most networks require that their users have "Identities", i.e. have names that are fixed for a relatively long time, unique, and have been approved by a central authority (in order to guarantee their uniqueness). Unfortunately, this requirement, which was introduced to simplify the design of networks, has its own drawbacks....

    Provided By University of Texas

  • White Papers // Mar 2011

    TPP: The Two-Way Password Protocol

    The need for secure communication in the Internet has led to the widespread deployment of secure application-level protocols. The current state-of-the-art is to use TLS, in conjunction with a password protocol. The password protocol, which the authors call a One-way Password Protocol (OPP), authenticates the client to the server, using...

    Provided By University of Texas

  • White Papers // Apr 2011

    The K-Observer Problem in Computer Networks

    For any non-negative integer K, a K-observer P of a network N is a set of nodes in N such that each message, that travels at least K hops in N, is handled (and so observed) by at least one node in P. A K-observer P of a network N...

    Provided By University of Texas

  • White Papers // Apr 2011

    Mechanizing the Expert Dense Linear Algebra Developer

    Sustained high performance on the fastest computers in the world has traditionally been accomplished by experts who carefully hand-code key routines. This quickly becomes unmanageable for large bodies of software and/or as architectures change enough that entire libraries need to be rewritten. The authors believe the problem is that a...

    Provided By University of Texas

  • White Papers // May 2011

    Regret-Freedom Isn't Free

    Cooperative, Peer-To-Peer (P2P) services-distributed systems consisting of participants from Multiple Administrative Domains (MAD)|must deal with the threat of arbitrary (Byzan-tine) failures while incentivizing the cooperation of potentially selfish (rational) nodes that such services rely on to function. Although previous work has generally agreed that these types of participants need to...

    Provided By University of Texas

  • White Papers // May 2011

    Consistency, Availability, and Convergence

    The authors examine the limits of consistency in fault-tolerant distributed storage systems. In particular, they identify fundamental tradeoffs among properties of consistency, availability, and convergence, and the authors close the gap between what is known to be impossible (i.e. CAP) and known systems that are highly-available but that provide weaker...

    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