• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.99-107
• /
• 2010

This paper is a study about the relationships among topologies and intuitionistic fuzzy topology induced, respectively, by approximation operators and an intuitionistic fuzzy approximation operator associated with an approximation space (X, R), when the relation R on X is precisely reflexive and transitive. In particular, we consider an intuitionistic fuzzy approximation operator on an approximation space X (i.e., a set X with a reflexive and transitive relation on it), which turns out to be an intuitionistic fuzzy closure operator. This intuitionistic fuzzy closure operator gives rise to two saturated fuzzy topologies on X and it turns out that all the level topologies of one of the fuzzy topology coincide and equal to the topology analogously induced on X by a crisp approximation operator. These observations are then applied to intuitionistic fuzzy automata.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.875-883
• /
• 2010

We introduce the concept of intuitionistic smooth topology in Lowen's sense and we prove that the family IST(X) of all intuitionistic smooth topologies on a set is a meet complete lattice with least element and the greatest element [Proposition 3.6]. Also we introduce the notion of level fuzzy topology on a set X with respect to an intuitionistic smooth topology and we obtain the relation between the intuitionistic smooth topology $\tau$ and the intuitionistic smooth topology $\eta$ generated by level fuzzy topologies with respect to $\tau$ [Theorem 3.10].

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.157-176
• /
• 2011

An interest-based P2P constructs the peer connections based on similarities for efficient search of resources. A clustering technique using peer similarities as data is an effective approach to group the most relevant peers. However, the separation of groups produced from clustering lowers the scalability of a P2P network. Moreover, the interest-based approach is only concerned with user-level grouping where topology-awareness on the physical network is not considered. This paper proposes an efficient scalable search for the interest-based P2P system. A scalable multi-ring (SMR) based on fuzzy clustering handles the grouping of relevant peers and the proposed scalable search utilizes the SMR for scalability of peer queries. In forming the multi-ring, a minimized route function is used to determine the shortest route to connect peers on the physical network. Performance evaluation showed that the SMR acquired an accurate peer grouping and improved the connectivity rate of the P2P network. Also, the proposed scalable search was efficient in finding more replicated files throughout the peer network compared to other traditional P2P approaches.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.2
• /
• pp.108-113
• /
• 2005

This paper suggests a control method for an efficient topology/parameter evolution in a bond graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynamic systems. We adopt a hierarchical breeding control mechanism with fitness-level-dependent differences to obtain better balancing of topology/parameter search - biased toward topological changes at low fitness levels, and toward parameter changes at high fitness levels. As a testbed for this approach in bond graph synthesis, an eigenvalue assignment problem, which is to find bond graph models exhibiting minimal distance errors from target sets of eigenvalues, was tested and showed improved performance for various sets of eigenvalues.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.66-76
• /
• 2012

In this paper, we introduce the concept of ordinary smooth topology on a set X by considering the gradation of openness of ordinary subsets of X. And we obtain the result [Corollary 2.13] : An ordinary smooth topology is fully determined its decomposition in classical topologies. Also we introduce the notion of ordinary smooth [resp. strong and weak] continuity and study some its properties. Also we introduce the concepts of a base and a subbase in an ordinary smooth topological space and study their properties. Finally, we investigate some properties of an ordinary smooth subspace.

• Journal of Power Electronics
• /
• v.16 no.2
• /
• pp.654-665
• /
• 2016

The pumping of electric power from photovoltaic (PV) farms is normally carried out using transformers, which require heavy mounting structures and are thus costly, less efficient, and bulky. Therefore, transformerless schemes are developed for the injection of power into the grid. Compared with the H4 inverter topology, the H6 topology is a better choice for pumping PV power into the grid because of the reduced common mode current. This paper presents how the perturb and observe (P&O) algorithm for maximum power point tracking (MPPT) can be implemented in the H6 inverter topology along with the improved sinusoidal current injected to the grid at unity power factor with the average current mode control technique. On the basis of the P&O MPPT algorithm, a power reference for the present insolation level is first calculated. Maintaining this power reference and referring to the AC sine wave of bus bars, a sinusoidal current at unity power factor is injected to the grid. The proportional integral (PI) controller and fuzzy logic controller (FLC) are designed and implemented. The FLC outperforms the PI controller in terms of conversion efficiency and injected power quality. A simulation in the MATLAB/SIMULINK environment is carried out. An experimental prototype is built to validate the proposed idea. The dynamic and steady-state performances of the FLC controller are found to be better than those of the PI controller. The results are presented in this paper.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2762-2764
• /
• 2001

In this study, we introduce and investigate a class of dynamic perceptron architectures, discuss a comprehensive design methodology and carry out a series of numeric experiments. The proposed dynamic perceptron architectures are called as Polynomial Neural Networks(PNN). PNN is a flexible neural architecture whose topology is developed through learning. In particular, the number of layers of the PNN is not fixed in advance but is generated on the fly. In this sense, PNN is a self-organizing network. PNN has two kinds of networks, Polynomial Neuron(FPN)-based and Fuzzy Polynomial Neuron(FPN)-based networks, according to a polynomial structure. The essence of the design procedure of PN-based Self-organizing Polynomial Neural Networks(SOPNN) dwells on the Group Method of Data Handling (GMDH) [1]. Each node of the SOPNN exhibits a high level of flexibility and realizes a polynomial type of mapping (linear, quadratic, and cubic) between input and output variables. FPN-based SOPNN dwells on the ideas of fuzzy rule-based computing and neural networks. Simulations involve a series of synthetic as well as experimental data used across various neurofuzzy systems. A detailed comparative analysis is included as well.