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.
Let T be a tree, let u be its vertex. The branch weight b(u) of u is the maximum number of vertices of a branch of T at u. The set of vertices u of T in which b(u) attains its minimum is the branch weight centroid B(T) of T. For finite trees the present author proved that B(T) coincides with the median of T, therefore it consists of one vertex or of two adjacent vertices. In this paper we show that for infinite countable trees the situation is quite different.
We consider the half-linear second order differential equation which is viewed as a perturbation of the so-called Riemann-Weber half-linear differential equation. We present a comparison theorem with respect to the power of the half-linearity in the equation under consideration. Our research is motivated by the recent results published by J. Sugie, N. Yamaoka, Acta Math. Hungar. 111 (2006), 165–179.
M. Radulescu proved the following result: Let X be a compact Hausdorff topological space and π : C(X) → C(X) a supra-additive and supra-multiplicative operator. Then π is linear and multiplicative. We generalize this result to arbitrary topological spaces.
We study the behaviour of the $n$-dimensional centered Hardy-Littlewood maximal operator associated to the family of cubes with sides parallel to the axes, improving the previously known lower bounds for the best constants $c_n$ that appear in the weak type $(1,1)$ inequalities.