• 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.

• Journal of Service Research and Studies
• /
• v.3 no.2
• /
• pp.53-60
• /
• 2013

Datamining from the large data in the form of various techniques for obtaining information have been developed. In recent years one of the most sought areas of pattern recognition and machine learning method is created with most of existing learning algorithms based on categorical attributes to a rule or decision model. However, the real-world data, it may consist of numeric attributes in many cases. In addition it contains attributes with numerical values to the normal categorical attribute. In this case, therefore, it is required processes in order to use the data to learn an appropriate value for the type attribute. In this paper, the domain of the numeric attributes are divided into several segments using learning algorithm techniques of discritization. It is described Clustering with other data mining techniques. Large amount of first cluster with characteristics is similar records from the database into smaller groups that split multiple given finite patterns in the pattern space. It is close to each other of a set of patterns that together make up a bunch. Among the set without specifying a particular category in a given data by extracting a pattern. It will be described similar grouping of data clustering technique to classify the data.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.6
• /
• pp.64-72
• /
• 2010

In general, due to the interactions among subsystems, it is difficult to design an decentralized controller for nonlinear interconnected systems. In this study, the model of nonlinear interconnected systems is studied via decentralized fuzzy control method with time delay and polytopic uncertainty. First, the nonlinear interconnected system is represented by an equivalent Takagi-Sugeno type fuzzy model. And the represented model can be rewritten as Parameterized Linear Matrix Inequalities(PLMIs), that is, LMIs whose coefficients are functions of a parameter confined to a compact set. We show that the resulting fuzzy controller guarantees the asymptotic stability and disturbance attenuation of the closed-loop system in spite of controller gain variations within a resulted polytopic region by example and simulations.

• Korean Journal of Mineralogy and Petrology
• /
• v.36 no.3
• /
• pp.199-212
• /
• 2023

Diffusion is a powerful tool to understand geological processes recorded in terrestrial rocks as well as extraterrestrial materials. Since the diffusive exchange of elements or isotopes may have occurred differently in the solar nebula (high temperature and rapid cooling) and on the parent bodies (fluid-assisted thermal metamorphism at relatively low temperature), it is particularly important to model elemental or isotopic diffusion profiles within the mineral grains to better understand the evolution of the early solar system. A numerical model with the finite difference method for the fast grain boundary diffusion was established for the exchange of elements or isotopes between constituent minerals in a closed system. The fast grain boundary diffusion numerical model was applied to 1) ²⁶Mg variation in plagioclase of an amoeboid olivine aggregate (AOA) from a CH chondrite and 2) Fe-Mg interdiffusion between chondrules, AOA, and matrix minerals in a CO chondrite. Equilibrium isotopic fractionation and equilibrium partitioning were also included in the numerical model, based on the assumption that equilibrium can be reached at the interfaces of mineral crystals. The numerical model showed that diffusion profiles observed in chondrite samples likely resulted from the diffusive exchange of elements or isotopes between the constituent minerals. This study also showed that the closure temperature is determined not only by the mineral with the slowest diffusivity in the system, but also strongly depends on the constituent mineral abundances.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.7-14
• /
• 2012

The quantized beamforming systems always need the channel state information, which must be quantized into a finite set of vectors (named codebook), and feedback only sends the index representing the desired vector. Thereby it minimized the impact of feedback errors, caused by feedback overhead and delay. In this regard, index assignment (IA) methods, an exhaustive-search and group-based schemes, have been presented for minimizes the performance degradation without additional feedback bits. In this paper, we proposed enhanced group-based IA method, which used the optimal codebook design with chordal distance, having the adaptive properties in application of the existing IA methods. When the number of transmit antennas is 4 and LTE codebook is used, Monte-Carlo simulations verify that the proposed scheme has a power advantage of 0.5~1dB to obtain the same bit error rate than methods without IA, and it has 0.1~0.2 dB better performance compared with the existing IA methods over same environment.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.3
• /
• pp.71-81
• /
• 1995

In this paper, feature vector extraction methods and classification algorithms for the automatic classification of transient signals in underwater are discussed. A feature vector extraction method using wavelet transform, which shows good performance with small number of coefficients, is proposed and compared with the existing classical methods. For the automatic classification, artificial neural networks such as multilayer perceptron (MLP), radial basis function (RBF), and MLP-Class are utilized, where those neural networks as well as extracted feature vectors are combined to improve the performance and reliability of the proposed algorithm. It is confirmed by computer simulation with Traco's standard transient data set I and simulated data that the proposed feature vector extraction method and classification algorithm perform well, assuming that the energy of a given transient signal is sufficiently larger than that of a ambient noise, that there are the finite number of noise sources, and that there does not exist noise sources more than two simultaneously.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1485-1492
• /
• 1999

