The two-bounce free-space arbitrary interconnection architecture is presented. It results from a series of three-dimensional topological transformations to the Benes network, the minimum rearrangeable nonblocking network. Although functionally equivalent to the Benes network, it requires only two stages of global (spanning multiple chips) optical interconnections. The remaining stages of the mo...

In many organizations and financial institutions, we don't always have acsses to inputs and outputs to evaluate the decision-making units (DMUs), but rather only a ratio of inputs to outputs ( or reverse) might be available. In DEA, cost efficiency determines input standards based on input costs. In multi-stage network DEA processes, in addition to input standards, cost efficiency would determi...

Network Security has become the key foundation with the tremendous increase in usage of network-based services and information sharing on networks. Intrusion poses a serious risk to the network security and compromise integrity, confidentiality & availability of the computer and network resources. Human classification of network audit data is expensive, time consuming and a tedious job. Intrusi...

This paper presents a method for performance evaluation, ranking and clustering based on the double-frontier view to analyze the complex networks. The model allows us to open the structure of the “black box” and can help to obtain important information about efficient and inefficient points of the system. In this paper, we consider a three-stage network, in respect to the additional desirable a...

since data envelopment analysis (dea) introduced in 1970s, it has been widely applied to measure the efficiency of a wide variety of production and operation systems. recently dea has been extended to examine the efficiency of decision making units (dmus) with two-stage network structures or processes, where the outputs from the first stage are intermediate measures that make up the inputs of t...

For a K-stage cyclic queueing network with N customers and general service times we provide bounds on the n departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service time distribution is subexponential.

it is well known that in operations research‎, ‎degeneracy can cause a cycle in a network‎ ‎simplex algorithm which can be prevented by maintaining strong‎ ‎feasible bases in each pivot‎. ‎also‎, ‎in a network consists of n arcs‎ ‎and m nodes‎, ‎not considering any new conditions on the entering‎ ‎variable‎, ‎the upper bound of consecutive degenerate pivots is equal‎ $left( ‎begin{array}{c}‎ ‎n...