A Generalization of Local Fuzzy Structures

The class of bounded residuated lattice ordered monoids Rl-monoids) contains as proper subclasses the class of pseudo BL-algebras (and consequently those of pseudo MV-algebras, BL-algebras and MV-algebras) and of Heyting algebras. In the paper we introduce and investigate local bounded Rl-monoids which generalize local algebras from the above mentioned classes of fuzzy structures. Moreover, we study and characterize perfect bounded Rl-monoids.     

Finiteness based results in BL-algebras

BL-algebras were introduced by P. Hájek as algebraic structures of Basic Logic. The aim of this paper is to survey known results about the structure of finite BL-algebras and natural dualities for varieties of BL-algebras. Extending the notion of ordinal sum of BL-algebras , we characterize a class of finite BL-algebras, actually BL-comets, which can be seen as a generalization of finite BL-chains. Then, just using BL-comets, we can represent any finite BL-algebra A as a direct product of BL-comets. This result can be seen as a generalization of the representation of finite MV-algebras as a direct product of MV-chains. Then we consider the varieties generated by one finite non-trivial totally ordered BL-algebra. For each of these varieties, we show the existence of a strong duality. As an application of the dualities, the injective and the weak injective members of these classes are described.     

States on semi-divisible residuated lattices

Given a residuated lattice L, we prove that the subset MV(L) of complement elements x ^* of L generates an MV-algebra if, and only if L is semi-divisible. Riečan states on a semi-divisible residuated lattice L, and Riečan states on MV(L) are essentially the very same thing. The same holds for Bosbach states as far as L is divisible. There are semi-divisible residuated lattices that do not have Bosbach states. These results were obtained when the authors visited Academy of Science, Czech Republic, Institute of Comp. Sciences in Autumn 2006.     

Measures on MV-algebras

 We study sequentially continuous measures on semisimple M V-algebras. Let A be a semisimple M V-algebra and let I be the interval [0,1] carrying the usual Łukasiewicz M V-algebra structure and the natural sequential convergence. Each separating set H of M V-algebra homomorphisms of A into I induces on A an initial sequential convergence. Semisimple M V-algebras carrying an initial sequential convergence induced by a separating set of M V-algebra homomorphisms into I are called I-sequential and, together with sequentially continuous M V-algebra homomorphisms, they form a category SM(I). We describe its epireflective subcategory ASM(I) consisting of absolutely sequentially closed objects and we prove that the epireflection sends A into its distinguished σ-completion σ _H (A). The epireflection is the maximal object in SM(I) which contains A as a dense subobject and over which all sequentially continuous measures can be continuously extended. We discuss some properties of σ _H (A) depending on the choice of H. We show that the coproducts in the category of D-posets [9] of suitable families of I-sequential M V-algebras yield a natural model of probability spaces having a quantum nature. The motivation comes from probability: H plays the role of elementary events, the embedding of A into σ _H (A) generalizes the embedding of a field of events A into the generated σ-field σ(A), and it can be viewed as a fuzzyfication of the corresponding results for Boolean algebras in [8, 11, 14]. Sequentially continuous homomorphisms are dual to generalized measurable maps between the underlying sets of suitable bold algebras [13] and, unlike in the Loomis–Sikorski Theorem, objects in ASM(I) correspond to the generated tribes (no quotient is needed, no information about the elementary events is lost). Finally, D-poset coproducts lift fuzzy events, random functions and probability measures to events, random functions and probability measures of a quantum nature. Supported by VEGA Grant 2/7193/01     

R0代数中的模糊正规滤子

在R₀代数中引入模糊正规滤子的概念,给出其充要条件,得到了模糊正规滤子的扩张性质,讨论了模糊正规滤子与模糊滤子、截集之间的关系,最后,用模糊正规滤子刻画了正规R₀代数M和正规商R₀代数M/f。     

Interval valued (\in,\in\!\vee\,q) -fuzzy filters of pseudo BL-algebras

