• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.10-18
• /
• 2004

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The operations of unaligned linear quadtrees, which are operations among the linear quadtrees with different origin, are able to perform the translated or rotated images efficiently. And this operations requires alignment of the linear quadtrees. In this paper, we present an efficient algorithm to perform alignment of unaligned linear quadtrees, using three-dimensional $n{\pm}n{\pm}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\pm}n{\pm}n$ RMESH.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.2
• /
• pp.87-94
• /
• 2017

Microsoft Office is an office suite of applications developed by Microsoft. Recently users with malicious intent customize Office files as a container of the Malware because MS Office is most commonly used word processing program. To attack target system, many of malicious office files using a variety of skills and techniques like macro function, hiding shell code inside unused area, etc. And, people usually use two techniques to detect these kinds of malware. These are Signature-based detection and Sandbox. However, there is some limits to what it can afford because of the increasing complexity of malwares. Therefore, this paper propose methods to detect malicious MS office files in Computer forensics' way. We checked Macros and potential problem area with structural analysis of the MS Office file for this purpose.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.646-652
• /
• 2013

EU's Galileo project is a market-based GNSS (Global Navigation Satellite System) that is under development. It is expected that Galileo will provide the positioning services based on new technologies in 2020s. Because Galileo E1 signal for OS (Open Service) shares the same center frequency with GPS L1 C/A signal, CBOC (Composite Binary Offset Carrier) modulation scheme is used in the E1 signal to guarantee interoperability between two systems. With E1 signal consisting of a data channel and a pilot channel at the same frequency band, there exist several options in designing signal acquisition for Assisted-Galileo receivers. Furthermore, compared to SNR worksheet of Assisted-GPS, some factors should be examined in Assisted-Galileo due to different correlation profile and code length of E1 signal. This paper presents SNR worksheets of Galileo E1 signals in E1-B and E1-C channel. Three implementation losses that are quite different from GPS are mainly analyzed in establishing SNR worksheets. In the worksheet, hybrid long integration of 1.5s is considered to acquire weak signal less than -150dBm. Simulation results show that the final SNR of E1-B signal with -150dBm is 19.4dB and that of E1-C signal is 25.2dB. Comparison of relative computation shows that E1-B channel is more profitable to acquire the strongest signal in weak signal environment. With information from the first satellite signal acquisition, fast acquisition of the weak signal around -155dBm can be performed with E1-C signal in the subsequent satellites.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.341-350
• /
• 2002

As network environments have been improved and the use of internet has been increased, mobile agent technologies are widely used in the fields of information retrieval, network management, electronic commerce, and parallel/distributed processing. Recently, a lot of researchers have studied the concepts of parallel/distributed processing based on mobile agents. SPMD is the parallel processing method which transmits a program to all the computers participated in parallel environment, and performs a work with different data. Therefore, to transmit fast a program to all the computers is one of important factors to reduce total execution time. In this paper, we consider the parallel environment consisting of mobile agents system, and propose a new method which transmits fast a mobile agent code to all the computers using binomial trees in order to efficiently perform the SPMD parallel processing. The proposed method is compared with another ones through experimental evaluation on the IBM's Aglets, and gets greatly better performance. Also this paper deals with fault tolerances which can be occurred in transmitting a mobile agent using binomial trees.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.2
• /
• pp.65.2-65.2
• /
• 2010

We present four new transits of the planetary system TrES-3 observed between 2009 May and 2010 June. Among those, the third transit by itself indicates possible evidence for brightness disturbance, which could originate from a starspot or an overlapping double transit. A total of 107 transit times, including our measurements, were used to determine the improved ephemeris with a transit epoch of $2454185.910950\pm0.000073$ HJED (Heliocentric Julian Ephemeris Date) and an orbital period of $1.30618698\pm0.00000016$ d. We analyzed the transit light curves using the JKTEBOP code and adopting the quadratic limb-darkening law. In order to derive the physical properties of the TrES-3 system, the transit parameters are combined with the empirical relations from eclipsing binary stars and stellar evolutionary models, respectively. The stellar mass and radius obtained from a calibration using $T_{eff}$, log $\rho$ and [Fe/H] are in good agreement with those from the isochrone analysis within the uncertainties. We found that the exoplanet TrES-3b has a mass of $1.93\pm0.07\;M_{Jup}$, a radius of $1.30\pm0.04\;R_{Jup}$, a surface gravity of $28.2\pm1.1\;m\;s^{-1}$, a density of $0.82\pm0.06\;\rho_{Jup}$, and an equilibrium temperature of $1641\pm23K$.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.11
• /
• pp.1-10
• /
• 1998

