• Proceedings of the KOSOMBE Conference
• /
• v.1990 no.11
• /
• pp.11-14
• /
• 1990

The detection of pulmonary blood vessels is very difficult owing to their complex tree structures and different widths. In this paper, We propose a new detection algorithm. The motivation of this algorithm is that Han is the best detector. So, this algorithm is developed to imitate the human searching process. To realize it, the algorithm consist of two components. One is Pyramid Images whose one pixel is median value of four pixels of the previous low level. Searching gradually from high level to low level, We concentrate on global and main information of structure at the first. Then based on it, We search the detailed data in low level. The other is fuzzy logic which makes it easy to convert searching process expressed as human language into numeric multi_value. This algorithm showes speedy and robust results. But the more study on both human searching process and the detection of small part is needed.

• Journal of the Korean Society of Systems Engineering
• /
• v.9 no.1
• /
• pp.65-84
• /
• 2013

This paper introduces a systems engineering approach to reliability centered maintenance to address some of the weaknesses. Reliability centered maintenance is a systematic, disciplined process that produces an efficient equipment management strategy to reduce the probability of failure [1]. The study identifies the need for RCM, requirements analysis, design for RCM implementation. Value modeling is used to evaluate the value measures of RCM. The system boundary for the study has been selected as containment spray pump and its motor drive. Failure Mode and Criticality Effects analysis is applied to evaluate the failure modes while the logic tree diagram used to determine the optimum maintenance strategy. It is concluded that condition based maintenance tasks should be enhanced to reduce component degradation and thus improve reliability and availability of the component. It is recommended to apply time directed tasks to age related failures and failure finding tasks to hidden failures.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.4
• /
• pp.277-284
• /
• 2012

Named entity recognition (NER) technique can play a crucial role in extracting information from the web. While NER systems with relatively high performances have been developed based on careful manipulation of terms with a statistical model, term mismatches often degrade the performance of such systems because the strings of all the candidate entities are not known a priori. Despite the importance of lexical-level term mismatches for NER systems, however, most NER approaches developed to date utilize only the term string itself and simple term-level features, and do not exploit the semantic features of terms which can handle the variations of terms effectively. As a solution to this problem, here we propose to match the semantic concepts of term units in restaurant named entities (NEs), where these units are automatically generated from multiple resolutions of a semantic tree. As a test experiment, we applied our restaurant NER scheme to 49,153 nouns in Korean restaurant web pages. Our scheme achieved an average accuracy of 87.89% when applied to test data, which was considerably better than the 78.70% accuracy obtained using the baseline system.

• School Mathematics
• /
• v.7 no.4
• /
• pp.353-373
• /
• 2005

The purpose of this paper is to analysis the basic network problem which can be applied to the mathematically gifted students in elementary school. Mainly, we discuss didactic transpositions of the double counting principle, the game of sprouts, Eulerian graph problem, and the minimum connector problem. Here the double counting principle is related to the handshaking lemma; in any graph, the sum of all the vertex-degree is equal to the number of edges. The selection of these subjects are based on the viewpoint; to familiar to graph theory, to raise algorithmic thinking, to apply to the real-world problem. The theoretical background of didactic transpositions of these subjects are based on the Polya's mathematical heuristics and Lakatos's philosophy of mathematics; quasi-empirical, proofs and refutations as a logic of mathematical discovery.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.2
• /
• pp.21-27
• /
• 2008

This paper describes a CMOS 16:1 binary-tree multiplexer(MUX) using $0.18-{\mu}m$ technology. To provide immunity for wide frequency range and process-and-temperature variations, the MUX adopts several delay compensation techniques. Simulation results show that the proposed MUX maintains the setup margins and hold margins close to the optimal value, i.e., 0.5UI, in wide frequency-range and in wide process-and-temperature variations, with standard deviation of 0.05UI approximately. These results represent that these proposed delay compensations are effective and the reliability is much improved although CMOS logic circuits are sensitive to those variations. The MUX is fabricated using $0.18-{\mu}m$ CMOS process, and tested with a test board. At power supply voltage of 1.8-V, maximum data-rate and area of the MUX is 1.65-Gb/s and 0.858 $mm^2$, respectively. The MUX dissipates a power of 24.12 mW, and output eye opening is 272.53 mV, 266.55 ps at 1.65-Gb/s operation.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.212-218
• /
• 2003

