Modelling Energy Consumption of a Switch using Fuzzy-Rule Classifier

The energy consumption of IT equipments is becoming an issue of increasing importance. In particular, network equipments such as routers and switches are major contributors to the energy consumption of internet. Therefore it is important to understand how the relationship between input parameters such as bandwidth, number of active ports, traffic-load, hibernation-mode and their impact on energy consumption of a switch. In this paper, the energy consumption of a switch is analyzed in extensive experiments. A fuzzy rule-based model of energy consumption of a switch is proposed based on the result of experiments. The model can be used to predict the energy saving when deploying new switches by controlling the parameters to achieve desired energy consumption and subsequent performance. Furthermore, the model can also be used for further researches on energy saving techniques such as energy-efficient routing protocol, dynamic link shutdown, etc.

Estimating microalgae Synechococcus nidulans daily biomass concentration using neuro-fuzzy network

In this study, a neuro-fuzzy estimator was developed for the estimation of biomass concentration of the microalgae Synechococcus nidulans from initial batch concentrations, aiming to predict daily productivity. Nine replica experiments were performed. The growth was monitored daily through the culture medium optic density and kept constant up to the end of the exponential phase. The network training followed a full 3³ factorial design, in which the factors were the number of days in the entry vector (3,5 and 7 days), number of clusters (10, 30 and 50 clusters) and internal weight softening parameter (Sigma) (0.30, 0.45 and 0.60). These factors were confronted with the sum of the quadratic error in the validations. The validations had 24 (A) and 18 (B) days of culture growth. The validations demonstrated that in long-term experiments (Validation A) the use of a few clusters and high Sigma is necessary. However, in short-term experiments (Validation B), Sigma did not influence the result. The optimum point occurred within 3 days in the entry vector, 10 clusters and 0.60 Sigma and the mean determination coefficient was 0.95. The neuro-fuzzy estimator proved a credible alternative to predict the microalgae growth.

Publication Statistics Sets of slides, transparents and microfiche 1991-

Vapaakappalekartuntaan perustuva tilasto Suomessa julkaistuista dia-, kalvo- ja filmikorttisarjoista vuodesta 1991 lähtien

Improving the Scalability of Reduct Determination in Rough Sets

Rough Set Data Analysis (RSDA) is a non-invasive data analysis approach that solely relies on the data to find patterns and decision rules. Despite its noninvasive approach and ability to generate human readable rules, classical RSDA has not been successfully used in commercial data mining and rule generating engines. The reason is its scalability. Classical RSDA slows down a great deal with the larger data sets and takes much longer times to generate the rules. This research is aimed to address the issue of scalability in rough sets by improving the performance of the attribute reduction step of the classical RSDA - which is the root cause of its slow performance. We propose to move the entire attribute reduction process into the database. We defined a new schema to store the initial data set. We then defined SOL queries on this new schema to find the attribute reducts correctly and faster than the traditional RSDA approach. We tested our technique on two typical data sets and compared our results with the traditional RSDA approach for attribute reduction. In the end we also highlighted some of the issues with our proposed approach which could lead to future research.

L-Fuzzy Relations in Coq

Heyting categories, a variant of Dedekind categories, and Arrow categories provide a convenient framework for expressing and reasoning about fuzzy relations and programs based on those methods. In this thesis we present an implementation of Heyting and arrow categories suitable for reasoning and program execution using Coq, an interactive theorem prover based on Higher-Order Logic (HOL) with dependent types. This implementation can be used to specify and develop correct software based on L-fuzzy relations such as fuzzy controllers. We give an overview of lattices, L-fuzzy relations, category theory and dependent type theory before describing our implementation. In addition, we provide examples of program executions based on our framework.

An Abstract Algebraic Theory of L-Fuzzy Relations for Relational Databases

Classical relational databases lack proper ways to manage certain real-world situations including imprecise or uncertain data. Fuzzy databases overcome this limitation by allowing each entry in the table to be a fuzzy set where each element of the corresponding domain is assigned a membership degree from the real interval [0…1]. But this fuzzy mechanism becomes inappropriate in modelling scenarios where data might be incomparable. Therefore, we become interested in further generalization of fuzzy database into L-fuzzy database. In such a database, the characteristic function for a fuzzy set maps to an arbitrary complete Brouwerian lattice L. From the query language perspectives, the language of fuzzy database, FSQL extends the regular Structured Query Language (SQL) by adding fuzzy specific constructions. In addition to that, L-fuzzy query language LFSQL introduces appropriate linguistic operations to define and manipulate inexact data in an L-fuzzy database. This research mainly focuses on defining the semantics of LFSQL. However, it requires an abstract algebraic theory which can be used to prove all the properties of, and operations on, L-fuzzy relations. In our study, we show that the theory of arrow categories forms a suitable framework for that. Therefore, we define the semantics of LFSQL in the abstract notion of an arrow category. In addition, we implement the operations of L-fuzzy relations in Haskell and develop a parser that translates algebraic expressions into our implementation.

