Search

This paper introduces strong bisimulation for continuous-time Markov decision processes (CTMDPs), a stochastic model which allows for a nondeterministic choice between exponential distributions, and shows that bisimulation preserves the validity of CSL. To that end, we interpret the semantics of CSL - a stochastic variant of CTL for continuous-time Markov chains - on CTMDPs and show its measure theoretic soundness. The main challenge faced in this paper is the proof of logical preservation that is substantially based on measure theory.

The paper explores the uniqueness properties of the subjective probabilities in two axiomatizations of state-dependent preferences. Karni, Schmeidler, and Vind's (KSV 1983) system depends on selecting an arbitrary auxiliary probability, and as such, does not guarantee the uniqueness of the derived subjective probability. However, an axiom system initially designed by Karni and Schmeidler (KS 1981) and further elaborated upon here does guarantee the desired uniqueness as well as a useful property of “stability” of the derived solution. When the preference relation displays state-independence, even the KS probabilities may not agree with those derived from the classic Anscombe-Aumann (AA 1963) theorem. However, we claim that, in this case, the KS rather than the AA probabilities are the appropriate representation of the agent's beliefs.

In this paper, the problem of approximating a function defined on a finite subset of the real line by a family of generalized rational functions whose numerator and denominator spaces satisfy the Haar conditions on some closed interval [a, b] containing the finite set is considered. The pointwise closure of the family restricted to the finite set is explicitly determined. The representation obtained is used to analyze the convergence of best approximations on discrete subsets of [a, b] to best approximations over the whole interval (as the discrete subsets become dense) in the case that the function approximated is continuous on [a, b] and the rational family consists of quotients of algebraic polynomials. It is found that the convergence is uniform over [a, b] if the function approximated is a so-called normal point. Only L p {L_p} norms with 1 ⩽ p > ∞ 1 \leqslant p > \infty are employed.

In this paper, several characterizations for s-closed spaces are obtained using regular semiclosed sets and some sets having two properties of near openness and near closedness in the same time. Images of s-closed spaces under some noncontinuous mappings are investigated. The relations between s-closedness and near compactness, co-compactness, almost co-compactness, light compactness, mild compactness are obtained. S-closed subsets relative to a semi-T2-spaces are also discussed. في هذا البحث بعض الخواص الجديدة لفراغات س - المغلقة التي قدمها طومسون عام 1967 ، وذلك باستخدام بعض المجموعات التي لها خاصية قريبة الانفتاح وقريبة الانغلاق في آن واحد ، كما تم مناقشة صور الفراغات س - المغلقة تحت تأثير بعض الرواسم غير المتصلة ، كما تضمن البحث دراسة عن علاقة الانغلاق السيني ببعض أنواع الأصماط ، واحتوى البحث كذلك على مناقشة للمجموعات الجزئية السينية المغلقة بالنسبة لفراغ T2 النصفي .

In this paper, we characterize the class of all spaces X whose products with a fixed non-Archimedan space Y are normal. In particular, we give a characterization of all spaces X whose products with every ω μ -metrizable space are normal.

The main motivation of this paper is to investigate some properties of the generating functions for the numbers Yn(λ) and the polynomials Yn(x; λ), which were recently introduced by Simsek [9] and so we give some identities and relations including the numbers Yn(λ) and the polynomials Yn(x; λ), the Bernoulli numbers and polynomials, the Apostol-Bernoulli numbers and polynomials, the Apostol-Euler numbers and polynomials, the Stirling numbers.

Five years ago in San Diego, USA, a Wheat Industry Utilization Conference took place under the direction of Y. Pomeranz who published the presented papers under the title Wheat is Unique.1 The information gathered in that publication still represents today the present state of knowledge on the structure, composition, processing, end-use properties and products of wheat. This is also true of the topics discussed here, the extraction of starch and gluten from wheat and extrusion cooking, on which the present author contributed two conference papers.2,3 Therefore, as only a few new findings can be reported, this chapter will concentrate on presenting the current state of knowledge on these topics with special reference to the functional characteristics of wheat gluten and starch. In so doing, the process technological possibilities for the extraction of starch and gluten from wheat flours and wheat wholemeal flours as well as the application of wheat starch and wheat flours for the manufacture of extrusion cooking products will be emphasized. Special emphasis is also given to the gluten-forming properties of wheat proteins and the two starch fractions present in the endosperm which differ not only in size but also in physical and chemical properties.

This paper introduces a parametric method for identifying the somatosensory evoked potentials (SEPs). The identification was carried out by using pole-zero modeling of the SEPs in the discrete cosine transform (DCT) domain. It was found that the DCT coefficients of a monophasic signal can be sufficiently approximated by a second-order transfer function with a conjugate pole pair. The averaged SEP signal was modeled by the sum of several second-order transfer functions with appropriate zeros and poles estimated using the least square method in the DCT domain. Results of the estimation demonstrated that the model output was in an excellent agreement with the raw SEPs both qualitatively and quantitatively. Comparing with the common autoregressive model with exogenous input modeling in the time domain, the DCT domain modeling achieves a high goodness of fitting with a very low model order. Applications of the proposed method are possible in clinical practice for feature extraction, noise cancellation and individual component decomposition of the SEPs as well as other evoked potentials.

A path in an edge-colored graph is called conflict-free if it contains a color that is used by exactly one of its edges. An edge-colored graph G is conflict-free connected if for any two distinct vertices of G, there is a conflict-free path connecting them. For a connected graph G, the conflict-free connection number of G, denoted by cfc(G), is defined as the minimum number of colors that are required to make G conflict-free connected. In this paper, we investigate the conflict-free connection numbers of connected claw-free graphs, especially line graphs. We use L(G) to denote the line graph of a graph G. In general, the k-iterated line graph of a graph G, denoted by \(L^k(G)\), is the line graph of the graph \(L^{k-1}(G)\), where \(k\ge 2\) is a positive integer. We first show that for an arbitrary connected graph G, there exists a positive integer k such that \(cfc(L^k(G))\le 2\). Secondly, we get the exact value of the conflict-free connection number of a connected claw-free graph, especially a connected line graph. Thirdly, we prove that for an arbitrary connected graph G and an arbitrary positive integer k, we always have \(cfc(L^{k+1}(G))\le cfc(L^k(G))\), with only the exception that G is isomorphic to a star of order at least 5 and \(k=1\). Finally, we obtain the exact values of \(cfc(L^k(G))\), and use them as an efficient tool to get the smallest nonnegative integer \(k_0\) such that \(cfc(L^{k_0}(G))=2\).