• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.70-75
• /
• 2014

Super-resolution near-field structure (super-RENS) read-out samples are affected by a nonlinear and noncausal channel, which results in inter-symbol interference (ISI). In this study, we investigate asymmetry or domain bloom in super-RENS in terms of equalization. Domain bloom is caused by writing process in optical recording. We assume in this work that the asymmetry symbol conversion scheme is to generate asymmetric symbols, and then a linear finite impulse response filter can model the read-out channel. For equalizing this overall nonlinear channel, the read-out signals are deconvolved with the finite impulse response filter and its output is decided based on the decision rule table that is developed from the asymmetry symbol conversion scheme. The proposed equalizer is investigated with the simulations and the real super-RENS samples in terms of raw bit error rate.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.4
• /
• pp.919-928
• /
• 2018

Out-Of-Bounds (OOB) is one of the most powerful vulnerabilities in heap memory. The OOB vulnerability allows an attacker to exploit unauthorized access to confidential information by tricking the length of the array and reading or writing memory of that length. In this paper, we propose a method to automatically detect OOB vulnerabilities in heap memory using dynamic symbol execution and shadow memory table. First, a shadow memory table is constructed by hooking heap memory allocation and release function. Then, when a memory access occurs, it is judged whether OOB can occur by referencing the shadow memory, and a test case for causing a crash is automatically generated if there is a possibility of occurrence. Using the proposed method, if a weak block search is successful, it is possible to generate a test case that induces an OOB. In addition, unlike traditional dynamic symbol execution, exploitation of vulnerabilities is possible without setting clear target points.

• Journal of Korean Philosophical Society
• /
• v.139
• /
• pp.1-21
• /
• 2016

To quickly and accurately grasp the consistency and the true/false of sentence description, we may require the help of a computer. It is thus necessary to research and quickly and accurately grasp the consistency and the true/false of sentence description by computer processing techniques. This requires research and planning for the whole study, namely a plan for the necessary tables and those of processing, and development of the table of the five logic rules. In future research, it will be necessary to create and develop the table of ten basic inference rules and the eleven kinds of derived inference rules, and it will be necessary to build a DB of those tables and the computer processing of sentence logic using server programming JSP and client programming JAVA over its foundation. In this paper we present the overall research plan in referring to the logic operation table, dividing the logic and inference rules, and preparing the listed process sequentially by dividing the combination of their use. These jobs are shown as a variable table and a symbol table, and in subsequent studies, will input a processing table and will perform the utilization of server programming JSP, client programming JAVA in the construction of subject/predicate part activated DB, and will prove the true/false of a sentence. In considering the table prepared in chapter 2 as a guide, chapter 3 shows the creation and development of the table of the five logic rules, i.e, The Rule of Double Negation, De Morgan's Rule, The Commutative Rule, The Associative Rule, and The Distributive Rule. These five logic rules are used in Propositional Calculus, Sentential Logic Calculus, and Statement Logic Calculus for sentence logic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1956-1969
• /
• 1993

The tilted Huffman trees are used in JPEG and MPEG image compression standards for Huffman coding. In this paper we propose a new decoding technique for Huffman code, symbols are decoded by repeatedly obtaining the predefined number of consecutive bits and accessing symbol tables based on the obtaining bits. We show that the size of the symbol table can be small if the Huffman tree is tilted. Specifically, we show an upper bound on the size in this paper. Since the proposed method processes multiple bits at each clock, it can be used for real time processing. We show such evaluation results.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.2
• /
• pp.77-84
• /
• 2000

In this paper, we discuss a symbol clock extraction scheme based on maximizing the band-edge component of the transmitted signal frequency spectrum for applications to 51.84Mbps VDSL system which uses a 16-QAM. The major characteristics of the digital PLL are examined. In addition, we suggest an efficient design method of a sinusoidal look-up table which is used for NCO.

• School Mathematics
• /
• v.15 no.2
• /
• pp.289-314
• /
• 2013

