Cornell University

Displaying 521-560 of 1228 results

  • 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

    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

    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

    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

    DoS & DDoS in Named-Data Networking

    With the growing realization that current Internet protocols are reaching the limits of their senescence, a number of on-going research efforts aim to design potential next-generation Internet architectures. Although they vary in maturity and scope, in order to avoid past pitfalls, these efforts seek to treat security and privacy as...

    Provided By Cornell University

  • White Papers // Aug 2012

    Securing Instrumented Environments Over Content-Centric Networking: The Case of Lighting Control

    Instrumented environments, such as modern Building Automation Systems (BAS), are becoming commonplace and are increasingly interconnected with (and sometimes by) enterprise networks and the Internet. Regardless of the underlying communication platform, secure control of devices in such environments is a challenging task. The current trend is to move from proprietary...

    Provided By Cornell University

  • White Papers // Aug 2012

    Integration of SOA and Cloud Computing in RMODP

    The objective of ODP is according to ITU-T Recommendation X.901 stated as follows: "The objective of ODP standardization is the development of standards that allow the benefits of distributing information processing services to be realized in an environment of heterogeneous IT resources and multiple organizational domains. These standards address constraints...

    Provided By Cornell University

  • White Papers // Aug 2012

    JASF: Jasta Security Framework

    JASM is a model designed to increase the security level in authentication systems. It uses IP Address of the user in the authentication process to enhance the security. On-line security plays a vital role to prevent users sensitive data from falling into wrong hands. JAsta Security Model (JASM) can be...

    Provided By Cornell University

  • White Papers // Aug 2012

    A Model for Minimizing Active Processor Time

    Power management strategies have been widely studied in the scheduling literature. Many of the models are motivated by the energy consumption of the processor. Consider, alternatively, the energy consumed by the operation of large storage systems. Data is stored in memory which may be turned on and off, and each...

    Provided By Cornell University

  • White Papers // Aug 2012

    A Comparative Study of the Secret Sharing Algorithms for Secure Data in the Cloud

    With advances in the field of cloud computing many computing resources and/or services are being provided to the end user on a pay-as-you-use basis. Data outsourcing is a new paradigm in which a third party provides storage services. This is more cost effective for the user as there is no...

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

    The Biometric Menagerie - A Fuzzy and Inconsistent Concept

    This paper proves that in iris recognition, the concepts of sheep, goats, lambs and wolves - as proposed by Doddington and Yager in the so-called Biometric Menagerie, are at most fuzzy and at least not quite well defined. They depend not only on the users or on their biometric templates,...

    Provided By Cornell University

  • White Papers // Jul 2012

    Data Quality Principles in the Semantic Web

    The increasing size and availability of web data make data quality a core challenge in many applications. Principles of data quality are recognized as essential to ensure that data fit for their intended use in operations, decision-making, and planning. However, with the rise of the Semantic Web, new data quality...

    Provided By Cornell University

  • White Papers // Jul 2012

    The Half-Duplex AWGN Single-Relay Channel: Full Decoding or Partial Decoding?

    This paper compares the partial-decode-forward and the complete-decode-forward coding strategies for the half-duplex Gaussian single-relay channel. The authors analytically show that the rate achievable by partial-decode-forward outperforms that of the more straightforward complete-decode-forward by at most 12.5%. Furthermore, in the following asymptotic cases, the gap between the partial-decode-forward and the...

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

    Receiver-Based Flow Control for Networks in Overload

    The authors consider utility maximization in networks where the sources do not employ flow control and may consequently overload the network. In the absence of flow control at the sources, some packets will inevitably have to be dropped when the network is in overload. To that end, they first develop...

    Provided By Cornell University

  • White Papers // Jul 2012

    Analysis of Cloud Storage Prices

    Cloud storage is a fast growing service, whereby an individual or a company stores its data on a storage facility owned and managed by a third party (the cloud provider). The actual storage facility may be positioned at a single location or scattered around the globe, but the cloud user...

    Provided By Cornell University

  • White Papers // Jul 2012

    Characterizing the Impact of the Workload on the Value of Dynamic Resizing in Data Centers

    Energy consumption imposes a significant cost for data centers; yet much of that energy is used to maintain excess service capacity during periods of predictably low load. Resultantly, there has recently been interest in developing designs that allow the service capacity to be dynamically resized to match the current workload....

    Provided By Cornell University

  • White Papers // Jul 2012

    Coding Delay Analysis of Dense and Chunked Network Codes Over Line Networks

    In this paper, the authors analyze the coding delay and the average coding delay of random linear network codes (a.k.a. dense codes) and Chunked Codes (CC), which are an attractive alternative to dense codes due to their lower complexity, over line networks with Bernoulli losses and deterministic regular or Poisson...

    Provided By Cornell University

  • White Papers // Jul 2012

    A Review of Routing Protocols for Mobile Cognitive Radio Ad Hoc Networks

    Ad hoc network is a collection of wireless mobile nodes that dynamically form a temporary network without the use of any existing network infrastructure or centralized administration. A cognitive radio is a radio that can change its transmitter parameters based on interaction with the environment in which it operates. The...

    Provided By Cornell University

  • White Papers // Jul 2012

    LT Codes For Efficient and Reliable Distributed Storage Systems Revisited

    Due to the advancement of cloud computing technologies, there has been an increased interest for individuals and business entities to move their data from traditional private data center to cloud servers. Indeed, even popular storage service providers such as Dropbox use third party cloud storage providers such as Amazon's Simple...

    Provided By Cornell University

  • White Papers // Jul 2012

    Service Oriented Architecture a Revolution for Comprehensive Web Based Project Management Software

    Service oriented architecture a revolution for project management software has changed the way projects today are moving on the fly with the help of web services booming the industry. Service oriented architecture improves performance and the communication between the distributed and remote teams. Web services to provide project management software...

    Provided By Cornell University

  • White Papers // Jul 2012

    Reputation Algebra for Cloud-Based Anonymous Data Storage Systems

    Given a cloud-based anonymous data storage system, there are two ways for managing the nodes involved in file transfers. One of them is using reputations and the other uses a micropayment system. In reputation-based approach, each node has a reputation associated with it, which is used as a currency or...

    Provided By Cornell University

  • White Papers // Jul 2012

    Efficient Feedback-Based Scheduling Policies for Chunked Network Codes Over Networks with Loss and Delay

    The problem of designing efficient feedback-based scheduling policies for Chunked Codes (CC) over packet networks with delay and loss is considered. For networks with feedback, two scheduling policies, referred to as Random Push (RP) and Local-Rarest-First (LRF), already exist. The authors propose a new scheduling policy, referred to as minimum-Distance-First...

    Provided By Cornell University

  • White Papers // Jul 2012

    Securing Electronic Transactions to Support E-Commerce

    Many reports regarding online fraud in varieties media create skepticism for conducting transactions online, especially through an open network such as the Internet, which offers no security whatsoever. Therefore, encryption technology is vitally important to support secure e-commerce on the Internet. Two well-known encryption representing symmetric and asymmetric cryptosystems as...

    Provided By Cornell University

  • White Papers // Jul 2012

    Content Based Multimedia Information Retrieval To Support Digital Libraries

    Content-based multimedia information retrieval is an interesting research area since it allows retrieval based on inherent characteristic of multimedia objects. For example retrieval based on visual characteristics such as colour, shapes or textures of objects in images or retrieval based on spatial relationships among objects in the media (images or...

    Provided By Cornell University

  • White Papers // Jul 2012

    Pricing of Insurance Policies Against Cloud Storage Price Rises

    When a company migrates to cloud storage, the way back is neither easy nor cheap. The company is then locked up in the storage contract and exposed to upward market prices, which reduce the company's pro t and may even bring it below zero. The authors propose a protection means...

    Provided By Cornell University

  • White Papers // Jul 2012

    Error Resilience in Distributed Storage via Rank-Metric Codes

    In this paper, the authors present a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of erroneous data from a single corrupted node to the rest of the system during a node repair process. This paper presents...

    Provided By Cornell University

  • White Papers // Jul 2012

    Hatch-Sens: A Theoretical Bio-Inspired Model to Monitor the Hatching of Plankton Culture in the Vicinity of Wireless Sensor Network

    Plankton research has always been an important area of biology. Due to various environmental issues and other research interests, plankton hatching and harnessing has been extremely red-marked zone for bio-aqua scientists recently. To counter this problem, no wireless sensor assisted technique or mechanism has yet not been devised. In this...

    Provided By Cornell University

  • White Papers // Jul 2012

    Scheduling Data Intensive Workloads Through Virtualization on MapReduce Based Clouds

    MapReduce has become a popular programming model for running data intensive applications on the cloud. Completion time goals or deadlines of MapReduce jobs set by users are becoming crucial in existing cloud-based data processing environments like Hadoop. There is a conflict between the scheduling MR jobs to meet deadlines and...

    Provided By Cornell University

  • White Papers // Jul 2012

    Camera Identification by Grouping Images From Database, Based on Shared Noise Patterns

    Previous research showed that camera specific noise patterns, so-called PRNU-patterns, are extracted from images and related images could be found. In this particular research the focus is on grouping images from a database, based on a shared noise pattern as an identification method for cameras. Using the method as described...

    Provided By Cornell University

  • White Papers // Jul 2012

    Database Queries and Constraints Via Lifting Problems

    Previous paper has demonstrated that categories are useful and expressive models for databases. In the paper, the authors build on that model, showing that certain queries and constraints correspond to lifting problems, as found in modern approaches to algebraic topology. In their formulation, each so-called SPARQL graph pattern query corresponds...

    Provided By Cornell University

  • White Papers // Jul 2012

    The Outage Probability of a Finite Ad Hoc Network in Nakagami Fading

    An ad hoc network with a finite spatial extent and number of nodes or mobiles is analyzed. The mobile locations may be drawn from any spatial distribution, and interference-avoidance protocols or protection against physical collisions among the mobiles may be modeled by placing an exclusion zone around each radio. The...

    Provided By Cornell University

  • White Papers // Oct 2014

    Mining Block I/O Traces for Cache Preloading with Sparse Temporal Non-parametric Mixture of Multivariate Poisson

    Existing caching strategies, in the storage domain, though well suited to exploit short range spatio-temporal patterns, are unable to leverage long-range motifs for improving hitrates. Motivated by this, the authors investigate novel Bayesian Non-Parametric modeling (BNP) techniques for count vectors, to capture long range correlations for cache preloading, by mining...

    Provided By Cornell University

  • White Papers // Sep 2014

    Rank-Aware Dynamic Migrations and Adaptive Demotions for DRAM Power Management

    Modern DRAM architectures allow a number of low-power states on individual memory ranks for advanced power management. Many previous studies have taken advantage of demotions on low-power states for energy saving. However, most of the demotion schemes are statically performed on a limited number of pre-selected low-power states, and are...

    Provided By Cornell University

  • White Papers // Sep 2014

    Making FPGAs accessible to Scientists and Engineers as Domain Expert Software Programmers with LabVIEW

    Many scientists and engineers do software programming as a (significant) part of their daily job. Either setting up experiments, taking measurements, developing prototypes, testing their designs, embedding software as part of larger systems, or modeling and analyzing the world around them. In this paper, the authors present a graphical programming...

    Provided By Cornell University

  • White Papers // Jul 2014

    Assessment of Response Time for New Multi Level Feedback Queue Scheduler

    In a multiprocessing environment of computer, the operating system's theme is to assign the execution time for various processes. Response time is one of the characteristics of scheduler, happens to be a prominent attribute of any CPU scheduling algorithm. The proposed New Multi Level Feedback Queue [NMLFQ] scheduler is compared...

    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

    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

    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

    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

    Proving Safety with Trace Automata and Bounded Model Checking

    Loop under-approximation is a technique that enriches C programs with additional branches that represent the effect of a (limited) range of loop iterations. While this technique can speed up the detection of bugs significantly, it introduces the redundant execution traces which may complicate the verification of the program. This holds...

    Provided By Cornell University

  • White Papers // Oct 2014

    Type Targeted Testing

    The authors present a new technique called type targeted testing, which translates precise refinement types into comprehensive test-suites. The key insight behind their approach is that through the lens of SMT solvers, refinement types can also be viewed as a high-level, declarative, test generation technique, wherein types are converted to...

    Provided By Cornell University

  • White Papers // Oct 2014

    Transforming While/Do/For/Foreach-Loops into Recursive Methods

    In software engineering, taking a good election between recursion and iteration is essential because their efficiency and maintenance are different. In fact, developers often need to transform iteration into recursion (e.g., in debugging, to decompose the call graph into iterations); thus, it is quite surprising that there does not exist...

    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

    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

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

    The Tomaco Hybrid Matching Framework for SAWSDL Semantic Web Services

    In this paper, the authors resolve issues related to Web service retrieval, also known as service selection, discovery or essentially matching, in two directions. Firstly, a novel matching algorithm for SAWSDL is introduced. The algorithm is hybrid in nature, combining novel and known concepts, such as a logic-based strategy and...

    Provided By Cornell University

  • White Papers // Oct 2014

    Optimized Disk Layouts for Adaptive Storage of Interaction Graphs

    The people are living in an ever more connected world, where data recording the interactions between people, software systems, and the physical world is becoming increasingly prevalent. This data often takes the form of a temporally evolving graph, where entities are the vertices and the interactions between them are the...

    Provided By Cornell University

  • White Papers // Oct 2014

    On the Provenance of Linked Data Statistics

    As the amount of linked data published on the web grows, attempts are being made to describe and measure it. However even basic statistics about a graph, such as its size, are difficult to express in a uniform and predictable way. In order to be able to sensibly interpret a...

    Provided By Cornell University

  • White Papers // Oct 2014

    GYM: A Multiround Join Algorithm in MapReduce

    The problem of evaluating joins efficiently in distributed environments has gained importance since the advent of Google's Map-Reduce and the emergence of a series of distributed systems with relational operators, such as pig, hive, SparkSQL, and Myria. The costs of join algorithms in such systems can be broken down to:...

    Provided By Cornell University

  • White Papers // Oct 2014

    Efficient State-based CRDTs by Delta-Mutation

    CRDTs are distributed data types that make eventual consistency of a distributed object possible and non ad-hoc. Specifically, state-based CRDTs achieve this by sharing local state changes through shipping the entire state that is then merged to other replicas with an idempotent, associative, and commutative join operation ensuring convergence. This...

    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

    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

    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

    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

    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

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

    Steganography in Modern Smartphones and Mitigation Techniques

    By offering sophisticated services and centralizing a huge volume of personal data, modern Smartphone's changed the way the authors socialize, entertain and work. To this aim, they rely upon complex hardware/software frameworks leading to a number of vulnerabilities, attacks and hazards to profile individuals or gather sensitive information. However, the...

    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

    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

    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

    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

    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

    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

    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

    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

    Dynamic Optimization For Heterogeneous Powered Wireless Multimedia Sensor Networks With Correlated Sources and Network Coding

    The energy consumption in Wireless Multimedia Sensor Networks (WMSNs) is much greater than that in traditional wireless sensor networks. Thus, it is a huge challenge to remain the perpetual operation for WMSN. In this paper, the authors propose a new heterogeneous energy supply model for WMSN through the coexistence of...

    Provided By Cornell University

  • White Papers // Oct 2014

    Divide and Conquer: Partitioning OSPF Networks with SDN

    Software Defined Networking (SDN) is an emerging network control paradigm focused on logical centralization and programmability. At the same time, distributed routing protocols, most notably OSPF and IS-IS, are still prevalent in IP networks, as they provide shortest path routing, fast topological convergence after network failures, and, perhaps most importantly,...

    Provided By Cornell University