successive identification of a fuzzy model and its applications to prediction of a complex system abstract a successive identification method of a fuzzy model is suggested the identification mechanism consists of two levels one is the supervisor level and the other is the adjustment level the supervisor level determines a policy of parameter adjustment using a set of fuzzy adjustment rules the adjustment rules are derived from the fuzzy implications of a fuzzy model and are extended to fuzzy adjustment rules by using an extended concept of zadeh s contrast intensification the adjustment level executes the policy of parameter adjustment determined with the fuzzy adjustment rules the parameter adjustment consists of premise parameter adjustment and consequent parameter adjustment both of them are realized by the weighted recursive least square algorithm finally it is shown from two examples that the method is very useful for modeling complex systems

smooth solutions to a class of free boundary parabolic problems we establish existence uniqueness and regularity results for solutions to a class of free boundary parabolic problems including the free boundary heat equation which arises in the so called focusing problem in the mathematical theory of combustion such solutions are proved to be smooth with respect to time for positive t if the data are smooth

on the number of permutatively inequivalent basic sequences in a banach space let x be a banach space with a schauder basis en n n the relation e0 is borel reducible to permutative equivalence between normalized block sequences of en n n or x is c0 or lp saturated for some 1 p if en n n is shrinking unconditional then either it is equivalent to the canonical basis of c0 or lp 1 p or the relation e0 is borel reducible to permutative equivalence between sequences of normalized disjoint blocks of x or of x if en n n is unconditional then either x is isomorphic to l2 or x contains 2 subspaces or 2 quotients which are spanned by pairwise permutatively inequivalent normalized unconditional bases

mixture densities maximum likelihood and the em algorithm the problem of estimating the parameters which determine a mixture density has been the subject of a large diverse body of literature spanning nearly ninety years during the last two decades the

a glimm effros dichotomy for borel equivalence relations a basic dichotomy concerning the structure of the orbit space of a transformation group has been discovered by glimm g12 in the locally compact group action case and extended by effros e 1 e2 in the polish group action case when additionally the induced equivalence relation is f it is the purpose of this paper to extend the glimm effros dichotomy to the very general context of an arbitrary borel equivalence relation not even necessarily induced by a group action despite the totally classical descriptive set theoretic nature of our result our proof requires the employment of methods of effective descriptive set theory and thus ultimately makes crucial use of computability or recursion theory on the integers

ideal models of spaces ideal domains have an elementary order theoretic structure every element is either compact or maximal despite this we establish that 1 they can model any space currently known to possess a countably based model and 2 the metric spaces with ideal models are exactly the completely metrizable spaces

the smooth ideal we give a classical proof of the generalization of the characterization of smoothness to quotients of polish spaces by borel equivalence relations as an application we describe the extent to which any given borel equivalence relation on a polish space is encoded by the corresponding ideal generated by the family of borel sets on which it is smooth

essential countability of treeable equivalence relations we establish a dichotomy theorem characterizing the circumstances under which a treeable borel equivalence relation e is essentially countable under additional topological assumptions on the treeing we in fact show that e is essentially countable if and only if there is no continuous embedding of e1 into e our techniques also yield the first classical proof of the analogous result for hypersmooth equivalence relations and allow us to show that up to continuous kakutani embeddability there is a minimum borel function which is not essentially countable to one

baire class xi colorings the first three levels the mathbb g 0 dichotomy due to kechris solecki and todor v cevic characterizes the analytic relations having a borel measurable countable coloring we give a version of the mathbb g 0 dichotomy for boraxi measurable countable colorings when xi leq 3 a boraxi measurable countable coloring gives a covering of the diagonal consisting of countably many boraxi squares this leads to the study of countable unions of boraxi rectangles we also give a hurewicz like dichotomy for such countable unions when xi leq 2

sugeno model fuzzy discretization and the em algorithm abstract this paper develops a novel approach to building sugeno type models this approach consists of two steps first a fuzzy discretization technique is used to determine the membership functions of input variables which is the most difficult aspect in constructing a sugeno type model second an iterative algorithm known as the em algorithm is used to estimate the parameters of linear regression models in the consequent part of the model the approach has two salient features 1 the premise identification and the consequence identification of the model can be separated through the use of the fuzzy discretization technique while these are mutually related in previous methods this greatly simplifies the process of model construction 2 the complex multiparameter optimization problem essential for building the model can be decomposed into l smaller scale optimization problems by means of the em algorithm where l is the number of fuzzy rules hence the complexity of this approach is essentially unaffected by the number of fuzzy rules in the model moreover because of the clear separation in algorithmic structure the proposed approach can also be easily implemented on a parallel computer

