نتایج جستجو برای: box counting

تعداد نتایج: 121958  

Journal: :Int. J. Intell. Syst. 2003
Bernhard Anrig Jürg Kohlas

Technical systems are in general not guaranteed to work correctly. They are more or less reliable. One main problem for technical systems is the computation of the relisystem description ability of a system. A second main problem is the problem of diagnostic. In fact, these problems are in some sense dual to each other. In this paper, we will use the concept of probabilistic argumentation syste...

2015
Stefan M. Moser

we require y = (α, . . . , α), α ∈ (0, 1]. If we now compare the size of these two subsets of [0, 1]n (actually, they are lines, see Figure 1), then we see that the latter is larger, i.e., the latter sequence xcase 2 is more likely than xcase 1. b) i) The check that (X1, . . . , Xn) indeed is an element of the given simplex is identical to a). ii) We define the set F = Fs as described in the pr...

Journal: :IEEE Intelligent Systems 2003
Fei-Yue Wang Shuming Tang Yagang Sui Xiaojing Wang

8 1094-7167/03/$17.00 © 2003 IEEE IEEE INTELLIGENT SYSTEMS grown significantly over the last decade, from virtually nothing to a network of over 25,000 kilometers crossing the nation. It’s now the second-longest system in the world, behind the United States. Meanwhile, the Chinese automobile industry has expanded explosively over the last few years. It will reach 20 percent of the worldwide aut...

2015
Milos M. Jovanovic

Introduction The present paper introduces a model, which describes different phases that typically occur in situations, in which a researching subject (e. g. an author, an institution, a country etc.) needs to be evaluated and in which some kind of reward (e. g. monetary in the form of a bonus or funding) is based on this evaluation. This model, the present author calls it the “vicious circle o...

2013
Boris Aronov John Iacono Özgür Özkan Mark V. Yagnatinsky

A V-shape is an infinite polygonal region bounded by two pairs of parallel rays emanating from two vertices (see Figure 1). We describe a randomized algorithm that, given n points and an integer k ≥ 0, finds the minimum-width V-shape enclosing all but k of the points with probability 1− 1/n for any c > 0, with expected running time O(cn(k + 1) log n(log n log log n + k)).

2008
Adrie E.M. Huesman Okko H. Bosgra M. J. Van den Hof

The need for dynamic operation in the process industry is described by Backx et al. [1]. The economics are increasingly driven by the market and this requires flexible supply chains. In such an environment it is much harder to optimize economic performance while maintaining the required product quality and honoring operational constraints. Therefore it is expected that the current industrial st...

Journal: :Theor. Comput. Sci. 2015
Hadassa Daltrophe Shlomi Dolev Zvi Lotker

In this work, we have studied the problem of arranging randomly scattered wireless sensor antennas in a way that guarantees the connectivity of the induced communication graph. The main challenge here is to minimize energy consumption while preserving node connectivity [2]. In order to save power, increase transmission capacity and reduce interference, antennas should communicate along a wedge-...

2000
CHRISTOPHER M. JUDGE

Let I ⊂ R be a compact interval symmetric about 0. Let M and N , be compact oriented smooth manifolds of dimensions d and d+1 respectively. We suppose that we have an embedded copy of I ×M inside of N . (See Figure 1). Let N denote the complement of the hypersurface {0} ×M . We consider families ǫ → g(ǫ) of Riemannian metric (tensors) on N each of whose restriction to I ×M is a warped product o...

2009
Francis Y. L. Chin Hing-Fung Ting Yong Zhang

In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with the smallest number of directional antennas. In this paper, we consider the variable-size rectangle covering (VSRC) problem, which is a transformation of the DAC problem. There are n points above the base line y = 0 of the two-...

2003
A. Kaczanowski K. Malarz K. Ku

Dynamics of nanoscopic arrays of monodomain magnetic elements is simulated by means of the Pardavi-Horvath algorithm. Experimental hys-teresis loop is reproduced for the arrays of Ni, with period 100 [nm] and the mean coercive field 710 [Oe]. We investigate the fractal character of the cluster of elements with a given magnetic moments by means of box-counting and damage spreading techniques. No...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید