• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.649-652
• /
• 2001

In this paper, we introduce neighborhood systems in an L-fuzzy topology using complete MV-algebras. We investigate the relationship between L-fuzzy topologies and the neighborhood systems. We study the properties of neighborhood system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.9 no.2
• /
• pp.65-70
• /
• 2009

In this paper, we introduced the notion of (L,$\bigodot$)-quasi-uniform spaces and (L,$\bigodot$)-neighborhood systems on a strictly two-sided, commutative quantale lattice L. We investigate their properties and give the examples. In particular, we study the relations between (L,$\bigodot$)-quasi-uniform spaces and (L,$\bigodot$)-neighborhood systems.

• Communications of the Korean Mathematical Society
• /
• v.23 no.1
• /
• pp.125-131
• /
• 2008

We introduce and study the concepts of strong generalized neighborhood systems, SGNS and sg-open sets. We also introduce and investigate the concept of (${\psi},\;{\psi}^'$)-continuity and sg-continuity on SGNS's.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.6
• /
• pp.13-21
• /
• 2016

Feature selection is the one of important issue in the field of data mining and machine learning. It is the technique to find a subset of features which provides the best classification performance, from the source data. We propose a feature subset selection method using the neighborhood rough set model based on information granularity. To demonstrate the effectiveness of proposed method, it was applied to select the useful features associated with breast tumor diagnosis of 298 shape features extracted from 5,252 breast ultrasound images, which include 2,745 benign and 2,507 malignant cases. Experimental results showed that 19 diagnostic features were strong predictors of breast cancer diagnosis and then average classification accuracy was 97.6%.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.35-50
• /
• 2011

We construct the index pairs of an isolated neighborhood for a dispersive dynamical system and investigate the existence of an index pair which is stable under small perturbations of the dispersive dynamical systems.

• KIEAE Journal
• /
• v.13 no.3
• /
• pp.21-26
• /
• 2013

Recently, as the concern over environmental problem has been serious all over the world, carbon has become a key issue to mitigate the problem. In the field of Architecture, various sustainable assessment systems and LCCO2 assessment strategies have been developed, guiding low carbon building while planning. However, assessment system for low carbon neighborhood, which can be more efficient strategy, is still in the stage of research. In this paper, as a research for low carbon assessment system and planning guideline for neighborhood, scope meeting domestic condition has been set and sustainable assessment system for neighborhood, which is similar to low carbon concept, have been compared. LEED-Neighborhood Development, BREEAM-Communities, CASBEE-Urban Development, and GBCC-Apartment Houses were used for comparison. As a result, it is found that those systems has many differences in judging system, aggregating method, scope of evaluation, and relations with a building assessment system. The concern about carbon is not insufficient yet. Finally, assessment system for low carbon neighborhood, which is not only for establishing the plan, but also for giving guideline at the very first state of the plan, should be developed as fast as passible. With the result of this paper, establishment of assessment criteria and the way to measure quantitative $CO_2$ should be studied forward.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.2
• /
• pp.187-191
• /
• 2002

In this paper, we introduce the notion of smooth neighborhoods in smooth topological spaces and investigate some of their properties. In particular, we can obtain some smooth topologies from a smooth neighborhood system.

• The Korean Journal of Applied Statistics
• /
• v.21 no.3
• /
• pp.387-397
• /
• 2008

Recently many researches on data analysis using spatial statistics have been studied in various field and the studies on small area estimations using spatial statistics are in actively progress. In analysis of lattice data, defining the neighborhood information system is the most crucial procedure because it also determines the result of the analysis. However the used neighborhood informal ion system is generally defined by sharing the common border lines of small areas. In this paper the other neighborhood information systems are introduced and those systems are compared with Moran's I statistic and for the comparisons, Economic Active Population Survey (2001) is used.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.279-282
• /
• 1995

In this paper, a moving horizon control algorithm, which can be applied for a wide class of nonlinear systems with control and state constraints, is considered. In a neighborhood of the origin, a linear feedback controller is applied. Outside this neighborhood, a moving horizon control law is applied. The time taken to solve an optimal control problem is considered in the algorithm so that the proposed control law can be applied as an on-line controller.

• Industrial Engineering and Management Systems
• /
• v.8 no.1
• /
• pp.22-28
• /
• 2009

We consider facility layout problems, where mn facility units are assigned into mn cells. These cells are arranged into a rectangular pattern with m rows and n columns. In order to solve this cell type facility layout problem, many approximation algorithms with improved local search methods were studied because it was quite difficult to find exact optimum of such problem in case of large size problem. In this paper, new algorithms based on Simulated Annealing (SA) method with two neighborhood generation methods are proposed. The new neighborhood generation method adopts the exchanging operation of facility units in accordance with adjacent preference. For evaluating the performance of the neighborhood generation method, three algorithms, previous SA algorithm with random 2-opt neighborhood generation method, the SA-based algorithm with the new neighborhood generation method (SA1) and the SA-based algorithm with probabilistic selection of random 2-opt and the new neighborhood generation method (SA2), are developed and compared by experiment of solving same example problem. In case of numeric examples with problem type 1 (the optimum layout is given), SA1 algorithm could find excellent layout than other algorithms. However, in case of problem type 2 (random-prepared and optimum-unknown problem), SA2 was excellent more than other algorithms.