fields, which are needed for checking firewall policy violations, from the pattern expression of a flow rule to represent the space of corresponding flow path. In addition, we reorganize these fields with a (source address, destination address) pair to specify a flow path space. Then, we define three kinds of spaces for representing a flow path space: (1) Incoming Space represents original head...

This paper proposes C&M, a novel network coding scheme to deal with both inter-flow and intra-flow traffic in wireless networks. Prior work on wireless network coding design belongs to either inter-flow network coding or intra-flow network coding. C&M attempts to combine advantages of both network coding approaches to develop a more efficient network coding scheme. Based on COPE, C&M allows eac...

The data path is an important printer component that performs real-time image processing. Because of the large data sizes and high throughput requirements in high-performance multifunctional printers, the data path is usually implemented as a hybrid software/hardware system. Designing the architecture of a data path is a nontrivial problem, because of the many tradeoffs involved and because it ...

We demonstrated an integrated tunable interferometer in Polydimethylsiloxane (PDMS). In contrast to most on-chip interferometers which require complex fabrication, our design is realized by conventional soft lithography fabrication. The optical path difference occurs during propagation across a fluid-fluid interface. The diffusion level of the two miscible liquids which is controlled by liquid ...

Accuracy of implicit path enumeration technique (IPET), which statically estimates the worst-case execution time of a program using integer linear programming, relies on flow information captured as flow facts. Unfortunately, flow facts are inadequate for capturing complex and often subtle path constraints such as causalities. Manual annotation often introduces many disjunctions, and performanc...

An efficient Lookup Table (LUT) design for memory-based multiplier is proposed.  This multiplier can be preferred in DSP computation where one of the inputs, which is filter coefficient to the multiplier, is fixed. In this design, all possible product terms of input multiplicand with the fixed coefficient are stored directly in memory. In contrast to an earlier proposition Odd Multiple Storage ...

This paper concerns the problem of decomposing a network flow into an integral path flow such that the length of the longest path is minimized.It is shown that this problem isNP-hard in the strong sense.Two approximation algorithms are proposed for the problem:the longest path elimination(LPE)algorithm and the balanced flow propagation(BFP)algorithm.We analyze the properties of both algorithms ...

Selfish routing is one of the most studied problems in algorithmic game theory, with one of the principal applications being that of routing in road networks. The majority of related work, in the many variants of the problem, deals with the inefficiency of equilibria to which users are assumed to converge. Multiple mechanisms for improving the outcomes at equilibria have been considered, such a...