turbulence representations and trace preserving actions we establish criteria for turbulence in certain spaces of c algebra repre sentations and apply this to the problem of nonclassiability by countable structures for group actions on a standard atomless probability space x and on the hypernite ii1 factor r we also prove that the conjugacy action on the space of free actions of a countably innite amenable group on r is turbulent and that the conjugacy action on the space of ergodic measure preserving ows on x is generically turbulent

quasistatic droplets in randomly perforated domains we consider the hele shaw problem in a randomly perforated domain with zero neumann boundary conditions a homogenization limit is obtained as the characteristic scale of the domain goes to zero specifically we prove that the solutions as well as their free boundaries converge uniformly to those corresponding to a homogeneous and anisotropic hele shaw problem set in mathbb r d the main challenge when deriving the limit lies in controlling the oscillations of the free boundary this is overcome first by extending de giorgi nash moser type estimates to perforated domains and second by proving the almost sure non degenerate growth of the solution near its free boundary

a dichotomy characterizing analytic digraphs of uncountable borel chromatic number in any dimension we study the extension of the kechris solecki todorcevic dichotomy on analytic graphs to dimensions higher than 2 we prove that the extension is possible in any dimension finite or infinite the original proof works in the case of the finite dimension we first prove that the natural extension does not work in the case of the infinite dimension for the notion of continuous homomorphism used in the original theorem then we solve the problem in the case of the infinite dimension finally we prove that the natural extension works in the case of the infinite dimension but for the notion of baire measurable homomorphism

structure identification of fuzzy model abstract the problems of structure identification of a fuzzy model are formulated a criterion for the verification of a structure is discussed using the criterion an algorithm for identifying a structure is suggested further a successive identification algorithm of the parameters is suggested the proposed methods are applied to an example

parameter estimation of superimposed signals using the em algorithm a computationally efficient algorithm for parameter estimation of superimposed signals based on the two step iterative em estimate and maximize with an e step and an m step algorithm is developed the idea is to decompose the observed data into their signal components and then to estimate the parameters of each signal component separately the algorithm iterates back and forth using the current parameter estimates to decompose the observed data better and thus increase the likelihood of the next parameter estimates the application of the algorithm to the multipath time delay and multiple source location estimation problems is considered

uniqueness of solution to a free boundary problem from combustion we investigate the uniqueness and agreement between different kinds of solutions for a free boundary problem in heat propagation that in classical terms is formulated as follows to find a continuous function u x t 0 defined in a domain d rn 0 t and such that u ai uxi ut 0 in d u 0 we also assume that the interior boundary of the positivity set d u 0 so called free boundary is a regular hypersurface on which the following conditions are satisfied

non classification of cartan subalgebras for a class of von neumann algebras abstract we study the complexity of the classification problem for cartan subalgebras in von neumann algebras we construct a large family of ii1 factors whose cartan subalgebras up to unitary conjugacy are not classifiable by countable structures providing the first such examples additionally we construct examples of ii1 factors whose cartan subalgebras up to conjugacy by an automorphism are not classifiable by countable structures finally we show directly that the cartan subalgebras of the hyperfinite ii1 factor up to unitary conjugacy are not classifiable by countable structures and deduce that the same holds for any mcduff ii1 factor with at least one cartan subalgebra

vaught s conjecture and the glimm effros property for polish transformation groups we extend the original glimm effros theorem for locally compact groups to a class of polish groups including the nilpotent ones and those with an invariant metric for this class we thereby obtain the topological vaught conjecture

fuzzy sets as a basis for a theory of possibility the theory of possibility described in this paper is related to the theory of fuzzy sets by defining the concept of a possibility distribution as a fuzzy restriction which acts as an elastic constraint on the values that may be assigned to a variable more specifically if f is a fuzzy subset of a universe of discourse u u which is characterized by its membership function f then a proposition of the form x is f where x is a variable taking values in u induces a possibility distribution tx which equates the possibility of x taking the value u to f u the compatibility of u with f in this way x becomes a fuzzy variable which is associated with the possibility distribution tx in much the same way as a random variable is associated with a probability distribution in general a variable may be associated both with a possibility distribution and a probability distribution with the weak connection between the two expressed as the possibility probability consistency principle a thesis advanced in this paper is that the imprecision that is intrinsic in natural languages is in the main possibilistic rather than probabilistic in nature thus by employing the concept of a possibility distribution a proposition p in a natural language may be translated into a procedure which computes the probability distribution of a set of attributes which are implied by p several types of conditional translation rules are discussed and in particular a translation rule for propositions of the form x is f is possible where is a number in the interval 0 1 is formulated and illustrated by examples

