• Journal of Astronomy and Space Sciences
• /
• v.26 no.2
• /
• pp.141-156
• /
• 2009

Through the photometric observations of the near-contact binary, XZ CMi, new BV light curves were secured and seven times of minimum light were determined. An intensive period study with all published timings, including ours, confirms that the period of XZ CMi has varied in a cyclic period variation superposed on a secular period decrease over last 70 years. Assuming the cyclic change of period to occur by a light-time effect due to a third-body, the light-time orbit with a semi-amplitude of 0.0056d, a period of 29y and an eccentricity of 0.71 was calculated. The observed secular period decrease of $-5.26{\times}10^{-11}d/P$ was interpreted as a result of simultaneous occurrence of both a period decrease of $-8.20{\times}10^{-11}d/P$ by angular momentum loss (AML) due to a magnetic braking stellar wind and a period increase of $2.94{\times}10^{-11}d/P$ by a mass transfer from the less massive secondary to the primary components in the system. In this line the decreasing rate of period due to AML is about 3 times larger than the increasing one by a mass transfer in their absolute values. The latter implies a mass transfer of $\dot{M}_s=3.21{\times}10^{-8}M_{\odot}y^{-1}$ from the less massive secondary to the primary. The BV light curves with the latest Wilson-Devinney binary code were analyzed for two separate models of 8200K and 7000K as the photospheric temperature of the primary component. Both models confirm that XZ CMi is truly a near-contact binary with a less massive secondary completely filling Roche lobe and a primary inside the inner Roche lobe and there is a third-light corresponding to about 15-17% of the total system light. However, the third-light source can not be the same as the third-body suggested from the period study. At the present, however, we can not determine which one between two models is better fitted to the observations because of a negligible difference of $\sum(O-C)^2$ between them. The diversity of mass ratios, with which previous investigators were in disagreement, still remains to be one of unsolved problems in XZ CMi system. Spectroscopic observations for a radial velocity curve and high-resolution spectra as well as a high-precision photometry are needed to resolve some of remaining problems.

• Journal of Internet Computing and Services
• /
• v.21 no.2
• /
• pp.1-8
• /
• 2020

Recently, the number of APT(Advanced Persistent Threats) attack using malware has been increasing, and research is underway to prevent and detect them. While it is important to detect and block attacks before they occur, it is also important to make an effective response through an accurate analysis for attack case and attack type, these respond which can be determined by analyzing the attack group of such attacks. Therefore, this paper propose a framework based on genetic algorithm for analyzing malware and understanding attacker group's features. The framework uses decompiler and disassembler to extract related code in collected malware, and analyzes information related to author through code analysis. Malware has unique characteristics that only it has, which can be said to be features that can identify the author or attacker groups of that malware. So, we select specific features only having attack group among the various features extracted from binary and source code through the authorship clustering method, and apply genetic algorithm to accurate clustering to infer specific features. Also, we find features which based on characteristics each group of malware authors has that can express each group, and create profiles to verify that the group of authors is correctly clustered. In this paper, we do experiment about author classification using genetic algorithm and finding specific features to express author characteristic. In experiment result, we identified an author classification accuracy of 86% and selected features to be used for authorship analysis among the information extracted through genetic algorithm.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.8
• /
• pp.317-326
• /
• 2013

In this paper, we present an effective method for comparing control flow graphs which represent static structures of binary programs. To compare control flow graphs, we measure similarities by comparing instructions and syntactic information contained in basic blocks. In addition, we also consider similarities of edges, which represent control flows between basic blocks, by edge extension. Based on the comparison results of basic blocks and edges, we match most similar basic blocks in two control flow graphs, and then calculate the similarity between control flow graphs. We evaluate the proposed edge extension method in real world Java programs with respect to structural similarities of their control flow graphs. To compare the performance of the proposed method, we also performed experiments with a previous structural comparison for control flow graphs. From the experimental results, the proposed method is evaluated to have enough distinction ability between control flow graphs which have different structural characteristics. Although the method takes more time than previous method, it is evaluated to be more resilient than previous method in comparing control flow graphs which have similar structural characteristics. Control flow graph can be effectively used in program analysis and understanding, and the proposed method is expected to be applied to various areas, such as code optimization, detection of similar code, and detection of code plagiarism.

• The KIPS Transactions:PartB
• /
• v.15B no.4
• /
• pp.275-284
• /
• 2008

With increases in recent security requirements, biometric technology such as fingerprints, faces and iris recognitions have been widely used in many applications including door access control, personal authentication for computers, internet banking, automatic teller machines and border-crossing controls. Finger vein recognition uses the unique patterns of finger veins in order to identify individuals at a high level of accuracy. This paper proposes new device and methods for touchless finger vein recognition. This research presents the following five advantages compared to previous works. First, by using a minimal guiding structure for the finger tip, side and the back of finger, we were able to obtain touchless finger vein images without causing much inconvenience to user. Second, by using a hot mirror, which was slanted at the angle of 45 degrees in front of the camera, we were able to reduce the depth of the capturing device. Consequently, it would be possible to use the device in many applications having size limitations such as mobile phones. Third, we used the holistic texture information of the finger veins based on a LBP (Local Binary Pattern) without needing to extract accurate finger vein regions. By using this method, we were able to reduce the effect of non-uniform illumination including shaded and highly saturated areas. Fourth, we enhanced recognition performance by excluding non-finger vein regions. Fifth, when matching the extracted finger vein code with the enrolled one, by using the bit-shift in both the horizontal and vertical directions, we could reduce the authentic variations caused by the translation and rotation of finger. Experimental results showed that the EER (Equal Error Rate) was 0.07423% and the total processing time was 91.4ms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.73-86
• /
• 2009

