• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.121-128
• /
• 2005

Tho existing TCP(Transmission Control Protocol) is known to be unsuitable for a network with the characteristics of high RDP(Bandwidth-Delay Product) because of the fixed small or large buffer size at the TCP sender and receiver. Thus, some trial cases of adjusting the buffer sizes automatically with respect to network condition have been proposed to improve the end-to-end TCP throughput. ATBT(Automatic TCP fluffer Tuning) attempts to assure the buffer size of TCP sender according to its current congestion window size but the ATBT assumes that the buffer size of TCP receiver is maximum value that operating system defines. In DRS(Dynamic Right Sizing), by estimating the TCP arrival data of two times the amount TCP data received previously, the TCP receiver simply reserves the buffer size for the next arrival, accordingly. However, we do not need to reserve exactly two times of buffer size because of the possibility of TCP segment loss. We propose an efficient TCP buffer tuning technique(called TBT-PLR: TCP buffer tuning algorithm based on packet loss ratio) since we adopt the ATBT mechanism and the TBT-PLR mechanism for the TCP sender and the TCP receiver, respectively. For the purpose of testing the actual TCP performance, we implemented our TBT-PLR by modifying the linux kernel version 2.4.18 and evaluated the TCP performance by comparing TBT-PLR with the TCP schemes of the fixed buffer size. As a result, more balanced usage among TCP connections was obtained.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.7
• /
• pp.61-68
• /
• 2008

In this paper, we propose an efficient hardware architecture and algorithm to increase an encoding process rate and implement a hardware for CABAC (Context Adaptive Binary Arithmetic Coding) which is used with one of the entropy coding ways for the latest video compression technique, H.264/AVC (Advanced Video Coding). CABAC typically provides a better high compression performance maximum 15% compared with CAVLC. However, the complexity of operation of CABAC is significantly higher than the CAVLC. Because of complicated data dependency during the encoding process, the complexity of operation is higher. Therefore, various architectures were proposed to reduce an amount of operation. However, they have still latency on account of complicated data dependency. The proposed architecture has two techniques to implement efficient pipeline architecture. The one is quick calculation of 7, 8th bits used to calculate a probability is the first step in Binary arithmetic coding. The other is one step reduced pipeline arcbitecture when the type of the encoded symbols is MPS. By adopting these two techniques, the required processing time was reduced about 27-29% compared with previous architectures. It is designed in a hardware description language and total logic gate count is 19K using 0.18um standard cell library.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.12 s.103
• /
• pp.1229-1238
• /
• 2005

OFDM(Orthogonal Frequency Division Multiplexing) communications system is very attractive for the high data rate wireless transmission. However, it may be distorted in the nonlinear HPA(High Power Amplifier) since OFDM signal has hish PAPR(Peak-to-Average Power Ratio). In this paper, a new method using control tone is studied for reducing the PAPR and we call it PCT(PAPR Control Tone) method. This proposed PCT method is to assign control tones for PAPR reduction at the predefined sub-carriers. After IFFT(Inverse Fast Fourier Transform) and PAPR calculation, the OFDM data signal of the lowest PAPR is selected to transmit. Unlike the conventional method, it can cut down the computational complexity because it does not require the transmission and demodulation process of side information about the phase rotation. Furthermore, if this method is made up in parallel configuration, it can solve the time delay problem so that it can be processed in real time processing. This proposed method is compared with the conventional selected mapping(SLM) technique. We find out the PAPR reduction performance and BER when the number of control tone is 6 and nonlinear HPA is considered.

• The Journal of Society for e-Business Studies
• /
• v.25 no.1
• /
• pp.13-33
• /
• 2020

This study proposes a Korean sentimental analysis algorithm that utilizes a letter-unit embedding and convolutional neural networks. Sentimental analysis is a natural language processing technique for subjective data analysis, such as a person's attitude, opinion, and propensity, as shown in the text. Recently, Korean sentimental analysis research has been steadily increased. However, it has failed to use a general-purpose sentimental dictionary and has built-up and used its own sentimental dictionary in each field. The problem with this phenomenon is that it does not conform to the characteristics of Korean. In this study, we have developed a model for analyzing emotions by producing syllable vectors based on the onset, peak, and coda, excluding morphology analysis during the emotional analysis procedure. As a result, we were able to minimize the problem of word learning and the problem of unregistered words, and the accuracy of the model was 88%. The model is less influenced by the unstructured nature of the input data and allows for polarized classification according to the context of the text. We hope that through this developed model will be easier for non-experts who wish to perform Korean sentimental analysis.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.4
• /
• pp.41-49
• /
• 2010

