• 충청수학회지
• /
• 제31권4호
• /
• pp.387-396
• /
• 2018

Topology may described a pattern of existence of elements of a given set X. The family ${\tau}(X)$ of all topologies given on a set X form a complete lattice. We will give some topologies on this lattice ${\tau}(X)$ using a fixed topology on X and we will regard ${\tau}(X)$ a topological space. Our purpose of this study is to comparison new topologies on the family ${\tau}(X)$ of all topologies induced old one.

• EDISON SW 활용 경진대회 논문집
• /
• 제2회(2013년)
• /
• pp.243-245
• /
• 2013

Topological insulator (TI) has non-trivial metallic surface states and has provoked many studies of property of this metarial. One of TI, $Bi_2Se_3$ is the promising metarial due to application of quantum devices. We investigate the effect of Ag adatom in the $Bi_2Se_3$ (111) surface. The silver atom prefers to locate within the vdW gap between the QLs rather than on the top surface. The effect of Ag adsorption is the rise of the Fermi level implying that the adsorbed Ag atoms behave like electron donors.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제26권3호
• /
• pp.199-208
• /
• 2019

A necessary and sufficient condition in terms of lower cut sets is given for the insertion of a Baire-.5 function between two comparable real-valued functions on the topological spaces that whose $F_{\sigma}$-kernel of sets are $F_{\sigma}$-sets.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제26권1호
• /
• pp.1-12
• /
• 2019

Necessary and sufficient conditions in terms of lower cut sets are given for the strong insertion of a Baire-.5 function between two comparable real-valued functions on the topological spaces that $F_{\sigma}-kernel$ of sets are $F_{\sigma}-sets$.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제29권1호
• /
• pp.19-29
• /
• 2022

Information systems and decision rules with imprecision and uncertainty in data analysis are studied in complete residuated lattices. In this paper, we introduce the notions of Alexandrov pretopology (precotopology) and join-meet (meet-join) operators in complete co-residuated lattices. Moreover, their properties and examples are investigated.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 1999년도 춘계공동학술대회-지식경영과 지식공학
• /
• pp.281-287
• /
• 1999

Decision class analysis (DCA) is viewed as a classification problem where a set of input data (situation-specific knowledge) and output data(a topological leveled influence diagram (ID)) is given. Situation-specific knowledge is usually given from a decision maker (DM) with the help of domain expert(s). But it is not easy for the DM to know the situation-specific knowledge of decision problem exactly. This paper presents a methodology for sensitivity analysis of DCA under incomplete information. The purpose of sensitivity analysis in DCA is to identify the effects of incomplete situation-specific frames whose uncertainty affects the importance of each variable in the resulting model. For such a purpose, our suggested methodology consists of two procedures: generative procedure and adaptive procedure. An interactive procedure is also suggested based the sensitivity analysis to build a well-formed ID. These procedures are formally explained and illustrated with a raw material purchasing problem.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2004년도 춘계학술발표대회
• /
• pp.1529-1532
• /
• 2004

A Mobile Ad Hoc NETwork (MANET) is a collection of wireless mobile nodes that forms a temporary network without the need for any existing network infrastructure or centralized administration. Therefore, such a network is designed to operate in a highly dynamic environment due to node mobility. In mobile ad hoc network, frequent topological changes cause routing a challenging problem and without the complete view of the network topology, establishing the shortest path from the source node to the destination node is difficult. In this paper, we suggest a routing approach which utilizes location information to setup the shortest possible path between the source node and the destination node. Location information is obtained through Global Positioning System (GPS) and this geographical coordinate information of the destination node is used by the source node and intermediate nodes receiving route request messages to determine the shortest path to the destination from current node.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제17권1호
• /
• pp.86-93
• /
• 2017

In this paper, we propose a novel defect detection method using component tree representations of scanning electron microscopy (SEM) images. The component tree contains rich information about the topological structure of images such as the stiffness of intensity changes, area, and volume of the lobes. This information can be used effectively in detecting suspicious defect areas. A quasi-linear algorithm is available for constructing the component tree and computing these attributes. In this paper, we modify the original component tree algorithm to be suitable for our defect detection application. First, we exclude pixels that are near the ground level during the initial stage of component tree construction. Next, we detect significant lobes based on multiple attributes and edge information. Our experiments performed with actual SEM wafer images show promising results. For a $1000{\times}1000$ image, the proposed algorithm performed the whole process in 1.36 seconds.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.1069-1084
• /
• 2011

This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제9권3호
• /
• pp.1051-1059
• /
• 2014

In this paper, we propose an intelligent situation recognition model by collecting and analyzing multiple sensor signals. Multiple sensor signals are collected for fixed time window. A training set of collected sensor data for each situation is provided to K2-learning algorithm to generate Bayesian networks representing causal relationship between sensors for the situation. Statistical characteristics of sensor values and topological characteristics of generated graphs are learned for each situation. A neural network is designed to classify the current situation based on the extracted features from collected multiple sensor values. The proposed method is implemented and tested with UCI machine learning repository data.