• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.2
• /
• pp.168-177
• /
• 1996

In this paper, we propose an on-line recognition system of chinese characters using an adaptive resonance theory-1(ART-1) neural network. Strokes, primitive components of chinese characters are usually warped into a cursive form and classifying them is very difficult. To deal with such cursive strokes, we use an ART-1 neural network that has the following advantages: (1) it automatically assembles similar patterns together to form classes in a self-organized manner: (2) it directly accesses the recognition codes corresponding to binary input patterns after self-stabilizing; (3) it doesn't tends to get trapped in local minima, or globally incorrect solutions. A database for character recognition also dynamically constructed with generalized character lists, and a new character can be included simply by adding a new sequence to the list. Character recognition is achieved by traversing the chinese datbase with a sequence of recognized strokes and positional relations between the strokes. To verify the performance of the system. We tested it for 1800 daily-used basic chinese second per character. This results suggest that the proposed system is pertinent to be put into practical use.

• Journal of Astronomy and Space Sciences
• /
• v.3 no.1
• /
• pp.41-51
• /
• 1986

Two-photometric light curves(Oh and Chen 1984) of the eclipsing binary TX UMa have been analyzed by the method of differential corrections of the model of Wilson and Devinney (1971). The system found to be simi-detached with the cooler and less massive component filling its Roche lobe. The absolute dimensions have been derived from the results of the photometric solutions with the spectroscopic elements of Hiltner(1945). It is assumed that the B8V primary component is on the zero main sequence stage of the core hydrogen burning and the secondary is at the core contraction stage after the shell hydrogen burning stage according to the Iben's (1967) evolutional tracks for $3.0m_\odot$ and $1.0m_\odot$ .

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.276-282
• /
• 2013

Self-encoded spread spectrum (SESS) is a novel modulation technique that acquires its spreading code from a random information source, rather than using the traditional pseudo-random noise (PN) codes. In this paper, we present our study of the SESS system performance under pulsed-noise jamming and show that iterative detection can significantly improve the bit error rate (BER) performance. The jamming performance of the SESS with correlation detection is verified to be similar to that of the conventional direct sequence spread spectrum (DSSS) system. On the other hand, the time diversity detection of the SESS can completely mitigate the effect of jamming by exploiting the inherent temporal diversity of the SESS system. Furthermore, iterative detection with multiple iterations can not only eliminate the jamming completely but also achieve a gain of approximately 1 dB at $10^{-3}$ BER as compared with the binary phase shift keying (BPSK) system under additive white gaussian noise (AWGN) by effectively combining the correlation and time diversity detections.

• Speech Sciences
• /
• v.10 no.1
• /
• pp.95-105
• /
• 2003

This paper describes a new parameter for voice activity detection which serves as a front-end part for automatic speech recognition systems. The new parameter called run-ratio is derived from the runs test statistic which is used in the statistical test for randomness of a given sequence. The run-ratio parameter has the property that the values of the parameter for the random sequence are about 1. To apply the run-ratio parameter into the voice activity detection method, it is assumed that the samples of an inputted audio signal should be converted to binary sequences of positive and negative values. Then, the silence region in the audio signal can be regarded as random sequences so that their values of the run-ratio would be about 1. The run-ratio for the voiced region has far lower values than 1 and for fricative sounds higher values than 1. Therefore, the parameter can discriminate speech signals from the background sounds by using the newly derived run-ratio parameter. The proposed voice activity detector outperformed the conventional energy-based detector in the sense of error mean and variance, small deviation from true speech boundaries, and low chance of missing real utterances

• Journal of Positioning, Navigation, and Timing
• /
• v.10 no.4
• /
• pp.307-313
• /
• 2021

Modernized GNSS signal structures tend to use tiered codes, and all GNSSs use binary codes as secondary codes. However, recently, signals using polyphase codes such as Zadoff-Chu sequence have been proposed, and are expected to be utilized in GNSS. For example, there is Tiered Differential Polyphase Code (TDPC) using polyphase code as secondary code. In TDPC, the phase of secondary code changes every one period of the primary code and a time-variant error is added to the carrier tracking error, so carrier tracking ambiguity exists until the secondary code phase is found. Since the carrier tracking ambiguity cannot be solved using the general GNSS receiver architecture, a new receiver architecture is required. Therefore, in this paper, we describe the carrier tracking ambiguity and its cause in signal tracking, and propose a receiver structure that can solve it. In order to prove the proposed receiver structure, we provide three signal tracking results. The first is the differential decoding result (secondary code sync) using the general GNSS receiver structure and the proposed receiver structure. The second is the IQ diagram before and after multiplying the secondary code demodulation when carrier tracking ambiguity is solved using the proposed receiver structure. The third is the carrier tracking result of the legacy GPS (L1 C/A) signal and the signal using TDPC.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.1
• /
• pp.35.2-35.2
• /
• 2021

Blue straggler stars (BSs) are "rejuvenated" main sequence stars first recognized by Allan Sandage from his observation of the prominent northern globular cluster M3 in the year of 1953. BSs are now known to be present in diverse stellar environments including open clusters, globular clusters, dwarf galaxies, and even the field populations of the Milky Way. This makes them a very useful tool in a wide range of astrophysical applications: Particularly BSs are considered to have a crucial role in the evolution of stellar clusters because they affect on the dynamics, the binary population, and the history of the stellar evolution of the cluster they belong to. Here we report a part of the preliminary results from our ongoing research on the BSs in the two metal-poor globular clusters (GCs) in the Large Magellanic Cloud (LMC), Hodge 11 and NGC1466. Using the high precision multi-band images obtained with the Advanced Camera for Survey (ACS) onboard the Hubble Space Telescope (HST), we extract time-series photometry to search for the signal of periodic variations in the luminosity of the BSs. Our preliminary results confirm that several BSs are intrinsic "short period (0.05 < P < 0.25 days)" variable stars with either pulsating or eclipsing types. We will discuss our investigation on the properties of those variable BS candidates in the context of the formation channels of these exotic main sequence stars, and their roles in the dynamical evolution of the host star clusters.