This paper proposes a new high speed SHA-1 architecture using multiple unfolding and pre-computation techniques. We unfolds iterative hash operations to 2 continuos hash stage and reschedules computation timing. Then, the part of critical path is computed at the previous hash operation round and the rest is performed in the present round. These techniques reduce 3 additions to 2 additions on the critical path. It makes the maximum clock frequency of 118 MHz which provides throughput rate of 5.9 Gbps. The proposed architecture shows 26% higher throughput with a 32% smaller hardware size compared to other counterparts. This paper also introduces a analytical model of multiple SHA-1 architecture at the system level that maps a large input data on SHA-1 block in parallel. The model gives us the required number of SHA-1 blocks for a large multimedia data processing that it helps to make decision hardware configuration. The hs fospeed SHA-1 is useful to generate a condensed message and may strengthen the security of mobile communication and internet service.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2017.06a
• /
• pp.45-45
• /
• 2017

The Indian meal moth, Plodia interpunctella, is one of the most important pests of stored food in the food processing industry worldwide. To control the Indian meal moth, methyl bromide, phosphine, high carbon dioxide, sulfuryl fluoride and plant essential oil fumigation have been considered. However, these treatments have disadvantages. For example, depleting the ozone layer, showing resistance in insect, low control efficacy or need high cost for treatment. Chlorine dioxide ($ClO_2$) is strong disinfectant and insecticide. The gas caused a malfunction in enzymes. The oxidative stress induced by $ClO_2$ gas treatment damaged to a physiological system and all life stages of P. interpunctella. The gaseous $ClO_2$ is a convincing alternative to methyl bromide for controlling P. interpunctella. The gaseous $ClO_2$ was generated by a chlorine dioxide generator (PurgoFarm Co., Ltd., Hwasung, Korea). It generated highly pure $ClO_2$ gas and the gas blown out through a vent into a test chamber. Gas entry to the chamber was automatically controlled and monitored by a PortaSene II gas leak detector (Analytical Technology, Collegeville, PA, USA). The properly prepared eggs, larvae, pupae, and adults of P. interpunctella were used in this experiment. Data were analyzed using SAS 9.4. Percentage data were statistically analyzed after arcsine-root transformation. Analysis of variance was performed using general linear model, and means were separated by the least significant difference test at P < 0.05. Fumigation is an effective management technique for controlling all stages of P. interpunctella. We found that $ClO_2$ gas treatment directly effects on egg, larvae, pupae and adults of P. interpunctella. The gas treatment with proper concentration for over a day achieved 100 % mortality in all stages of P. interpunctella and short time treatment or low concentration gas treatment results showed that the egg hatchability, pupation rate, and adult emergency rate were lowered compare with untreated control. Also, abnormal pupae or adult rate were increased. Gaseous $ClO_2$ treatment induced insecticidal reactive oxygen species (ROS), and it resulted in fatal oxidative stress in P. interpunctella. Taken together, these results showed that exposure proper concentration and time of the gas control all stages of P. interpunctella by inducing fatal oxidative stress. Further studies will be required to apply the gas treatment under real-world condition and to understanding physiological reaction in P. interpunctella caused by oxidative stress.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.543-552
• /
• 2005

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. The disk-based spatial indexing techniques, however, cannot direct apply to main memory databases, because the main purpose of disk-based techniques is to reduce the number of disk accesses. In main memory-based indexing techniques, the node access time is much faster than that in disk-based indexing techniques, because all index nodes reside in a main memory. Unlike disk-based index techniques, main memory-based spatial indexing techniques must reduce key comparing time as well as node access time. In this paper, we propose an efficient spatial index structure for main memory-based databases, called Tmr-tree. Tmr-tree integrates the characteristics of R-tree and T-tree. Therefore, Nodes of Tmr-tree consist of several entries for data objects, main memory pointers to left and right child, and three additional fields. First is a MBR of a self node, which tightly encloses all data MBRs (Minimum Bounding Rectangles) in a current node, and second and third are MBRs of left and right sub-tree, respectively. Because Tmr-tree needs not to visit all leaf nodes, in terms of search time, proposed Tmr-tree outperforms R-tree in our experiments. As node size is increased, search time is drastically decreased followed by a gradual increase. However, in terms of insertion time, the performance of Tmr-tree was slightly lower than R-tree.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.451-460
• /
• 2005