Ranking Sets of Objects

We provide a survey of the literature on ranking sets of objects. The interpretations of those set rankings include those employed in the theory of choice under complete uncertainty, rankings of opportunity sets, set rankings that appear in matching theory, and the structure of assembly preferences. The survey is prepared for the Handbook of Utility Theory, vol. 2, edited by Salvador Barberà, Peter Hammond, and Christian Seidl, to be published by Kluwer Academic Publishers. The chapter number is provisional.

Von Neumann-Morgenstern Stable Sets in Matching Problems

The following properties of the core of a one well-known: (i) the core is non-empty; (ii) the core is a lattice; and (iii) the set of unmatched agents is identical for any two matchings belonging to the core. The literature on two-sided matching focuses almost exclusively on the core and studies extensively its properties. Our main result is the following characterization of (von Neumann-Morgenstern) stable sets in one-to-one matching problem only if it is a maximal set satisfying the following properties : (a) the core is a subset of the set; (b) the set is a lattice; (c) the set of unmatched agents is identical for any two matchings belonging to the set. Furthermore, a set is a stable set if it is the unique maximal set satisfying properties (a), (b) and (c). We also show that our main result does not extend from one-to-one matching problems to many-to-one matching problems.

Studies on Fuzzy Graphs

In this thesis an attempt to develop the properties of basic concepts in fuzzy graphs such as fuzzy bridges, fuzzy cutnodes, fuzzy trees and blocks in fuzzy graphs have been made. The notion of complement of a fuzzy graph is modified and some of its properties are studied. Since the notion of complement has just been initiated, several properties of G and G available for crisp graphs can be studied for fuzzy graphs also. Mainly focused on fuzzy trees defined by Rosenfeld in [10] , several other types of fuzzy trees are defined depending on the acyclicity level of a fuzzy graph. It is observed that there are selfcentered fuzzy trees. Some operations on fuzzy graphs and prove that complement of the union two fuzzy graphs is the join of their complements and complement of the join of two fuzzy graphs is union of their complements. The study of fuzzy graphs made in this thesis is far from being complete. The wide ranging applications of graph theory and the interdisciplinary nature of fuzzy set theory, if properly blended together could pave a way for a substantial growth of fuzzy graph theory.

Some Generalizations of Fuzzy Metrizability

The main purpose of the study is to extent concept of the class of spaces called ‘generalized metric spaces’ to fuzzy context and investigates its properties. Any class of spaces defined by a property possessed by all metric spaces could technically be called as a class of ‘generalized metric spaces’. But the term is meant for classes, which are ‘close’ to metrizable spaces in some under certain kinds of mappings. The theory of generalized metric spaces is closely related to ‘metrization theory’. The class of spaces likes Morita’s M- spaces, Borges’s w-spaces, Arhangelskii’s p-spaces, Okuyama’s  spaces have major roles in the theory of generalized metric spaces. The thesis introduces fuzzy metrizable spaces, fuzzy submetrizable spaces and proves some characterizations of fuzzy submetrizable spaces, and also the fuzzy generalized metric spaces like fuzzy w-spaces, fuzzy Moore spaces, fuzzy M-spaces, fuzzy k-spaces, fuzzy -spaces study of their properties, prove some equivalent conditions for fuzzy p-spaces. The concept of a network is one of the most useful tools in the theory of generalized metric spaces. The -spaces is a class of generalized metric spaces having a network.

Study on Fuzzy Ordered FuzzyTopological Spaces

In this study we combine the notions of fuzzy order and fuzzy topology of Chang and define fuzzy ordered fuzzy topological space. Its various properties are analysed. Product, quotient, union and intersection of fuzzy orders are introduced. Besides, fuzzy order preserving maps and various fuzzy completeness are investigated. Finally an attempt is made to study the notion of generalized fuzzy ordered fuzzy topological space by considering fuzzy order defined on a fuzzy subset.