a free boundary problem for the heat equation arising in flame propagation we introduce a new free boundary problem for the heat equation of interest in combustion theory it is obtained in the description of laminar flames as an asymptotic limit for high activation energy the problem asks for the determination of a domain in space time q c rn x 0 t and a function u x t 0 defined in q such that ut au in q u takes certain initial conditions u x 0 uo x for x e qo oqfn t 0 and two conditions are satisfied on the free boundary r a2 n t 0 u o and u1 1 where u1 denotes the derivative of u along the spatial exterior normal to r we approximate this problem by means of a certain regularization on the boundary and prove the existence of a weak solution under suitable assumptions on the initial data

descriptive complexity of some isomorphism classes of banach spaces abstract we present a topological frame in which it is possible to estimate the complexity of some borel families of separable banach spaces we use this frame for evaluating the complexity of the isomorphism class of the hilbert space l 2 of certain asymptotically hilbertian spaces and of the l p spaces under the condition 1 p the complexity appears to increase with the distance to the hilbert space commented open problems conclude the article

on the classification of positions and complex structures in banach spaces abstract a topological setting is defined to study the complexities of the relation of equivalence of embeddings or position of a banach space into another and of the relation of isomorphism of complex structures on a real banach space the following results are obtained a if x is not uniformly finitely extensible then there exists a space y for which the relation of position of y inside x reduces the relation e 0 and therefore is not smooth b the relation of position of l p inside l p or inside l p p 2 reduces the relation e 1 and therefore is not reducible to an orbit relation induced by the action of a polish group c the relation of position of a space inside another can attain the maximum complexity e max d there exists a subspace of l p 1 p 2 on which isomorphism between complex structures reduces e 1 and therefore is not reducible to an orbit relation induced by the action of a polish group

a free boundary problem arising in flame propagation abstract we study a free boundary problem describing the propagation of laminar flames the problem arises as the limit of a singular perturbation problem we introduce the notion of viscosity solutions for the problem to show the maximum principle type property of the solutions using this property we show the uniform convergence of the approximating solutions and the uniqueness of the viscosity solution under several geometric conditions on the initial data

on isometry and isometric embeddability between ultrametric polish spaces abstract we study the complexity with respect to borel reducibility of the relations of isometry and isometric embeddability between ultrametric polish spaces for which a set d of possible distances is fixed in advance these are respectively an analytic equivalence relation and an analytic quasi order and we show that their complexity depends only on the order type of d when d contains a decreasing sequence isometry is borel bireducible with countable graph isomorphism and isometric embeddability has maximal complexity among analytic quasi orders if d is well ordered the situation is more complex for isometry we have an increasing sequence of borel equivalence relations of length 1 which are cofinal among borel equivalence relations classifiable by countable structures while for isometric embeddability we have an increasing sequence of analytic quasi orders of length at least 3 we then apply our results to solve various open problems in the literature for instance we answer a long standing question of gao and kechris by showing that the relation of isometry on locally compact ultrametric polish spaces is borel bireducible with countable graph isomorphism

uniformisations partielles et criteres a la hurewicz dans le plan we give characterizations of the borel sets potentially in some wadge class among the borel sets with countable vertical sections of a product of two polish spaces to do this we use some partial uniformization results

decomposing borel sets and functions and the structure of baire class 1 functions all spaces considered are metric separable and are denoted usually by the letters x y or z w stands for the set of all natural numbers if a metric separable space is additionally complete we call it polish if it is a continuous image of ww or equivalently of a polish space it is called souslin the main subject of the present paper is the structure of baire class 1 functions recent developments in banach space theory in particular discoveries of rosenthal and bourgain fremlin and talagrand see r for a survey of these developments stimulated investigations into the structure of baire class 1 functions the interested reader may consult papers by haydon odel rosenthal hor kechris louveau kl rosenthal r2 and references quoted there these investigations have already provided new applications in banach space theory see for example ri in our study of baire class 1 functions we will be interested in two decomposition properties one of them defined by lusin the other one by jayne and rogers first however we want to consider a more general problem of determining how difficult it is to represent a borel set as a union of simpler borel sets or the graph of a borel function as a union of the graphs of simpler borel functions using effective descriptive set theory in particular louveau s theorem we show that if a c x is borel x polish then a e e or there is a continuous injection q ww a such that q 1 b is meager for any b c a which is e2 this gives a new proof of j stern s result that if a borel set a is the union of cov m sets in e then a is itself e cov m is the smallest cardinality of a family of meager sets covering ill we prove similar results for functions put for f x y and a family of functions g

fuzzy basis functions universal approximation and orthogonal least squares learning fuzzy systems are represented as series expansions of fuzzy basis functions which are algebraic superpositions of fuzzy membership functions using the stone weierstrass theorem it is proved that linear combinations of the fuzzy basis functions are capable of uniformly approximating any real continuous function on a compact set to arbitrary accuracy based on the fuzzy basis function representations an orthogonal least squares ols learning algorithm is developed for designing fuzzy systems based on given input output pairs then the ols algorithm is used to select significant fuzzy basis functions which are used to construct the final fuzzy system the fuzzy basis function expansion is used to approximate a controller for the nonlinear ball and beam system and the simulation results show that the control performance is improved by incorporating some common sense fuzzy control rules

