Cornell University

Displaying 1-40 of 1180 results

  • White Papers // Oct 2014

    Toward Sequentializing Overparallelized Protocol Code

    A promising application domain for coordination languages is programming protocols among threads in multi-core programs: coordination languages typically provide high-level constructs and abstractions that more easily compose into correct - with respect to a programmer's intentions - protocol specifications than do low-level synchronization constructs provided by conventional languages (e.g., locks...

    Provided By Cornell University

  • White Papers // Oct 2014

    A Note on Two Notions of Compliance

    Several recent papers have been devoted to the study of contracts as a way to formally specify abstractions of the behavior of software systems. A common aspect that gathers together some of these studies is a notion of compliance. This is a relation between systems which want to interact. Before...

    Provided By Cornell University

  • White Papers // Oct 2014

    Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth

    Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive State Machines (RSMs) are standard models for interprocedural analysis. The authors consider a general framework with RSMs where the transitions are labeled from a semiring, and path properties are algebraic...

    Provided By Cornell University

  • White Papers // Oct 2014

    Reducing Cascading Failure Risk by Increasing Infrastructure Network Interdependency

    Increased coupling between critical infrastructure networks, such as power and communications, has important implications for the reliability and security of these networks. To understand the implications of power-communications coupling, researchers have studied interdependent network models and reported that increased coupling can increase system vulnerability. However, these results come from models...

    Provided By Cornell University

  • White Papers // Oct 2014

    Capacity Analysis of Decoupled Downlink and Uplink Access in 5G Heterogeneous Systems

    The peoples' traditional notion of a cell is changing dramatically given the increasing degree of heterogeneity in 4G and emerging 5G systems. Rather than belonging to a specific cell, a device would choose the most suitable connection from the plethora of connections available. In such a setting, given the transmission...

    Provided By Cornell University

  • White Papers // Oct 2014

    Repairable Threshold Secret Sharing Schemes

    In this paper, the authors propose a class of new threshold secret sharing schemes with repairing function between shares. Specifically, each share, when it is broken or lost, can be repaired by some others without the help of the dealer. Further, a construction of such repairable threshold secret sharing schemes...

    Provided By Cornell University

  • White Papers // Oct 2014

    Efficient Key Generation for Dynamic Blom's Scheme

    The need for secure communication between the nodes in a network has led to the development of various key distribution schemes. Blom's scheme is a prominent key exchange protocol used for sensor and wireless networks, but its shortcomings include large computation overhead and memory cost. In this paper, the authors...

    Provided By Cornell University

  • White Papers // Oct 2014

    Efficient LTE Access with Collision Resolution for Massive M2M Communications

    LTE random access procedure performs satisfactorily in case of asynchronous, uncorrelated traffic arrivals. However, when the arrivals are correlated and arrive synchronously, the performance of the Random Access CHannel (RACH) is drastically reduced, causing a large number of devices to experience outage. In this paper, the authors propose a LTE...

    Provided By Cornell University

  • White Papers // Oct 2014

    Detection of Core-Periphery Structure in Networks Using Spectral Methods and Geodesic Paths

    The authors introduce several novel and computationally efficient methods for detecting \"Core-periphery structure\" in networks. Core-periphery structure is a type of meso-scale structure that includes densely-connected core vertices and sparsely-connected peripheral vertices. Core vertices are well-connected both among themselves and to peripheral vertices, which are not well-connected to any vertices....

    Provided By Cornell University

  • White Papers // Oct 2014

    Effects of Social Influence in Peer Online Recommendation

    Website providers often use peer recommendation to help people find interesting content. A common method for leveraging opinions of others on these web sites is to display the number of prior recommendations as a social signal. How people react to these social influence signals, in combination with other effects, such...

    Provided By Cornell University

  • White Papers // Oct 2014

    Statistical Models for Cores Decomposition of Undirected Random Graphs

    The authors develop a rigorous and interpretable statistical model for networks using their shell structure to construct minimal sufficient statistics. The model provides the formalism necessary for using k-cores in statistical considerations of random graphs, and in particular social networks. It cannot be specialized to any known degree-centric model and...

    Provided By Cornell University

  • White Papers // Oct 2014

    Pricing in Social Networks with Negative Externalities

    The authors study the problems of pricing an indivisible product to consumers who are embedded in a given social network. The goal is to maximize the revenue of the seller. They assume impatient consumers who buy the product as soon as the seller posts a price not greater than their...

    Provided By Cornell University

  • White Papers // Oct 2014

    Hierarchical Sequencing of Online Social Graphs

    In online communications, patterns of conduct of individual actors and use of emotions in the process can lead to a complex social graph exhibiting multilayered structure and mesoscopic communities. Using simplicial complexes representation of graphs, the authors investigate in-depth topology of online social network which is based on MySpace dialogs....

    Provided By Cornell University

  • White Papers // Oct 2014

    Probabilistic Definitions of Actual Causation Using CP-logic

    Since Pearl's seminal work on providing a formal language for causality, the subject has garnered a lot of interest among philosophers and researchers in artificial intelligence alike. One of the most debated topics in this context regards the notion of actual causation, which concerns itself with specific - as opposed...

    Provided By Cornell University

  • White Papers // Oct 2014

    Timed Influence: Computation and Maximization

    The authors consider a cost model for diffusion in a network that captures both the scope of infection and its propagation time: the edges of the network have associated lengths which model transmission times, and influence scores are higher for faster propagation. They propose an intuitive measure of timed influence,...

    Provided By Cornell University

  • White Papers // Oct 2014

    Parameterizing the Semantics of Fuzzy Attribute Implications by Systems of Isotone Galois Connections

    The authors study the semantics of fuzzy if-then rules called fuzzy attribute implications parameterized by systems of isotone Galois connections. The rules express dependencies between fuzzy attributes in object-attribute incidence data. The proposed parameterizations are general and include as special cases the parameterizations by linguistic hedges used in earlier approaches....

    Provided By Cornell University

  • White Papers // Oct 2014

    Applying Agile Requirements Engineering Approach for Re-engineering & Changes in existing Brownfield Adaptive Systems

    Requirements Engineering (RE) is a key activity in the development of software systems and is concerned with the identification of the goals of stakeholders and their elaboration into precise statements of desired services and behavior. The paper describes an agile requirements engineering approach for re-engineering & changes in existing brownfield...

    Provided By Cornell University

  • White Papers // Oct 2014

    QoE Modelling, Measurement and Prediction: A Review

    In mobile computing systems, users can access network services anywhere and anytime using mobile devices such as tablets and Smartphone's. These devices connect to the Internet via network or telecommunications operators. Users usually have some expectations about the services provided to them by different operators. Users' expectations along with additional...

    Provided By Cornell University

  • White Papers // Oct 2014

    Lost in Space: Improving Inference of IPv4 Address Space Utilization

    One challenge in understanding the evolution of Internet infrastructure is the lack of systematic mechanisms for monitoring the extent to which allocated IP addresses are actually used. In this paper, the authors try to advance the science of inferring IPv4 address space utilization by analyzing and correlating results obtained through...

    Provided By Cornell University

  • White Papers // Oct 2014

    The Quantum Nature of Identity in Human Thought: Bose-Einstein Statistics for Conceptual Indistinguishability

    Increasing experimental evidence shows that humans combine concepts in a way that violates the rules of classical logic and probability theory. On the other hand, mathematical models inspired by the formalism of quantum theory are in accordance with data on concepts and their combinations. In this paper, the authors investigate...

    Provided By Cornell University

  • White Papers // Oct 2014

    On the Complexity of Optimization Problems based on Compiled NNF Representations

    Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set of constraints, optimization is typically NP-hard. Fortunately, in many problems, the set of feasible solutions does not often change...

    Provided By Cornell University

  • White Papers // Oct 2014

    Practical Massively Parallel Sorting - Basic Algorithmic Ideas

    Sorting is one of the most fundamental non-numeric algorithms which are needed in a multitude of applications. For example, map-reduce based computations in every step have to group the data items by key values. Or load balancing in supercomputers often uses space-filling curves. This boils down to sorting data by...

    Provided By Cornell University

  • White Papers // Oct 2014

    ASTOR: Evolutionary Automatic Software Repair for Java

    During last years, many automatic software repair approaches have been presented by the software engineering research community. According to the corresponding papers, these approaches are able to repair real defects from open source projects. Some previous publications in the automatic repair field do not provide the implementation of theirs approaches...

    Provided By Cornell University

  • White Papers // Oct 2014

    Outsource Photo Sharing and Searching for Mobile Devices With Privacy Protection

    With the proliferation of mobile devices, cloud-based photo sharing and searching services are becoming common due to the mobile devices' resource constrains. Meanwhile, there is also increasing concern about privacy in photos. In this paper, the authors present a framework SouTu, which enables cloud servers to provide privacy-preserving photo sharing...

    Provided By Cornell University

  • White Papers // Oct 2014

    That Ain't You: Blocking Spearphishing Emails Before they are Sent

    One of the ways in which attackers try to steal sensitive information from corporations is by sending spear-phishing emails. This type of emails typically appears to be sent by one of the victim's coworkers, but have instead been crafted by an attacker. A particularly insidious type of spear-phishing emails are...

    Provided By Cornell University

  • White Papers // Oct 2014

    Reengineering GSM/GPRS Towards a Dedicated Network for Massive Smart Metering

    GSM is a synonym for a major success in wireless technology, achieving widespread use and high technology maturity. However, its future is questionable, as many stakeholders indicate that the GSM spectrum should be refarmed for LTE. On the other hand, the advent of smart grid and the ubiquity of smart...

    Provided By Cornell University

  • White Papers // Oct 2014

    Matching Entities Across Online Social Networks

    Online Social Networks (OSNs), such as Facebook and Twitter, have become an integral part of the peoples' daily lives. There are hundreds of OSNs; each with its own focus in that each offers particular services and functionalities. Recent studies show that many OSN users create several accounts on multiple OSNs...

    Provided By Cornell University

  • White Papers // Oct 2014

    Locally Estimating Core Numbers

    Graphs are a powerful way to model interactions and relationships in data from a wide variety of application domains. In this setting, entities represented by vertices at the \"Center\" of the graph are often more important than those associated with vertices on the \"Fringes\". For example, central nodes tend to...

    Provided By Cornell University

  • White Papers // Oct 2014

    Cryptographic Enforcement of Information Flow Policies without Public Information

    Cryptographic access control has been studied for over 30 years and is now a mature research topic. When symmetric cryptographic primitives are used, each protected resource is encrypted and only authorized users should have access to the encryption key. By treating the keys themselves as protected resources, it is possible...

    Provided By Cornell University

  • White Papers // Oct 2014

    Justifying and Improving Meta-Agent Conflict-Based Search

    The Meta-Agent Conflict-Based Search (MA-CBS) is a recently proposed algorithm for the multi-agent path finding problem. The algorithm is an extension of Conflict-Based Search (CBS), which automatically merges conflicting agents into meta-agents if the number of conflicts exceeds a certain threshold. However, the decision to merge agents is made according...

    Provided By Cornell University

  • White Papers // Oct 2014

    The Lovelace 2.0 Test of Artificial Creativity and Intelligence

    Observing that the creation of certain types of artistic artifacts necessitate intelligence, the authors present the Lovelace 2.0 test of creativity as an alternative to the Turing test as a means of determining whether an agent is intelligent. The Lovelace 2.0 test builds off prior tests of creativity and additionally...

    Provided By Cornell University

  • White Papers // Oct 2014

    Enhanced TKIP Michael Attacks

    In this paper, the author's present new attacks against TKIP within IEEE 802.11 based networks. Using the known Beck-Tews attack, they define schemas to continuously generate new key streams, which allow more and longer arbitrary packets to be injected into the network. They further describe an attack against the Michael...

    Provided By Cornell University

  • White Papers // Oct 2014

    Matching Theory for Future Wireless Networks: Fundamentals and Applications

    The emergence of novel wireless networking paradigms such as small cell and cognitive radio networks has forever transformed the way in which wireless systems are operated. In particular, the need for self-organizing solutions to manage the scarce spectral resources has become a prevalent theme in many emerging wireless systems. In...

    Provided By Cornell University

  • White Papers // Oct 2014

    Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof

    Abstractions are the lifeblood of computer science. Separating higher level concepts from lower level implementation details allows code to be more composable and reusable, and code using appropriate abstractions is simpler to understand and maintain. Polymorphism in programming languages enables code reuse. Here, the authors show that polymorphism has broad...

    Provided By Cornell University

  • White Papers // Oct 2014

    Dynamic Differential Privacy for Location based Applications

    Concerns on location privacy frequently arise with the rapid development of GPS enabled devices and location-based applications. While spatial transformation techniques such as location perturbation or generalization have been studied extensively, most techniques rely on syntactic privacy models without rigorous privacy guarantee. Many of them only consider static scenarios or...

    Provided By Cornell University

  • White Papers // Oct 2014

    Distributed Detection in Tree Networks: Byzantines and Mitigation Techniques

    In this paper, the problem of distributed detection in tree networks in the presence of Byzantines is considered. Closed form expressions for optimal attacking strategies that minimize the miss detection error exponent at the Fusion Center (FC) are obtained. The authors also look at the problem from the network designer's...

    Provided By Cornell University

  • White Papers // Oct 2014

    Bitcoin Over Tor Isn't a Good Idea

    Bitcoin is a decentralized P2P digital currency in which coins are generated by a distributed set of miners and transaction are broadcasted via a peer-to-peer network. While Bitcoin provides some level of anonymity (or rather pseudonymity) by encouraging the users to have any number of random-looking Bitcoin addresses, recent research...

    Provided By Cornell University

  • White Papers // Oct 2014

    QoE-Based Scheduling Algorithm in WiMAX Network using Manhattan Grid Mobility Model

    WiMAX (acronym for Worldwide interoperability for Microwave Access) is a family of technical standards based on IEEE 802.16 standard that defines the high speed connection through radio waves unlike DSL (Digital Subscriber Line) or other wired technology. It can provide coverage to remote rural areas of several kilometers in radius;...

    Provided By Cornell University

  • White Papers // Oct 2014

    Towards A Model Theory for Distributed Representations

    Knowledge representation based approaches to AI involve encoding knowledge in a logical language and performing logical inference to derive conclusions. Distributed representations (such as those based on embeddings) and discrete representations (such as those based on logic) have complementary strengths. The authors explore one possible approach to combining these two...

    Provided By Cornell University

  • White Papers // Oct 2014

    Investigation of A Collective Decision Making System of Different Neighbourhood-Size Based on Hyper-Geometric Distribution

    Distributed and decentralized systems that rely on self-organizations to achieve a specific goal usually characterized by non-linear dynamics. They usually involve amplification or positive feedback as well as damping or negative feedback along with several cooperative-competitive interactions to evolve and navigate towards its desired state. Due to the non-linearity involved...

    Provided By Cornell University

  • White Papers // Mar 2009

    Programming Live Distributed Objects With Distributed Data Flows

    This paper presents a new object-oriented approach to modeling the semantics of distributed multi-party protocols such as leader election, distributed locking, or reliable multicast, and a programming language that supports it. The approach builds on and extends the live distributed objects model by introducing a new concept of a distributed...

    Provided By Cornell University

  • White Papers // Aug 2009

    Multi-Verifier Signatures

    Multi-verifier signatures generalize traditional digital signatures to a secret-key setting. Just like digital signatures, these signatures are both transferable and secure under arbitrary (unbounded) adaptive chosen-message attacks. In contrast to digital signature schemes, however, the authors exhibit practical constructions of multi-verifier signature schemes that are provably secure and are based...

    Provided By Cornell University

  • White Papers // Apr 2010

    Optimal Network Design for the Spread of Cascades

    The authors introduce a new optimization framework to maximize the expected spread of cascades in networks. The model allows a rich set of actions that directly manipulate cascade dynamics by adding nodes or edges to the network. The motivating application is one in spatial conservation planning, where a cascade models...

    Provided By Cornell University

  • White Papers // May 2011

    On the Feasibility of Completely Wireless Data Centers

    The authors introduce a novel data center design based on emerging 60 GHz RF technology that uses wires only to deliver power to its server nodes. Fundamental limitation of wireless data centers is that the maximum number of live connections in the network is directly proportional to the full volume...

    Provided By Cornell University

  • White Papers // Apr 2011

    Doctrine for Cybersecurity

    Successions of doctrines have been advocated in the past for enhancing cybersecurity: Prevention, risk management, and deterrence through accountability. None has proved effective, and their failings are discussed. Most recently, proposals are being made to view cyber-security as a public good or to adopt mechanisms inspired by those used for...

    Provided By Cornell University

  • White Papers // Nov 2009

    Network Congestion Control Using NetFlow

    The goal of congestion control is to avoid congestion in network elements. A network element is congested if it is being offered more traffic than it can process. To detect such situations and to neutralize them the authors should monitor traffic in the network. In this paper, they propose using...

    Provided By Cornell University

  • White Papers // Nov 2009

    PAKE-Based Mutual HTTP Authentication for Preventing Phishing Attacks

    This paper describes a new password-based mutual authentication protocol for Web systems which prevents various kinds of phishing attacks. This protocol provides a protection of user's passwords against any phishers even if dictionary attack is employed, and prevents phishers from imitating a false sense of successful authentication to users. The...

    Provided By Cornell University

  • White Papers // Dec 2009

    NP-Completeness of Certain Sub-Classes of the Syndrome Decoding Problem

    The problem of Syndrome Decoding was proven to be NP-complete in 1978 and, since then, quite a few cryptographic applications have had their security rely on the (provable) difficulty of solving some instances of it. However, in most cases, the instances to be solved follow some specific constraint: the target...

    Provided By Cornell University

  • White Papers // Dec 2009

    Fingerprint Verification Based on Gabor Filter Enhancement

    Human fingerprints are reliable characteristics for personnel identification as it is unique and persistence. A fingerprint pattern consists of ridges, valleys and minutiae. In this paper the authors propose Fingerprint Verification based on Gabor Filter Enhancement (FVGFE) algorithm for minutiae feature extraction and post processing based on 9-pixel neighborhood. A...

    Provided By Cornell University

  • White Papers // Dec 2009

    Fault Predictions in Object Oriented Software

    The dynamic software development organizations optimize the usage of resources to deliver the products in the specified time with the fulfilled requirements. This requires prevention or repairing of the faults as quick as possible. In this paper an approach for predicting the run-time errors in java is introduced. The paper...

    Provided By Cornell University

  • White Papers // Dec 2009

    Detection and Prevention of New and Unknown Malware Using Honeypots

    Security has become ubiquitous in every domain today as newly emerging malware pose an ever-increasing perilous threat to systems. Consequently, honeypots are fast emerging as an indispensible forensic tool for the analysis of malicious network traffic. Honeypots can be considered to be traps for hackers and intruders and are generally...

    Provided By Cornell University

  • White Papers // Nov 2009

    Steganography an Art of Hiding Data

    In today's world the art of sending & displaying the hidden information especially in public places, has received more attention and faced many challenges. Therefore, different methods have been proposed so far for hiding information in different cover media. In this paper a method for hiding of information on the...

    Provided By Cornell University

  • White Papers // Jan 2011

    Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows

    The authors study a wireless relay network, with a single source and a single destination. The main result is to show that an appropriate compress-and-forward scheme supports essentially the same reliable data rate as the quantize-map-and-forward and noisy network coding schemes; thus, it is approximately optimal - in the sense,...

    Provided By Cornell University

  • White Papers // Dec 2008

    The Web as a Graph Measurements, Models, and Methods

    The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph is a fascinating object of study: it has several hundred million nodes today over a billion links and appears to grow exponentially with time. There are many reasons -...

    Provided By Cornell University

  • White Papers // Jan 2011

    Perseus Technology: New Trends in Information and Communication Security

    Using cryptography to protect information and communication has basically two major drawbacks. First, the specific entropy profile of encrypted data makes their detection very easy. Second, the use of cryptography can be more or less regulated, not to say forbidden, according to the countries. If the right to freely protect...

    Provided By Cornell University

  • White Papers // Dec 2010

    Throughput and Latency in Finite-Buffer Line Networks

    This paper investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that models the system exactly....

    Provided By Cornell University

  • White Papers // Dec 2010

    A Self-Organising Neural Network for Processing Data From Multiple Sensors

    This paper shows how a folded Markov chain network can be applied to the problem of processing data from multiple sensors, with an emphasis on the special case of 2 sensors. It is necessary to design the network so that it can transform a high dimensional input vector into a...

    Provided By Cornell University

  • White Papers // Dec 2010

    SNEED: Enhancing Network Security Services Using Network Coding and Joint Capacity

    Traditional network security protocols depend mainly on developing cryptographic schemes and on using biometric methods. These have led to several network security protocols that are unbreakable based on difficulty of solving un-tractable mathematical problems such as factoring large integers. In this paper, Security of Networks Employing Encoding and Decoding (SNEED)...

    Provided By Cornell University

  • White Papers // Jun 2011

    Learning, Investments And Derivatives

    The recent crisis and the following flight to simplicity put most derivative businesses around the world under considerable pressure. The authors argue that the traditional modeling techniques must be extended to include product design. They propose a quantitative framework for creating products which meet the challenge of being optimal from...

    Provided By Cornell University

  • White Papers // Jun 2009

    Observed Universality of Phase Transitions in High-Dimensional Geometry, With Implications for Modern Data Analysis and Signal Processing

    The authors review connections between phase transitions in high-dimensional combinatorial geometry and phase transitions occurring in modern high-dimensional data analysis and signal processing. In data analysis, such transitions arise as abrupt breakdown of linear model selection, robust data fitting or compressed sensing reconstructions, when the complexity of the model or...

    Provided By Cornell University

  • White Papers // Jul 2009

    Applying Local Clustering Method to Improve the Running Speed of Ant Colony Optimization

    Ant Colony Optimization (ACO) has time complexity O(tmN2), and its typical application is to solve Traveling Salesman Problem (TSP), where t, m, and N denotes the iteration number, number of ants, number of cities respectively. Cutting down running time is one of study focuses, and one way is to decrease...

    Provided By Cornell University

  • White Papers // Jul 2009

    Bit Copying - The Ultimate Computational Simplicity

    This paper presents the proof that referencing and bit copying are operations sufficient for Turing-complete computation. A programming language consisting of just one instruction - bit copy, is presented. This language is not just the proof of concept: programs like calculating factorial and "Hello, World!" with an iteration over an...

    Provided By Cornell University

  • White Papers // Jul 2009

    4G Wireless Networks: Opportunities and Challenges

    With the major wireless service providers planning to start deployment of 4G wireless networks by mid 2010, research and industry communities are racing against time to find solutions for some of the prominent still open issues in 4G networks. The growing interest in 4G networks is driven by the set...

    Provided By Cornell University

  • White Papers // Jul 2009

    Web of Lossy Adapters for Interface Interoperability: An Algorithm and NP-Completeness of Minimization

    Different services that provide similar functionality will often be accessed using widely different interfaces, especially if standardization is lacking. To avoid having to rewrite separate code for all interfaces that may have to be used, interface adapters can be used to translate calls to one interface into calls to another...

    Provided By Cornell University

  • White Papers // Jul 2009

    Optimal Routing and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network

    The authors consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. They assume that nodes self-organise into a...

    Provided By Cornell University

  • White Papers // Apr 2010

    Interacting Branching Processes and Linear File-Sharing Networks

    File-sharing networks are distributed systems used to disseminate files among nodes of a communication network. The general simple principle of these systems is that once a node has retrieved a file, it may become a server for this file. In this paper, the capacity of these networks is analyzed with...

    Provided By Cornell University

  • White Papers // Aug 2009

    Performance Analysis Over Slow Fading Channels of a Half-Duplex Single-Relay Protocol: Decode or Quantize and Forward

    In this work, a new static relaying protocol is introduced for half duplex single-relay networks, and its performance is studied in the context of communications over slow fading wireless channels. The proposed protocol is based on a Decode or Quantize and Forward (DoQF) approach. In slow fading scenarios, two performance...

    Provided By Cornell University

  • White Papers // Aug 2009

    Lazy Mixin Modules and Disciplined Effects

    Programming languages are expected to support programmer's effort to structure program code. The ML module system, object systems and mixins are good examples of language constructs promoting modular programming. Among the three, mixins can be thought of as a generalization of the two others in the sense that mixins can...

    Provided By Cornell University

  • White Papers // Aug 2009

    Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems

    The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. The main contribution is to show that any FJP schedulers are predictable on unrelated platforms. A convenient consequence is...

    Provided By Cornell University

  • White Papers // May 2010

    Rapid Self-Organised Initiation of Ad Hoc Sensor Networks Close Above the Percolation Threshold

    This work shows potentials for rapid self-organisation of sensor networks where nodes collaborate to relay messages to a common data collecting unit (sink node). The study problem is, in the sense of graph theory, to find a shortest path tree spanning a weighted graph. This is a well-studied problem where...

    Provided By Cornell University

  • White Papers // May 2010

    Inferring Loop Invariants Using Postconditions

    One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, also known as its contract); the present work takes advantage of this observation by using the postcondition as the basis for...

    Provided By Cornell University

  • White Papers // Sep 2009

    On the Relations Between Diffie-Hellman and ID-Based Key Agreement From Pairings

    This paper studies the relationships between the traditional Diffie-Hellman key agreement protocol and the IDentity-based (ID-based) key agreement protocol from pairings. For the Sakai-Ohgishi-Kasahara (SOK) ID-based key construction, the authors show that identical to the Diffie-Hellman protocol, the SOK key agreement protocol also has three variants, namely ephemeral, semi-static and...

    Provided By Cornell University

  • White Papers // Sep 2009

    An Efficient and Publicly Verifiable Id-Based Multi-Signcryption Scheme

    Secure message transmission over an insecure channel, require both confidentiality and authenticity, which may be achieved through 'Signature then encryption' approach. However, in 1997 Zheng proposed a cryptographic primitive "Signcryption" which achieves both confidentiality and authenticity in a single logical step with much lower computational cost than signature then encryption...

    Provided By Cornell University

  • White Papers // Sep 2009

    Single-Generation Network Coding for Networks With Delay

    A single-source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the incoming symbols (received at their incoming edges) on their outgoing edges. Memory-free networks with delay using network coding...

    Provided By Cornell University

  • White Papers // Aug 2009

    Philosophical Survey of Passwords

    Over the years security experts in the field of Information Technology have had a tough time in making passwords secure. This paper studies and takes a careful look at this issue from the angle of philosophy and cognitive science. The authors have studied the process of passwords to rank its...

    Provided By Cornell University

  • White Papers // Aug 2009

    Self-Partial and Dynamic Reconfiguration Implementation for AES Using FPGA

    This paper addresses efficient hardware/software implementation approaches for the AES (Advanced Encryption Standard) algorithm and describes the design and performance testing algorithm for embedded system. Also, with the spread of reconfigurable hardware such as FPGAs (Field Programmable Gate Array) embedded cryptographic hardware became cost-effective. Nevertheless, it is worthy to note...

    Provided By Cornell University

  • White Papers // Aug 2009

    DPRAODV: A Dynamic Learning System Against Blackhole Attack in AODV Based MANET

    Security is an essential requirement in mobile ad hoc networks to provide protected communication between mobile nodes. Due to unique characteristics of MANETS, it creates a number of consequential challenges to its security design. To overcome the challenges, there is a need to build a multifence security solution that achieves...

    Provided By Cornell University

  • White Papers // Aug 2009

    Electric Routing and Concurrent Flow Cutting

    The authors address a vision of the Internet where every participant exchanges messages with their direct friends and no one else. Yet such an Internet should be able to support reliable and efficient routing to remote locations identified by unchanging names in the presence of an ever changing graph of...

    Provided By Cornell University

  • White Papers // Sep 2009

    On the Degrees of Freedom of Finite State Compound Wireless Networks - Settling a Conjecture by Weingarten Et. Al

    The authors explore the Degrees of Freedom (DoF) of three classes of finite state compound wireless networks in this paper. First, they study the Multiple-Input Single-Output (MISO) finite state compound Broadcast Channel (BC) with arbitrary number of users and antennas at the transmitter. In prior work, Weingarten et. al. have...

    Provided By Cornell University

  • White Papers // Sep 2009

    Higher-Dimensional Models of Networks

    Networks are often studied as graphs, where the vertices stand for entities in the world and the edges stand for connections between them. While relatively easy to study, graphs are often inadequate for modeling real-world situations, especially those that include contexts of more than two entities. For these situations, one...

    Provided By Cornell University