Fuzzy dynamical systems

A fuzzy dynamical system on an underlying complete, locally compact metric state space X is defined axiomatically in terms of a fuzzy attainability set mapping on X. This definition includes as special cases crisp single and multivalued dynamical systems on X. It is shown that the support of such a fuzzy dynamical system on X is a crisp multivalued dynamical system on X, and that such a fuzzy dynamical system can be considered as a crisp dynamical system on a state space of nonempty compact fuzzy subsets of X. In addition fuzzy trajectories are defined, their existence established and various properties investigated.     

Non-dual fuzzy connections

The lack of double negation and de Morgan properties makes fuzzy logic unsymmetrical. This is the reason why fuzzy versions of notions like closure operator or Galois connection deserve attention for both antiotone and isotone cases, these two cases not being dual. This paper offers them attention, comming to the following conclusions: – some kind of hardly describable local preduality still makes possible important parallel results; – interesting new concepts besides antitone and isotone ones (like, for instance, conjugated pair), that were classically reducible to the first, gain independency in fuzzy setting.     

Signed Fuzzy-Valued Measures and Radon-Nikodym Theorem of Fuzzy-Valued Measurable Functions

In this paper, we introduce and study the signed fuzzy-valued measure and using the representation theorem of fuzzy numbers, we establish the Radon-Nikodym theorem for fuzzy-valued measurable functions with respect to fuzzy-valued measures.AMS Subject Classification (2000): 28E10, 04A72The research of this work is supposed by a grant of the education committee of Liaoning Province, China #20161049     

Statistical Inference in a Linear Model for Spatially Located Sensors and Random Input

In the paper we consider a random linear model for observations provided by spatially located sensors measuring signals coming from one source. For this model a set of sufficient and complete statistics are found, and it is shown that the maximum likelihood estimators of unknown parameters (characteristics of the source) are functions of those statistics. The problem of nonnegative estimators of variance components of the model is shortly discussed. Comparisons of the mean squared errors of several estimators are given. Numerical example concerning hunting for defects in solar cells is considered in details.     

ESR spectroscopy as a tool for identifying joining fragments of antique marbles: the example of a pulpit by Donatello and Michelozzo

ESR spectroscopy is one of the physicochemical techniques used to characterize archaeological white marbles and obtain information about their quarries of provenance. This is done by measuring selected spectral features of the Mn(2+) impurity ubiquitously present in marbles and developing a statistical classification rule from the variable vectors measured for a significant number of samples of known provenance (the quarry database). Now we show that the overall variability exhibited by the same spectroscopic features decreases rapidly with the linear dimensions of the sampled block and can be used to distinguish fragments belonging to the same piece of stone from those simply originating from the same quarry. Application of the method to the seven marble panels of the Donatello pulpit in Prato (Tuscany) shows that they have all been cut from the same single block and their different degradation must be ascribed to differential weathering and to the different conservation treatments undergone in the past. The limits and possible drawbacks of the method are also discussed.     

A Mean–variance analysis of arbitrage portfolios

Based on the careful analysis of the definition of arbitrage portfolio and its return, the author presents a mean–variance analysis of the return of arbitrage portfolios, which implies that Korkie and Turtle's results ( B. Korkie, H.J. Turtle, A mean–variance analysis of self-financing portfolios, Manage. Sci. 48 (2002) 427–443) are misleading. A practical example is given to show the difference between the arbitrage portfolio frontier and the usual portfolio frontier.     

PORTFOLIO OPTIMIZATION TECHNIQUES FOR A MIXED‐GRAZING SCENARIO FOR AUSTRALIA'S RANGELANDS

Abstract Currently pastoralists in Australia view native mammal species as one of many variables that impact, usually negatively, on their productivity and therefore profitability. This does not necessarily have to be the case. The species with the largest impact, kangaroos, have a value that could be incorporated into their income stream as a method of both reducing risk and increasing biodiversity, and therefore increasing resilience. An investigation of the idea of optimally allocating stocking rates using techniques analogous to classical portfolio selection optimization is conducted. Using historical pricing data for beef, wool, and kangaroo meat, an efficient frontier is formed to analyze the best scenario dependent on an investors risk aversion. It is shown that there is a clear opportunity for pastoralists to benefit economically by the inclusion of kangaroos in a mixed‐grazing strategy for Australian rangelands.     

基于结构元的复模糊数及其序列极限

复模糊数是模糊复分析中的基本概念,在模糊复分析中,它的运算是基于扩张原理的形式给出的,是对元素遍历某个条件所对应的结果进行运算,这种遍历过程给实际操作带来了很多的不便,因此,在一定程度上也阻碍了模糊复分析理论的应用.对此,本文基于模糊结构元的理论基础,探讨了复模糊数运算的另一种新的途径,这种方法简化了复模糊数的运算,也...     

Asymptotics of variance of the lattice point count

The variance of the number of lattice points inside the dilated bounded set rD with random position in ℝ ^d has asymptotics ∼ r ^d−1 if the rotational average of the squared modulus of the Fourier transform of the set is O(ϰ ^−d−1). The asymptotics follow from Wiener’s Tauberian theorem.     

Algorithmic inference: From information granules to subtending functions

To get a true hybrid framework for taking operational decisions from data, we extend the Algorithmic Inference approach to the Granular Computing paradigm. The key idea is that whether or not we need to make decisions instead of mere computations depends on the fact that collected data are not sufficiently definite; rather, they are representative of whole sets of data that could be virtually observed, and we need to manage this indeterminacy. The distinguishing feature is that we face indeterminacy exactly where it affects the quality of the decision. This gives rise to a family of inference algorithms which can be tailored to many specific decisional problems that are generally solved only in approximate ways. In the paper we discuss the bases of the paradigm and provide some examples of its implementation.