대규모 시스템 명세의 올바름을 검증하기 위한 유한 상태 LTS에 기반을 둔 CTL논리 적용에 있어 가장 큰 문제점은, 시스템 내부의 병렬 프로세스간의 상호작용으로 인한 상태폭발이다. 그러나 Modal mu-calculus 논리를 시스템 안전성 및 필연성 특성 명세에 사용하면, 행위에 의한 순환적 정의가 가능하므로 상태폭발 문제가 해결 가능하다. 본 논문에서는 LTS로 명세화된 통신 프로토콜 시스템 모델의 안전성 및 필연성 특성을 모형 검사 기법에 의해 검증함에 있어, 시제 논리로 사용된 Modal mu-calculus 안전성 및 필연성 논리식과 CTL 의 안전성 및 필연성 논리식의 극한값이 동일함을 두 논리식을 만족하는 상태 집합이 같다는 것을 보임으로써 증명한다. 증명된 결과는 I/O FSM 모델로 표현된 통신 프로토콜의 안전성 및 필연성 검사를 위해 이론적인 기반으로서, 컴퓨터를 이용한 모형검사 기법에 효과적인 방법으로 응용이 가능하다.Abstract In applying CTL-based model checking approach to correctness verification of large state transition system specifications, the major obstacle is the combinational explosion of the state space arising due to interaction of many loosely coupled parallel processes. If, however, the modal mu-calculus viewed as a CTL-based logic with recursion, is used to specify the safety and liveness property of a given system, it is possible to resolve this problem. In this paper, we discuss the problem of verifying communication protocol system specified in LTS, and prove that a logic expression specifying safety and liveness in modal mu-calculus is semantically identical to the maximum value of the expression in CTL. This relation is verified by the proof that the sets of states satisfying the two logic expressions are equivalent. The proof can be used as a theoretical basis for verifying safety and liveness of communication protocols represented as I/O FSM model.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.476-484
• /
• 2008

Most string problems and their solutions are relevant to diverse applications such as pattern matching, data compression, recently bioinformatics, and so on. However, there have been few works on the relations between string problems and cryptographic problems. In this paper, we consider the following string reconstruction problems and show how these problems can be applied to cryptography. Given a string x of length n over a constant-sized alphabet ${\sum}$ and a set W of strings of lengths at most an integer $k({\leq}n)$, the first problem is to find the sequence of strings in W that reconstruct x by the minimum number of concatenations. We propose an O(kn+L)-time algorithm for this problem, where L is the sum of all lengths of strings in a given set, using suffix trees and a shortest path algorithm for directed acyclic graphs. The other is a dynamic version of the first problem and we propose an $O(k^3n+L)$-time algorithm. Finally, we show that exponentiation problems that arise in cryptography can be successfully reduced to these problems and propose a new solution for exponentiation.

• Journal of Advanced Navigation Technology
• /
• v.19 no.3
• /
• pp.230-236
• /
• 2015

In this paper, the electric potential of electrode surface is investigated by assuming them as two dimensional sets of point current sources. And, the simulated water tank is manufactured as a reduced scale of the earth. Henceforth, the adequate model electrode for test is decided to decrease experimental errors relevant to the limitation of the size of the water tank. The one of important things of this work, the deduction method of the potential interference factor is proposed, which used as the criterion of the potential interference according to the shape of conductors and the laying conditions, when multiple grounding conductors are situated at the same resistance grounding area. Also, the validity of this theory is verified from a numerical simulation of the grounding electrode to be used in experiments, and this study is realized by the verified theory and the simulated experiments.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1236-1243
• /
• 2017

In this paper, we propose a novel way of producing keyword networks, named LSI-based ClusterTextRank, which extracts significant key words from a set of clusters with a mutual information metric, and constructs an association network using latent semantic indexing (LSI). The proposed method reduces the dimension of documents through LSI, decomposes documents into multiple clusters through k-means clustering, and expresses the words within each cluster as a maximal spanning tree graph. The significant key words are identified by evaluating their mutual information within clusters. Then, the method calculates the similarities between the extracted key words using the term-concept matrix, and the results are represented as a keyword association network. To evaluate the performance of the proposed method, we used travel-related blog data and showed that the proposed method outperforms the existing TextRank algorithm by about 14% in terms of accuracy.