This paper proposes a new data hiding scheme for binary image authentication with minimizing the distortion of host image. Based on the Hamming-Code-Based data embedding algorithm, the proposed scheme makes it possible to embed authentication information into host image with only flipping small number of pixels. To minimize visual distortion, the proposed scheme only modifies the values of the flippable pixels that are selected based on Yang et al's flippablity criteria. In addition to this, by randomly shuffling the bit-order of the authentication information to be embedded, only the designated receiver, who has the secret key that was used for data embedding, can extract the embedded data. To show the superiority of the proposed scheme, the two measurement metrics, the miss detection rate and the number of flipped pixels by data embedding, are used for the comparison analysis between the proposed scheme and the previous schemes. As a result of analysis, it has been shown that the proposed scheme flips smaller number of pixels than the previous schemes to embed the authentication information of the same bit-length. Moreover, it has been shown that the proposed scheme causes smaller visual distortion and more resilient against recent steg-analysis attacks than the previous schemes by the experimental results.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.6B
• /
• pp.697-707
• /
• 2008

The grid-based KIneMatic wave STOrm Runoff Model (KIMSTORM) by Kim (1998) predicts the temporal variation and spatial distribution of overland flow, subsurface flow and stream flow in a watershed. The model programmed with C++ language on Unix operating system adopts single flowpath algorithm for water balance simulation of flow at each grid element. In this study, we attempted to improve the model by converting the code into FORTRAN 90 on MS Windows operating system and named as ModKIMSTORM. The improved functions are the addition of GAML (Green-Ampt & Mein-Larson) infiltration model, control of paddy runoff rate by flow depth and Manning's roughness coefficient, addition of baseflow layer, treatment of both spatial and point rainfall data, development of the pre- and post-processor, and development of automatic model evaluation function using five evaluation criteria (Pearson's coefficient of determination, Nash and Sutcliffe model efficiency, the deviation of runoff volume, relative error of the peak runoff rate, and absolute error of the time to peak runoff). The modified model adopts Shell Sort algorithm to enhance the computational performance. Input data formats are accepted as raster and MS Excel, and model outputs viz. soil moisture, discharge, flow depth and velocity are generated as BSQ, ASCII grid, binary grid and raster formats.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.111-123
• /
• 2013

To verify software vulnerability, the method of conjecturing software structure and then testing the software based on the conjectured structure has been highlighted. To utilize the method, an efficient way to conjecture software structure is required. The popular graph and tree methods such as DFG(Data Flow Graph), CFG(Control Flow Graph) and CFA(Control Flow Automata) have a serious drawback. That is, they cannot express software in a hierarchical fashion. In this paper, we propose a method to overcome the drawback. The proposed method applies various input data to a binary code, generate CFG's based on the code output and construct a HCFG (Hierarchical Control Flow Graph) to express the generated CFG's in a hierarchical structure. The components required for HCFG and progressive algorithm to construct HCFG are also proposed. The proposed method is verified through constructing the software architecture of an open SMTP(Simple Mail Transfer Protocol) server program. The structure generated by the proposed method and the real program structure are compared and analyzed.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.7
• /
• pp.61-69
• /
• 2010

In this paper, an 1.2V 8b 800MSPS A/D Converter(ADC) with an odd number of folding block to overcome the asymmetrical boundary-condition error is described. The architecture of the proposed ADC is based on a cascaded folding architecture using resistive interpolation technique for low power consumption and high input frequency. The ADC employs a novel odd folding block to improve the distortion of signal linearity and to reduce the offset errors. In the digital block, furthermore, we use a ROM encoder to convert a none-$2^n$-period code into the binary code. The chip has been fabricated with an $0.13{\mu}m$ 1P6M CMOS technology. The effective chip area is $870{\mu}m\times980{\mu}m$. SNDR is 44.84dB (ENOB 7.15bit) and SFDR is 52.17dBc, when the input frequency is 10MHz at sampling frequency of 800MHz.

• Journal of KIISE:Software and Applications
• /
• v.27 no.2
• /
• pp.180-192
• /
• 2000

Recently, the component technology has played a main role in software reuse. It has changed the code-based reuse into the binary code-based reuse, because components can be easily combined into the developing software only through component interfaces. Since components and component users have increased rapidly, it is necessary that the users of components search for the most proper components for HTML among the enormous number of components on the Internet. It is desirable to use web-document-typed specifications for component specifications on the Internet. This paper proposes to use XML component specifications instead of HTML specifications, because it is impossible to represent the semantics of contexts using HTML. We also propose the XML context-search method based on XML component specifications. Component users use the contexts for the component properties and the terms for the values of component properties in their queries for searching components. The index structure for the context-based search method is the inverted file indexing structure of term-context-component specification. Not only an XML context-based search method but also a variety of search methods based on context-based search, such as keyword, search, faceted search, and browsing search method, are provided for the convenience of users. We use the 3-layer architecture, with an interface layer, a query expansion layer, and an XML search engine layer, of the search engine for the efficient index scheme. In this paper, an XML DTD(Document Type Definition) for component specification is defined and the experimental results of comparing search performance of XML with HTML are discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 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).