on the convergence properties of the em algorithm two convergence aspects of the em algorithm are studied i does the em algorithm find a local maximum or a stationary value of the incomplete data likelihood function ii does the sequence of parameter estimates generated by em converge several convergence results are obtained under conditions that are applicable to many practical situations two useful special cases are a if the unobserved complete data specification can be described by a curved exponential family with compact parameter space all the limit points of any em sequence are stationary points of the likelihood function b if the likelihood function is unimodal and a certain differentiability condition is satisfied then any em sequence converges to the unique maximum likelihood estimate a list of key properties of the algorithm is included

on the complexity of the uniform homeomorphism relation between separable banach spaces we investigate the uniform homeomorphism relation between separable banach spaces and the related relation of local equivalence we completely characterize the descriptive complexity of local equivalence in the borel reducibility hierarchy this also provides a lower bound for the complexity of the uniform homeomorphism

completeness of the isomorphism problem for separable c algebras this paper studies the descriptive set theoretical complexity of the isomorphism problem for separable c algebras we prove that the isomorphism problem for separable simple ai c algebras is complete in the class of orbit equivalence relations this means that any isomorphism problem arising from a continuous action of a separable completely metrizable group can be reduced to the isomorphism of simple separable ai c algebras

building sugeno type models using fuzzy discretization and orthogonal parameter estimation techniques this paper develops a new approach to building sugeno type models the essential idea is to separate the premise identification from the consequence identification while these are mutually related in the previous methods a fuzzy discretization technique is suggested to determine the premise of the model and an orthogonal estimator is provided to identify the consequence of the model the orthogonal estimator can provide information about the model structure or which terms to include in the model and final parameter estimates in a very simple and efficient manner the well known gas furnace data of box and jenkins is used to illustrate the proposed modeling approach and to compare its performance with other statistical and fuzzy modeling approaches it shows that the performance of the new approach compares favorably with these existing techniques

uniqueness and existence results on the hele shaw and the stefan problems in this paper we introduce a notion of viscosity solutions for the one phase hele shaw and stefan problems when there is no surface tension we prove the uniqueness and existence of the solutions for both problems and the uniform convergence of solutions of porous medium equation to those of the hele shaw problem

fuzzy identification and control of a liquid level rig the most difficult problem in fuzzy control is the development of a control rule set that is both complete and correct we describe a fuzzy adaptive controller that can learn a control algorithm on line and adapt it to changing process conditions the controller makes use of fuzzy identification techniques for learning and adaption its control algorithm is based not on an explicit control rule set but on predictions obtained from a fuzzy model of the process the learning properties of the controller are demonstrated by its application to the control of a laboratory liquid level rig experimental results are given and a comparison is made with traditional pi feedforward control techniques

an identification algorithm in fuzzy relational systems abstract the paper presents an effective identification method in fuzzy relational systems we propose an algorithm for constructing models on the basis of fuzzy and nonfuzzy data with the aid of fuzzy discretization and clustering techniques the usefulness of the method provided is demonstrated by means of two numerical examples also a possible way of generating a linguistic decision making algorithm is discussed

dichotomy theorems for families of non cofinal essential complexity we prove that for every borel equivalence relation e either e is borel reducible to mathbb e 0 or the family of borel equivalence relations incompatible with e has cofinal essential complexity it follows that if f is a borel equivalence relation and cal f is a family of borel equivalence relations of non cofinal essential complexity which together satisfy the dichotomy that for every borel equivalence relation e either e in cal f or f is borel reducible to e then cal f consists solely of smooth equivalence relations thus the dichotomy is equivalent to a known theorem

nonlinear elliptic parabolic problems we introduce a notion of viscosity solutions for a general class of elliptic parabolic phase transition problems these include the richards equation which is a classical model in filtration theory existence and uniqueness results are proved via the comparison principle in particular we show existence and stability properties of maximal and minimal viscosity solutions for a general class of initial data these results are new even in the linear case where we also show that viscosity solutions coincide with the regular weak solutions introduced in alt and luckhaus math z 183 311 341 1983

borel chromatic numbers we study in this paper graph coloring problems in the context of descriptive set theory we consider graphs g x r where the vertex set x is a standard borel space i e a complete separable metrizable space equipped with its algebra of borel sets and the edge relation r x 2 is definable i e borel analytic co analytic etc a borel n coloring of such a graph where 1 n n 0 is a borel map c x y with card y n such that xry c x c y if such a borel coloring exists we define the borel chromatic number of g in symbols x b g to be the smallest such n otherwise we say that g has uncountable borel chromatic number in symbols x b g n 0