We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distan...

In this work structural reliability assessment is presented for structures with uncertain loads and material properties. Uncertain variables are modeled as fuzzy random variables and Interval Monte Carlo Simulation along with interval finite element method is used to evaluate failure probability. Interval Monte Carlo is compared with existing search algorithms used in the reliability assessment...

A fast eigenvector technique for obtaining good initial node partitions of netlists for use in interchange heuristics is described. The method is based on approximating the netlist or hypergraph by a weighted graph, G, such that the sum of the cut edges in G tightly underestimates the number of cut nets in any netlist partition. An eigenvector technique of Barnes [2] is used to partition the gr...

cases. In the first case, our contribution consists of mapping the problem to the mincut problem. In the second case, our contributions is the fuzzy-logic approach. In addition to those two cases, we presented a PLA partitioning technique which considers not only the delay through each sub-PLA, but also the increased loading on the stage which is driving the sub-PLA's. The last method provides ...

Scalar field theories with quartic interaction are quantized on fuzzy S and fuzzy S×S to obtain the 2and 4-point correlation functions at one-loop. Different continuum limits of these noncommutative matrix spheres are then taken to recover the quantum noncommutative field theories on the noncommutative planes R 2 and R respectively. The canonical limit of large stereographic projection leads to...

We show that Karger’s randomized contraction method [7] can be adapted to multiobjective global minimum cut problems with a constant number of edge or node budget constraints to give efficient algorithms. For global minimum cuts with a single edge-budget constraint, our extension of the randomized contraction method has running time Õ(n3) in an n-node graph improving upon the best-known randomi...

The “Double Fuzzy Point” rule representation opens a new dimension for expressing changes of fuzziness in fuzzy rule-based systems. In the case of standard “Fuzzy Point” rule representations, it is difficult to describe fuzzy functions in which crisp observations are required to have fuzzy conclusions, or in which an increase in the fuzziness of observations leads to reduced fuzziness in conclu...

The work deals with a recognition problem using a probabilistic-fuzzy model and multistage decision logic. A case where a loss function is described using fuzzy numbers has been considered. The globally optimal Bayes strategy has been calculated for this case with stage-dependent and dependent on the node of the decision tree fuzzy loss function. The obtained result is illustrated by a calculat...

Load balancing is a technique for equal and fair distribution of load on resources and maximizing their performance as well as reducing the overall execution time. However, meeting all of these goals in a single algorithm is not possible due to their inherent conflict, so some of the features must be given priority based on requirements and objectives of the system and the desired algorithm smu...