• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2002.05a
• /
• pp.30-33
• /
• 2002

There are several methods to implement the logical machine reasoning such as a frame theory and a production system of artificial intelligence. And these algorithms can explain the obtained result through the inference processes. However, emotional (KANSEI) patterns are not so easily implement. One of reason is that some emotional expression is the result of process from unconscious level to conscious level, and not easily identified the original unconscious causes. Therefore, a function of KANSEI database needs to structuralize unconscious level. Our approach is to develop the computerized counseling support system which can structuralize the unconscious brain functions from the view point of the psychology with focusing physiological and emotional responses. Especially, development of the algorithm that can form the network from unconscious to conscious using the image recollection is the application of the structured association technique (SAT). The developed system was implemented on the Web using CGI and emotional network database.

• Korean Journal of Cognitive Science
• /
• v.13 no.1
• /
• pp.13-21
• /
• 2002

Fuzzy logic ignores some information in the reasoning process. Neural network is powerful tools for the pattern processing, but, not appropriate for the logical reasoning. To model human knowledge, besides pattern processing capability, the logical reasoning capability is equally important. Another new neural network called neural logic network is able to do the logical reasoning. Because the fuzzy inference is a fuzzy logical reasoning, we construct fuzzy inference network based on the neural logic network, extending the existing rule-inference network. And the traditional propagation rule is modified. Experiments are performed to compare search costs by sequential searching and searching by priority. The experimental results show that the searching by priority is more efficient than the sequential searching as the size of the fuzzy inference network becomes larder and an the number of searching increases.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.8
• /
• pp.19-29
• /
• 2001

The recent explosion in the Internet applications, Internet. host number and the traffic in the IP backbone network is posing new challenges for transport network. This requires a high-speed IP backbone network that has a substantially higher bandwidth than the one offered by current networks, which prompts the development of all-optical network. To obtain optical network utilization gains, we need a software which establishs logical topology to make possible the efficient use or physical topology, and control the optical network in combination with the IP layer routing protocols. Finally, the logical topology is required higher efficient than physical topology. For this an efficient algorithm for the routing and wavelength assignment(RWA) in the WDM all-optical network is necessary. In this paper, two kinds of heuristic algorithms to establish logical topology for WDM networks and arc applied to the design of logical topology of domestic backbone network. These algorithms are found to work quite well and they arc compared with each other in terms of blocking rate, etc.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.2
• /
• pp.168-175
• /
• 2003

A new algorithm based on Genetic Algorithms is proposed f3r solving process optimization problems formulated in MINLP, GDP and hybrid MINLP/GDP. This work is focused especially on the design of the Genetic Algorithm suitable to handle disjunctive programming with the same level of MINLP handling capability. Hybridization with the Simulated Annealing is experimented and many heuristics are adopted. Real and binary coded Genetic Algorithm initiates the global search in the entire search space and at every stage Simulated Annealing makes the candidates to climb up the local hills. Multi-Niche Crowding method is adopted as the multimodal function optimization technique. and the adaptation of probabilistic parameters and dynamic penalty systems are also implemented. New strategies to take the logical variables and constraints into consideration are proposed, as well. Various test problems selected from many fields of process systems engineering are tried and satisfactory results are obtained.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.2
• /
• pp.247-253
• /
• 1995

An efficient algorithm for clipping 2D lines on a rectangular window is proposed. It is suitable for displaying images consisted of many lines for it can reduce the number of arithmetic and logical operations. The algorithm is compared with the Cohen-Sutherland algorithm and it was proved to be efficient.

• Proceedings of the KOSOMBE Conference
• /
• v.1989 no.05
• /
• pp.13-14
• /
• 1989

Prolongation in QT corrected interval (QTc), measured in surface ECG, has been shown in the majority af patients to be marker of bad prognosis in postmyocardial infarction patients (PMIP). Hence it would seem logical that dynamic QTc interval measurement can be a very usefull indicator to stratify prognosis in PMIP. We present a new algorithm for QT as well as for QTP (distance value from Q wave onset to T wave peak) intervals measurement in 24 hour ECG Holter tapes. Validation of the algorithm by hand measurement has been done on first beats of 18 Holter tapes, resulting in a magnitude of deviations between 10 and 15 ms. Application on 24 hour Holter ECG signal has also been done.

• Journal of the military operations research society of Korea
• /
• v.22 no.1
• /
• pp.81-96
• /
• 1996

In a relational database environment, partitioning of data is directly concerned with the amount of data that needs to be required in a query or transaction. In this paper, we consider non-overlapping, vertical partitioning. Vertical partitioning algorithm in this paper is composed of two phases. In phase 1, we cluster the attributes with zero-one integer program that maximize affinity among attributes. The result of phase 1 is called 'Initial Fragments'. In phase 2, we modify Initial Fragments that is not directly considered by cost factors, making use of a transaction-based partitioning method. A transaction-based partitioning method is partitioning attributes according to a set of transactions. In this phase we select logical accesses which needs to be required in a transaction as comparison criteria. In phase 2, proposed algorithm consider only small number of modification of Initial Fragments in phase 1. This algorithm is so insensible to number of transactions and of attributes that it can applied to relatively large problems easily.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.4
• /
• pp.189-196
• /
• 2011

In this paper, we propose a logical control-based actor-critic algorithm as an efficient approach for the approximation of the capacitated fab scheduling problem. We apply the average reward temporal-difference learning method for estimating the relative value functions of system states, while avoiding deadlock situation by Banker's algorithm. We consider the Intel mini-fab re-entrant line for the evaluation of the suggested algorithm and perform a numerical experiment by generating some sample system configurations randomly. We show that the suggested method has a prominent performance compared to other well-known heuristics.

• Journal of Advanced Information Technology and Convergence
• /
• v.9 no.1
• /
• pp.77-87
• /
• 2019

The Butterfly model, which aims to solve contradiction problems, defines the type of contradiction for given problems and finds the problem-solving objectives and their strategies. Unlike the ARIZ algorithm in TRIZ, the Butterfly model is based on logical proposition, which helps to reduce trial and errors and quickly narrows the problem space for solutions. However, it is hard for problem solvers to define the right propositional relations in the previous Butterfly algorithm. In this research, we propose a contradiction solving algorithm which determines the right problem-solving strategy just with yes or no simple questions. Also, we implement the Butterfly Chatbot based on the proposed algorithm that provides visual and auditory information at the same time and help people solve the contradiction problems. The Butterfly Chatbot can solve contradictions effectively in a short period of time by eliminating arbitrary alternative choices and reducing the problem space.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.107-115
• /
• 2014

The reduced-bit transform based bit-plane matching algorithm (BPM) can obtain the block matching result through its simple calculation and hardware design compared to the conventional block matching algorithms (BMAs), but the block matching accuracy of BPMs is somewhat low. In this paper, reduced-bit transform based sum of the absolute difference (R-SAD) is proposed to improve the block matching accuracy in comparison with the conventional BPMs and it is shown that the matching process can be obtained using the logical operations. Firstly, this method transforms the current and the reference images into their respective 2-bit images and then a truth table is obtained from the relation between input and output 2-bit images. Next, a truth table is simplified by Karnaugh map and the absolute difference is calculated by using simple logical operations. Finally, the simulation results show that the proposed R-SAD can obtain higher accuracy in block matching results compared to the conventional BPMs through the PSNR analysis in the motion compensation experiments.