University of Wisconsin

Displaying 1-40 of 132 results

  • White Papers // Aug 2012

    Towards Energy-Efficient Database Cluster Design

    Energy is a growing component of the operational cost for many "Big data" deployments, and hence has become increasingly important for practitioners of large-scale data analysis who require scale-out clusters or parallel DBMS appliances. Although a number of recent studies have investigated the energy efficiency of DBMSs, none of these...

    Provided By University of Wisconsin

  • White Papers // Jun 2012

    Reducing Memory Reference Energy With Opportunistic Virtual Caching

    Most modern cores perform a highly-associative Translation Look aside Buffer (TLB) lookup on every memory access. These designs often hide the TLB lookup latency by overlapping it with L1 cache access, but this overlap does not hide the power dissipated by TLB lookups. It can even exacerbate the power dissipation...

    Provided By University of Wisconsin

  • White Papers // May 2012

    A Passive Measurement System for Network Testbeds

    The ability to capture and process packet-level data is of intrinsic importance in network testbeds that offer broad experimental capabilities to researchers. In this paper, the authors describe the design and implementation of a passive measurement system for network testbeds called GIMS. The system enables users to specify and centrally...

    Provided By University of Wisconsin

  • White Papers // May 2012

    Obtaining Representative Measurements of Cellular Network Performance

    Network service providers, and other parties, require an accurate understanding of the performance cellular networks deliver to users. In particular, they often seek a measure of the network performance users experience solely when they are interacting with their device - a measure the authors call representative. Acquiring such measures is...

    Provided By University of Wisconsin

  • White Papers // Jan 2012

    Phantom: Physical Layer Cooperation for Location Privacy Protection

    Localization techniques that allow inferring the location of wireless devices directly from received signals have exposed mobile users to new threats. Adversaries can easily collect required information (such as signal strength) from target users, however, techniques securing location information at the physical layer of the wireless communication systems have not...

    Provided By University of Wisconsin

  • White Papers // Nov 2011

    Design and Performance of Distributed Mechanisms for Flow Admission in Wireless Adhoc Networks

    Given a wireless network where some pairs of communication links interfere with each other, the authors study sufficient conditions for determining whether a given set of minimum bandwidth Quality-of-Service (QoS) requirements can be satisfied. They are especially interested in algorithms which have low communication overhead and low processing complexity. The...

    Provided By University of Wisconsin

  • White Papers // Oct 2011

    Polymorphic Type Inference for Scripting Languages With Object Extensions

    This paper presents a polymorphic type inference algorithm for a small subset of JavaScript. The goal is to prevent accessing undefined members of objects. The authors define a type system that allows explicit extension of objects through add operation and implicit extension through method calls. The type system also permits...

    Provided By University of Wisconsin

  • White Papers // Jul 2011

    Optimal Scheduling Policies With Mutual Information Accumulation in Wireless Networks

    In this paper, the authors aim to develop scheduling policies to maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. This enhanced physical layer capability enables the system to accumulate information even when the link between two nodes...

    Provided By University of Wisconsin

  • White Papers // May 2011

    How National And International Financial Development Affect Industrial R&D

    The authors examine the impacts of both domestic and international financial market development on R&D intensities in 22 manufacturing industries in 18 OECD countries for the period 1990- 2003. They take account of such industry characteristics as the need for external financing and the amount of tangible assets. Multiple forms...

    Provided By University of Wisconsin

  • White Papers // Mar 2011

    Flexible Traffic and Host Profiling Via DNS Rendezvous

    The ability to accurately classify network traffic and to perform timely detection of the presence of unwanted classes of traffic has important implications for network operations and security. In recent years, classification has become more challenging due to applications that use ports that are not well-known that overload or masquerade...

    Provided By University of Wisconsin

  • White Papers // Mar 2011

    Power-Awareness Extensions for Network Testbeds

    The escalation in power consumption of networking and communications equipment is of concern to technologists and environmentalists alike. Understanding how and when networking devices consume power is complicated by their lack of instrumentation. Furthermore, standard networking devices are not typically flexible enough to support experiments with new techniques for reducing...

    Provided By University of Wisconsin

  • White Papers // Mar 2011

    Fingerprinting 802.11 Rate Adaptation Algorithms

    The effectiveness of rate adaptation algorithms is an important determinant of 802.11 wireless network performance. The diversity of algorithms that has resulted from efforts to improve rate adaptation has introduced a new dimension of variability into 802.11 wireless networks, further complicating the already difficult task of understanding and debugging 802.11...

    Provided By University of Wisconsin

  • White Papers // Mar 2011

    PIE in the Sky: Online Passive Interference Estimation for Enterprise WLANs

    Trends in enterprise WLAN usage and deployment point to the need for tools that can capture interference in real time. A tool for interference estimation can not only enable WLAN managers to improve network performance by dynamically adjusting operating parameters like the channel of operation and transmit power of access...

    Provided By University of Wisconsin

  • White Papers // Feb 2011

    Secret Key Generation Through OFDM Multipath Channel

    The authors analyze the fundamental limits of key generation and describe an implementation based on error correcting codes. They show that key extraction based on channel coefficients significantly outperforms key extraction based on Received Signal Strength Indicators (RSSI). The development in this paper is based on an IEEE 802.11a Orthogonal...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    DomainImpute: Inferring Unseen Components in the Internet

    Despite many efforts over the past decade, the ability to generate topological maps of the Internet at the router-level accurately and in a timely fashion remains elusive. Mapping campaigns commonly involve traceroute-like probing that are usually non-adaptive and incomplete, thus revealing only a portion of the underlying topology. In this...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Dynamic Interference Adaptation for Wireless Mesh Networks

    Most wireless meshes will have to operate within the crowded unlicensed spectrum that is also shared by numerous uncoordinated 802.11 hotspots. This creates an unpredictable and variable spectrum space that mesh networks need to co-exist within. The authors propose a novel method for adapting to such external interference by dynamically...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Heterogeneity in Large Scale Low-Power Ad-Hoc Wireless Sensor Networks

    Wireless sensor networks have recently become a growing area of research and development due to the tremendous number of applications that can greatly benefit from such systems. In the past the majority of research efforts have implicitly assumed homogenous networks. While this is true of certain applications, in this paper...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Static Program Analysis Via 3-Valued Logic

    This paper reviews the principles behind the paradigm of "Abstract interpretation via 3-valued logic," discusses recent work to extend the approach, and summarizes ongoing research aimed at overcoming remaining limitations on the ability to create program analysis algorithms fully automatically. Static analysis concerns techniques for obtaining information about the possible...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Automatic Verification of Strongly Dynamic Software Systems

    Strongly dynamic software systems are difficult to verify. By strongly dynamic, the authors mean that the actors in such systems change dynamically, that the resources used by such systems are dynamically allocated and deallocated, and that for both sets, no bounds are statically known. In this position paper, they describe...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    A Non-Blocking Parallel Spatial Join Algorithm

    Interest in incremental and adaptive query processing has led to the investigation of equijoin evaluation algorithms that are non-blocking. This investigation has yielded a number of algorithms, including the symmetric hash join, the XJoin, the Ripple Join, and their variants. However, to the knowledge no one has proposed a non-blocking...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Analysis of SPKI/SDSI Certificates Using Model Checking

    SPKI/SDSI is a framework for expressing naming and authorization issues that arise in a distributed-computing environment. In this paper, the authors establish a connection between SPKI/SDSI and a formalism known as Pushdown Systems (PDSs). They show that the SPKI/SDSI-to-PDS connection provides a framework for formalizing a variety of certificate-analysis problems....

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Efficient Context-Sensitive Intrusion Detection

    Model-based intrusion detection compares a process's execution against a program model to detect intrusion attempts. Models constructed from static program analysis have historically traded precision for efficiency. The authors address this problem with the Dyck model, the first efficient statically-constructed context-sensitive model. This model species both the correct sequences of...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Two Formal Analyses of Attack Graphs

    An attack graph is a succinct representation of all paths through a system that end in a state where an intruder has successfully achieved his goal. Today Red Teams determine the vulnerability of networked systems by drawing gigantic attack graphs by hand. Constructing attack graphs by hand is tedious, error-prone,...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Towards Automatic Generation of Vulnerability-Based Signatures

    In this paper the authors explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic variants. The work departs from previous approaches by focusing on the semantics of the program and vulnerability exercised by a sample exploit instead of...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Efficient Filtering in Publish-Subscribe Systems Using Binary Decision Diagrams

    Implicit invocation or publish-subscribe has become an important architectural style for large-scale system design and evolution. The publish-subscribe style facilitates developing large-scale systems by composing separately developed components because the style permits loose coupling between various components. One of the major bottlenecks in using publish-subscribe systems for very large scale...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    View Learning for Statistical Relational Learning: With an Application to Mammography

    Statistical Relational Learning (SRL) constructs probabilistic models from relational databases. A key capability of SRL is the learning of arcs (In the Bayes net sense) connecting entries in different rows of a relational table, or in different tables. Nevertheless, SRL approaches currently are constrained to use the existing database schema....

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Tracking the Role of Adversaries in Measuring Unwanted Traffic

    Measurements related to security are being carried out on many sites on the Internet at network ingress points, between specific points on the Internet, and across the wide area Internet. The goals range from identifying sources of and possibly filtering unwanted traffic, to characterizing and coming up with new mechanisms...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries

    In this paper, the authors design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping strategies, PushDown and PullUp, in which selections are either pushed below, or pulled above, joins are proposed and investigated. While the earlier research...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Semantics-Preserving Procedure Extraction

    Procedure extract ion is an important program transformation that can be used to make programs easier to understand and maintain, to facilitate code reuse, and to convert "Monolithic" code to modular or object - oriented code. Procedure extraction involves the following steps: The statements to be extracted are identified (by...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Adaptive Control for Anonymous Network-Attached Storage

    The authors describe techniques for building an anonymous network-attached storage system. Central to the design is adaptation, which enables higher performance without administrative tuning. Via a range of simulation experiments and a prototype implementation, they quantify the costs of providing anonymous storage and explore the parameters to which system performance...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Change of Representation for Statistical Relational Learning

    Statistical Relational learning (SRL) algorithms learn statistical models from relational data, such as that stored in a relational database. The authors previously introduced view learning for SRL, in which the view of a relational database can be automatically modified, yielding more accurate statistical models. The present paper presents SAYU-VISTA, an...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Caching for Multi-Dimensional Data Mining Queries

    Multi-dimensional data analysis and online analytical processing are standard querying techniques applied on today's data warehouses. Data mining algorithms, on the other hand, are mostly run in stand-alone, batch mode on at les extracted from relational databases. In this paper the authors propose a general querying model combining the power...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Multiprocessor Scheduling Using Dynamic Performance Measurement and Analysis

    In this paper the authors address using dynamic performance metrics when making scheduling decisions. The focus is on the problem of cache affinity in multiprocessor CPU schedulers. The Linux 2.4 kernel uses a simplistic method to determine cache affinity, one that does not take into account the working set size...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Program Generalization for Software Reuse: From C to C++

    The authors consider the problem of software generalization: Given a program component C, create a parameterized program component C' such that C' is usable in a wider variety of syntactic contexts than C. Furthermore, C' should be a semantically meaningful generalization of C; namely, there must exist an instantiation of...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Modeling Congestion in Backbone Routers

    Traffic engineering models based on end-to-end loss probabilities and delays do not scale well to fast backbone links. In this paper, the authors investigate the nature of congestion events in highly aggregated flows. An examination of congestion events shows distinct phases of queue buildup, packet dropping followed later by TCP...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Inferring Regulatory Networks From Time Series Expression Data and Relational Data Via Inductive Logic Programming

    In this paper, the authors are interested in learning rules that will reveal the causal genes for the expression variation from various relational data sources in addition to gene expression data. Following the previous work where they showed that time series gene expression data could potentially uncover causal effects, they...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Updates for Structure Indexes

    The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexes as supporting data structures for this problem. In this paper, the authors investigate efficient update algorithms for structure indexes. They study two kinds of updates-the addition...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    The Design, Implementation, and Evaluation of mpiBLAST

    mpiBLAST is an open-source parallelization of BLAST that achieves superlinear speed-up by segmenting a BLAST database and then having each node in a computational cluster search a unique portion of the database. Database segmentation permits each node to search a smaller portion of the database, eliminating disk I/O and vastly...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Locking Protocols for Materialized Aggregate Join Views

    The maintenance of materialized aggregate join views is a well-studied problem. However, to date the published literature has largely ignored the issue of concurrency control. Clearly immediate materialized view maintenance with transactional consistency, if enforced by generic concurrency control mechanisms, can result in low levels of concurrency and high rates...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Formalizing Sensitivity in Static Analysis for Intrusion Detection

    A key function of a host-based intrusion detection system is to monitor program execution. Models constructed using static analysis have the highly desirable feature that they do not produce false alarms; however, they may still miss attacks. Prior work has shown a trade-off between efficiency and precision. In particular, the...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Dynamic Interference Adaptation for Wireless Mesh Networks

    Most wireless meshes will have to operate within the crowded unlicensed spectrum that is also shared by numerous uncoordinated 802.11 hotspots. This creates an unpredictable and variable spectrum space that mesh networks need to co-exist within. The authors propose a novel method for adapting to such external interference by dynamically...

    Provided By University of Wisconsin

  • White Papers // Jun 2008

    Regional Integration And The (RE) Distribution Of Foreign Direct Investment Between Asymmetric Hosts

    The authors analyze the impact of economic integration on the activities of multinational enterprises in a general equilibrium model with asymmetric countries. Foreign Direct Investment (FDI) inflows are likely only to the extent that multinationals have not already shifted production to the integrating region. Integration could lead to industry rationalization...

    Provided By University of Wisconsin

  • White Papers // Mar 2011

    Power-Awareness Extensions for Network Testbeds

    The escalation in power consumption of networking and communications equipment is of concern to technologists and environmentalists alike. Understanding how and when networking devices consume power is complicated by their lack of instrumentation. Furthermore, standard networking devices are not typically flexible enough to support experiments with new techniques for reducing...

    Provided By University of Wisconsin

  • White Papers // Mar 2011

    Flexible Traffic and Host Profiling Via DNS Rendezvous

    The ability to accurately classify network traffic and to perform timely detection of the presence of unwanted classes of traffic has important implications for network operations and security. In recent years, classification has become more challenging due to applications that use ports that are not well-known that overload or masquerade...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    DomainImpute: Inferring Unseen Components in the Internet

    Despite many efforts over the past decade, the ability to generate topological maps of the Internet at the router-level accurately and in a timely fashion remains elusive. Mapping campaigns commonly involve traceroute-like probing that are usually non-adaptive and incomplete, thus revealing only a portion of the underlying topology. In this...

    Provided By University of Wisconsin

  • White Papers // Mar 2011

    Fingerprinting 802.11 Rate Adaptation Algorithms

    The effectiveness of rate adaptation algorithms is an important determinant of 802.11 wireless network performance. The diversity of algorithms that has resulted from efforts to improve rate adaptation has introduced a new dimension of variability into 802.11 wireless networks, further complicating the already difficult task of understanding and debugging 802.11...

    Provided By University of Wisconsin

  • White Papers // Mar 2010

    Financial Crises And Labor Market Turbulence

    Financial crises cause a significant reallocation of labor as relative prices change drastically and economies confront a variety of shocks. Using household survey data for Mexico, the authors show that gross and net labor flows between industries and occupations increase substantially during the 1994-95 crises. They also find significant wage...

    Provided By University of Wisconsin

  • White Papers // Dec 2010

    Liquidity, Risk, And Occupational Choices

    The authors explore which financial constraints matter the most in the choice of becoming an entrepreneur. They consider a randomly assigned welfare program in rural Mexico and show that cash transfers significantly increase entry into entrepreneurship. They then exploit the cross-household variation in the timing of these transfers and find...

    Provided By University of Wisconsin

  • White Papers // Jun 2009

    The Producer Cooperative As Monitored Credit? The Case Of West Liberty Foods

    The West Liberty Foods turkey cooperative formed in 1996 to purchase the assets and assume operations of Louis Rich Foods. Based on field interviews with grower members and company management, the authors describe changes in the economic relationship between growers and the company that resulted from the purchase. They argue...

    Provided By University of Wisconsin

  • White Papers // May 2011

    How National And International Financial Development Affect Industrial R&D

    The authors examine the impacts of both domestic and international financial market development on R&D intensities in 22 manufacturing industries in 18 OECD countries for the period 1990- 2003. They take account of such industry characteristics as the need for external financing and the amount of tangible assets. Multiple forms...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Heterogeneity in Large Scale Low-Power Ad-Hoc Wireless Sensor Networks

    Wireless sensor networks have recently become a growing area of research and development due to the tremendous number of applications that can greatly benefit from such systems. In the past the majority of research efforts have implicitly assumed homogenous networks. While this is true of certain applications, in this paper...

    Provided By University of Wisconsin

  • White Papers // Jul 2011

    Optimal Scheduling Policies With Mutual Information Accumulation in Wireless Networks

    In this paper, the authors aim to develop scheduling policies to maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. This enhanced physical layer capability enables the system to accumulate information even when the link between two nodes...

    Provided By University of Wisconsin

  • White Papers // Feb 2011

    Secret Key Generation Through OFDM Multipath Channel

    The authors analyze the fundamental limits of key generation and describe an implementation based on error correcting codes. They show that key extraction based on channel coefficients significantly outperforms key extraction based on Received Signal Strength Indicators (RSSI). The development in this paper is based on an IEEE 802.11a Orthogonal...

    Provided By University of Wisconsin

  • White Papers // May 2009

    Manual Vs. Automated Vulnerability Assessment

    The dream of every software development team is to assess the security of their software using only a tool. In this paper, the authors attempt to evaluate and quantify the effectiveness of automated source code analysis tools by comparing such tools to the results of an in-depth manual evaluation of...

    Provided By University of Wisconsin

  • White Papers // Oct 2011

    Polymorphic Type Inference for Scripting Languages With Object Extensions

    This paper presents a polymorphic type inference algorithm for a small subset of JavaScript. The goal is to prevent accessing undefined members of objects. The authors define a type system that allows explicit extension of objects through add operation and implicit extension through method calls. The type system also permits...

    Provided By University of Wisconsin

  • White Papers // Sep 2009

    Towards a Model-Driven Approach for Reverse Engineering Design Patterns

    The size and complexity of software systems is rapidly increasing. Meanwhile, the ability to understand and maintain such systems is decreasing almost as fast. Model Driven Engineering (MDE) promotes the notion of modeling to cope with software complexity; in this paper the authors report on their research that utilizes ontological...

    Provided By University of Wisconsin

  • White Papers // Sep 2009

    ScalaQL: Language-Integrated Database Queries for Scala

    One of the most ubiquitous elements of modern computing is the relational database. Very few modern applications are created with-out some sort of database back-end. Unfortunately, relational database concepts are fundamentally very different from those used in general-purpose programming languages. This creates an impedance mismatch between the the application and...

    Provided By University of Wisconsin

  • White Papers // Oct 2010

    On the Success of Network Topology Inference Using a Markov Random Walk Model for Nested Routing Policies

    Network topology inference is a topic of ongoing interest, as researchers continue to try to identify the topology of the internet, other networks, and the people own networks for maintenance purposes. In this paper, the authors explain why a simple algorithm based on network co-occurrence measurements and a Markov random...

    Provided By University of Wisconsin

  • White Papers // Mar 2011

    PIE in the Sky: Online Passive Interference Estimation for Enterprise WLANs

    Trends in enterprise WLAN usage and deployment point to the need for tools that can capture interference in real time. A tool for interference estimation can not only enable WLAN managers to improve network performance by dynamically adjusting operating parameters like the channel of operation and transmit power of access...

    Provided By University of Wisconsin

  • White Papers // Nov 2011

    Design and Performance of Distributed Mechanisms for Flow Admission in Wireless Adhoc Networks

    Given a wireless network where some pairs of communication links interfere with each other, the authors study sufficient conditions for determining whether a given set of minimum bandwidth Quality-of-Service (QoS) requirements can be satisfied. They are especially interested in algorithms which have low communication overhead and low processing complexity. The...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Static Program Analysis Via 3-Valued Logic

    This paper reviews the principles behind the paradigm of "Abstract interpretation via 3-valued logic," discusses recent work to extend the approach, and summarizes ongoing research aimed at overcoming remaining limitations on the ability to create program analysis algorithms fully automatically. Static analysis concerns techniques for obtaining information about the possible...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Automatic Verification of Strongly Dynamic Software Systems

    Strongly dynamic software systems are difficult to verify. By strongly dynamic, the authors mean that the actors in such systems change dynamically, that the resources used by such systems are dynamically allocated and deallocated, and that for both sets, no bounds are statically known. In this position paper, they describe...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    A Non-Blocking Parallel Spatial Join Algorithm

    Interest in incremental and adaptive query processing has led to the investigation of equijoin evaluation algorithms that are non-blocking. This investigation has yielded a number of algorithms, including the symmetric hash join, the XJoin, the Ripple Join, and their variants. However, to the knowledge no one has proposed a non-blocking...

    Provided By University of Wisconsin

  • White Papers // May 2009

    Content-Preserving Warps for 3D Video Stabilization

    The authors describe a technique that transforms a video from a hand-held video camera so that it appears as if it were taken with a directed camera motion. The method adjusts the video to appear as if it were taken from nearby viewpoints, allowing 3D camera movements to be simulated....

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Analysis of SPKI/SDSI Certificates Using Model Checking

    SPKI/SDSI is a framework for expressing naming and authorization issues that arise in a distributed-computing environment. In this paper, the authors establish a connection between SPKI/SDSI and a formalism known as Pushdown Systems (PDSs). They show that the SPKI/SDSI-to-PDS connection provides a framework for formalizing a variety of certificate-analysis problems....

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Efficient Context-Sensitive Intrusion Detection

    Model-based intrusion detection compares a process's execution against a program model to detect intrusion attempts. Models constructed from static program analysis have historically traded precision for efficiency. The authors address this problem with the Dyck model, the first efficient statically-constructed context-sensitive model. This model species both the correct sequences of...

    Provided By University of Wisconsin

  • White Papers // Nov 2008

    Avoiding File System Micromanagement With Range Writes

    The authors introduce range writes, a simple but powerful change to the disk interface that removes the need for file system micromanagement of block placement. By allowing a file system to specify a set of possible address targets, range writes enable the disk to choose the final on-disk location of...

    Provided By University of Wisconsin

  • White Papers // Mar 2009

    Some New Directions in Graph-Based Semi-Supervised Learning

    In this position paper, the authors first review the state-of-the-art in graph-based semi-supervised learning, and point out three limitations that are particularly relevant to multimedia analysis: Rich data is restricted to live on a single manifold; learning must happen in batch mode; and the target label is assumed smooth on...

    Provided By University of Wisconsin

  • White Papers // Sep 2008

    Toward a Multicore Architecture for Real-Time Ray-Tracing

    Significant improvement to visual quality for real-time 3D graphics requires modeling of complex illumination effects like soft-shadows, reflections, and diffuse lighting interactions. The conventional Z-buffer algorithm driven GPU model does not provide sufficient support for this improvement. This paper targets the entire graphics system stack and demonstrates algorithms, a software...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Two Formal Analyses of Attack Graphs

    An attack graph is a succinct representation of all paths through a system that end in a state where an intruder has successfully achieved his goal. Today Red Teams determine the vulnerability of networked systems by drawing gigantic attack graphs by hand. Constructing attack graphs by hand is tedious, error-prone,...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Towards Automatic Generation of Vulnerability-Based Signatures

    In this paper the authors explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic variants. The work departs from previous approaches by focusing on the semantics of the program and vulnerability exercised by a sample exploit instead of...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Efficient Filtering in Publish-Subscribe Systems Using Binary Decision Diagrams

    Implicit invocation or publish-subscribe has become an important architectural style for large-scale system design and evolution. The publish-subscribe style facilitates developing large-scale systems by composing separately developed components because the style permits loose coupling between various components. One of the major bottlenecks in using publish-subscribe systems for very large scale...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    View Learning for Statistical Relational Learning: With an Application to Mammography

    Statistical Relational Learning (SRL) constructs probabilistic models from relational databases. A key capability of SRL is the learning of arcs (In the Bayes net sense) connecting entries in different rows of a relational table, or in different tables. Nevertheless, SRL approaches currently are constrained to use the existing database schema....

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Tracking the Role of Adversaries in Measuring Unwanted Traffic

    Measurements related to security are being carried out on many sites on the Internet at network ingress points, between specific points on the Internet, and across the wide area Internet. The goals range from identifying sources of and possibly filtering unwanted traffic, to characterizing and coming up with new mechanisms...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries

    In this paper, the authors design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping strategies, PushDown and PullUp, in which selections are either pushed below, or pulled above, joins are proposed and investigated. While the earlier research...

    Provided By University of Wisconsin

  • White Papers // Jan 2009

    Network Performance Anomaly Detection and Localization

    Detecting the occurrence and location of performance anomalies (e.g., High jitter or loss events) is critical to ensuring the effective operation of network infrastructures. In this paper the authors present a framework for detecting and localizing performance anomalies based on using an active probe-enabled measurement infrastructure deployed on the periphery...

    Provided By University of Wisconsin

  • White Papers // Dec 2009

    Toward the Practical Use of Network Tomography for Internet Topology Discovery

    Accurate and timely identification of the router-level topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomographic inference is potentially an attractive complement to standard methods that use TTL-limited probes. In this paper, the authors describe new techniques that aim toward the...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Semantics-Preserving Procedure Extraction

    Procedure extract ion is an important program transformation that can be used to make programs easier to understand and maintain, to facilitate code reuse, and to convert "Monolithic" code to modular or object - oriented code. Procedure extraction involves the following steps: The statements to be extracted are identified (by...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Adaptive Control for Anonymous Network-Attached Storage

    The authors describe techniques for building an anonymous network-attached storage system. Central to the design is adaptation, which enables higher performance without administrative tuning. Via a range of simulation experiments and a prototype implementation, they quantify the costs of providing anonymous storage and explore the parameters to which system performance...

    Provided By University of Wisconsin

  • White Papers // Jan 2011

    Change of Representation for Statistical Relational Learning

    Statistical Relational learning (SRL) algorithms learn statistical models from relational data, such as that stored in a relational database. The authors previously introduced view learning for SRL, in which the view of a relational database can be automatically modified, yielding more accurate statistical models. The present paper presents SAYU-VISTA, an...

    Provided By University of Wisconsin