Part I of this work answered the following fundamental question: Under and only under what (n, k, d) values does proactively choosing the helper nodes improve the storagebandwidth tradeoff of regenerating codes (RCs)? A critical component of the achievability results in Part I is a lowcomplexity helper selection solution, termed the family helper selection (FHS) scheme. In Part I, FHS was prove...

The production of desirable (good) outputs is frequently accompanied by unintended production of undesirable (bad) outputs. If two or more of these undesirable outputs are produced as byproducts, one may ask: ‘Which bad is worst?’ By worst we mean which bad inhibits the production of desirable outputs the most if it is regulated. We develop a model based on Leif Johansen’s capacity framework by...

Tracking of a reference signal (assumed bounded with essentially bounded derivative) is considered in the context of a class Σρ of multi-input, multi-output dynamical systems, modelled by functional differential equations, affine in the control and satisfying the following structural assumptions: (i) arbitrary – but known – relative degree ρ ≥ 1, (ii) the “high-frequency gain” is sign definite ...

In this study, we establish a network structure of the Korean stock market, one of the emerging markets, with its minimum spanning tree through the correlation matrix. Base on this analysis, it is found that the Korean stock market doesn’t form the clusters of the business sectors or of the industry categories. When the MSCI (Morgan Stanley Capital International Inc.) index is exploited, we fou...

Engineering and Computer Sciences Faculty,Izmir University of Economics, Sakarya St. No:156 Balcova, Izmir, Turkey Ege University, International Computer Institute, 35100, Bornova, Izmir, Turkey 3Faculty of Engineering, Izmir University, Gursel Aksel Boulevard No:14, 35290, Uckuyular, Izmir, Turkey E-mail addresses: [email protected], [email protected], [email protected], kay...

We extend the Chow-Liu algorithm for general random variables while the previous versions only considered finite cases. In particular, this paper applies the generalization to Suzuki’s learning algorithm that generates from data forests rather than trees based on the minimum description length by balancing the fitness of the data to the forest and the simplicity of the forest. As a result, we s...

In the two-dimensional range minimum query problem an input matrix A of dimension m× n, m ≤ n, has to be preprocessed into a data structure such that given a query rectangle within the matrix, the position of a minimum element within the query range can be reported. We consider the space complexity of the encoding variant of the problem where queries have access to the constructed data structur...