We introduce the concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set. By using this new idea, we introduce the notions of interval valued -fuzzy filters of pseudo BL-algebras and investigate some of their related properties. Some characterization theorems of these generalized interval valued fuzzy filters are derived. The relationship among these generalized interval valued fuzzy filters of pseudo BL-algebras is considered. Finally, we consider the concept of implication-based interval valued fuzzy implicative filters of pseudo BL-algebras, in particular, the implication operators in Lukasiewicz system of continuous-valued logic are discussed.     

A 16-classification partition of formula set F(S) in revised Kleene system \bar W

This paper presents an exact expression of V(A) which is an unique formula A of formula set F(S) in revised Kleene system It also obtains a 16-classification congruence partition about unary operation ¬, combing with generalized tautology theory, and discusses each ones closeness about MP and HS operations.     

(Weak) Dual hyper <Emphasis Type="Italic">K</Emphasis>-ideals

In this note by considering the notion of (weak) dual hyper K-ideal, we obtain some related results. After that we determine the relationships between (weak) dual hyper K-ideals and (weak) hyper K-ideals. Finally, we give a characterization of hyper K-algebras of order 3 or 4 based on the (weak) dual hyper K-ideals.     

A General Approach to L（h,k）-Label Interconnection Networks

Given two non-negative integers h and k, an L（h, k）-labeling of a graph G = （V, E） is a function from the set V to a set of colors, such that adjacent nodes take colors at distance at least h, and nodes at distance 2 take colors at distance at least k. The aim of the L（h, k）-labeling problem is to minimize the greatest used color. Since the decisional version of this problem is NP-complete, it is important to investigate particular classes of graphs for which the problem can be efficiently solved. It is well known that the most common interconnection topologies, such as Butterfly-like, Beneg, CCC, Trivalent Cayley networks, are all characterized by a similar structure： they have nodes organized as a matrix and connections are divided into layers. So we naturally introduce a new class of graphs, called （l × n）-multistage graphs, containing the most common interconnection topologies, on which we study the L（h, k）-labeling. A general algorithm for L（h, k）-labeling these graphs is presented, and from this method an efficient L（2, 1）-labeling for Butterfly and CCC networks is derived. Finally we describe a possible generalization of our approach.     

The Zariski topology on the spectrum of prime <Emphasis Type="Italic">L</Emphasis>-submodules

Let R be a commutative ring with identity and let M be an R-module. We topologize L − Spec(M), the collection of all prime L-submodules of M, analogous to that for FSpec(R), the spectrum of fuzzy prime ideals of R, and investigate the properties of this topological space. In particular, we will study the relationship between L − Spec(M) and L − Spec(R/Ann(M)) and obtain some results.     

Network Design with Edge-Connectivity and Degree Constraints

We consider the following network design problem; Given a vertex set V with a metric cost c on V, an integer k≥1, and a degree specification b, find a minimum cost k-edge-connected multigraph on V under the constraint that the degree of each vertex v∈V is equal to b(v). This problem generalizes metric TSP. In this paper, we show that the problem admits a ρ-approximation algorithm if b(v)≥2, v∈V, where ρ=2.5 if k is even, and ρ=2.5+1.5/k if k is odd. We also prove that the digraph version of this problem admits a 2.5-approximation algorithm and discuss some generalization of metric TSP.     

Maximum <Emphasis Type="Italic">k</Emphasis>-Splittable <Emphasis Type="Italic">s</Emphasis>,<Emphasis Type="Italic">t</Emphasis>-Flows

Given a graph with a source and a sink node, the NP-hard maximum k-splittable s,t-flow (M k SF) problem is to find a flow of maximum value from s to t with a flow decomposition using at most k paths. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable flow problems. Constructing a k-splittable flow requires two interdepending decisions. One has to decide on k paths (routing) and on the flow values for the paths (packing). We give efficient algorithms for computing exact and approximate solutions by decoupling the two decisions into a first packing step and a second routing step. Usually the routing is considered before the packing. Our main contributions are as follows: (i) We show that for constant k a polynomial number of packing alternatives containing at least one packing used by an optimal M k SF solution can be constructed in polynomial time. If k is part of the input, we obtain a slightly weaker result. In this case we can guarantee that, for any fixed ε>0, the computed set of alternatives contains a packing used by a (1−ε)-approximate solution. The latter result is based on the observation that (1−ε)-approximate flows only require constantly many different flow values. We believe that this observation is of interest in its own right. (ii) Based on (i), we prove that, for constant k, the M k SF problem can be solved in polynomial time on graphs of bounded treewidth. If k is part of the input, this problem is still NP-hard and we present a polynomial time approximation scheme for it.     