We present a methodology to design energy-efficient data paths using FPGAs. Our methodology integrates domain specific modeling, coarse-grained performance evaluation, design space exploration, and low-level simulation to understand the tradeoffs between energy, latency, and area. The domain specific modeling technique defines a high-level model by identifying various components and parameters specific to a domain that affect the system-wide energy dissipation. A domain is a family of architectures and corresponding algorithms for a given application kernel. The high-level model also consists of functions for estimating energy, latency, and area that facilitate tradeoff analysis. Design space exploration(DSE) analyzes the design space defined by the domain and selects a set of designs. Low-level simulations are used for accurate performance estimation for the designs selected by the DSE and also for final design selection We illustrate our methodology using a family of architectures and algorithms for matrix multiplication. The designs identified by our methodology demonstrate tradeoffs among energy, latency, and area. We compare our designs with a vendor specified matrix multiplication kernel to demonstrate the effectiveness of our methodology. To illustrate the effectiveness of our methodology, we used average power density(E/AT), energy/(area x latency), as themetric for comparison. For various problem sizes, designs obtained using our methodology are on average $25\%$ superior with respect to the E/AT performance metric, compared with the state-of-the-art designs by Xilinx. We also discuss the implementation of our methodology using the MILAN framework.

• Geophysics and Geophysical Exploration
• /
• v.17 no.4
• /
• pp.231-241
• /
• 2014

Recently, single channel seismic survey for engineering purpose have been used widely taking advantage of simple processing. However it is very difficult to obtain high fidelity subsurface image by single channel seismic due to insufficient fold coverage. Recently, seismic waveform inversion in multi channel seismic survey is utilized for accurate subsurface imaging even in complex terrains. In this paper, we propose the seismic waveform inversion algorithm for velocity model building using a single channel seismic data. We utilize the Gauss-Newton method and assume that subsurface model is 1-Dimensional. Seismic source estimation technique is used and offset effect is also corrected by removing delay time by offset. Proposed algorithm is verified by applying modified Marmousi2 model, and applied to field data set obtained in port of Busan.

• The KIPS Transactions:PartD
• /
• v.17D no.2
• /
• pp.129-146
• /
• 2010

Nowadays, XML has been favored by many companies internally and externally as a means of sharing and distributing data. there are many researches and systems for modeling and storing XML documents by an object-oriented method as for the method of saving and managing web-based multimedia document more easily. The representative tool for the object-oriented modeling of XML documents is UML (Unified Modeling Language). UML at the beginning was used as the integrated methodology for software development, but now it is used more frequently as the modeling language of various objects. Currently, UML supports various diagrams for object-oriented analysis and design like class diagram and is widely used as a tool of creating various database schema and object-oriented codes from them. This paper proposes an Efficinet Query Modelling of XML-GL using the UML class diagram and OCL for searching XML document which its application scope is widely extended due to the increased use of WWW and its flexible and open nature. In order to accomplish this, we propose the modeling rules and algorithm that map XML-GL. which has the modeling function for XML document and DTD and the graphical query function about that. In order to describe precisely about the constraint of model component, it is defined by OCL (Object Constraint Language). By using proposed technique creates a query for the XML document of holding various properties of object-oriented model by modeling the XML-GL query from XML document, XML DTD, and XML query while using the class diagram of UML. By converting, saving and managing XML document visually into the object-oriented graphic data model, user can prepare the base that can express the search and query on XML document intuitively and visually. As compared to existing XML-based query languages, it has various object-oriented characteristics and uses the UML notation that is widely used as object modeling tool. Hence, user can construct graphical and intuitive queries on XML-based web document without learning a new query language. By using the same modeling tool, UML class diagram on XML document content, query syntax and semantics, it allows consistently performing all the processes such as searching and saving XML document from/to object-oriented database.