Cornell University

Displaying 321-360 of 1119 results

  • White Papers // Oct 2012

    The Limitation of Random Network Coding

    It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, the authors investigate how random linear network coding behaves in general multi-source multi-sink case, where each sink has different demands, and they characterize all...

    Provided By Cornell University

  • White Papers // Oct 2012

    Variable-Length Hill Cipher with MDS Key Matrix

    The Hill Cipher is a classical symmetric cipher which breaks plaintext into blocks of size and then multiplies each block by an key matrix to yield ciphertext. However, it is well known that the Hill cipher succumbs to cryptanalysis relatively easily. As a result, there have been efforts to strengthen...

    Provided By Cornell University

  • White Papers // Oct 2012

    Investigating Decision Support Techniques for Automating Cloud Service Selection

    The compass of Cloud infrastructure services advances steadily leaving users in the agony of choice. To be able to select the best mix of service offering from an abundance of possibilities, users must consider complex dependencies and heterogeneous sets of criteria. Therefore, the authors present a PhD paper proposal on...

    Provided By Cornell University

  • White Papers // Oct 2012

    Local Search Is Better Than Random Assignment for Bounded Occurrence Ordering K-CSPs

    The authors prove that the Bounded Occurrence Ordering k-CSP Problem is not approximation resistant. They give a very simple local search algorithm that always performs better than the random assignment algorithm (unless, the number of satisfied constraints does not depend on the ordering). In this paper, they give a very...

    Provided By Cornell University

  • White Papers // Oct 2012

    Providing an Object Allocation Algorithm in Distributed Databases Using Efficient Factors

    Data replication is a common method used to improve the performance of data access in distributed database systems. In this paper, the authors present an Object Replication Algorithm in Distributed database systems (ORAD). They optimize the created replicated data in distributed database systems by using activity functions of previous algorithms,...

    Provided By Cornell University

  • White Papers // Oct 2012

    ASP Modulo CSP: The Clingcon System

    The authors present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and...

    Provided By Cornell University

  • White Papers // Oct 2012

    Conflict-Driven ASP Solving with External Sources

    Answer Set Programming (ASP) is a well-known problem solving approach based on non-monotonic logic programs and efficient solvers. To enable access to external information, HEX-programs extend programs with external atoms, which allow for a bidirectional communication between the logic program and external sources of computation (e.g., description logic reasoners and...

    Provided By Cornell University

  • White Papers // Oct 2012

    A Flexible Design for Optimization of Hardware Architecture in Distributed Arithmetic based FIR Filters

    FIR filters are used in many performance/power critical applications such as mobile communication devices, analogue to digital converters and digital signal processing applications. Design of appropriate FIR filters usually causes the order of filter to be increased. Synthesis and tape-out of high-order FIR filters with reasonable delay, area and power...

    Provided By Cornell University

  • White Papers // Sep 2012

    Managing Complex Structured Data In a Fast Evolving Environment

    Criminal data comes in a variety of formats, mandated by state, federal, and international standards. Specifying the data in a unified fashion is necessary for any system that intends to integrate with state, federal, and international law enforcement agencies. However, the contents, format, and structure of the data is highly...

    Provided By Cornell University

  • White Papers // Sep 2012

    Secure Electronic Lock Using Pic 16f628a Microcontroller

    The proposed system implements an electronic embedded lock that provides a great benefit over a traditional lock, which uses only a manual key. If in case, the key is lost or stolen then anyone can open the lock using the key. On the other hand, losing a long and complex...

    Provided By Cornell University

  • White Papers // Sep 2012

    Quantum/Relativistic Computation of Security and Efficiency of Electrical Power System for a Day-Ahead

    An algorithm for Electrical Power System (EPS) quantum/relativistic security and efficiency computation via perturbative renormalization of the EPS, finding the computation flowcharts, verification and validation is built in this paper. EPS renormalization is performed via virtual thermalization. EPS energy renormalization provides EPS critical load and outlines the EPS fractal landscape....

    Provided By Cornell University

  • White Papers // Sep 2012

    Fuzzy Keyword Search Over Encrypted Data Using Symbol-Based Trie-Traverse Search Scheme in Cloud Computing

    As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. Although traditional searchable encryption schemes allow a user to securely search over encrypted data through keywords and selectively retrieve files of interest, these techniques support only exact keyword search. In this paper, for the...

    Provided By Cornell University

  • White Papers // Sep 2012

    Preserving Privacy for Secure and Outsourcing for Linear Programming in Cloud Computing

    Cloud computing is the long dreamed vision of computing as a utility, where users can remotely store their data into the cloud so as to enjoy the on-demand high quality applications and services from a shared pool of configurable computing resources. By data outsourcing, users can be relieved from the...

    Provided By Cornell University

  • White Papers // Sep 2012

    DolNet: A Division Of Labour Based Distributed Object Oriented Software Process Model

    Distributed Software Development today is in its childhood and not too widespread as a method of developing software in the global IT Industry. In this context, Petrinets are a mathematical model for describing distributed systems theoretically, whereas AttNets are one of their offshoots. But development of true distributed software is...

    Provided By Cornell University

  • White Papers // Sep 2012

    Moving Window Network Coding in Cooperative Multicast (v1)

    Cooperative multicast is an effective solution to address the bottleneck problem of single-hop broadcast in wireless networks. By incorporating with the random linear network coding technique, the existing schemes can reduce the retransmission overhead significantly. However, the receivers may incur large decoding delay and complexity due to the batch decoding...

    Provided By Cornell University

  • White Papers // Sep 2012

    Virtual Simulation Objects Concept as a Framework for System-Level Simulation

    This paper presents Virtual Simulation Objects (VSO) concept which forms theoretical basis for building tools and framework that is developed for system-level simulations using existing software modules available within cyber infrastructure. Presented concept is implemented by the software tool for building composite solutions using VSO-based GUI and running them using...

    Provided By Cornell University

  • White Papers // Sep 2012

    Storage Workload Modelling by Hidden Markov Models: Application to FLASH Memory

    A workload analysis technique is presented that processes data from operation type traces and creates a Hidden Markov Model (HMM) to represent the workload that generated those traces. The HMM can be used to create representative traces for performance models, such as simulators, avoiding the need to repeatedly acquire suitable...

    Provided By Cornell University

  • White Papers // Sep 2012

    Layered Subspace Codes for Network Coding

    Subspace codes were introduced by Kotter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component subspace codes. Exploiting the layered structure, the authors develop two decoding algorithms for...

    Provided By Cornell University

  • White Papers // Sep 2012

    Database Semantics

    This paper, the first step to connect relational databases with systems consequence, is concerned with the semantics of relational databases. It aims to study system consequence in the logical/semantic system of relational databases. The paper, which was inspired by and which extends a recent set of papers on the theory...

    Provided By Cornell University

  • White Papers // Sep 2012

    ShadowDB: A Replicated Database on a Synthesized Consensus Core

    This paper describes ShadowDB, a replicated version of the BerkeleyDB database. ShadowDB is a primary-backup based replication protocol where failure handling, the critical part of the protocol, is taken care of by a synthesized consensus service that is correct by construction. The service has been proven correct semi-automatically by the...

    Provided By Cornell University

  • White Papers // Sep 2012

    Classification Of Heterogeneous Operating System

    Operating system is a bridge between system and user. An Operating System (OS) is a software program that manages the hardware and software resources of a computer. The OS performs basic tasks, such as controlling and allocating memory, prioritizing the processing of instructions, controlling input and output devices, facilitating networking,...

    Provided By Cornell University

  • White Papers // Sep 2012

    The Curious Case of Non-Interactive Commitments

    It is well-known that one-way permutations (and even one-to-one one-way functions) imply the existence of non-interactive commitments. Furthermore the construction is black-box (i.e., the underlying one-way function is used as an oracle to implement the commitment scheme, and an adversary attacking the commitment scheme is used as an oracle in...

    Provided By Cornell University

  • White Papers // Sep 2012

    Kleisli Database Instances

    The authors use monads to relax the atomicity requirement for data in a database. Depending on the choice of monad, the database fields may contain generalized values such as lists or sets of values, or they may contain exceptions such as various types of nulls. The return operation for monads...

    Provided By Cornell University

  • White Papers // Sep 2012

    Teaching Cloud Computing: A Software Engineering Perspective

    The authors have already seen a number of cloud computing courses being offered and even some Master's degrees. Lee Gillam's course at Surrey University was one of the earliest and he has written some reflections on this course. His course is a general introductory course in cloud computing that starts...

    Provided By Cornell University

  • White Papers // Sep 2012

    Discovery Signal Design and Its Application to Peer-to-Peer Communications in OFDMA Cellular Networks

    This paper proposes a unique discovery signal as an enabler of Peer-To-Peer (P2P) communication which overlays a cellular network and shares its resources. Applying P2P communication to cellular network has two key issues: conventional ad hoc P2P connections may be unstable since stringent resource and interference coordination is usually difficult...

    Provided By Cornell University

  • White Papers // Sep 2012

    An Agent-Based Framework for Cooperation in Supply Chain

    Supply Chain coordination has become a critical success factor for Supply Chain management (SCM) and effectively improving the performance of organizations in various industries. Companies are increasingly located at the intersection of one or more corporate networks which are designated by "Supply Chain". Managing this chain is mainly based on...

    Provided By Cornell University

  • White Papers // Sep 2012

    Integrated Symbolic Design of Unstable Nonlinear Networked Control Systems

    The research area of Networked Control Systems (NCS) has been the topic of intensive study in the last decade. In this paper, the authors give a contribution to this research line by addressing symbolic control design of (possibly unstable) nonlinear NCS with specifications expressed in terms of automata. They first...

    Provided By Cornell University

  • White Papers // Sep 2012

    Relational Databases and Bell's Theorem

    The authors aim in this paper is to point out a surprising formal connection, between two topics which seem on face value to have nothing to do with each other: relational database theory, and the study of non-locality and contextuality in the foundations of quantum mechanics. They shall show that...

    Provided By Cornell University

  • White Papers // Sep 2012

    Toward Cloud Computing Evolution

    Information Technology (IT) shaped the success of organizations, giving them a solid foundation that increases both their level of efficiency as well as productivity. The computing industry is witnessing a paradigm shift in the way computing is performed worldwide. There is a growing awareness among consumers and enterprises to access...

    Provided By Cornell University

  • White Papers // Aug 2012

    Optimal Co-Design of Control, Scheduling and Routing in Multi-Hop Control Networks

    A Multi-hop Control Network consists of a plant where the communication between sensors, actuators and computational units is supported by a (wireless) multi-hop communication network, and data flow is performed using scheduling and routing of sensing and actuation data. Given a SISO LTI plant, the authors will address the problem...

    Provided By Cornell University

  • White Papers // Aug 2012

    Business Intelligence: A Rapidly Growing Option through Web Mining

    The World Wide Web is a popular and interactive medium to distribute information in this scenario. The web is huge, diverse, ever changing, widely disseminated global information service center. The authors are familiar with terms like e-commerce, e-governance, e-market, e-finance, e-learning, e-banking etc. for an organization it is new challenge...

    Provided By Cornell University

  • White Papers // Aug 2012

    Data Mining the MNC Like Internal Co-Opetition Duality in a University Context

    The goal of the paper is to quantify the simultaneous competition and cooperation that takes place in organizations. As the concepts seem to be dichotomous opposites at first, the term internal co-opetition duality is put forth. Parallels are drawn between co-opetitive processes in big MultiNational Corporations (MNCs) and these taking...

    Provided By Cornell University

  • White Papers // Aug 2012

    Network Coding Based on Chinese Remainder Theorem

    Random linear network code has to sacrifice part of bandwidth to transfer the coding vectors, thus a head of size k log |T | is appended to each packet. The authors present a distributed random network coding approach based on the Chinese remainder theorem for general multicast networks. It uses...

    Provided By Cornell University

  • White Papers // Aug 2012

    Coordination in Network Security Games: a Monotone Comparative Statics Approach

    Malicious softwares or malwares for short have become a major security threat. While originating in criminal behavior, their impacts are also influenced by the decisions of legitimate end users. Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a...

    Provided By Cornell University

  • White Papers // Aug 2012

    Dynamic Rate Adaptation for Improved Throughput and Delay in Wireless Network Coded Broadcast

    In this paper, the authors provide theoretical and simulation based study of the delay performance for a number of existing throughput optimal broadcast schemes and uses the results to design a new dynamic rate adaptation scheme which achieves higher transmission rates at lower packet delivery delays. Under the Bernoulli packet...

    Provided By Cornell University

  • White Papers // Aug 2012

    On the Use of Latency Graphs for the Construction of Tor Circuits

    The use of anonymity-based infrastructures and anonymisers is a plausible solution to mitigate privacy problems on the Internet. Tor (short for the onion router) is a popular low-latency anonymity system that can be installed as an end-user application on a wide range of operating systems to redirect the traffic through...

    Provided By Cornell University

  • White Papers // Aug 2012

    Modeling Network Coded TCP: Analysis of Throughput and Energy Cost

    The authors analyze the performance of TCP and TCP with Network Coding (TCP/NC) in lossy networks. They build upon the framework introduced by Padhye et al. and characterize the throughput behavior of classical TCP and TCP/NC as a function of erasure probability, round-trip time, maximum window size, and duration of...

    Provided By Cornell University

  • White Papers // Aug 2012

    Instantly Decodable Versus Random Linear Network Coding: A Comparative Framework for Throughput and Decoding Delay Performance

    This paper explains the tension between throughput and decoding delay performance of two widely-used network coding schemes: Random Linear Network Coding (RLNC) and Instantly Decodable Network Coding (IDNC). A single-hop broadcasting system model is considered that aims to deliver a block of packets to all receivers in the presence of...

    Provided By Cornell University

  • White Papers // Aug 2012

    On the Sum Rate of a 2 X 2 Interference Network

    The authors consider the 2 X 2 interference network with 6 possible messages, of which the 2 X 2 interference channel and X channel are special cases obtained by using only 2 and 4 messages respectively. Starting from an achievable rate region similar to the Han-Kobayashi region, they obtain an...

    Provided By Cornell University

  • White Papers // Aug 2012

    Inferring SQL Queries Using Program Synthesis

    Developing high-performance applications that interact with databases is a difficult task, as developers need to understand both the details of the language in which their applications are written in, and also the intricacies of the relational model. One popular solution to this problem is the use of Object-Relational Mapping (ORM)...

    Provided By Cornell University

  • White Papers // Aug 2012

    Privacy Preservation Algorithm Using Effective Data Lookup Organization for Storage Clouds

    In the era of cloud computing, many cloud service providers like Amazon, Microsoft, Google, etc are offering cloud storage as a service. The authors can migrate their data to the storage offered by them and can retrieve it back at any point of time or can share it with other...

    Provided By Cornell University

  • White Papers // Aug 2012

    Cpassport - A Passport System Based on Cloud Computing and Near Field Communication

    Wireless communication has penetrated into all fields of technology, especially in mobility, where wireless transactions are gaining importance with improvements in standards like 3G and 4G. There are many technologies that support the wireless forms of interactions between devices. One among them is NFC - Near Field Communication. In addition...

    Provided By Cornell University

  • White Papers // Dec 2012

    Private Cloud Initiatives Using Bioinformatics Resources and Applications Facility (BRAF)

    The bioinformatics research community has a demand of enormous compute resources to run bioinformatics tools. Next generation sequencing technologies have further increased the overall demand for computational analysis. The traditional Cluster and Grid computing are having their own complexities to program and use while there is a silver-line in cloud...

    Provided By Cornell University

  • White Papers // Dec 2012

    Cloud Algebra for Handling Unstructured Data in Cloud Database Management System

    The handling of unstructured data in database management system is very difficult. The managing unstructured data like image, video textual data etc. are not easy task in database system. In this work a concept of cloud algebra introduced to handle unstructured data in CDBMS. The most popular concept, relational algebra...

    Provided By Cornell University

  • White Papers // Feb 2013

    Face Recognition for Social Media With Mobile Cloud Computing

    Social Networking has become today's lifestyle and anyone can easily receive information about everyone in the world. It is very useful if a personal identity can be obtained from the mobile device and also connected to social networking. Therefore, the authors proposed a face recognition system on mobile devices by...

    Provided By Cornell University

  • White Papers // Aug 2011

    Minimum Spanning Tree Based Routing Strategy for Homogeneous WSN

    A Wireless Sensor Network (WSN) is composed of sensor nodes spread over the field to sense the data. The sensed data must be gathered & transmitted to Base Station (BS) for end user queries. The used sensor nodes being in-expensive having low computation power & limited energy so are not...

    Provided By Cornell University

  • White Papers // Dec 2012

    An Ontology-Based System for Cloud Infrastructure Services' Discovery

    The Cloud infrastructure services landscape advances steadily leaving users in the agony of choice. As a result, Cloud service identification and discovery remains a hard problem due to different service descriptions, non-standardised naming conventions and heterogeneous types and features of Cloud services. In this paper, the authors present an OWL-based...

    Provided By Cornell University

  • White Papers // Apr 2012

    Using Channel Output Feedback to Increase Throughput in Hybrid-ARQ

    Hybrid-ARQ protocols have become common in many packet transmission systems due to their incorporation in various standards. Hybrid-ARQ combines the normal Automatic Repeat reQuest (ARQ) method with error correction codes to increase reliability and throughput. In this paper, the authors look at improving upon this performance using feedback information from...

    Provided By Cornell University

  • White Papers // May 2013

    Proportional Fair MU-MIMO in 802.11 WLANs

    The next generation of 802.11 WLANs is expected to support Multi-User MIMO (MUMIMO) transmission, whereby parallel transmissions can be simultaneously made to multiple stations. This significantly extends the MIMO support introduced by the 802.11n standard and is, for example, included as part of the current draft 802.11ac standard that aims...

    Provided By Cornell University

  • White Papers // May 2013

    Optimal Distributed Scheduling in Wireless Networks Under SINR Interference Model

    Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its throughput-optimality. Since then, there have been extensive research efforts to devise distributed implementations of this algorithm. Recently, distributed adaptive CSMA scheduling...

    Provided By Cornell University

  • White Papers // Nov 2012

    Performance Analysis of Bio-Inspired Routing Protocols Based on Random Waypoint Mobility Model

    A Mobile Ad hoc NETwork (MANET) is a non-centralised, multihop, wireless network that lacks a common infrastructure and hence it needs self-organisation. The biggest challenge in MANETs is to find a path between communicating nodes, which is the MANET routing problem. Biology-inspired techniques such as Ant Colony Optimisation (ACO) which...

    Provided By Cornell University

  • White Papers // May 2013

    Intelligent Agent Based Semantic Web in Cloud Computing Environment

    Considering today's web scenario, there is a need of effective and meaningful search over the web which is provided by Semantic Web. Existing search engines are keyword based. They are vulnerable in answering intelligent queries from the user due to the dependence of their results on information available in web...

    Provided By Cornell University

  • White Papers // May 2013

    Cloud Computing Benefits for Educational Institutions

    Education today is becoming completely associated with the Information Technology on the content delivery, communication and collaboration. The need for servers, storage and software are highly demanding in the universities, colleges and schools. Cloud Computing is an Internet based computing, whereby shared resources, software and information, are provided to computers...

    Provided By Cornell University

  • White Papers // May 2013

    Dynamic Spectrum Refarming of GSM Spectrum for LTE Small Cells

    In this paper, the authors propose a novel solution called Dynamic Spectrum Refarming (DSR) for deploying LTE small cells using the same spectrum as existing GSM networks. The basic idea of DSR is that LTE small cells are deployed in the GSM spectrum but suppress transmission of all signals including...

    Provided By Cornell University

  • White Papers // May 2013

    Enhancing Information Dissemination in a Device to Device Communication Based Metapopulation using Human Mobility Trace and Beamforming

    In communication network based on device to device interactions, dissemination of the information has lately picked up lot of interest. In this paper, the authors would like to propose a mechanism for studying and enhancing the dissemination of information as in the use case proposed for the future device to...

    Provided By Cornell University

  • White Papers // May 2013

    Easily Implemented Rate Compatible Reconciliation Protocol for Quantum Key Distribution

    Reconciliation is an important step to correct errors in Quantum Key Distribution (QKD). In QKD, after comparing basis, two legitimate parties possess two correlative keys which have some differences and they could obtain identical keys through reconciliation. In this paper, the authors present a new rate compatible reconciliation scheme based...

    Provided By Cornell University

  • White Papers // Jul 2012

    Implementation of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs

    Low-Density Parity-Check (LDPC) codes were invented by Robert Gallager but had been ignored for years until Mackay rediscovered them. They have attracted much attention recently because they can achieve excellent error correcting performance based on the Belief Propagation (BP) decoding algorithm. However, the BP decoding algorithm requires intensive computations. Fortunately,...

    Provided By Cornell University

  • White Papers // May 2010

    Network Coded Transmission of Fountain Codes over Cooperative Relay Networks

    In this paper, a transmission strategy of fountain codes over cooperative relay networks is proposed. When more than one relay nodes are available, the authors apply network coding to fountain-coded packets. By doing this, partial information is made available to the destination node about the upcoming message block. It is...

    Provided By Cornell University

  • White Papers // Apr 2010

    Universal Secure Network Coding via Rank-Metric Codes

    The paradigm of network coding has provided a rich source of new problems that generalize traditional problems in communications. One such problem, introduced in by Cai and Yeung, is that of securing a multicast network against an eavesdropper adversary. The problem of securing a network coding communication system against an...

    Provided By Cornell University

  • White Papers // Feb 2010

    Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio

    The authors study the problem of dynamic spectrum sensing and access in cognitive radio systems as a Partially Observed Markov Decision Process (POMDP). A group of cognitive users cooperatively tries to exploit vacancies in primary (licensed) channels whose occupancies follow a Markovian evolution. They first consider the scenario where the...

    Provided By Cornell University

  • White Papers // Feb 2013

    Partial Third-Party Information Exchange with Network Coding

    In this paper, the authors consider the problem of exchanging channel state information in a wireless network such that a subset of the clients can obtain the complete channel state information of all the links in the network. They first derive the minimum number of required transmissions for such partial...

    Provided By Cornell University

  • White Papers // Dec 2012

    Electricity Cost Minimization for a Residential Smart Grid with Distributed Generation and Bidirectional Power Transactions

    In this paper, the authors consider the electricity cost minimization problem in a residential network where each community is equipped with a distributed power generation source and every household in the community has a set of essential and shiftable power demands. They allow bi-directional power transactions and assume a two-tier...

    Provided By Cornell University

  • White Papers // Mar 2011

    Transparent Data Encryption-Solution for Security of Database Contents

    The present paper deals with transparent data encryption which is a technology used to solve the problems of security of data. Transparent data encryption means encrypting databases on hard disk and on any backup media. Present day global business environment presents numerous security threats and compliance challenges. To protect against...

    Provided By Cornell University

  • White Papers // May 2009

    Unleash Stranded Power in Data Centers with RackPacker

    Data center infrastructures are highly underutilized on average. Typically, a data center manager computes the number of servers his facility can host by dividing the total power capacity of each rack by an assigned "Peak Power Rating" for each server. However, this scheme suffers from the weakness of all static...

    Provided By Cornell University

  • White Papers // Jan 2013

    Integrated Approach to Data Center Power Management

    Energy accounts for a significant fraction of the operational costs of a data center, and data center operators are increasingly interested in moving towards low-power designs. Two distinct approaches have emerged towards achieving this end: the power proportional approach focuses on reducing disk and server power consumption, while the green...

    Provided By Cornell University

  • White Papers // Apr 2013

    A C++11 Implementation of Arbitrary-Rank Tensors for High-Performance Computing

    In this paper, the authors discusses an efficient implementation of tensors of arbitrary rank by using some of the idioms introduced by the recently published C++ ISO Standard (C++11). With the aims at providing a basic building block for high-performance computing, a single Array class template is carefully crafted, from...

    Provided By Cornell University

  • White Papers // Jun 2013

    High-Performance Physics Simulations Using Multi-Core CPUs and GPGPUs in a Volunteer Computing Context

    Energy minimization of Ising spin-glasses has played a central role in statistical and solid-state physics, facilitating studies of phase transitions and magnetism. Recent proposals suggest using Ising spin-glasses for non-traditional computing as a way to harness the nature's ability to find min-energy configurations, and to take advantage of quantum tunneling...

    Provided By Cornell University

  • White Papers // Mar 2010

    High-Performance Energy Minimization in Spin-Glasses With Applications to Adiabatic Quantum Computing

    In this paper, the authors presents two conceptually simple methods for parallelizing a Parallel Tempering Monte Carlo simulation in a distributed volunteer computing context, where computers belonging to the general public are used. The first method uses conventional multi-threading. The second method uses CUDA, a graphics card computing system. Parallel...

    Provided By Cornell University

  • White Papers // Jun 2013

    Hybrid Coding: An Interface for Joint Source - Channel Coding and Network Communication

    A new approach to joint source-channel coding is presented in the context of communicating correlated sources over multiple access channels. Similar to the separation architecture, the joint source-channel coding system architecture in this approach is modular, whereby the source encoding and channel decoding operations are decoupled. However, unlike the separation...

    Provided By Cornell University

  • White Papers // Mar 2013

    Joint Source-Channel Coding Revisited: Random-Coding Bounds and Error Exponents

    The authors study the achievable error exponents in joint source-channel coding by deriving an upper bound on the average error probability using Gallager's techniques. The bound is based on a construction for which source messages are assigned to disjoint subsets (referred to as classes), and code-words are independently generated according...

    Provided By Cornell University

  • White Papers // Dec 2011

    The Dispersion of Joint Source-Channel Coding

    In this paper the authors investigate the behavior of the distortion threshold that can be guaranteed in joint source-channel coding, to within a prescribed excess-distortion probability. They show that the gap between this threshold and the optimal average distortion is governed by a constant that they call the joint source-channel...

    Provided By Cornell University

  • White Papers // May 2009

    A Large-Deviation Analysis for the Maximum Likelihood Learning of Tree Structures

    The problem of maximum-likelihood learning of the structure of an unknown discrete distribution from samples is considered when the distribution is Markov on a tree. Large-deviation analysis of the error in estimation of the set of edges of the tree is performed. Necessary and sufficient conditions are provided to ensure...

    Provided By Cornell University

  • White Papers // Aug 2011

    Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction

    This paper addresses the problem of sparse recovery with graph constraints in the sense that the authors can take additive measurements over nodes only if they induce a connected sub-graph. They provide explicit measurement constructions for several special graphs. A general measurement construction algorithm is also proposed and evaluated. Network...

    Provided By Cornell University

  • White Papers // Jan 2013

    Evaluating Cloud Computing Techniques for Smart Power Grid Design Using Parallel Scripting

    Applications used to evaluate next-generation electrical power grids ("Smart grids") are anticipated to be compute and data-intensive. In this paper, the authors parallelize and improve performance of one such application which was run sequentially prior to the use of their cloud-based configuration. They examine multiple cloud computing offerings, both commercial...

    Provided By Cornell University

  • White Papers // Feb 2012

    Wireless Network Coding with Local Network Views: Coded Layer Scheduling

    One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire limited local views of the whole network to design their transmission strategies. In...

    Provided By Cornell University

  • White Papers // Oct 2008

    Non Binary LDPC Codes Over the Binary Erasure Channel: Density Evolution Analysis

    In this paper, the authors present a thorough analysis of non binary LDPC codes over the binary erasure channel. First, the decoding of non binary LDPC codes is investigated. The proposed algorithm performs "On-the fly" decoding, i.e. it starts decoding as soon as the first symbols are received, which generalizes...

    Provided By Cornell University

  • White Papers // Apr 2013

    Two Trivial Attacks on A5/1: A GSM Stream Cipher

    Stream ciphers play an important role in those applications where high throughput remains critical and resources are very restricted e.g. in Europe and North America, A5/1 is widely used stream cipher that ensure confidentiality of conversations in GSM mobile phones. However careful security analysis of such cipher is very important...

    Provided By Cornell University

  • White Papers // Jun 2013

    Cell-Level Modeling of IEEE 802.11 WLANs

    The authors develop a scalable cell-level analytical model for multi-cell infrastructure IEEE 802.11 WLANs under a so-called Pairwise Binary Dependence (PBD) condition. The PBD condition is a geometric property under which the relative locations of the nodes inside a cell do not matter and the network is free of hidden...

    Provided By Cornell University

  • White Papers // Jun 2013

    Equivalence and Comparison of Heterogeneous Cellular Networks

    The authors consider a general heterogeneous network in which, besides general propagation effects (shadowing and/or fading), individual base stations can have different emitting powers and be subject to different parameters of Hata-like pathloss models (path-loss exponent and constant) due to, for example, varying antenna heights. They assume also that the...

    Provided By Cornell University

  • White Papers // Jun 2013

    CSMA Using Statistical Physics Toward Throughput and Utility Optimal CSMA

    In the recent past years, CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has gained a lot of attentions since it has been proved in several papers that appropriate control of CSMA parameters provably guarantees optimality in terms of throughput and fairness....

    Provided By Cornell University