The advent of deep submicron technologies in the age of portable electronic systems creates a moving target for CAB algorithms, which now need to reduce power as well as delay and area in the existing design methodology. This paper presents a resynthesis algorithm for logic decomposition on mapped circuits. The existing algorithm uses a Huffman encoding, but does not consider glitches and effects on logic depth. The proposed algorithm is to generalize the Huffman encoding algorithm to minimize the switching activity of non-critical subcircuits and to preserve a given logic depth. We show how to obtain a transition-optimum binary tree decomposition for AND tree with zero gate delay. The algorithm is tested using SIS (logic synthesizer) and Level-Map (LUT-based FPGA lower power technology mapper) and shows 58%, 8% reductions on power consumptions, respectively.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.10
• /
• pp.721-727
• /
• 2001

In this paper, we propose a two-dimensional interleaving structure of holographic digital data storage. In this storage, many of the digital binary data are recorded, retrieved and processed in a two-dimensional data image (1000$\times$1000 bits). Therefore, burst errors in this digital device also have two-dimensional characteristics and it is required to use effective two-dimensional interleaving to overcome them. Bits of every code word should be distributed in an equilateral triangular lattice structure when they are scattered considering the random shape and occurrence of burst errors. We deal with factors and algorithm to construct this interleaving structure of equilateral triangular lattice.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1067-1072
• /
• 2016

Software birthmarks, which are unique characteristics of the software, are used to detect software plagiarism or software similarity. Generally, software birthmarks are divided into static birthmarks or dynamic birthmarks, which have evident pros and cons depending on the extraction method. In this paper, we propose a method for extracting the API sequence birthmarks using a dynamic analysis and similarity detection between the executable codes. Dynamic birthmarks based on API sequences extract API functions during the execution of programs. The extracted API sequences often include all the API functions called from the start to the end of the program. Meanwhile, our dynamic birthmark scheme extracts the API functions only called directly from the executable code. Then, it uses a sequence alignment algorithm to calculate the similarity metric effectively. We evaluate the birthmark with several open source software programs to verify its reliability and credibility. Our dynamic birthmark scheme based on the extracted API sequence can be utilized in a similarity test of executable codes.

• The Journal of the Korea Contents Association
• /
• v.6 no.1
• /
• pp.8-13
• /
• 2006

In this thesis, an automatic door lock system using a dual tone multiple frequency(DTMF) signal generated as pushing the key button of mobile phone is proposed and implemented. This system consists of a transmitter module and a receiver module for processing the DTMF signal of mobile phone. The DTMF signal of mobile phone connected with ear-phone jack enter into the input terminal of DTMF receiver and those are encoded by a code-converter with 4-bits binary format in the DTMF receiver. The encoded output signals are transmitted to the amplitude shift keying(ASK) modulator of transmitter module and the modulated ASK signals which are converted into radio frequency(RF) signals propagate in a free space. The RF signals passed through a free space are demodulated by the ASK demodulator of receiver module and the demodulated ASK signals are sent to a micro-controller unit(MCU). The output signals processed by the MCU are compared with the secreted identification number which is prerecorded in a microprocessor and are transferred to a power relay. If the result is the same, the automatic door lock system opens a door. In the opposite case, it maintains closing the door. The implemented automatic door lock system operates well in mobile environments.

• Journal of Broadcast Engineering
• /
• v.13 no.5
• /
• pp.612-621
• /
• 2008

Due to the various constraints such as feasible size of data payload and low transmission power, no technical specifications on the voice communication are included in the Zigbee standard. In this paper, a voice coding technique for application to the IEEE 802.15.4 standard, which is the basis of Zigbee communication, is presented. Here, both high compression and good waveform recovery are essential. To meet those requirements, a multi-stage discrete wavelet transform (DWT) block and a binary coding block consisting of two different pulse-code modulations are exploited. Theoretical analysis and simulation results in an indoor wireless channel show that the voice coder with 2-stage DWT is most appropriate from the viewpoint of compression and waveform recovery. When the line-of-sight component is dominant, the voice coding scheme has good recovery capability even in the moderate signal-to-noise power ratios. Hence, it is considered that the presented scheme will be a technical reference for the future recommendation of voice communication exploiting Zigbee.