State invariant is a property that holds in every reachable state. It can be used not only in understanding and analyzing complex software systems, but it can also be used for system verifications such as checking safety, liveness, and consistency. For these reasons, there are many vital researches for deriving state invariant from finite state machine models. In previous works every reachable state is to be considered to generate state invariant. Thus it is likely to be too complex for the user to understand. This paper seeks to answer the question `how to simplify state invariant\ulcorner`. Since the complexity of state invariant is strongly dependent upon the size of states to be considered, so the smaller the set of states to be considered is, the shorter the length of state invariant is. For doing so, we let the user focus on some interested scopes rather than a whole state space in a model. Computation Tree Logic(CTL) is used to specify scopes in which he/she is interested. Given a scope in CTL, mixed reachability analysis is used to find out a set of states inside it. Obviously, a set of states calculated in this way is a subset of every reachable state. Therefore, we give a weaker, but comprehensible, state invariant.

• The Journal of Korean Association of Computer Education
• /
• v.22 no.1
• /
• pp.87-98
• /
• 2019

It is easy to assume that contradictions are logically incorrect or empty sets that have no solvability. This dilemma, which can not be done, is difficult to solve because it has to solve the contradiction hidden in it. Paradoxically, therefore, contradiction resolution has been viewed as an innovative and creative problem-solving. TRIZ, which analyzes the solution of the problem from the perspective of resolving contradictions, has been used for people rather than computers. The Butterfly model, which analyzes the problem from the perspective of solving the contradiction like TRIZ, analyzed the type of contradiction problem using symbolic logic. In order to apply an appropriate concrete solution strategy for a given contradiction problems, we designed the Butterfly algorithm based on decision making tree. We also developed a visualization tool based on Python tkInter to find concrete solution strategies for given contradiction problems. In order to verify the developed tool, the third grade students of middle school learned the Butterfly algorithm, analyzed the contradiction of the wooden support, and won the grand prize at an invention contest in search of a new solution. The Butterfly algorithm developed in this paper systematically reduces the solution space of contradictory problems in the beginning of problem solving and can help solve contradiction problems without trial and errors.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.1
• /
• pp.19-25
• /
• 2020

In frequent pattern mining, the uncertainty of each item is accompanied by a loss of information. AAlso, in real environment, the importance of patterns changes with time, so fuzzy logic must be applied to meet these requirements and the dynamic characteristics of the importance of patterns should be considered. In this paper, we propose a fuzzy utility mining technique for extracting frequent web page sets from web log databases through fuzzy utility-based web page set mining. Here, the downward closure characteristic of the fuzzy set is applied to remove a large space by the minimum fuzzy utility threshold (MFUT)and the user-defined percentile(UDP). Extensive performance analyses show that our algorithm is very efficient and scalable for Fuzzy Utility Mining using dynamic weights.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.11-18
• /
• 2005

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint. This algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by $62.2\%$ than those of DDMAP. And reduced the number of CLBs by $17.6\%$ than those of TEMPLA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.131-134
• /
• 2005

This paper describes the efficient peer-to-peer migration method of Grid service agent on the mobile agent based P-Grid. The migration mechanism for transmitting service agent upon the service request is based on the peer's logic network topology. The network topologies that this system uses are organized as star topology, ring topology and tree topology, and agents are migrated by the master/slave method and serial/parallel method. The migration method of services is chosen based on the execution range and characteristic of the requested service. Also, the entire execution time of service is affected by the performance of peer that is a part of network topology, and the migration order, Therefore, the system monitors the performance of peers, and determines the migration priority based on analyzing and learning history. The system can reduce service execution time efficiently with decisions of migration method for service agent and priority of peers.