• Journal of Intelligence and Information Systems
• /
• v.21 no.2
• /
• pp.131-150
• /
• 2015

Omission of noun phrases for obligatory cases is a common phenomenon in sentences of Korean and Japanese, which is not observed in English. When an argument of a predicate can be filled with a noun phrase co-referential with the title, the argument is more easily omitted in Encyclopedia texts. The omitted noun phrase is called a zero anaphor or zero pronoun. Encyclopedias like Wikipedia are major source for information extraction by intelligent application systems such as information retrieval and question answering systems. However, omission of noun phrases makes the quality of information extraction poor. This paper deals with the problem of developing a system that can restore omitted noun phrases in encyclopedia documents. The problem that our system deals with is almost similar to zero anaphora resolution which is one of the important problems in natural language processing. A noun phrase existing in the text that can be used for restoration is called an antecedent. An antecedent must be co-referential with the zero anaphor. While the candidates for the antecedent are only noun phrases in the same text in case of zero anaphora resolution, the title is also a candidate in our problem. In our system, the first stage is in charge of detecting the zero anaphor. In the second stage, antecedent search is carried out by considering the candidates. If antecedent search fails, an attempt made, in the third stage, to use the title as the antecedent. The main characteristic of our system is to make use of a structural SVM for finding the antecedent. The noun phrases in the text that appear before the position of zero anaphor comprise the search space. The main technique used in the methods proposed in previous research works is to perform binary classification for all the noun phrases in the search space. The noun phrase classified to be an antecedent with highest confidence is selected as the antecedent. However, we propose in this paper that antecedent search is viewed as the problem of assigning the antecedent indicator labels to a sequence of noun phrases. In other words, sequence labeling is employed in antecedent search in the text. We are the first to suggest this idea. To perform sequence labeling, we suggest to use a structural SVM which receives a sequence of noun phrases as input and returns the sequence of labels as output. An output label takes one of two values: one indicating that the corresponding noun phrase is the antecedent and the other indicating that it is not. The structural SVM we used is based on the modified Pegasos algorithm which exploits a subgradient descent methodology used for optimization problems. To train and test our system we selected a set of Wikipedia texts and constructed the annotated corpus in which gold-standard answers are provided such as zero anaphors and their possible antecedents. Training examples are prepared using the annotated corpus and used to train the SVMs and test the system. For zero anaphor detection, sentences are parsed by a syntactic analyzer and subject or object cases omitted are identified. Thus performance of our system is dependent on that of the syntactic analyzer, which is a limitation of our system. When an antecedent is not found in the text, our system tries to use the title to restore the zero anaphor. This is based on binary classification using the regular SVM. The experiment showed that our system's performance is F1 = 68.58%. This means that state-of-the-art system can be developed with our technique. It is expected that future work that enables the system to utilize semantic information can lead to a significant performance improvement.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2087-2089
• /
• 2003

The presence of narrowband interference (NBI) in Direct-sequence code division multiple access (DS/CDMA) systems is an inevitable problem when the interference is strong enough. The improvement in the system performance employs by adaptive narrowband interference suppression techniques. Basically there have been two types of method for narrowband interference suppression estimator/subtracter approaches and transform domain approaches. In this paper the focus is on the type of estimator/subtracter approaches. However, the binary direct sequence (DS) signal, that acts as noise in the prediction process is highly non-Gaussian. The case of a Gaussian interferer with known in an autoregressive (AR) signal or a digital signal and also in a sinusoidal signal (Tone) that included in is paper. The proposed NBI suppression is presence in an adaptive IIR notch filter for lattice structure and more powerful by using a variable step-size algorithm. The simulation results show that the proposed algorithm can significantly increase the convergence rate and improved system performance when compare with adaptive least mean square algorithm (LMS).

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.218-226
• /
• 2016

Coordination among users is an inevitable but time-consuming operation in wireless networks. It severely limit the system performance when the data rate is high. We present FC-MAC, a novel MAC protocol that can complete a contention within one contention slot over a joint frequency-code domain. When a node takes part in the contention, it generates randomly a contention vector (CV), which is a binary sequence of length equal to the number of available orthogonal frequency division multiplexing (OFDM) subcarriers. In FC-MAC, different user is assigned with a distinct signature (i.e., PN sequence). A node sends the signature at specific subcarriers and uses the sequence of the ON/OFF states of all subcarriers to indicate the chosen CV. Meanwhile, every node uses the redundant antennas to detect the CVs of other nodes. The node with the minimum CV becomes the winner. The experimental results show that, the collision probability of FC-MAC is as low as 0.05% when the network has 100 nodes. In comparison with IEEE 802.11, contention time is reduced by 50-80% and the throughput gain is up to 200%.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.123-130
• /
• 2022

Recently, studies on the detection and classification of Android malware based on API Call sequence have been actively carried out. However, API Call sequence based malware classification has serious limitations such as excessive time and resource consumption in terms of malware analysis and learning model construction due to the vast amount of data and high-dimensional characteristic of features. In this study, we analyzed various classification models such as LightGBM, Random Forest, and k-Nearest Neighbors after significantly reducing the dimension of features using PCA(Principal Component Analysis) for CICAndMal2020 dataset containing vast API Call information. The experimental result shows that PCA significantly reduces the dimension of features while maintaining the characteristics of the original data and achieves efficient malware classification performance. Both binary classification and multi-class classification achieve higher levels of accuracy than previous studies, even if the data characteristics were reduced to less than 1% of the total size.