Achievement profile by attribute in Korean students' mathematics was analyzed by applying cognitive diagnostic model, which is the newest measurement theory, to 2011 NAEA(National Assessment of Educational Assessment) results. The results are as follows. As the level of school is higher from 6th grade, 9th grade to 11th grade, the percentage of students mastering cognitive attribute 9(expressions using picture, table, graph, formula, symbol, writing, etc) drastically declined from 78%, 35% to 26%. It is necessary to have learning strategies to reinforce their abilities of expressing table, graph, etc. that higher graders in mathematics are more vulnerable to. Next, the property of mastering cognitive attributes according to gender, multi-cultural family was analyzed. In terms of mathematics, the percentage of girls mastering most of the attribute generally is higher than that of boys from 6th grade to 9th grade, however, boys show higher mastery in almost attributes than girls in the 11th grade. Compared to boys, the part where girls have the most trouble is attribute 9 in mathematics(expressions using picture, table, graph, formula, symbol, writing, etc). As international marriage, influx of foreign workers, etc. increase, the number of students from Korea's multi-cultural families is expected to be higher, therefore, identifying the characteristics of their educational achievement is significant in reinforcing Korea's basic achievement. In mathematics, gap of mastery level of attributes between multi-cultural group and ordinary group is more severe in higher grade and the type of multi-cultural group that needs supports for improving achievement most urgently changed in 6th grade, 9th grade and 11th grade respectively. In the 6th and 11th grade, migrant students from North Korea show the lowest level of mastering attributes, however, in the 9th grade, the mastery rate of immigrant students is lowest. Therefore, there is an implication that supporting plans for improving achievement of students from multi-cultural family should establish other strategies based on the characteristics of school level.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.4
• /
• pp.1411-1417
• /
• 2014

An MPEG-2 AAC Huffman decoding method based on the fixed length compacted codeword tables, where each codeword can contain multiple number of Huffman codes, was proposed. The proposed method enhances the searching efficiency by finding multiple symbols in a single search, i.e., a direct memory reading of the compacted codeword table. The memory usage is significantly saved by separately handling the Huffman codes that exceed the length of the compacted codewords. The trade-off relation between the computational complexity and the amount of memory usage was analytically derived to find the proper codeword length of the compacted codewords for the design of MPEG-2 AAC decoder. To validate the proposed algorithm, its performance was experimentally evaluated with an implemented MPEG-2 AAC decoder. The results showed that the computational complexity of the proposed method is reduced to 54% of that of the most up-to-date method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1299-1310
• /
• 1992

Recently, digital realizations of timing recovery circuits for digital data transmission are of growing interest. As a result of digital realization of timing recovery circuits, new digital algorithms for timing error detection are required. In this paper, we present a new digital Angular Form(AF) algorithm which can be directly applied to QPSK modulation technique. AF algorithm is basically developed on the concepts of detected angle form and transition logic table. We evaluated the performance of this algorithm by Monte-Carlo simulation method under Gaussian and Impulsive noise environments. From the performance evaluation result, we show that the performance of AF Algorithm is better than that of Gardner in BER, RMS jitter, S-curve.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.281-284
• /
• 2002

Error resilience for image coding is an important component of multimedia communication system. Error resilience schemes address loss recovery from the compression perspective. Multiple description coding (MDC) is one of the error resilience techniques promising for robust video transmission. It is the way to achieve tradeoff description such as scalar quantization, correlating transform and the quantized frame expansion. In this paper, we consider Multiple Description Scalar Quantization (MDSQ) to wavelet domain. Conventional MDSQ schemes considered description with equal weights in each sub-bands. But, we can see that the each sub-bands is unequal contribution to whole image quality. Therefore, we experiment the multiple design MDSQ table to make probability of zero index high, which gives high efficiency in arithmetic symbol coder. We also compare our proposed method with the conventional methods and show improved performance in terms of redundancy-rate-distortion.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.12 no.1
• /
• pp.139-139
• /
• 1987

This study addresses basic requirements for mathematical programming software, discusses considerations in designing these software, implementation issues facing in these types of applications development, and shows some examples of codes being developed in the course. This type of projects requires long and ever-changing evolutionary phases. The experience is therefore, valuaable in suggesting some useful hints which may be salvaged for similar projects as well as providing reusable codes. In particular, scanning and parsing the free-format inputs, symbol table management, mixed-language programming, and data structures dealing with large sparse matrices are indispensable to many management science software development. Extensions to be made are also discussed.