• Journal of KIISE
• /
• v.44 no.1
• /
• pp.57-62
• /
• 2017

Traditional Korean morphological analysis and POS tagging methods usually consist of two steps: 1 Generat hypotheses of all possible combinations of morphemes for given input, 2 Perform POS tagging search optimal result. require additional resource dictionaries and step could error to the step. In this paper, we tried to solve this problem end-to-end fashion using sequence-to-sequence model convolutional features. Experiment results Sejong corpus sour approach achieved 97.15% F1-score on morpheme level, 95.33% and 60.62% precision on word and sentence level, respectively; s96.91% F1-score on morpheme level, 95.40% and 60.62% precision on word and sentence level, respectively.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.674-679
• /
• 2017

In big-data environments wherein large amounts of text documents are produced daily, titles are very important clues that enable a prompt catching of the key ideas in documents; however, titles are absent for numerous document types such as blog articles and social-media messages. In this paper, a title-generation model for which sequence-to-sequence RNNs with attention and copying mechanisms are employed is proposed. For the proposed model, input sentences are encoded based on bi-directional GRU (gated recurrent unit) networks, and the title words are generated through a decoding of the encoded sentences with keywords that are automatically selected from the input sentences. Regarding the experiments with 93631 training-data documents and 500 test-data documents, the attention-mechanism performances are more effective (ROUGE-1: 0.1935, ROUGE-2: 0.0364, ROUGE-L: 0.1555) than those of the copying mechanism; in addition, the qualitative-evaluation radiative performance of the former is higher.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.4
• /
• pp.95-103
• /
• 2009

Global interests for construction of 3 dimensional spatial information has risen due to development of measurement sensors and data processing technologies. In spite of criticism for the violation of personal privacy, CCTV cameras equipped in outdoor public space of urban area are used as a fundamental sensor for traffic management, crime prevention or hazard monitoring. For safety guarantee in urban environment and disaster prevention, a surveillance system integrating pre-constructed 3 dimensional spatial information with CCTV data or video sequence is needed for monitoring and observing emergent situation interactively in real time. In this study, we proposed applicability of the prototype system for web visualization based on X3D, an international standard of real time web visualization, by integrating 3 dimensional spatial information with video sequence.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.857-865
• /
• 2020

This paper presents a method for code generation of UML sequence diagrams based on message patterns. In the sequence diagrams, it is shown that messages are some types of forms typically. This paper classifies according to type as three patterns, and construct meta-information for code generation analysing structural infomation for each patterns. The meta-message of structural information (MetaMessage) is stored in the MetaMessage datastore and the meta-method information from the MetaMessage is stored in the MetaMethod datastore. And then, the structural information of MetaClass and MetaObject is constructed in each datastore too. For each pattern, this paper presents a method for code generation based on the meta information of message patterns and the syntax of target progamming language. Also, branching and looping that has been seldom handled integratedly in the previous works are handled as same as the basic patterns by classifying the branching pattern and the looping pattern for code generation integratedly.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.267-274
• /
• 2006

Self-spreading (SSP) is a spread spectrum technique where the spreading sequence is generated from data bits. Although SSP allows communications with low probability of interception by unintended receivers, despreading by the intended receiver is prone to error propagation. In this paper, we propose both a new transmitter and a new receiver based on SSP with the aim to a) reduce error propagation and b) increase the concealment of the transmission. We first describe a new technique for the generation of SSP spreading sequence, which generalizes SSPs of existing literature. We include also coding at the transmitter, in order to further reduce the effects of error propagation at the receiver. For the receiver, we propose a turbo architecture based on the exchange of information between a soft despreader and a soft-input soft-output decoder. We design the despreader in order to fully exploit the information provided by the decoder. Lastly, we propose a chip decoder that extracts the information on data bits contained in the spreading sequence from the received signal. The performance of the proposed scheme is evaluated and compared with existing spread-spectrum systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1142-1148
• /
• 2007

In this paper, we propose ASLM (Adaptive Selective Mapping; ASLM) scheme based on peak observation for PAPR (Peak-to-Average Power Ratio) reduction of OFDM (Orthogonal Frequency Division Multiplexing) signals. The proposed scheme is composed of three steps: peak scaling, sequence selection, and SLM procedures. In the first step, the peak signal samples in the IFFT (Inverse Fast Fourier Transform) outputs of the original input sequence are scaled down. In the second step, the sub-carrier positions where the power difference between the original input sequence and the FFT output of the scaled signal is large, are identified. Then, the phase sequences having the maximum number of phase-reversed sequence words only for these positions are selected. Finally, the generic SLM procedure is performed by using only the selected phase sequences for the original input sequence. Simulation results show that the proposed scheme significantly reduces the complexity in terms of IFFT and PAPR calculation than the conventional SLM, while maintaining the PAPR reduction performance.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.6
• /
• pp.470-477
• /
• 2015

This paper presents a new technique for generating an optimum synchronizable test sequence that can be applied in the distributed test architecture where both external synchronization and input/output operation costs are taken into consideration. The method defines a set of phases that constructs a tester-related digraph from a given finite state machine representation of a protocol specification such that a minimum cost tour of the digraph with intrinsically synchronizable transfer sequences can be used to generate an optimum synchronizable test sequence using synchronizable state identification sequences as the state recognition sequence for each state of the given finite state machine. This hybrid approach with a heuristic and optimization technique provides a simple and elegant solution to the synchronization problem that arises during the application of a predetermined test sequence in some protocol test architectures that utilize remote testers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.736-744
• /
• 2006

For the handhold devices, minimizing repetitive CPU operations such as multiplications is a major factor for their performances. In this paper, we propose efficient algorithms for finding similar sequences from streaming time-series data such as stock prices, network traffic data, and sensor network data. First, we formally define the problem of similar subsequence matching from streaming time-series data, which is called the stream sequence matching in this paper. Second, based on the window construction mechanism adopted by the previous subsequence matching algorithms, we present an efficient window-based approach that minimizes CPU operations required for stream sequence matching. Third, we propose a notion of window MBR and present two stream sequence matching algorithms based on the notion. Fourth, we formally prove correctness of the proposed algorithms. Finally, through a series of analyses and experiments, we show that our algorithms significantly outperform the naive algorithm. We believe that our window-based algorithms are excellent choices for embedded stream sequence matching in handhold devices.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.803-811
• /
• 2003

Multiple sequence alignment is a useful tool to identify the relationships among protein sequences. Dynamic programming is the most widely used algorithm to obtain multiple sequence alignment with optimal cost. However, dynamic programming cannot be applied to certain cost function due to its drawback and cannot be used to produce optimal multiple sequence alignment. We propose sub-alignment refinement algorithm to overcome the problem of dynamic programming. Also we show proposed algorithm can solve the problem of dynamic programming efficiently.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.56-63
• /
• 1984

This paper proposes a programmed logic realization of sequential logic system with parallel sequences which is described by a GRAFCET. For this purpose, an algorithm is proposed, which decomposes the GRAFCET with parallel sequence into a set of state graph without changing the physical meaning, which is applied to all kinds of GRAFCET, and which divides the system into sub-systems and vice versa. A systematic implementation by microprogrammed logic using ROM is proposed, which expands the number of selection sequence.