Generalized fuzzy filters of <Emphasis Type="Italic">R</Emphasis><Subscript>0</Subscript>-algebras

In this paper, we introduce the notions of interval valued -fuzzy filters and interval valued -fuzzy Boolean (implicative) filters in R ₀-algebras and investigate some of their related properties. Some characterization theorems of these generalized fuzzy filters are derived. In particular, we prove that an interval valued fuzzy set F in R ₀-algebras is an interval valued -fuzzy Boolean filter if and only if it is an interval valued -fuzzy implicative filter.     

Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized (, α, , θ)-V-convex functions

In this paper, we first introduce a new class of generalized convex n-set functions, called (, α, , θ)-V-convex functions, and then present numerous sets of parametric and semiparametric sufficient efficiency conditions under generalized (, α, , θ)-V-convexity assumptions for a multiobjective fractional subset programming problem. Moreover, we construct three parametric and three semiparametric duality models and prove appropriate duality theorems.     

Very and more or less in non-commutative fuzzy logic

In this paper we consider fuzzy subsets of a universe as L-fuzzy subsets instead of [ 0, 1 ]-valued, where L is a complete lattice. We enrich the lattice L by adding some suitable operations to make it into a pseudo-BL algebra. Since BL algebras are main frameworks of fuzzy logic, we propose to consider the non-commutative BL-algebras which are more natural for modeling the fuzzy notions. Based on reasoning with in non-commutative fuzzy logic we model the linguistic modifiers such as very and more or less and give an appropriate membership function for each one by taking into account the context of the given fuzzy notion by means of resemblance L-fuzzy relations.     

A batch arrival queue with a vacation time under single vacation policy

We consider an M^x/G/1 queueing system with a vacation time under single vacation policy, where the server takes exactly one vacation between two successive busy periods. We derive the steady state queue size distribution at different points in times, as well as the steady state distributions of busy period and unfinished work (backlog) of this model.Scope and purposeThis paper addresses issues of model building of manufacturing systems of job-shop type, where the server takes exactly one vacation after the end of each busy period. This vacation can be utilized as a post processing time after clearing the jobs in the system. To be more realistic, we further assume that the arrivals occur in batches of random size instead of single units and it covers many practical situations. For example in manufacturing systems of job-shop type, each job requires to manufacture more than one unit; in digital communication systems, messages which are transmitted could consist of a random number of packets. These manufacturing systems can be modeled by M^x/G/1 queue with a single vacation policy and this extends the results of Levy and Yechiali, Manage Sci 22 (1975) 202, and Doshi, Queueing Syst 1 (1986) 29.     

Factor congruences in BCK-algebras

In this paper, we characterize factor congruences in the quasivariety of BCK-algebras. As an application we prove that the free algebra over an infinite set of generators is indecomposable in any subvariety of BCK-algebras. We also study the decomposability of free algebras in the variety of hoop residuation algebras and its subvarieties. We prove that free algebras in a non k-potent subvariety of are indecomposable while finitely generated free algebras in k-potent subvarieties have a unique non-trivial decomposition into a direct product of two factors, and one of them is the two-element implication algebra. This paper is partially supported by Universidad Nacional del Sur and CONICET.     

鲁棒估计器在3D网格降噪中的应用

从最小平方估计的观点揭示了最小平方估计与Laplacian光顺算法之间的关联,并进一步提出了M-估计器在网格光顺中的应用,最后延伸M-估计器至二次加权的M-估计器,在抑制噪声的同时有效地保持了表面特征.在本质上,二次加权的M-估计器就是双向滤波器.