We consider a set of S independent encoders that must transmit a set of correlated sources through a network of noisy, independent, broadcast channels to T receivers, with no interference at the receivers. For the general problem of sending correlated sources through broadcast networks, it is known that the source–channel separation theorem breaks down and the achievable rate region as well as ...

Abstract The main purpose of this research paper is to improve the quality friction-drilled holes and formed thread by investigating influence input working parameters that have not been investigated yet on produced bores. Due lack related hardness macro- microstructure threads, experiments were conducted investigate these important issues. Finally, a tension test was performed compare performa...

We consider active, semi-supervised learning in an offline transductive setting. We show that a previously proposed error bound for active learning on undirected weighted graphs can be generalized by replacing graph cut with an arbitrary symmetric submodular function. Arbitrary non-symmetric submodular functions can be used via symmetrization. Different choices of submodular functions give diff...

We present new tools for fuzzy arithmetic with fuzzy numbers, based on the parametric representation of fuzzy numbers and new fuzzy operations, the generalized difference and the generalized division of fuzzy numbers. The new operations are described in terms of the parametric LR and LU representations of fuzzy numbers and the corresponding algorithms are described. An application to the soluti...

The world of manufacturing has shifted its level to the era of space age machining. The purpose of this investigation is to develop Fuzzy based Graphical User Interface (GUI) for modeling of laser machining conditions. The developed fuzzy based GUI is expected to overcome the major problems faced by most of the manufacturing industries nowadays with the increased number controllable parameters ...

This paper compares the behaviour of sampling techniques for price indices by using a scanner data set as a model population. Indices produced by two purposive deterministic cut-off designs and four probabilistic sampling schemes are compared with each other and with the ‘true’ population index from the whole data set. We found that the two deterministic cut-off sampling schemes show much diffe...

Top-down partitioning has focused on minimum cut or ratio cut objectives, while bottom-up clustering has focused on density-based objectives. In seeking a more uni ed perspective, we propose a new sum of densities measure for multi-way circuit decomposition, where the density of a subhypergraph is the ratio of the number of edges to the number of nodes in the subhypergraph. Finding a k-way part...

We develop a finite element method for convection diffusion problems on a given time dependent surface, for instance modeling the evolution of a surfactant. The method is based on a characteristic-Galerkin formulation combined with a piecewise linear cut finite element method in space. The cut finite element method is constructed by embedding the surface in a background grid and then using the ...

The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics [SIAM Review, 1991]. We give both sequenti...

We study the vector spaces and integer lattices of cuts and flows associated with an arbitrary finite CW complex, and their relationships to group invariants including the critical group of a complex. Our results extend to higher dimension the theory of cuts and flows in graphs, most notably the work of Bacher, de la Harpe and Nagnibeda. We construct explicit bases for the cut and flow spaces, ...