We present an approach for probabilistic contour prediction within the framework of an object tracking system. We combine level-set methods for image segmentation with optical flow estimations based on probability distribution functions (pdfs) calculated at each image position. Unlike most recent level-set methods that consider exclusively the sign of the level-set function to determine an object and its background, we introduce a novel interpretation of the value of the level-set function that reflects the confidence in the contour. To this end, in a sequence of consecutive images, the contour of an object is transformed according to the optical flow estimation and used as the initial object hypothesis in the following image. The values of the initial level-set function are set according to the optical flow pdfs and thus provide an opportunity to incorporate the uncertainties of the optical flow estimation in the object contour prediction.
The aim of this paper is to propose a new approach to probability density function (PDF) estimation which is based on the fuzzy transform (F-transform) introduced by Perfilieva in \cite{Perfilieva:FSS06}. Firstly, a smoothing filter based on the combination of the discrete direct and continuous inverse F-transform is introduced and some of the basic properties are investigated. Next, an alternative approach to PDF estimation based on the proposed smoothing filter is established and compared with the most used method of Parzen windows. Such an approach can be of a great value mainly when dealing with financial data, i. e. large samples of observations.
In [6] we proved that tlie monoidal t-norm logic MTL introduced by
Esteva and Godo in [4] is the logic of left-continuons t-norms and their residuals. Recently, the Ruinenian school, P. Hájek and others investigated in deep noncommutative t-norms. Tlins it is natural to look for the logic of left-continuons non-commutative t-norms. This is precisely what we do in this paper. The proof is a combination of the inethod used in [6] and of results by .J. Kühn in [13] and by P. Hájek in [9].
The scholarly attention paid to Anna Katharina SweertsSporck has so far focused on the phase of her youth when she was engaged in translating books chosen by her father count Franz Anton Sporck for publishing. The article explores her interest in the book culture in the later stage of her life after her forced entrance into marriage in 1712. Anna Katharina initiated a large program of publishing and spreading devotional literature. The project was realized in cooperation with the Servite friar Wilhelm M. Löhrer and it aimed to cultivate internal, affective piety as a newly appraised type of religiosity which was increasingly popular across the confessional boundaries in the eighteenth century., Veronika Čapská., and Obsahuje bibliografické odkazy
Let \Omega \subset {{\Bbb C}^n} be a bounded, simply connected \mathbb{C} -convex domain. Let \alpha \in \mathbb{Z}_{+}^{n} and let f be a function on Ω which is separately {C^{2{\alpha _j} - 1}} -smooth with respect to zj (by which we mean jointly {C^{2{\alpha _j} - 1}} -smooth with respect to Rezj, Imzj). If f is α-analytic on Ω\f−1(0), then f is α-analytic on Ω. The result is well-known for the case a_{i}=1, 1\leqslant i\leqslant n even when f a priori is only known to be continuous., Abtin Daghighi, Frank Wikström., and Obsahuje seznam literatury
Those who argue that dispositional explanations are genuine explanations usually construe them as causal explanations. There are several well-known arguments against the causal efficacy of dispositions, but there are as well demonstrations that on some minimal conditions, dispositions could be viewed as causally relevant to the effects which they are taken to explain. Although the latter position is generally tenable, it may be shown that in some important cases it is not a good idea to commit to a causal construal of dispositional explanations. The argument goes as follows: (1) Dispositional explanations are valued for certain specific extra-inferences which they allow us to draw; (2) The causal construal of dispositional explanations can account for some of these extra-inferences only on the assumption that the disposition is a common cause of its manifestations; (3) However, under certain circumstances, the common cause assumption is refuted on theoretical or empirical grounds; Therefore, (4) under certain circumstances, the causal construal of dispositional explanations cannot account for what these explanations are valued for. The latter conclusion is a reason to argue that in some cases at least, the causal construal of dispositional explanations should be avoided., Ti, kteří tvrdí, že dispoziční vysvětlení jsou skutečná vysvětlení, je obvykle považují za kauzální vysvětlení. Existuje několik dobře známých argumentů proti kauzální účinnosti dispozic, ale jsou zde také demonstrace, že za určitých minimálních podmínek lze dispozice považovat za kauzálně relevantní vzhledem k účinkům, které mají být vysvětleny. I když je tato pozice obecně udržitelná, může být prokázáno, že v některých důležitých případech není dobré zavázat se k příčinnému konstruktivnímu vysvětlení. Argument jde následovně: (1) Dispoziční vysvětlení jsou oceňována pro určité specifické extra-závěry, které nám umožňují kreslit; (2) Kauzální konstrukční dispoziční vysvětlení může vysvětlit některé z těchto extra-dedukcí pouze za předpokladu, že dispozice je společnou příčinou jejích projevů; (3) Za určitých okolností je však předpoklad společné příčiny vyvrácen z teoretických nebo empirických důvodů; Proto (4) za určitých okolností nemůže kauzální konstrukční vysvětlení vysvětlení vysvětlit, za co jsou tato vysvětlení oceňována. Tento závěr je důvodem pro tvrzení, že v některých případech je třeba se vyhnout kauzálnímu konstrukčnímu vykládání vysvětlení. kauzální konstruktivní vysvětlení nemůže vysvětlit, za co jsou tato vysvětlení oceňována. Tento závěr je důvodem pro tvrzení, že v některých případech je třeba se vyhnout kauzálnímu konstrukčnímu vykládání vysvětlení. kauzální konstruktivní vysvětlení nemůže vysvětlit, za co jsou tato vysvětlení oceňována. Tento závěr je důvodem pro tvrzení, že v některých případech je třeba se vyhnout kauzálnímu konstrukčnímu vykládání vysvětlení., and Lilia Gurova
We have computed the following physical parameters for the atmosphere of Titan, usinge Voyager´s measurements:
1) Temperature, 2) Pressure, 3) Density, 4 Speed of sound, 5) Density scale, 6) Number density, 7) Mean free path, 8) Viscosity, 9) Pressure scale, 10) Mean particle velocity, 11) Mean collisional frequency, 12) Columnar mass.
In this article we produce a refined version of the classical Pohozaev identity in the radial setting. The refined identity is then compared to the original, and possible applications are discussed.
In this paper, we present a new type of attack on iterated chaotic ciphers using related keys. Based on the fact that a chaotic sequence is not sensitive to the less significant bits of initial conditions and parameters, a divide-and-conquer attack on iterated chaotic ciphers was presented by us before, which significantly reduces the computing complexity of attacks. However, if the information leaked is significant according to the distribution of the coincidence degrees, a measure for the information leakage of chaotic ciphers, or the size of the key is large, then it is difficult for the divide-and-conquer attack to reduce its computing complexity into a realizable level. The related-key attack we present in this paper simultaneously uses the information leaked from different chaotic sequences generated by related keys and combines the ideas of linear cryptanalysis and divide-and-conquer attack together, hence greatly enhances the efficiency of divide-and-conquer attack. As an example, we test the related-key attack on the ZLL chaotic cipher with a 64-bit key on a Pentium IV 2.5 GHz PC, which takes only 8 minutes and 45 seconds to recover all bits of the key successfully.
The subprime mortgage crisis and subsequent financial tsunami have raised considerable concerns about financial risk management and evaluation. This is nowhere more apparent than in new economic firms (NEFs) with large economic targets and heavy R&D expenses, such as firms in the electronics industries. With its potential for extreme growth and superior profitability, the electronic industries in Taiwan have been in the financial stock market spotlight. Recently, the relevance vector machine (RVM) was reported to have considerably less computation complexity than support vector machines (SVM) models, since it uses fewer kernel functions. Another emerging technique is rough set theory (RST), which derives rules from data. Based on the corporation life cycle theory (CLC), this study developed a relevance vector machine with rough set theory (RVMRS) to predict the status of a corporation in the decline stage. To demonstrate the performance of the designed RVMRS model, the study used electronic industries data from the Taiwan Economic Journal data bank, Taiwan Security Exchange, and Securities and Futures Institute in Taiwan. Experimental results revealed that the presented RVMRS model can predict the decline stage in a firm's life cycle with satisfactory accuracy, and generate rules for investors, managers, bankers and regulators that enable them to make suitable judgments. In addition, this study proved that the transparency and information disclosure index (TDI) is crucial to predicting the financial decline of corporations.